Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "from sys import stdin, stdout\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nl = [0] * n\r\no = list(range(1, n+1))\r\nfor i in range(n):\r\n if a[i] == b[i]:\r\n l[i] = a[i]\r\n o.pop(o.index(a[i]))\r\n\r\nu = 0\r\npl = list(l)\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n l[i] = o[u]\r\n u += 1\r\n \r\nda, db = 0, 0\r\nfor f in range(n):\r\n if a[f] != l[f]:\r\n da+=1\r\n if b[f] != l[f]:\r\n db+=1\r\n \r\nif da > 1 or db > 1:\r\n u = len(o) - 1\r\n for i in range(n):\r\n if a[i] != b[i]:\r\n pl[i] = o[u]\r\n u -= 1\r\n l = list(pl)\r\nfor j in l:\r\n stdout.write(str(j) + \" \")\r\nprint()\r\n \r\n \r\n\r\n", "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\ncontain = [1 for i in range(n)]\nfail = []\nres = []\nfor i, j in zip(a, b):\n\tif i == j:\n\t\tcontain[i - 1] = 0\n\t\tres.append(i)\n\telse:\n\t\tfail.append((i, j))\n\t\tres.append(0)\nfalta = []\nfor i in range(n):\n\tif contain[i] == 1:\n\t\tfalta.append(i + 1)\n\n#print(falta)\n#print(fail)\n#print(res)\nif len(falta) == 1:\n\tfor i in range(len(res)):\n\t\tif res[i] == 0:\n\t\t\tres[i] = falta[0]\nelif len(falta) == 2:\n\tif fail[0][0] == falta[0] and fail[1][1] == falta[1]:\n\t\tfor i in falta:\n\t\t\tfor j in range(len(res)):\n\t\t\t\tif res[j] == 0:\n\t\t\t\t\tres[j] = i\n\t\t\t\t\tbreak\n\n\telif fail[0][0] == falta[1] and fail[1][1] == falta[0]:\n\t\ti = 1\n\t\twhile i >= 0:\n\t\t\tfor j in range(len(res)):\n\t\t\t\tif res[j] == 0:\n\t\t\t\t\tres[j] = falta[i]\n\t\t\t\t\ti -= 1\n\t\t\t\t\tbreak\n\telif fail[0][1] == falta[0] and fail[1][0] == falta[1]:\n\t\tfor i in falta:\n\t\t\tfor j in range(len(res)):\n\t\t\t\tif res[j] == 0:\n\t\t\t\t\tres[j] = i\n\t\t\t\t\tbreak\n\n\telif fail[0][1] == falta[1] and fail[1][0] == falta[0]:\n\t\ti = 1\n\t\twhile i >= 0:\n\t\t\tfor j in range(len(res)):\n\t\t\t\tif res[j] == 0:\n\t\t\t\t\tres[j] = falta[i]\n\t\t\t\t\ti -= 1\n\t\t\t\t\tbreak\nres = list(map(str, res))\nprint(' '.join(res))", "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ncnt = 0\nnot_equals = []\nfor i in range(n):\n if a[i] != b[i]:\n not_equals.append(i)\nif len(not_equals) == 1:\n x = 1\n while x <= n and x in a and x in b:\n x += 1\n a[not_equals[0]] = x\n print(*a)\nelse:\n a2 = [elem for elem in a]\n a2[not_equals[0]] = b[not_equals[0]]\n if sorted(a2) == [i for i in range(1, n + 1)]:\n print(*a2)\n else:\n a2 = [elem for elem in a]\n a2[not_equals[1]] = b[not_equals[1]]\n print(*a2)\n", "n = int(input())\na = input().split()\nb = input().split()\na = [int(i) for i in a]\nb = [int(i) for i in b]\n\ncounter = [-1 for i in range(n)]\n\nk_a = 0\nk_a_i1, k_a_i2 = -1, -1\n\nfor i in range(n):\n if counter[a[i] - 1] != -1:\n k_a = a[i]\n k_a_i1, k_a_i2 = counter[a[i] - 1], i\n counter[a[i] - 1] = i\ng_a = counter.index(-1) + 1\n\ncounter = [-1 for i in range(n)]\n\nk_b = 0\nk_b_i1, k_b_i2 = -1, -1\n\nfor i in range(n):\n if counter[b[i] - 1] != -1:\n k_b = b[i]\n k_b_i1, k_b_i2 = counter[b[i] - 1], i\n counter[b[i] - 1] = i\n\ng_b = counter.index(-1) + 1\n\nres = a.copy()\nres[k_a_i1] = g_a\n\nc_a = 0\nc_b = 0\n\nfor i in range(n):\n if res[i] != a[i]:\n c_a += 1\n if res[i] != b[i]:\n c_b += 1\n\nif c_a == 1 and c_b == 1:\n out = ''\n for i in res:\n out += str(i) + ' '\n print(out)\n exit()\n\nres = a.copy()\nres[k_a_i2] = g_a\n\nc_a = 0\nc_b = 0\n\nfor i in range(n):\n if res[i] != a[i]:\n c_a += 1\n if res[i] != b[i]:\n c_b += 1\n\nif c_a == 1 and c_b == 1:\n out = ''\n for i in res:\n out += str(i) + ' '\n print(out)\n exit()\n\nres = a.copy()\nres[k_b_i1] = g_b\n\nc_a = 0\nc_b = 0\n\nfor i in range(n):\n if res[i] != a[i]:\n c_a += 1\n if res[i] != b[i]:\n c_b += 1\n\nif c_a == 1 and c_b == 1:\n out = ''\n for i in res:\n out += str(i) + ' '\n print(out)\n exit()\n\nres = a.copy()\nres[k_b_i2] = g_b\n\nc_a = 0\nc_b = 0\n\nfor i in range(n):\n if res[i] != a[i]:\n c_a += 1\n if res[i] != b[i]:\n c_b += 1\n\nif c_a == 1 and c_b == 1:\n out = ''\n for i in res:\n out += str(i) + ' '\n print(out)\n exit()\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "from sys import stdout\r\nfrom sys import stdin\r\ndef get():\r\n return stdin.readline().strip()\r\ndef getf():\r\n return [int(i) for i in get().split()]\r\ndef put(a, end = \"\\n\"):\r\n stdout.write(str(a) + end)\r\ndef putf(a, sep = \" \", end = \"\\n\"):\r\n stdout.write(sep.join(map(str, a)) + end)\r\n\r\ndef main():\r\n n = int(get())\r\n a, b = getf(), getf()\r\n p = []\r\n x = []\r\n s = set(range(1, n + 1))\r\n for i in range(n):\r\n if(a[i] == b[i]):\r\n p.append(a[i])\r\n s.remove(a[i])\r\n else:\r\n p.append(0)\r\n x.append(i)\r\n if(len(x) == 2):\r\n p1, p2 = p*1, p*1\r\n p1[x[0]] = min(s)\r\n p1[x[1]] = max(s)\r\n p2[x[1]] = min(s)\r\n p2[x[0]] = max(s)\r\n f1 = 2\r\n f2 = 2\r\n for i in range(n):\r\n if(p1[i] != a[i]):\r\n f1 -= 1\r\n if(p1[i] != b[i]):\r\n f2 -= 1\r\n if(f1 > 0 and f2 > 0):\r\n putf(p1)\r\n else:\r\n putf(p2)\r\n else:\r\n p[x[0]] = max(s)\r\n putf(p)\r\nmain()\r\n", "N = int(input())\r\na = [int(item) for item in input().split()]\r\nb = [int(item) for item in input().split()]\r\n\r\nans = list(a)\r\ndiff = [ i for i, item in enumerate(a) if item != b[i] ]\r\n\r\nfor i in diff:\r\n ans[i] = -1\r\n\r\nnot_exist = [ item for item in range(1, N + 1) if item not in ans ]\r\n\r\nif len(not_exist) == 1:\r\n ans[diff[0]] = not_exist[0]\r\nelse:\r\n p1, p2 = diff\r\n it1, it2 = not_exist\r\n if [a[p1], b[p2]] == [it1, it2] or [b[p1], a[p2]] == [it1, it2]:\r\n ans[p1] = it1\r\n ans[p2] = it2\r\n else:\r\n ans[p1] = it2\r\n ans[p2] = it1\r\n\r\nprint(' '.join(map(str, ans)))\r\n", "def test(ans,a,b):\r\n ca=0\r\n cb=0\r\n for i in range(len(ans)):\r\n if ans[i]!=a[i]:\r\n ca+=1\r\n if ans[i]!=b[i]:\r\n cb+=1\r\n if ca==1 and cb==1:\r\n return True\r\n return False\r\nn=int(input())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nans=[0]*n\r\nt=[]\r\nfor i in range(n):\r\n if a[i]==b[i]:\r\n ans[i]=b[i]\r\n \r\n else:\r\n t.append(i)\r\nl=set(list(range(1,n+1)))\r\nk=set(ans)\r\nk=list(l-k)\r\nwhile 0 in k:\r\n k.remove(0)\r\nif len(t)==1:\r\n ans[t[0]]=k[0]\r\n print(*ans)\r\nelif len(t)==2:\r\n ans[t[0]]=k[0]\r\n ans[t[1]]=k[1]\r\n if test(ans,a,b):\r\n print(*ans)\r\n else:\r\n ans[t[0]]=k[1]\r\n ans[t[1]]=k[0]\r\n print(*ans)\r\n \r\n \r\n ", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\n\nn = int(input())\n\na = list(rint())\nb = list(rint())\n\nii = []\nfor i in range(n):\n if a[i] != b[i]:\n ii.append(i)\n\nif len(ii) == 2:\n if a[ii[0]] != a[ii[1]]:\n c = a[:]\n else:\n c = b[:]\n if c.count(c[ii[0]]) == 2:\n iii = ii[0]\n else:\n iii = ii[1]\nelse:\n c = a[:]\n iii = ii[0]\n\n\nfor i in range(n):\n if not i+1 in c:\n c[iii] = i+1\n print(*c)\n exit()\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = [0]*n\r\nd = [False]*n\r\nbad = []\r\nneed = []\r\nfor i in range(n):\r\n if a[i] == b[i]:\r\n d[a[i]-1] = True\r\n c[i] = a[i]\r\n else:\r\n bad.append(i)\r\nfor i in range(n):\r\n if not d[i]:\r\n need.append(i+1)\r\n\r\nd = False\r\n\r\ndef good(c):\r\n global a, b\r\n al = 0\r\n bl = 0\r\n for i in range(len(c)):\r\n if c[i] != a[i]:\r\n al += 1\r\n if c[i] != b[i]:\r\n bl += 1\r\n if al == 1 and bl == 1:\r\n for i in range(len(c)):\r\n for j in range(len(c)):\r\n if i != j and c[i] == c[j]:\r\n return False\r\n else:\r\n return False\r\n return True\r\nfc = []\r\ndo = False\r\ndef f(b, n, c):\r\n global do, fc\r\n #print(b, n, c, do)\r\n if not do:\r\n if len(b) == 0 and good(c):\r\n do = True\r\n fc = c\r\n #print(fc)\r\n else:\r\n for i in range(len(b)):\r\n for j in range(len(n)):\r\n nc = c+[]\r\n nc[b[i]] = n[j]\r\n f(b[:i]+b[i+1:]+[], n[:j]+n[j+1:]+[], nc)\r\n\r\nf(bad, need, c)\r\nfor i in fc:\r\n print(i ,end=' ')", "if __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n ans_list = [-3 for i in range(n)]\r\n\r\n mismatch_count = 0\r\n ans_set = set([])\r\n for i in range(0, n):\r\n if a[i] == b[i]:\r\n ans_list[i] = a[i]\r\n ans_set.add(a[i])\r\n else:\r\n mismatch_count += 1\r\n ans_list[i] += mismatch_count\r\n\r\n one_to_n_set = set([i for i in range(1, n + 1)])\r\n add_set = one_to_n_set.difference(ans_set)\r\n if mismatch_count == 1:\r\n ans_list[ans_list.index(-2)] = add_set.pop()\r\n else:\r\n tmp1 = ans_list.index(-2)\r\n tmp2 = ans_list.index(-1)\r\n ele1 = add_set.pop()\r\n ele2 = add_set.pop()\r\n if ele1 == a[tmp1] and ele2 == b[tmp2]:\r\n ans_list[tmp1] = ele1\r\n ans_list[tmp2] = ele2\r\n elif ele1 == a[tmp2] and ele2 == b[tmp1]:\r\n ans_list[tmp2] = ele1\r\n ans_list[tmp1] = ele2\r\n elif ele2 == a[tmp1] and ele1 == b[tmp2]:\r\n ans_list[tmp1] = ele2\r\n ans_list[tmp2] = ele1\r\n elif ele2 == a[tmp2] and ele1 == b[tmp1]:\r\n ans_list[tmp2] = ele2\r\n ans_list[tmp1] = ele1\r\n\r\n for i in range(0, n):\r\n print(ans_list[i], end=' ')\r\n", "n = int(input())\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\n\r\ntot = 0\r\n\r\ndone = [False for i in range(n+1)]\r\n\r\nfor i in range(n):\r\n\tif(l1[i]!=l2[i]):\r\n\t\ttot+=1\r\n\telse:\r\n\t\tdone[l1[i]] = True\r\n\r\nans = []\r\nif(tot==1):\r\n\tfor i in range(n):\r\n\t\tif(l1[i]==l2[i]):\r\n\t\t\tans.append(l2[i])\r\n\t\telse:\r\n\t\t\tfor j in range(1,n+1):\r\n\t\t\t\tif(done[j]==False and l1[i]!=j and l2[i]!=j):\r\n\t\t\t\t\tans.append(j)\r\n\t\t\t\t\tbreak\r\nelif(tot==2):\r\n\tl = []\r\n\tfor i in range(n):\r\n\t\tif(l1[i]==l2[i]):\r\n\t\t\tans.append(l2[i])\r\n\t\telse:\r\n\t\t\tans.append(0)\r\n\t\t\tl.append(i)\r\n\r\n\tok = True\r\n\t_ans = ans\r\n\tfor i in range(1,n+1):\r\n\t\tif(done[i]==False):\r\n\t\t\tif(ok==True):\r\n\t\t\t\t_ans[l[0]] = i\r\n\t\t\t\tok = False\r\n\t\t\telse:\r\n\t\t\t\t_ans[l[1]] = i\r\n\tdiff1 = 0\r\n\tdiff2 = 0\r\n\tfor i in range(n):\r\n\t\tif(_ans[i]!=l1[i]):\r\n\t\t\tdiff1+=1\r\n\t\tif(_ans[i]!=l2[i]):\r\n\t\t\tdiff2+=1\r\n\tif(diff1==1 and diff2==1):\r\n\t\tans = _ans\r\n\telse:\r\n\t\tok = True\r\n\t\t_ans = ans\r\n\t\tfor i in range(1,n+1):\r\n\t\t\tif(done[i]==False):\r\n\t\t\t\tif(ok==True):\r\n\t\t\t\t\t_ans[l[1]] = i\r\n\t\t\t\t\tok = False\r\n\t\t\t\telse:\r\n\t\t\t\t\t_ans[l[0]] = i\r\n\t\tans = _ans\r\nfor i in ans:\r\n\t\tprint(i,end=\" \")\r\n", "import sys\n\nn = int(input())\n\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\n\np1, p2, p3, p4 = [], [], [], []\n\ncur = 0\nfor i in range(n):\n if a[i] == b[i]:\n for p in (p1, p2, p3, p4):\n p.append(a[i])\n elif cur == 0:\n p1.append(a[i])\n p2.append(a[i])\n p3.append(b[i])\n p4.append(b[i])\n cur += 1\n else:\n p1.append(a[i])\n p2.append(b[i])\n p3.append(a[i])\n p4.append(b[i])\n\nfor p in (p1, p2, p3, p4):\n if len(set(p)) == n:\n print(' '.join(str(x) for x in p))\n sys.exit(0)\n\nfor p in (p1, p2, p3, p4):\n if len(set(p)) == n - 1:\n distinct = 0\n dpos = 0\n for i, (x, y) in enumerate(zip(p, a)):\n if x != y:\n distinct += 1\n dpos = i\n if distinct == 1:\n unused = 1\n while unused in p:\n unused += 1\n pp = list(p)\n pp[dpos] = unused\n print(' '.join(str(x) for x in pp))\n sys.exit(0)\n\nassert False\n", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\n'''\r\ndiffs =[]\r\nmiss = set(list(range(1,n+1)))\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n diffs.append(i)\r\n miss.discard(a[i])\r\n\r\nif len(diffs) == 1:\r\n # no other option\r\n a[diffs[0]] = list(miss)[0]\r\nelse:\r\n # must be 2\r\n if {a[diffs[0]],b[diffs[1]]} == miss:\r\n a[diffs[1]] = b[diffs[1]]\r\n else:\r\n a[diffs[0]] = b[diffs[0]]\r\n'''\r\n\r\ntwo = -1\r\nmissing = -1\r\n\r\ncounts = [[] for i in range(n+1)]\r\nfor i in range(n):\r\n counts[a[i]].append(i)\r\n if len(counts[a[i]]) == 2:\r\n two = a[i]\r\n\r\nfor i in range(1,n+1):\r\n if len(counts[i]) == 0:\r\n missing = i\r\n break\r\n\r\ndef diff(a,b):\r\n diffs = 0\r\n for i in range(n):\r\n diffs += a[i]!=b[i]\r\n return diffs\r\n\r\nfor i in range(2):\r\n perm = a.copy()\r\n perm[counts[two][i]] = missing\r\n\r\n if diff(perm,b) == 1:\r\n print(*perm)\r\n break", "from collections import Counter\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\na_cntr = Counter(a)\r\nextra = a_cntr.most_common(1)[0][0]\r\nmissing = min(set(range(1,n+1)) - set(a))\r\nb_cntr = Counter(b)\r\nlast_extra = []\r\nmatched = False\r\nfor i in range(n):\r\n if a[i] == extra:\r\n last_extra.append(i)\r\n if b[i] == missing:\r\n a[i] = missing\r\n matched = True\r\n break\r\nif not matched:\r\n for x in last_extra:\r\n if b[x] != a[x]:\r\n a[x] = missing\r\n matched = True\r\n break\r\nif not matched:\r\n a[last_extra[0]] = missing\r\n\r\nprint(*a)", "from collections import Counter\nn = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ncounta = Counter(a)\ncountb = Counter(b)\nab = [0]*n\nfor i in range(n):\n if a[i] == b[i]: ab[i] =a[i]\n\n#print(ab)\ntest = set(list(range(1,n+1)))\n#abtup = set([])\nfor i in range(n):\n setab = set(ab)\n realtest = test - setab\n\n if ab[i] == 0:\n if a[i] in setab and b[i] in setab:\n if len(realtest) != 0:\n ab[i] = realtest.pop()\n \n elif a[i] in setab:\n ab[i] = b[i]\n elif b[i] in setab:\n ab[i] = a[i]\n else:\n if counta[a[i]] > 1 and countb[b[i]] > 1:\n if len(realtest) != 0:\n ab[i] = realtest.pop()\n else:\n ab[i] = a[i]\n elif counta[a[i]] > 1 and not countb[b[i]] > 1:\n ab[i] = b[i]\n elif not counta[a[i]] > 1 and countb[b[i]] > 1:\n ab[i] = a[i]\n \nprint(\" \".join(list(map(str,ab))))\n\n\n\n\n", "n=int(input())\r\np=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\no=[]\r\noo=[]\r\nfor i in range(n):\r\n if p.count(p[i])>1:\r\n o.append(i)\r\n if p.count(i+1)==0:\r\n z=i+1\r\n if l.count(l[i])>1:\r\n oo.append(i)\r\n if l.count(i+1)==0:\r\n d=i+1\r\nm=p[:]\r\nm[o[0]]=z\r\nmm=p[:]\r\nmm[o[1]]=z\r\nu=l[:]\r\nu[oo[0]]=d\r\nuu=l[:]\r\nuu[oo[1]]=d\r\nif m[:]==u[:]:\r\n result=m[:]\r\nelif m[:]==uu[:]:\r\n result=m[:]\r\nelif uu[:]==mm[:]:\r\n result=mm[:]\r\nelif u[:]==mm[:]:\r\n result=mm[:]\r\nfor i in range(n):\r\n print(result[i],end=' ')\r\n \r\n", "n = int(input())\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\n\ncerto = [0] * (n + 1)\nres = [-1] * n\n\nfor i in range(n):\n if a[i] == b[i]:\n certo[a[i]] = 1\n res[i] = a[i]\n\ntrocando = True\nwhile trocando:\n trocando = False\n for i in range(n):\n if certo[a[i]] and not certo[b[i]]:\n certo[b[i]] = 1\n res[i] = b[i]\n trocando = True\n elif certo[b[i]] and not certo[a[i]]:\n certo[a[i]] = 1\n res[i] = a[i]\n trocando = True\n\nfor i in range(n):\n if certo[a[i]] and not certo[b[i]]:\n certo[b[i]] = 1\n res[i] = b[i]\n elif certo[b[i]] and not certo[a[i]]:\n certo[a[i]] = 1\n res[i] = a[i]\n elif not certo[a[i]] and not certo[b[i]]:\n certo[a[i]] = 1\n res[i] = a[i]\n\nfor i in range(n):\n if res[i] == -1:\n for j in range(1, n+1):\n if certo[j] == 0:\n certo[j] = 1\n res[i] = j\n break\n\n# print(certo)\nprint(*res)\n", "size = int(input())\na = [int(elem) for elem in input().split()]\nb = [int(elem) for elem in input().split()]\n\nright = []\na_remain = []\nb_remain = []\ncand = []\nfor idx in range(size):\n if a[idx] == b[idx]:\n right.append(a[idx])\n else:\n right.append(0)\n a_remain.append(a[idx])\n b_remain.append(b[idx])\n\nfor elem in range(1, size+1):\n if elem not in right:\n cand.append(elem)\n\ndef diff(seq_a, seq_b):\n if (seq_a[0] == seq_b[0] and seq_a[1] != seq_b[1]) or \\\n (seq_a[0] != seq_b[0] and seq_a[1] == seq_b[1]):\n return True\n else:\n return False\n\ndef replace(original, pattern):\n pos = 0\n for idx, elem in enumerate(original):\n if elem == 0:\n original[idx] = pattern[pos]\n pos += 1\n return [str(elem) for elem in original]\n\nif len(cand) == 1:\n print(' '.join(replace(right, cand)))\nelif diff(cand, a_remain) and diff(cand, b_remain):\n print(' '.join(replace(right, cand)))\nelse:\n cand.reverse()\n print(' '.join(replace(right, cand)))\n", "import sys\r\n\r\ndef check(a, b, c):\r\n ctr1 = 0\r\n ctr2 = 0\r\n for i in range(len(a)):\r\n if (a[i] != b[i]):\r\n ctr1 += 1\r\n if (a[i] != c[i]):\r\n ctr2 += 1\r\n if (ctr1 == 1 and ctr2 == 1):\r\n return 1\r\n return 0\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans1 = a[:]\r\nans2 = a[:]\r\nctr = 0\r\nids = []\r\nused = [0] * (n + 1)\r\nfor i in range(n):\r\n if (used[a[i]]):\r\n ids.append(i)\r\n ids.append(a.index(a[i]))\r\n used[a[i]] = 1\r\nno = 0\r\nfor i in range(1, n + 1):\r\n if (not used[i]):\r\n no = i\r\n break\r\n#print(no, *ids)\r\nans1[ids[0]] = no\r\nans2[ids[1]] = no\r\n#print(*ans1)\r\n#print(*ans2)\r\nif check(ans1, a, b):\r\n print(*ans1)\r\nelif check(ans2, a, b):\r\n print(*ans2)\r\nelse:\r\n sys.exit(1)\r\n", "# t = int(input())\nt = 1\n\nfrom math import sqrt, floor, ceil\nfrom collections import Counter\n\n\ndef cp():\n n = int(input())\n lst1 = list(map(int,input().split()))\n lst2 = list(map(int,input().split()))\n seen = set()\n ans = []\n diff = []\n for i in range(n):\n if lst1[i] == lst2[i]:\n ans.append(lst1[i])\n seen.add(lst1[i])\n else:\n # diff.append()\n ans.append(0)\n \n diff = set([\n i+1 for i in range(n)\n ]).difference(seen)\n diff = list(diff)\n ans2 = ans.copy()\n index = 0\n\n for i in range(n):\n if ans[i] == 0:\n ans[i] = diff[index]\n # ans2[i] = diff[]\n index += 1\n for i in range(n):\n if ans2[i] == 0:\n ans2[i] = diff[index-1]\n index -= 1\n \n count1 = 0\n count2 = 0\n for i in range(n):\n if ans[i] != lst1[i]:\n count1 += 1\n if count1>1:\n for val in ans2:\n print(val, end=' ')\n print()\n return\n\n for i in range(n):\n if ans[i] != lst2[i]:\n count2 += 1\n \n if count2 > 1:\n for val in ans2:\n print(val, end=' ')\n print()\n return\n\n for val in ans:\n print(val, end=' ')\n \n print()\n\n\n\n \n \n\nfor _ in range(t):\n cp()\n\n\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ns = {i:0 for i in range(1,n+1)}\r\nq,w,d,f = -1,-1,-1,-1\r\nfor i in range(n):\r\n x = a[i]\r\n if s[x]==0:\r\n s[x]=1\r\n else:\r\n q = x\r\n d = i\r\nfor i in range(n):\r\n if a[i]==q:\r\n if w==-1:\r\n w = i\r\n if s[i+1]==0:\r\n f = i+1\r\np1 = list(a)\r\np2 = list(a)\r\np1[w]=f\r\np2[d]=f\r\nk = 0\r\nfor i in range(n):\r\n if p1[i]!=b[i]:\r\n k+=1\r\nif k==1:\r\n print(*p1)\r\nelse:\r\n print(*p2)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nind = []\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n ind.append(i)\r\nres = []\r\nrofl = [0] * (n + 1)\r\ncnt = 0\r\nfor i in range(n):\r\n if a[i] == b[i]:\r\n res.append(a[i])\r\n rofl[a[i]] += 1\r\n else:\r\n cnt += 1\r\n res.append(-1)\r\nkek = []\r\nfor j in range(1, n + 1):\r\n if rofl[j] == 0:\r\n kek.append(j)\r\nif cnt == 1:\r\n for i in range(n):\r\n if res[i] == -1:\r\n res[i] = kek[0]\r\n print(*res)\r\n exit(0)\r\nflag = False\r\nflag1 = False\r\nres1 = res.copy()\r\nfor i in range(n):\r\n if res[i] == -1:\r\n if a[i] in kek and not flag:\r\n res[i] = a[i]\r\n flag = True\r\n else:\r\n res[i] = b[i]\r\n if b[i] in kek:\r\n flag1 = True\r\nif flag1:\r\n print(*res)\r\nelse:\r\n flag = False\r\n flag1 = False\r\n res = res1.copy()\r\n for i in range(n):\r\n if res[i] == -1:\r\n if b[i] in kek and not flag:\r\n res[i] = b[i]\r\n flag = True\r\n else:\r\n res[i] = a[i]\r\n if a[i] in kek:\r\n flag1 = True\r\n print(*res)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nk=0\r\nfor i in range(n) :\r\n if l[i]!=l1[i] :\r\n k=k+1\r\nassert(k<=2)\r\nif k%2==0 :\r\n for i in range(n) :\r\n if l[i]!=l1[i] and l.count(l[i])>1 and l1[i] not in l :\r\n l[i]=l1[i]\r\nelse :\r\n for i in range(n) :\r\n if l[i]!=l1[i] :\r\n for j in range(1,n+1) :\r\n if j not in l :\r\n l[i]=j\r\n break\r\nprint(*l)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\nperm = [-1 for i in range(n)]\r\navail = set()\r\n\r\nfor i in range(1,n+1):\r\n avail.add(i)\r\n\r\nfor i in range(n):\r\n if a[i] == b[i]:\r\n avail.remove(a[i])\r\n perm[i] = a[i]\r\n\r\ndef difference(seq1, seq2):\r\n count = 0\r\n for i in range(len(seq1)):\r\n if seq1[i] != seq2[i]:\r\n count += 1\r\n if count > 1:\r\n return 0\r\n return 1\r\n\r\ndef solve(seq, curravail):\r\n if not curravail:\r\n if difference(seq, a) == 1 and difference(seq, b) == 1:\r\n return seq\r\n for i in range(len(seq)):\r\n if (seq[i] == -1):\r\n for item in list(curravail):\r\n newseq = list(seq)\r\n newseq[i] = item\r\n newset = set(curravail)\r\n newset.remove(item)\r\n if solve(newseq, newset):\r\n return solve(newseq, newset)\r\n\r\nprint(\" \".join(map(str,solve(perm,avail))))", "n=int(input())\r\na=[i for i in map(int,input().split())]\r\nb=[j for j in map(int,input().split())]\r\n\r\nc = [1] + [0] * n\r\nfor i in a:\r\n c[i] += 1\r\nd, e = c.index(0), c.index(2)\r\ne1 = a.index(e)\r\ne2 = a.index(e, e1 + 1)\r\na[e1 if b[e1] == d or b[e2] == e else e2] = d\r\n\r\nprint(' '.join(map(str, a)))", "m=1000000007\r\n#------------------------------------#\r\nn=int(input())\r\nL1=list(map(int,input().split()))\r\nL2=list(map(int,input().split()))\r\nL3=[False]*n\r\nnum=0\r\nindex=[]\r\nfor i in range(n):\r\n if L1[i]!=L2[i]:\r\n index.append(i)\r\n num+=1\r\n continue\r\n L3[L1[i]-1]=True\r\nif(num)==1:\r\n for i in range(n):\r\n if L3[i]==False:\r\n L1[index[0]]=i+1\r\n break\r\nelse:\r\n if not(L3[L1[index[0]]-1]) and not(L3[L2[index[1]]-1]):\r\n L1[index[1]]=L2[index[1]]\r\n else:\r\n L1[index[0]]=L2[index[0]]\r\nfor i in range(n):\r\n print(L1[i],end=\" \")\r\n ", "import sys\r\n\r\ndef main():\r\n n=int(sys.stdin.readline().rstrip())\r\n a=list(map(int,sys.stdin.readline().split()))\r\n b=list(map(int,sys.stdin.readline().split()))\r\n \r\n items=set(range(1,n+1))\r\n coords=[]\r\n p=[-1]*n\r\n \r\n for i in range(n):\r\n if a[i]==b[i]:\r\n items.remove(a[i])\r\n p[i]=a[i]\r\n else:\r\n coords.append(i)\r\n \r\n items=list(items)\r\n \r\n if len(coords)==1:\r\n p[coords[0]]=items[0]\r\n else:\r\n adelta=0\r\n bdelta=0\r\n for k,coord in enumerate(coords):\r\n if items[k]!=a[coord]: adelta+=1\r\n if items[k]!=b[coord]: bdelta+=1\r\n p[coord]=items[k]\r\n if not (adelta==1 and bdelta==1):\r\n adelta=0\r\n bdelta=0\r\n for k,coord in enumerate(reversed(coords)):\r\n if items[k]!=a[coord]: adelta+=1\r\n if items[k]!=b[coord]: bdelta+=1\r\n p[coord]=items[k]\r\n \r\n sys.stdout.write(' '.join(map(str,p))+'\\n')\r\n \r\nmain()\r\n\r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\n\r\ndef process(A, B):\r\n n = len(A)\r\n d = [[[], []] for i in range(n+1)]\r\n for i in range(n):\r\n ai = A[i]\r\n d[ai][0].append(i)\r\n bi = B[i]\r\n d[bi][1].append(i)\r\n answer = [None for i in range(n)]\r\n used = [0 for i in range(n+1)]\r\n extra = []\r\n for i in range(1, n+1):\r\n if len(d[i][0])==1:\r\n i1 = d[i][0][0]\r\n answer[i1] = i\r\n used[i] = 1\r\n elif len(d[i][1])==1:\r\n i1 = d[i][1][0]\r\n answer[i1] = i\r\n used[i] = 1 \r\n else:\r\n extra.append(i)\r\n for i in range(n):\r\n if answer[i] is None:\r\n x = extra.pop()\r\n answer[i] = x\r\n answer = ' '.join(map(str, answer))\r\n sys.stdout.write(f'{answer}\\n')\r\n return\r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\nprocess(A, B)", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn=int(input())\r\nt=input()\r\na=list(map(int,t.strip().split()))\r\nt=input()\r\nb=list(map(int,t.strip().split()))\r\nans=a[:]\r\ndic={}\r\nx=0\r\ny=0\r\nfor i in range(n):\r\n if dic.get(a[i])==None:\r\n dic[a[i]]=1\r\n else:\r\n dic[a[i]]=2\r\nfor i in range(n):\r\n if dic.get(i+1)==None:\r\n y=i+1\r\n elif dic[i+1]==2:\r\n x=i+1\r\nfor i in range(n):\r\n if ans[i]==x:\r\n ans[i]=y\r\n cnt=0\r\n for j in range(n):\r\n if ans[j]!=b[j]:\r\n cnt+=1\r\n if cnt==1:\r\n break\r\n ans[i]=x\r\nfor i in range(n):\r\n print(ans[i],end=' ')\r\nprint()\r\n", "# 5\r\n# 5 4 5 3 1\r\n# 4 4 2 3 1\r\n\r\nfrom collections import defaultdict\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\nx = []\r\na_used = defaultdict(int)\r\nb_used = defaultdict(int)\r\nfor i in range(len(a)):\r\n a_used[a[i]] += 1\r\n b_used[b[i]] += 1\r\n if a[i] != b[i]:\r\n x.append(i)\r\nif len(x) == 2:\r\n x_done = 0\r\n while x_done < len(x):\r\n for i in range(len(x)):\r\n if a_used[a[x[i]]] > 1 and b_used[b[x[i]]] == 1:\r\n x_done += 1\r\n a_used[a[x[i]]] -= 1\r\n a[x[i]] = b[x[i]]\r\n elif a_used[a[x[i]]] == 1 and b_used[b[x[i]]] > 1:\r\n x_done += 1\r\n b_used[b[x[i]]] -= 1\r\n if x_done == 0:\r\n a[x[0]] = b[x[0]]\r\n break\r\nelse:\r\n for i in range(1, n+1):\r\n if a_used[i] == 0:\r\n a[x[0]] = i\r\n break\r\nprint(a[0], end=\"\")\r\nfor i in range(1, len(a)):\r\n print(\" \" + str(a[i]), end=\"\")", "n = int(input())\r\nai = list(map(int,input().split()))\r\nbi = list(map(int,input().split()))\r\nci = [0]*n\r\nfor i in range(n):\r\n ci[i] = ai[i]\r\nnums = [0]*n\r\nind = [0]*2\r\nj = 0\r\nnum = 0\r\nfor i in range(n):\r\n nums[ai[i]-1] += 1\r\nfor i in range(n):\r\n if nums[ai[i]-1] == 2:\r\n ind[j] = i\r\n j += 1\r\n if nums[i] == 0:\r\n num = i+1 \r\n \r\nci[ind[0]] = num\r\ndif = 0\r\ndif2 = 0\r\nfor i in range(n):\r\n if ci[i] != bi[i]:\r\n dif += 1\r\n if ci[i] != ai[i]:\r\n dif2 += 1\r\nif dif != 1 or dif2 != 1:\r\n ci[ind[0]] = ai[ind[0]]\r\n ci[ind[1]] = num\r\nfor i in range(n):\r\n print(ci[i],end=\" \")\r\n", "n=int(input())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=list(a)\nc.sort()\ntemp1=list(a)\ntemp2=list(a)\n\ndup_ind=[]\nfor k in range(n):\n\tif c[k]==c[k+1]:\n\t\tdup=c[k]\n\t\tbreak\nfor k in range(n):\n\t\tif a[k]==dup:\n\t\t\tdup_ind.append(k)\n\nfor i in range(n):\n\tif i+1 not in a:\n\t\tmis=i+1\n\t\tbreak\n\t\t\nt_a=temp1\nfor i in range(n):\n\tif a[i]==dup:\n\t\tt_a[i]=mis\n\t\tt_a=temp2\n\nch=0\nfor j in range(n):\n\tif temp1[j]!=b[j]:\n\t\tch+=1\n\tif ch==2:\n\t\tprint(*temp2)\n\t\tbreak\nelse:\n\tprint(*temp1)\n\n", "from collections import Counter\r\nn=int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nlst = [-1]*n\r\ncf = Counter(a)\r\ncs = Counter(b)\r\nmiss1=0\r\nmiss2=0\r\nfor i in range(1,n+1):\r\n if cf[i]==0:miss1=i\r\n if cs[i]==0:miss2=i\r\ns = 0\r\ncnt=0\r\nfor i in range(n):\r\n if a[i] == b[i]:\r\n lst[i] = a[i]\r\n s+=a[i]\r\n else:\r\n cnt+=1\r\nif cnt == 1:\r\n for i in range(n):\r\n if lst[i]==-1:\r\n print(((n*(n+1))//2)-s,end=\" \")\r\n else:\r\n print(lst[i],end=\" \")\r\nelif cnt == 0:\r\n for i in range(n):\r\n if cf[a[i]]!=2:\r\n print(a[i],end=\" \")\r\n else:\r\n print(miss1,end=\"\")\r\nelse:\r\n pp = []\r\n f = 0\r\n qq = []\r\n l = [miss1,miss2]\r\n for i in range(n):\r\n if lst[i]!=-1:\r\n pp.append(lst[i])\r\n qq.append(lst[i])\r\n else:\r\n if f == 0:\r\n pp.append(miss1)\r\n qq.append(miss2)\r\n f=1\r\n else:\r\n pp.append(miss2)\r\n qq.append(miss1)\r\n first = 0\r\n second = 0\r\n for i in range(n):\r\n if pp[i] not in [a[i],b[i]]:first =1\r\n if qq[i] not in [a[i],b[i]]:second=1\r\n if first == 0:\r\n print(*pp)\r\n else:\r\n print(*qq)\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\n\r\ndiff = []\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n diff.append(i)\r\nsa = True\r\nsb = True\r\ndi = []\r\nfor i in range(1,n+1):\r\n di.append(i)\r\ns = []\r\nfor i in range(n):\r\n if i not in diff:\r\n s.append(a[i])\r\n di.remove(a[i])\r\n else:\r\n s.append(0)\r\nif len(diff) == 1:\r\n s[diff[0]] = di[0]\r\nelse:\r\n if (a[diff[0]] in di and b[diff[1]] in di):\r\n s[diff[0]] = a[diff[0]]\r\n s[diff[1]] = b[diff[1]]\r\n else:\r\n s[diff[0]] = b[diff[0]]\r\n s[diff[1]] = a[diff[1]]\r\n \r\n \r\n\r\nfor i in range(n):\r\n print(s[i], end= ' ')\r\n\r\n", "read = lambda: map(int, input().split())\r\nn = int(input())\r\na = list(read())\r\nb = list(read())\r\nwa = [0] * (n + 1)\r\nwb = [0] * (n + 1)\r\nfor i in a: wa[i] += 1\r\nfor i in b: wb[i] += 1\r\nta = []\r\nfor i in range(1, n + 1):\r\n if wa[i] == 0:\r\n sa = i\r\nfor i in range(n):\r\n if wa[a[i]] == 2:\r\n ta.append(i)\r\nf = lambda p, q: sum(p[i] != q[i] for i in range(n)) == 1\r\np = a[:]\r\np[ta[0]] = sa\r\nif f(p, b): ans = p[:]\r\nelse:\r\n p = a[:]\r\n p[ta[1]] = sa\r\n if f(p, b): ans = p[:]\r\nprint(*ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nk=[0 for i in range(len(a))]\r\nm=list(range(1,len(a)+1))\r\nfor i in range(len(a)):\r\n\tif a[i]==b[i]:\r\n\t\tk[i]=a[i]\r\n\t\tm.remove(a[i])\r\n\r\nif len(m)==1:\r\n\tfor i in range(len(a)):\r\n\t\tif k[i]==0:\r\n\t\t\tk[i]=m[0]\r\nelse:\r\n\tr=[]\r\n\tfor i in range(len(a)):\r\n\t\tif k[i]==0:\r\n\t\t\tr.append(i)\r\n\tif (m[0]==a[r[0]])^(m[1]==a[r[1]]) and (m[0]==b[r[0]])^(m[1]==b[r[1]]):\r\n\t\tk[r[0]]=m[0]\r\n\t\tk[r[1]]=m[1]\r\n\telse:\r\n\t\tk[r[0]]=m[1]\r\n\t\tk[r[1]]=m[0]\r\nfor i in k:\r\n\tprint(i,end=' ')\t", "ln = int(input())\r\narr = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\nfreq = [0]*(ln)\r\nfreq2 = [0]*(ln)\r\nans = [0]*(ln)\r\nmyset = set()\r\ndiff = 0\r\nfor i in range(ln):\r\n freq2[arr[i]-1]+=1\r\n freq2[arr2[i]-1]+=1\r\n if arr[i]!=arr2[i]:\r\n diff+=1\r\n else:\r\n ans[i]=arr[i]\r\n myset.add(arr[i])\r\nif diff<=1:\r\n for i in range(ln):\r\n if i+1 not in myset:\r\n n = i+1\r\n for u in range(ln):\r\n freq[ans[u]-1]+=1\r\n if not ans[u] or freq[ans[u]-1]==2:\r\n ans[u]=n\r\n break\r\n print(*ans)\r\nelse:\r\n z = 0\r\n for i in range(ln):\r\n if arr[i] not in myset and (freq2[arr[i]-1]<=1 or arr2[i] in myset):\r\n ans[i]=arr[i]\r\n myset.add(arr[i])\r\n z+=1\r\n elif arr2[i] not in myset:\r\n freq2[arr[i]-1]=0\r\n ans[i]=arr2[i]\r\n myset.add(arr2[i])\r\n z+=1\r\n if z==2:\r\n break\r\n print(*ans)", "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nans = [0 for _ in range(n)]\nused = [False for _ in range(n + 1)]\nidx = []\nfor i in range(n):\n if a[i] == b[i]:\n ans[i] = a[i]\n used[a[i]] = True\n else:\n idx.append(i)\nunused = []\nfor i in range(1, n + 1):\n if not used[i]:\n unused.append(i)\n\nif len(unused) == 1:\n ans[idx[0]] = unused[0]\nelif (a[idx[0]] != unused[0] and a[idx[1]] != unused[1]) or (b[idx[0]] != unused[0] and b[idx[1]] != unused[1]):\n ans[idx[0]] = unused[1]\n ans[idx[1]] = unused[0]\nelse:\n ans[idx[0]] = unused[0]\n ans[idx[1]] = unused[1]\n\nprint(' '.join(map(str, ans)))\n", "import sys\r\n\r\ndef solve():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n b = [int(i) for i in input().split()]\r\n\r\n j = -1\r\n k = -1\r\n\r\n for i in range(n):\r\n if a[i] != b[i]:\r\n if j == -1:\r\n j = i\r\n else:\r\n k = i\r\n break\r\n\r\n # print(j, k)\r\n\r\n if k != -1:\r\n ans = [0] * n\r\n\r\n for i in range(n):\r\n if i != j and i != k:\r\n ans[i] = a[i]\r\n\r\n ans[j] = a[j]\r\n ans[k] = b[k]\r\n\r\n cnt = [0] * (n + 1)\r\n\r\n for i in range(n):\r\n cnt[ans[i]] += 1\r\n\r\n if all(cnti == 1 for cnti in cnt[1:]):\r\n print(*ans)\r\n else:\r\n ans[j] = b[j]\r\n ans[k] = a[k]\r\n print(*ans)\r\n else:\r\n ans = [0] * n\r\n app = [False] * (n + 1)\r\n\r\n for i in range(n):\r\n if i == j:\r\n continue\r\n\r\n app[a[i]] = True\r\n ans[i] = a[i]\r\n\r\n for i in range(1, n + 1):\r\n if not app[i]:\r\n ans[j] = i\r\n break\r\n\r\n print(*ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "n = int(input())\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\nusado = [0 for i in range(n+1)]\n\ndif = []\nfaltam = []\n\nfor i in range(n):\n\tif a[i] != b[i]:\n\t\tdif.append(i)\n\telse:\n\t\tusado[a[i]] = 1\n\nfor i in range(1,n+1):\n\tif usado[i] == 0:\n\t\tfaltam.append(i)\n\nif len(dif) == 1:\n\ta[dif[0]] = faltam[0]\n\tsaida = ''\n\tfor i in a:\n\t\tsaida+=str(i)+' '\n\tprint(saida)\n\texit()\n\nigual1 = 0\nif faltam[0] == a[dif[0]]:\n\tigual1 += 1\nif faltam[0] == b[dif[0]]:\n\tigual1 += 1\n\nigual2 = 0\nif faltam[1] == a[dif[1]]:\n\tigual2 += 1\nif faltam[1] == b[dif[1]]:\n\tigual2 += 1\n\nif (igual1 == 1 and igual2 == 1):\n\ta[dif[0]] = faltam[0]\n\ta[dif[1]] = faltam[1]\nelse:\n\ta[dif[0]] = faltam[1]\n\ta[dif[1]] = faltam[0]\n\t\n\t\nsaida = ''\nfor i in a:\n\tsaida+=str(i)+' '\n\nprint(saida)\n", "def meteors(n, ar, br):\r\n differ = []\r\n used = {}\r\n pr = []\r\n for i in range(n):\r\n if ar[i] != br[i]:\r\n pr.append(-1)\r\n differ.append((i, ar[i], br[i]))\r\n else:\r\n pr.append(ar[i])\r\n used[ar[i]] = i\r\n\r\n unused = find_unused(n, used)\r\n\r\n if len(differ) == 1:\r\n pr[differ[0][0]] = unused[0]\r\n elif len(differ) == 2:\r\n if differ[0][1] in unused and differ[0][2] in unused and differ[1][1] in unused and differ[1][2] in unused: #whatever is fine\r\n pr[differ[0][0]] = unused[0]\r\n pr[differ[1][0]] = unused[1]\r\n if differ[1][1] in unused and differ[1][2] in unused:\r\n if not differ[0][1] in unused:\r\n pr[differ[0][0]] = differ[0][2]\r\n unused.remove(differ[0][2])\r\n pr[differ[1][0]] = unused[0]\r\n else:\r\n pr[differ[0][0]] = differ[0][1]\r\n unused.remove(differ[0][1])\r\n pr[differ[1][0]] = unused[0]\r\n else:\r\n if not differ[1][1] in unused:\r\n pr[differ[1][0]] = differ[1][2]\r\n unused.remove(differ[1][2])\r\n pr[differ[0][0]] = unused[0]\r\n else:\r\n pr[differ[1][0]] = differ[1][1]\r\n unused.remove(differ[1][1])\r\n pr[differ[0][0]] = unused[0]\r\n else:\r\n pr = range(1, n + 1) # bad input\r\n\r\n return pr\r\n\r\ndef find_unused(n, used):\r\n unused = []\r\n for i in range(1, n + 1):\r\n if not i in used:\r\n unused.append(i)\r\n return unused\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input().strip())\r\n ar = list(map(int, input().strip().split()))\r\n br = list(map(int, input().strip().split()))\r\n print(\" \".join(map(str, meteors(n, ar, br))));\r\n", "from operator import eq\n\nn = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nal = [False for _ in range(n)]\nbl = [False for _ in range(n)]\n\nfor i in range(n):\n al[a[i]-1] = True\n bl[b[i]-1] = True\n\nfor i,e in enumerate(al):\n if not e:\n ak = i+1\n\nfor i,e in enumerate(bl):\n if not e:\n bk = i+1\n\naa = [(e,i) for (i,e) in enumerate(a)]\nbb = [(e,i) for (i,e) in enumerate(b)]\n\naa.sort();\nbb.sort();\n\n\nfor i in range(1,n):\n \n if (aa[i][0] == aa[i-1][0]):\n amis = aa[i][0]\n a1 = aa[i-1][1]\n a2 = aa[i][1]\n\n if (bb[i][0] == bb[i-1][0]):\n bmis = bb[i][0]\n b1 = bb[i-1][1]\n b2 = bb[i][1]\n\n\nfor ay in [a1,a2]:\n for by in [b1,b2]:\n reta = list(a)\n reta[ay] = ak\n\n retb = list(b)\n retb[by] = bk\n\n if all(map(eq, reta, retb)):\n print(\" \".join(map(str, reta)))\n exit(0)\n\n\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\np = [0] * n\r\nx = [0] * (n + 1)\r\ny = []\r\nfor i in range(n):\r\n ai, bi = a[i], b[i]\r\n if ai == bi:\r\n if not x[ai]:\r\n x[ai] = 1\r\n p[i] = ai\r\n else:\r\n y.append(i)\r\n else:\r\n y.append(i)\r\nz = []\r\nfor i in range(1, n + 1):\r\n if not x[i]:\r\n z.append(i)\r\nfor _ in range(2):\r\n for i, j in zip(y, z):\r\n p[i] = j\r\n c1 = 0\r\n for i, j in zip(a, p):\r\n c1 += min(i ^ j, 1)\r\n c2 = 0\r\n for i, j in zip(b, p):\r\n c2 += min(i ^ j, 1)\r\n if c1 == c2 == 1:\r\n break\r\n y.reverse()\r\nsys.stdout.write(\" \".join(map(str, p)))", "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(int)\r\nn=I()\r\na=L()\r\nb=L()\r\nl=[0]*n\r\nc=0\r\nx=[]\r\nfor i in range(n):\r\n if(a[i]==b[i] and d[a[i]]==0):\r\n l[i]=b[i]\r\n d[l[i]]=1\r\n else:\r\n c+=1\r\n x.append(i)\r\nif(c==1):\r\n for i in range(n):\r\n if(l[i]==0):\r\n for j in range(1,n+1):\r\n if(d[j]==0):\r\n l[i]=j\r\n break\r\n break\r\nelse:\r\n if(d[b[x[0]]]+d[a[x[0]]]):\r\n if(d[b[x[0]]]):\r\n l[x[0]]=a[x[0]]\r\n l[x[1]]=b[x[1]]\r\n elif(d[a[x[0]]]):\r\n l[x[0]]=b[x[0]]\r\n l[x[1]]=a[x[1]]\r\n elif(d[b[x[1]]]+d[a[x[1]]]):\r\n if(d[b[x[1]]]):\r\n l[x[1]]=a[x[1]]\r\n l[x[0]]=b[x[0]]\r\n elif(d[a[x[1]]]):\r\n l[x[1]]=b[x[1]]\r\n l[x[0]]=a[x[0]]\r\n else:\r\n l[x[0]]=a[x[0]]\r\n l[x[1]]=b[x[1]]\r\n \r\nprint(*l)\r\n", "n = int(input())\r\na = list(map(int , input().split()))\r\nb = list(map(int , input().split()))\r\nans = [0]*n\r\ns= list(range(1,n+1))\r\nfor i in range(n):\r\n if a[i] == b[i]:\r\n ans[i]= a[i]\r\n s.remove(a[i])\r\nfor i in range(n):\r\n if ans[i] == 0:\r\n if a[i] not in s:\r\n if b[i] in s:\r\n ans[i] = b[i]\r\n s.remove(b[i])\r\n if b[i] not in s:\r\n if a[i] in s:\r\n ans[i] = a[i]\r\n s.remove(a[i])\r\nj=0\r\nfor no in s:\r\n while ans[j]!=0:\r\n j+=1\r\n ans[j]= no\r\nprint(*ans)\r\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter\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\ndef valid(d):\r\n for i in range(1 , n +1):\r\n if i not in d :\r\n return False\r\n return True\r\n\r\ndef cnt_diff(n , a , b):\r\n cnt = 0\r\n for i in range(n):\r\n if a[i] != b[i]:\r\n cnt+=1\r\n return cnt\r\n\r\nn = INT()\r\na = LIST()\r\nb = LIST()\r\nlst1 = []\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n lst1.append(i)\r\n\r\nlst2 = []\r\nfor i in range(1 , n + 1):\r\n if i not in a :\r\n lst2.append(i)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n d = a[:]\r\n d[lst1[j]] = lst2[i]\r\n if valid(d) and cnt_diff(n , d , b) == 1 and d != b :\r\n print(*d)\r\n exit(0)\r\n\r\n\r\n\r\n", "n = int(input())\naa, bb = l = [list(map(int, input().split())) for _ in \"ab\"]\nu, v = ((set(range(1, n + 1)) - set(ab)).pop() for ab in l)\nt = [i for i in range(n) if aa[i] != bb[i]]\nfor i, j in [(i, j) for i in t for j in t]:\n a, b, aa[i], bb[j] = aa[i], bb[j], u, v\n if all(aa[k] == bb[k] for k in t):\n break\n aa[i], bb[j] = a, b\nprint(*aa)", "\r\nn = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\np = [0 for i in range(n)]\r\ndiff = []\r\n\r\nfor i in range(n):\r\n if a[i] == b[i]:\r\n p[i] = a[i]\r\n\r\n else:\r\n diff.append(i)\r\n\r\n\r\nif len(diff) == 1:\r\n diff_num = ((n*(n+1))//2) - sum(p)\r\n p[diff[0]] = diff_num\r\n\r\nelif len(diff) == 2:\r\n first, sec = diff\r\n\r\n if a[first] not in p and b[sec] not in p:\r\n p[first] = a[first]\r\n p[sec] = b[sec]\r\n\r\n elif a[sec] not in p and b[first] not in p:\r\n p[first] = b[first]\r\n p[sec] = a[sec]\r\n\r\nprint(*p)", "k=int(input())\na=[i for i in map(int,input().split())]\nb=[j for j in map(int,input().split())]\ncount=0\nps=[]\ncol=[0]*(k+1)\nfor i in range(k):\n\tif(a[i]==b[i]):\n\t\tcol[a[i]]+=1\n\telse:\n\t\tps.append(i)\n\t\tcount+=1\nif count<=1:\t\t\t\n\tfor i in range(k):\n\t\tif(a[i]==b[i]):\n\t\t\tprint(a[i],end=\" \")\n\t\telse:\n\t\t\tif col[a[i]]==0:\n\t\t\t\tprint(a[i],end=\" \")\n\t\t\t\tcol[a[i]]+=1\n\t\t\telif col[b[i]]==0:\n\t\t\t\tprint(b[i],end=\" \")\n\t\t\t\tcol[b[i]]+=1\n\t\t\telse:\n\t\t\t\tfor t in range(1,k+1):\n\t\t\t\t\tif col[t]==0:\n\t\t\t\t\t\tprint(t,end=\" \")\n\t\t\t\t\t\tcol[t]+=1\n\t\t\t\t\t\tbreak\n\nelse:\n\tflag=True\n\tfa=True\n\tfor i in range(k):\n\t\tif(a[i]==b[i]):\n\t\t\tprint(a[i],end=\" \")\n\t\telse:\n\t\t\tif flag:\n\t\t\t\tif(a[ps[0]]==a[ps[1]]):\n\t\t\t\t\tif(col[b[ps[1]]]):\n\t\t\t\t\t\tprint(b[ps[0]],end=\" \")\n\t\t\t\t\telse:\n\t\t\t\t\t\tprint(a[ps[0]],end=\" \")\n\t\t\t\t\t\tfa=False\n\n\t\t\t\telif(b[ps[0]]==b[ps[1]]):\n\t\t\t\t\tif(col[a[ps[1]]]):\n\t\t\t\t\t\tprint(a[ps[0]],end=\" \")\n\t\t\t\t\t\tfa=False\n\t\t\t\t\telse:\n\t\t\t\t\t\tprint(b[ps[0]],end=\" \")\n\t\t\t\telif col[a[i]]==0:\n\t\t\t\t\tprint(a[ps[0]],end=\" \")\n\t\t\t\t\tfa=False\n\t\t\t\telse:\n\t\t\t\t\tprint(b[ps[0]],end=\" \")\n\n\t\t\t\tflag=False\n\n\t\t\telse:\n\t\t\t\tif fa:\n\t\t\t\t\tprint(a[ps[1]],end=\" \")\n\t\t\t\telse:\n\t\t\t\t\tprint(b[ps[1]],end=\" \")", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import *\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n if a[i]!=b[i]:\r\n cnt += 1\r\n\r\nif cnt==1:\r\n ans = [-1]*n\r\n flag = [False]*(n+1)\r\n \r\n for i in range(n):\r\n if a[i]==b[i]:\r\n ans[i] = a[i]\r\n flag[a[i]] = True\r\n \r\n for i in range(n):\r\n if ans[i]==-1:\r\n for j in range(1, n+1):\r\n if not flag[j]:\r\n ans[i] = j\r\n \r\n print(*ans)\r\nelse:\r\n ans = [-1]*n\r\n flag = True\r\n \r\n for i in range(n):\r\n if a[i]==b[i]:\r\n ans[i] = a[i]\r\n else:\r\n if flag:\r\n ans[i] = a[i]\r\n flag = False\r\n else:\r\n ans[i] = b[i]\r\n \r\n if len(set(ans))==n:\r\n print(*ans)\r\n exit()\r\n \r\n ans = [-1]*n\r\n flag = True\r\n \r\n for i in range(n):\r\n if a[i]==b[i]:\r\n ans[i] = a[i]\r\n else:\r\n if flag:\r\n ans[i] = b[i]\r\n flag = False\r\n else:\r\n ans[i] = a[i]\r\n \r\n print(*ans)", "def solve(p, q):\r\n return sum(p[i] != q[i] for i in range(n)) == 1\r\n\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nwa = [0 for i in range(n + 1)]\r\nwb = wa.copy()\r\n\r\nfor i in a:\r\n wa[i] += 1\r\nfor i in b:\r\n wb[i] += 1\r\nta = []\r\nfor i in range(1, n + 1):\r\n if wa[i] == 0:\r\n sa = i\r\nfor i in range(n):\r\n if wa[a[i]] == 2:\r\n ta.append(i)\r\n\r\np = a.copy()\r\np[ta[0]] = sa\r\nif solve(p, b):\r\n ans = p.copy()\r\nelse:\r\n p = a.copy()\r\n p[ta[1]] = sa\r\n if solve(p, b):\r\n ans = p.copy()\r\nprint(*ans)\r\n", "'''input\n5\n1 2 3 4 3\n1 2 5 4 5\n'''\nn = int(input())\nd, u, ans = [], [], \"\"\na, b = input().split(), input().split()\nfor x in range(n):\n\tif a[x] != b[x]:\n\t\td.append(x)\n\telse:\n\t\tu.append(a[x])\nu = [str(i) for i in range(1, n+1) if str(i) not in u]\nif len(d) == 1:\n\tans = a[:d[0]] + [u[0]] + a[d[0]+1:]\nelse:\n\tans = a[:d[0]] + [u[0]] + a[d[0]+1:d[1]] + [u[1]] + b[d[1]+1:]\n\ts1, s2 = 0, 0\n\tfor i in range(n):\n\t\tif ans[i] != a[i]:\n\t\t\ts1 += 1\n\tfor j in range(n):\n\t\tif ans[j] != b[j]:\n\t\t\ts2 += 1\n\tif s1 >= 2 or s2 >= 2:\n\t\tu = u[::-1]\n\t\tans = a[:d[0]] + [u[0]] + a[d[0]+1:d[1]] + [u[1]] + b[d[1]+1:]\nprint(\" \".join(ans))", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\n\r\n# generate all 4 possibilities\r\ndupa = []\r\ndupb = []\r\nfor i in range(len(a)):\r\n try: \r\n index = a[i+1:].index(a[i])\r\n dupa.append(i)\r\n dupa.append(index+i+1)\r\n break\r\n except ValueError:\r\n pass\r\n\r\nfor absent in range(1, len(a) + 1 ):\r\n if not absent in a:\r\n absenta = absent\r\n break\r\n\r\npa1 = list(a)\r\npa2 = list(a)\r\npa1[dupa[0]] = absenta\r\npa2[dupa[1]] = absenta\r\n \r\nfor i in range(len(b)):\r\n try: \r\n index = b[i+1:].index(b[i])\r\n dupb.append(i)\r\n dupb.append(index+i+1)\r\n break\r\n except ValueError:\r\n pass\r\n \r\nfor absent in range(1, len(b) + 1 ):\r\n if not absent in b:\r\n absentb = absent\r\n break\r\n\r\npb1 = list(b)\r\npb2 = list(b)\r\n\r\npb1[dupb[0]] = absentb\r\npb2[dupb[1]] = absentb\r\n\r\n\r\n# print the right possibility\r\nif (pa1>pb1)-(pa1<pb1) == 0 or (pa1>pb2)-(pa1<pb2) == 0:\r\n print( \" \".join([str(x) for x in pa1]) )\r\nelse:\r\n print( \" \".join([str(x) for x in pa2]) )\r\n", "import sys\r\ninput = sys.stdin.readline\r\nN = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nres = [0] * N\r\ns = {i for i in range(1, N + 1)}\r\nfor i in range(N):\r\n if a[i] == b[i]:\r\n res[i] = a[i]\r\n s.discard(a[i])\r\nif res.count(0) == 1:\r\n for i in range(N):\r\n if res[i] == 0: res[i] = s.pop()\r\n\r\nelse:\r\n c = 0\r\n ts = set()\r\n for i in range(N):\r\n if res[i] == 0 and (c == 1):\r\n ts.add(a[i])\r\n elif res[i] == 0 and (c == 0):\r\n ts.add(b[i])\r\n c += 1\r\n c = 0\r\n if ts == s:\r\n for i in range(N):\r\n if res[i] == 0 and (c == 1): res[i] = a[i]\r\n elif res[i] == 0 and (c == 0):\r\n res[i] = b[i]\r\n c += 1\r\n else:\r\n for i in range(N):\r\n if res[i] == 0 and (c == 1): res[i] = b[i]\r\n elif res[i] == 0 and (c == 0):\r\n res[i] = a[i]\r\n c += 1\r\nprint(*res)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nuni=[i for i in range(1,n+1)]\r\ncommon=[]\r\nind=[]\r\ndef diff(a,b):\r\n n=len(a)\r\n v=0\r\n for i in range(n):\r\n if a[i]!=b[i]:\r\n v+=1\r\n return v\r\nfor i in range(n):\r\n if a[i]==b[i]:\r\n common.append(a[i])\r\n else:\r\n ind.append(i)\r\nres=a[:]\r\nk=len(ind)\r\nval=set(uni)-set(common)\r\nif k==1:\r\n res[ind[0]]=val.pop()\r\n for i in res:\r\n print(i,end=' ')\r\n \r\nelse:\r\n v1=val.pop()\r\n v2=val.pop()\r\n res[ind[0]]=v1\r\n res[ind[1]]=v2\r\n res2=a[:]\r\n res2[ind[0]]=v2\r\n res2[ind[1]]=v1\r\n if diff(res,a)==1 and diff(res,b)==1:\r\n for i in res:\r\n print(i,end=' ')\r\n else:\r\n for i in res2:\r\n print(i,end=' ')" ]

[ "n, k = map(int, input().split())\r\np = [str(i) for i in range(1, 2 *n + 1)]\r\nfor i in range(k):\r\n p[2 * i], p[2 * i + 1] = p[2 * i + 1], p[2 * i]\r\nprint(\" \".join(p))", "n, k = map(int, input().split())\n\nif n == 0:\n print(0)\nelse:\n arr = [0] * 2 * n\n for i in range(2 * n):\n arr[i] = i + 1\n\nfor i in range(0, 2 * k, 2):\n temp = arr[i]\n arr[i] = arr[i + 1]\n arr[i + 1] = temp\n\nfor i in range(2 * n):\n print(arr[i], sep=' ', end=' ')\n", "n,k=map(int,input().split())\r\nres=[i for i in range(1,2*n+1)]\r\nfor i in range(1,k+1):\r\n res[2*i-1]=2*i-1\r\n res[2*i-2]=2*i\r\nprint(*res)", "\r\nn,k = map(int,input().strip().split())\r\n\r\nif k!=0:\r\n ans = [1+k,1]\r\nelse:\r\n ans = [1,2]\r\ni = 2\r\nz = ans[1]\r\nwhile i<2*n:\r\n z+=1\r\n if z==1+k:continue\r\n ans.append(z)\r\n i+=1\r\n\r\nprint(*ans)\r\n\r\n", "n, k = map(int, input().split())\nfor i in range(1, n + 1):\n a, b = 2 * i - 1, 2 * i\n if k:\n print(b, a, end=' ')\n k -= 1\n else:\n print(a, b, end=' ')", "n, k = map(int, input().split())\na = [i + 1 for i in range(2 * n)]\nfor i in range(k):\n a[2 * i], a[2 * i + 1] = a[2 * i + 1], a[2 * i]\n\na = \" \".join([str(i) for i in a])\nprint(a)\n", "n,k=map(int,input().split())\nans = []\nfor i in range(1,2*n+1):\n ans.append(i)\nfor i in range(0,2*k,2):\n ans[i],ans[i+1] = ans[i+1],ans[i]\nprint(*ans)\n", "n, k = list(map(int, input().strip().split()))\narr = list(range(k*2, 0, -1)) + list(range(k*2+1, n*2+1))\nprint(' '.join(map(str, arr)))\n\t \t\t\t \t\t\t\t \t \t \t \t \t \t\t", "n,k=map(int,input().split())\r\nans=[]\r\nfor i in range(1,k+1):\r\n ans.append(2*i)\r\n ans.append(2*i-1)\r\nfor x in range(len(ans)+1,2*n+1):\r\n ans.append(x)\r\nfor i in ans:\r\n print(i,end=' ')\r\n", "# cook your dish here\r\n\r\nn,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\n\r\narr = [ i+1 for i in range(2*n)]\r\n\r\nfor i in range(k):\r\n arr[2*i], arr[2*i+1] = arr[2*i+1], arr[2*i]\r\n\r\nfor i in arr:\r\n print(i)", "n, k = map(int, input().split())\nfor i in range(2*k):\n if i % 2:\n print(i, end = ' ')\n else:\n print(i + 2, end = ' ')\nfor i in range(2*k, 2*n):print(i + 1, end = ' ')\n", "n,k=map(int,input().split())\r\nfor i in range(n):\r\n if(i<k):\r\n print(2*i+2,2*i+1,end=' ')\r\n else:\r\n print(2*i+1,2*i+2,end=' ')", "import sys\r\nn,k=map(int,sys.stdin.readline().split())\r\nans=[]\r\nfor i in range(2*n):\r\n ans.append(i+1)\r\nfor i in range(0,2*k,2):\r\n t=ans[i+1]\r\n ans[i+1]=ans[i]\r\n ans[i]=t \r\nprint(*ans) \r\n ", "n,k=map(int,input().split())\r\nL=[]\r\nfor i in range(1,2*n+1):\r\n L.append(i)\r\n\r\nfor i in range(0,2*n,2):\r\n if k!=0:\r\n temp=L[i]\r\n L[i]=L[i+1]\r\n L[i+1]=temp\r\n else:\r\n break\r\n k-=1\r\n \r\nfor i in range(2*n):\r\n print(L[i])\r\n \r\n", "n, k = map(int, input().split())\r\n\r\na = [i + 1 for i in range(2*n)]\r\n\r\nfor i in range(k):\r\n a[2 * i], a[2 * i + 1] = a[2 * i + 1], a[2 * i]\r\n\r\nfor i in a:\r\n print(i, end=\" \")\r\n", "def former(n,k):\r\n lst=[i for i in range(1,2*n+1)]\r\n f=len(lst)-2\r\n for i in range(k):\r\n lst[f],lst[-1]=lst[-1],lst[f]\r\n f-=1\r\n print(*lst)\r\n return \"\"\r\n#\r\na,b=map(int,input().strip().split())\r\nprint(former(a,b))\r\n", "def f(s):\r\n A = [int(i) for i in s.split()]\r\n first = 0\r\n for i in range(0,len(A)-1,2):\r\n first += abs(A[i+1]-A[i])\r\n second = 0\r\n for i in range(0,len(A)-1,2):\r\n second += A[i]-A[i+1]\r\n second = abs(second)\r\n return first -second\r\n\r\n\r\n'''\r\nFor a given n, if k=n+2, do [n-1, n-2, ..., 1, n]\r\n\r\n'''\r\nn, k = [int(i) for i in input().split()]\r\nk = 2*k\r\nif k == 0:\r\n print(*[i for i in range(1,2*n+1)])\r\nelif k==2*n:\r\n print(2*n,end=' ')\r\n for i in range(2*n-2,0,-1):\r\n print(i,end=' ')\r\n\r\n print(1)\r\nelse:\r\n for i in range(k+1,0,-1):\r\n print(i,end=' ')\r\n for i in range(k+2,2*n+1):\r\n print(i,end=' ')\r\n print()\r\n", "# LUOGU_RID: 130466998\nn, k = input().split()\nn = int(n)\nk = int(k)\nprint(k+1, end=' ')\nfor i in range(1,k+1):\n print(i, end = ' ')\nfor i in range(k+2, n*2+1):\n print(i, end = ' ')", "import math\r\n\r\ndef f(perm):\r\n a1 = 0\r\n a2 = 0\r\n for i in range(len(perm)//2):\r\n a1+=abs(perm[2*i]-perm[2*i+1])\r\n for i in range(len(perm)):\r\n if i%2 == 0:\r\n a2+=perm[i]\r\n else:\r\n a2-=perm[i]\r\n a2 = abs(a2)\r\n return (a1-a2)//2\r\n\r\nperm = [7, 1, 2, 3, 4, 5, 6, 8, 9, 10]\r\n#print(f(perm))\r\nn, k = map(int, input().split(' '))\r\n\r\nres = []\r\n\r\nif k == 0:\r\n for i in range(1, 2*n+1):\r\n res.append(i)\r\n print(res.__str__().replace(\",\", \"\").replace(\"[\", \"\").replace(\"]\", \"\"))\r\n exit(0)\r\n\r\nif n%2 == 0:\r\n znak = 1+k\r\nelse:\r\n if k == n:\r\n znak = k+2\r\n else:\r\n znak = k+1\r\n\r\nres.append(znak)\r\nres.append(1)\r\npointer = 2\r\n\r\nif pointer == znak:\r\n pointer+=1\r\n\r\nfor i in range(n-1):\r\n a = pointer\r\n\r\n pointer+=1\r\n if pointer == znak:\r\n pointer+=1\r\n\r\n b = pointer\r\n\r\n pointer+=1\r\n if pointer == znak:\r\n pointer+=1\r\n\r\n res.append(a)\r\n res.append(b)\r\n\r\nprint(res.__str__().replace(\",\", \"\").replace(\"[\", \"\").replace(\"]\", \"\"))\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nl=[[1,2*n]]\r\na=2\r\nfor i in range(n-1):\r\n l.append([a,a+1])\r\n a+=2\r\nx=2*n-1+n-1\r\ny=x-2*k\r\nc=0\r\nans=[]\r\nfor i in range(n):\r\n if c<=y:\r\n ans.extend(l[i][::-1])\r\n c+=l[i][1]-l[i][0]\r\n else:\r\n ans.extend(l[i])\r\n c-=l[i][1]-l[i][0]\r\n \r\nprint(*ans)\r\n \r\n", "n,k=map(int,input().split())\r\nx=n*2\r\nif k==0:\r\n for i in range(1,x+1):\r\n print(i,end=\" \")\r\n print()\r\nelse:\r\n l=list(range(1,x+1))\r\n p=0\r\n for i in range(k):\r\n l[p],l[p+2]=l[p+2],l[p]\r\n p=p+3\r\n for i in l:\r\n print(i,end=\" \")\r\n print()", "_,k=map(int,input().split())\r\nfor _ in range(_):\r\n d=_>=k;print(2*_+1+d,2*_+2-d)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nfor i in range(n):\r\n if (i >= k):\r\n print(i * 2 + 2, i * 2 + 1, end = ' ')\r\n else:\r\n print(i * 2 + 1, i * 2 + 2, end = ' ')\r\n", "a=input()\r\nn,k=a.split(\" \");\r\nn=int(n)\r\nk=int(k)\r\nb=list()\r\nb+=[0]\r\nfor i in range(1,2*n+1):\r\n\tb+=[i]\r\nfor i in range(1,k+1):\r\n\tb[2*i],b[2*i-1]=b[2*i-1],b[2*i]\r\nfor i in range(1,2*n+1):\r\n\tprint(b[i],end=\" \")", "# new=open('output.txt','w')\r\n# new.write(\"5 6\\n\")\r\n# new.write(\"3 4 5 6 7\")\r\n# new.close()\r\n# f = open('input.txt','r')\r\n# li=list(f.read().split())\r\n# print(li)\r\n# n,k=int(li[0]),int(li[1])\r\n# for i in range(2,len(li)):\r\n# nl.append(int(li[i]))\r\nn,k=map(int,input().split())\r\nfor i in range(k):\r\n print(4*i+2,4*i+1,4*i+3,4*i+4,end=\" \")\r\nfor i in range(4*k+1,2*n+1):\r\n print(i,end=\" \")", "n, k = map(int, input().split())\r\nans = []\r\nfor i in range(1, k + 1):\r\n ans.append(f'{2 * i - 1} {2 * i}')\r\nfor i in range(k + 1, n + 1):\r\n ans.append(f'{2 * i} {2 * i - 1}')\r\nprint(' '.join(ans))", "R=lambda:map(int,input().split())\r\nn,k=R()\r\na=[str(i) for i in range(1,2*n+1)]\r\nfor i in range(1,k+1):\r\n t=a[(2*i-1)-1]\r\n a[(2*i-1)-1]=a[2*i-1]\r\n a[2*i-1]=t\r\nprint(' '.join(a))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, k = [int(x) for x in input().split()]\n\nfor i in range(1, n+1):\n if i<=k:\n print(2*i-1, end=' ')\n print(2*i, end=' ')\n else:\n print(2*i, end=' ')\n print(2*i-1, end=' ')\n", "n ,k=map(int,input().split())\r\nans = [i for i in range(1,2*n+1)]\r\nj=0\r\nfor i in range(k):\r\n temp=ans[j]\r\n ans[j]=ans[j+1]\r\n ans[j+1]=temp\r\n j+=2\r\nfor i in ans:\r\n print(i,end=\" \")", "n,k=map(int,input().split())\r\nlis=[i for i in range(1,2*n+1)]\r\ni=0\r\nwhile i<k:\r\n lis[2*i],lis[2*i+1]=lis[2*i+1],lis[2*i]\r\n i+=1\r\nfor x in lis:print(x,end=\" \")", "n,k = map(int,input().split())\r\nans = []\r\nfor i in range(n):\r\n if k > 0:\r\n ans.append(2*i+2)\r\n ans.append(2 * i + 1)\r\n\r\n else:\r\n ans.append(2 * i + 1)\r\n ans.append(2 * i + 2)\r\n\r\n k -= 1\r\n\r\nprint(*ans)", "n, k= map(int, input().split())\r\nlis = []\r\nfor i in range(2, 2*k+1, 2):\r\n print(i, end=' ')\r\n print(i-1, end=' ')\r\nfor i in range(2*k+1, 2*n+1):\r\n print(i, end=' ')", "n,k = map(int,input().split())\r\n##k+1 1 2 3 4..k-1 k+1 ... n\r\nfirst_n = k + 1\r\nans = list(range(1,2 * n + 1))\r\nans.remove(first_n)\r\nans = [first_n] + ans\r\nprint(\" \".join(map(str,ans)))\r\n", "n,k = list(map(int, input().split()))\r\nA = [i for i in range(0, (2*n)+1)]\r\nfor i in range(1,k+1):\r\n A[2*i], A[2*i-1] = A[2*i-1], A[2*i]\r\nprint(\" \".join(map(str, A[1:])))\r\n", "n,k=map(int,input().split())\nans = [i for i in range(1, 2 * n + 1)]\n# print(*ans)\nfor i in range(1,k+1):\n ans[2*i-1]=2*i-1\n ans[2*i-2]=2*i\nprint(*ans)", "n,k = map(int,input().split()) \r\nans = [x for x in range(1,2*n+1)]\r\nfor i in range(1,k+1):\r\n ans[2*i-2],ans[2*i-1] = ans[2*i-1],ans[2*i-2]\r\nfor i in ans:\r\n print(i,end=' ')", "def switch(i,j):\r\n\treturn j,i\r\n\r\nn,k=map(int,input().split())\r\na=[i for i in range(1,2*n+1)]\r\nswap=k\r\nif swap==0:\r\n\tprint(*a)\r\nelse:\r\n\tfor i in range(2*n,-1,-4):\r\n\t\ta[i-1],a[i-3]=switch(a[i-1],a[i-3])\r\n\t\tswap-=1\r\n\t\tif swap==0:\r\n\t\t\tbreak\r\n\tprint(*a)", "from itertools import permutations\r\ndef difi(arr):\r\n adj=0\r\n for i in range(0,len(arr)-1,2):\r\n adj+=abs(arr[i+1]-arr[i])\r\n adj-=abs(sum(arr[0::2])-sum(arr[1::2]))\r\n return abs(adj)\r\n\r\ndef former(n,k):\r\n lst=[i for i in range(1,2*n+1)]\r\n f=len(lst)-2\r\n for i in range(k):\r\n lst[f],lst[-1]=lst[-1],lst[f]\r\n f-=1\r\n print(*lst)\r\n return \"\"\r\n#\r\na,b=map(int,input().strip().split())\r\nprint(former(a,b))\r\n# a=3\r\n# for i in range(0,a+1):\r\n# print(former(a,i),2*i)", "n,k=map(int,input().split())\r\nl=[x+1 for x in range(2*n)]\r\nfor i in range(2*k):\r\n if i%2!=0:\r\n l[2*i],l[2*i+1]=l[2*i+1],l[2*i]\r\nprint(*l)", "n, k = map(int, input().split())\r\n\r\narr = [i for i in range(1, 2*n+1)]\r\n\r\nfor i in range(k):\r\n arr[i << 1], arr[(i << 1)+1] = arr[(i << 1)+1], arr[i << 1]\r\n k -= 1\r\nprint(*arr)\r\n", "n, m = map(int, input().split())\r\nresult = [i for i in range(1, 2 * n + 1)]\r\nfor i in range(1, m + 1):\r\n result[2 * i - 1] = 2 * i - 1\r\n result[2 * i - 2] = 2 * i\r\nprint(*result)\r\n", "n,k=map(int,input().split())\r\n\r\na=list()\r\nfor i in range(1,2*n+1):\r\n a.append(i)\r\n \r\nfor i in range(1,2*k,2):\r\n a[i],a[i-1]=a[i-1],a[i]\r\n \r\nprint(*a)", "n,k=map(int,input().split())\r\na=[i for i in range(1,2*n+1)]\r\ni=0\r\nwhile k>0:\r\n a[i],a[i+1]=a[i+1],a[i]\r\n i+=2\r\n k-=1\r\nprint(*a)", "s = input().split()\r\n(n,k) = (int(i) for i in s)\r\na = [(i%(2*n))+1 for i in range(2*n) ]\r\n#print(a)\r\n\r\nfor i in range(k):\r\n\ta[i*2],a[2*i + 1] = a[2*i + 1],a[2*i]\r\n\r\nfor i in range(2*n):\r\n\tprint(a[i],end = ' ')", "n, k = map(int, input().split())\nres = []\nfor i in range(2*n, 0, -1):\n\tres.append(str(i))\nfor i in range(0, 2*n, 2):\n\tif k:\n\t\tres[i], res[i+1] = res[i+1], res[i]\n\t\tk -= 1\n\telse:\n\t\tbreak\nprint(' '.join(res))\n\t\t \t\t \t \t\t \t\t \t\t", "def solution(n,k):\n res = []\n count = 0\n for i in range(1,2*n+1,2):\n if count<k:\n res.append(str(i))\n res.append(str(i+1))\n count += 1\n else:\n res.append(str(i+1))\n res.append(str(i))\n return \" \".join(res)\n\nn,k= list(map(int, input().split()))\nprint(solution(n,k))\n\t\t\t \t\t \t \t\t \t\t \t \t \t \t \t\t", "\r\nimport math\r\nimport copy\r\nimport itertools\r\nimport bisect\r\nimport sys\r\nfrom heapq import heapify, heappop, heappush\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef ilst():\r\n return list(map(int,input().split()))\r\n \r\ndef islst():\r\n return list(map(str,input().split()))\r\n \r\ndef inum():\r\n return map(int,input().split())\r\n \r\ndef 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\ndef 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\ndef issub(s1,s2): #s2 is a sub of s1\r\n j = 0\r\n for i in range(len(s1)):\r\n if s1[i] == s2[j]:\r\n j += 1\r\n if j == len(s2):\r\n return True\r\n return False\r\n\r\nn,k = inum()\r\n\r\nans = [i for i in range(1,2*n+1)]\r\n\r\nfor i in range(2*n-1,2*(n-k),-2):\r\n ans[i],ans[i-1] = ans[i-1],ans[i]\r\nprint(*ans)\r\n\r\n", "n, k = map(int, input().split())\r\na = [str(i+1) for i in range(2*n)]\r\n\r\ni = 0\r\nwhile k:\r\n a[i], a[i+1] = a[i+1], a[i]\r\n k -= 1\r\n i += 2\r\n\r\nprint(' '.join(a))", "\ndef solve() :\n ans=[x+1 for x in range(2*n)] \n for i in range(k):\n ans[2*i],ans[2*i+1]=ans[2*i+1],ans[2*i]\n return ans\n\n\n\n\nfrom sys import stdin\ninput = stdin.readline\n\n\nn,k = [int(x) for x in input().split()]\n\nprint(*solve())\n\n\n\n'''\n\nt=int(input())\nfor i in range(t) :\n print(solve())\n\n\nn,m= [int(x) for x in input().split()]\n\n\nn=int(input())\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\n\nn=int(input())\narr=[int(x) for x in input().split()]\n'''", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom bisect import bisect_right, bisect_left\nimport math\nhpop = heappop\nhpush = heappush\nMOD = 10**9 + 7\n\ndef solution():\n n,k = map(int, input().split())\n arr = list(range(1,2*n + 1))\n\n for i in range(1, k+1):\n index = 2*i - 1\n arr[index], arr[index - 1] = arr[index - 1], arr[index]\n\n return print(\" \".join(map(str, arr)))\n\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n \nimport sys\nimport threading\nsys.setrecursionlimit(1 << 30)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=main)\nthread.start(); thread.join()\n#main()\n", "n,k = map(int,input().split())\r\na=[i+1 for i in range(n*2)]\r\nfor i in range(1,k+1):\r\n a[2*(i-1)],a[(2*i)]=a[2*i],a[2*(i-1)]\r\nprint(*a)", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int, input().split()))\r\nfor i in range(1):#nmbr():\r\n n,k=lst()\r\n ans=[i for i in range(2*n+1)]\r\n p=1\r\n while k>0:\r\n ans[p],ans[p+1]=ans[p+1],ans[p]\r\n p+=2\r\n k-=1\r\n print(*ans[1:])", "a,b=map(int,input().split())\r\narr=list(range(1,2*a+1))\r\nfor i in range(b):\r\n arr[2*i-2],arr[2*i-1]=arr[2*i-1],arr[2*i-2]\r\nprint(*arr)\r\n", "#Khushal Sindhav\r\n#Indian Institute Of Technology, Jodhpur\r\n# 11 May 2022\r\ndef exe():\r\n if k==0:\r\n return [i for i in range(2*n,0,-1)]\r\n l=[k+1,1]\r\n curr=2\r\n for i in range(2*(n-1)):\r\n if curr==k+1:\r\n curr+=1\r\n l.append(curr)\r\n curr+=1\r\n \r\n # a1=sum([abs(l[i]-l[i+1]) for i in range(0,2*n,2)])\r\n # a2=abs( sum([ l[i]-l[i+1] for i in range(0,2*n,2)]) )\r\n # print(a1-a2)\r\n \r\n return l\r\nn,k=map(int,input().split())\r\nprint(*exe())", "n, k = map(int, input().split())\r\nfor i in range(n):\r\n if (i >= k): print(i * 2 + 2, i * 2 + 1, end = ' ')\r\n else: print(i * 2 + 1, i * 2 + 2, end = ' ')\r\n", "import sys\ninput = sys.stdin.readline\nimport math\nimport copy\nimport collections\nfrom collections import deque\n\nn,k = list(map(int,input().split()))\nans = []\nfor i in range(n):\n if k>0:\n ans.append(2*n-2*i-1)\n ans.append(2*n-2*i)\n k-=1\n else:\n ans.append(2*n-2*i)\n ans.append(2*n-2*i-1)\nfor num in ans:\n print(num, end = \" \")\nprint()", "n,k = map(int,input().split())\r\ngp1=[]\r\ngp2=[]\r\nfor i in range(1,2*n+1):\r\n if i%2:\r\n gp2.append(i)\r\n else:\r\n gp1.append(i)\r\ngp1.sort()\r\ngp2.sort() \r\n#print(gp2,gp1)\r\nans=0\r\nfor i in range(n):\r\n if ans!=2*k:\r\n ans+=2\r\n gp1[i],gp2[i]=gp2[i],gp1[i]\r\nfor i in range(n):\r\n print(gp2[i],gp1[i],end=' ') \r\n\r\n ", "n,k=map(int,input().split())\r\nfor i in range(1,n+1):\r\n if(k>0):\r\n print(2*i-1,end=' ')\r\n print(2*i,end=' ')\r\n k-=1\r\n else:\r\n print(2*i,end=' ')\r\n print(2*i-1,end=' ')\r\n k-=1\r\n", "n,k=map(int,input().split())\r\nl=[i for i in range(1,2*n+1)]\r\nif k==0:\r\n for i in l:\r\n print(i,end=\" \")\r\n exit()\r\nc=0\r\nfor i in range(k):\r\n l[c],l[c+1]=l[c+1],l[c]\r\n c+=2\r\n\r\n\r\nfor i in l:\r\n print(i,end=\" \")\r\n\r\n\r\n", "n,k= map(int, input().split())\r\nfor i in range(1,k+1): print(2*i,2*i-1, end=\" \")\r\nfor i in range(2*n-2*k): print(2*k+i+1, end=\" \")", "n,k=map(int,input().split())\r\ntemp=2*n\r\nans=[]\r\nwhile(temp>0):\r\n ans.append(temp)\r\n temp-=1\r\ni=0\r\nwhile(k):\r\n ans[i+1],ans[i]=ans[i],ans[i+1]\r\n i+=2\r\n k-=1\r\n\r\nprint(*ans)\r\n", "n,k = list(map(int,input().split()))\r\n\r\nans = []\r\n\r\nfor i in range(n):\r\n if(k>0):\r\n ans.append(2*i+2)\r\n ans.append(2*i+1)\r\n else:\r\n ans.append(2*i+1)\r\n ans.append(2*i+2)\r\n k-=1\r\nprint(*ans)", "from collections import deque\r\nn,k=map(int,input().split())\r\nans=[]\r\nif k==0:\r\n for i in range(1,n+1):\r\n ans.append(i)\r\n ans.append(2*n-i+1)\r\nelse :\r\n ans=[1+k,1]\r\n s=[el for el in range(1,2*n+1) if el!=ans[0] and el!=ans[1]]\r\n s=deque(s)\r\n while s:\r\n a=s.popleft()\r\n b=s.pop()\r\n a,b=max(a,b),min(a,b)\r\n ans.append(b)\r\n ans.append(a)\r\nprint(*ans)\r\n ", "import math;\r\nfrom math import log2,sqrt;\r\nfrom bisect import bisect_left,bisect_right\r\nimport bisect;\r\nimport sys;\r\nfrom sys import stdin,stdout\r\nimport os\r\nsys.setrecursionlimit(pow(10,7))\r\nimport collections\r\nfrom collections import defaultdict\r\nfrom statistics import median\r\n# input=stdin.readline\r\n# print=stdout.write\r\nfrom queue import Queue\r\ninf = float(\"inf\")\r\n\r\nn,k=map(int,input().split())\r\nl=[i+1 for i in range(2*n)]\r\nfor i in range(k):\r\n l[2*i],l[2*i+1]=l[2*i+1],l[2*i]\r\nprint(*l)\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\nfor i in range(1, n+1):\r\n a, b = i*2, i*2-1\r\n if k:\r\n a, b = b, a\r\n k -= 1\r\n print(a, b, end=' ')\r\n", "from sys import stdin, stdout\r\nn, k = map(int, stdin.readline().split())\r\nif k:\r\n s = {2 * n - k, 2 * n}\r\n ans = [2 * n - k, 2 * n]\r\n for i in range(2 * n, 0, -1):\r\n if i not in s:\r\n ans.append(i)\r\nelse:\r\n ans = [i for i in range(2 * n, 0, -1)]\r\nstdout.write(' '.join(list(map(str, ans))))", "n, k = map(int, input().split())\r\nl = [0]\r\nfor i in range(1, 2*n+1):\r\n l.append(i)\r\nfor i in range(1, 2*n+1, 4):\r\n if k == 0:\r\n break\r\n l[i], l[i+1] = l[i+1], l[i]\r\n k -= 1\r\n\r\nfor i in range(1, 2*n+1):\r\n print(l[i], end=\" \")", "n,k=list(map(int,input().split()))\r\na=[i for i in range(1,2*n+1)]\r\nfor i in range(k):\r\n a[2*i],a[2*i+1]=a[2*i+1],a[2*i]\r\nprint(*a)\r\n", "\r\ndef main():\r\n n, k = [int(x) for x in input().split()]\r\n for i in range(n):\r\n if k > 0:\r\n print(2*i + 1, 2*i + 2, end=' ')\r\n k -= 1\r\n else:\r\n print(2*i + 2, 2*i + 1, end=' ')\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "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 trsl = 1\r\n res = []\r\n for _ in range(0, k):\r\n res.append(trsl)\r\n trsl += 1\r\n res.append(trsl)\r\n trsl += 1\r\n res.append(trsl+1)\r\n res.append(trsl)\r\n trsl += 2\r\n \r\n start = trsl-1\r\n while start < 2*n:\r\n res.append(trsl)\r\n res.append(trsl+1)\r\n trsl += 2\r\n start += 2\r\n \r\n for i in range(0, 2*n):\r\n print(res[i], end=\" \")\r\n \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\nv = list(range(1, 2 * n + 1))\r\nfor i in range(k):\r\n v[2 * i], v[2 * i + 1] = v[2 * i + 1], v[2 * i]\r\nprint(' '.join(map(str, v)))", "n, k = [int(a) for a in input().split()]\r\nchk = [False] * (2 * n + 1)\r\nfor num in range(1, 2 * n, 2):\r\n print(num)\r\n chk[num] = True\r\n if num == 1:\r\n chk[2 * k + 2] = True\r\n print(2 * k + 2)\r\n else: \r\n if chk[num - 1]:\r\n chk[num + 1] = True\r\n print(num + 1)\r\n else:\r\n chk[num - 1] = True\r\n print(num - 1)\r\n", "n,k=map(int,input().split())\r\nans=[0]*(2*n)\r\nfor i in range(2*n):\r\n ans[i]=i+1\r\nflag=True\r\ni=0\r\nwhile k>0:\r\n if flag:\r\n i+=2\r\n flag=False\r\n else:\r\n flag=True\r\n k-=1\r\n if i<2*n-1:\r\n ans[i],ans[i+1]=ans[i+1],ans[i]\r\nfor i in range(len(ans)):\r\n print(ans[i],end=' ')\r\n ", "\r\nn,k = map(int,input().split())\r\n\r\ni = 1\r\ns = []\r\nwhile k:\r\n\ts.append(i+1)\r\n\ts.append(i)\r\n\ti = i + 2\r\n\tk = k - 1\r\n\r\nwhile i <= 2*n:\r\n\r\n\ts.append(i)\r\n\ti = i + 1\r\n\r\nprint(*s)", "import math\r\n\r\nans = []\r\nn, m = map(int, input().split())\r\nfor i in range(1, n + 1):\r\n ans.append([2 * i - 1, 2 * i])\r\n\r\ncurrent = 0\r\ni = 0\r\nwhile current != 2 * m and i < n:\r\n if current < m and i < n:\r\n ans[i][0], ans[i][1] = ans[i][1], ans[i][0]\r\n current += 1\r\n i += 1\r\nfor i in ans:\r\n print(*i, end = \" \")\r\n", "n,k=map(int,input().split())\r\nx=list(range(1,(2*n)+1))\r\nfor i in range(k):\r\n x[(2*i)+1],x[2*i]=x[2*i],x[(2*i)+1]\r\n\r\nprint(*x)", "import sys\r\ninput=sys.stdin.buffer.readline\r\n\r\n\r\nn,k=map(int,input().split())\r\nfor i in range(1,n+1):\r\n\tif k==0:\r\n\t\tprint(2*i-1,2*i,end=' ')\r\n\telse:\r\n\t\tprint(2*i,2*i-1,end=' ')\r\n\t\tk-=1\r\n", "n,k=map(int,input().split())\r\nif(k==0):\r\n for i in range(1,2*n+1):\r\n print(i,end=\" \")\r\nelse:\r\n l=[i for i in range(1,2*n+1)]\r\n for i in range(1,k+1):\r\n j=2*i-1\r\n m=2*i\r\n while(j<=m):\r\n temp=l[j-1]\r\n l[j-1]=l[m-1]\r\n l[m-1]=temp\r\n j=j+1\r\n m=m-1\r\n for i in range(2*n):\r\n print(l[i],end=\" \")", "R = lambda: map(int, input().split())\r\nn, k = R()\r\narr = [i + 1 for i in range(n * 2)]\r\nfor i in range(0, 2 * k, 2):\r\n arr[i], arr[i + 1] = arr[i + 1], arr[i]\r\nprint(' '.join(map(str, arr)))", "import math\r\nimport sys\r\n\r\n#imgur.com/Pkt7iIf.png\r\n\r\n#n, m = map(int, input().split())\r\n#n = int(input())\r\n#d = list(map(int, input().split()))\r\n\r\nn, k = map(int, input().split())\r\ns = list(range(1, 2*n+1))\r\n\r\nj = 0\r\nfor i in range(k):\r\n s[j], s[j+1] = s[j+1], s[j]\r\n j += 2\r\n\r\nprint(' '.join(str(x) for x in s))", "s=input().split();print(int(s[1])+1,end=' ')\r\nfor i in range(1,1+2*int(s[0])):\r\n if i!=int(s[1])+1:\r\n print(i,end=' ')", "n,k=map(int,input().split())\r\nc=1\r\nans=[]\r\nwhile(k):\r\n k-=1\r\n ans.append(c)\r\n c+=1\r\n ans.append(c)\r\n c+=1\r\n ans.append(c+1)\r\n ans.append(c)\r\n c+=2\r\nfor i in range(c-1,2*n,2):\r\n ans.append(c)\r\n ans.append(c+1)\r\n c+=2\r\nprint(*ans)", "n,k = [int(x) for x in input().split()]\r\nlis = [i for i in range(1,2*n+1)]\r\nfor i in range(k):\r\n lis[2*i], lis[2*i+1] = lis[2*i+1] , lis[2*i]\r\nprint(*lis) \r\n\r\n# for i in range(2*n-k,2*n+1):\r\n# lis.append(i)\r\n# for i in reversed(range(1, 2*n-k)):\r\n# lis.append(i) \r\n# My code also seems to be fine but idk why MIKE lodu ko kya dikkat ho rhi hai ", "n,k=map(int,input().split())\r\na=[[i+1,i] for i in range(1,2*n+1,2)]\r\ndp={}\r\ndp[0]=a\r\n#print(dp)\r\nfor i in range(k):\r\n a[i]=a[i][::-1]\r\n dp[i+1]=a\r\n #print(a)\r\n \r\nx=[i for row in dp[k] for i in row]\r\nprint(' '.join(str(y) for y in x))\r\n\r\n", "n,k = map(int,input().split())\r\nl = [i for i in range(1,2*n+1)]\r\nfor j in range(0,k):\r\n l[2*j+1],l[2*j] = l[2*j],l[2*j+1]\r\nprint(*l)", "n, k = list(map(int, input().split()))\ndp = [i for i in range(1, 2*n+1)]\nfor i in range(1, k+1):\n dp[i-1], dp[(k+i)] = dp[(k+i)], dp[i-1]\n\nprint(*dp, sep=\" \")", "n, k = map(int, input().split())\r\nfor i in range(n):\r\n if k>0:\r\n print(2*i+2, 2*i+1, end = \" \")\r\n else:\r\n print(2*i+1, 2*i+2, end= \" \")\r\n k-=1\r\n", "n,k=map(int,input().split())\r\nb=[]\r\nfor i in range(2*n):\r\n b.append(i+1)\r\nfor i in range(k):\r\n t=b[2*i]\r\n b[2*i]=b[2*(i)+1]\r\n b[2*(i)+1]=t\r\nprint(*b,sep=\" \")", "n,k=map(int,input().split())\narr=[x+1 for x in range(2*n)]\nfor x in range(k):\n arr[2*x],arr[2*x+1]=arr[2*x+1],arr[2*x]\nfor x in arr:\n print(x,end=' ')\nprint()", "from sys import stdin,stdout\r\nfrom math import gcd\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, k = iia()\r\nans = []\r\nfor i in range(1, (2*n)+1, 2):\r\n if k > 0:\r\n ans.extend([i + 1,i])\r\n k -= 1\r\n else:\r\n ans.extend([i, i + 1])\r\nprint(*ans)" ]

[ "ka=int(input())\r\nif(ka&(ka-1)>0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\n\r\nprint('NO' if n & n-1 else 'YES')", "from math import log2\r\nn=int(input())\r\nprint(\"YES\" if log2(n)%1==0 else \"NO\")", "i = int(input())\r\nmods = [0] * i\r\nk = 0\r\nfor j in range(i):\r\n k += j\r\n mods[k % i] = 1\r\nif all(m == 1 for m in mods):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\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 = ni()\r\n\r\nworks = [0 for i in range(n)]\r\ns = set()\r\ncur = 0\r\nworks[cur] = 1\r\nfor i in range(1, n + 1):\r\n cur += i\r\n works[cur % n] = 1\r\n\r\nprint(\"NO\" if min(works) < 1 else \"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 = int(input())\r\nif n & (n - 1) > 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "x = int( input() )\r\nprint( \"NO\" if x & x-1 > 0 else \"YES\" )", "n = int(input())\r\nwhile n>1:\r\n n/=2\r\nif n==1:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "import math\r\nn = int(input())\r\nt = math.log(n) / math.log(2)\r\nif(t.is_integer()):\r\n print('YES')\r\nelse:\r\n print('NO')", "import math;n = int(input());print([\"NO\",\"YES\"][2**round(math.log2(n))==n])", "n = int(input())\r\nl = [1]\r\nfor i in range(2, 2*n + 1):\r\n a = l[-1] + i-1\r\n if a > n:\r\n a = a%n\r\n l.append(a)\r\nr = set(l)\r\nif len(r) >= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\nimport queue\r\n\r\nfrom itertools import permutations\r\n\r\n\r\nn=int(input())\r\n\r\na=[]\r\nchecked=0\r\ncurrent=0\r\n\r\nfor i in range(0,n):\r\n a.append(1)\r\n\r\n\r\nfor i in range(0,n*n+1):\r\n checked+=a[current]\r\n a[current]=0\r\n \r\n current+=(i+1)\r\n current=current%n\r\n \r\nif checked==n:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n ", "n = int(input())\r\nx = [0]*n\r\nsum_ = 0\r\nlast = 0\r\nfor i in range(1000):\r\n x[sum_%n] = 1\r\n sum_ +=i\r\nprint(\"YES\" if x == [1]*n else \"NO\")", "from math import log\r\na = int(input())\r\nt = log(a, 2)\r\nif len(str(t)) == 3:\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-28 16:14:20\nLastEditTime: 2021-11-28 16:16:34\nDescription: Flea travel\nFilePath: CF55A.py\n'''\n\n\ndef func():\n n = int(input())\n if bin(n).count(\"1\") == 1:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nif __name__ == '__main__':\n func()\n", "n=int(input())\r\nwhile n % 2 == 0:\r\n n/=2\r\nif n == 1: \r\n print('YES')\r\nelse:\r\n print('NO')", "a=int(input())\r\nb=1\r\nwhile b<=a:\r\n if b==a:\r\n u=1\r\n else:\r\n u=0\r\n b=b*2\r\nif u==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nprint(\"NO\" if n&(n-1) else \"YES\")\r\n", "n=int(input())\r\nvisited = [0]*n\r\npos = 0\r\njump = 1\r\nfor i in range(n*2):\r\n #print(visited,pos)\r\n pos = (pos+jump)%n\r\n visited[pos]=1\r\n jump = (jump+1)%n\r\n\r\nfor i in visited:\r\n if i==0:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "# LUOGU_RID: 101451493\nprint(bin(int(input())).count('1') == 1 and 'YES' or 'NO')", "n=int(input())\r\np=[0 for i in range(n+1)]\r\ni=1\r\nsum=1\r\nwhile True:\r\n p[sum]+=1\r\n if p[sum]>2:\r\n break\r\n sum=(sum+i)\r\n if sum!=n:\r\n sum%=n\r\n i+=1\r\np[0]=1\r\nif all(p):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\nif n&(n-1): print(\"NO\")\nelse: print(\"YES\")\n \t\t \t \t \t\t\t \t \t\t\t \t", "hassocks = int(input())\r\nvisited_hassocks = [False] * hassocks\r\nvisited_hassocks[0] = True\r\ni = 0\r\nk = 1\r\nwhile k < 1000:\r\n k += 1\r\n i += (k - 1)\r\n i = i % hassocks\r\n visited_hassocks[i] = True\r\nif visited_hassocks.count(True) == len(visited_hassocks):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nL=[1]\r\nfor k in range(1,n):\r\n if((L[len(L)-1]+k)==n):\r\n L.append(L[len(L)-1]+k)\r\n else:\r\n L.append((L[len(L)-1]+k)%n)\r\nL=list(set(L))\r\nif(len(L)==n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nflag = 1\nwhile n > 1:\n if n % 2:\n flag = 0\n break\n n = n // 2\nif flag:\n print(\"YES\")\nelse:\n print(\"NO\")", "a = int(input())\r\nif (a & (a-1) == 0):print(\"YES\")\r\nelse:print(\"NO\")", "import math\r\nn = int(input())\r\nif math.log2(n) == int(math.log2(n)):\r\n print(\"YES\")\r\nelse: print(\"NO\")", "n = int(input())\r\nwhile n % 2 == 0:\r\n n = n / 2\r\n\r\nif n == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=int(input())\nif x&(x-1):\n print(\"NO\")\nelse:\n print(\"YES\")\n\n \t\t \t \t\t\t \t\t\t\t \t\t\t \t \t \t\t \t", "n = int(input())\nvis = [False]*n\n\nvis[0] = True\nk = 0\nfor i in range(n):\n k+=(i+1)\n k=k%n\n vis[k] = True\n\nif(all(vis)):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n=int(input())\r\nc=0\r\ns=set()\r\nfor i in range(1,2*n +1):\r\n c+=i\r\n s.add(c%n)\r\n\r\nprint(\"YES\" if len(s)==n else \"NO\") \r\n\r\n \r\n \r\n \r\n", "n=int(input())\r\nif n==1:\r\n print(\"YES\")\r\nelse:\r\n x=(-1+(1+8*n)**(0.5))/2\r\n x1=(-1-(1+8*n)**(0.5))/2\r\n if (x>0 and x==int(x)) or (x1>0 and x1==int(x)):\r\n print(\"NO\")\r\n else:\r\n l=[1]\r\n c=1\r\n i=1\r\n for i in range(3000):\r\n c+=i\r\n i+=1\r\n l.append((c%n)+1)\r\n if len(set(l))==n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n, x = int(input()), 0\r\nt, i = [1] + [0] * (n - 1), 1\r\nwhile True:\r\n x = (x + i) % n\r\n if t[x]: break\r\n t[x] = 1\r\n i += 1\r\nprint('YNEOS'[i < n:: 2])", "n = int(input())\r\nprint(\"NO\" if n & (n - 1) else \"YES\")", "import math\r\n\r\nn=int(input())\r\n\r\nz=math.log2(n)\r\n\r\nif(z==int(z)):\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\nn = int(input())\r\n\r\n\r\ncojines = list(range(n))\r\n\r\nactual = 0\r\nk = 0\r\nfor i in range(n*3):\r\n actual = ((actual+k+1) % n)\r\n if actual in cojines:\r\n cojines.remove(actual)\r\n if len(cojines) == 0:\r\n break\r\n k = k+1\r\n\r\nif len(cojines) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "import poplib\r\nimport string\r\nimport math\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n current_point = 1\r\n listy = [0 for i in range(n + 1)]\r\n listy[1] = 1\r\n for i in range(10):\r\n for j in range(1, n):\r\n current_point += j\r\n if current_point <= n:\r\n listy[current_point] = 1\r\n else:\r\n target_val = current_point % n\r\n if target_val == 0:\r\n target_val = n\r\n listy[target_val] = 1\r\n if sum(listy) == n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "quant = int(input())\r\npos = 1\r\nn = list(range(1,quant+1))\r\nfor i in range(0,quant+1):\r\n pos+= i\r\n while pos> quant:\r\n pos-=quant\r\n if pos in n:\r\n n.remove(pos)\r\nif len(n) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\nimport math\r\n\r\nn = int(input())\r\nx = math.log2(n)\r\nif x == int(x):\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nans = [0] * n\r\nans[0] = 1\r\n\r\ni = 0\r\n\r\nfor j in range(1, n):\r\n i = (i+j) % n\r\n ans[i] = 1\r\nif sum(ans) == n:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "n = int(input())\njumped = [ [ False for j in range(n) ] for i in range(n) ]\nseen = [ False for i in range(n) ]\nseen[0] = True\ncount = 1\nspan = 0\npos = 0\nwhile True:\n\tpos = (pos + span + 1) % n\n\tif seen[pos]:\n\t\tif jumped[pos][span]:\n\t\t\tbreak\n\telse:\n\t\tseen[pos] = True\n\t\tcount += 1\n\tjumped[pos][span] = True\n\tspan = (span + 1) % n\n\nif count == n:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "# LUOGU_RID: 101451240\nprint(bin(int(input())).count('1') == 1 and 'YES' or 'NO')", "from math import *\r\nn=int(input())\r\nprint(['NO','YES'][int(n==2**round(log(n,2)))])", "n = int(input())\r\np = [0] * n\r\ni = 0\r\np[0] = 1\r\nk = 1\r\nwhile k != 90000:\r\n k += 1\r\n i += (k - 1)\r\n i = i % n\r\n p[i] = 1\r\nif p.count(1) == len(p):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "print('NYOE S'[input() in {'1', '2', '4', '8', '16', '32', '64', '128', '256', '512'} :: 2])", "# AC\nimport sys\n\n\nclass Main:\n def __init__(self):\n self.buff = None\n self.index = 0\n\n def next(self):\n if self.buff is None or self.index == len(self.buff):\n self.buff = self.next_line()\n self.index = 0\n val = self.buff[self.index]\n self.index += 1\n return val\n\n def next_line(self):\n return sys.stdin.readline().split()\n\n def next_ints(self):\n return [int(x) for x in sys.stdin.readline().split()]\n\n def next_int(self):\n return int(self.next())\n\n def solve(self):\n n = self.next_int()\n p, t = 0, 1\n r = set()\n s = set()\n r.add(p)\n while (p, t) not in s:\n s.add((p, t))\n p = (p + t) % n\n t = (t + 1) % n\n r.add(p)\n print('YES' if n == len(r) else 'NO')\n\n\nif __name__ == '__main__':\n Main().solve()\n", "n=int(input())\r\na=set()\r\ni=0\r\nstep=1\r\nfor _ in range(2*n):\r\n a.add(i%n)\r\n i+=step\r\n step+=1\r\nif len(a)==n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n = int( input())\r\nif n & n -1 > 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "n = int(input())\r\nprint('YNEOS'[n & (n - 1) > 0 :: 2])", "import sys\nfrom math import gcd\ndef li(): return list(map(int, sys.stdin.readline().split()))\ndef inp(): return int(sys.stdin.readline())\n\nn=inp()\nif n&n-1:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n\n# # This code is being submitted by Pratyush Parashar\n# # This code is being submitted by Pratyush Parashar\n# # This code is being submitted by Pratyush Parashar\n# # This code is being submitted by Pratyush Parashar\n# # This code is being submitted by Pratyush Parashar\n# # This code is being submitted by Pratyush Parashar\n# # This code is being submitted by Pratyush Parashar\n# # This code is being submitted by Pratyush Parashar\n# # This code is being submitted by Pratyush Parashar\n# # This code is being submitted by Pratyush Parashar\n \t\t \t \t\t\t\t \t\t \t\t\t \t \t \t \t", "n, c, k = int(input()), 0, 0\r\nv = [[False] * n for i in range(n)]\r\nwhile not v[c][k]:\r\n v[c][k] = True\r\n k = (k + 1) % n\r\n c = (c + k) % n\r\nprint('YES' if all(any(x) for x in v) else 'NO')", "n = int(input())\na = [0 for i in range(n)]\na[0] = 1\nk = 1\nc = 0\ncur = 0\n#print(a)\nfor i in range(1000):\n cur = (cur + k) % (n)\n a[cur] = 1\n k += 1\nif a.count(0) == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "h = (int(input()))\r\n\r\nl = [1,2,4,8,16,32,64,128,256,512]\r\n\r\nif h in l: print('YES')\r\n\r\nelse: print('NO')\r\n", "n = int(input())\r\nd= {}\r\nfor i in range(2*n) :\r\n\ta = int((i/2*(i+1))%n)\r\n\tif d.setdefault(a) == None :\r\n\t\td[a] = 1\r\n\r\n\r\nif len(d) == n :\r\n\tprint('YES')\r\nelse :\r\n\tprint('NO')\r\n\r\n", "n = int(input())\n\ndef main(n, parity):\n index = 0\n hassocks = [x for x in range(n)]\n for i in range(parity):\n index = (index + i) % n\n if index in hassocks:\n del hassocks[hassocks.index(index)]\n if hassocks == []:\n return 'YES'\n else:\n return 'NO'\n\nif n % 2 == 1:\n print(main(n, n))\nelse:\n print(main(n, (2 * n)))\n", "num = int(input())\ns = set()\ns2 = set()\n\ncurr = 1%num\ncurr_min = 1%num\ns.add(curr)\ns2.add((curr, curr_min))\nwhile True:\n curr_min = (curr_min + 1) % num\n curr = (curr + curr_min) % num\n s.add(curr)\n if (curr, curr_min) in s2:\n if len(s) == num:\n print(\"YES\")\n else:\n print(\"NO\")\n break\n s2.add((curr, curr_min))\n \t\t \t \t\t\t\t\t \t\t \t\t\t\t \t \t \t", "m = (int(input()));f = [1,2,4,8,16,32,64,128,256,512]\r\nif m in f:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n" ]

[ "xyzk = [int(i) for i in input().split()]\r\nk=xyzk[3]\r\nx, y, z = sorted([xyzk[0],xyzk[1],xyzk[2]])\r\nx = min(k // 3 + 1, x)\r\ny = min((k - x + 1) // 2 + 1, y)\r\nz = min(k - x - y + 3, z)\r\nprint(x * y * z)", "x,y,z,k=map(int,input().split())\r\na,b,c=1,1,1\r\nwhile k//3 and (a<x or b<y or c<z):p=k//((a<x)+(b<y)+(c<z));A=min(x-a,p);B=min(y-b,p);C=min(z-c,p);a+=A;b+=B;c+=C;k-=A+B+C\r\nwhile k and (a<x or b<y or c<z):\r\n\tif a<x:a+=1;k-=1\r\n\tif k and b<y:b+=1;k-=1\r\n\tif k and c<z:c+=1;k-=1\r\nprint(a*b*c)", "a = b = c = 1\r\nx, y, z, k = [int(s) for s in input().split()]\r\n\r\nwhile (a < x or b < y or c < z) and k > 0:\r\n if k > 0 and a < x:\r\n a += 1\r\n k -= 1\r\n if k > 0 and b < y:\r\n b += 1\r\n k -= 1\r\n if k > 0 and c < z:\r\n c += 1\r\n k -= 1\r\n\r\nprint(a * b * c)", "width, length, height, max_cuts_amount = map(int, input().split())\r\n \r\ndimensions_max_cuts_amounts = [width - 1, length - 1, height - 1]\r\n \r\nif sum(dimensions_max_cuts_amounts) <= max_cuts_amount:\r\n dimensions_cuts_amounts = dimensions_max_cuts_amounts\r\nelse:\r\n cuts_per_dimension_amount = min(max_cuts_amount // 3, min(*dimensions_max_cuts_amounts))\r\n dimensions_cuts_amounts = [cuts_per_dimension_amount, cuts_per_dimension_amount, cuts_per_dimension_amount]\r\n left_cuts_amount = max_cuts_amount - 3 * cuts_per_dimension_amount\r\n \r\n while left_cuts_amount > 0:\r\n for dimension_index in range(3):\r\n if left_cuts_amount > 0 and dimensions_max_cuts_amounts[dimension_index] - dimensions_cuts_amounts[dimension_index] > 0:\r\n dimensions_cuts_amounts[dimension_index] += 1\r\n left_cuts_amount -= 1\r\n \r\n \r\nresult = 1\r\nfor dimension_cuts_amount in dimensions_cuts_amounts:\r\n result *= (dimension_cuts_amount + 1)\r\nprint(result)", "x, y, z, k = map(int, input().split())\r\nx, y, z = sorted((x, y, z))\r\na = min(k // 3, x - 1)\r\nb = min((k - a) // 2, y - 1)\r\nc = min(k - a - b, z - 1)\r\nprint((a + 1) * (b + 1) * (c + 1))\r\n", "'''\r\nBeezMinh\r\n19:35 UTC+7\r\n12/08/2023\r\n'''\r\nx, y, z, k = map(int, input().split())\r\nsides = sorted([x, y, z])\r\ncuts = [0, 0, 0]\r\nans = 1\r\nfor i in range(3):\r\n a = min(sides[i] - 1, k // (3 - i))\r\n cuts[i] = a\r\n k -= a\r\n ans *= (a + 1)\r\nprint(ans)", "hi=list()\r\nx, y, z, k=map(int, input().split())\r\nfor i in range(3):\r\n\thi.append(1)\r\nwhile 1:\r\n\tiss=True\r\n\tif hi[0]<x and k>0:\r\n\t\thi[0]+=1\r\n\t\tk-=1\r\n\t\tiss=False\r\n\tif hi[1]<y and k>0:\r\n\t\thi[1]+=1\r\n\t\tk-=1\r\n\t\tiss=False\r\n\tif hi[2]<z and k>0:\r\n\t\thi[2]+=1\r\n\t\tk-=1\r\n\t\tiss=False\r\n\tif k==0 or iss:\r\n\t\tbreak\r\nprint(hi[0]*hi[1]*hi[2])", "x, y, z, k = [int(value) for value in input().split()]\r\n\r\nx, y, z = sorted([x, y, z])\r\n\r\na = min(k // 3, x - 1)\r\nk -= a\r\nb = min(k // 2, y - 1)\r\nk -= b\r\nc = min(k, z - 1)\r\n\r\nprint((a + 1) * (b + 1) * (c + 1))\r\n", "x, y, z, k = map(int, input().split())\r\n\r\nx, y, z = sorted([x, y, z])\r\n\r\na = min(k // 3, x - 1) + 1\r\nk -= a - 1\r\nb = min(k // 2, y - 1) + 1\r\nk -= b - 1\r\nc = min(k, z - 1) + 1\r\n \r\nprint(a * b * c)\r\n" ]

[ "a = int(input())\r\nif ( a % 2 ):\r\n print('7', end='')\r\n a -= 3\r\nwhile (a > 0) :\r\n a -= 2\r\n print('1', end='')", "a=int(input())\r\nif a%2==0:print(\"1\"*(a//2))\r\nelse:\r\n print(\"7\"+\"1\"*((a-3)//2))", "n = int(input())\r\nif n % 2 == 0:\r\n for i in range(0, int(n/2)):\r\n print('1', end='')\r\nelse:\r\n print('7', end='')\r\n for i in range(0, int(n/2)-1):\r\n print('1', end='')", "i=int(input())\r\nc='1'*(i//2)\r\nif i%2==1 and i>2: c='7'+c[1:]\r\nprint(c)", "i = input()\r\nif (int(i) % 2) == 0:\r\n while int(i) > 0:\r\n i = int(i) - 2\r\n print(1, end = '')\r\nelse:\r\n print(7, end = '')\r\n i = int(i) - 3\r\n while int(i) > 0:\r\n i = int(i) - 2\r\n print(1, end = '')", "inpt = int(input())\r\nans = \"\"\r\nif inpt & 1 == 1:\r\n inpt = inpt - 3\r\n ans = \"7\"\r\nans+= \"1\" * ( inpt >> 1)\r\nprint(ans)", "n = int (input())\r\nans = []\r\nif n%2==1:\r\n\tans.append('7')\r\n\tn-=3\r\nfor i in range (1,n,2):\r\n\tans.append('1')\r\nfor i in range(0,len(ans)):\r\n\tprint(ans[i],end='')\r\n", "n = int(input())\r\ncnt = n // 6\r\nn = n % 6\r\nans = \"\"\r\nif n == 5:\r\n ans += \"71\"\r\nif n == 4:\r\n ans += \"11\"\r\nif n == 3:\r\n ans += \"7\"\r\nif n == 2:\r\n\tans += \"1\"\r\nif n == 1:\r\n\tcnt = cnt - 1\r\n\tans += \"711\"\r\nwhile cnt > 0:\r\n ans += \"111\"\r\n cnt = cnt - 1\r\nprint(ans)", "energia = int(input())\r\nif energia % 2 == 0:\r\n print(int(\"1\" * (energia // 2)))\r\nelse:\r\n print(int(\"7\" + \"1\" * (energia // 2 - 1)))", "n=int(input())\r\n\r\nfor i in range(n):\r\n\tif n%2==0 and n!=0:\r\n\t\t\tprint(1,end='')\r\n\t\t\tn=n-2\r\n\telif n%2!=0 and n!=0:\r\n\t\tprint(7,end='')\r\n\t\tn=n-3", "import random\r\nimport os\r\n\r\nn=input()\r\nn=int(n)\r\nif(n%2==0):\r\n\tfor i in range(int(n/2)):\r\n\t\tprint('1',end='')\r\nelse:\r\n print('7',end='')\r\n for i in range(int((n-3)/2)):\r\n print('1',end='')\r\n\r\n", "n=int(input())\r\ns=\"\"\r\nif n%2==0:\r\n s+= n//2 *\"1\"\r\nelse:\r\n s+= \"7\"\r\n s+= (n-3)//2 *\"1\"\r\nprint(int(s))\r\n", "from math import *\r\nn=int(input())\r\nif n % 2 != 0:\r\n n -= 3;\r\n print (7, end = \"\")\r\ni = 0\r\nwhile i < n:\r\n i += 2\r\n print (1, end = \"\")", "n = int(input())\r\nif n % 2 == 0:\r\n n = n // 2\r\n while n:\r\n print('1', end='')\r\n n -= 1\r\nelse:\r\n n -= 1\r\n n = n // 2\r\n ans_= []\r\n while n:\r\n ans_.append('1')\r\n n -= 1\r\n ans_[0] = '7'\r\n print(''.join(ans_))\r\n", "n = int(input())\r\n\r\nif n%2 ==0:\r\n print(\"1\"*(n//2))\r\nelse:\r\n print(\"7\"+\"1\"*((n//2)-1))\r\n", "n = int(input())\r\nif n%2:\r\n r = \"7\"\r\n n-=3\r\n r = r + \"1\"*(n//2)\r\n print(r)\r\nelse:\r\n print(\"1\"*(n//2))\r\n", "n=int(input())\r\nk1=n//2\r\nk2=n//3\r\nif(k1!=k2):\r\n if(n%2==0):\r\n for i in range(0,k1):\r\n print(1,end='')\r\n else:\r\n print(7,end='')\r\n for i in range(1,k1):\r\n print(1,end='')\r\nelse:\r\n for i in range(0,k1):\r\n print(7,end='')\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n", "n = int(input())\r\ns = []\r\nif n % 2 == 1:\r\n s.append('7')\r\n n -= 3\r\nfor i in range(n//2):\r\n s.append('1')\r\nprint(''.join(s))\r\n ", "n = int(input())\r\ns = ''\r\nif(n%2==0):\r\n s = '1'*int(n/2)\r\nelse:\r\n s = '7' + '1'*int((n-3)/2)\r\nprint(s)\r\n", "import sys\r\ndata = int(input())\r\nif(data%2 == 0):\r\n y = data/2\r\n while(y > 0):\r\n print(1, end='')\r\n y=y-1\r\nelse:\r\n print(7, end='')\r\n y = (data-3)/2\r\n while(y > 0):\r\n print(1, end='')\r\n y=y-1\r\n", "n = int(input())\r\ns = \"\"\r\nif(n % 2 == 1):\r\n s = s + \"7\"\r\n n = n - 2;\r\nfrom math import *\r\nfor i in range(0, floor(n / 2)):\r\n s = s + \"1\"\r\nprint(s);\r\n", "n=int(input())\r\nif n>=2:\r\n if n%2==0:\r\n print(\"1\"*int(n/2))\r\n else:\r\n print(\"7\"+str(\"1\"*int((n-3)/2)))\r\nelse:\r\n print(0)", "n = int(input())\r\nif n%2 == 0:\r\n\tprint(\"1\"*int((n/2)))\r\nelse:\r\n\tprint(\"7\" + \"1\"*int(((n-3)/2)))", "n=input()\r\nn=int(n)\r\n\r\nres=''\r\n\r\nif n % 2 == 0 :\r\n\twhile n>0:\r\n\t res=res+'1'\r\n\t n=n-2\r\nelse:\r\n res=res+'7' \r\n n=n-3\r\n while n>0:\r\n res=res+'1'\r\n n=n-2\r\nprint (res) \r\n ", "n = int(input())\r\ns = ''\r\nif (n % 2) == 0:\r\n\tfor i in range(n // 2):\r\n\t\ts += '1'\r\nelse:\r\n\ts += '7'\r\n\tfor i in range((n - 3) // 2):\r\n\t\ts += '1'\r\nprint(s)\r\n", "#####################################################\n# Solved by Sivefunc -> https://gitlab.com/sivefunc #\n# Problem name: Maximum Number #\n# https://codeforces.com/problemset/problem/774/C #\n#####################################################\n\nn = int(input()) # Number of sections which can be highlighted\n\n# Table of values\n# 2 Sections highlighted = Digit 1\n# 3 Sections highlighted = Digit 7\n# 4 Sections highlighted = Digit 4\n# 5 Sections highlighted = Digits 2, 3 and 5 -> max digit here is 5\n# 6 Sections highlighted = Digits 0, 6 and 9 -> max digit here is 9\n# 7 Sections highlighted = Digit 8\n\n# After decomposition\n# Max number of even sections 4, 6, 8, 10 ... n is eq to n / 2\n# Max number of odd sections 3, 5, 7, 9 ... n is eq to the max number of\n# even sections but replacing first number to 7\n\nmax_int = (n // 2) * '1' if n % 2 == 0 else '7' + (n // 2 - 1) * '1'\nprint(int(max_int))\n", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn=ii()\r\nprint('7'+((n-3)//2)*'1' if n&1 else (n//2)*'1')", "n=int(input())\r\nprint(\"7\"*(n%2)+\"1\"*(((n-3*(n%2))//2)))", "n = int(input())\r\nif n % 2 != 0:\r\n print (7, end=\"\")\r\n n -= 3\r\n\r\nfor i in range(int(n/2)):\r\n print (1, end=\"\")\r\n", "n=int(input())\r\nif n%2==0:\r\n for i in range(n//2):\r\n print(1,end=\"\")\r\nelse:\r\n print(7,end=\"\")\r\n n=n-3\r\n for i in range(n//2):\r\n print(1,end=\"\")\r\nprint()\r\n", "#a = {0:6,1:2,2:5,3:5,4:4,5:5,6:6,7:3,8:7,9:6}\n#b = {6:9,7:8,5:5,4:4,2:1,3:7}\nn = int(input())\na,b = n//2,n%2\nif b==0:\n print('1'*a)\nelse:\n print('7'+'1'*(a-1))", "n = int(input())\nif n % 2 == 1:\n\tprint(7, end=\"\")\n\tn -= 3\nelse:\n\tprint(1, end=\"\")\n\tn -= 2\nfor i in range(int(n / 2)):\n\tprint(1, end=\"\")\nprint()\n", "import sys \r\n\r\ndef getMultiLineInput() -> []:\r\n lines = []\r\n while True:\r\n try:\r\n lines.append(input())\r\n except EOFError:\r\n break\r\n\r\n return lines\r\n\r\ndef printResult(number: int):\r\n result = 0\r\n remained = number\r\n \r\n #\r\n check = int(number / 2)\r\n remained = number % 2\r\n if remained == 1:\r\n check -= 1\r\n remained += 2\r\n \r\n #\r\n list = []\r\n if check > 0:\r\n list = ['1']*check\r\n\r\n if remained > 0:\r\n list.insert(0, '7')\r\n\r\n result = int(''.join(list))\r\n print(result)\r\n \r\n# main\r\ninputs = getMultiLineInput()\r\nnumber = int(inputs[0])\r\nprintResult(number)", "n=int(input())\r\nk=int(n/2)-1\r\nif n-k*2==3:\r\n print(7,end='')\r\nelse:\r\n print(1,end='')\r\nfor i in range(k):\r\n print(1,end='')", "n = int(input());\r\nif (n % 2 != 0):\r\n s = '7';\r\n n -= 3;\r\nelse:\r\n s = '1';\r\n n-=2;\r\nfor i in range(n // 2): s = s + '1';\r\nprint(s);\r\n", "def max_number(n):\r\n if n % 2 == 1:\r\n return '7' + '1' * ((n - 3) // 2)\r\n return '1' * (n // 2)\r\n\r\n\r\nprint(max_number(int(input())))\r\n", "n = int(input())\r\ni = n // 2 - 1\r\nif n % 2==0:\r\n print(1, end='')\r\nelse:\r\n print(7, end='')\r\n\r\nwhile i>0:\r\n print(1, end='')\r\n i=i-1", "n = int(input())\r\nif (n%2!=0):\r\n print(7,end=\"\")\r\n for i in range(1,int(n/2)):\r\n print(1,end = \"\")\r\nelse:\r\n for i in range(0,int(n/2)):\r\n print(1,end = \"\")", "from sys import stdin\n\n\ndef line():\n return stdin.readline().strip()\n\nif __name__ == \"__main__\":\n n = int(line())\n num = '7' if n % 2 == 1 else '1'\n print(num+ '1'*(n//2-1))", "n = int(input())\nw = 0\ny = 0\nfor i in range(n//2+1):\n j = (n-2*i)//3\n if i+j > w:\n w = i+j\n y = j\nfor i in range(y):\n print('7', end='')\nfor i in range(w-y):\n print('1', end='')\nprint('')\n", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\ns = \"\"\r\nif (n % 2 == 1):\r\n n -= 3\r\n s = \"7\"\r\n\r\nfor i in range(0, n , 2):\r\n s += \"1\"\r\nprint(s)", "n=int(input())\nif(n%2==0):\n\tx=n/2\n\tx=int(x)\n\tfor i in range(0,x):\n\t\tprint(1,end='')\nelse:\n\tprint(7,end='')\n\tx=n-3\n\tx=x/2\n\tx=int(x)\n\tfor i in range(0,x):\n\t\tprint(1,end='')\n\t\n", "#!/usr/bin/python\nimport sys\nn = input()\nn = int(n)\n#list = [6,2,5,5,4,5,6,3,7,6]\nans = []\nwhile n > 0:\n\tif n == 3:\n\t\tans.append(7)\n\t\tn -= 3\n\tif n >= 2:\n\t\tans.append(1)\t\n\t\tn -= 2\n\nans.reverse()\nfor i in ans:\n\tsys.stdout.write(str(i));\nprint\n\n", "n=int(input())\r\na=\"\"\r\nif n%2 and n>=3:n-=3;a+='7'\r\nwhile n>0:n-=2;a+='1'\r\nprint(a)", "a=int(input())\r\nif a%2==1:\r\n s='7'+'1'*int((a-3)/2)\r\nelse:\r\n s='1'*int(a/2)\r\nprint(s)", "\r\n\r\nn = int(input())\r\nans = ''\r\n\r\nif (n % 2 != 0):\r\n ans += '7'\r\n n-=3\r\n\r\nwhile (n >= 2):\r\n ans += '1'\r\n n-=2\r\n\r\nprint(ans)", "n = input()\nn = int(n)\nans = \"\"\nif(n % 2 == 1):\n ans += \"7\"\n n -= 3\nwhile(n > 0):\n ans += \"1\"\n n -= 2\nprint(ans)", "n = int(input())\r\nprint(('7' if (n & 1) else '1') + (n // 2 - 1) * '1')", "n = int(input())\r\nif n == 2:\r\n print(1)\r\nelse:\r\n if n % 2 == 1:\r\n k = (n - 3) // 2\r\n print('7'+'1'*k)\r\n else:\r\n print('1'*(n // 2))\r\n", "a = int(input())\r\nif a % 2 == 1:\r\n print(\"7\" + \"1\" * ((a - 3) // 2))\r\nelse:\r\n print(\"1\" * (a // 2))", "n = eval(input())\r\nstr = \"\"\r\nif n % 2 == 0:\r\n\tfor i in range(0, int(n/2)):\r\n\t str += \"1\"\r\n\r\nelse:\r\n\tstr += \"7\"\r\n\tfor i in range(1, int((n - 1)/2)):\r\n\t\tstr += \"1\"\r\n\t\t\r\nprint(str)\t\t", "n = int(input())\r\nma = {1:0 , 2: 1 , 3:7 , 4: 7 , 5: 7 , 6 : 9 , 7: 9, 0: 0}\r\nx = n//2\r\ny = n%2\r\nif n%2: ans = \"7\"+\"1\"*(x-1)\r\nelse: ans = '1'*(x)\r\nprint(ans)\r\n", "sections=int(input())\r\n\r\nones = int(sections / 2)\r\nprintSeven = False\r\nif (sections % 2 != 0):\r\n ones = ones - 1\r\n printSeven = True\r\n\r\nif (printSeven):\r\n print('7', end='')\r\n\r\nprint('1' * ones)", "#!/bin/python3\r\n\r\nimport sys\r\nn = int(input())\r\nif n % 2 == 1:\r\n print(7, end ='')\r\n n -= 3\r\nwhile n > 0:\r\n print(1, end ='')\r\n n -= 2", "n = int(input())\r\nprint('7'+'1'*((n - 3)// 2)if n % 2 else '1'*(n // 2))", "# LUOGU_RID: 91402376\nn = int(input())\r\nif n % 2 == 1:\r\n print(7, end='')\r\n n -= 3\r\nprint('1' * (n // 2))\r\n", "n=int(input())\r\nprint(\"7\"+\"1\"*((n-3)//2))if (n%2)&1 else print(\"1\"*(n//2))", "n=int(input())\r\nif n==2:\r\n print(1)\r\n exit()\r\nif n==3:\r\n print(7)\r\n exit()\r\nd=int(n%2)\r\nk=int(n/2)\r\n\r\nif d==0:\r\n for i in range (0,k):\r\n print ('1',end=\"\")\r\n exit()\r\nif d==1:\r\n k=k-1\r\n print ('7',end=\"\")\r\n for i in range (0,k):\r\n print ('1',end=\"\")\r\n exit()\r\n ", "n=int(input())\r\ns=''\r\nif n%2:\r\n s+='7'\r\n n-=3\r\n \r\ns = s + '1' * (n//2)\r\nprint(s)", "n = int(input())\r\nif n & 1:\r\n print(\"7\", end='')\r\n n -= 3\r\nprint(\"1\" * (n // 2))", "n = int(input()); \r\n\r\nif n%2 == 1:\r\n print(\"7\", end = \"\");\r\n n -= 3;\r\n \r\nwhile n > 0:\r\n print(\"1\", end = \"\");\r\n n -= 2;", "n = int(input())\r\ns = ''\r\nif n % 2 == 1:\r\n s += '7'\r\n n -= 3\r\nwhile n != 0:\r\n s += '1'\r\n n -= 2\r\nprint(s);\r\n", "n=int(input(''))\r\nif n%2==0:\r\n s=\"\"\r\n for _ in range(0,int(n/2)):\r\n s+='1'\r\n print(s)\r\nelse:\r\n s=\"7\"\r\n for _ in range(0,int(n/2-1)):\r\n s+='1'\r\n print(s)", "n = int(input())\r\nif n == 2:\r\n print(1)\r\nelif n == 3:\r\n print(7)\r\nelse:\r\n ans = ['1'] * (n // 2)\r\n if n % 2 != 0:\r\n ans[0] = '7'\r\n print(''.join(ans))\r\n", "n = int(input())\r\nif (n % 2 == 1):\r\n print('7', end = '')\r\n n -= 3\r\ni = 0\r\nwhile (i != n):\r\n print('1', end = '')\r\n i += 2\r\nprint()", "#####################################################\n# Solved by Sivefunc -> https://gitlab.com/sivefunc #\n# Problem name: Maximum Number #\n# https://codeforces.com/problemset/problem/774/C #\n#####################################################\n\nn = int(input()) # Number of sections which can be highlighted\n\nmax_int = (n // 2) * '1' if n % 2 == 0 else '7' + (n // 2 - 1) * '1'\nprint(int(max_int))\n", "N=int(input())\nif N%2:\n print(7,end=\"\")\n N-=3\nprint(\"1\"*(N//2))\n", "def max_number(n):\r\n a = ''\r\n for i in range(n % 2):\r\n a += '7'\r\n for i in range(n // 2 - n % 2):\r\n a += '1'\r\n return a\r\n\r\n\r\nprint(max_number(int(input())))\r\n", "n=int(input())\r\nc=\"\"\r\nif n%2==1:\r\n n-=3\r\n c=\"7\"\r\nfor i in range(0,n,2):\r\n c+=\"1\"\r\nprint(c)", "N=int(input())\r\nk=\"\"\r\nif(N%2==1):\r\n N=N-3\r\n k+=\"7\"\r\nif(N%2==0):\r\n for i in range(0,N//2):\r\n k+=\"1\"\r\nprint(k)", "n = int(input())\r\n\r\nv = []\r\nans = 0\r\nif (n%2 != 0):\r\n\tv.append(\"7\")\r\n\tn -= 3\r\n\r\nwhile (n > 0):\r\n\tv.append(\"1\")\r\n\tn -= 2\r\n\r\n\r\nfor i in range(len(v)):\r\n\tprint(v[i], end=\"\")", "n = int(input())\r\nres = ''\r\nif n % 2 == 0:\r\n\twhile n > 0:\r\n\t\tres += '1'\r\n\t\tn -= 2\r\nelse:\r\n\tres += '7'\r\n\tn -= 3\r\n\twhile n > 0:\r\n\t\tres += '1'\r\n\t\tn -= 2\r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = n//2\r\nif n % 2:\r\n print('7' + (a-1)*'1')\r\nelse:\r\n print(a*'1')", "x = int(input())\r\n\r\nif x % 2 == 1:\r\n ans = \"7\" + (((x - 3) // 2) * \"1\")\r\n\r\nelse:\r\n ans = (x // 2) * \"1\"\r\n\r\nprint(ans)", "n = int(input())\r\n\r\nif n & 1 :\r\n print (7, end = '')\r\n for i in range((n - 3) // 2) :\r\n print (1, end = '')\r\nelse :\r\n for i in range(n // 2) :\r\n print (1, end = '')\r\nprint ('')\r\n", "n = int(input())\r\nif n % 2 == 0:\r\n print('1'*(n//2))\r\nelse:\r\n print('7'+'1'*((n-3)//2))", "n=int(input())\r\nif n%2==0:print('1'*(n//2))\r\nelse:print('7'+'1'*((n-3)//2))\r\n", "N = int(input())\n\nans = ''\nif N % 2:\n ans = ans + '7'\n N -= 3\n\nans = ans + '1' * (N // 2)\nprint(ans)\n", "n = int(input())\nnumber = [1] * (n // 2)\nif n % 2:\n number[0] = 7\nprint(''.join(map(str, number)))\n", "n=int(input())\r\nfor k in range(0, n%2) : print('7', end='')\r\nfor k in range(0, n//2-n%2) : print('1', end='')", "n=int(input())\r\nans=\"\"\r\nif n%2!=0:\r\n\tans+=\"7\"\r\n\tn-=3\r\nprint(ans+\"1\"*(n//2))", "ans=''\nn = int(input())\n\nif n%2==0:\n while n>0:\n ans+='1'\n n-=2\nelif n%2!=0 and n>=3:\n ans+='7'\n n-=3\n while n>0:\n ans+='1'\n n-=2\nprint (ans)\n", "n=int(input())\r\ns=\"\"\r\nn-=2\r\nif(n&1):\r\n\tc=(n-1)//2\r\n\twhile(c>0):\r\n\t\ts+=\"1\"\r\n\t\tc-=1\r\n\ts=\"7\"+s\r\n\tprint(s)\r\nelse:\r\n\tc=n//2\r\n\twhile(c>0):\r\n\t\ts+=\"1\"\r\n\t\tc-=1\r\n\ts+=\"1\"\r\n\tprint(s)\r\n", "a = int(input())\r\nx = a % 2;\r\n\r\nif x == 1:\r\n b = int((a / 2));\r\n b = b - 1;\r\n str = \"7\";\r\n for i in range(0,b):\r\n str += \"1\"\r\nelse :\r\n b = int(a / 2);\r\n str = \"1\";\r\n b = b - 1\r\n for i in range(0,b):\r\n str += \"1\"\r\nprint (str)\r\n", "n = int(input())\n\nline = ''\nif n % 2 == 0:\n one_num = int(n / 2)\n seven_num = 0\nelse:\n one_num = int(n / 2) - 1\n seven_num = 1\n\nfor i in range(seven_num):\n line += '7'\n\nfor i in range(one_num):\n line += '1'\n\nprint(line)\n", "a=int(input())\r\nif a%2==1:\r\n print(7,end='')\r\n a=a-3\r\nwhile a>0:\r\n print(1,end='')\r\n a=a-2", "# your code goes here\r\n# your code goes here\r\ni=input(\"\")\r\ni=int(i)\r\nb=i%2\r\nc=i/2\r\nc=int(c)\r\nif b==0:\r\n\tfor a in range (c):\r\n\t\tprint (\"1\", end=\"\")\r\nelse:\r\n\tprint (\"7\", end=\"\")\r\n\tc=(i-3)/2\r\n\tc=int(c)\r\n\tfor a in range(c):\r\n\t\tprint (\"1\", end=\"\")\r\n", "n = int(input())\r\nif n%2==1 :\r\n s='7'\r\n n=n-3\r\nelse:\r\n s='1'\r\n n=n-2\r\nwhile n>0 :\r\n s=s+'1'\r\n n=n-2\r\nprint(s)\r\n", "n=int(input())\r\nprint(\"7\"+(n-3)//2*\"1\"if n%2else n//2*\"1\")", "n = int(input())\nans = '1'*(n//2)\nif(n % 2 == 1):\n\tans = '7'+ans[1:]\nprint(ans)\n\n", "n = int(input())\r\nres = \"\"\r\n\r\nwhile n > 3:\r\n n = n-2;\r\n res = res + str(1)\r\n \r\nif n == 3:\r\n res = str(7) + res\r\n \r\nelse:\r\n res = str(1) + res\r\n \r\nprint(res)", "n = int(input())\r\nres = list()\r\nif n % 2 == 1:\r\n res.append(7)\r\n n -= 3\r\nwhile n > 0:\r\n res.append(1)\r\n n -= 2\r\nprint(\"\".join(map(str, res)))" ]

[ "import sys\r\nfrom math import factorial\r\ninput = sys.stdin.readline\r\n #X,Y,Z = list(map(int,input().strip().split()))\r\nn = input()\r\narr = list(map(str,input().strip().split()))\r\nroots = []\r\nfor i in arr:\r\n word = []\r\n for j in i :\r\n if j not in word:\r\n word.append(j)\r\n roots.append(word)\r\nsortedroots = []\r\nfor i in roots:\r\n i = list(i)\r\n i.sort()\r\n sortedroots.append(i)\r\nans = []\r\nfor j in sortedroots:\r\n if j not in ans :\r\n ans.append(j)\r\nprint(len(ans))\r\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=nmbr()\r\n d={}\r\n a=[]\r\n for wrd in input().split():\r\n a+=[''.join(sorted(set(wrd)))]\r\n # print(a)\r\n print(len(set(a)))", "\r\nR = lambda:map(int,input().split())\r\n\r\nn, = R()\r\na = input().split()\r\nans = set()\r\n\r\nfor i in a:\r\n i = \"\".join(list(sorted(set(i))))\r\n if i not in ans:\r\n ans.add(i)\r\n \r\nprint(len(ans))\r\n\r\n", "n=int(input())\r\nwords=input().split()\r\nsetx=set([])\r\nfor i in range(len(words)):\r\n k=sorted(words[i])\r\n l=set(k)\r\n words[i]=''.join(l)\r\n setx.add(words[i])\r\nprint(len(setx))\r\n", "def main():\n input()\n s = set()\n for w in input().split():\n l = [0] * 26\n for c in w:\n l[ord(c) - 97] = 1\n s.add(tuple(l))\n print(len(s))\n\n\nif __name__ == '__main__':\n main()\n", "n=input()\r\nop=[]\r\npo=list(map(str,input().split()))\r\nfor item in po:\r\n tam=list(set(item))\r\n tam.sort()\r\n op.append(\"\".join(tam))\r\nprint(len(set(op)))", "n=int(input())\r\na=list(input().split())\r\nd={}\r\nfor i in range(n):\r\n\ta[i]=sorted(a[i])\r\n\ts=a[i][0]\r\n\tfor j in range(len(a[i])-1):\r\n\t\tif a[i][j]!=a[i][j+1]:\r\n\t\t\ts+=a[i][j+1]\r\n\tif s in d:\r\n\t\td[s]+=1\r\n\telse:\r\n\t\td[s]=1\r\nprint(len(d))", "n = int(input())\r\na = list(input().split())\r\no = [([0] * 26)for u in range(n)]\r\nfor i in range(n):\r\n for u in range(len(a[i])):\r\n o[i][ord(a[i][u])-97] = 1\r\no.sort()\r\nkol = n\r\nfor t in range(1,n):\r\n if o[n-t] == o[n-t-1]:\r\n kol -= 1\r\nprint(kol)", "n =int(input())\r\nl = list(map(str,input().split()))\r\nl = [frozenset(i) for i in l]\r\ns = set()\r\nfor i in l:\r\n s.add(i)\r\nprint(len(s))", "l = int(input())\ns = list(input().split())\nroots = []\n\nfor i in range(l):\n root = []\n for j in range(len(s[i])):\n if s[i][j] not in root:\n root.append(s[i][j])\n root = sorted(root)\n \n if root not in roots:\n roots.append(root)\n \nprint(len(roots))\n\t\t \t\t \t\t \t\t\t \t \t\t \t \t\t\t\t \t\t", "input()\r\nl = input().split()\r\na = set()\r\nfor i in l:\r\n a.add(str(set(sorted(list(i)))))\r\nprint(len(a))", "def root(st):\n li = [False] * 40\n for c in st:\n li[ord(c) - ord('a')] = True\n ans = \"\"\n for i in range(len(li)):\n if li[i]:\n ans += chr(i + ord('a'))\n return ans\ndef main():\n n = int(input())\n li = [root(w) for w in input().split()]\n li.sort()\n count = 1\n for i in range(n - 1):\n if li[i] != li[i + 1]:\n count += 1\n print(count)\nif __name__ == \"__main__\":\n main()\n", "if __name__ == '__main__':\r\n n = int(input())\r\n words = input().split(' ')\r\n roots = {}\r\n for word in words:\r\n root_elems = {}\r\n for c in word:\r\n if not c in root_elems:\r\n root_elems[c] = True\r\n root_elems_list = sorted(list(root_elems.keys()))\r\n root_elems_str = \"\".join(root_elems_list)\r\n if not root_elems_str in roots:\r\n roots[root_elems_str] = True\r\n print(len(roots))\r\n", "input()\r\ns=input()\r\nm=[]\r\nfor i in s.split():\r\n m.append(frozenset(i))\r\nprint(len(set(m)))", "\r\nno_of_strings = int(input()) \r\nstrings = list(map(str,input().split())) \r\nroot = []\r\n\r\n\r\nfor each in strings:\r\n cur_str = set(list(each))\r\n if not(cur_str in root):\r\n root.append(cur_str) \r\n \r\n \r\nprint(len(root))\r\n\r\n", "n = int(input())\r\nl = map(lambda a: str(sorted(list(set(a)))), input().split())\r\nprint(len(set(l)))\r\n", "import sys\r\n\r\nn = sys.stdin.readline()\r\nwords = sys.stdin.readline().split()\r\n\r\nknown = set()\r\n\r\ndef to_root(s):\r\n return \"\".join(sorted(set([c for c in s])))\r\n\r\nfor word in words:\r\n known.add(to_root(word))\r\n\r\nprint(len(known))", "N = int(input())\r\narr = list(input().split())\r\nfor i in range(N):\r\n\tarr[i] = ''.join(sorted(list(set(arr[i]))))\r\nprint(len(set(arr)))", "n = int(input())\r\na = []\r\ns = input().split()\r\nans = 0\r\nfor i in range(n):\r\n if set(s[i]) not in a:\r\n a.append(set(s[i]))\r\n ans += 1\r\nprint(ans)", "a = int(input())\nrespuesta = set()\nlista =list(input().split())\n\nfor i in range(a):\n respuesta.add(str(sorted(set(lista[i]))))\nprint(len(respuesta))\n\t \t\t\t\t \t\t \t \t\t \t \t \t\t\t\t\t\t", "n=int(input())\ns=input()\na=s.split()\nroots=[]\nfor i in range(len(a)):\n root=''.join(sorted(set(a[i])))\n roots.append(root)\nans=set(roots)\n#print(ans)\nprint(len(ans))", "x=int(input())\r\na=list(input().split())\r\nl=0;b=['']\r\nfor i in range(x):\r\n y=set(a[i])\r\n if y not in b:\r\n b.append(y)\r\n l+=1\r\nprint(l)", "num = int(input())\nwords = input().split()\n\nprint(len(set(frozenset(word) for word in words)))\n", "def get_ints():\r\n return list(map(int, input().split()))\r\n\r\nN = int(input())\r\na = input().split()\r\nd = []\r\nfor i in a:\r\n n = [\"0\"]*26\r\n for c in i:\r\n if n[ord(c)-97] == \"0\":\r\n n[ord(c)-97] = \"1\"\r\n n = \"\".join(n)\r\n if n not in d:\r\n d.append(n)\r\nprint(len(d))", "n=int(input())\r\n\r\np=[y for y in input().split()]\r\nb=[]\r\nfor j in p:\r\n u=sorted(set(j))\r\n y=''.join(u)\r\n b.append(y)\r\nprint(len(set(b)))", "n=int(input())\r\na=[sorted(x) for x in input().split()]\r\nst=set()\r\nfor i in a:\r\n ar=[0]*26\r\n s=''\r\n for c in i:\r\n if ar[ord(c)-ord('a')]==0:\r\n s+=c\r\n ar[ord(c)-ord('a')]=1\r\n st.add(s)\r\nprint(len(st))", "def j(x):\r\n\treturn \"\".join(list(x))\r\ndef d(x):\r\n\treturn frozenset(list(x))\r\n \r\ninput()\r\nprint(len(list(set(list(map(frozenset,list(map(j, input().split(' ')))))))))", "test=input()\ns=input().split()\nq=[]\nfor each in s:\n p=set(list(each))\n if p not in q:\n q.append(p)\nprint(len(q))\n", "n=int(input())\r\nfrom itertools import combinations\r\nl=list(map(str,input().split()))\r\nli=[]\r\nfor i in l:\r\n lt=list(set(i))\r\n lt.sort()\r\n if lt not in li:\r\n li.append(lt)\r\nprint(len(li))\r\n \r\n", "\r\n\r\nn = input()\r\nl = input().split()\r\nans = list()\r\nfor i in l:\r\n s = set(i)\r\n s = \"\".join(sorted(s))\r\n ans.append(s)\r\nprint(len(set(ans)))\r\n ", "n=int(input())\r\na=list(input().split())\r\ntemp=[]\r\nfor item in a:\r\n if ''.join(sorted(set(item))) not in temp:\r\n temp.append(''.join(sorted(set(item))))\r\nprint(len(temp))\r\n\r\n ", "n=int(input())\r\nl=list(map(lambda x:tuple(sorted(set(x))),input().split()))\r\na=set()\r\nfor i in l:\r\n a.add(\"\".join(i))\r\n \r\nprint(len(a))\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n", "n=int(input())\nword=input().split()\nl=[]\nfor i in word:\n uni=set(i)\n if uni not in l:\n l.append(uni)\nprint(len(l))\n \t \t \t\t\t\t \t \t\t\t \t\t\t \t\t\t \t\t", "n = int(input())\r\na = input()\r\narr = []\r\nfor i in range(n-1):\r\n arr.append(set(a[:a.find(' ')]))\r\n a = a[a.find(' ')+ 1:]\r\narr.append(set(a))\r\nfor i in range(n):\r\n arr[i] = list(arr[i])\r\n arr[i].sort()\r\n arr[i] = ''.join(arr[i])\r\narr = set(arr)\r\nprint(len(arr))\r\n", "def get_obj_count(words):\r\n roots_list = [frozenset(word) for word in words]\r\n roots_set = set(roots_list)\r\n return len(roots_set)\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n words = [word for word in input().split()]\r\n print(get_obj_count(words))\r\n", "\r\nn = int(input())\r\nl = list(input().split())\r\nx = {''.join(sorted(set(s))) for s in l}\r\nprint(len(x))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 22 09:43:52 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nn = int(input())\r\nscript = input().split()\r\nroots = []\r\n\r\nfor i in range(n):\r\n s = script[i]\r\n root = []\r\n for j in range(len(s)):\r\n if s[j] not in root:\r\n root.append(s[j])\r\n root = ''.join(sorted(root))\r\n roots.append(root)\r\n\r\nprint(len(set(roots)))", "n = int(input())\r\nline = input()\r\nwords = line.split(' ')\r\nans = []\r\nfor word in words:\r\n ans.append(''.join(sorted(set(word))))\r\nprint(len(set(ans)))", "n = int(input())\r\ninp = input().split()\r\nalles = []\r\nfor i in range(n):\r\n sth = []\r\n a = sorted(inp[i])\r\n for j in range(len(a)):\r\n if(j+1==len(a) or a[j+1]!=a[j]):\r\n sth.append(a[j])\r\n alles.append(sth)\r\nalles = sorted(alles)\r\nk = 0\r\nfor i in range(len(alles)):\r\n if(i+1==n or alles[i+1]!=alles[i]):\r\n k = k+1\r\nprint(k)\r\n", "input()\r\nprint(len({tuple(sorted(set(w))) for w in input().split()}))\r\n\r\n", "n = int(input())\r\ns = input().split()\r\nprint(len(set(frozenset(i) for i in s)))", "n=int(input())\r\nllist=list(map(str,input().split()))\r\nllist_set=[]\r\nfor i in llist:\r\n llist_set.append(list(set(list(i))))\r\nllist.clear()\r\nfor i in llist_set:\r\n if i not in llist:\r\n llist.append(''.join(sorted(i)))\r\nprint(len(set(llist)))\r\n\r\n", "n = int(input())\r\nwords = input().split(\" \")\r\n\r\ndifferent = []\r\nfor word in words:\r\n s = set(word)\r\n if s not in different:\r\n different.append(s)\r\n\r\nprint(len(different))", "input()\r\nprint(len(set(frozenset(list(i)) for (i) in input().split())))\r\n", "import sys\r\nimport math\r\n\r\nn=int(input())\r\ncota=[str(0) for i in range(26)]\r\nlista=[]\r\nseta=set()\r\nstra=[str(x) for x in input().strip().split()]\r\nfor s in stra:\r\n suma=0\r\n cota = [str(0) for i in range(26)]\r\n for i in range(len(s)):\r\n cota[ord(s[i])-ord('a')]=str(1)\r\n #print(cota)\r\n stry=''.join(cota)\r\n seta.add(stry)\r\n#print(seta)\r\nprint(len(seta))\r\n", "def checkList(arr,word):\r\n for i in arr:\r\n if i == word:\r\n return True\r\n return False\r\n\r\ndef getRoot(word):\r\n newWord = \"\"\r\n for i in word:\r\n if not checkList(newWord,i):\r\n newWord += i\r\n if len(newWord) == 26:\r\n return \"abcdefghijklmnopqrstuvwxyz\"\r\n return sorted(newWord)\r\n\r\nnum = int(input())\r\narray = input().split(' ')\r\nroots = []\r\nfor i in range(26):\r\n roots.append([])\r\nfor i in array:\r\n currRoot = getRoot(i)\r\n found = False\r\n currArr = roots[len(currRoot)-1]\r\n for j in currArr:\r\n if j == currRoot:\r\n found = True\r\n if not found:\r\n roots[len(currRoot)-1].append(currRoot)\r\n\r\nlength = 0\r\nfor i in roots:\r\n length += len(i)\r\nprint(length)\r\n", "input()\ns = input().split()\nd = []\nr = 0\nfor x in s:\n t = set(x)\n if t not in d:\n d.append(t)\n r += 1\nprint(r)\n", "EPS = 1e-9\r\n\r\ndef main():\r\n n = int(input())\r\n a = [x for x in input().split()]\r\n word = set()\r\n for s in a:\r\n t = ''\r\n for c in range(ord('a'), ord('z') + 1):\r\n if s.count(chr(c)) != 0:\r\n t += chr(c)\r\n word.add(t)\r\n print(len(word))\r\n\r\n\r\n\r\n\r\n\r\nmain()", "n=int(input())\r\na=list(input().split())\r\nb=[]\r\nfor i in range(n):\r\n p=[]\r\n for j in range(len(a[i])):\r\n if not(a[i][j] in p):\r\n p.append(a[i][j])\r\n p.sort()\r\n pp=\"\"\r\n for ele in p:\r\n pp+=ele\r\n if not(pp in b):\r\n b.append(pp)\r\nprint(len(b)) ", "n = int(input())\r\n\r\ndata = list(map(str, input().split()))\r\n\r\nd = {}\r\n\r\n\r\ndef con(inp):\r\n return frozenset(list(inp))\r\n\r\nfor el in data:\r\n p = con(el)\r\n\r\n if d.get(p) is None:\r\n d[p] = 1\r\n\r\n\r\nprint(len(d.keys()))\r\n", "#!/usr/bin/env python3\nfrom sys import stdin\n\n\ndef solve(tc):\n n = int(stdin.readline().strip())\n ls = stdin.readline().split()\n dic = {}\n for s in ls:\n s = tuple(sorted(set(s)))\n if s in dic:\n dic[s] += 1\n else:\n dic[s] = 1\n \n print(len(dic))\n pass\n\n\nLOCAL_TEST = not __debug__\nif LOCAL_TEST:\n infile = __file__.split('.')[0] + \"-test.in\"\n stdin = open(infile, 'r')\n\ntcs = (int(stdin.readline().strip()) if LOCAL_TEST else 1)\ntc = 1\nwhile tc <= tcs:\n solve(tc)\n tc += 1", "input()\r\nwords = list(input().split())\r\n\r\ndistinct = set()\r\nfor word in words:\r\n\tletters = set()\r\n\tfor letter in word:\r\n\t\tletters.add(letter)\r\n\tdistinct.add(frozenset(letters))\r\n\r\nprint(len(distinct))", "int(input())\r\nl=[set(str(x)) for x in input().split()]\r\ns=[]\r\nfor e in l:\r\n if e not in s:\r\n s.append(e)\r\nprint(len(s))\r\n", "input()\nl = input().split()\na = set()\nfor i in l:\n a.add(str(set(sorted(list(i)))))\nprint(len(a))\n\t\t \t\t \t \t \t \t \t \t\t\t \t \t", "n=int(input())\r\nmanuscript=[]\r\nmanuscript=input().split()\r\nwords=[]\r\nfor s in manuscript:\r\n word=\"\"\r\n array=[]\r\n for i in range(len(s)):\r\n if s[i] not in array:\r\n array.append(s[i])\r\n array.sort()\r\n for j in array:\r\n word = word+j\r\n if word not in words:\r\n words.append(word)\r\nprint(len(words))", "n=int(input())\r\na=input().split(\" \")\r\nna=[]\r\nans=0\r\nfor s in a:\r\n sta=set(sorted(s))\r\n if sta not in na:\r\n na.append(sta)\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\ns = list(str(input()).split(\" \"))\r\nk = set([frozenset(i) for i in s])\r\nprint(len(k))\r\n", "n = int(input())\r\nans = []\r\narr = [x for x in input().split()]\r\nfor a in arr:\r\n curr = sorted(set(a))\r\n if curr not in ans:\r\n ans.append(curr)\r\nprint(len(ans))", "n = int(input())\r\nl = list()\r\nst = 'abcdefghijklmnopqrstuvwxyz'\r\nll = input().split()\r\nb = 0\r\nfor i in ll:\r\n lll = list()\r\n for k in st:\r\n if i.find(k) == -1:\r\n lll.append(0)\r\n else:\r\n lll.append(1)\r\n if (lll not in l):\r\n l.append(lll)\r\nprint(len(l))\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nleft right each coord\r\n'''\r\n\r\ndef solve():\r\n t = II()\r\n a = I().split()\r\n\r\n seen = set()\r\n base = ord('a')\r\n for word in a:\r\n letters = set(word)\r\n root = [0] * 26\r\n for c in string.ascii_lowercase:\r\n if c in letters:\r\n root[ord(c) - base] += 1\r\n seen.add(tuple(root))\r\n print(len(seen))\r\n\r\nsolve()", "n = input()\r\nst = set()\r\nfor word in input().split():\r\n s = set()\r\n for char in word:\r\n s.add(char)\r\n st.add(frozenset(s))\r\nprint(len(st))\r\n", "import atexit\r\nimport io\r\nimport sys\r\n\r\n# Buffering IO\r\n_INPUT_LINES = sys.stdin.read().splitlines()\r\ninput = iter(_INPUT_LINES).__next__\r\n_OUTPUT_BUFFER = io.StringIO()\r\nsys.stdout = _OUTPUT_BUFFER\r\n\r\[email protected]\r\ndef write():\r\n sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\n \r\n\r\ndef main():\r\n n = int(input())\r\n ss = input().split()\r\n s = set()\r\n for x in ss:\r\n s.add(''.join(sorted(list(set(x)))))\r\n print(len(s))\r\n \r\n \r\n\r\n \r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\na=[str(x) for x in input().split()]\r\nb=sorted(a)\r\nb.sort()\r\nd=[]\r\nfor i in range(0,n):\r\n c=b[i]\r\n c=sorted(set(b[i]))\r\n d.append(c)\r\ne=[]\r\nfor i in d:\r\n if i not in e:\r\n e.append(i)\r\nprint(len(e))", "n, s = int(input()), list(input().split())\r\na, ans = [], []\r\nfor i in range(n):\r\n b = set(sorted([x for x in s[i]]))\r\n a.append(b)\r\nfor i in a:\r\n if i not in ans:\r\n ans.append(i)\r\nprint(len(ans))", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\nlst = get_string().split()\r\ncount = []\r\n\r\nfor i in range(n):\r\n s = set(lst[i])\r\n if s not in count:\r\n count.append(s)\r\n\r\nprint(len(count))\r\n", "n=int(input())\r\na=set()\r\nap=a.add\r\nfor s in map(frozenset,input().split()):\r\n ap(s)\r\nprint(len(a))", "a=int(input())\r\nl=input().split()\r\np=[]\r\nfor y in l:\r\n l=list(set(list(y)))\r\n l.sort()\r\n p.append(''.join(l))\r\np=set(p)\r\nprint(len(p))\r\n", "n=int(input())\r\nl=input().split()\r\nlx=[]\r\nfor i in l:\r\n\ts=list(set(list(i)))\r\n\ts.sort()\r\n\tif s not in lx:\r\n\t\tlx.append(s)\r\nprint(len(lx))", "n=int(input())\r\na=list(input().split())\r\nb=[]\r\nfor i in range(len(a)):\r\n c=[]\r\n for j in a[i]:\r\n if not(j in c):\r\n c.append(j)\r\n c.sort()\r\n if not(c in b):\r\n b.append(c)\r\nprint(len(b))\r\n", "def go():\r\n n = int(input())\r\n\r\n words = input().split(' ')\r\n\r\n import string\r\n\r\n if n == 1:\r\n print(1)\r\n return\r\n\r\n output = {}\r\n for word in words:\r\n current = ''\r\n for i in string.ascii_lowercase:\r\n if i in word:\r\n current += i\r\n output[current] = None\r\n\r\n print(len(output.keys()))\r\ngo()", "n = int(input())\r\nstring = list(map(str, input().split()))\r\n\r\ndef make_seri(word):\r\n seri = \"\"\r\n for i in range(26):\r\n if word.find(chr(ord('a') + i)) >= 0:\r\n seri += \"1\"\r\n else:\r\n seri += \"0\"\r\n return seri\r\n\r\n\r\ndic = set()\r\n\r\nfor i in range(n):\r\n temp = make_seri(string[i])\r\n dic.add(temp)\r\n\r\nprint(len(dic))", "i = int(input())\r\nprint(len(set(map(frozenset, input().split()))))", "n=int(input())\r\ns=set()\r\nl=list(input().split())\r\nfor i in l:\r\n s.add(\"\".join(sorted(list(set(i)))))\r\nprint(len(list(s)))", "n = int (input())\r\ns = input().split()\r\nl = list()\r\nfor i in [sorted(list(set(i))) for i in s]:\r\n\tif i not in l:\r\n\t\tl.append(i)\r\nprint(len(l))", "n = int(input())\ns = input().split()\nl=[]\nfor i in s:\n l.append(''.join(sorted(list(set(i)))))\nprint(len(set(l)))\n\n\n\t \t\t\t\t \t \t\t\t\t\t \t\t\t\t\t \t \t \t\t", "N = int(input())\r\nlst = [k for k in input().split(\" \")]\r\n\r\ndistinct = []\r\n\r\nfor l in lst:\r\n dist = []\r\n for i in l:\r\n if i not in dist:\r\n dist.append(i)\r\n b = sorted(dist)\r\n if ''.join(b) not in distinct:\r\n distinct.append(''.join(b))\r\n\r\nprint(len(distinct))\r\n", "n = int(input())\r\nst = input().split()\r\na = []\r\n[a.append(''.join(list(set(sorted(i))))) for i in st]\r\nb = []\r\nb = list(set(a))\r\nprint(len(b))", "n=int(input())\r\nli=list(input().split())\r\ns=set()\r\nc=0\r\nfor i in li:\r\n l=list(set(i))\r\n l.sort()\r\n l=\"\".join(l)\r\n if l not in s:\r\n s.add(l)\r\n c=c+1\r\nprint(c)\r\n", "n=input()\r\nl=list(input().split())\r\nl=[set(x) for x in l]\r\nnl=[]\r\nfor x in l:\r\n\tif x not in nl:\r\n\t\tnl.append(x)\r\nprint(len(nl))\r\n", "n=input()\r\ns=list(map(str,input().split()))\r\nl=[]\r\nfor i in s:\r\n l.append(frozenset(set(i)))\r\nprint(len(set(l)))", "def objects (n) :\n ans = []\n for x in n:\n q = list(set(x))\n if len(ans) == 0:\n ans.append(q)\n else:\n for i in ans:\n k = 0\n if len(i) == len(q):\n for j in q:\n if j not in i:\n k = 1\n break\n if k == 0:\n break\n else:\n k = 1\n if k == 1:\n ans.append(q)\n \n \n \n \n return len(ans)\n\n\nt = int(input())\nn = input().split()\nprint (objects(n))\n", "input()\r\nprint(len(set(map(frozenset,input().split()))))\r\n", "n = int(input())\r\n\r\narr = input().split()\r\n\r\n\r\nans = set(frozenset(list(i)) for (i) in arr)\r\n\r\n\r\nprint(len(ans))", "\"\"\"Aramic script.\r\n\r\nhttp://codeforces.com/contest/975/problem/A\r\n\r\n\r\nIn Aramic language words can only represent objects.\r\n\r\nWords in Aramic have special properties:\r\n\r\n- A word is a root if it does not contain the same letter more than once.\r\n\r\n- A root and all its permutations represent the same object.\r\n\r\n- The root x of a word y is the word that contains all letters that appear in y\r\nin a way that each letter appears once. For example, the root of \"aaaa\", \"aa\",\r\n\"aaa\" is \"a\", the root of \"aabb\", \"bab\", \"baabb\", \"ab\" is \"ab\".\r\n\r\n- Any word in Aramic represents the same object as its root.\r\n\r\nYou have an ancient script in Aramic. What is the number of different objects\r\nmentioned in the script?\r\n\r\n\"\"\"\r\n\r\n\r\ndef solution(s):\r\n roots = set()\r\n for w in s:\r\n roots.add(tuple(sorted(set(w))))\r\n return len(roots)\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input().strip())\r\n s = input().strip().split()[:n]\r\n print(solution(s))\r\n", "n=int(input())\r\nl=list(map(str,input().split()))\r\nfor i in range(n):\r\n st=\"\".join(sorted(set(l[i])))\r\n l[i]=st\r\nl=set(l)\r\n# print(l)\r\nprint(len(l))\r\n", "n=int(input())\r\na=list(input().split())\r\ndic=[]\r\ncount=0\r\nfor val in a:\r\n s=list(set(sorted(val)))\r\n if s not in dic:\r\n dic.append(s)\r\n count+=1 \r\nprint(count)", "def main():\n input()\n print(len(set(''.join(sorted(set(w))) for w in input().split())))\n\n\nif __name__ == '__main__':\n main()\n", "import sys\n\n\ndef read(func=int):\n return func(sys.stdin.readline().strip())\n\ndef readList(func=int):\n return list(map(func, sys.stdin.readline().split()))\n\n\ndic = set()\nn = read()\nS = readList(str)\nfor word in S:\n chars = set()\n for char in word:\n chars.add(char)\n\n s = ''.join(sorted([x for x in chars]))\n dic.add(s)\n\n\nprint(len(dic))\n\n \t \t \t \t\t\t\t\t \t \t\t\t \t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\ninput()\r\nw = map(set, map(sorted, input()[:-1].split()))\r\nd = []\r\nfor i in w:\r\n if i not in d:\r\n d.append(i)\r\n\r\nprint(len(d))\r\n", "n = int(input())\r\nhave = []\r\nfor word in input().split():\r\n\troot = set(word)\r\n\tif root not in have:\r\n\t\thave.append(root)\r\nprint(len(have))", "n=int(input())\r\nl=input().split()\r\nll=[]\r\nfor i in range(n):\r\n ss=[]\r\n for j in range(len(l[i])):\r\n if l[i][j] not in ss:\r\n ss.append(l[i][j])\r\n ss.sort()\r\n if ss not in ll:\r\n ll.append(ss)\r\nprint(len(ll))\r\n", "n = int(input())\r\narr = list(input().split())\r\ns = set()\r\nfor st in arr:\r\n l = \"\".join(sorted(list(set(list(st)))))\r\n s.add(l)\r\nprint(len(s))", "from collections import Counter\ninput()\nwords = input().split()\nnum = {}\nfor word in words:\n root = list(Counter(word).keys())\n root.sort()\n root = ''.join(root)\n if root in num:\n num[root]+=1\n else:\n num[root] = 0\n\nprint(len(num))", "def main():\r\n sentence = input().split(\" \")\r\n words = []\r\n for i in sentence:\r\n word = \"\"\r\n array = []\r\n for n in range(len(i)):\r\n if i[n] not in array:\r\n array.append(i[n])\r\n array.sort()\r\n for j in array:\r\n word += j\r\n if word not in words:\r\n words.append(word)\r\n print(len(words))\r\nn = int(input())\r\nmain()\r\n", "n = int(input())\r\nL = list( input().split() )\r\nmask = \"0\"*26\r\n# print(mask)\r\nans = []\r\nfor string in L:\r\n temp = mask\r\n for ch in string:\r\n if temp[ ord(ch) - 97 ] == 1:\r\n continue\r\n else:\r\n ind = ( ord(ch)-97 )\r\n temp = temp[0: ind ] + \"1\" + temp[ ind + 1: ]\r\n if temp not in ans:\r\n ans.append(temp)\r\n # print(ans)\r\nprint(len(ans))\r\n", "n = input()\r\ns = input().split()\r\na = set()\r\nlist = []\r\nfor i in s:\r\n if set(i) not in list:\r\n list.append(set(i))\r\nprint(len(list))", "e=int(input())\r\nl1=input().split()\r\nfinal=[]\r\nfor i in l1:\r\n string=\"\"\r\n summer=0\r\n for x in i:\r\n if x not in string:\r\n string+=x\r\n temp=list(string)\r\n temp.sort()\r\n string=\"\".join(temp)\r\n if string not in final:\r\n final.append(string)\r\nprint(len(final))", "n=int(input())\r\nl=list(input().split())\r\nd=[]\r\nfor i in l:\r\n s1=set(i)\r\n if s1 not in d:\r\n d.append(s1)\r\nprint(len(d))", "import copy\r\ne=int(input())\r\na=set(input().split())\r\nprint(len(set([''.join(sorted(list(set(x)))) for x in a])))\r\n", "n = int(input())\r\nwords = input().split()\r\nwordsSorted = []\r\nfor w in words:\r\n temp = set(sorted(w))\r\n temp = ''.join(temp)\r\n wordsSorted.append(temp)\r\nanswer = set(wordsSorted)\r\nprint(len(answer))", "def main():\n input()\n d, x, s = {}, 1, set()\n for c in 'abcdefghijklmnopqrstuvwxyz':\n d[c] = x\n x *= 2\n for w in input().split():\n x = 0\n for c in w:\n x |= d[c]\n s.add(x)\n print(len(s))\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\na=input().split()\r\nb=[]\r\nfor k in range(len(a)):\r\n c=[]\r\n for p in a[k]:\r\n c.append(p)\r\n c=list(set(c))\r\n c.sort()\r\n c=''.join(c)\r\n if c not in b:\r\n b.append(c)\r\nprint(len(b))", "n = int(input())\r\ns = list(input().split())\r\ndic = dict()\r\nfor i in s:\r\n l2 = list(set(list(i)))\r\n l2.sort()\r\n l2 = ''.join(l2)\r\n if l2 in dic:\r\n pass\r\n else:\r\n dic[l2] = 1\r\nc = 0\r\n#print(dic)\r\nfor i in dic:\r\n c+=1\r\nprint(c)\r\n \r\n \r\n \r\n", "n=int(input())\r\nl=list(map(str,input().split()))\r\nd=[]\r\nfor s in l:\r\n s=set(s)\r\n if s not in d:\r\n d.append(s)\r\nprint(len(d))\r\n\r\n ", "input()\r\nwords = frozenset(map(frozenset,input().split()))\r\nprint(len(words))", "input()\r\nb=[]\r\nfor i in list(input().split()):\r\n x=set(list(i))\r\n if x not in b:\r\n b.append(x)\r\nprint(len(b)) ", "n=int(input())\r\nl=[]\r\na=list(map(str,input().split()))\r\nfor i in range(n):\r\n l.append(frozenset(a[i]))\r\nprint(len(set(l)))\r\n", "n = int(input())\r\na = list(input().split(\" \"))\r\ns = set()\r\nfor i in range(n):\r\n t = []\r\n for j in range(len(a[i])):\r\n if a[i][j] not in t:\r\n t.append(a[i][j])\r\n t = sorted(t)\r\n s.add(\"\".join(map(str, t)))\r\n\r\nprint(len(s))\r\n", "n=input()\r\nl=input().split()\r\nl=[set(a) for a in l]\r\nans=[]\r\nfor i in l:\r\n if i not in ans:\r\n ans.append(i)\r\n \r\nprint (len(ans))", "input()\r\narr = input().split(' ')\r\nprint(len(set([''.join(sorted(''.join(set(w)))) for w in arr])))\r\n", "\r\nn=int(input())\r\narr=list(map(str,input().split()))\r\nans=[]\r\nfor x in arr:\r\n\tx=list(set(x))\r\n\tx=sorted(x)\r\n\tif x not in ans:\r\n\t\tans.append(x)\r\nprint(len(ans))\r\n\r\n", "n = int(input())\r\ns = list(map(str, input().split()))\r\nl = []\r\nfor i in s:\r\n l.append(''.join(sorted(set(i))))\r\n #print(l) \r\nprint(len(set(l)))", "n = int(input())\nb = []\ns = input().split(\" \")\nfor i in s:\n\ta = [0]*26\n\tfor j in i:\n\t\ty = ord(j) - ord(\"a\")\n\t\ta[y] = 1\n\tif a not in b:\n\t\tb.append(a)\nprint(len(b))\n \t \t \t \t\t \t\t\t \t\t \t\t \t\t \t", "def f(s):\r\n c = set(s)\r\n return \"\".join(sorted(c))\r\n\r\n\r\nn = int(input())\r\nli = input().split()\r\nd = {}\r\nfor i in li:\r\n k = f(i)\r\n if k in d:\r\n d[k] += 1\r\n else:\r\n d[k] = 1\r\nprint(len(d))\r\n", "n = int(input())\r\na = list(map(str, input().split()))\r\nfor i in range(n):\r\n q = set()\r\n for j in range(len(a[i])):\r\n q.add(a[i][j])\r\n q = list(q)\r\n q.sort()\r\n a[i] = q\r\ns = set()\r\nfor i in range(n):\r\n s.add(\"\".join(a[i]))\r\nprint(len(s))", "from collections import Counter\r\nif __name__ == '__main__':\r\n n = int(input())\r\n s = input()\r\n ans = 0\r\n keys = {}\r\n words = s.split()\r\n for word in words:\r\n c = Counter(word)\r\n # print(c)\r\n key = \"\".join(sorted(c.keys()))\r\n # print(key)\r\n if key not in keys:\r\n keys[key] = 1\r\n ans += 1\r\n print(ans)\r\n", "def RAC(a):\r\n if a=='':\r\n return a\r\n b=''\r\n for i in a:\r\n if b == '':\r\n b += i\r\n if b.find(i) != -1:\r\n pass\r\n else:\r\n b=b+i\r\n return b\r\n\r\nn = int(input())\r\ns = str(input()).split()\r\nls = []\r\nans = 0\r\nfor i in range(0,n):\r\n tmp = RAC(s[i])\r\n l = len(tmp)\r\n ts = []\r\n #print(l)\r\n for i in range(0,l):\r\n ts.append(tmp[i])\r\n ts.sort()\r\n tmp = \"\"\r\n tmp = tmp.join(ts)\r\n # print(tmp)\r\n if ls.count(tmp) == 0:\r\n ls.append(tmp)\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\nS = list(map(str,input().split()))\r\nfor i in range(n):\r\n S[i] = set(S[i])\r\n S[i] = list(S[i])\r\n S[i].sort()\r\n S[i] = str(S[i])\r\nprint(len(set(S)))", "input()\na = len(set(map(frozenset, input().split())))\nprint(a)", "n=int(input())\r\nl=[]\r\nl.extend(input().split())\r\ns=[]\r\nc=0\r\nfor i in l:\r\n x=set(i)\r\n c=list(x)\r\n s.append(str(sorted(c)))\r\nx=set(s)\r\nprint(len(x))", "def solve():\r\n n=int(input())\r\n a=set()\r\n ap=a.add\r\n for s in input().split():\r\n ap(''.join(sorted(list(set(s)))))\r\n print(len(a))\r\nsolve()", "n = int(input())\r\ns = input().split()\r\nans = []\r\nfor i in s:\r\n tmp = []\r\n for j in i:\r\n if j not in tmp:\r\n tmp.append(j)\r\n tmp.sort()\r\n ss = ''.join(tmp)\r\n if ss not in ans:\r\n ans.append(ss)\r\nprint(ans.__len__())", "n = int(input())\r\nbarer = [i for i in input().split()]\r\nx = set()\r\nfor w in barer:\r\n\tw = list(set(list(w)))\r\n\tw.sort()\r\n\tw =''.join(w)\r\n\tx.add(w)\r\n \r\nprint(len(x))", "#!/usr/bin/env python3\r\n\r\ninput()\r\nwords = input().split(' ')\r\n\r\nprint(len(set(tuple(sorted(set(w))) for w in words)))\r\n", "n = int(input())\nwords = input().strip().split()\nd = []\nfor word in words:\n if set(word) not in d:\n d.append(set(word))\n\nprint(len(d))\n \t\t \t \t\t\t\t \t \t\t \t\t\t\t \t", "n=int(input())\r\nar=input().split()\r\nz=set()\r\nfor x in ar:\r\n\tx=list(x)\r\n\tx.sort()\r\n\tx=''.join(list(set(''.join(x))))\r\n\tz.add(x)\r\nprint(len(z))\r\n\r\n\r\n\r\n", "n = int(input())\r\narr = input()\r\narr = arr.split(\" \")\r\ngl = []\r\ncount = 0\r\nfor word in arr:\r\n A = set()\r\n for el in word: \r\n A.add(el)\r\n if A not in gl and len(A) > 0:\r\n gl.append(A)\r\n count += 1 \r\nprint(count)", "n=int(input())\r\nlst=[]\r\nlst1=[]\r\nn1=list(map(str,input().split()))\r\nfor i in n1:\r\n s=set(i)\r\n lst.append(s)\r\nfor j in lst:\r\n if(j in lst1):\r\n continue\r\n lst1.append(j)\r\nprint(len(lst1))", "n = int(input())\r\nst = set()\r\nfor s in input().split():\r\n c = [0] * 26\r\n for i in s:\r\n c[ord(i) - ord('a')] = 1\r\n st.add(tuple(c))\r\nprint(len(st))\r\n", "n = int(input())\r\nl = input().split(' ')\r\nl1 = []\r\nfor x in l:\r\n y = set(list(sorted(x)))\r\n if y not in l1:\r\n l1.append(y)\r\nprint(len(l1))\r\n", "n = int(input())\r\nlst = input().split()\r\nans=[]\r\n\r\nfor i in range(len(lst)):\r\n x = set(list(lst[i]))\r\n ans.append(''.join(sorted(x)))\r\n\r\nprint(len(set(ans)))", "#!/usr/bin/env python3\r\n\r\nprint(len(set(tuple(sorted(set(w))) for w in (input(), input().split(' '))[1])))\r\n", "n = int(input())\r\nscripts = input().split(\" \", n)\r\n\r\ncharacterMap = {}\r\nfor i in range(26):\r\n characterMap[chr(ord('a') + i)] = i\r\n\r\nalphabetMap = []\r\nfor i in range(n):\r\n column = []\r\n for j in range(26):\r\n column.append(False)\r\n alphabetMap.append(column)\r\n\r\nfor i in range(len(scripts)):\r\n for j in range(len(scripts[i])):\r\n alphabetMap[i][characterMap.get(scripts[i][j])] = True\r\n\r\ncodedList = [0 for i in range(n)]\r\nfor i in range(int(n)):\r\n for j in range(26):\r\n if alphabetMap[i][j]:\r\n codedList[i] += pow(2, 25 - j)\r\ncodedList.sort()\r\ncodedList = list(set(codedList))\r\n\r\nprint(len(codedList))\r\n", "n=int(input())\r\nx = list(map(str, input().split(\" \")))\r\na=[]\r\nfor i in range(n):\r\n if sorted(set(x[i])) not in a:\r\n a.append(sorted((set(x[i]))))\r\nprint(len(a))", "n = int(input())\r\nscript = list(map(str, input().split()))\r\nrl = []\r\nfor i in script:\r\n rl.append(''.join(sorted(set(i))))\r\n\r\nprint(len(set(rl)))\r\n\r\n\r\n", "n = int(input())\nA = input().split()\nh = 0\nz = []\nfor j in A:\n if set(j) not in z:\n z.append(set(j))\n h += 1\nprint(h)", "t=str(input()) \r\narr = [frozenset(x) for x in input().split()]\r\nprint(len(set(arr)))\r\n\r\n \r\n \r\n \r\n", "n = int(input())\r\ns = input().split()\r\nar = []\r\nfor i in s:\r\n *i, = set(i)\r\n i.sort()\r\n ar += [''.join(i)]\r\nprint(len(set(ar)))\r\n", "n=int(input())\r\nrs = set(map(frozenset,input().split()))\r\nprint(len(rs))", "n = int(input())\r\narr = list(input().split())\r\nst = set()\r\nfor w in arr:\r\n\ts = set()\r\n\tfor c in w:\r\n\t\ts.add(c)\r\n\tst.add(frozenset(s))\r\nprint(len(st))\r\n", "input()\r\nlst = tuple(s for s in input().split())\r\nset_ = set()\r\n\r\nfor item in lst:\r\n s = list(set(item))\r\n s = \"\".join(sorted(s))\r\n set_.add(s)\r\n\r\nprint(len(set_))", "n = int(input())\r\na = input().split()\r\nb = set()\r\nfor i in a:\r\n c = [0] * 37\r\n for j in i:\r\n c[ord(j) - ord('a')] = 1\r\n now = 0\r\n p = 37\r\n for j in range(26):\r\n if c[j] == 1:\r\n now += p * (j + 1)\r\n p *= 37\r\n b.add(now)\r\nprint(len(b))", "n = int(input())\r\na = list(map(str,input().split()))\r\nb = []\r\ncount = 0\r\nfor i in range(n):\r\n\tif set(a[i]) not in b:\r\n\t\tcount += 1\r\n\t\tb.append(set(a[i]))\r\nprint(count)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nN = int(input())\r\nS = input().split()\r\n\r\nunique = set()\r\n\r\nfor x in S:\r\n\tout = set()\r\n\tfor char in x:\r\n\t\tout.add(char)\r\n\tunique.add(\"\".join(sorted(out)))\r\nprint(len(unique))", "n = int(input())\r\na = input().split()\r\nfor i in range(len(a)):\r\n a[i] = \"\".join(set(sorted(a[i])))\r\n\r\nprint(len(set(a)))", "N = int(input())\nS = input().split(' ')\ns = [tuple(sorted(tuple(set(i)))) for i in S]\nprint(len(set(s)))\n", "n=int(input())\nl=[]\nr=input().split(\" \")\nfor i in range(0,n):\n\tl.append(r[i])\nl1=[]\nfor i in l:\n\ts=list(i)\n\tre=set(s)\n\tif re not in l1:\n\t\tl1.append(re)\nprint(len(l1))\n", "n = input()\r\nwords = input().split()\r\n\r\nsotre = []\r\n\r\nfor i in range(int(n)):\r\n if set(words[i]) not in sotre:\r\n sotre.append(set(words[i]))\r\nprint(len(sotre)) \r\n", "n = int(input())\r\ns = input().split(' ')\r\n\r\nans = len(set([''.join(set(sorted(list(word)))) for word in s]))\r\n\r\nprint(ans)", "n=int(input())\r\ns=set()\r\nl=list(input().split())\r\nfor j in l:\r\n s.add(\"\".join(sorted(list(set(j)))))\r\nprint(len(list(s)))", "def main():\n n = int(input())\n S = []\n s = input().split()\n S.append(set(s[0]))\n count = 1\n for i in range(1,n):\n if set(s[i]) not in S:\n S.append(set(s[i]))\n count += 1\n print(count)\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\ndaf = input().split()\r\ntotal = set()\r\n\r\nfor x in daf:\r\n total.add(frozenset(list(x)))\r\n\r\nprint(len(total))\r\n", "n = int(input())\r\nars = set()\r\nws = input().split()\r\nfor w in ws:\r\n ars.add(tuple(sorted(set([l for l in w]))))\r\nprint(len(ars))\r\n", "from collections import OrderedDict\r\nn=int(input())\r\nl=list(map(str,input().split()))\r\nfor i in range(0,n):\r\n\tl[i]=\"\".join(OrderedDict.fromkeys(sorted(l[i])))\r\nl = list(dict.fromkeys(l))\r\nprint(len(l))\r\n", "n = int(input())\r\nwords = input().split()\r\nroots = map(lambda word: \"\".join(sorted(set(word))), words)\r\nprint(len(set(roots)))\r\n", "N= int (input());\r\nwords=input().split(' ');\r\nfirstNum=ord('a');\r\nlastNum=ord('z');\r\nalfLen=lastNum-firstNum+1;\r\nroots=set();\r\nfor w in words:\r\n root=[0]*alfLen;\r\n for l in w:\r\n root[ord(l)-firstNum]=1;\r\n newRoot='';\r\n for i, flag in enumerate(root):\r\n if flag:\r\n newRoot+=chr(i+firstNum);\r\n roots.add(newRoot);\r\nprint(len(roots));", "n = int(input())\r\nlst = input().split()\r\nl1 = []\r\nfor i in range(n):\r\n if set(lst[i]) not in l1:\r\n l1.append(set(lst[i]))\r\nprint(len(l1))", "input(\"\")\r\nn = input(\"\").split()\r\nres = []\r\nfor i in range(len(n)):\r\n a = ''.join(sorted(set(n[i])))\r\n res.append(a)\r\nprint(len(sorted(set(res))))\r\n", "n = int(input())\r\na = list(map(list,input().split()))\r\nb = []\r\nfor i in range(len(a)):\r\n a[i] = list(set(a[i])); a[i].sort()\r\n if not a[i] in b: b.append(a[i])\r\nprint(len(b))", "n=int(input())\r\nscript=input().split() \r\nl=[] \r\nfor i in script:\r\n k=list(\"\".join(set(i)))\r\n k.sort()\r\n k=str(k)\r\n if k not in l:\r\n l.append(k)\r\nprint(len(l))\r\n", "n=int(input())\r\nl=[]\r\nm=[x for x in input().split()]\r\nfor x in m:\r\n s = list(set(list(x)))\r\n s.sort()\r\n if s not in l:\r\n l.append(s)\r\nprint(len(l))", "n = eval(input())\r\nl = input()\r\nls = l.split(\" \")\r\nan = []\r\nans = 0\r\nfor i in ls:\r\n\tst = set(i)\r\n\tif st not in(an):\r\n\t\tan.append(st)\r\n\t\tans += 1\r\nprint(ans)", "n=int(input())\r\nl=input().split()\r\na=set()\r\nfor i in range(0,len(l)):\r\n p=list(l[i])\r\n p.sort()\r\n c=set(p)\r\n s=''.join(c)\r\n a.add(s)\r\nprint(len(a))", "if __name__ == '__main__':\r\n\tn = int(input())\r\n\tl = input().split()\r\n\td = dict()\r\n\tfor i in l:\r\n\t\ts = sorted(set(i))\r\n\t\tj = ''\r\n\t\tfor i in range (len(s)):\r\n\t\t\tj+=s[i]\r\n\t\td.setdefault(j,0)\r\n\t\td[j]+=1\r\n\tprint(len(d))\r\n", "\n\nn = int(input())\n\nA = [''.join(sorted(list(set(x)))) for x in input().split()]\n\nprint(len(set(A)))\n", "input()\r\nprint(len(list(set(list(map(frozenset, list(map(str, input().split(' ')))))))))", "n=int(input())\r\nh=input().split()\r\nl=[]\r\nfor i in range(n):\r\n s=set()\r\n k=len(h[i])\r\n for j in range(k):\r\n s.add(h[i][j])\r\n if s not in l:\r\n l.append(s)\r\nprint(len(l))", "from collections import defaultdict\r\nd = defaultdict(list)\r\nn = int(input())\r\na = input().split()\r\nfor i in range(n):\r\n l = list(sorted(set(a[i])))\r\n s = \"\".join(l)\r\n if s in d:\r\n continue\r\n else:\r\n d[s] = 1\r\nprint(len(d))\r\n \r\n \r\n", "def sortString(s):\r\n lst=[]\r\n for i in s:\r\n if i not in lst:\r\n lst.append(i)\r\n lst.sort()\r\n return ''.join(lst)\r\nn=int(input())\r\na=[x for x in input().split()]\r\nlst=[]\r\nfor i in a:\r\n lst.append(sortString(i))\r\nprint(len(set(lst)))", "n = int(input())\ns = input().split()\nd = []\ncount = 0\n\nfor a in s:\n\tt = set(a)\n\tif t not in d:\n\t\td.append(t)\n\t\tcount +=1\n\nprint(count)\n\n\n", "n = int(input())\r\nstring = input().split()\r\nwords = []\r\ncount = 0\r\nfor a in string:\r\n if set(sorted(a)) not in words:\r\n count += 1\r\n words.append(set(sorted(a)))\r\nprint(count)", "\r\ninput()\r\nres = set()\r\nfor a in input().strip().split():\r\n res.add(frozenset(a))\r\nprint(len(res))", "n = int(input())\r\n\r\na = [sorted(list(set(x))) for x in input().split()]\r\n\r\n#print(a)\r\n\r\nb = []\r\n\r\nfor x in a:\r\n x_was_not = True\r\n if len(b) == 0:\r\n b.append(x)\r\n else:\r\n for y in b:\r\n if set(x) == set(y):\r\n x_was_not = False\r\n if x_was_not:\r\n b.append(x)\r\n\r\n#print(b)\r\nprint(len(b) - 1)", "n=int(input())\r\ns=input()\r\na=s.split(\" \")\r\nvisited=[]\r\n\r\nfor i in range(len(a)):\r\n\tvisited.append(0)\r\n\r\narr=[]\r\n\r\nfor g in range(len(a)):\r\n\taux=[]\r\n\tfor h in range(26):\r\n\t\taux.append(0)\r\n\tarr.append(aux) \r\n\r\nfor x in range(len(a)):\r\n\tfor y in range(len(a[x])):\r\n\t\tif(arr[x][ord(a[x][y])-97]==0):\r\n\t\t\tarr[x][ord(a[x][y])-97]+=1\r\n\r\n\r\ncount_arr=[]\r\n\r\nfor c in range(len(a)):\r\n\tcount=1\r\n\tfor d in range(c+1,len(a)):\r\n\t\tno=1\r\n\t\tif(visited[c]==0):\t\r\n\t\t\tfor e in range(26):\r\n\t\t\t\tif(arr[c][e]!=arr[d][e]):\r\n\t\t\t\t\tno=0\r\n\t\t\t\t\tbreak\r\n\t\t\tif(no==1):\r\n\t\t\t\tcount+=1\r\n\t\t\t\tvisited[d]=1\r\n\tif(visited[c]==0):\r\n\t\tcount_arr.append(count)\t\r\n\r\n\tvisited[c]=1\r\n\r\nprint(len(count_arr))\r\n\r\n\r\n\t", "from collections import Counter\n\nn = int(input())\nd = set() # Trie can also be used\nfor el in input().split(' '):\n d.add(''.join(sorted(Counter(el).keys())))\nprint(len(d))\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(S):\r\n L = []\r\n for word in S:\r\n row = [0 for i in range(26)]\r\n for c in word:\r\n row[ord(c)-ord('a')]=1\r\n L.append(row)\r\n L = sorted(L)\r\n count = 1\r\n m = len(L)\r\n for i in range(1, m):\r\n if L[i] > L[i-1]:\r\n count+=1\r\n sys.stdout.write(f'{count}\\n')\r\n return\r\n\r\nn = int(input())\r\nS = input().decode().strip().split()\r\nprocess(S)", "n=int(input())\r\n\r\nx=list(input().split())\r\n\r\nans=[]\r\nfor i in range(n):\r\n y=list(x[i].strip())\r\n y.sort()\r\n y=set(y)\r\n y=''.join(y)\r\n if y in ans:\r\n pass\r\n else:\r\n ans.append(y)\r\nprint(len(ans))", "n=int(input())\nstrings=input().split(' ')\nfinal_strings=[]\nfor i in strings:\n\ti=list(i)\n\ti=set(i)\n\ti=list(i)\n\ti.sort()\n\tarr_str=\"\"\n\tfor j in i:\n\t\tarr_str+=j\n\tfinal_strings.append(arr_str)\nprint(len(set(final_strings)))\n", "n=int(input())\narr=input().strip().split()\narr=[str(sorted(set(i))) for i in arr]\narr=set(arr)\nprint(len(arr))", "\nInput=lambda:map(str,input().split())\n\nn = int(input())\ns = list(Input())\nTmp = dict()\n\nfor i in range(n):\n Tmp[\"\".join(sorted(set(s[i])))] = 1\n\n\nprint(len(Tmp))\n\n\n\n", "input()\r\nuser=input()\r\nuser=user.split()\r\nu=[]\r\nfor i in user:\r\n x=''\r\n for j in i:\r\n if j not in x:\r\n x+=j\r\n x=sorted(x)\r\n if x not in u:\r\n u.append(x)\r\nprint(len(u))\r\n", "def counting(word):\r\n\tchars = []\r\n\tfor char in word:\r\n\t\tif char not in chars:\r\n\t\t\tchars.append(char)\r\n\tchars.sort()\r\n\treturn ''.join(chars)\r\n\r\nn = [int(x) for x in input().rstrip().split()][0]\r\nwords = [(x) for x in input().rstrip().split()]\r\nnum_char = []\r\nfor word in words:\r\n\tnum_word = counting(word)\r\n\tif num_word not in num_char:\r\n\t\tnum_char.append(num_word)\r\nprint(len(num_char))\r\n\r\n\r\n\r\n", "n = int(input())\r\na = frozenset(map(frozenset,input().split()))\r\n\r\nprint(len(a))", "n = int(input())\r\nl = [x for x in input().split()]\r\nl2 = []\r\nfor i in l:\r\n if not(set(i) in l2):\r\n l2.append(set(i))\r\nprint(len(l2))", "import os\nimport sys\nimport math\n\ndef main():\n n = int(input())\n a = [str(i) for i in input().split()]\n b = []\n for i in a:\n if set(i) not in b:\n b.append(set(i))\n print(len(b))\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\ns = input().split()\n\nunique = set()\n\nfor word in s:\n\tv = int(0)\n\tfor letter in word:\n\t\tv = v | int(1 << ord(letter) - 65)\n\tunique.add(v)\n\nprint(len(unique))", "n = int(input())\r\nstrarr = list(map(str, input().strip().split(\" \")))\r\ni=0\r\ncount = 0\r\nroot = []\r\nfor s in strarr:\r\n flag=0\r\n if i==0:\r\n root.append(\"\".join(sorted(set(s))))\r\n count = count +1\r\n else:\r\n x = \"\".join(sorted(set(s)))\r\n for j in root:\r\n if str(x)==str(j):\r\n flag=1\r\n break\r\n if flag==0:\r\n \r\n root.append(x)\r\n count = count +1\r\n i = i +1\r\nprint(count)\r\n ", "input()\r\nm = input().split()\r\nlis = []\r\nfor i in m:\r\n lis.append(\"\".join(sorted(list(set(i)))))\r\nprint(len(set(lis)))", "a=int(input())\r\n\r\n\r\n\r\nt=list(input().split())\r\n\r\n\r\n\r\np=[]\r\n\r\n\r\nfor k in t:\r\n b=list(set(list(k)))\r\n b.sort()\r\n p.append(''.join(b))\r\n\r\n\r\nprint(len(set(p)))\r\n", "n=int(input())\r\ns=list(input().split())\r\n\r\nans=set()\r\nfor i in s:\r\n c=set()\r\n for j in i:\r\n c.add(j)\r\n d=''\r\n for x in c:\r\n d+=x\r\n ans.add(''.join(sorted(d)))\r\n \r\nprint(len(ans))", "n = int(input())\r\nmas = map(set, input().split())\r\ngas = []\r\nq = 0\r\npr = set('zyxwvutsrqponmlkjihgfedcba')\r\nfor el in mas:\r\n if not el & pr in gas:\r\n q += 1\r\n gas.append(el & pr)\r\nprint(q)", "from sys import stdin\r\nfrom math import ceil\r\n\r\nrd = stdin.readline\r\n\r\nn = int(rd())\r\ns = rd().split()\r\n\r\ns1 = []\r\n\r\nfor i in s:\r\n\r\n s2 = set(i)\r\n if s2 not in s1:\r\n s1.append(s2)\r\n\r\nprint(len(s1))\r\n", "n = int(input())\r\ncount = 0\r\nlst = [x for x in input().split()]\r\nres = []\r\nfor i in lst:\r\n val = ''.join(dict.fromkeys(i))\r\n val = ''.join(sorted(val))\r\n if val not in res:\r\n res.append(val)\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\nlst = list(map(str, input().split()))\r\nseen = set()\r\n\r\nfor i in lst:\r\n curr_ans = []\r\n for i in set(i):\r\n curr_ans += i\r\n curr_ans.sort()\r\n seen.add(\"\".join(curr_ans))\r\nprint(len(seen))", "n=int(input())\r\nl = list(map(str,input().split()))\r\nres = []\r\nfor i in l:\r\n x = ''.join(set(sorted(list(i))))\r\n res.append(x)\r\n\r\nprint(len(set(res)))\r\n ", "n = int(input())\r\na = input().split()\r\nmyset = set()\r\nfor x in a:\r\n n = 0\r\n for c in x:\r\n n |= (1 << (ord(c) - ord('a')))\r\n myset.add(n)\r\nprint(len(myset))", "n = int(input())\r\nstring = list(map(str, input().split()))\r\nroot = []\r\nfor i in string:\r\n temp = set()\r\n for j in i:\r\n if j in temp:\r\n continue\r\n else:\r\n temp.add(j)\r\n if temp in root:\r\n continue\r\n else:\r\n root.append(temp)\r\nprint(len(root))\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = input().split()\r\nsets = []\r\nc = 0\r\nfor i in a:\r\n s = set(i)\r\n bl = True\r\n for j in sets:\r\n if j == s:\r\n bl = False\r\n break\r\n if bl:\r\n sets.append(s)\r\n c += 1\r\nprint(c)\r\n ", "n = input()\r\ns = input().split()\r\na = set()\r\nfor i in s:\r\n b = set()\r\n for j in i:\r\n b.add(j)\r\n a.add(\"\".join(sorted(list(b))))\r\nprint (len(a))\r\n \r\n", "n = int(input())\r\ns = list(map(str, input().split()))\r\nd = {}\r\nfor i in range(len(s)):\r\n temp = \"\".join(sorted(set(s[i])))\r\n d[temp] = 1\r\nprint(len(d))\r\n", "f = lambda s: ''.join(sorted(set(s)))\r\ninput()\r\nprint(len(set(map(f, input().split()))))", "if __name__==\"__main__\":\r\n n=int(input())\r\n s=list(input().split())\r\n li=[]\r\n for i in s:\r\n ans=\"\"\r\n for j in i:\r\n if j not in ans:\r\n ans=ans+j\r\n t=list(ans)\r\n t.sort()\r\n ans=\"\"\r\n for k in t:\r\n ans=ans+k\r\n li.append(ans)\r\n la=set(li)\r\n print(len(la))\r\n\r\n", "n=int(input())\r\ns=set(map(str,input().split()))\r\ngeek=[]\r\nfor i in s:\r\n geek.append(set(i))\r\nresult=[]\r\nfor i in geek:\r\n if i not in result:\r\n result.append(i)\r\nprint(len(result))\r\n", "n = int(input())\r\ns = input().split()\r\n \r\nprint(len(set(frozenset(si) for si in s)))", "N=int(input())\r\nL=list(input().split(\" \"))\r\nL1=set(L[0])\r\nL2=[L1]\r\nc=1\r\nfor i in range(1,N):\r\n S=set(L[i])\r\n if(S not in L2):\r\n L2.append(S)\r\n c=c+1\r\nprint(c)", "n = int(input())\r\na = list(input().split())\r\nans = []\r\ncount = 0\r\nfor i in range(n):\r\n\ta[i] = set(a[i])\r\n\tif not a[i] in ans:\r\n\t\tans.append(a[i])\r\n\t\tcount += 1\r\nprint(count)", "e=int(input())\r\nprint(len(set([''.join(sorted(list(set(x)))) for x in input().split()])))\r\n", "n = int(input())\r\nscript = [ str(x) for x in input().split()]\r\n\r\nroots = list()\r\nfor i in range(n):\r\n word_root = set(script[i]) \r\n if(word_root not in roots):\r\n roots.append(word_root)\r\n\r\n # roots.add(''.join(set(script[i])))\r\n\r\nprint(len(roots))", "n = int(input())\nz = str(input()).split()\nclean = [''.join(sorted(set(x))) for x in z]\nunicos = set(clean)\ncuenta = len(unicos)\nprint(cuenta)\n \t \t \t \t\t\t\t \t \t \t\t\t \t \t", "n = int(input())\r\nl = input().split()\r\ns = []\r\nfor i in l:\r\n\tt = list(set(i))\r\n\tt.sort()\r\n\ts.append(\"\".join(t))\r\nprint(len(set(s)))", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\nn = ii()\r\ns = inp().split()\r\nd = {}\r\nc = 0\r\nfor word in s:\r\n root = \"\".join(sorted(set(word)))\r\n if root not in d:\r\n d[root] = True\r\n c += 1\r\nprint(c)\r\n", "n = int(input())\r\nl = input().split()\r\nl = [''.join(sorted(list(set(x)))) for x in l]\r\nprint(len(set(l)))", "n = int(input())\r\ns = list(input().split())\r\n \r\nl = set()\r\n \r\nfor i in s:\r\n l.add(\"\".join(sorted(set(i))))\r\nprint(len(l))", "n=int(input())\r\nlist1= input().split()\r\nans=[]\r\nfor i in range(n):\r\n if set(list1[i]) not in ans:\r\n ans.append(set(list1[i]))\r\nprint(len(ans))\r\n \r\n\r\n", "input()\r\nwords = input().strip().split()\r\ns = set()\r\nfor word in words:\r\n s.add(''.join(sorted(set(word))))\r\nprint(len(s))", "d=set()\r\ninput()\r\nfor i in input().split():\r\n x=set()\r\n for j in i: x.add(j)\r\n d.add(''.join(sorted(x)))\r\nprint(len(d))", "n = int(input())\r\nl = list(input().split())\r\nans = []\r\nfor i in range(n):\r\n if ans.count(set(l[i])) == 0:\r\n ans.append(set(list(l[i])))\r\nprint(len(ans))", "# https://codeforces.com/problemset/problem/975/A\n# 900\n\nn = input()\n\n\no = 0\nod = {}\nfor w in input().split():\n s = {}\n sw = \"\"\n for c in w:\n if s.get(c) is None:\n s[c] = 1\n sw += c\n\n ss = [c for c in sw]\n ss.sort()\n ss = \"\".join(ss)\n\n if od.get(ss) is None:\n od[ss] = 1\n o += 1\n\nprint(o)", "n=int(input())\r\nl=list(map(str,input().split()))\r\nl1=[]\r\nfor i in l:\r\n lp=list(set(i))\r\n lp.sort()\r\n sp=str(lp)\r\n l1.append(sp)\r\ns=set(l1)\r\n#print(l1, s)\r\nprint(len(s))", "i = int(input())\r\nprint(len(list(set(map(frozenset, input().split())))))", "def solve():\r\n n=int(input())\r\n a=set()\r\n ap=a.add\r\n for s in map(frozenset,input().split()):\r\n ap(s)\r\n print(len(a))\r\nsolve()", "def root(word):\r\n L = list(set(list(word)))\r\n L.sort()\r\n return \"\".join(L)\r\n\r\nn = int(input())\r\nlst = input().split()\r\nroots = {root(w) for w in lst}\r\nprint(len(roots))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(map(lambda x: ''.join(sorted(set(x))), input().split()))\r\n\r\nprint(len(set(data)))", "n = int(input())\ns = input().split(\" \")\na=\"\"\ntemp = set()\nans = set()\nfor a in s:\n for b in a:\n temp.add(b)\n ans.add(''.join([e for e in sorted(temp)]))\n temp.clear()\nprint(len(ans))\n", "import sys\r\nimport math\r\n\r\n\r\ndef scan(input_type='int'):\r\n if input_type == 'int':\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n else:\r\n return list(map(str, sys.stdin.readline().strip()))\r\n\r\n\r\ndef devisiors(n):\r\n a = []\r\n for i in range(2, n//2+1):\r\n if n % i == 0:\r\n a.append(i)\r\n a.append(n)\r\n # print(a)\r\n return a\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n s = [x for x in input().split()]\r\n # print(s)\r\n b = {}\r\n for i in s:\r\n a = []\r\n for j in i:\r\n a.append(j)\r\n a = list(set(a))\r\n a.sort()\r\n a = ''.join(a)\r\n if a not in b:\r\n b[a] = 1\r\n print(len(b))\r\n\r\n\r\nif __name__ == '__main__':\r\n solution()\r\n", "n=int(input())\r\ns=list(map(str,input().split(' ')))\r\nk=[]\r\nfor i in s:\r\n\tc=0\r\n\tp=set(i)\r\n\tif p not in k:\r\n\t\tk.append(p)\r\nprint(len(k))", "try:\r\n \r\n n=int(input())\r\n l=list(map(str,input().split()))\r\n l1=[]\r\n for i in range(len(l)):\r\n s=set(l[i])\r\n st=\"\".join(s)\r\n st=sorted(st)\r\n if l1.count(st)==0:\r\n l1.append(st)\r\n \r\n print(len(l1)) \r\nexcept EOFError:\r\n pass\r\n ", "import sys\n\nn = int(sys.stdin.readline())\ntokens = sys.stdin.readline().rstrip().split(' ')\n\nhist = {}\n\nfor tok in tokens:\n s = set(tok)\n a = sorted(s)\n k = ''.join(a)\n hist[k] = 1\n\nprint(len(hist))\n", "x = int(input())\ny = list(map(str, input().split(' ')))\nseen = set()\nfor i in y:\n s = ''\n for j in i:\n if j not in s:\n s+=j\n p = sorted(s)\n q = ''\n for i in p:\n q+=i\n if q not in seen:\n seen.add(q)\nprint(len(seen))\n\n\n\n\n\t \t\t \t \t\t\t\t\t \t \t \t\t\t\t\t\t\t", "n=int(input())\na=set(input().split())\naa=set()\nfor i in a:\n temp=set()\n temp.clear()\n for j in i:\n temp.add(j)\n ans=\"\".join(temp)\n ans=sorted(ans)\n aa.add(\"\".join(ans))\nprint(len(aa))", "n=int(input())\r\narr=[str(i) for i in input().split()]\r\nc=0\r\ns=set()\r\nfor i in arr:\r\n l=list(set(i))\r\n l.sort()\r\n l=\"\".join(l)\r\n if l not in s:\r\n s.add(l)\r\n c=c+1\r\nprint(c)\r\n", "n=int(input())\r\na=set(map(frozenset,input().split()))\r\nprint(len(a))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip().decode().split())\r\nu = set()\r\nfor s0 in s:\r\n v = list(set(s0))\r\n v.sort()\r\n u.add(tuple(v))\r\nans = len(u)\r\nprint(ans)", "t = int(input())\r\nl1 = [set(x) for x in input().split()]\r\ni=0\r\ntable=[]\r\nfor x in l1:\r\n if x not in table:\r\n table.append(x)\r\nprint(len(table))", "n=int(input())\r\nl=list(map(str,input().split()))\r\nd={}\r\ncnt=0\r\n\r\nfor word in l:\r\n temp=list(word)\r\n temp.sort()\r\n temp=\"\".join(temp)\r\n val=set(i for i in temp)\r\n val=''.join(list(val))\r\n \r\n if val not in d:\r\n d[val]=1\r\n cnt+=1\r\n else:\r\n continue\r\nprint(cnt)", "N = int(input())\r\nroots = [''.join([c for c in sorted(list(set(word)))]) for word in input().split()]\r\nprint(len(set(roots)))", "n = int(input())\ntext = input()\nwords = text.split(' ')\nans = set()\nfor word in words:\n ans.add(''.join(sorted(list(set(word)))))\nprint(len(ans))", "n=int(input())\r\nlst=list(map(str,input().split()))\r\nres=[]\r\nfor i,x in enumerate(lst):\r\n a=set(x)\r\n k=0\r\n for j,y in enumerate(res):\r\n if y==a:k=1;break\r\n if k==0:res.append(a)\r\nprint(len(res))", "n = int(input())\r\nm = input().split()\r\nk = 'abcdefghijklmnopqrstuvwxyz'\r\nl = []\r\nfor t in m:\r\n a = ''\r\n for s in k:\r\n if s in t:\r\n a = a + s\r\n l.append(a)\r\nprint(len(set(l)))", "n=int(input())\r\nlistx=input().split(' ')\r\nd=[]\r\nfor x in listx:\r\n x=set(x)\r\n if x not in d:\r\n d.append(x)\r\nprint(len(d))\r\n", "class AramicWord(object):\r\n def __init__(self, word):\r\n self._word = word\r\n self._root = set(word)\r\n \r\n def get_root(self):\r\n return ''.join(sorted(set(self._root)))\r\n \r\n def get_word(self):\r\n return self._word\r\n\r\ndef AramicScript():\r\n n = int(input().strip())\r\n words = input().strip().split()\r\n \r\n for i in range(n):\r\n words[i] = (AramicWord(words[i]).get_root())\r\n \r\n return len(set(words))\r\n\r\nif __name__ == '__main__':\r\n a = AramicScript()\r\n print(a)", "input()\r\ndef f(s):\r\n return \"\".join(sorted(set(s)))\r\narr = set(map(f, input().split()))\r\nprint(len(arr))", "input()\nv = []\ns = input().split()\nt = 0\nfor x in s:\n w = set(x)\n if w not in v:\n t += 1\n v.append(w)\nprint(t)\n", "n=int(input())\r\nl=list(map(str,input().split()))\r\nx,y=[],[]\r\nfor i in range(n):\r\n x.append(sorted(list(set(l[i]))))\r\nfor i in range(n):\r\n if x[i] not in y:\r\n y.append(x[i])\r\nprint(len(y))\r\n\r\n", "n = int(input())\r\nd = set()\r\nfor i in input().split():\r\n d.add(frozenset(i))\r\nprint(len(d))", "n = int(input())\r\ns = input().split()\r\nb = []\r\n\r\nfor i in s :\r\n x = sorted(set(i))\r\n y = ''.join(x)\r\n b.append(y)\r\n\r\nprint(len(set(b)))\r\n\r\n\r\n\r\n", "if __name__ == '__main__':\n num = int(input())\n str_list = input().split(' ')\n\n\n def get_root(s):\n ss = set(s)\n ss = list(ss)\n ss.sort()\n return str(ss)\n\n\n print(len(set([get_root(x) for x in str_list])))\n \t \t \t \t\t \t \t \t\t \t\t\t\t\t", "n = int(input())\r\narr = input().split()\r\nans, c = [], 0\r\nfor i in range(len(arr)):\r\n if set(arr[i]) not in ans:\r\n ans.append(set(arr[i]))\r\nprint(len(ans))\r\n\r\n", "n = int(input())\narr = input().split()\nans = set()\n\nfor st in range(n):\n\tc = [0 for i in range(26)]\n\tfor i in arr[st]:\n\t\tc[ord(i)-ord('a')] = 1\n\tk = ''\n\tfor j in range(26):\n\t\tif c[j] == 1:\n\t\t\tk += str(j)\n\tans.add(k)\nprint(len(ans))\n", "n=int(input())\r\np=list(map(str,input().split()))\r\nfr=[]\r\nfor it in p:\r\n tam=list(set(it))\r\n tam.sort()\r\n fr.append(\"\".join(tam))\r\nprint(len(set(fr)))", "from bisect import bisect_left, bisect_right\r\n\r\ndef _input():\r\n return map(int, input().strip().split())\r\n\r\ndef _print(s):\r\n print(''.join(map(str, s)))\r\n\r\n\r\n'''\r\n'''\r\ndef squeeze(s):\r\n t = set()\r\n for e in s:\r\n t.add(e) \r\n t = sorted(t)\r\n return ''.join(list(t))\r\n\r\nn = int(input())\r\ns = list(input().strip().split())\r\nr = set()\r\nfor sx in s:\r\n r.add(squeeze(sx))\r\n# print(r)\r\nprint(len(r))", "n = int(input())\r\na = [''.join(sorted(set(i))) for i in input().split()]\r\nprint(len(set(a)))\r\n", "n = int(input())\r\nwords = input().split()\r\nroots = set()\r\nfor word in words:\r\n root = ''.join(sorted(set(word)))\r\n roots.add(root)\r\nprint(len(roots))", "n = int(input())\nS = list(map(str, input().split()))\n\nres = set()\nfor s in S:\n t = []\n used = set()\n for c in s:\n if c not in used:\n t.append(c)\n used.add(c)\n t.sort()\n t = ''.join(t)\n res.add(t)\nprint(len(res))\n", "input()\nprint(len(set(map(frozenset, input().split()))))\n", "n = int(input())\r\nwords = input().split(\" \")\r\nmySet = set()\r\nfor i in words:\r\n l = list(i)\r\n l.sort()\r\n ts = {item for item in l}\r\n mySet.add(str(ts))\r\nprint(len(mySet))", "n = int(input())\r\ns = input().split()\r\ndict = set()\r\nfor str in s:\r\n kor =set()\r\n for c in str:\r\n kor.add(c)\r\n kors = []\r\n for c in kor:\r\n kors.append(c)\r\n kors = sorted(kors)\r\n sk = \"\"\r\n for c in kors:\r\n sk = sk+c\r\n dict.add(sk)\r\nprint(len(dict))", "n=int(input())\r\ns=input()\r\nprint(len(set([''.join(sorted(list(set(x)))) for x in s.split()])))", "n = int(input())\r\ns = list(input().split())\r\nroots = []\r\n\r\nfor i in range(0,n):\r\n root = []\r\n for j in range(0,len(s[i])):\r\n if s[i][j] not in root:\r\n root.append(s[i][j])\r\n ''.join(root)\r\n root = sorted(root)\r\n \r\n if root not in roots:\r\n roots.append(root)\r\n \r\nprint(len(roots))\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\n\r\ndef main():\r\n n = int(input())\r\n s = set()\r\n for t in input().split():\r\n t = ''.join(list(sorted(set(list(t)))))\r\n s.add(t)\r\n print(len(s))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "x=0\r\n\r\noword=[]\r\n#n, k = map(int, input().split())\r\nnum=int(input())\r\nwordlist = input().split()\r\nfor word in wordlist:\r\n org=\"\"\r\n for b in word:\r\n if b not in org:\r\n org=org+b\r\n oword.append(''.join(sorted(org)))\r\noword.sort()\r\now=oword.copy()\r\nfor i in ow:\r\n oword.remove(i)\r\n if i not in oword:\r\n x+=1 \r\nprint(x)\r\n\r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\na = input().split()\r\nmyset = set()\r\nfor x in a:\r\n root = ''.join(sorted(list(set(x))))\r\n myset.add(root)\r\nprint(len(myset))", "n = int(input())\r\nli = input().split()\r\nans = []\r\nfor i in range(n):\r\n if set(li[i]) not in ans:\r\n ans.append(set(li[i]))\r\nprint(len(ans))", "\"\"\".\"\"\"\n\n\ndef get_root(word):\n \"\"\".\"\"\"\n root = tuple(sorted(list(set(list(word)))))\n return root\n\n\nn = int(input())\n\nroot_set = set()\nwords = input().split()\nfor word in words:\n root = get_root(word)\n root_set.add(root)\n\nprint(len(root_set))\n", "n = int(input())\na = input().split()\nans = []\nfor i in a:\n S = \"\"\n for j in i:\n if j not in S:\n S += j\n S = list(S)\n S.sort()\n if S not in ans:\n ans.append(S)\nprint(len(ans))\n", "n = int(input())\r\nl = input().split()\r\nt= []\r\nfor i in l:\r\n x = set(i)\r\n y = list(x)\r\n y.sort()\r\n if y not in t:\r\n t.append(y)\r\nprint(len(t))", "n = int(input())\r\narr = input().split()\r\nd = {}\r\ncount = 0\r\n\r\nfor w in arr:\r\n _set = frozenset(w)\r\n if _set not in d:\r\n count += 1\r\n d[_set] = True \r\n \r\nprint(count)\r\n\r\n", "n=int(input())\nwords=list(input().split())\nkornes=[]\nfor i in range(n):\n word=[0]*26\n for j in words[i]:\n word[ord(j)-97]+=1\n for i in range(26):\n if word[i]>1:\n word[i]=1\n #print(word)\n if word not in kornes:\n kornes.append(word)\nprint(len(kornes))\n \n", "input()\r\nprint(len({''.join(sorted(set(word))) for word in input().split()}))", "int(input())\r\ns=set()\r\nfor i in input().split():s.add(frozenset(i))\r\nprint(len(s))", "\r\nn = int(input())\r\nl = list(input().split())\r\nli = [str(sorted(set(i))) for i in l]\r\nprint(len(set(li)))", "n = input();\r\narray = list();\r\narray = input().split();\r\nindex = [0]*26;\r\n#index[] = new int[26];\r\ncount = 0;\r\narr = list();\r\nfor i in range(len(array)):\r\n word = array[i];\r\n str = \"\";\r\n for j in range(len(word)):\r\n index[ord(word[j])-97]+=1;\r\n \r\n #print (index)\r\n for j in range(26):\r\n if (index[j]!=0):\r\n str = str + chr(j+97);\r\n index = [0]*26; \r\n if (str not in arr):\r\n arr.append(str);\r\n count+=1;\r\n #print (arr)\r\nprint (count);\r\n", "t=int(input())\r\nl=list(input().split())\r\na=set()\r\nfor j in range(t):\r\n y=list(set(list(l[j])))\r\n y.sort()\r\n x=''.join(y)\r\n a.add(x)\r\nprint(len(a))", "l = int(input())\n\nline = input().split()\n\nres = set()\n\nfor word in line:\n setsito = set()\n for c in word:\n setsito.add(c)\n res.add(str(sorted(setsito)))\n\nprint(len(res))\n\n\n\t \t \t\t \t\t\t \t \t \t\t\t\t\t\t \t \t", "n = int(input())\r\ns = list([set(x) for x in input().split()])\r\nl2=[]\r\nfor i in s:\r\n if i not in l2:\r\n l2.append(i)\r\nprint(len(l2))", "n = int(input())\r\ns = set()\r\nsi = input().split()\r\nfor i in range(n):\r\n ss = list(sorted(set(si[i])))\r\n s.add(''.join(ss))\r\nprint(len(s))", "def f(s): \r\n visited = set() \r\n l = [] \r\n for i in s : \r\n if i not in visited : \r\n l.append(i) \r\n visited.add(i) \r\n l.sort()\r\n return ''.join(l)\r\nn = int(input()) \r\ns = [i for i in input().split()] \r\nl = [] \r\nfor i in s : l.append(f(i))\r\nl.sort()\r\nans = 0 \r\ni, j = 0, 0 \r\nwhile i < n : \r\n while i < n and j < n and l[i] == l[j] : j+=1\r\n ans += 1\r\n i = j \r\nprint(ans)", "import math\nimport string\n\ndef RAC(a):\n if a == \"\":\n return a\n b = \"\"\n for i in a:\n if b == \"\":\n b += i\n if b.find(i) != -1:\n pass\n else:\n b += i\n return b\n\nn = int(input())\ns = str(input()).split()\nta = []\nans = 0\nfuck = []\nfor i in range(0,n):\n tmp = RAC(s[i])\n for j in tmp:\n ta.append(j)\n ta.sort()\n tmp = \"\"\n tmp = tmp.join(ta)\n ta.clear()\n #print(tmp)\n if fuck.__contains__(tmp):\n pass\n else:\n fuck.append(tmp)\n ans += 1\nprint(ans)", "input()\r\na = input().split()\r\nb = set()\r\nfor x in a:\r\n b.add(''.join(sorted(set(x))))\r\nprint(len(b))", "n=int(input())\r\nlst2=[]\r\nlist=input().split(' ')\r\nfor i in range(0,n):\r\n s=list[i]\r\n s=sorted(s)\r\n l=len(s)\r\n lst3=[]\r\n for j in range(0,l):\r\n if s[j] not in lst3:\r\n lst3.append(s[j])\r\n s=''.join(lst3)\r\n if s not in lst2:\r\n lst2.append(s)\r\n#print(lst2)\r\nlength=len(lst2)\r\nprint(length)", "ar = []\r\nn = int(input())\r\na = list(input().split())\r\nfor i in a:\r\n temp = set(i)\r\n temp = \"\".join(sorted(temp))\r\n if temp not in ar:\r\n ar.append(temp)\r\nprint(len(ar))\r\n\r\n", "n = int(input())\r\nw = input().split()\r\nw2 = []\r\nfor i in range(len(w)):\r\n w[i] = set(w[i])\r\ni = 0\r\nj = 0\r\nfor item in w:\r\n w2.append(''.join(sorted(list(item))))\r\nprint(len(set(w2)))\r\n", "n = int(input())\n\nA = input().split()\nfinal = {}\n#print(A)\nfor st in A:\n\tcount = {}\n\tfor j in st:\n\t\tif count.get(j,0) == 0:\n\t\t\tcount[j] = 1\n\tcount = sorted(list(count))\n\t#print(count)\n\tkey = ''.join(count) \n\tif final.get(key,0) == 0:\n\t\tfinal[key] = 1\n\t\nprint(len(final))\n", "n, s = int(input()), input().split()\nres = set()\nfor w in s:\n c = \"\".join(sorted(set(i for i in w)))\n res.add(c)\nres = len(res)\nprint(res)\n", "n = int(input().strip())\narr_s = list(map(str, input().split()))\nres = 0\nchecked = []\nfor s in arr_s:\n temp = \"\"\n words = [0]*26\n for ch in s:\n if temp.find(ch) == -1:\n temp += ch\n words[ord(ch) - 97] += 1\n if len(checked) == 0:\n checked.append(words)\n res += 1\n else:\n try:\n checked.index(words)\n except ValueError:\n checked.append(words)\n res += 1\nprint(res)", "input();x = map(lambda x: repr(set(sorted(x))), input().split())\r\nprint(len(set(x)))", "Answers = []\r\ninput()\r\nX = list(input().split())\r\nfor i in X:\r\n myDict = {}\r\n for j in i:\r\n myDict[j] = 0\r\n if sorted(myDict.keys()) not in Answers:\r\n Answers.append(sorted(myDict.keys()))\r\nprint(len(Answers))\r\n", "n = int(input())\r\nd1 = []\r\nans = 0\r\np = input().split()\r\nfor i in p:\r\n s = set(i)\r\n if d1.count(s) == 0:\r\n d1.append(s)\r\n ans += 1\r\nprint(ans)", "input()\r\ns = frozenset(map(frozenset,input().split()))\r\nprint(len(s))\r\n", "n=int(input())\r\ny=map(frozenset,input().split())\r\nprint(len(set(y)))", "n = int(input())\r\ns = list(input().split())\r\nb = list()\r\nresult = 0\r\nfor i in range(n):\r\n\tif set(s[i]) not in b:\r\n\t\tresult+=1\r\n\t\tb.append(set(s[i]))\r\nprint(result)", "n = int(input())\nlst = [''.join(sorted(list(set(i)))) for i in input().split()]\nprint(len(set(lst)))\n\n \t\t\t \t\t\t \t \t \t\t\t \t\t \t\t\t \t \t", "def s(a):\r\n\tla = []\r\n\tfor i in range(len(a)):\r\n\t\tif not a[i] in la:\r\n\t\t\tla.append(a[i])\r\n\treturn la\r\nn = int(input())\r\nl = input().split()\r\nse = []\r\nfor i in range(n):\r\n\tk = s(l[i])\r\n\tk.sort()\r\n\tif not k in se:\r\n\t\tse.append(k)\r\nprint(len(se))\r\n", "t = 1\r\nwhile t:\r\n t-=1\r\n n = int(input())\r\n op = []\r\n ls = list(map(str, input().split()))\r\n for item in ls:\r\n a = [x for x in item]\r\n a = list(set(a))\r\n a.sort()\r\n op.append(''.join(a))\r\n print(len(set(op))) ", "n = int(input())\nS = input().split()\n\nroots = set()\nfor s in S:\n t = tuple(sorted(list(set(s))))\n roots.add(t)\n\nr = len(roots)\nprint(r)\n", "input()\r\nprint(len(set(\"\".join(sorted(set(x))) for x in input().split() )))", "n = int(input())\r\ns = input().split()\r\nl1 = []\r\nfor i in range(n):\r\n a = set(s[i])\r\n if( a not in l1):\r\n l1.append(set(s[i]))\r\nprint(len(l1))", "n = int(input()) \r\nk = list(map( str, input().split()))\r\nsort = [ \"\".join(sorted(i)) for i in k ]\r\ncounter = []\r\nfor i in sort : \r\n if set(i) not in counter : \r\n counter.append(set(i))\r\nprint(len(counter))", "input()\r\nprint(len(list(set(map(frozenset,input().split())))))\r\n", "def get_root(word):\r\n return ''.join(sorted(set(word)))\r\ndef count_unique_objects(n, words):\r\n unique_roots = set()\r\n for word in words:\r\n root = get_root(word)\r\n unique_roots.add(root)\r\n return len(unique_roots)\r\nn = int(input())\r\nwords = input().split()\r\nunique_objects = count_unique_objects(n, words)\r\nprint(unique_objects)\r\n", "n=int(input())\r\nalist=list(map(str,input().split()))\r\nclist=[]\r\nfor i in alist:\r\n blist=[]\r\n for j in range(len(i)):\r\n blist.append(i[j])\r\n clist.append(blist)\r\nfor i in range(len(clist)):\r\n a=set(clist[i])\r\n clist[i]=a\r\ncount=0\r\n\r\nfor i in range(len(clist)):\r\n if clist[i] in clist[0:i]:\r\n continue\r\n else:\r\n count=count+1\r\nprint(count)", "n=int(input())\r\nl=input().split()\r\nz=set()\r\nfor x in l:\r\n\tx=list(x)\r\n\tx.sort()\r\n\tx=''.join(list(set(''.join(x))))\r\n\tz.add(x)\r\nprint(len(z))", "from sys import stdin, stdout\r\nrl = stdin.readline\r\nwr = stdout.write\r\n\r\nroots = set()\r\nn = rl().strip()\r\ns = list(map(str, rl().strip().split()))\r\nfor i in s:\r\n roots.add(str(set(sorted([x for x in i]))))\r\n\r\nwr(f'{len(roots)}')", "n = int(input())\n\nln = input().split(\" \")\n\nrts = {}\n\nfor i in range(0, len(ln)):\n st = ln[i]\n nc = {}\n nt = \"\"\n for j in range(0, len(st)):\n if st[j] not in nc:\n nc[st[j]] = True\n nt += st[j]\n nt = \"\".join(sorted(list(nt)))\n if nt not in rts:\n rts[nt] = True\n\nprint(len(rts))\n", "n=int(input())\r\ns=list(input().split())\r\nt=set()\r\nfor i in s:\r\n k=len(i)\r\n c=0\r\n for j in range(k):\r\n c=c | (1<<(ord(i[j])-ord('a')))\r\n # print(c)\r\n t.add(c)\r\nprint(len(t))\r\n\r\n\r\n", "n = int(input())\r\narr = map(str, input().split())\r\nd = {}\r\n\r\nfor ele in arr:\r\n a = set(ele)\r\n s = sorted(a)\r\n\r\n k = \"\"\r\n for item in s:\r\n k += item\r\n\r\n d[k] = d.get(k, 0)+1\r\n\r\nprint(len(d))\r\n", "n = int(input())\r\nd = set(map(frozenset, input().split()))\r\nprint(len(d))", "n=input()\ndata=input().split(' ')\nfor i in range(len(data)):\n\tdata[i]=''.join(set(data[i]))\n\tdata[i]=''.join(sorted(data[i]))\nx=set(data)\nprint(len(x))", "n=int(input())\r\narr=list(input().strip().split())\r\ns=set()\r\nfor i in range(len(arr)):\r\n arr1=list(set(arr[i]))\r\n arr1.sort()\r\n s.add(\"\".join(arr1))\r\nprint(len(s))", "n=int(input())\r\nl=list(input().split())\r\nl2=[]\r\nfor i in l:\r\n\tx=list(i)\r\n\tx.sort()\r\n\tx=list(set(x))\r\n\tx=\"\".join(x)\r\n\t# print(x)\r\n\t# print(set(x))\r\n\tl2.append(x)\r\nl2=list(set(l2))\r\nprint(len(l2))" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef prime_factorize(n):\r\n ans = []\r\n for i in range(2, int(n ** (1 / 2)) + 1):\r\n while True:\r\n if n % i:\r\n break\r\n ans.append(i)\r\n n //= i\r\n if n == 1:\r\n break\r\n if not n == 1:\r\n ans.append(n)\r\n return ans\r\n\r\ndef euler_func(n):\r\n p = set(prime_factorize(n))\r\n x = n\r\n for i in p:\r\n x *= (i - 1)\r\n x //= i\r\n return x\r\n\r\nn, k = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\nk = (k + 1) // 2\r\nans = n\r\nfor _ in range(k):\r\n if ans == 1:\r\n break\r\n ans = euler_func(ans)\r\nans %= mod\r\nprint(ans)", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\nfrom math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\ndef phi(n):\r\n ret = n\r\n for i in range(2,int(sqrt(n))+1):\r\n if n%i==0:\r\n while n%i==0:\r\n n//=i\r\n ret-=ret//i\r\n if n>1:\r\n ret-=ret//n\r\n return ret\r\n\r\nn,k = list(map(int,input().split()))\r\nans = n\r\nmod = int(1e9)+7\r\nk = (k+1)//2\r\nfor i in range(k):\r\n ans = phi(ans)\r\n if ans==1:\r\n break\r\nans%=mod\r\nprint(str(ans)+\"\\n\")\r\n", "def phi(n):\r\n res = n\r\n i = 2\r\n while i * i <= n:\r\n if n % i == 0:\r\n while n % i == 0:\r\n n //= i\r\n res -= res // i\r\n i += 1\r\n if n > 1:\r\n res -= res // n\r\n return res\r\n\r\nn, k = map(int, input().split())\r\nres = n\r\nk = (k + 1) // 2\r\nwhile k > 0:\r\n res = phi(res)\r\n if res == 1:\r\n break\r\n k -= 1\r\nprint(res % 1000000007)\r\n", "N = 10 ** 6 * 2 \nMOD = 1000000007\nprime = []\nisPrime = [True for i in range(N)]\nfor i in range(2, N):\n if isPrime[i]:\n prime.append(i)\n for j in range(i * i, N, i):\n isPrime[j] = False\ndef phi(n):\n ans = 1\n for i in pf(n):\n ans *= pow(i[0],i[1]-1)*(i[0]-1)\n return ans\ndef pf(n):\n for i in prime:\n cnt = 0\n if n % i == 0:\n while n % i == 0:\n n //= i\n cnt += 1\n yield (i,cnt)\n if n > 1:\n yield (n,1)\nn,k = map(int,input().split())\nk = (k+1)//2\nans = n\nfor i in range(k):\n ans = phi(ans)\n if ans == 1:\n break\nprint(ans % MOD)\n", "mod=1e9+7 # la respuesta te piden que se de modulo este numero\r\n\r\ndef primeFactors(n): #Algoritmo para la descomposicion de n en factores primos\r\n factores=[]\r\n if n%2==0: # todo numero de la forma 2k tiene a 2 en su descomposicion en primos por lo que al ser bastante probable que aparezca lo analisamos como un caso aparte\r\n exp=0\r\n while n%2 ==0: # mientras todavia tenga a 2 en su descomposicion 2\r\n exp+=1\r\n n//=2\r\n factores.append((2,exp)) #al terminar me quedo con un n resultado de quitar tanta veces como aparezca 2 en su descomposicion\r\n i=3 #Al no tener que considerar los numeros de la forma 2k pues como son multiplos de 2 no pueden ser primos empiezo en 3 y avanzo de 2 en 2\r\n while(i*i<=n): #solamente se analiza hasta sqrt(n) pues el unico primo mayor que la raiz que puede estar en la descomposicion es el propio n en caso que n sea primo\r\n if(n%i==0): # en caso que i divida a n es porque i es un factor primo de n pues de lo contrario el se dividiria por otro primo hallado previamente y eso no puede ser pues esos primos fueron quitados de n\r\n exp=0\r\n while n%i ==0: # tantas veces como aparezca ese primo en la descomposicion lo voy quitando de n\r\n exp+=1\r\n n//=i\r\n factores.append((i,exp)) \r\n i+=2 \r\n if n > 2: # en caso que el n que me quede sea primo entonces el tambien forma parte de la descomposicion\r\n factores.append((n,1))\r\n return factores # me quedo con la descomposicion en primos de n en una lista que tiene para la posicion i una tupla <primo i,exponente i >\r\n\r\ndef Phi(n): # Calcula Phi de n\r\n phi=1\r\n for fact in primeFactors(n): #Recorro cada primo que esta en la descomposicion de n\r\n phi*=(fact[0]**(fact[1]-1))*(fact[0]-1) # voy actualizando phi usando la propiedad que phi(n)=p1^{e1-1}*(p1-1)+p2^{e2-1}*(p2-1)+...+pk^{ek-1}*(pk-1)\r\n return phi #devuevlo el valor de Phi(n)\r\n\r\nn,k=map(int,input().split()) #recibo los enteros n y k de entrada al problema\r\n\r\nans=n # variable que va a ir guardando la salida de cada computo de phi(n) mientras queden iteraciones por hacerse\r\nk=(k+1)//2 # numero de iteraciones que voy a ejecutar Phi\r\nwhile k!=0:\r\n ans=Phi(ans) # en cada paso calculo Phi del resultado previo de haber computado Phi o n la primera vez\r\n if ans==1: # Cuando ans=1 Phi(1) es 1 por lo que no seria eficiente seguir iterando por el while pues nos daria el mismo resultado y nos pudieramos quitar esas iteraciones\r\n break;\r\n k -=1 # voy disminuyendo el contador en 1 hasta hacer las |_k+1/2_| iteraciones necesarias para el computo de F(k,n) \r\nans=int(ans%mod) # Devuelvo la respuesta modulo 10^9 +7 pues asi es como nos los piden en el problema ya que nos pueden entrar valores de n y k bastantes grandes \r\nprint(ans) # imprimo la respuesta al problema F(n,k)\r\n", "mod=1e9+7\r\n\r\ndef Phi(n):\r\n phi=n\r\n i=2\r\n while i*i<= n:\r\n if n%i==0:\r\n while n%i==0:\r\n n//=i\r\n phi-=phi//i\r\n i+=1 \r\n if n > 1:\r\n phi-=phi//n \r\n return phi\r\n\r\ndef f(n):\r\n return Phi(n)\r\ndef g(n):\r\n return n\r\n\r\nn,k=map(int,input().split())\r\n\r\n\r\nans=n\r\nk=(k+1)//2\r\nwhile k!=0:\r\n ans=Phi(ans)\r\n if ans==1:\r\n break;\r\n k -=1 \r\nans=int(ans%mod)\r\nprint(ans)\r\n" ]

[ "from sys import stdin\nfrom collections import defaultdict\n\ndef lmap(function, iterable): return list(map(function, iterable))\ndef line(): return stdin.readline().strip()\ndef rd(converter): return converter(line())\ndef rl(converter, delimeter = None): return lmap(converter, line().split(delimeter))\ndef rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]\ndef rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]\n\nMOD = 10**9+7\nMULTIPLE_CASES = 0\n\ndef main():\n N,M = rl(int)\n A = rl(int)\n Q = rg(M,int)\n\n idxs = defaultdict(list)\n ls = defaultdict(list)\n for l,r in Q: ls[r-1].append(l-1)\n enoughs = []\n ans = {}\n\n for i,num in enumerate(A):\n idxs[num].append(i)\n if len(idxs[num]) == num: enoughs.append(num)\n for l in ls[i]: ans[l,i] = sum((0 if len(idxs[enough]) == enough else (idxs[enough][-(enough+1)]+1)) <= l <= idxs[enough][-enough] for enough in enoughs if len(idxs[enough]) >= enough)\n\n for l,r in Q: print(ans[l-1,r-1])\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()", "# link: https://codeforces.com/contest/220/problem/B\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.insert(0, 0)\r\nl = [0] * (m+1)\r\nr = [0] * (m+1)\r\nans = [0] * (m+1)\r\nfreq = [0] * 100001\r\nsumm = [0] * 100001\r\nfor num in a:\r\n if num <= n:\r\n freq[num] += 1 \r\nfor i in range(1,m+1):\r\n x, y = map(int, input().split())\r\n l[i] = x\r\n r[i] = y\r\nfor i in range(1, n+1):\r\n if freq[i] >= i:\r\n for j in range(1, n+1):\r\n summ[j] = summ[j-1]\r\n if a[j] == i:\r\n summ[j] += 1\r\n for k in range(1, m+1):\r\n if summ[r[k]] - summ[l[k] - 1] == i:\r\n ans[k] += 1\r\nfor i in ans[1:]:\r\n print(i) ", "n, Q = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\nkon = int(n ** 0.5) + 1\r\nquery = [[] for _ in range(kon)]\r\n\r\nfor i in range(Q):\r\n\tl, r = map(int,input().split())\r\n\tquery[(l-1) // kon].append((l-1, r, i))\r\n\r\n#print(query)\r\n\r\nl = 0\r\nr = 0\r\ncnt = [0] * (n + 1)\r\ntmp = 0\r\n\r\nans = [0 for i in range(Q)]\r\n\r\nfor i in range(kon):\r\n\tif i % 2 == 0:\r\n\t\tquery[i].sort(key= lambda x: x[1])\r\n\telse:\r\n\t\tquery[i].sort(key= lambda x: -x[1])\r\n\tfor tl, tr, ind in query[i]:\r\n\t\tfor j in range(r, tr):#伸ばす\r\n\t\t\tif a[j] > n:\r\n\t\t\t\tcontinue\r\n\t\t\tif cnt[a[j]] == a[j]:\r\n\t\t\t\ttmp -= 1\r\n\t\t\tcnt[a[j]] += 1\r\n\t\t\tif cnt[a[j]] == a[j]:\r\n\t\t\t\ttmp += 1\r\n\t\tfor j in range(r-1, tr-1, -1):\r\n\t\t\tif a[j] > n:\r\n\t\t\t\tcontinue\r\n\t\t\tif cnt[a[j]] == a[j]:\r\n\t\t\t\ttmp -= 1\r\n\t\t\tcnt[a[j]] -= 1\r\n\t\t\tif cnt[a[j]] == a[j]:\r\n\t\t\t\ttmp += 1\r\n\t\tfor j in range(l, tl):#短縮\r\n\t\t\tif a[j] > n:\r\n\t\t\t\tcontinue\r\n\t\t\tif cnt[a[j]] == a[j]:\r\n\t\t\t\ttmp -= 1\r\n\t\t\tcnt[a[j]] -= 1\r\n\t\t\tif cnt[a[j]] == a[j]:\r\n\t\t\t\ttmp += 1\r\n\t\tfor j in range(l-1, tl-1, -1):\r\n\t\t\tif a[j] > n:\r\n\t\t\t\tcontinue\r\n\t\t\tif cnt[a[j]] == a[j]:\r\n\t\t\t\ttmp -= 1\r\n\t\t\tcnt[a[j]] += 1\r\n\t\t\tif cnt[a[j]] == a[j]:\r\n\t\t\t\ttmp += 1\r\n\t\tl = tl\r\n\t\tr = tr\r\n\t\tans[ind] = tmp\r\n\r\nprint(*ans, sep=\"\\n\")", "import sys\r\nfrom collections import *\r\n\r\n# import itertools\r\n# import math\r\n# import os\r\n# import random\r\n# from bisect import bisect, bisect_left\r\n# from functools import reduce\r\n# from heapq import heapify, heappop, heappush\r\n# from io import BytesIO, IOBase\r\n# from string import *\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\n# endregion fastio\r\n\r\n# # region interactive\r\n# def printQry(a, b) -> None:\r\n# sa = str(a)\r\n# sb = str(b)\r\n# print(f\"? {sa} {sb}\", flush = True)\r\n\r\n# def printAns(ans) -> None:\r\n# s = str(ans)\r\n# print(f\"! {s}\", flush = True)\r\n# # endregion interactive\r\n\r\n# # region dfsconvert\r\n# from types import GeneratorType\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n# # endregion dfsconvert\r\n\r\n# MOD = 998244353\r\n# MOD = 10 ** 9 + 7\r\n# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))\r\n\r\ndef solve() -> None:\r\n n, m = mint()\r\n nums = ints()\r\n\r\n # 提前读入所有查询，按r保存，进行离线求解\r\n qry = [[] for _ in range(n)]\r\n for i in range(m):\r\n l, r = mint()\r\n qry[r - 1].append((l - 1, i))\r\n\r\n # 树状数组进行区间查询\r\n bit = [0] * (n + 1)\r\n\r\n def lowbit(x: int) -> int:\r\n return x & -x\r\n\r\n def query(x: int) -> int:\r\n ans = 0\r\n while x:\r\n ans += bit[x]\r\n x -= lowbit(x)\r\n return ans\r\n\r\n def add(x: int, val: int):\r\n while x <= n:\r\n bit[x] += val\r\n x += lowbit(x)\r\n\r\n # 询问的结果\r\n ans = [0] * m\r\n pos = defaultdict(list)\r\n \r\n for r, x in enumerate(nums):\r\n pos[x].append(r)\r\n l = len(pos[x])\r\n if l >= x:\r\n # 前x个位置 + 1\r\n add(pos[x][l - x] + 1, 1)\r\n if l > x:\r\n # 前x + 1个位置 - 2， 把前面的1抹除并把前x个位置的1抵消\r\n add(pos[x][l - x - 1] + 1, -2)\r\n if l > x + 1:\r\n # 前x + 2个位置 + 1，把之前x+1位置抵消的1抹除\r\n add(pos[x][l - x - 2] + 1, 1)\r\n if not qry[r]: continue\r\n rs = query(r + 1)\r\n for l, i in qry[r]:\r\n ans[i] = rs - query(l)\r\n \r\n for v in ans:\r\n print(v)\r\n\r\nsolve()", "from functools import lru_cache\r\nfrom sys import stdin, stdout\r\nimport sys\r\nfrom math import *\r\n\r\n# from collections import deque\r\nsys.setrecursionlimit(int(2e5+10))\r\n# input = stdin.readline\r\n# print = stdout.write\r\n# dp=[-1]*100000\r\n\r\n# lru_cache(None)\r\n\r\nn,m=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nar.insert(0,0)\r\nranges=[[0,0]]\r\nfor i in range(m):\r\n\tl,r=map(int,input().split())\r\n\tranges.append([l,r])\r\ncnt=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n\tif(ar[i]<=n):\r\n\t\tcnt[ar[i]]+=1\r\nans=[0]*(m+1)\r\ns=[0]*(n+1)\r\n# print(cnt)\r\nfor i in range(1,n+1):\r\n\tif(cnt[i]>=i):\r\n\t\tfor j in range(1,n+1):\r\n\t\t\ts[j]=s[j-1]\r\n\t\t\tif(ar[j]==i):\r\n\t\t\t\ts[j]+=1\r\n\t\tfor j in range(1,m+1):\r\n\t\t\tif(s[ranges[j][1]]-s[ranges[j][0]-1]==i):\r\n\t\t\t\tans[j]+=1\r\nfor i in range(1,m+1):\r\n\tprint(ans[i])\r\n\r\n", "import math\r\nimport sys\r\nfrom bisect import bisect_left,bisect_right\r\nfrom collections import defaultdict as dd\r\nfrom collections import deque, Counter\r\nfrom heapq import heappop,heappush,heapify,merge\r\nfrom itertools import permutations, accumulate, product\r\nfrom math import gcd,sqrt,ceil\r\ntoBin=lambda x:bin(x).replace(\"0b\",\"\")\r\nI=lambda:map(int,input().split())\r\ninf=float(\"inf\");DIRS=[[1,0],[-1,0],[0,1],[0,-1]];CHARS=\"abcdefghijklmnopqrstuvwxyz\";MOD=10**9+7;fact=[1]*(300006)\r\nfor i in range(2, 300006):fact[i]=((fact[i-1]*i)%MOD)\r\ndef comb(n,r):return (fact[n]*pow(fact[r]*fact[n-r],MOD-2,MOD))%MOD if n>=r else 0\r\ninput=sys.stdin.readline\r\n\r\nclass UnionFind:\r\n def __init__(self,n):self.p=list(range(n));self.rank=[0]*n\r\n def find(self,x):\r\n if x!=self.p[x]:self.p[x]=self.find(self.p[x])\r\n return self.p[x]\r\n def union(self,x, y):\r\n px,py=self.find(x),self.find(y)\r\n if px==py:return 0\r\n self.p[py]=px\r\n self.rank[px]+=self.rank[py]\r\n return 1\r\nclass SegmentTree:\r\n def __init__(self,n,func):\r\n self.n=n;self.tree=[0]*2*self.n;self.func=func\r\n def query(self, l, r):\r\n l+=self.n;r+=self.n;ans=0\r\n while l<r:\r\n if l&1:ans=self.func(ans,self.tree[l]);l+=1\r\n if r&1:r-=1;ans=self.func(ans,self.tree[r])\r\n l>>=1;r>>=1\r\n return ans\r\n def update(self,i,val):\r\n i+=self.n;self.tree[i]=val\r\n while i>1:i>>=1;self.tree[i]=self.func(self.tree[i*2],self.tree[i*2+1])\r\nclass RangeQueue:\r\n def __init__(self,fn=min):\r\n self.inbox=[];self.outbox=[];self.fn=fn\r\n def mn(self,st):return st[-1][1] if st else 0 #gcd or max= or sum0,mi=inf\r\n def get_fn(self):return self.fn(self.mn(self.inbox),self.mn(self.outbox))\r\n def sz(self):return len(self.inbox)+len(self.outbox)\r\n def push(self,v):\r\n if not self.inbox:self.inbox.append((v,v))\r\n else:self.inbox.append((v,self.fn(v,self.mn(self.inbox))))\r\n def pop(self):\r\n if len(self.outbox)==0:self.shift()\r\n self.outbox.pop()\r\n def shift(self):\r\n while self.inbox:\r\n self.outbox.append((self.inbox[-1][0],self.fn(self.inbox[-1][0],self.mn(self.outbox))))\r\n self.inbox.pop()\r\n\r\nfrom types import GeneratorType\r\ndef cache(f,queue=[]):\r\n def wrappedfunc(*args,**kwargs):\r\n if queue:return f(*args, **kwargs)\r\n else:\r\n to = f(*args,**kwargs)\r\n while True:\r\n if isinstance(to,GeneratorType):queue.append(to);to = next(to)\r\n else:\r\n if not queue:break\r\n queue.pop()\r\n if not queue:break\r\n to=queue[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\ndef query(x,y):\r\n print(\"?\",x,y,flush=True)\r\n return int(input())\r\n\r\n# DP,BS,Greedy,Graph,Contribution,IE,Game,Reverse simulation\r\ndef main():\r\n \"\"\"\r\n given query l,r, we can only check numbers from 1 to r-l+1 (4:30m)\r\n binary search seems to be no\r\n trying dp (8:30m) no..its range query.\r\n contribution of each number to an offline query? (~13m)\r\n maybe marking the ranges of \"correct\" ranges? (15m)\r\n ai<=10**9 and n<=10**5..don't need to consider numbers>10**5\r\n stuck 33m\r\n 41m - going back to the idea at 15th min, we maintain a freq map\r\n and when x reaches x freq, we add it to a set, if it exceeds, we remove\r\n if we run into a complete interval at the time, we increment by the length of the set?\r\n but how do we know when the interval begins? maybe not the entire set, but partial?\r\n looking at editorial at 45th min mark. hint.(4m later cont..)\r\n \"\"\"\r\n n,m=I();A=list(I());Q=[];valid=[];MX=10**5+1;cnt=[0]*MX;res=[0]*m\r\n for _ in range(m):l,r=I();Q.append([l,r])\r\n for a in A:\r\n if a<MX:cnt[a]+=1\r\n valid=[i for i,c in enumerate(cnt) if c>=i and i>0]\r\n for v in valid:\r\n ps=[0]*(n+1)\r\n for i in range(n):ps[i+1]+=ps[i]+(A[i]==v)\r\n for i in range(m):\r\n l,r=Q[i]\r\n if ps[r]-ps[l-1]==v:res[i]+=1\r\n for x in res:print(x)\r\n\r\n###### Comment this out for Python 3 + imports at the top #####\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n###### Uncomment this for Python 3 (for deep recursion) ######\r\n# from sys import stdin, setrecursionlimit\r\n# import threading\r\n# from collections import defaultdict as dd\r\n# from collections import deque\r\n# setrecursionlimit(5*10**5);input=stdin.buffer.readline;I=lambda:map(int,input().split())\r\n# threading.stack_size(10**8)\r\n# t = threading.Thread(target=main)\r\n# t.start()\r\n# t.join()", "def get_amount_of_numbers(array, max_number):\n count = [0] * (max_number+1)\n for i in range(1, len(array)):\n index = array[i]\n if index < max_number:\n count[index] += 1\n\n return count\n\ndef get_amount_of_number_till_each_index(array, number):\n temp = [0] * len(array)\n\n for i in range(1, len(array)):\n val = 0\n if array[i] == number:\n val = 1\n temp[i] = temp[i-1] + val\n\n return temp\n\nmax_number = 100001\nne, nq = [int(x) for x in input().split()]\n \narray = [0]\narray.extend([int(x) for x in input().split()])\ncount = get_amount_of_numbers(array, max_number)\n\nstart = [0]\nstop = [0]\n\nfor i in range(nq):\n x, y = [int(x) for x in input().split()]\n start.append(x)\n stop.append(y)\n\nanswers = [0] * (nq+1)\n\nfor i in range(1, len(count)):\n if count[i] >= i :\n \n amount = get_amount_of_number_till_each_index(array, number=i)\n \n for q in range(1, nq+1):\n amount_at_start = amount[ start[q] - 1 ]\n amount_at_stop = amount[ stop[q] ]\n\n temp = amount_at_stop - amount_at_start\n if temp == i:\n answers[q] += 1\n\n\nfor i in range(1, nq+1):\n print(answers[i])\n\t\t \t \t\t \t \t \t\t \t\t \t \t \t \t", "\r\nimport sys\r\nn, m = map(int, input().split())\r\n\r\narr = list(map(int, input().split()))\r\n\r\n\r\n\r\nquers = []\r\n\r\nfor i in range(m):\r\n quers.append(list(map(int, sys.stdin.readline().split())))\r\n\r\nquer_answers = [0 for i in range(m)]\r\n\r\n\r\ncnt = [0 for i in range(100003)]\r\n#can_made = set()\r\nfor i in arr:\r\n if i <= 100000:\r\n cnt[i] += 1\r\n\r\ncan_be_made = []\r\n\r\nfor i in range(1,100003):\r\n if cnt[i] >= i:\r\n can_be_made.append(i)\r\n cnt[i] = len(can_be_made)-1\r\n ##can_made.add(i)\r\n\r\n## Cnt has now become our index array\r\n\r\n\r\n\r\nfor makable in can_be_made:\r\n prefs = [0]\r\n for i in range(len(arr)):\r\n if arr[i] == makable:\r\n prefs.append(prefs[-1]+1)\r\n else:\r\n prefs.append(prefs[-1])\r\n\r\n for i in range(m):\r\n l, r = quers[i]\r\n if prefs[r] - prefs[l-1] == makable:\r\n quer_answers[i] += 1\r\n\r\nfor i in range(m):\r\n print(quer_answers[i])", "import math\r\nfrom collections import defaultdict,deque\r\nimport heapq\r\nimport sys\r\nimport math\r\nimport bisect\r\ndef input():return sys.stdin.readline().strip() \r\n\r\n\r\ndef solve():\r\n n,m=map(int,input().split())\r\n arr=list(map(int,input().split()))\r\n query=[[] for j in range(int(n**0.5)+1)]\r\n for j in range(m):\r\n x,y=map(int,input().split())\r\n query[int(x/n**(0.5))].append((x-1,y-1,j))\r\n q=deque()\r\n for j in query:\r\n j.sort(key=lambda x:(x[1]))\r\n for p in j:\r\n q.append(p)\r\n d=defaultdict(lambda :0)\r\n j=0\r\n curl,curr,x=1,0,0\r\n res=[0]*m\r\n while j<len(q):\r\n l,r=q[j][0],q[j][1]\r\n while curl<l:\r\n d[arr[curl]]-=1 \r\n if d[arr[curl]]==arr[curl]-1:\r\n x-=1\r\n if d[arr[curl]]==arr[curl]:\r\n x+=1\r\n curl+=1\r\n while curl>l:\r\n curl-=1\r\n d[arr[curl]]+=1 \r\n if d[arr[curl]]==arr[curl]+1:\r\n x-=1\r\n if d[arr[curl]]==arr[curl]:\r\n x+=1\r\n while curr<r:\r\n curr+=1\r\n d[arr[curr]]+=1\r\n if d[arr[curr]]==arr[curr]+1:\r\n x-=1\r\n if d[arr[curr]]==arr[curr]:\r\n x+=1\r\n while curr>r:\r\n d[arr[curr]]-=1\r\n if d[arr[curr]]==arr[curr]-1:\r\n x-=1\r\n if d[arr[curr]]==arr[curr]:\r\n x+=1\r\n curr-=1\r\n res[q[j][2]]=x\r\n j+=1\r\n for j in res:\r\n print(j)\r\n\r\n \r\n\r\nif __name__ == '__main__':\r\n# for i in range(int(input())):\r\n solve()\r\n", "import sys\r\nfrom dataclasses import dataclass\r\n\r\n\r\n@dataclass\r\nclass Query:\r\n idx: int\r\n l: int\r\n r: int\r\n ans: int\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n arr = [0] + list(map(int, sys.stdin.readline().split()))\r\n\r\n num_set = set()\r\n for num in arr[1:]:\r\n num_set.add(num)\r\n nums = list(num_set)\r\n num2idx = {}\r\n for i, num in enumerate(nums):\r\n num2idx[num] = i\r\n\r\n close_arr_map = []\r\n for _ in range(n + 1):\r\n close_arr_map.append([])\r\n\r\n num_arr_map = []\r\n for _ in range(len(nums)):\r\n num_arr_map.append([])\r\n\r\n queries = []\r\n for i in range(m):\r\n l, r = map(int, input().split())\r\n queries.append(Query(idx=i, l=l, r=r, ans=0))\r\n close_arr_map[r].append(i)\r\n\r\n num_cnt = [0] * len(nums)\r\n x_cnt = 0\r\n over_num_idxs = []\r\n\r\n for i in range(1, n + 1):\r\n num = arr[i]\r\n num_idx = num2idx[num]\r\n if num <= n:\r\n num_arr_map[num_idx].append(i)\r\n\r\n next_cnt = num_cnt[num_idx] + 1\r\n if next_cnt == num:\r\n x_cnt += 1\r\n over_num_idxs.append(num_idx)\r\n elif next_cnt == num + 1:\r\n x_cnt -= 1\r\n num_cnt[num_idx] = next_cnt\r\n\r\n for query_idx in close_arr_map[i]:\r\n left = queries[query_idx].l\r\n fixed_cnt = 0\r\n for over_num_idx in over_num_idxs:\r\n over_cnt = num_cnt[over_num_idx] - nums[over_num_idx]\r\n\r\n num_arr = num_arr_map[over_num_idx]\r\n if over_cnt == 0:\r\n if left > num_arr[0]:\r\n fixed_cnt -= 1\r\n elif num_arr[over_cnt - 1] < left <= num_arr[over_cnt]:\r\n fixed_cnt += 1\r\n\r\n queries[query_idx].ans = x_cnt + fixed_cnt\r\n\r\n for query in queries:\r\n sys.stdout.write(f'{query.ans}\\n')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\nclass SegmentTree:\r\n def __init__(self, arr):\r\n self.arr = arr\r\n self.tree = [0] * (4 * len(arr))\r\n self._build(0, 0, len(arr) - 1)\r\n\r\n def _build(self, node, start, end):\r\n if start == end:\r\n self.tree[node] = self.arr[start]\r\n else:\r\n mid = (start + end) // 2\r\n self._build(2 * node + 1, start, mid)\r\n self._build(2 * node + 2, mid + 1, end)\r\n self.tree[node] = self.tree[2 * node + 1] + self.tree[2 * node + 2]\r\n\r\n def query_range_sum(self, start, end):\r\n return self._query_range_sum(0, 0, len(self.arr)-1, start, end)\r\n\r\n def _query_range_sum(self, node, start, end, l, r):\r\n if r < start or end < l:\r\n return 0\r\n elif l <= start and end <= r:\r\n return self.tree[node]\r\n else:\r\n mid = (start + end) // 2\r\n left_sum = self._query_range_sum(2 * node + 1, start, mid, l, r)\r\n right_sum = self._query_range_sum(2 * node + 2, mid + 1, end, l, r)\r\n return left_sum + right_sum\r\n\r\n def add_value(self, index, value):\r\n self._add_value(0, 0, len(self.arr)-1, index, value)\r\n\r\n def _add_value(self, node, start, end, index, value):\r\n if start == end:\r\n self.arr[index] += value\r\n self.tree[node] += value\r\n else:\r\n mid = (start + end) // 2\r\n if index <= mid:\r\n self._add_value(2 * node + 1, start, mid, index, value)\r\n else:\r\n self._add_value(2 * node + 2, mid + 1, end, index, value)\r\n self.tree[node] = self.tree[2 * node + 1] + self.tree[2 * node + 2]\r\ndef main():\r\n n,m=rm()\r\n d=[[] for i in range(n+1)]\r\n vs=[[] for i in range(n+1)]\r\n ns=[0 for i in range(n+1)]\r\n ans=[0]*m\r\n ns=SegmentTree(ns)\r\n a=[0]+rl()\r\n for i in range(m):\r\n l,r=rm()\r\n d[r].append([[l,r],i])\r\n for i in range(1,n+1):\r\n if a[i]<n+1:\r\n vs[a[i]].append(i)\r\n if len(vs[a[i]])>=a[i]:\r\n ns.add_value(vs[a[i]][-a[i]],1)\r\n if len(vs[a[i]])>a[i]:\r\n ns.add_value(vs[a[i]][-a[i]-1],-2)\r\n if len(vs[a[i]])>a[i]+1:\r\n ns.add_value(vs[a[i]][-a[i]-2],1)\r\n for elm in d[i]:\r\n ans[elm[1]]=ns.query_range_sum(elm[0][0],elm[0][1]) \r\n for i in range(m):\r\n print(ans[i])\r\nmain()", "import bisect\nimport collections\nimport heapq\nimport math\ndef do():\n n, n_query = map(int, input().split(\" \"))\n N = max(n, n_query) + 1\n\n nums = [0] * N\n count = [0] * N\n tmp = [int(c) for c in input().split(\" \")]\n for i,d in enumerate(tmp):\n nums[i+1] = d\n if d <= n:\n count[d] += 1\n l = [0] * N\n r = [0] * N\n s = [0] * N\n res = [0] * N\n for i in range(1, n_query + 1):\n l[i], r[i] = map(int, input().split(\" \"))\n for i in range(1, n + 1):\n if i <= count[i]:\n for j in range(1, n + 1):\n s[j] = s[j - 1] + (nums[j] == i)\n for j in range(1, n_query + 1):\n if s[r[j]] - s[l[j] - 1] == i:\n res[j] += 1\n for i in range(1, n_query + 1):\n print(res[i])\n\ndo()\n\n\n\n\n\n", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\nquery=[[] for j in range(int(n**0.5)+1)]\r\narr=list(map(int,input().split()))\r\nfor j in range(m):\r\n x,y=map(int,input().split())\r\n query[int(x/n**0.5)].append([x-1,y-1,j])\r\nq=[]\r\nfor j in query:\r\n j.sort(key=lambda x:x[1])\r\n for p in j:\r\n q.append(p)\r\nd=defaultdict(lambda:0)\r\nj=0\r\ncurrL,currR,x= 1,0,0\r\nres=[0]*(m)\r\nwhile(j<len(q)):\r\n L,R=q[j][0],q[j][1]\r\n\r\n while currL < L:\r\n d[arr[currL]]-=1\r\n if d[arr[currL]]==(arr[currL]-1):\r\n x-=1\r\n if d[arr[currL]] == (arr[currL]):\r\n x += 1\r\n currL += 1\r\n\r\n while currL > L:\r\n currL -= 1\r\n d[arr[currL]] += 1\r\n if d[arr[currL]]==(arr[currL]+1):\r\n x-=1\r\n if d[arr[currL]]==(arr[currL]):\r\n x+=1\r\n\r\n\r\n\r\n\r\n\r\n while currR<R:\r\n currR += 1\r\n d[arr[currR]] += 1\r\n if d[arr[currR]]==(arr[currR]+1):\r\n x-=1\r\n if d[arr[currR]] == (arr[currR]):\r\n x += 1\r\n\r\n\r\n\r\n\r\n while currR > R:\r\n\r\n d[arr[currR]] -= 1\r\n if d[arr[currR]]==(arr[currR]-1):\r\n x-=1\r\n if d[arr[currR]] == (arr[currR]):\r\n x += 1\r\n currR -= 1\r\n\r\n\r\n res[q[j][2]]=x\r\n j+=1\r\nfor j in res:\r\n print(j)\r\n\r\n" ]

[ "TUX=int(input())\r\nFOO=0\r\nBAR=0\r\nBAZ=0\r\nQUZ=1\r\nfor i in range(TUX):\r\n PUR=int(input())\r\n FOO=FOO+PUR\r\n BAR=BAR+1\r\n if FOO*QUZ>BAZ*BAR:\r\n BAZ=FOO\r\n QUZ=BAR\r\nprint(BAZ/QUZ)", "a=[0,0]\r\nmx=0\r\nfor i in range(int(input())):\r\n s=int(input())\r\n a[s]+=1\r\n mx=max(mx,a[1]/(a[1]+a[0]))\r\nprint(mx)\r\n \r\n", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\nn = int(input())\r\nans = 0\r\nwin = 0\r\nfor i in range(1,n+1):\r\n x = int(input())\r\n win+=x\r\n ans = max(ans,win/i)\r\nprint(str(ans)+\"\\n\")\r\n", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\nfoo, bar, baz, quz = 0, 0, 0, 1\r\ntux = ii()\r\nfor _ in range(tux):\r\n pur = ii()\r\n foo += pur\r\n bar += 1\r\n if foo * quz > bar * baz:\r\n baz, quz = foo, bar\r\nprint(baz / quz)\r\n", "tux=int(input())\r\nfoo=0\r\nbar=0\r\nbaz=0\r\nquz=1\r\nwhile tux>0:\r\n tux-=1\r\n pur=int(input())\r\n foo+=pur\r\n bar+=1\r\n if max(foo*quz,bar*baz) == foo*quz:\r\n baz=foo\r\n quz=bar\r\nprint(baz/quz)\r\n", "foo, bar, baz, quz = [0, 0, 0, 1]\r\ntux = int(input())\r\nfor _ in range(tux):\r\n pur = int(input())\r\n foo += pur\r\n bar += 1\r\n if foo * quz > bar * baz:\r\n baz = foo\r\n quz = bar\r\nprint(baz / quz)", "TUX = input()\r\nFOO = 0\r\nBAR = 0\r\nBAZ = 0\r\nQUZ = 1\r\nTUX = int(TUX)\r\nwhile TUX != 0:\r\n PUR = input()\r\n PUR = int(PUR)\r\n FOO = FOO + PUR\r\n BAR = BAR + 1\r\n #if max(FOO * QUZ, BAR\r\n if max(FOO * QUZ, BAR * BAZ) == FOO * QUZ:\r\n #if BOTH SAEM BIGGR OF PRODUKT OF FOO AN QUZ AN PRODUKT OF BAR BAZ AN PRODUKT OF FOO AN QUZ:\r\n BAZ = FOO\r\n QUZ = BAR\r\n TUX = TUX - 1\r\nBAZ = int(BAZ)\r\nprint(BAZ / QUZ)\r\n", "tux = int(input())\nfoo = 0\nbar = 0\nbaz = 0\nquz = 1\nfor i in range(tux):\n pur = int(input())\n foo += pur\n bar += 1\n if foo * quz > baz * bar:\n baz = foo\n quz = bar\nprint(baz / quz)", "tux = int(input())\nfoo, bar, baz, quz = 0, 0, 0, 1\n\nfor _ in range(tux):\n foo += int(input())\n bar += 1\n\n if foo * quz >= bar * baz:\n baz, quz = foo, bar\n\nprint(baz / quz)", "numbers = []\nhighest = 0\nfor _ in range(int(input())):\n\tnumbers.append(int(input()))\n\tif highest < sum(numbers)/len(numbers): highest = sum(numbers)/len(numbers)\nprint(highest)\n\n\"\"\"\nFOO = sum(input)\nBAR = number input\nBAZ = 0\nQUZ = 0\n#BOTH SAEM ( \n\tBIGGR OF (\n\t\t(PRODUKT OF FOO AN QUZ) \n\t\tAN (PRODUKT OF BAR BAZ)\n\t) \n\tAN (PRODUKT OF FOO AN QUZ))\"\"\"", "tux = int(input())\r\nfoo = 0\r\nbar = 0\r\nbaz = 0\r\nquz = 1\r\nfor i in range(0, tux):\r\n \r\n pur = int(input())\r\n\r\n \r\n foo += pur\r\n bar += 1\r\n if foo * quz > baz * bar:\r\n baz = foo\r\n quz = bar\r\nprint('%.6f'%(baz/quz))\r\n", "tux = input()\r\nfoo, bar, baz,quz = 0,0,0,1\r\ntux = int(tux)\r\nfor i in range(tux):\r\n pur = int(input())\r\n foo+=pur\r\n bar+=1\r\n if foo*quz > bar*baz:\r\n baz = foo\r\n quz = bar\r\n\r\nprint(round(baz/quz,6))", "#!/usr/bin/env python3\r\n\r\ntux = input()\r\n\r\nfoo = 0\r\nbar = 0\r\nbaz = 0\r\nquz = 1\r\n\r\ntux = int(tux)\r\n\r\nwhile tux > 0:\r\n pur = input()\r\n pur = int(pur)\r\n\r\n foo = foo + pur\r\n bar = bar + 1\r\n\r\n if max(foo * quz, bar * baz) == foo * quz:\r\n baz = foo\r\n quz = bar\r\n\r\n tux -= 1\r\n\r\nprint(baz / quz)", "#input\r\nn = int(input())\r\nfo,br,bz,qu = 0,0,0,1\r\nfor i in range(n):\r\n p = int(input())\r\n fo = fo+p\r\n br = br+1\r\n if bz/qu<=fo/br:\r\n bz = fo\r\n qu = br\r\n else :\r\n break\r\n\r\nprint(bz/qu)", "TUX=int(input())\nFOO=0\nBAR=0\nBAZ=0\nQUZ=1\nfor i in range(TUX):\n PUR=int(input())\n FOO=FOO+PUR\n BAR=BAR+1\n if FOO*QUZ>BAZ*BAR:\n BAZ=FOO\n QUZ=BAR\nprint(BAZ/QUZ)", "tux=int(input())\r\nfoo=0;\r\nbar=0\r\nbaz=0\r\nquz=1\r\nfor i in range(tux):\r\n pur=int(input())\r\n foo=foo+pur\r\n bar=bar+1\r\n if foo*quz>baz*bar:\r\n baz=foo\r\n quz=bar\r\nprint(baz/quz)\r\n", "#in the name of god\r\n#Mr_Rubik\r\n#http://codeforces.com/problemset/problem/290/C\r\nfoo=baz=0;quz=1\r\nfor bar in range(1, int(input()) + 1):\r\n foo+=int(input())\r\n if foo*quz<baz*bar: \r\n break\r\n baz,quz=foo,bar\r\nprint(baz / quz)" ]

[ "R = lambda: map(int, input().split())\r\nn, mm = R()\r\ncts, tws = list(R()), list(R())\r\nl, r = 0, 2 * 10 ** 9 + 7\r\nwhile l < r:\r\n m = (l + r) // 2\r\n j = 0\r\n for i in range(mm):\r\n while j < n and tws[i] - m <= cts[j] <= tws[i] + m:\r\n j += 1\r\n if j != n:\r\n l = m + 1\r\n else:\r\n r = m\r\nprint(l)", "# love thy neighbour\r\nfrom sys import stdin,stdout\r\ndef ArrayIn():return list(map(int,input().split()))\r\n#def print(x):stdout.write(f'{x}\\n')\r\n\r\nn, m = ArrayIn()\r\na = ArrayIn()\r\nb = ArrayIn()\r\n\r\ndef Dist(x,y):return abs(x-y)\r\n\r\nl, r=0, 0\r\nans=-1\r\nwhile l<n and r<m:\r\n prev=int(21e9)\r\n while r<m:\r\n curr=Dist(a[l],b[r])\r\n if curr>prev:\r\n r-=1\r\n break\r\n prev=curr\r\n r+=1\r\n else:r-=1\r\n ans = max(ans, Dist(a[l],b[r]) )\r\n l+=1\r\n\r\nprint(ans)\r\n", "############ ---- Input Functions ---- ############\nimport sys\ninput = sys.stdin.readline\n\n# takes integer inputs\ndef inp():\n return(int(input()))\n# takes List inputs\ndef inlt(): \n return(list(map(int,input().split())))\n# takes string inputs\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\n# takes space space separated integer inputs\ndef invr():\n return(list(map(int, input().split())))\n\nnum_cities, num_towers = invr()\ncities = inlt()\ntowers = inlt()\n\nj = 0\nans = 0\nfor i in range(num_cities):\n while j+1 < num_towers and abs(towers[j+1] - cities[i]) <= abs(towers[j] - cities[i]):\n j += 1\n ans = max(ans, abs(cities[i] - towers[j]))\n\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nN, M = [int(x) for x in input().split()]\r\nC = [int(x) for x in input().split()]\r\nT = [int(x) for x in input().split()]\r\n\r\ni = 0\r\nres = 0\r\nfor city in C:\r\n while i < M and T[i] < city:\r\n i += 1\r\n dist = abs(T[min(i, M-1)] - city)\r\n if i > 0:\r\n dist = min(dist, abs(T[i-1] - city))\r\n res = max(dist, res)\r\nprint(res)", "import sys\n\nread = sys.stdin.readline\nwrite = sys.stdout.write\n\nn, m = map(int, read().split(\" \"))\n\ncities = list(map(int, read().split(\" \")))\ncities.sort()\n\ntowers = list(map(int, read().split(\" \")))\ntowers.sort()\n\nans = 0\n\nl, r = 0, 2 * 10 ** 9\nwhile l <= r:\n m = l + (r - l) // 2\n\n covered = 0\n\n i, j = 0, 0\n while i < len(cities) and j < len(towers):\n if abs(cities[i] - towers[j]) <= m:\n covered += 1\n i += 1\n else:\n j += 1\n\n if covered == len(cities):\n ans = m\n r = m - 1\n else:\n l = m + 1\n\nwrite(f\"{ans}\")\n", "n, m = map(int, input().split())\r\nc = [int(x) for x in input().split()]\r\nt = [int(x) for x in input().split()]\r\n\r\nans = []\r\n\r\nfor i in c:\r\n l, r = -1, len(t) - 1\r\n while r - l > 1:\r\n m = (l + r) // 2\r\n if i < t[m]:\r\n r = m\r\n else:\r\n l = m\r\n ans.append(min(abs(i - t[l]), abs(i - t[r])))\r\n\r\nprint(max(ans))", "n, m = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nmindists = [10**50] * n\n\nfor i in range(n):\n l = 0\n r = m-1\n while r-l>1:\n mid = (r+l)//2\n if b[mid] > a[i]:\n r = mid\n else:\n l = mid\n mindists[i] = min(abs(a[i]-b[r]), abs(a[i]-b[r-1]))\nprint(max(mindists))\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", "import bisect\nI=lambda:list(map(int,input().split()))\nN=10**10\nn,m=I()\na=I()\nb=[-N]+I()+[N]\nz=0\nfor i in a:t=bisect.bisect(b,i);z=max(z,min(b[t]-i,i-b[t-1]))\nprint(z)\n\t \t \t\t \t \t\t \t\t\t\t\t\t \t \t\t\t", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\ndef find(mid):\n global A,B,M\n for i in A:\n r = bisect(B,i)\n l = max(0,r-1)\n if r==M:r-=1\n if abs(B[l]-i)>mid and abs(B[r]-i)>mid:\n return False\n return True\n \nN,M = map(int,input().split())\nA = sorted(list(map(int,input().split())))\nB = sorted(set(map(int,input().split())))\nM = len(B)\n# print(find(3))\nl,r = 0,10**18\nwhile l<r:\n mid = (l+r)//2\n if find(mid):\n r = mid\n else:\n l = mid+1\nprint(l)", "import bisect \n\nn, m = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\n\nans = 0\n\nfor elem in a:\n pos = bisect.bisect(b, elem)\n # print(f\"pos {pos} b {b} elem {elem}\")\n if pos == 0:\n ans = max(ans, b[pos] - elem)\n continue\n \n if pos == m:\n ans = max(ans, elem - b[-1])\n continue\n \n res = min(elem - b[pos-1], b[pos] - elem)\n ans = max(ans, res)\n\nprint(ans)\n\n", "n, m = [int(x) for x in input().split(' ')]\ntowns = [int(x) for x in input().split(' ')]\nturrets = [int(x) for x in input().split(' ')]\n\nleft = -1\nright = 2*10**9 + 1\n\nwhile right - left > 1:\n middle_r = left + (right - left) // 2\n points = []\n l = 0\n failed = 0\n for x in towns:\n while l < m and turrets[l] + middle_r < x:\n l += 1\n if l == m or not (turrets[l] - middle_r <= x and turrets[l] + middle_r >= x):\n failed = 1\n if failed == 1:\n left = middle_r\n else:\n right = middle_r\n \nprint(right)\n\n\t \t \t \t \t\t\t\t\t \t\t \t", "from sys import stdin,stdout\ndef ArrayIn():return list(map(int,input().split())) \nn, m = ArrayIn()\na=ArrayIn()\nb=ArrayIn()\ndef Dist(x,y):return abs(x-y)\nl=0\nr=0\nres=-1\nwhile l<n and r<m:\n prev=int(21e9)\n while r<m:\n curr=Dist(a[l],b[r])\n if curr>prev:\n r-=1\n break\n prev=curr\n r+=1\n else:r-=1\n res = max(res, Dist(a[l],b[r]) )\n l+=1\nprint(res)\n \t\t\t\t \t \t \t \t \t\t\t\t\t\t \t\t\t", "import sys\r\nfrom os import path\r\n\r\n# input = sys.stdin.readline\r\n# sys.setrecursionlimit(10**5)\r\n\r\nif(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n\r\ndef listInp():\r\n return list(map(int,input().split()))\r\n\r\ndef mapInp():\r\n return map(int,input().split())\r\n\r\nn,m = mapInp()\r\ncities = sorted(listInp())\r\ntowers = sorted(listInp())\r\n\r\ni = 0\r\nj = 0\r\n\r\nclosest = [1e10]*n\r\n\r\nwhile i<n:\r\n if j<m-1 and cities[i] >= towers[j]:\r\n j+=1\r\n\r\n else:\r\n # print(i,j)\r\n closest[i] = abs(towers[j] - cities[i])\r\n if j>0: closest[i] = min(closest[i], abs(cities[i] - towers[j-1]))\r\n i+=1\r\n\r\nprint(max(closest))\r\n\r\n ", "n, m = map(int, input().split())\ncities = list(map(int, input().split()))\ntowers = list(map(int, input().split()))\nj = 0\nans = 0\nfor i in range(n):\n while j + 1 < m and abs(cities[i] - towers[j]) >= abs(cities[i] - towers[j + 1]):\n j += 1\n ans = max(ans, abs(cities[i] - towers[j]))\nprint(ans)", "import sys\r\nimport math\r\n# Fast input\r\n\r\n# Fast output\r\ndef print(*args, **kwargs):\r\n sep = kwargs.get('sep', ' ')\r\n end = kwargs.get('end', '\\n')\r\n file = kwargs.get('file', sys.stdout)\r\n flush = kwargs.get('flush', False)\r\n output = sep.join(map(str, args)) + end\r\n file.write(output)\r\n if flush:\r\n file.flush()\r\n\r\ndef listin():\r\n \r\n l=list(map(int,input().split()))\r\n return l\r\ndef two():\r\n n,m=map(int,input().split())\r\n return n,m\r\ndef three():\r\n n,m,p=map(int,input().split())\r\n return n,m,p\r\ndef binarySearch(arr, x):\r\n l=0\r\n r=len(arr)-1\r\n while l <= r:\r\n \r\n mid = l + (r - l) // 2\r\n \r\n \r\n if arr[mid] == x:\r\n return mid\r\n \r\n \r\n elif arr[mid] < x:\r\n l = mid + 1\r\n \r\n \r\n else:\r\n r = mid - 1\r\n \r\n \r\n return l\r\n\r\nn,k=two()\r\nl1=listin()\r\nl2=listin()\r\nx=[]\r\nfor i in l1:\r\n x.append(binarySearch(l2,i))\r\nm=0\r\nj=0\r\n\r\nfor i in x:\r\n f=float('inf')\r\n \r\n if i-1>=0:\r\n f=min(l1[j]-l2[i-1],f)\r\n if i<k:\r\n \r\n f=min(l2[i]-l1[j],f)\r\n m=max(f,m)\r\n j+=1\r\nprint(m)", "import math\n\nn, m = map(int, input().split())\na = [[int(x), 'c', math.inf] for x in input().split()]\nb = [[int(x), 'h', math.inf] for x in input().split()]\nc = sorted(a + b)\n\ni = 0\nind = -1\n\n# проход в одну сторону\nwhile i < m + n:\n if c[i][1] == 'h':\n ind = i\n c[i][2] = 0\n elif ind != -1:\n c[i][2] = c[i][0] - c[ind][0]\n i += 1\n\n# в другую\nc = c[::-1]\ni = 0\nind = -1\n\nwhile i < m + n:\n if c[i][1] == 'h':\n ind = i\n c[i][2] = 0\n elif ind != -1:\n c[i][2] = min(c[i][2], c[ind][0] - c[i][0])\n i += 1\n\n# нахождение максимального расстояния\nmax_ = 0\nfor i in range(n + m):\n max_ = max(max_, c[i][2])\n\nprint(max_)\n\t \t\t\t \t \t \t\t\t \t \t \t", "def is_covered(cities, towers, r):\n n = len(cities)\n m = len(towers)\n city_index = 0\n\n for i in range(m):\n left_bound = towers[i] - r\n right_bound = towers[i] + r\n\n while city_index < n and cities[city_index] <= right_bound:\n if cities[city_index] >= left_bound:\n city_index += 1\n else:\n return False\n\n return city_index == n\n\ndef find_min_r(n, m, cities, towers):\n left = 0\n right = max(towers[-1] - cities[0], cities[-1] - towers[0])\n result = right\n\n while left <= right:\n mid = (left + right) // 2\n\n if is_covered(cities, towers, mid):\n result = mid\n right = mid - 1\n else:\n left = mid + 1\n\n return result\n\nn, m = map(int, input().split())\ncities = list(map(int, input().split()))\ntowers = list(map(int, input().split()))\n\nresult = find_min_r(n, m, cities, towers)\nprint(result)\n\n \t\t \t\t \t\t\t\t \t \t\t\t\t \t\t \t\t\t", "from sys import stdin\r\n\r\nfor line in stdin:\r\n # Read and solve case\r\n m,n = list(map(int, line.split()))\r\n A = list(map(int, stdin.readline().split()))\r\n B = list(map(int, stdin.readline().split()))\r\n r = 0\r\n j = 0\r\n for i in range(m):\r\n while j + 1 < n and abs(B[j+1]-A[i]) <= abs(B[j]-A[i]):\r\n j += 1\r\n r = max(r, abs(B[j]-A[i]))\r\n print(r)\r\n", "# import sys\r\n# sys.stdin = open(\"CFCellularNetwork.in\")\r\nn,m = tuple(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\n#print(a,b) #a are the cities, b are the towers\r\ndef check(r):\r\n cur_city = 0\r\n cur_tower = 0\r\n while cur_city<n and cur_tower<m:\r\n #print(a[cur_city],b[cur_tower])\r\n if abs(a[cur_city]-b[cur_tower])<=r:\r\n cur_city+=1\r\n elif a[cur_city]+r<b[cur_tower]:\r\n return False\r\n else:\r\n cur_tower+=1\r\n return cur_city==n\r\n\r\nans = -1\r\nlo = 0\r\nhi = 2e9\r\nwhile lo <= hi:\r\n mid = lo + (hi - lo) // 2\r\n if check(mid):\r\n ans = mid\r\n hi = mid - 1\r\n else:\r\n lo = mid + 1\r\n #print(mid,check(mid))\r\nprint(int(ans))\r\n'''\r\n[0,0,0,0,1,1,1,1]\r\nfind the first 1\r\n'''", "def binary_search(towers, city):\r\n low = 0\r\n high = len(towers) - 1\r\n r = abs(towers[0] - city)\r\n while low <= high:\r\n mid = (low + high) // 2\r\n if abs(towers[mid] - city) <r:\r\n r=abs(towers[mid] - city)\r\n elif towers[mid] < city:\r\n low = mid + 1\r\n else:\r\n high = mid - 1\r\n\r\n return r\r\n# Lecture des entrées\r\nn, m = map(int, input().split())\r\ncities = list(map(int, input().split()))\r\ntowers = list(map(int, input().split()))\r\nlist=[]\r\nfor i in cities:\r\n list.append(binary_search(towers,i))\r\nprint(max(list))\r\n\r\n\r\n\r\n\r\n", "R = lambda: map(int, input().split())\r\nn, m = R()\r\ncities = sorted(R())\r\ntowers = [-10 ** 19] + sorted(R()) + [10 ** 19]\r\nr = 0\r\nj = 1\r\nfor city in cities:\r\n while j < len(towers) and towers[j] <= city:\r\n j += 1\r\n r = max(r, min(city - towers[j - 1], towers[j] - city))\r\nprint(r)", "from bisect import bisect\r\nfrom collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\n\r\narr_c = list(map(int, input().split()))\r\narr_t = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor c in arr_c:\r\n idx = bisect(arr_t, c) - 1\r\n ans = max(ans, min([abs(arr_t[idx]-c), abs(arr_t[min(idx+1, m-1)]-c), abs(arr_t[max(idx-1, 0)]-c)]))\r\n\r\n\r\nprint(ans)", "import bisect\n\nI1=lambda:list(map(int,input().split()))\nN=10**10\nn1,m1=I1()\na=I1()\nb=[-N]+I1()+[N]\nz=0\nfor i in a:t=bisect.bisect(b,i);z=max(z,min(b[t]-i,i-b[t-1]))\nprint(z)\n\t \t \t \t \t\t \t\t \t\t\t \t \t\t\t\t", "'''\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'''\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'''\nimport bisect\nT = lambda:list(map(int,input().split()))\nN = 10**10\nn,m=T()\na =T()\nb = [-N] + T() + [N]\nz=0\nfor i in a: t = bisect.bisect(b,i);z=max(z,min(b[t]-i,i-b[t-1]))\nprint(z)\n\t \t \t\t \t \t \t\t \t \t \t \t", "def lower_bound(a,n):\r\n l,r=0,len(a)-1\r\n while l<r:\r\n mid = (l+r)>>1\r\n if a[mid]>=n:\r\n r=mid\r\n else:\r\n l=mid+1\r\n return r\r\nN = 10**10\r\nn,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nt = [-N]+list(map(int,input().split()))+[N]\r\nans = 0\r\nfor i in c:\r\n cur = lower_bound(t,i)\r\n #print(t[cur],i)\r\n dist = min(t[cur]-i,i-t[cur-1])\r\n ans = max(ans,dist)\r\nprint(ans)", "\"\"\"\nhttps://codeforces.com/contest/702/problem/C\n\"\"\"\nimport sys\n\n# def main():\n# # sys.stdin = open(\"702C.in\", \"r\")\n# n, m = map(int, input().strip().split())\n# a = list(set(map(int, input().strip().split())))\n# b = list(set(map(int, input().strip().split())))\n#\n# a.sort()\n# b.sort()\n#\n# r = 0\n# i, j = 0, 0\n# while i < len(a):\n# cur_r = abs(b[j] - a[i])\n# while j+1 < len(b):\n# j += 1\n# if abs(b[j] - a[i]) <= cur_r:\n# cur_r = min(cur_r, abs(b[j] - a[i]))\n# else:\n# j -= 1\n# break\n#\n# r = max(r, cur_r)\n# i += 1\n#\n# print(r)\n#\n# main()\n\n\ndef main():\n # sys.stdin = open(\"702C.in\", \"r\")\n n, m = map(int, input().strip().split())\n a = list(set(map(int, input().strip().split())))\n b = list(set(map(int, input().strip().split())))\n\n a.sort()\n b.sort()\n # lst = []\n # for i in range(len(a)):\n # lst.append((a[i], 0))\n # for i in range(len(b)):\n # lst.append((b[i], 1))\n # lst.sort()\n\n # tttccctttctcct\n\n r = 0\n i = 0\n left = 0\n while i < len(a):\n j = left\n while j < len(b) and b[j] < a[i]:\n j += 1\n j -= 1\n left = max(j, left)\n right = j+1 if j+1 < len(b) else left\n\n r = max(r, min(abs(a[i] - b[left]), abs(a[i] - b[right])))\n i += 1\n\n\n print(r)\n\n\nmain()", "n, t = [int(a) for a in input().split()]\na = list(map(int,input().strip().split()))\nb = list(map(int,input().strip().split()))\n\nj=0\nans=0\nfor i in range(n):\n while j + 1 < t and abs(a[i] - b[j]) >= abs(a[i] - b[j+1]):\n j+=1\n ans = max(ans, abs(a[i] - b[j]))\n\nprint(ans)\n \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", "import bisect\nI=lambda:list(map(int,input().split()))\nN1=10**10\nn,m=I()\na=I()\nb=[-N1]+I()+[N1]\nz=0\nfor i in a:t=bisect.bisect(b,i);z=max(z,min(b[t]-i,i-b[t-1]))\nprint(z)\n\t\t\t \t \t \t\t\t\t \t\t\t \t \t\t\t\t", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nx = 0\r\ny = 0\r\nfor i in a:\r\n while b[y] < i and y+1 < len(b):\r\n y += 1\r\n x = max(x,min(abs(b[y]-i),abs(b[y-1]-i)))\r\nprint(x)\r\n", "n,m = (int(x) for x in input().split())\r\nphone = [int(x) for x in input().split()]\r\ntower = [int(x) for x in input().split()]\r\ntower += [tower[-1]]\r\n\r\nr = 0\r\np = t = 0\r\n\r\nwhile p < n and t < m:\r\n \r\n if abs(tower[t] - phone[p]) > r:\r\n \r\n dis = abs(tower[t] - phone[p])\r\n #print(\"HHHH: \", dis)\r\n \r\n while t < m:\r\n t += 1\r\n if abs(tower[t] - phone[p]) > dis:\r\n break\r\n \r\n dis = min(abs(tower[t] - phone[p]), dis)\r\n t = t - 1\r\n r = max( abs(tower[t] - phone[p]) , r)\r\n\r\n else:\r\n p += 1\r\nprint(r) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\ninp = input().split()\r\nn = int(inp[0])\r\nm = int(inp[1])\r\n\r\na = input().split()\r\nb = input().split()\r\n\r\nmax_r = 0\r\n\r\nmark_a = 0\r\nmark_b = 0\r\n\r\nr = 0\r\n\r\nwhile mark_a < n:\r\n grape = int(a[mark_a])\r\n if mark_b < m:\r\n sprayer = int(b[mark_b])\r\n if mark_b < m - 1:\r\n next_sprayer = int(b[mark_b + 1])\r\n else:\r\n next_sprayer = grape + 2 * 10**10\r\n if abs(grape - sprayer) < abs(next_sprayer - grape):\r\n r = abs(grape - sprayer)\r\n if (max_r < r):\r\n max_r = r\r\n mark_a += 1\r\n else:\r\n mark_b += 1\r\n \r\nprint(max_r)\r\n", "n, m = map(int, input().split())\n\na = [int(el) for el in input().split()]\nb = [int(el) for el in input().split()]\n\nmin_r = 0\nstart_l = 0\nfor el in a:\n l = start_l\n r = m - 1\n while (r-l) >= 0:\n mid = (l + r) // 2 \n if b[mid] > el: \n r = mid - 1\n else:\n l = mid + 1 \n \n start_l = r if r > 0 else 0\n r_ = start_l if start_l < (m - 1) else start_l - 1 \n r_ = min(abs(b[r_ + 1] - el), abs(b[r_] - el))\n if r_ > min_r:\n min_r = r_ \nprint(min_r)\n\t \t \t \t\t\t\t\t \t \t \t\t\t\t\t\t\t", "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\nN,M=map(int,readline().split())\r\nA=list(map(int,readline().split()))\r\ninf=1<<60\r\nB=[-inf]+list(map(int,readline().split()))+[inf]\r\nans=0\r\nfor a in A:\r\n i=bisect.bisect_left(B,a)\r\n ans=max(ans,min(a-B[i-1],B[i]-a))\r\nprint(ans)", "def max_difference(n, t, a, b):\n j = 0\n ans = 0\n for i in range(n):\n while j + 1 < t and abs(a[i] - b[j]) >= abs(a[i] - b[j + 1]):\n j += 1\n ans = max(ans, abs(a[i] - b[j]))\n return ans\n\nn, t = [int(a) for a in input().split()]\na = list(map(int, input().strip().split()))\nb = list(map(int, input().strip().split()))\n\nprint(max_difference(n, t, a, b))\n\n \t\t\t \t\t\t \t \t \t\t \t \t \t\t", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\nintput = lambda : map(int, input().split())\r\n\r\nN, M = intput()\r\nA = [*intput()]\r\nB = [*intput()]\r\n\r\nans = tower = 0\r\nfor city in A:\r\n while tower+1 < M and B[tower] < city:\r\n tower += 1\r\n min_dist = abs(B[tower] - city)\r\n if tower > 0:\r\n dx = abs(B[tower-1] - city)\r\n min_dist = min(min_dist, dx)\r\n ans = max(ans, min_dist)\r\n\r\nprint(ans)", "def binaryUB(arr,target,m):\r\n low=-1\r\n high=m\r\n while(low+1<high):\r\n mid = (low)+(high-low)//2\r\n if(arr[mid]>=target):\r\n high=mid\r\n else:\r\n low=mid\r\n \r\n if(high+1>m):\r\n return -1\r\n return high\r\n\r\ndef binaryLB(arr,target,m):\r\n low=-1\r\n high=m\r\n ans=-1\r\n while(low+1<high):\r\n mid = (low)+(high-low)//2\r\n if(arr[mid]<=target):\r\n low=mid\r\n else:\r\n high=mid\r\n \r\n if(low==(-1)):\r\n return -1\r\n return low\r\n\r\nn,m=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\n\r\nans=0\r\nfor i in range(n):\r\n target = l1[i]\r\n k2 = binaryUB(l2,target,m)\r\n k1 = binaryLB(l2,target,m)\r\n \r\n thre= 0\r\n if(k1!=(-1) and k2!=(-1)):\r\n thre = min(abs(l1[i]-l2[k1]),abs(l1[i]-l2[k2]))\r\n \r\n elif(k1==(-1)):\r\n thre = abs(l1[i]-l2[k2])\r\n \r\n elif(k2==(-1)):\r\n thre = abs(l1[i]-l2[k1])\r\n \r\n \r\n ans=max(ans,thre)\r\n\r\nprint(ans)", "n, m = map(int, input().split())\n\na = [int(x) for x in input().split()]\n\nb = [int(x) for x in input().split()]\n\n\ndef cover_all(city, tower, R):\n n = len(city)\n m = len(tower)\n i, j = 0, 0\n while (i < n and j < m):\n if (abs(city[i] - tower[j]) > R):\n j += 1\n while (j < m and abs(city[i] - tower[j]) > R):\n j += 1\n if (j == m):\n return False\n i += 1\n return True\n\n\nl = -1\nr = abs(max(a[n - 1], b[m - 1])) + abs(min(a[0], b[0])) + 1\n\nwhile (r - l > 1):\n R = (l + r) // 2\n if (cover_all(a, b, R) is not True):\n l = R\n else:\n r = R\n\nprint(r)\n \t \t\t\t\t\t \t \t\t\t\t\t\t \t \t \t\t\t", "#https://codeforces.com/contest/702/problem/C\nclass solution:\n def solve(self,cities:list,towers:list)->int:\n left=0\n right=len(cities)-1\n r=0\n ans=0\n while(left <= right):\n while(r < len(towers) and cities[left] > towers[r]):\n r+=1\n left0 =2000000000\n right0=2000000000\n if r > 0:\n left0=cities[left]-towers[r-1]\n if r < len(towers):\n right0=towers[r]-cities[left]\n temp=min(left0,right0)\n ans=max(ans,temp)\n left+=1\n return ans\nobj=solution()\ncities_size,towers_size=[int(i) for i in input().split()]\ncities=[int(i) for i in input().split()]\ntowers=[int(i) for i in input().split()]\nprint(obj.solve(cities,towers))", "n, m = map(int, input().split())\r\ncities = [int(i) for i in input().split()]\r\ntowers = [int(x) for x in input().split()]\r\n\r\nmaxdist = 0\r\ntower_pointer = 0\r\n\r\nfor city_pointer in range(n):\r\n mindist = abs(cities[city_pointer] - towers[tower_pointer])\r\n while tower_pointer < m - 1 and abs(cities[city_pointer] - towers[tower_pointer + 1]) <= mindist:\r\n tower_pointer += 1\r\n mindist = abs(cities[city_pointer] - towers[tower_pointer])\r\n\r\n maxdist = max(maxdist, mindist)\r\n\r\nprint(maxdist)", "from bisect import bisect_left, bisect_right\r\n\r\ndef I(): return int(input())\r\ndef LI(): return list(map(int, input().split(' ')))\r\ndef MI(): return map(int, input().split())\r\ndef MS(): return map(str, input().split())\r\ndef strInp(): return input()\r\ndef strInpI(): return list(input())\r\n\r\nn, m = MI()\r\n\r\ncities = LI()\r\ntowers = LI()\r\n\r\nlength = n\r\nradiuses = [max(cities)] * n\r\nfor i in range(length):\r\n pos = bisect_left(towers, cities[i])\r\n radiuses[i] = min(abs(towers[(pos) % m] - cities[i]), abs(towers[(pos - 1) % m] - cities[i]))\r\n\r\nprint(max(radiuses))", "n,m = map(int,input().split())\r\ncities = list(map(int,input().split()))\r\ntowers = list(map(int,input().split()))\r\ncities.sort()\r\ntowers.sort()\r\nlo = 0\r\nhi = 2000000000\r\nans = -1\r\nmp ={}\r\ndef bs1(val):\r\n lo = 0\r\n hi = m-1\r\n ans = float('-inf')\r\n while lo <= hi:\r\n mid = (lo + hi)//2\r\n if towers[mid] <= val:\r\n ans = towers[mid]\r\n lo = mid + 1\r\n else:\r\n hi = mid - 1\r\n return ans\r\ndef bs2(val):\r\n lo = 0\r\n hi = m-1\r\n ans = float('inf')\r\n while lo <= hi:\r\n mid = (lo + hi)//2\r\n if towers[mid] >= val:\r\n ans = towers[mid]\r\n hi = mid - 1\r\n else:\r\n lo = mid + 1\r\n return ans\r\nfor city in cities:\r\n mp[city] = (bs1(city),bs2(city))\r\n\r\n\r\n \r\n\r\ndef check(r):\r\n for city in cities:\r\n pr = mp[city]\r\n if pr[0] + r >= city or pr[1] - r <= city:\r\n continue\r\n else:\r\n return False\r\n return True\r\nwhile lo <= hi:\r\n mid = (lo + hi)//2\r\n if check(mid):\r\n ans = mid\r\n hi = mid - 1\r\n else:\r\n lo = mid + 1\r\n\r\nprint(ans)", "# 2022-10-23 19:49:41.538580\r\n# https://codeforces.com/problemset/problem/702/C\r\nimport sys\r\n\r\n_DEBUG = False\r\n_DEBUG = True\r\nif not _DEBUG:\r\n input = sys.stdin.readline\r\n # print = sys.stdout.write\r\n\r\n\r\ndef proc(n, m, a, b):\r\n def feasible(r):\r\n bi = 0\r\n for e in a:\r\n while bi < m and b[bi] + r < e:\r\n bi += 1\r\n\r\n if bi == m:\r\n return False\r\n elif b[bi] - e > r:\r\n return False\r\n return True\r\n\r\n lo, hi = 0, 2 * 10 ** 9\r\n res = hi\r\n while lo <= hi:\r\n r = (lo + hi) // 2\r\n if feasible(r):\r\n res = r\r\n hi = r - 1\r\n else:\r\n lo = r + 1\r\n\r\n return res\r\n\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = proc(n, m, a, b)\r\nprint(ans)\r\n", "from bisect import bisect\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\nr = 0\r\nfor i in a:\r\n pos = bisect(b, i)\r\n dist = int(2e9)\r\n if pos < m:\r\n dist = min(b[pos] - i, dist)\r\n if pos:\r\n dist = min(i - b[pos - 1], dist)\r\n r = max(dist, r)\r\nprint(r)", "from bisect import bisect_right, bisect_left\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = -1e18\r\nfor i in a:\r\n dist = 1e18\r\n index = bisect_left(b, i)\r\n if index < m: \r\n dist = abs(i - b[index])\r\n index = bisect_right(b, i)\r\n if index: \r\n dist = min(dist, abs(i - b[index-1]))\r\n ans = max(dist, ans)\r\nprint(ans)\r\n", "inputs = [int(num) for num in input().split()]\r\nn = inputs[0]\r\nm = inputs[1]\r\nlist1 = [int(num) for num in input().split()]\r\nlist2 = [int(num) for num in input().split()]\r\nlow =0\r\nhigh = 10**18\r\nans=-1\r\nwhile(low<=high):\r\n mid = low+(high-low)//2\r\n i=0\r\n j=0\r\n while(i<n and j<m):\r\n if(abs(list1[i]-list2[j])<=mid):\r\n i+=1\r\n else:\r\n if(list2[j]<list1[i]):\r\n j+=1\r\n else:\r\n break\r\n if(i==n):\r\n ans=mid\r\n high = mid-1\r\n else:\r\n low=mid+1\r\nprint(ans)", "n, m = map(int, input().split())\r\ncities = sorted(list(map(int, input().split())))\r\ntowers = sorted(list(map(int, input().split())))\r\n\r\ndef pos(r):\r\n i, j = 0, 0\r\n cnt = 0\r\n while i < n:\r\n if j == m: break\r\n if cities[i] - r <= towers[j] <= cities[i] + r:\r\n i += 1\r\n cnt += 1\r\n else:\r\n j += 1\r\n return cnt >= n\r\n\r\n# print(pos(4))\r\nl, r = 0, 10**9*2\r\nwhile l < r:\r\n mid = (l+r)//2\r\n if pos(mid):\r\n r = mid\r\n else:\r\n l = mid+1\r\nprint(l)", "n, m = map(int, input().split())\ncities = list(map(int, input().split()))\ntowers = list(map(int, input().split()))\ni = 0\nans = 0\nfor city in cities:\n while i < m and towers[i] < city:\n i += 1\n cur = abs(towers[min(m-1,i)] - city)\n if i:\n cur = min(cur, abs(towers[i-1] - city))\n ans = max(ans, cur)\nprint(ans)\n \t \t\t \t\t\t\t \t \t \t\t\t \t", "from bisect import bisect\n\nn, m = map(int, input().split())\ncities = list(map(int, input().split()))\ntowers = list(map(int, input().split()))\n\n\nans = 0\nfor city in cities:\n index = bisect(towers, city)\n nearby = []\n if index != 0:\n nearby.append(abs(city - towers[index - 1]))\n if index != m:\n nearby.append(abs(city - towers[index]))\n ans = max(ans, min(nearby))\n\nprint(ans)\n\n \t \t \t \t\t\t \t \t \t\t\t\t", "n,m=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\ni=0\r\nj=0\r\nmaxdist=0\r\nfor i in range(n):\r\n while (j<m):\r\n if b[j] < a[i]:\r\n j+=1\r\n else:\r\n break\r\n d=2*(10**9)\r\n if (j<m):\r\n d=min(d,abs(b[j]-a[i]))\r\n if (j>0):\r\n d=min(d,abs(b[j-1]-a[i]))\r\n maxdist=max(d,maxdist)\r\nprint(maxdist)\r\n", "'''\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣤⣤⣤⣶⣤⣤⣀⣀⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣶⣄⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⢀⣾⣿⣿⣿⣿⣿⡿⠋⠉⠛⠛⠛⠿⣿⠿⠿⢿⣇⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⣾⣿⣿⣿⣿⣿⠟⠀⠀⠀⠀⠀⡀⢀⣽⣷⣆⡀⠙⣧⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢰⣿⣿⣿⣿⣿⣷⠶⠋⠀⠀⣠⣤⣤⣉⣉⣿⠙⣿⠀⢸⡆⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢸⣿⣿⣿⣿⣿⠁⠀⠀⠴⡟⣻⣿⣿⣿⣿⣿⣶⣿⣦⡀⣇⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢨⠟⡿⠻⣿⠃⠀⠀⠀⠻⢿⣿⣿⣿⣿⣿⠏⢹⣿⣿⣿⢿⡇⠀⠀\r\n⠀⠀⠀⠀⠀⠀⣿⣼⣷⡶⣿⣄⠀⠀⠀⠀⠀⢉⣿⣿⣿⡿⠀⠸⣿⣿⡿⣷⠃⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢻⡿⣦⢀⣿⣿⣄⡀⣀⣰⠾⠛⣻⣿⣿⣟⣲⡀⢸⡿⡟⠹⡆⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⢰⠞⣾⣿⡛⣿⣿⣿⣿⣰⣾⣿⣿⣿⣿⣿⣿⣿⣿⡇⢰⡇⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠘⠀⣿⡽⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⢿⠿⣍⣿⣧⡏⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣷⣿⣿⣿⣿⣿⣿⣿⣿⣷⣮⣽⣿⣷⣙⣿⡟⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡟⣹⡿⠇⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠛⢿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡧⣦⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⢠⡆⠀⠀⠀⠀⠀⠀⠀⠉⠻⣿⣿⣾⣿⣿⣿⣿⣿⣿⡶⠏⠀⠀⠀⠀\r\n⣀⣠⣤⡴⠞⠛⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠚⣿⣿⣿⠿⣿⣿⠿⠟⠁⠀⠀⠀⠀⠀\r\n⠉⠀⢀⡴⠂⠀⠀⠀⠀⠀⠀⠀⠀⢠⠀⠀⢀⣿⣿⠁⠀⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⣠⣴⡿⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⣾⠀⠀⣾⣿⠋⠀⢠⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⣿⣿⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣆⣼⣿⠁⢠⠃⠈⠓⠦⣄⡀⠀⠀⠀⠀⠀⠀\r\n⠻⠿⢷⣦⣤⣤⣤⣦⣄⣀⣀⠀⢀⣿⣿⠻⣿⣰⠻⠀⠸⣧⡀⠀⠉⠳⣄⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠈⠉⠉⠙⠛⠿⣦⣼⡏⢻⣿⣿⠇⠀⠁⠀⠻⣿⠙⣶⣄⠈⠳⣄⡀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠁⣐⠀⠀⠀⠈⠳⡘⣿⡟⣀⡠⠿⠶⠒⠟⠓⠀⠹⡄⢴⣬⣍⡁\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠙⢀⣀⠐⠲⠤⠁⢘⣠⣿⣷⣦⠀⠀⠀⠀⠀⠀⠙⢿⣿⣏⠁\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠀⠀⠀⠀⠈⣿⣿⣷⣯⠀⠀⠀⠀⠀⠀⠀⠀⠉⠻⠆\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⢦⠀⢹⣿⣏\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠁⣸⣿⣿⡀\r\n⠀⠀⠀⠐⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢻⣿⣿⣷⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⡟⢬⣿⣷⣤⣀⣄⣀⡀⠀⠀⠀⠀⠀⠀⠈⣿⣿⡄⣉⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n'''\r\ncit,tor=map(int,input().split())\r\ncits = sorted(list(map(int,input().split())))\r\ntors = sorted(list(map(int,input().split())))\r\nl,r=0,int(3e9)\r\nposs = float('inf')\r\ndef valid(mid,cits,tors,tor,cit):\r\n i,j=0,0\r\n while i<cit:\r\n if j==tor:\r\n return 0\r\n if abs(tors[j]-cits[i])<=mid:\r\n i+=1\r\n else:\r\n j+=1\r\n else:\r\n return 1\r\nwhile l<=r:\r\n mid = (l+r)//2\r\n if valid(mid,cits,tors,tor,cit):\r\n poss = min(poss,mid)\r\n r = mid-1\r\n else:\r\n l = mid+1\r\nprint(poss)", "N, M = map(int, input().split())\ncities = list(map(int, input().split()))\ntowers = list(map(int, input().split()))\nret = 0\nx = 0\nfor city in cities:\n while x+1 < M and abs(city - towers[x]) >= abs(city - towers[x+1]):\n x += 1\n ret = max(ret, abs(city - towers[x]))\nprint(ret)\n", "n, m = map(int, input().split())\nc = sorted(list(set(map(int, input().split()))))\nt = sorted(list(set(map(int, input().split()))))\n\nmax_distance = 0\ncity = 0\ntower = 0\nwhile city < len(c):\n\tmin_distance = abs(c[city] - t[tower])\n\twhile tower + 1 < len(t):\n\t\ttower += 1\n\t\tnew_dist = abs(c[city] - t[tower])\n\t\tif new_dist < min_distance:\n\t\t\tmin_distance = new_dist\n\t\telse:\n\t\t\ttower -= 1\n\t\t\tbreak\n\tmax_distance = max(min_distance, max_distance)\n\tcity += 1\n\nprint(max_distance)\n \t\t\t\t \t\t \t\t\t\t\t \t \t \t\t \t \t", "# Write your code here :-)\n# Cellular Network\nn, m = map(int, input().split())\na = [int(i) for i in input().split()] # city\nb = [int(i) for i in input().split()] # tower\ndist = [2000000000] * n\ni = j = 0\nwhile i < n and j < m:\n if b[j] < a[i]:\n j += 1\n else:\n dist[i] = min(b[j] - a[i], dist[i])\n i += 1\ni, j = n - 1, m - 1\nwhile i >= 0 and j >= 0:\n if b[j] > a[i]:\n j -= 1\n else:\n dist[i] = min(a[i] - b[j], dist[i])\n i -= 1\nprint(max(dist))\n", "import sys\r\ninput = sys.stdin.readline\r\n# flush = sys.stdout.flush()\r\n\r\n# from math import gcd, isqrt, ceil, log2\r\n# from collections import defaultdict, deque, Counter\r\nimport bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound\r\n\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n \r\n ans = 0\r\n for i in a:\r\n nearest = bisect.bisect_right(b, i)\r\n\r\n if nearest == m:\r\n dist = (i - b[-1])\r\n \r\n else:\r\n dist = b[nearest] - i\r\n \r\n if nearest == 0:\r\n dist1 = b[0] - i\r\n \r\n else:\r\n dist1 = i - b[nearest - 1]\r\n \r\n ans = max(ans, min(dist, dist1))\r\n \r\n print(ans)", "import sys\r\nfrom bisect import bisect_left\r\n\r\nn, m = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nans=-sys.maxsize\r\nfor i in range(n):\r\n ti=bisect_left(t,c[i])\r\n mn=sys.maxsize\r\n if ti>0 and ti !=m:\r\n mn=min(mn,t[ti]-c[i])\r\n mn=min(mn,c[i]-t[ti-1])\r\n elif ti==0:\r\n mn=min(mn,t[ti]-c[i])\r\n elif ti==m:\r\n mn=min(mn,c[i]-t[ti-1])\r\n ans=max(ans,mn)\r\n \r\n\r\nprint(ans)\r\n \r\n", "import sys\nfrom bisect import bisect_left\n\ndef makermama():\n n, m = map(int, input().split())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n ans = -sys.maxsize\n for i in range(n):\n idx = bisect_left(b, a[i])\n mn = sys.maxsize\n if idx > 0 and idx != m:\n mn = min(mn, abs(a[i] - b[idx]))\n mn = min(mn, abs(a[i] - b[idx - 1]))\n elif idx == 0:\n mn = min(mn, abs(a[i] - b[idx]))\n elif idx == m:\n mn = min(mn, abs(a[i] - b[idx - 1]))\n ans = max(ans, mn)\n print(ans)\n\nmakermama()\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\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\ni=0\r\nj=0\r\nans=0\r\n\r\nwhile(i<len(l1)):\r\n \r\n while(j+1<len(l2) and l2[j+1]<=l1[i]):\r\n j+=1\r\n \r\n req = abs(l1[i]-l2[j])\r\n \r\n if(j+1<len(l2)):\r\n req = min(req,abs(l1[i]-l2[j+1]))\r\n \r\n ans=max(ans,req)\r\n i+=1\r\n \r\nprint(ans)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nx = 0\r\ny = 0\r\nfor i in a:\r\n while b[y] < i and y+1 < len(b):\r\n y += 1\r\n x = max(x,min(abs(b[y]-i),abs(b[y-1]-i)))\r\nprint(x)\r\n\r\n'''\r\nn, m = map(int, input().split())\r\nb = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nr = 0\r\ni = 0\r\nfor v in b:\r\n while a[i] < v and i + 1 < len(a):\r\n i += 1\r\n r = max(r, min(abs(a[i] - v), abs(a[i-1] - v)))\r\nprint(r)\r\n'''\r\n", "n, m = map(int, input().split())\r\nN = list(map(int, input().split()))\r\nM = list(map(int, input().split()))\r\n\r\n\r\ni = 0\r\nj = 0\r\nans = [float('inf')]*n\r\n\r\nwhile i < n:\r\n for k in range(j, m):\r\n if abs(M[k]-N[i]) <= ans[i]:\r\n j = k\r\n ans[i] = abs(M[j]-N[i])\r\n # print(N[i], M[j])\r\n else:\r\n break\r\n # print(N[i], M[j])\r\n \r\n i += 1\r\n\r\nprint(max(ans))", "n,m=map(int,input().split())\nc=list(map(int,input().split()))\nt=list(map(int,input().split()))\nr =0\nj=0\nfor ct in c:\n while j+1 < m and abs(ct - t[j]) >= abs(ct - t[j+1]):\n j+=1\n r = max(r, abs(ct - t[j]))\nprint(r)\n\t\t\t\t\t\t\t\t\t \t\t\t\t \t \t\t \t\t\t\t \t", "import bisect\ninput()\ncities = list(map(int, input().split()))\ntowers = list(map(int, input().split()))\n\nprint(max([min([abs(x-c) for x in towers[bisect.bisect(towers, c) - 1 * (bisect.bisect(towers, c) != 0):bisect.bisect(towers, c) + 2] ], default = 0) for c in cities]))\n \t\t \t \t \t \t\t\t \t\t\t \t \t\t \t\t \t", "# Write your code here :-)\n# Cellular Network - Sorted Set Solution\nfrom bisect import bisect\n\nn, m = map(int, input().split())\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\nr = 0\nfor i in a:\n pos = bisect(b, i)\n dist = int(2e9)\n if pos < m:\n dist = min(b[pos] - i, dist)\n if pos:\n dist = min(i - b[pos - 1], dist)\n r = max(dist, r)\nprint(r)\n", "n, m = [int(a) for a in input().split()]\r\ncities = [int(a) for a in input().split()]\r\ntowers = [int(a) for a in input().split()]\r\n\r\ncities.sort()\r\ntowers.sort()\r\n\r\npointer = 0\r\ndistance = 0\r\n\r\nfor city in cities:\r\n stop = 0\r\n while stop == 0:\r\n if pointer >= m:\r\n stop = 1\r\n break\r\n if towers[pointer] >= city:\r\n stop = 1\r\n break\r\n else:\r\n pointer += 1\r\n if pointer == m:\r\n distance = max(distance, abs(city - towers[pointer-1]))\r\n elif pointer == 0:\r\n distance = max(distance, abs(city - towers[pointer]))\r\n else:\r\n distance = max(distance, min(abs(city-towers[pointer]), abs(city-towers[pointer-1])))\r\n pointer = max(pointer - 1, 0) \r\n\r\nprint(distance)\r\n", "def solve(a,b):\r\n return max(a,b)-min(a,b)\r\n\r\ndef wifi(lst):\r\n v1=[0]+(sorted(lst[0]))\r\n v2=[0]+(sorted(lst[1]))\r\n tmp=0\r\n ans=0\r\n inf=10**18\r\n v2[0]=-inf\r\n v2.append(inf)\r\n for i in range(1, len(v1)):\r\n while v2[tmp+1]<=v1[i]:\r\n tmp+=1\r\n a=min(solve(v1[i],v2[tmp]), solve(v1[i],v2[tmp+1]))\r\n ans=max(ans,a)\r\n return ans\r\n\r\nn=input()\r\nv1=list(map(int,input().split()))\r\nv2=list(map(int,input().split()))\r\nprint(wifi([v1,v2]))\r\n" ]

[ "n = int(input())\nedges = [[int(x) for x in input().split()] for i in range(n-1)]\nedges = sorted(edges)\nuse_count = [0]+[int(input()) for i in range(n)]\nlo,hi = 0,10000\ndef getpar(par,u):\n if par[par[u]] == par[u]:\n return par[u]\n par[u] = getpar(par,par[u])\n return par[u]\ndef unite(par,sz,use,u,v):\n u = getpar(par,u)\n v = getpar(par,v)\n par[u] = v\n sz[v] += sz[u]\n use[v] += use[u]\ndef solve(fp):\n par = [i for i in range(n+1)]\n sz = [1 for i in range(n+1)]\n use = [use_count[i] for i in range(n+1)]\n for edge in edges:\n if edge[2] < fp:\n unite(par,sz,use,edge[0],edge[1])\n total_use = sum(use_count)\n for i in range(n+1):\n p = getpar(par,i)\n if(p == i):\n if(total_use - use[p] < sz[p]):\n return False\n return True\nwhile lo < hi:\n mid = (lo+hi+1)//2\n if solve(mid):\n lo = mid\n else:\n hi = mid-1\nprint(lo)\n" ]

[ "str = list(input())\r\n\r\nn = len(str)\r\n\r\nhello = \"hello\"\r\ncounter = 0\r\n\r\nfor i in range(0,n):\r\n if(counter < 5 and str[i] == hello[counter]):\r\n counter += 1\r\n\r\nif(counter >= 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=list(input())\r\nn='NO'\r\nfor i in range(len(s)):\r\n if s[i]=='h' :\r\n for i_1 in range(i,len(s)):\r\n if s[i_1]=='e' :\r\n for i_2 in range(i_1,len(s)):\r\n if s[i_2]=='l' :\r\n for i_3 in range(i_2+1,len(s)):\r\n if s[i_3]=='l' :\r\n for i_4 in range(i_3,len(s)):\r\n if s[i_4]=='o' :\r\n n='YES'\r\n break\r\n continue\r\n continue\r\n continue\r\nprint(n)", "import re\nk=input()\nhelloRegex=re.compile(r'(h)+((\\w)?)+(e)+((\\w)?)+(l)+((\\w)?)+(l)+((\\w)?)+(o)+')\nif helloRegex.search(k)== None :\n print('NO')\nelse :\n print('YES')\n", "s=input()\r\nk=0\r\nfor i in range(len(s)):\r\n\tif s[i]=='h' and k==0:\r\n\t\tk+=1\r\n\telif s[i]=='e' and k==1:\r\n\t\tk+=1\r\n\telif s[i]=='l' and k==2:\r\n\t\tk+=1\r\n\telif s[i]=='l' and k==3:\r\n\t\tk+=1\r\n\telif s[i]=='o' and k==4:\r\n\t\tk+=1\r\nif k==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "word = input()\r\nletters = 'hello'\r\nnew_word = ''\r\ni = 0\r\nfor ch in word:\r\n if ch == letters[i]:\r\n new_word += ch\r\n if i <= 3:\r\n i += 1\r\n else:\r\n break\r\nif new_word == letters:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nword = \"hello\"\r\nans = 0\r\ni = 0\r\nfor char in s:\r\n if char == word[i]:\r\n i += 1\r\n if i == len(word):\r\n ans = 1\r\n break\r\nif ans == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k=input().lower()\r\na='hello';j=0\r\nfor i in range(len(k)):\r\n if k[i]==a[j]:\r\n j+=1\r\n if j==5:\r\n break\r\n\r\nprint(['NO','YES'][j>4])\r\n", "h = 'hello'\r\ns = input()\r\ni = 0\r\nfor c in s:\r\n if c == h[i]:\r\n i += 1\r\n if i == len(h):\r\n break\r\nprint('YES' if i == len(h) else 'NO')\r\n ", "s=input()\r\nf=False\r\nfor i in range(len(s)):\r\n if s[i]=='h':\r\n for l in range(i+1,len(s)):\r\n if s[l]=='e':\r\n for k in range(l+1,len(s)):\r\n if s[k]=='l':\r\n for j in range(k+1,len(s)):\r\n if s[j]=='l':\r\n for p in range(j+1,len(s)):\r\n if s[p]=='o':\r\n f=True\r\n break\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "def stringcheck(s):\r\n word=\"hello\"\r\n req=\"h\"\r\n c=0\r\n for ch in s:\r\n if c==5:\r\n break\r\n if ch==req:\r\n c+=1\r\n if c<5:\r\n req=word[c]\r\n \r\n if c==5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\ns=input()\r\nstringcheck(s)", "w=input()\r\na=\"hello\"\r\ns=\"\"\r\nc=0\r\nfor i in w:\r\n if i == a[c]:\r\n c+=1\r\n s+=i\r\n if c==5:\r\n break\r\nif s==a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=str(input())\r\ns=\"hello\"\r\nj=0\r\nc=0\r\nfor i in range(0,len(a)):\r\n if a[i]==s[j]:\r\n i+=1\r\n j+=1\r\n c+=1\r\n if c==5: \r\n break\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "message = str(input())\n\ndesired_message = [\"h\", \"e\", \"l\", \"l\", \"o\"]\n\n\npointer = 0\n\ncreated_word = []\n\nfor char in desired_message:\n while pointer < len(message):\n if char == message[pointer]:\n created_word.append(char)\n pointer += 1\n break\n else:\n pointer += 1\n\n\nif created_word == desired_message:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "S = input()\r\nstr =''\r\nfor i in S:\r\n #print(i)\r\n if str == '':\r\n if i == 'h':\r\n str += i\r\n #print(str)\r\n continue\r\n else:\r\n continue\r\n elif str == 'h':\r\n if i == 'e':\r\n str += i\r\n #print(str)\r\n continue\r\n else:\r\n continue\r\n elif str == 'he':\r\n if i == 'l':\r\n str += i\r\n #print(str)\r\n continue\r\n else:\r\n continue\r\n elif str == 'hel':\r\n if i == 'l':\r\n str += i\r\n #print(str)\r\n continue\r\n else:\r\n continue\r\n elif str == 'hell':\r\n if i == 'o':\r\n str += i\r\n #print(str)\r\n continue\r\n else:\r\n continue\r\n#print(str)\r\nif str == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\ns = input()\r\nl = ['o','l','l','e','h']\r\nfor i in s:\r\n if i == l[-1]:\r\n l.pop()\r\n if len(l) == 0:\r\n break\r\nif len(l) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\ninput = sys.stdin.readline\r\n \r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))#might need to remove the -1\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\ns = insr()\r\nj = 0\r\nc = False\r\nto = 'h'\r\ncs = ['h', 'e', 'l', 'l', 'o']\r\nfor i in s:\r\n if i == to:\r\n j += 1\r\n if j == 5:\r\n c = True\r\n break\r\n to = cs[j]\r\nif c:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\n\r\nla = list('hello')\r\n\r\ncp = -1\r\nr = True\r\nfor l in la:\r\n i = s.find(l, cp+1)\r\n if i == -1:\r\n r = False\r\n break\r\n cp = i\r\n \r\n \r\nprint('YES' if r else 'NO')", "string = input()\r\nfounds = []\r\np = 0\r\nhello = 'hello'\r\n\r\nfor i in range(5):\r\n for j in range(p, len(string)):\r\n if hello[i] == string[j]:\r\n p = j + 1\r\n founds.append(hello[i])\r\n break\r\n\r\nif ''.join(founds) == 'hello':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "p=input()\r\n#\r\nr=[]\r\nfor k in range (0,len(p),1):\r\n r.append(p[k])\r\n#r.pop(0,3)\r\n#del r[0:3]\r\n#ss=[]\r\nl=0;\r\nfor i in range (0,len(p),1):\r\n k=0;\r\n if((r[k]==\"h\")&(l==0)):\r\n #ss.append(\"h\")\r\n l=1;\r\n elif((r[k]==\"e\")&(l==1)):\r\n #ss.append(\"e\")\r\n l=2;\r\n elif((r[k]==\"l\")&(l==2)):\r\n #ss.append(\"l\")\r\n l=3;\r\n elif((r[k]==\"l\")&(l==3)):\r\n #ss.append(\"l\")\r\n l=4;\r\n elif((r[k]==\"o\")&(l==4)):\r\n #ss.append(\"o\")\r\n l=5;\r\n \r\n r.pop(0)\r\n \r\nif(l==5):\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "import sys\na = input()\ncx = 'hello'\nfor i in range(len(a)):\n if a[i] == cx[0]:\n while i<len(a) and a[i] == cx[0]:\n i+=1\n cx = cx[1:]\n if len(cx) == 0:\n print(\"YES\")\n sys.exit()\nprint(\"NO\")\n", "s=input()\nx=list(s)\ny=[\"h\",\"e\",\"l\",\"l\",\"o\"]\nfor i in range(len(x)):\n if x[i]==y[0]:\n y.pop(0)\n if len(y)==0:\n break\n \nif len(y)==0:\n print(\"YES\")\nelse:\n print(\"NO\")", "w = input()\r\nh=w.find('h')\r\ne=w.find('e',h+1)\r\nl=w.find('l',e+1)\r\nl2=w.find('l',l+1)\r\no=w.find('o',l2+1)\r\n\r\nif (h<e<l<l2<o) == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\n\r\n# Initialize pointers for both strings\r\ni = 0 # Pointer for \"hello\"\r\nfor char in a:\r\n if char == 'h' and i == 0:\r\n i += 1\r\n elif char == 'e' and i == 1:\r\n i += 1\r\n elif char == 'l' and i == 2:\r\n i += 1\r\n elif char == 'l' and i == 3:\r\n i += 1\r\n elif char == 'o' and i == 4:\r\n i += 1\r\n\r\n# Check if all characters in \"hello\" have been found in order\r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\n\r\na = \"hello\"\r\npos = 0\r\nfor i in s:\r\n if i == a[pos]:\r\n pos += 1\r\n if pos == 5:\r\n break\r\nif pos == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nstack=[]\r\nl=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nlcount=2\r\nc=0\r\nfor i in s:\r\n if i==l[c]:\r\n if i==\"l\":\r\n if lcount>0:\r\n stack.append(i)\r\n lcount-=1\r\n if lcount==0:\r\n c+=2\r\n \r\n \r\n\r\n elif (i not in stack):\r\n stack.append(i)\r\n if c<=3:\r\n c+=1\r\n \r\n \r\nif stack==l:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def find(needle, haystack):\r\n if not needle: return True\r\n \r\n if needle[0] not in haystack:\r\n return False\r\n \r\n return find(needle[1:], haystack[haystack.find(needle[0])+1:])\r\n\r\nif find(\"hello\", input()):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "li = ['h','e','l','l','o']\r\n\r\nstr = input()\r\ni=0\r\nfor j in range(0,len(str)):\r\n if(str[j] == li[i]):\r\n i=i+1\r\n if(i==len(li)):\r\n break;\r\n\r\nif(i>=5):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n ", "s=input()\r\nlist1=['h','e','l','l','o','#']\r\nc=0\r\nx=list1[c]\r\nres=''\r\nfor i in s:\r\n if i==x:\r\n res+=i\r\n c+=1\r\n x=list1[c]\r\n if res=='hello':\r\n break\r\nif res=='hello':\r\n print('YES') \r\nelse:\r\n print('NO')", "'''\nChat room - Codeforces\nhttps://codeforces.com/problemset/problem/58/A\n\nProblem Details:\n word_base = \"hello\"\n\n example:\n input: hlelo\n la primera letra de input es h?\n si\n la siguiente letra es e?\n si\n no\n la siguienta letra es h?\n si\n busca e\n\n# rules:\n - if count size of input string is less than 5 print NO\n - if we found the \"hello\" stop traversing the input and print YES\n - if curr_char_input is equal to char_to_find\n - yes, update char_to_find to next_char_from_word_base, check next_char_input\n - no\n - check curr_char_input is repeated, or first char (same as last one)\n - check next_char_input<<<----\n\ntest:\ninput = 'hlelo'\n ^\ncurr_char_input = o\nchar_to_find = l <---- no more chars to find, return YES, break\nj = 3\n'''\ndef word_typed (string):\n word_base = 'hello'\n j = 0\n n = len(string)\n char_to_find = word_base[j]\n for i in range(n):\n curr_char_input = string[i]\n if curr_char_input == char_to_find:\n j += 1\n if j == 5:\n return 'YES'\n char_to_find = word_base[j]\n return 'NO'\n\ns = input()\nprint(word_typed(s))\n\n", "import re\r\ns = input()\r\nprint ( \"YES\" if re.search(\"h.*e.*l.*l.*o\",s) else \"NO\" )", "a = str(input())\r\nhelo = ['h','e','l','l','o']\r\ni = -1\r\n\r\nfor c in helo:\r\n i = a.find(c, i+1)\r\n if i == -1:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')", "s = input()\r\na = \"hello\"\r\nyes = True\r\nfor i in a:\r\n # print(\"i == \", i, end = \" \")\r\n if(i in s):\r\n k = s.index(i)\r\n s = s[k+1: : ]\r\n else:\r\n yes = False\r\n break\r\n # print(s)\r\nif(yes):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def f(s, slovo):\r\n if slovo == \"\":\r\n return True\r\n elif s == \"\":\r\n return False\r\n b = False\r\n for i in range(len(s)):\r\n if s[i] == slovo[0]:\r\n b += f(s[i+1:], slovo[1:])\r\n return b\r\n\r\n\r\ns = input()\r\nif f(s, \"hello\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "sample=list(\"hello\")\r\ncounter=0\r\nword=input()\r\nfor i in range(len(word)):\r\n if word[i]==sample[counter]:\r\n counter+=1\r\n if counter==5:\r\n print (\"YES\")\r\n break\r\nif counter<5:\r\n print (\"NO\")", "def t(st):\r\n hello= \"hello\"\r\n i=0\r\n for j in range(0,len(st)):\r\n if i==5:\r\n return \"YES\"\r\n if st[j]==hello[i]:\r\n i +=1\r\n if i <5:\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\nad= input()\r\nprint(t(ad))", "patern=\"hello\"\r\ndef calc(str):\r\n arr=[-1]\r\n for i in str :\r\n arr.append(-1)\r\n for i in range(1,len(str)+1):\r\n for j in range(0,i):\r\n if arr[j]==-1:\r\n if str[i-1]==patern[0]:\r\n arr[i]=max(0,arr[i])\r\n else :\r\n arr[i]=max(-1,arr[i])\r\n elif arr[j]==len(patern)-1:\r\n break\r\n elif str[i-1]==patern[int(arr[j])+1]:\r\n arr[i]=max(arr[i],int(arr[j])+1)\r\n if len(patern)-1 in arr:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\ncalc(input())\r\n", "str=input()\r\nh=False\r\ne=False\r\nl1=False\r\nl2=False\r\no=False\r\nfor i in range(len(str)):\r\n if str[i]=='h' :\r\n h=True\r\n elif str[i]=='e' and h==True:\r\n e=True\r\n elif str[i]=='l' and e==True and l1!=True:\r\n l1=True\r\n elif str[i]=='l' and l1==True:\r\n l2=True\r\n elif str[i]=='o' and l2==True:\r\n o=True\r\nif o==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# 58A => Chat room\r\n# https://codeforces.com/problemset/problem/58/A\r\n\r\nfrom re import match\r\n\r\ns = input()\r\nif match(r\".*h.*e.*l.*l.*o.*\", s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = str(input())\r\nb =0\r\nword=\"hello\"\r\nfor i in range(len(a)):\r\n if(a[i]==word[b]):\r\n b+=1\r\n if(b==5):\r\n break\r\nif(b==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\r\ns=str(input())\r\nif re.search(\"h.*e.*l.*l.*o\", s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ncharlist=\"hello\"\r\nx=1\r\nwhile x==1:\r\n\ta=s.find(charlist[0])\r\n\tif a==-1:\r\n\t\tx=0\r\n\telse:\r\n\t\tcharlist=charlist[1:]\r\n\t\ts=s[a+1:]\r\n\tif charlist==\"\":\r\n\t\tbreak\r\nif x==1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\r\n\r\ndef is_hello(s):\r\n hello = \"hello\"\r\n i = 0\r\n for char in s:\r\n if i < 5 and char == hello[i]:\r\n i += 1\r\n return i == 5\r\n\r\nresult = \"YES\" if is_hello(s) else \"NO\"\r\nprint(result)\r\n", "s = input(\"\")\r\nfor l in 'hello':\r\n #print('letra=',l,'s=',s)\r\n achou = 0\r\n while len(s)>0:\r\n if l==s[0]:\r\n achou=1\r\n s = s[1:]\r\n break;\r\n else:\r\n s=s[1:]\r\n #print(s,'l=',l,'s[i]=','achou=',achou)\r\n if achou==0:\r\n print('NO')\r\n exit(0)\r\nprint('YES')", "import re\r\nprint(['NO', 'YES'][re.search('.*h.*e.*l.*l.*o.*', input()) is not None])", "s = input()\r\n\r\nln = len(s)\r\nh=e=l=l2=o=0\r\n\r\nfor i in range(ln):\r\n if h==0 and s[i] == 'h':\r\n h = i+1\r\n\r\n if h>0 and e==0 and s[i] == 'e':\r\n e = i+1\r\n\r\n if e>0 and l==0 and s[i] == 'l':\r\n l = i+1\r\n\r\n if l>0 and l2==0 and i>=l and s[i]=='l':\r\n l2 = i+1\r\n\r\n if l2>0 and o==0 and s[i]=='o':\r\n o = i+1\r\n break\r\n\r\nif h<e<l<l2<o:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nb=True\r\na=s.find('h')\r\nif a==-1:\r\n b=False\r\nelse:\r\n s=s[a+1:]\r\na=s.find('e')\r\nif a==-1:\r\n b=False\r\nelse:\r\n s=s[a+1:]\r\na=s.find('l')\r\nif a==-1:\r\n b=False\r\nelse:\r\n s=s[a+1:]\r\na=s.find('l')\r\nif a==-1:\r\n b=False\r\nelse:\r\n s=s[a+1:]\r\na=s.find('o')\r\nif a==-1:\r\n b=False\r\nelse:\r\n s=s[a+1:]\r\nprint('YES' if b else 'NO')\r\n\r\n", "n = input()\n\nhello = (\"hello\")\ncount = 0 \n\n\nfor i in range(len(n)):\n if n[i]== hello[count]:\n count+= 1\n if count == 5:\n break \n\n\n\nif count == 5:\n print('YES')\nelse:\n print('NO')\n \n", "s = input()\r\n\r\ncheck = \"\"\r\n\r\nfor i in range(len(s)):\r\n\tchar = s[i]\r\n\tif char == 'h' and len(check)==0:\r\n\t\tcheck+=char\r\n\t\tcontinue\r\n\tif char == 'e' and len(check)==1:\r\n\t\tcheck+=char\r\n\t\tcontinue\r\n\tif char == 'l' and len(check)==2:\r\n\t\tcheck+=char\r\n\t\tcontinue\r\n\tif char == 'l' and len(check)==3:\r\n\t\tcheck+=char\r\n\t\tcontinue\r\n\tif char == 'o' and len(check)==4:\r\n\t\tcheck+=char\r\n\t\tcontinue\r\n\telse :\r\n\t\tcontinue\r\n\r\nif check==\"hello\" :\r\n\tprint('YES')\r\nelse :\r\n\tprint('NO')\r\n", "def sayHello(word):\r\n hello = \"hello\"\r\n count = 0\r\n j = 0\r\n for i in word:\r\n if i == hello[j]:\r\n count += 1\r\n if count == len(\"hello\"):\r\n return \"YES\"\r\n j += 1\r\n\r\n return \"NO\"\r\n\r\nword = input()\r\nprint(sayHello(word))", "from re import match\r\nprint(\"YES\" if match(r\"[^\\s]*h[^\\s]*e[^\\s]*l[^\\s]*l[^\\s]*o[^\\s]*\",input()) else \"NO\")", "\r\ns = input()\r\nq = \"hello\"\r\np = 0\r\n\r\nfor i in range(len(s)):\r\n if (s[i] == q[p]):\r\n p += 1\r\n if p == 5:\r\n print(\"YES\")\r\n break \r\nif p < 5:\r\n print(\"NO\")\r\n\r\n\r\n", "s = input()\r\nh = \"hello\"\r\nit = 0\r\nfor ch in s:\r\n if it == len(h):\r\n break\r\n if ch == h[it]:\r\n it += 1\r\nif it == len(h):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=list(input())\r\np=list(\"hello\")\r\nj=0\r\nfor i in s:\r\n\tif i==p[j]:\r\n\t\tj+=1\r\n\tif j==5:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\nprint(\"NO\")\t\t\t", "s = input()\r\n\r\n# Initialize pointers for \"hello\" and the input string\r\nhello_ptr = 0\r\n\r\n# Iterate through the input string\r\nfor char in s:\r\n if char == \"hello\"[hello_ptr]:\r\n hello_ptr += 1\r\n if hello_ptr == 5: # If we have matched all characters in \"hello\"\r\n print(\"YES\")\r\n break\r\n\r\n# If hello_ptr is still less than 5, we didn't match all characters\r\nelse:\r\n print(\"NO\")\r\n", "word=list(input())\r\nhello=list(\"hello\")\r\nidx=0\r\nlast_char=\"\"\r\nfor i in range(len(word)):\r\n \r\n \r\n if (word[i]==hello[idx]):\r\n idx+=1\r\n if (idx==5):\r\n break;\r\n \r\nif(idx==5):\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")", "input_str = input()\nhello = \"hello\"\ncounter = 0\nprinted = 0\nfor char in input_str:\n if counter > 4:\n print(\"YES\")\n printed = 1\n break\n if char == hello[counter]:\n counter += 1\nif not printed and counter > 4:\n print(\"YES\")\nelse:\n if not printed:\n print(\"NO\")", "s = input()\nword = 'hello'\niCounter = 0\nhCounter = 0\n\nfor iCounter in range(len(s)):\n if hCounter > 4:\n break\n else:\n if s[iCounter] == word[hCounter]:\n hCounter +=1\n\nif hCounter == 5:\n print('YES')\nelse:\n print('NO')", "a='hello'\r\nb=input()\r\ni=0\r\nfor j in range(len(b)):\r\n if(b[j]==a[i]):\r\n i+=1\r\n if(i==len(a)):\r\n break\r\nif(i==len(a)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def chat_room():\r\n\ts = input()\r\n\tres = \"hello\"\r\n\tj = 0\r\n\tcount = 0\r\n\tfor i in range(len(s)):\r\n\t\ttry:\r\n\t\t\tif s[i] == res[j]:\r\n\t\t\t\tj+=1\r\n\t\t\t\tcount += 1\r\n\t\t\t\tif count == 5:\r\n\t\t\t\t\treturn \"YES\"\r\n\t\texcept:\r\n\t\t\tpass\r\n\t\t\r\n\treturn \"NO\"\r\n\t\t\t\r\n\t\t\t\r\nprint(chat_room())\r\n\t\t\r\n\t\t\r\n", "s = input()\r\ntar = 'hello'\r\nidx=0\r\nfor item in s:\r\n if idx==len(tar):\r\n break\r\n if item==tar[idx]:\r\n idx+=1\r\nprint('YES' if idx==len(tar) else 'NO')\r\n", "s=input()\r\nz=['o','l','l','e','h']\r\nfor i in s:\r\n if i==z[-1]:\r\n z.pop()\r\n if len(z)==0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "\r\nstr1 = \"hello\"\r\nstr2 = input()\r\nm = len(str1) \r\nn = len(str2) \r\nj = 0 \r\ni = 0 \r\n \r\nwhile j<m and i<n: \r\n if str1[j] == str2[i]: \r\n j = j+1 \r\n i = i + 1\r\n\r\nif (j==m):\r\n print(\"YES\\n\")\r\nelse:\r\n print(\"NO\\n\") \r\n \r\n", "st = list(input())\r\nk = \"hello\"\r\nj = 0\r\nfor i in st:\r\n if k[j] == i:\r\n j = j+1\r\n if j==5:\r\n break;\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nl=list('hello')\r\nidx=0\r\nfor i in range(len(s)):\r\n if idx==5:\r\n break\r\n if s[i]==l[idx]:\r\n idx+=1\r\nif idx==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\ne = input()\r\np=0\r\n\r\nwhile p < len(e) and e[p] != \"h\":\r\n p =p + 1\r\n\r\np=p+1\r\nwhile p < len(e) and e[p]!=\"e\":\r\n p=p+1\r\n\r\np=p+1\r\nwhile p < len(e) and e[p]!=\"l\":\r\n p=p+1\r\np=p+1\r\nwhile p < len(e) and e[p]!=\"l\":\r\n p=p+1\r\n\r\np=p+1\r\nwhile p <len(e) and e[p]!=\"o\":\r\n p=p+1\r\n\r\n\r\nif p<len(e):\r\n print(\"YES\")\r\nelse:print(\"NO\")\r\n\r\n\r\n\r\n", "s = input()\r\nyes = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'h' and yes == 0:\r\n yes+= 1\r\n if s[i] == 'e' and yes == 1:\r\n yes += 1\r\n if s[i] == 'l' and (yes == 2 or yes == 3): \r\n yes += 1\r\n if s[i] == 'o' and yes == 4:\r\n yes += 1\r\nif yes == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin, stdout\r\n\r\n\r\ndef main():\r\n input_string = stdin.readline()\r\n search_string = \"hello\"\r\n MAX_LENGTH_OF_WORD = len(search_string)\r\n current_key = 0\r\n \r\n for letter in input_string:\r\n if letter == search_string[current_key]:\r\n current_key += 1\r\n if current_key == MAX_LENGTH_OF_WORD:\r\n break\r\n \r\n if current_key == MAX_LENGTH_OF_WORD:\r\n stdout.write(f\"YES\\n\")\r\n else:\r\n stdout.write(f\"NO\\n\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=input()\r\nx = [\"o\",\"l\",\"l\",\"e\",\"h\"]\r\ngot = False\r\nfor i in n:\r\n if len(x)==0:\r\n got=True\r\n break\r\n if i==x[-1]:\r\n #print(i)\r\n x.pop()\r\nif got or len(x)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=list(input())\r\ncount=1\r\nfor x in list(\"hello\"):\r\n if x in s:\r\n del s[0:s.index(x)+1]\r\n count*=1\r\n else:\r\n count*=0\r\nprint(\"YES\" if count==1 else \"NO\")", "s = iter(input())\r\nprint([\"NO\", \"YES\"][all(c in s for c in 'hello')])\r\n", "def main():\r\n s = input()\r\n a = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\n counter = 0\r\n flag = 0\r\n for i in a:\r\n x = s.find(i,counter)\r\n if x == -1:\r\n flag = 1\r\n break\r\n else:\r\n counter = x + 1\r\n print(\"YES\" if flag == 0 else \"NO\")\r\nmain()", "#CF802G\r\ns = input()\r\nh = s.find(\"h\")\r\ne = s.find(\"e\",h)\r\ni1 = s.find(\"l\",e)\r\nd = s.find(\"l\",i1+1)\r\ni2 = s.find(\"o\",d)\r\n#print(h,e,i1,d,i2)\r\nif -1 < h < e <i1 < d < i2:\r\n print(\"YES\")\r\nelse:print(\"NO\")\r\n", "'''Codeforces Problem 58A'''\r\nfrom time import process_time\r\nfrom sys import argv\r\n\r\nimport re\r\ndef solve():\r\n '''Solve the problem'''\r\n s = input()\r\n print('YES' if re.search(r'h.*?e.*?l.*?l.*?o', s) else 'NO')\r\n\r\nif len(argv) > 1:\r\n startTime = process_time()\r\n solve()\r\n print('Elapsed Time:', process_time() - startTime)\r\nelse:\r\n solve()\r\n", "s = str(input())\r\n\r\nq = ['h','e','l','l','o']\r\n\r\n\r\nfor char in s:\r\n if len(q) == 0:\r\n break\r\n if char == q[0]:\r\n q.pop(0)\r\n\r\nif len(q) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s=input()\r\nb=\"\"\r\nz={'h':0,'e':0,'l':0,'o':0}\r\ncount=1\r\nfor i in s:\r\n\tif i=='h' and count==1:\r\n\t\tb=b+i\r\n\t\tcount=count+1\r\n\r\n\telif i=='e' and count==2:\r\n\t\tb=b+i\r\n\t\tcount=count+1\r\n\r\n\telif i=='l' and (count==3 or count==4):\r\n\t\tb=b+i\r\n\t\tcount=count+1\r\n\r\n\telif i=='o' and count==5:\r\n\t\tb=b+i\r\n\t\tbreak\r\n\r\n\r\n\r\n\t\r\nif b=='hello':\r\n\tprint(\"YES\")\r\n\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "n = input()\r\ntry:\r\n h = n.index('h')\r\n n = n[h+1:]\r\n e = n.index('e')\r\n n = n[e+1:]\r\n l = n.index('l')\r\n n = n[l+1:]\r\n l = n.index('l')\r\n n = n[l+1:]\r\n o = n.index('o')\r\n print(\"YES\")\r\nexcept :\r\n print(\"NO\")", "a=str(input())\r\na=[i for i in a]\r\nk=0\r\nb=['h','e','l','l','o']\r\nfor i in range(len(b)):\r\n if b[i] in a:\r\n c=a.index(b[i])\r\n a=a[c+1:]\r\n k+=1\r\nif k==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s= input()\n\nh=s.find('h')\ne=s.find('e',h,len(s))\nl=s.find('l',e,len(s))\nlo=s.find('l',l+1,len(s))\no=s.find('o',lo,len(s))\nif h<e and e<l and l<lo and lo<o:\n\tprint('YES')\nelse:\n\tprint('NO')\n\t\n\n", "a = ['h', 'e', 'l', 'l', 'o']\r\nb = 0\r\nc = 0\r\nfor e in input():\r\n if e == a[b]:\r\n b += 1\r\n c += 1\r\n if c == 5:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "s=input().strip()\r\na=\"hello\"\r\nfor i in range(len(a)+1):\r\n if i==len(a):\r\n print(\"YES\")\r\n else:\r\n ind=s.find(a[i])\r\n if ind==-1:\r\n print(\"NO\")\r\n break\r\n else:\r\n s=s[ind+1:]", "user_inputs = input()\n\ntheword = \"hello\"\nfor i in range(len(user_inputs)):\n if theword == \"\": break\n if user_inputs[i] == theword[0]:\n theword = theword[1:]\nif theword == \"\":\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t\t \t \t \t\t \t \t \t \t\t\t\t", "s=str(input())\r\nn=len(s)\r\na=\"hello\"\r\nb=\"\"\r\nc=-1\r\nfor i in range(5):\r\n while c<n-1:\r\n c=c+1\r\n if a[i]==s[c]:\r\n b=b+s[c]\r\n break\r\nif b==a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n", "import sys\n\n\ns=input()\nm='hello'\nx=0\nfor i in range(len(s)):\n if s[i]==m[x]:\n x+=1\n if x==5:\n print(\"YES\")\n sys.exit()\nprint(\"NO\")\n ", "s=input()\r\nstringlist=[]\r\nchecker='hello'\r\nchecker_index=0\r\ndone=False\r\nfor i in range(len(s)):\r\n if s[i]==checker[checker_index]:\r\n checker_index+=1\r\n if checker_index==5:\r\n done=True\r\n break\r\n\r\nprint(\"YES\") if done else print(\"NO\")", "inp = input()\n\ninp = list(inp)\n\nhello = \"hello\"\nhello = list(hello)\nc = 0\nfor i in inp:\n\tif i == hello[c]:\n\t\thello[c] = \"\"\n\t\tc = c + 1\n\tif c == len(hello):\n\t\tbreak\t\n\t\nif hello == ['','','','','']:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "s = input()\r\nword = \"hello\"\r\np = 0\r\nfor c in s:\r\n if c == word[p]:\r\n p += 1\r\n if p == len(word):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "import re\r\np='[h][a-z]*[e][a-z]*[l][a-z]*[l][a-z]*o'\r\ns=input()\r\nif re.search(p,s):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nl = ['h', 'e', 'l', 'l', 'o']\r\ni = -1\r\nfor c in l:\r\n i = s.find(c, i + 1)\r\n if i == -1:\r\n print('NO')\r\n exit()\r\nprint('YES')", "s=input()\r\nif \"h\" in s and \"e\" in s and \"l\" in s and \"o\" in s and s.count(\"l\")>=2:\r\n s=s[s.index(\"h\"):]\r\n if \"e\" in s:\r\n s=s[s.index(\"e\"):]\r\n if \"l\" in s:\r\n s=s[s.index(\"l\"):]\r\n if \"l\" in s[1:]:\r\n b=s[1:].index(\"l\")+1\r\n s=s[b:]\r\n if \"o\" in s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "line = input()\r\nflag = True\r\nif \"h\" in line:\r\n line = line[line.index(\"h\")+1:]\r\n if \"e\" in line:\r\n line = line[line.index(\"e\")+1:]\r\n if \"l\" in line:\r\n line = line[line.index(\"l\")+1:]\r\n if \"l\" in line:\r\n line = line[line.index(\"l\")+1:]\r\n if \"o\" in line:\r\n line = line[line.index(\"o\")+1:]\r\n else: \r\n flag = False\r\n else:\r\n flag = False\r\n else:\r\n flag = False\r\n else:\r\n flag = False\r\nelse:\r\n flag = False\r\n \r\nif flag :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\n\r\ncn=0\r\nfor i in range(len(s)):\r\n\r\n if(cn==0 and s[i]=='h'):\r\n cn=1\r\n elif(cn==1 and s[i]=='e'):\r\n cn=2\r\n elif(cn==2 and s[i]=='l'):\r\n cn=3\r\n elif(cn==3 and s[i]=='l'):\r\n cn=4\r\n elif(cn==4 and s[i]=='o'):\r\n cn=5\r\nif cn==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\ncount = 0\r\nfor i in range(len(s)):\r\n if count == 0 and s[i] == \"h\":\r\n count += 1\r\n elif count == 1 and s[i] == \"e\":\r\n count += 1\r\n elif count == 2 and s[i] == \"l\":\r\n count += 1\r\n elif count == 3 and s[i] == \"l\":\r\n count +=1\r\n elif count == 4 and s[i] == \"o\":\r\n count += 1\r\nif count == 5:\r\n print(\"YES\")\r\nelif count != 5:\r\n print(\"NO\")", "s = input()\r\n\r\nletra_1 = False\r\nletra_2 = False\r\nletra_3 = False\r\nletra_4 = False\r\nletra_5 = False\r\n\r\nfor i in s:\r\n if letra_1 == False:\r\n if i == \"h\":\r\n letra_1 = True\r\n elif letra_2 == False:\r\n if i == \"e\":\r\n letra_2 = True\r\n elif letra_3 == False:\r\n if i == \"l\":\r\n letra_3 = True\r\n elif letra_4 == False:\r\n if i == \"l\":\r\n letra_4 = True\r\n elif letra_5 == False:\r\n if i == \"o\":\r\n letra_5 = True\r\n\r\nif letra_5 == True:\r\n print('YES')\r\nelse:\r\n print('NO')", "def iscorrect(s,t):\r\n i=0\r\n j=0\r\n while(j<len(s) and i<len(t)):\r\n if(s[j]==t[i]):\r\n i+=1\r\n j+=1\r\n return i==len(t)\r\ns=input()\r\nt='hello'\r\nif(iscorrect(s,t)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = input()\r\n\r\ntry:\r\n h_index = word.index(\"h\")\r\n e_index = word[h_index + 1:].index(\"e\") + len(word) - len(word[h_index + 1:])\r\n l1_index = word[e_index + 1:].index(\"l\") + len(word) - len(word[e_index + 1:])\r\n l2_index = word[l1_index + 1:].index(\"l\") + len(word) - len(word[l1_index + 1:])\r\n o_index = word[l2_index + 1:].index(\"o\") + len(word) - len(word[l2_index + 1:])\r\n print(\"YES\")\r\nexcept Exception:\r\n print(\"NO\")\r\n", "import math\r\nn = (input())\r\nt=0\r\nfor i, c in enumerate(n):\r\n #print(c,'\\n')\r\n if (c == 'h' and t == 0):\r\n t=t+1\r\n elif (c == 'e' and t == 1):\r\n t=t+1\r\n elif (c == 'l'and t == 2) :\r\n t = t + 1\r\n elif (c == 'l' and t == 3) :\r\n t=t+1\r\n elif (c == 'o' and t == 4):\r\n t=t+1\r\n#print(t,\"\\n\")\r\nif t == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\n\r\ndef b(b, s):\r\n i=s.find(b)\r\n if i==-1:\r\n print(\"NO\")\r\n exit()\r\n s=s[i+1:]\r\n return s\r\n\r\nfor i in \"hello\":\r\n s=b(i, s)\r\nprint(\"YES\")\r\n", "################### <---------------------- QuickSilver ---------------------> ####################\r\n\r\ns=input()\r\nans='hello'\r\nn=len(ans)\r\nptr=0\r\n\r\nfor a in s:\r\n if ptr==n:\r\n break\r\n if a==ans[ptr]:\r\n ptr+=1\r\nif ptr==n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "w=input()\r\nidx=0\r\nstring=\"hello\"\r\nfor i in range (0,len(w)):\r\n\tif idx==5:\r\n\t\tbreak\r\n\tif w[i]==string[idx]:\r\n\t\tidx+=1\r\nif idx==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\ncs, ci = 'hello', 0\nfor i in range(len(s)):\n if s[i] == cs[ci]:\n ci += 1\n if ci == 5:\n print('YES')\n exit(0)\nprint('NO')\n\n\n\n\n# s = [s[i] for i in range(len(s) - 1) if s[i] != s[i - 1]]\n# pass\n", "s = list(input())\r\nflag = False\r\nindx = []\r\nq = 0\r\nfor i in ['h','e','l','l','o']:\r\n if i in s:\r\n k = s.index(i)\r\n q += k + 1\r\n indx.append(q)\r\n s = s[k+1:]\r\n if indx != sorted(indx):\r\n flag = True\r\n break\r\n else:\r\n flag = True\r\n break\r\nif flag:\r\n print('NO')\r\nelse:\r\n print('YES')", "S = input()\r\nword = 'hello'\r\ni = 0\r\nnew = ''\r\nans = \"NO\"\r\nfor char in S:\r\n if char == word[i]:\r\n new += char\r\n i += 1\r\n if new == 'hello':\r\n ans = \"YES\"\r\n break\r\nprint(ans)\r\n\r\n", "a=input()\r\nb=a.lower()\r\nx=0\r\n\r\n\r\nif 1<=len(a)<=100 and a==b:\r\n while x<len(a):\r\n if a[x]=='h':\r\n break\r\n x=x+1\r\n if x==len(a):\r\n print('NO')\r\n break\r\n y=x+1\r\n if y==len(a):\r\n print('NO')\r\n while y<len(a):\r\n if a[y]=='e':\r\n break\r\n y=y+1\r\n if y==len(a):\r\n print('NO')\r\n break\r\n z=y+1\r\n if z==len(a):\r\n print('NO')\r\n while z<len(a):\r\n if a[z]=='l':\r\n break\r\n z=z+1\r\n if z==len(a):\r\n print('NO')\r\n break\r\n f=z+1\r\n if f==len(a):\r\n print('NO')\r\n while f<len(a):\r\n if a[f]=='l':\r\n break\r\n f=f+1\r\n if f==len(a):\r\n print('NO')\r\n break\r\n g=f+1\r\n if g==len(a):\r\n print('NO')\r\n while g<len(a):\r\n if a[g]=='o':\r\n print('YES')\r\n break\r\n g=g+1\r\n if g==len(a):\r\n print('NO')\r\n break\r\nelse:\r\n print('NO')\r\n", "l = str(input())\r\nA1 = False\r\nA2 = False\r\nA3 = False\r\nA4 = False\r\n\r\nfor i in l:\r\n if i=='o' and A4:\r\n print('YES')\r\n break\r\n if i=='l' and A3:\r\n A4 = True\r\n continue\r\n if i=='l' and A2:\r\n A3 = True\r\n continue\r\n if i=='e' and A1:\r\n A2 = True\r\n continue\r\n if i=='h'and not A1:\r\n A1 = True\r\n continue \r\nelse:\r\n print('NO')", "a=input()\r\nh=a.find(\"h\")\r\ne=a.find(\"e\",h+1)\r\nl=a.find(\"l\",e+1)\r\nl1=a.find(\"l\",l+1)\r\no=a.find(\"o\",l1+1)\r\nd=a[h]+a[e]+a[l]+a[l1]+a[o]\r\nif d==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "s = input()\r\nh_string = ''\r\ncount = 0\r\nfor i in s:\r\n if count == 0:\r\n if i == 'h':\r\n h_string = h_string + i\r\n count = count + 1\r\n elif count == 1:\r\n if i == 'e':\r\n h_string += i\r\n count += 1\r\n elif count == 2:\r\n if i == 'l':\r\n h_string += i\r\n count += 1\r\n elif count == 3:\r\n if i == 'l':\r\n h_string += i\r\n count += 1\r\n elif count == 4:\r\n if i == 'o':\r\n h_string += i\r\n count = count + 1\r\n\r\nif count == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input().strip()\r\nh = \"hello\"\r\nk = 0\r\nc = 0\r\nfor i in range(len(h)):\r\n\r\n for j in range(k,len(a)):\r\n if h[i] == a[j]:\r\n c += 1\r\n k = j+1\r\n break\r\n \r\nif c == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n exit(0)\r\n\r\n \r\n\r\n ", "import re\r\ns=input()\r\nx=re.findall(\"h.*e.*l.*l.*o\",s)\r\nif len(x)>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n s = input()\r\n hello = list(reversed('hello'))\r\n\r\n for i in range(len(s)):\r\n if len(hello) and s[i] == hello[-1]:\r\n hello.pop()\r\n\r\n print('YES' if not hello else 'NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "s = input()\r\nnex = list(\"hello\")\r\n\r\nfor c in s:\r\n if c == nex[0]:\r\n nex.pop(0)\r\n if len(nex) == 0:\r\n break\r\n \r\nprint(\"NO\" if len(nex) else \"YES\") \r\n \r\n", "s = input()\n\nsh = 'hello'\nc = 0\n\nfor i in range(len(s)):\n if c<5:\n if s[i]==sh[c]:\n c+=1\n\nif c==5:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n# import re\n# print(\"YES\"if re.search(\"h.*e.*l.*l.*o\",input())else\"NO\")\n\t\t\t\t \t\t \t\t\t \t \t\t\t\t\t\t\t\t\t", "s = str(input())\r\nexpected = 'hello'\r\n\r\ni = j = 0 # i and j are pointer for expected and actual word.\r\n\r\nwhile j < 5 and i < len(s): # length of heelo is 5.\r\n if expected[j] == s[i]:\r\n i += 1\r\n j += 1\r\n else:\r\n i += 1\r\n\r\nif j == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nt = list(a)\r\nc = 0\r\nfor i in range(len(t)):\r\n\tif t[i] == 'h':\r\n\t\tfor j in range(i+1,len(t)):\r\n\t\t\tif t[j] == 'e':\r\n\t\t\t\tfor k in range(j+1,len(t)):\r\n\t\t\t\t\tif t[k] == 'l':\r\n\t\t\t\t\t\tfor m in range(k+1, len(t)):\r\n\t\t\t\t\t\t\tif t[m] == 'l':\r\n\t\t\t\t\t\t\t\tfor n in range(m+1, len(t)):\r\n\t\t\t\t\t\t\t\t\tif t[n] == 'o':\r\n\t\t\t\t\t\t\t\t\t\tc = 1\r\n\t\t\t\t\t\t\t\t\t\tbreak\r\n\r\nif c == 1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "mes = input()\r\nword = ''\r\nfor i in range(len(mes)):\r\n if mes[i] == 'h':\r\n if 'h' not in word:\r\n word += 'h'\r\n else:\r\n continue\r\n elif mes[i] == 'e' and 'h' in word:\r\n if 'e' not in word:\r\n word += 'e'\r\n else:\r\n continue\r\n elif mes[i] == 'l' and 'e' in word:\r\n if 'll' not in word:\r\n word += 'l'\r\n else:\r\n continue\r\n elif mes[i] == 'o' and 'll' in word:\r\n if 'o' not in word:\r\n word += 'o'\r\n else:\r\n continue\r\n else:\r\n continue\r\n\r\nif word == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "string=input()\r\ncount=0\r\nnew=\"hello\"\r\nfor x in range(len(string)):\r\n\tif(string[x]==new[count]):\r\n\t\tcount+=1\r\n\t\tif(count==5):\r\n\t\t\tbreak\r\nif(count==5):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input().strip()\r\na = \"hello\"\r\ni = 0 \r\nfor c in s:\r\n if c == a[i]:\r\n i += 1\r\n if i == len(a): \r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\nres = 0\r\nh = 'hello'\r\ni = 0\r\nfor c in s:\r\n if res == 5:\r\n break\r\n if i < 5 and c == h[i]:\r\n res += 1\r\n i += 1\r\nif res == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "st = input()\r\na = \"hello\"\r\nx, y = 0, 0\r\n\r\n#For Loop\r\nfor i in st:\r\n if i == a[x]:\r\n x += 1\r\n y += 1\r\n \r\n # To Print Output\r\n if y == len(a):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s = input()\r\nx = 'hello'\r\nx_index = 0\r\nfor i in range(0,len(s)):\r\n if x_index == len(x):\r\n break\r\n if s[i] == x[x_index]:\r\n x_index += 1\r\nif x_index == len(x):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\ns1=\"hello\"\r\nj=0\r\np=0\r\nfor i in range(len(s)):\r\n\tif s[i]==s1[j]:\r\n\t\tj+=1\r\n\t\tp+=1\r\n\tif j==5:\r\n\t\tbreak\r\nif p==5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "l=list(input())\r\nj=['h','e','l','l','o']\r\nk=0\r\ng=j[0]\r\nfor i in range(len(l)):\r\n if g==l[i]:\r\n if k>3:\r\n k+=1\r\n break\r\n k+=1\r\n g=j[k]\r\nprint('YES' if k==5 else 'NO')\r\n", "# 58/A\nw = input()\ns = list('hello')\nfor c in w:\n if s[0] == c:\n s.pop(0)\n if len(s) == 0:\n break\nprint('YES' if len(s) == 0 else 'NO')\n", "s = input()\r\nh = 'hello'\r\nj = pas = 0\r\nfor i in s:\r\n if i == h[j]:\r\n j += 1\r\n pas += 1\r\n if pas == 5:\r\n break\r\nif pas == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "s = input()\r\nh,c = 'hello',0\r\nfor i in s:\r\n\tif i==h[c]: c+=1\r\n\tif c==5: print('YES');break\r\nelse: print('NO')", "s = input()\r\npatt = 'hello'\r\nj=0\r\nfor i in s:\r\n if j < 5 and i == patt[j]:\r\n j += 1\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n word = input() # Read the input word\r\n\r\n # Define the target word \"hello\"\r\n target_word = \"hello\"\r\n\r\n # Initialize pointers for both words\r\n word_pointer = 0\r\n target_pointer = 0\r\n\r\n # Check if the word contains the letters of \"hello\" in order\r\n while word_pointer < len(word) and target_pointer < len(target_word):\r\n if word[word_pointer] == target_word[target_pointer]:\r\n # If the characters match, move the target_pointer to the next letter in \"hello\"\r\n target_pointer += 1\r\n # Move the word_pointer to the next letter in the input word\r\n word_pointer += 1\r\n\r\n # If all letters of \"hello\" were found in the correct order, target_pointer will be equal to len(target_word)\r\n # Otherwise, target_pointer will be less than len(target_word)\r\n if target_pointer == len(target_word):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def func():\r\n counter = 0\r\n for i in input():\r\n if i == \"hello\"[counter]:\r\n counter += 1\r\n if counter == 5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(func())", "a = input() ; b = 0 ; c = 'hello'\r\nfor i in a:\r\n if i == c[b]:b += 1\r\n if b >= 5:break\r\nif b >= 5:print(\"YES\")\r\nelse:print(\"NO\")", "s = input()\r\nl = 'hello'\r\nj = 0\r\nb = False\r\nfor i in s:\r\n if i == l[j]:\r\n j += 1\r\n if j == 5:\r\n j = 0\r\n b = True\r\nprint('YES' if b else 'NO')\r\n", "a=input()\r\nb=\"hello\"\r\nj=0\r\nc=\"\"\r\nfor i in range(0,len(a)):\r\n if a[i]==b[j] and c!=b and j<=4:\r\n c=c+b[j]\r\n j=j+1\r\n else:\r\n continue\r\n if c==b:\r\n break\r\nif c==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\ns = 0\r\nif \"h\" in n:\r\n h = n.index(\"h\")\r\n s += 1\r\n n = n[h+1:]\r\nif \"e\" in n:\r\n e = n.index(\"e\")\r\n s += 1\r\n n = n[e+1:]\r\nif \"l\" in n:\r\n l1 = n.index(\"l\")\r\n s += 1\r\n n = n[l1+1:]\r\nif \"l\" in n:\r\n l2 = n.index(\"l\")\r\n s += 1\r\n n = n[l2+1:]\r\nif \"o\" in n:\r\n s += 1\r\nif s == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "import sys\r\ns, k, pos = input(), \"hello\", 0\r\nfor x in s:\r\n if x == k[pos]: \r\n pos += 1\r\n if pos == 5:\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")", "x=input()\r\na=['h','e','l','l','o']\r\nf=False\r\nfor i in range(len(x)):\r\n if x[i]==a[0]:\r\n a.remove(a[0])\r\n if len(a)==0:\r\n f=True\r\n break\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nc=0\r\np=0\r\nx='hello'\r\nfor i in range(len(a)):\r\n if x[c]==a[i]:\r\n c+=1\r\n p+=1\r\n if p==5:\r\n break\r\nif p==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = list(input())\r\n\r\nx = []\r\nj = 0\r\n\r\nk = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\n\r\nfor i in range(len(s)):\r\n if (s[i] == k[j]):\r\n x.append(s[i])\r\n j += 1\r\n if (j == 5):\r\n break\r\n\r\nprint(\"YES\" if x == k else \"NO\")", "def solution():\n a = input()\n b = \"hello\"\n\n i = 0\n j = 0\n while i < len(a) and j < len(b):\n if a[i] == b[j]:\n i += 1\n j += 1\n else:\n i += 1\n\n if j == len(b):\n print(\"YES\")\n else:\n print(\"NO\")\n\nsolution()\n", "s=input()\r\nres=\"hello\"\r\nx=0\r\nfor i in range(len(s)):\r\n if x<=4 and s[i]==res[x]:\r\n x+=1\r\n\r\nif x==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nc=0\r\nfor t in s:\r\n if c==0 and t=='h':\r\n c+=1\r\n elif c==1 and t=='e':\r\n c+=1\r\n elif c==2 and t=='l':\r\n c+=1\r\n elif c==3 and t=='l':\r\n c+=1\r\n elif c==4 and t=='o':\r\n c+=1\r\n break\r\nif(c==5):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nreq = \"hello\"\r\nfor c in s:\r\n if c == req[0]:\r\n req = req[1:]\r\n if len(req) == 0:\r\n break\r\nif len(req) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=\"hello\"\r\ndef funct():\r\n j=0\r\n s=input()\r\n for i in range(len(s)):\r\n if s[i]==a[j]:\r\n j=j+1\r\n if j==5:\r\n return 'YES'\r\n return 'NO'\r\nprint(funct())", "s = input().lower()\r\na = 'hello'\r\nc = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i] in s and i == 0:\r\n s = s[s.index(a[i])+1:]\r\n c += 1\r\n elif a[i] in s:\r\n s = s[s.index(a[i])+1:]\r\n c += 1\r\n else:\r\n break\r\nif c == 5:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")\r\n", "s =input()\r\nt=0\r\nk=0\r\nl=0\r\nm=0\r\np=0\r\nn=0\r\nz=0\r\nfor i in s :\r\n if(i=='h' or k==1):\r\n k=1\r\n if(i=='e' or l==1):\r\n l=1\r\n if(i=='l' or m==1):\r\n m=1 \r\n z=z+1\r\n if z==1:\r\n continue\r\n if(i=='l' or n==1):\r\n n=1\r\n if(i=='o' or p==1):\r\n p=1\r\n break\r\n \r\nif(k==1 and l==1 and m==1 and n==1 and p==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\np=['h','e','l','l','o']\r\nl=[]\r\nk=0\r\nfor i in a:\r\n if k<=4 and i==p[k]:\r\n k=k+1\r\n l.append(i)\r\n \r\nif len(l)==len(p):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nl = ''\r\nm = 'hello'\r\ncount_l = 0\r\nj = 0\r\nfor i in range (len(s)):\r\n if l == 'hello':\r\n break\r\n if s[i] == m[j]:\r\n l+=s[i]\r\n j+=1\r\n\r\nif 'hello' == l:\r\n print('YES')\r\nelse:\r\n print('NO')", "# http://codeforces.com/problemset/problem/58/A\r\nimport re\r\nprint('YES' if re.match('.*[h]+.*[e]+.*[l]+.*[l]+.*[o]+.*', input()) else 'NO')", "s = input()\r\ncount = 0\r\nword = ''\r\nfor i in s:\r\n if count == 0 and i == 'h':\r\n count += 1\r\n if count == 1 and i == 'e':\r\n count += 1\r\n if (count == 2 or count == 3) and i == 'l':\r\n count += 1\r\n if count == 4 and i == 'o':\r\n count += 1\r\nif count == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nn = 0\r\nfor i in s:\r\n if i == 'h':\r\n n = s.find('h')\r\n break\r\nelse:\r\n print('NO')\r\n exit()\r\nr = s[ n+1: ]\r\n\r\nfor i in r:\r\n if i == 'e':\r\n n = r.find('e')\r\n break\r\nelse:\r\n print('NO')\r\n exit()\r\nr = r[ n+1: ]\r\n\r\nfor i in r:\r\n if i == 'l':\r\n n = r.find('l')\r\n break\r\nelse:\r\n print('NO')\r\n exit()\r\nr = r[ n+1: ]\r\n\r\nfor i in r:\r\n if i == 'l':\r\n n = r.find('l')\r\n break\r\nelse:\r\n print('NO')\r\n exit()\r\nr = r[ n+1: ]\r\n\r\nfor i in r:\r\n if i == 'o':\r\n n = r.find('o')\r\n break\r\nelse:\r\n print('NO')\r\n exit()\r\nprint('YES') \r\n", "n=\"hello\"\r\ns=input()\r\nk=0\r\nfor i in range(len(s)):\r\n if s[i]==n[k]:\r\n k+=1\r\n if k==5:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "intended=\"hello\"\r\nword=input()\r\ni=0\r\nj=0\r\nn=5\r\nm=len(word)\r\nwhile (i<n and j<m):\r\n #print(i)\r\n #print(j)\r\n char_to_match=intended[i]\r\n if char_to_match == word[j]:\r\n j+=1\r\n i+=1\r\n else:\r\n j+=1\r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = str(input())\r\n\r\nhello = 'hello'\r\nidx_word = idx_hello = 0\r\n\r\nwhile(idx_word < len(word) and idx_hello < 5):\r\n if word[idx_word] == hello[idx_hello]:\r\n idx_hello += 1\r\n idx_word += 1\r\n\r\nprint('YES' if idx_hello == 5 else 'NO')", "s = ['h', 'e', 'l', 'l', 'o']\r\ns1 = input()\r\nx = len(s1)\r\ncount = 0\r\nj = 0\r\n\r\nif x >= 5:\r\n for i in range(x):\r\n if j <= 4 and s[j] == s1[i]:\r\n count += 1\r\n j += 1\r\n \r\n if count == 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nc = \"hello\"\r\ni=0\r\nj=0\r\nwhile((j<len(s)) and (i<len(c))):\r\n if(s[j]==c[i]):\r\n j=j+1\r\n i=i+1\r\n else:\r\n j=j+1\r\nif(i==len(c)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "m = input()\r\nk = ['h', 'e', 'l', 'l', 'o']\r\ni = -1\r\nfor c in k:\r\n i = m.find(c, i + 1)\r\n if i == -1:\r\n print('NO')\r\n exit()\r\nprint('YES')", "string=input()\r\n\r\nreq=\"hello\"\r\n\r\nj=0\r\n\r\nfor i in range(len(string)):\r\n\r\n\tif(string[i]==req[j]):\r\n\r\n\t\tj+=1 \r\n\r\n\tif(j==len(req)):\r\n\r\n\t\tprint(\"YES\")\r\n\r\n\t\tbreak\r\n\r\nif(j!=len(req)):\r\n\r\n\tprint(\"NO\")", "word = input()\r\nhello = ['h', 'e', 'l', 'l', 'o']\r\nfor h in range(len(word)):\r\n if word[h] == \"h\":\r\n for e in range(h+1, len(word)):\r\n if word[e] == \"e\":\r\n for l in range(e+1, len(word)):\r\n if word[l] == \"l\":\r\n for l_l in range(l+1, len(word)):\r\n if word[l_l] == \"l\":\r\n for o in range(l_l + 1, len(word)):\r\n if word[o] == \"o\":\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n ", "data = list(input())\r\nanswer = 'hello'\r\nidx = 0\r\n\r\nfor c in data:\r\n if c==answer[idx]:\r\n idx += 1\r\n if idx==5:\r\n break\r\nif idx==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nt= 'hello'\r\ni = 0\r\nj = 0\r\nn = len(s)\r\nwhile i<5 and j<n:\r\n if t[i]==s[j]:\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\nif i==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "counter = 0\r\nstring = input()\r\nhello =\"hello\"\r\nj =0\r\n\r\nfor i in range (0,len(hello)):\r\n while (j < len(string)) :\r\n if (string[j] == hello[i]) :\r\n counter =counter +1\r\n j=j+1\r\n break\r\n else :\r\n j+=1\r\n\r\nif counter == 5 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n\r\n", "s=input()\r\nif len(s)<5:\r\n print('NO')\r\n exit()\r\nncount=0\r\nfor i in s:\r\n if ncount==0 and i=='h':\r\n ncount+=1\r\n continue\r\n if ncount==1 and i=='e':\r\n ncount+=1\r\n continue\r\n if ncount==2 and i=='l':\r\n ncount+=1\r\n continue\r\n if ncount==3 and i=='l':\r\n ncount+=1\r\n continue\r\n if ncount==4 and i=='o':\r\n ncount+=1\r\n break\r\n\r\n\r\nif ncount==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "w=input()\r\nt=0\r\nh=0\r\ne=0\r\nl=0\r\no=0\r\nfor i in range(len(w)):\r\n if w[i]=='h':\r\n h+=1\r\n if w[i]=='e' and h>0:\r\n e+=1\r\n if w[i]=='l' and h>0 and e>0:\r\n l+=1\r\n if w[i]=='o' and h>0 and e>0 and l>1:\r\n o+=1\r\nif h>0 and e>0 and l>1 and o>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = input()\r\n\r\ntemplate = list('hello') #variable to save the 'hello' word used to compare\r\n\r\ni = 0 #variable used to store the location on word\r\n\r\n#search for the letter in the word\r\nfor l in word:\r\n \r\n #if found, i+=1 to check the next letter\r\n if l == template[i]:\r\n i+=1\r\n if i >= len(template):\r\n print('YES')\r\n break\r\nif i < len(template):\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s = input()\r\nt = \"hello\"\r\ncount = 0\r\nfor x in s:\r\n if x==t[count]:count = count + 1\r\n if count > 4 :break\r\nprint((\"NO\",\"YES\")[count>4])", "WORD = \"hello\"\r\n\r\n\r\ndef solve():\r\n string = input()\r\n is_hello = False\r\n curr_word = 0\r\n for i in range(len(string)):\r\n if string[i] == WORD[curr_word]:\r\n if curr_word == 4:\r\n is_hello = True\r\n break\r\n curr_word += 1\r\n\r\n if is_hello:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n\r\nif __name__ == \"__main__\":\r\n solve()", "def isSubsequence(a, b=\"hello\"):\r\n \r\n i = j = 0\r\n while j < len(a) and i < len(b):\r\n \r\n if a[j] == b[i]:\r\n i += 1\r\n \r\n j += 1\r\n \r\n return (i==len(b))\r\n\r\ns = input()\r\nprint(\"YES\" if isSubsequence(s) else \"NO\")\r\n", "def main(s):\r\n hello = \"hello\"\r\n ind = 0\r\n for i in s:\r\n if i == hello[ind]: ind += 1\r\n if ind >= 5: return \"YES\"\r\n return \"NO\"\r\n\r\ns = input()\r\nprint(main(s))\r\n\r\n\r\n \r\n\r\n\r\n \r\n", "t=iter(input())\r\nprint('NYOE S'[all(s in t for s in 'hello')::2])", "import re\r\ns = input()\r\n\r\nif re.search('h+[a-z]*e+[a-z]*l+[a-z]*l+[a-z]*o+', s):\r\n print('YES')\r\nelse:\r\n print('NO')", "h =input()\nhello = \"hello\"\ncurrent = 0\nok = True\n\nfor c in hello:\n\tx = h[current:].find(c)\n\tif x == -1:\n\t\tok = False\n\t\tbreak\n\tcurrent = current + x + 1\n\nif ok:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "import sys\r\n\r\ns = input()\r\norg = \"hello\"\r\nj = 0\r\nfor i in range(len(s)):\r\n if s[i] == org[j]:\r\n j += 1\r\n if j == 5:\r\n break\r\nif j == len(org):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb,j='hello',0\r\nfor i in range(len(a)):\r\n if a[i]==b[j]:\r\n j=j+1\r\n if j==5:\r\n break\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word=input()\r\ncheck=['h','e','l','l','o']\r\nchecking=0\r\ncount=0\r\n\r\nfor x in word:\r\n if count<5:\r\n if x==check[checking] :\r\n checking+=1\r\n count+=1\r\n else:\r\n break\r\n\r\nif count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve_hello(user_input):\r\n word = \"hello\"\r\n index = 0\r\n\r\n for i in range(0, len(user_input)):\r\n if user_input[i] == word[index]:\r\n index += 1\r\n if index == 5:\r\n print(\"YES\")\r\n break\r\n\r\n if index < 5:\r\n print(\"NO\")\r\n\r\n\r\ntyped_word = input()\r\nsolve_hello(typed_word)", "a=0\r\nA=['h','e','l','l','o','_']\r\nfor i in input():\r\n if i==A[a]:\r\n a+=1\r\nprint([\"NO\",\"YES\"][a==5])", "text = input()\r\nhello_word = 'hello'\r\ncounter = 0\r\n\r\nfor i in range(len(text)):\r\n if text[i] == hello_word[counter]:\r\n counter += 1\r\n if counter >= len(hello_word):\r\n break\r\nif counter == len(hello_word):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\nt = 'hello'\nti, si = 0,0\nwhile si < len(s):\n if ti < 5 and s[si] == t[ti]:\n ti += 1\n si += 1\nprint('YES' if ti == 5 else 'NO')\n", "s=input()\r\nif \"h\" in s:\r\n s1=s[s.find(\"h\"):]\r\n if \"e\" in s1:\r\n s2=s1[s1.find(\"e\"): ]\r\n if \"l\" in s2:\r\n s3=s2[s2.find(\"l\")+1:]\r\n if \"l\" in s3:\r\n s4=s3[s3.find(\"l\"):]\r\n if \"o\" in s4:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "s=str(input())\r\ni=0;h=e=l1=l2=o=-1\r\np=len(s)\r\nwhile i<p:\r\n if s[i]=='h':\r\n h=i\r\n break\r\n i+=1\r\ni=0\r\nwhile i<p:\r\n if s[i]=='e' and i>h:\r\n e=i\r\n break\r\n i+=1\r\nsl=[s[i] for i in range(e,p)]\r\n#print(sl,h,e)\r\nli=sl.count('l') \r\nif li>=2:\r\n l1=sl.index('l')\r\n sl.remove('l')\r\n l2=sl.index('l')\r\ni=0\r\nwhile i<p:\r\n if s[i]=='o' and i>=l2+e+1:\r\n o=i\r\n i+=1\r\nif -1<h and -1<e and -1<l1 and -1<l2 and -1<o:\r\n print('YES')\r\nelse:\r\n print('NO')", "def chat():\r\n\tst=input()\r\n\tt='hello'\r\n\tx=0\r\n\tfor i in range(len(st)):\r\n\t\tif st[i]==t[x]:\r\n\t\t\tx+=1\r\n\t\tif x==5:\r\n\t\t\treturn 'YES'\r\n\treturn 'NO'\t\r\nprint(chat())", "s = input()\r\ngoal, pos, = \"hello\", 0\r\n\r\nfor i in s:\r\n\tif i == goal[pos]: pos+=1\r\n\tif pos == 5: \r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")", "s = input()\r\nm = 'hello'\r\nk = 0\r\n\r\nfor i in s:\r\n if i == m[k]:\r\n k += 1\r\n if k == 5:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "a = input()\r\nb = 'hello'\r\nindex = 0\r\n\r\nfor i in a:\r\n if index < len(b) and i == b[index]:\r\n index += 1\r\n if index == len(b): \r\n break\r\n\r\nif index >= len(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nn = len(s)\r\nh = \"hello\"\r\ni, k = 0, 0\r\nwhile k<5 and i<n:\r\n if h[k]==s[i]: k += 1\r\n i += 1\r\nif k<5 and i==n:\r\n print('NO')\r\nelse:\r\n print('YES')", "s = str(input())\r\nletter = \"hello\"\r\n\r\n\r\nx,y =0,0\r\nfor i in s:\r\n\tif(i == letter[x]):\r\n\t\tx += 1\r\n\t\ty += 1\r\n\tif(y == 5):\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")\r\n", "s = input()\r\nhello = \"hello\"\r\ni = 0\r\n\r\nfor b in range(len(s)):\r\n c = s[b]\r\n if c == hello[i]:\r\n\r\n if hello [i] == \"o\":\r\n print(\"YES\")\r\n exit()\r\n\r\n i += 1\r\n\r\nprint(\"NO\")", "w = input()\r\nresult = ''\r\n\r\nfor c in w:\r\n if c == 'h' and result not in {'e', 'l', 'll'}:\r\n result = 'h'\r\n elif c == 'e' and result == 'h':\r\n result = 'e'\r\n elif c == 'l':\r\n if result == 'e':\r\n result = 'l'\r\n elif result == 'l':\r\n result = 'll'\r\n elif c == 'o' and result == 'll':\r\n result = 'hello'\r\n break\r\n\r\nprint('YES' if result == 'hello' else 'NO')", "s = input()\r\ni = s.find('h')\r\n\r\nif i != -1:\r\n\ti = s.find('e', i + 1)\r\n\tif i != -1:\r\n\t\ti = s.find('l', i + 1)\r\n\t\tif i != -1:\r\n\t\t\ti = s.find('l', i + 1)\r\n\t\t\tif i != -1:\r\n\t\t\t\ti = s.find('o', i + 1)\r\n\t\t\t\tif i != -1:\r\n\t\t\t\t\tprint('YES')\r\n\t\t\t\telse:\r\n\t\t\t\t\tprint('NO')\r\n\t\t\telse:\r\n\t\t\t\tprint('NO')\r\n\t\telse:\r\n\t\t\tprint('NO')\r\n\telse:\r\n\t\tprint('NO')\r\nelse:\r\n\tprint('NO')", "import re\r\nif (re.search(\"h.*e.*l.*l.*o\",input())):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\ncurr = -1\nWORD = \"hello\"\nfound = True\nfor char in WORD:\n try:\n i = s.index(char, curr+1)\n curr = i\n except ValueError:\n print(\"NO\")\n found = False\n break\n\nif found:\n print(\"YES\")\n", "hello_stack = ['h', 'e', 'l', 'l', 'o']\r\n\r\ns = list(input())\r\n\r\nfor i in range(len(s)-1, -1, -1):\r\n if not hello_stack:\r\n break\r\n if s[i] == hello_stack[-1]:\r\n hello_stack.pop()\r\n \r\nif hello_stack: print('NO')\r\nelse: print('YES')", "from collections import deque\r\ns = input()\r\nl = deque(list('hello'))\r\ni=0\r\nwhile len(l) and i<len(s):\r\n if s[i]==l[0]:\r\n l.popleft()\r\n \r\n \r\n i+=1\r\nif len(l):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "s = input()\r\nx = 'hello'\r\nj=0\r\nfor i in range(s.__len__()):\r\n if s[i] == x[j]:\r\n j +=1\r\n if j == 5:\r\n break\r\n\r\nif j >=5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nl=list(\"hello\")\r\nk=0\r\nflag=1\r\nfor i in list(s):\r\n if i==l[k]:\r\n k+=1\r\n if k==5:\r\n flag=0\r\n break\r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nx=\"hello\"\r\nidx=0\r\nfor i in s:\r\n\tif(i==x[idx]):\r\n\t\tidx+=1\r\n\tif(idx>4):\r\n\t\tbreak\r\nif(idx!=5):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "word = \"hello\"\r\nstring = input()\r\np = 0\r\nfor s in string:\r\n if p < len(word) and s == word[p]:\r\n p += 1\r\n \r\nprint([\"NO\", \"YES\"][p == len(word)])\r\n", "palavra, objetivo, j,c = input(),\"hello\",0,0\r\n\r\nfor i in palavra:\r\n if j < 5 and i == objetivo[j]:\r\n c += 1\r\n j += 1\r\n\r\nif c == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\na = s.find('h')+1\r\nnn = 1\r\nif a != 0:\r\n s1 = s[a:]\r\n b = s1.find('e')+1\r\n if b != 0:\r\n s2 = s1[b:] \r\n c = s2.find('l')+1\r\n if c != 0:\r\n s3 = s2[c:] \r\n d = s3.find('l')+1\r\n if d != 0:\r\n s4 = s3[d:] \r\n e = s4.find('o')+1\r\n if e != 0:\r\n nn = 0\r\nif nn == 0:\r\n print('YES')\r\nelse: \r\n print('NO')\r\n", "ip=input()\r\ns=\"hello\"\r\nj=0\r\nfor i in ip:\r\n\tif(j<5 and i==s[j]):\r\n\t\tj+=1\r\nif(j==5):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "m=input()\r\ncount_h = False\r\ncount_e = False\r\ncount_l1 = False\r\ncount_l2 = False\r\ncount_o = False\r\nfor i in m:\r\n if i == \"h\":\r\n count_h = True\r\n elif i == \"e\" and count_h == True:\r\n count_e = True\r\n elif i == \"l\" and count_e == True and count_l1 == False:\r\n count_l1 = True\r\n elif i == \"l\" and count_l1 == True and count_l2 == False:\r\n count_l2 = True\r\n elif i == \"o\" and count_l2 == True:\r\n count_o = True\r\n break\r\nif count_h * count_e * count_l1 * count_l2 * count_o == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t=input()\r\nk=\"hello\"\r\nx=0\r\nfor i in range(len(t)):\r\n\tif(x==5):\r\n\t\tbreak\r\n\telse:\r\n\t\tif(t[i]==k[x]):\r\n\t\t\tx+=1\r\nif(x==5):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s=input()\r\np=\"hello\"\r\nx=0\r\nfor i in s :\r\n if i==p[x]:\r\n x+=1\r\n if x>=len(p):\r\n print('YES')\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "word=str(input())\r\nrealword=\"hello\"\r\n\r\nif len(word)>=1 and len(word)<=100:\r\n \r\n def chatting(data):\r\n counter=0\r\n for i in range(len(data)):\r\n if counter==5:\r\n return \"YES\"\r\n if data[i]==realword[counter]:\r\n counter+=1\r\n\r\n if counter >=5:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\nprint(chatting(word))\r\n\r\n", "string = input()\nsubstring = \"hello\"\nj = 0\n\nfor i in string:\n if i == substring[j]:\n j += 1\n if j == 5:\n break\n\nif j == 5:\n print('YES')\nelse:\n print('NO')", "\r\ndef main():\r\n for i in range(n-4):\r\n if s[i] == 'h':\r\n for j in range(i+1,n-3):\r\n if s[j] == 'e':\r\n for k in range(j+1, n-2):\r\n if s[k] == 'l':\r\n for l in range(k+1, n - 1):\r\n if s[l] == 'l':\r\n for m in range(l+1, n):\r\n if s[m] == 'o':\r\n return 'YES'\r\n return 'NO'\r\n\r\nif __name__==\"__main__\":\r\n s = input()\r\n n = len(s)\r\n print(main())", "s = input()\r\nword = \"hello\"\r\ntmp = 0\r\nans = 'NO'\r\n\r\nfor i in s:\r\n if i == word[tmp]:\r\n tmp+=1\r\n if tmp==len(word):\r\n ans = 'YES'\r\n break\r\n\r\nprint(ans)\r\n\r\n", "_user_value = input()\r\n_examples = \"hello\"\r\n_alphabet_checker = 0\r\n\r\nfor _i in _user_value:\r\n if _i == _examples[_alphabet_checker]:\r\n _alphabet_checker+=1\r\n if _alphabet_checker == 5:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "def msg(s):\r\n he=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\n for i in range(0,5):\r\n if he[i] in s:\r\n m=s.index(he[i])\r\n s=s[m+1:]\r\n else:\r\n return \"NO\"\r\n break\r\n return \"YES\"\r\nst=input()\r\nprint(msg(st))", "def can_say_hello(s):\r\n target_word = \"hello\"\r\n target_index = 0\r\n\r\n for char in s:\r\n if char == target_word[target_index]:\r\n target_index += 1\r\n\r\n if target_index == len(target_word):\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\n# Read input\r\ns = input().strip()\r\n\r\n# Check if Vasya can say hello\r\nresult = can_say_hello(s)\r\nprint(result)\r\n", "def main():\r\n strt=input()\r\n check=\"hello\"\r\n found=0\r\n j=0\r\n cnt=0\r\n for i in range(len(strt)):\r\n if(strt[i]==check[j]):\r\n j+=1\r\n cnt+=1\r\n if(cnt==5):\r\n print(\"YES\")\r\n found=1\r\n break\r\n if(found==0):\r\n print(\"NO\")\r\nmain()", "a=input()\na=[i for i in a]\ncounter=''\nh=0\ne=0\nl=0\nl1=0\no=0\nfor i in range(len(a)):\n if a[i]=='h' and counter == '':\n counter = counter+'h'\n h=i\n if a[i]=='e' and counter =='h' and h < i:\n counter += 'e'\n e=i\n if a[i]=='l' and counter == 'he' and e<i:\n counter += 'l'\n l=i\n if a[i]=='l' and counter == 'hel' and l<i:\n counter += 'l'\n l1=i\n if a[i]=='o' and counter == 'hell' and l1<i:\n counter += 'o'\nif counter=='hello':\n print('YES')\nelse:\n print('NO')\n\n", "s=input()\r\ndef kw(s,a='hello'):\r\n if len(a)==0:\r\n return 'YES'\r\n elif len(s)==0:\r\n return 'NO'\r\n else:\r\n if s[0]==a[0]:\r\n return kw(s[1:],a[1:])\r\n else:\r\n return kw(s[1:],a)\r\nprint(kw(s))", "def chat_room():\r\n w=input()\r\n w1=\"hello\"\r\n st=\"\"\r\n for i in w1:\r\n for j in range(len(w)):\r\n if w[j]==i:\r\n st+=w[j]\r\n w=w[j+1:]\r\n break\r\n if st==\"hello\":\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nchat_room()", "s=input()\r\np=\"hello\"\r\nx=0\r\ny=0\r\nfor i in range(0,len(s)):\r\n if s[i]==p[x]:\r\n x=x+1 \r\n y=y+1\r\n else:\r\n pass\r\n if y==5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "import re\r\n\r\nprint('YES' if re.match(r'.*h.*e.*l.*l.*o', input()) else 'NO')", "l = ['h', 'e', 'l', 'l', 'o']\r\nst = input()\r\nk = 0\r\nfor i in range(len(st)):\r\n if k < 5 and st[i] == l[k]:\r\n k=k+1\r\nif k == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\nn = input()\r\n\r\ns=\".*h.*e.*l.*l.*o.*\"\r\n\r\nif re.match(s,n):\r\n print(\"YES\")\r\nelse:print(\"NO\")", "s = input()\r\nok = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'h':\r\n for j in range(len(s)):\r\n if j > i and s[j] == 'e':\r\n for k in range(len(s)):\r\n if k > j and s[k] == 'l':\r\n for l in range(len(s)):\r\n if l > k and s[l] == 'l':\r\n for m in range(len(s)):\r\n if m > l and s[m] == 'o':\r\n ok = 1\r\nlstback=['NO','YES']\r\nprint (lstback[ok])", "import re\r\n\r\ns = input()\r\n\r\no = 'NO'\r\np = re.compile('.*h.*e.*l.*l.*o.*')\r\nif p.match(s):\r\n o = 'YES'\r\n \r\nprint(o)", "#D=input()\r\n#a=D.find('hello')\r\n#b=D[a:a+5]\r\n#print(b==hello)\r\n#print(D[a:b])\r\n#print(срез=='hello')\r\ns = input()\r\ns = s[(s.find('h')):(s.rfind('o')+1)]\r\ns = s[(s.find('e')):(s.rfind('l')+1)]\r\nif s.count('l') > 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "s = input()\r\nw = 'hello'\r\nc = 0\r\nfor i in range(len(s)):\r\n if s[i] == w[c]:\r\n c += 1\r\n if c == 5:\r\n break\r\nif c == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "need = \"hello\"\r\nj = 0\r\nfor i in input():\r\n\tif i == need[j]:\r\n\t\tj += 1\r\n\tif j == len(need):\r\n\t\tbreak\r\n\t\t\r\nprint(\"YES\" if j == len(need) else \"NO\")", "s = input()\r\nl = ['h','e','l','l','o']\r\nt = 0\r\nc = 0\r\nfor i in range(len(s)):\r\n\tif s[i] == l[t] :\r\n\t\tc = c+1\r\n\t\tt = t+1\r\n\tif c == 5:\r\n\t\tbreak\r\nif c == 5 :\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "s = input()\r\nhello = \"hello\"\r\ni = 0\r\nfor c in s:\r\n if c == hello[i]:\r\n i += 1\r\n if i == len(hello):\r\n break\r\nprint(\"YES\" if i == len(hello) else \"NO\")", "if __name__ == '__main__':\r\n\ts = input()\r\n\tcurr = 'h'\r\n\tj = 0\r\n\tfor i in range (len(s)):\r\n\t\tif s[i] == curr == 'h' and j == 0:\r\n\t\t\tcurr = 'e'\r\n\t\t\tj+=1\r\n\t\telif s[i] == curr == 'e' and j == 1:\r\n\t\t\tcurr = 'l'\r\n\t\t\tj+=1\r\n\t\telif s[i] == curr == 'l' and j==2:\r\n\t\t\tcurr = 'l'\r\n\t\t\tj+=1\r\n\t\telif s[i] == curr == 'l' and j==3:\r\n\t\t\tcurr = 'o'\r\n\t\t\tj+=1\r\n\t\telif s[i] == curr == 'o' and j==4:\r\n\t\t\tj+=1\r\n\t\t\tbreak\r\n\tif j==5:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "er=input()\r\nwr=['h','e','l','l','o']\r\nq=0\r\nfor k in range(len(er)):\r\n if q==len(wr):\r\n break;\r\n elif er[k]==wr[q]:\r\n q=q+1\r\nif q<len(wr):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n \r\n \r\n", "# cook your dish here\r\n# hello\r\nlst = ['h', 'e', 'l', 'l', 'o']\r\nn = input()\r\nj = 0\r\ncount_h = 0\r\nfor i in range(len(n)):\r\n if n[i] == lst[j]:\r\n count_h += 1\r\n j += 1\r\n if count_h == len(lst):\r\n break\r\nif count_h == len(lst):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = 'hello'\n\nx = 0\n\nb = str(input())\n\nc = len(a)\nfor i in b:\n if i == a[x] and x < c:\n x = x+1\n if i == 'o' :\n break\nif x == c:\n print('YES')\nelse:\n print('NO')\n", "a = \"hello\"\r\nb = input()\r\n\r\nfor i in a:\r\n for j in range(len(b)):\r\n if i == b[j]:\r\n b = b[j+1::]\r\n a = a[1::]\r\n break\r\n\r\nif a == \"\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nflag=0\r\nfor char in s:\r\n if char == 'h' and flag==0:\r\n flag+=1\r\n elif char == 'e' and flag==1:\r\n flag+=1\r\n elif char == 'l' and flag==2:\r\n flag+=1\r\n elif char == 'l' and flag==3:\r\n flag+=1\r\n elif char == 'o' and flag==4:\r\n flag+=1\r\nif flag==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "string = input()\n\nit = 0\nkey = \"hello\"\n\nfor char in string :\n\tif ( it < len(key) and char == key[it] ) :\n\t\tit += 1 \nif ( it == len(key) ) :\n\tprint(\"YES\")\nelse :\n\tprint(\"NO\")\n", "mot=input()\r\nhello='hello'\r\ni,j=0,0\r\nres=False\r\nwhile (i<len(mot) and not(res) and j<len(hello)):\r\n if mot[i]==hello[j]:\r\n j+=1\r\n i+=1\r\n if(j==len(hello)):\r\n res=True\r\nif res:\r\n res='YES'\r\nelse:\r\n res='NO'\r\nprint(res) ", "x = iter(input())\r\nprint('NYOE S'[all(i in x for i in 'hello')::2])", "def chatRoom(s):\r\n\tcur = 0\r\n\tnext = {0: \"h\", 1: \"e\", 2: \"l\", 3: \"l\", 4: \"o\"}\r\n\tfor char in s:\r\n\t\tif char == next[cur]:\r\n\t\t\tcur += 1\r\n\t\t\tif cur == 5: return True\r\n\treturn False\r\n\r\ns = input()\r\nif chatRoom(s):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "key='hello'\r\nstr=input()\r\nj=0\r\nfor i in range(len(str)):\r\n if str[i]==key[j]:\r\n j+=1\r\n if j==5:\r\n break\r\nprint('YES') if j==5 else print('NO')", "S = input() \r\nindices = [0, 0, 0, 0, 0]\r\nfor char in S:\r\n if char == \"h\" and indices[0] == 0:\r\n indices[0] = 1\r\n elif char == \"e\" and indices[0] == 1 and indices[1] < 1:\r\n indices[1] = 1\r\n elif char == \"l\" and indices[1] == 1 and indices[2] < 2:\r\n indices[2] += 1\r\n elif char == \"o\" and indices[2] == 2 and indices[3] < 1:\r\n indices[3] = 1\r\nif indices == [1, 1, 2, 1, 0]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\na = 'hello'\r\nc = 0\r\nfor x in s:\r\n if x == a[c]:\r\n c += 1\r\n if c >= len(a):\r\n break\r\nprint('YES' if c == len(a) else 'NO')\r\n", "s = input()\r\nh = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\notv = \"NO\"\r\np = 0\r\nfor i in range(len(s)):\r\n if s[i] == h[p]:\r\n p = p + 1\r\n if p == 5:\r\n otv = \"YES\"\r\n break\r\nprint(otv)\r\n \r\n\r\n", "word = input()\r\nll = word.count('l')\r\nif ll >= 2:\r\n h = word.index('h')\r\n word = word[h:]\r\n if word.count('e') >= 1:\r\n e = word.index('e')\r\n word = word[e:]\r\n if word.count('l')>=2:\r\n l_1 = word.index('l')\r\n word = word[l_1:]\r\n if word.count('o')>=1 and word.index('o')>word.index('l'):\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "a = input()\n\nhello = \"hello\"\nunique = \"\"\n\nh_i = 0\ni = 0\n\nwhile i < len(a):\n if h_i == len(hello): break\n if a[i] == hello[h_i]:\n h_i += 1\n i += 1\n \nif h_i == len(hello):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def ii():\r\n\treturn int(input())\r\ndef ms():\r\n\treturn map(int,input().split())\r\ndef s():\r\n\treturn input()\r\ndef i(n):\r\n\treturn int(n)\r\n\r\ns=s()\r\nh=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nans=\"YES\"\r\nfor i in h:\r\n\tif(i in s):\r\n\t\ts=s[s.index(i)+1:]\r\n\telse:\r\n\t\tans=\"NO\"\r\n\t\tbreak\r\nprint(ans)", "k = input()\n\n\np = \"hello\"\na = []\n\ni = 0;\nfor x in k:\n\tif i >= 5:\n\t\tbreak;\n\tif (x == p[i]):\n\t\ti = i + 1\n\n\n\nif i >= 5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\n\n\t\t \t \t\t\t \t\t\t \t\t \t\t \t\t \t\t \t\t", "word = input()\r\ns = 'hello'\r\nc = 0\r\nfor i in word:\r\n if i == s[c]:\r\n c+=1\r\n if c ==5:\r\n break\r\nif c ==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "word = input()\r\nb = []\r\nfor i in word:\r\n if i == 'h' and len(b) == 0:\r\n b.append('h')\r\n elif i == 'e' and len(b) == 1:\r\n b.append('e')\r\n elif i == 'l' and 2 <= len(b) < 4:\r\n b.append('l')\r\n elif i == 'o' and len(b) == 4:\r\n b.append('o')\r\nprint('YES' if ''.join(b) == 'hello' else 'NO')", "# x=0\n# for ___ in range(int(input())):\n# statements=list(input())\n\n# for verify in statements:\n\n# subtraction=True\n# if verify=='+':\n# x+=1\n# subtraction=False\n# break\n# if subtraction:\n# x-=1\n# print(x)\n\n# x=input().split()\n# index=int(x[1])-1\n# list_nums = []\n\n# for num in range(int(x[0])):\n# if num%2>0 and num!=0:\n# list_nums.append(num)\n# for num in range(int(x[0])):\n# if num%2==0 and num!=0:\n# list_nums.append(num)\n# print(list_nums[index])\n\n# username=list(input())\n# alist=[]\n# for letter in username:\n# if letter not in alist:\n# alist.append(letter)\n\n# if len(alist)%2==0:\n# print(\"CHAT WITH HER!\")\n# else:\n# print(\"IGNORE HIM!\")\n\n# word=input()\n# letter_list=list(word)\n\n# if word[0].isupper():\n# print(word)\n# else:\n \n# letter_list.insert(0,letter_list.pop(0).upper())\n# print(''.join(letter_list))\n\ns=list(input())\nmean=['h','e','l','l','o']\n\nhold=[]\nno=True\nindex=0\nfor letter in s:\n if letter==mean[index]:\n hold.append(letter)\n index+=1\n if index==5:\n print(\"YES\")\n no=False\n break\nif no:\n print(\"NO\")\n\n", "x=input()\r\nans=\"\"\r\ngiv=\"hello\"\r\nj=0\r\nfor item in x:\r\n if(len(ans)<len(giv)):\r\n if(item==giv[j]):\r\n ans=ans+item\r\n j+=1\r\nif(ans==giv):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\ns = input() \r\nans = \"\"\r\ntemp = ['h', 'e', 'l', 'l', 'o']\r\nplace = temp[0]\r\nj = 0\r\nwhile j < len(s) and temp:\r\n if place == s[j]:\r\n ans += place\r\n temp.remove(place)\r\n if temp:\r\n place = temp[0]\r\n j += 1\r\n \r\nif ans == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "hello=str(input())\r\ntest=\"hello\"\r\nn=0\r\nfor i in range(len(hello)):\r\n if hello[i] == test[n]:\r\n n+=1\r\n if n==5:\r\n print(\"YES\")\r\n exit()\r\n \r\nprint(\"NO\")\r\nexit()\r\n", "s=input()\r\nx=\"hello\"\r\nflag=\"NO\"\r\nj=0\r\nl=list(s)\r\nfor i in l:\r\n if(i==x[j]):\r\n j+=1\r\n if(j==5):\r\n flag=\"YES\"\r\n break\r\nprint(flag)", "word = input()\r\n\r\n# H E L L O \r\ndef solve():\r\n hello = \"hello\"\r\n seen_characters = 0\r\n\r\n for c in word:\r\n if c == hello[seen_characters]:\r\n seen_characters += 1\r\n if seen_characters == len(hello):\r\n print(\"YES\")\r\n return\r\n \r\n print(\"NO\")\r\n\r\nsolve()", "s=input()\r\na=\"hello\"\r\nj=i=0\r\nwhile i<len(s):\r\n if a[j]==s[i]:\r\n j+=1\r\n if j==5:\r\n print(\"YES\")\r\n break\r\n i+=1\r\nelse:\r\n print(\"NO\")", "word=input()\r\nindexCheck=[]\r\naeh=[]\r\nee=[]\r\nael=[]\r\noo=[]\r\nflag=0\r\nfor i in range(0,word.count('h')):\r\n aeh.append(word.index('h'))\r\n word=word.replace('h',' ',1)\r\nfor i in range(0,word.count('e')):\r\n ee.append(word.index('e'))\r\n word=word.replace('e',' ',1)\r\nfor i in range(0,word.count('l')):\r\n ael.append(word.index('l'))\r\n word=word.replace('l',' ',1)\r\nfor i in range(0,word.count('o')):\r\n oo.append(word.index('o'))\r\n word=word.replace('o',' ',1)\r\nflag=0\r\nif len(aeh)>0:\r\n start=min(aeh)\r\n for i in range(len(ee)):\r\n if ee[i]>start:\r\n start=ee[i]\r\n flag+=1\r\n break\r\n for i in range(len(ael)):\r\n if ael[i]>start:\r\n start=ael[i]\r\n flag+=1\r\n break\r\n for i in range(len(ael)):\r\n if ael[i]>start:\r\n start=ael[i]\r\n flag+=1\r\n break\r\n for i in range(len(oo)):\r\n if oo[i]>start:\r\n flag+=1\r\n break\r\nif flag==4:\r\n print ('YES')\r\nelse:\r\n print ('NO')\r\n \r\n \r\n\r\n\r\n\r\n\r\n", "s = list(input())\r\nw = 'hello'\r\nc = 0\r\nfor i in s:\r\n if i == w[c]:\r\n c += 1\r\n if c == 5:\r\n break\r\n\r\n\r\nif c == 5:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "s = str(input())\na = s.find('h')\nb = s.find('e',a)\nc = s.find('l',b)\nd = s.find('l',c+1)\ne = s.find('o',d)\nif a<b<c<d<e:\n print('YES')\nelse:\n print('NO')", "import re\na = re.compile(r'h.''*e.''*l.''*l.''*o')\ns = input()\n\nif re.search(a, s) :\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", "a=input()\r\nh='hello'\r\nj=0\r\nfor i in range(len(a)):\r\n if j<5 and a[i] == h[j]:\r\n j+=1\r\nif j==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "string=input()\r\nmystring='hello';index=0\r\nfor i in string:\r\n if index==5:\r\n break\r\n if i==mystring[index]:\r\n index+=1\r\nif index==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "written = input()\r\ntarget = \"hello\"\r\ni = 0\r\nfor string in written:\r\n fulfill = target[i]\r\n if string == fulfill:\r\n i += 1\r\n if i == 5:\r\n break\r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve(s):\n greeting = 'hello'[::-1]\n for i in range(len(s)):\n if len(greeting) != 0:\n if greeting[-1] == s[i]:\n greeting = greeting[:-1]\n if len(greeting) == 0:\n return 'YES'\n return 'NO'\n\n\nprint(solve(input()))\n", "s = input()\r\n\r\ndef chatroom(s): \r\n #if s has all the letters in 'hello'\r\n i = 0\r\n for letter in s:\r\n if letter == 'hello'[i]:\r\n i += 1\r\n if i == 5:\r\n return 'YES'\r\n return 'NO'\r\nprint(chatroom(s)) \r\n \r\n", "s=list(input())\r\na=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nfor i in a:\r\n flag=0\r\n for j in range(len(s)):\r\n if i==s[j]:\r\n s=s[j+1:]\r\n flag=1\r\n if i==\"o\":\r\n print(\"YES\")\r\n exit()\r\n break\r\n if flag==0:\r\n print(\"NO\")\r\n exit()", "s=list(input())\r\nx=['h','e','l','l','o']\r\ncount=0\r\nflag=0\r\nfor i in range(len(s)):\r\n if count==5:\r\n break\r\n elif s[i]==x[flag]:\r\n flag+=1\r\n count+=1\r\n else:\r\n continue\r\nif count==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "z=str(input())\r\n\r\nif ('h' in z )== True :\r\n q=int(z.find('h'))\r\n\r\n z=z[(q+1):]\r\n if ('e' in z )==True :\r\n w=int(z.find('e'))\r\n \r\n z=z[(w+1):]\r\n \r\n if ('l' in z )==True :\r\n e=int(z.find('l'))\r\n \r\n z=z[(e+1):]\r\n \r\n if ('l' in z )==True :\r\n r=int(z.find('l'))\r\n \r\n z=z[(r+1):]\r\n \r\n if ('o' in z )==True :\r\n print('YES')\r\n else :\r\n print('NO')\r\n else :\r\n print('NO')\r\n else :\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse :\r\n print('NO')\r\n", "ver='hello'\r\ns=input()\r\nj=0\r\nfind=0\r\nfor i in range(len(s)) :\r\n if s[i]==ver[j] :\r\n j+=1\r\n find+=1\r\n if find==5 :\r\n break\r\nif find==5 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "s = input()\r\nhello = [\"o\", \"l\", \"l\", \"e\", \"h\"]\r\nfor i in s:\r\n if len(hello) > 0:\r\n if i == hello[-1]:\r\n hello.pop()\r\n else:\r\n break\r\nif len(hello) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nt=\"\"\r\nn = \"hello\"\r\nfor i in s:\r\n if ((i not in t) and(i == \"h\")):\r\n t += i\r\n\r\n elif ((\"h\" == t) and(i == \"e\")):\r\n t += i\r\n\r\n elif ((\"he\" == t) and(i == \"l\")):\r\n t += i\r\n\r\n elif ((\"hel\" == t) and(i == \"l\") ):\r\n t += i\r\n\r\n elif ((\"hell\" == t) and(i == \"o\")):\r\n t += i\r\n\r\n break\r\n elif (\"hello\" == t):\r\n break\r\nif (t == \"hello\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ex = ['h', 'e', 'l', 'l' , 'o']\r\nn = input()\r\nans = str()\r\nfor i in n:\r\n if len(ex) <= 0:\r\n break\r\n else:\r\n ans = \"NO\"\r\n if i == ex[0]:\r\n ex.pop(0)\r\nif len(ex) == 0:\r\n ans = \"YES\"\r\nprint(ans)", "s = list(input())\r\n\r\nfinal = list('hello')\r\n\r\nwhile len(s) > 0 and len(final) > 0:\r\n c = s.pop(0)\r\n if c == final[0]:\r\n final.pop(0)\r\n\r\nif not final:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\n\r\ncount = 0\r\n\r\nfor h in range(len(s)):\r\n if s[h] == 'h':\r\n count += 1\r\n break\r\n\r\nfor e in range(h, len(s)):\r\n if s[e] == 'e':\r\n count += 1\r\n break\r\n\r\nfor l in range(e, len(s)):\r\n if s[l] == 'l':\r\n count += 1\r\n break\r\n\r\nfor l in range(l+1, len(s)):\r\n if s[l] == 'l':\r\n count += 1\r\n break\r\n\r\nfor o in range(l, len(s)):\r\n if s[o] == 'o':\r\n count += 1\r\n break\r\n\r\nif count == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a = input()\r\nhello = \"hello\"\r\ncount = 0\r\nmissing = True\r\nx = 0\r\nwhile x < len(a) and missing:\r\n if a[x] == hello[count]:\r\n count += 1\r\n if count == 5:\r\n print(\"YES\")\r\n missing = False\r\n x += 1\r\nif missing:\r\n print(\"NO\")", "def has(string, txt):\r\n pointer = 0\r\n for i in range (len(txt)):\r\n if txt[i]==string[pointer]:\r\n pointer+=1\r\n if pointer >= len(string):\r\n return True\r\n return False\r\n\r\ninp = input()\r\n\r\nif has(\"hello\", inp):\r\n print (\"YES\")\r\nelse:\r\n print(\"NO\")", "msg = input()\r\n\r\ntry:\r\n pos = 0\r\n \r\n h = 0\r\n while h == 0:\r\n if msg[pos] == 'h':\r\n h += 1\r\n pos += 1\r\n \r\n e = 0\r\n while e == 0:\r\n if msg[pos] == 'e':\r\n e += 1\r\n pos += 1\r\n\r\n l = 0\r\n while l == 0:\r\n if msg[pos] == 'l':\r\n l += 1\r\n pos += 1\r\n\r\n l = 0\r\n while l == 0:\r\n if msg[pos] == 'l':\r\n l += 1\r\n pos += 1\r\n\r\n o = 0\r\n while o == 0:\r\n if msg[pos] == 'o':\r\n o += 1\r\n pos += 1\r\n\r\n print('YES')\r\n\r\nexcept:\r\n print('NO')\r\n", "b='hello'\r\nn=input()\r\nc=0\r\np=0\r\nfor i in range(len(n)):\r\n if(n[i]==b[c]):\r\n c+=1\r\n p+=1\r\n if(p==5):\r\n break;\r\nif(p==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\nhello = \"hello\"\nindex = 0\n \nfor char in s:\n if char == hello[index]:\n index += 1\n if index == 5:\n break\n \nif index == 5:\n print(\"YES\")\nelse:\n print(\"NO\")# your code goes here", "s = input()\r\nname = \"hello\"\r\n \r\nk = l = 0\r\nwhile k < len(s) and l < len(name):\r\n if s[k] == name[l]:\r\n l += 1\r\n k += 1\r\n \r\nif l == len(name):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=str(input())\r\nh=s.find('h')\r\nif(h<0):\r\n print(\"NO\")\r\nelse:\r\n e=s.find('e',h+1)\r\n if(e<0):\r\n print(\"NO\")\r\n else:\r\n l1=s.find('l',e+1)\r\n if(l1<0):\r\n print(\"NO\")\r\n else:\r\n l2=s.find('l',l1+1)\r\n if(l2<0):\r\n print(\"NO\")\r\n else:\r\n o=s.find('o',l2+1)\r\n if(o<0):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "s=input()\r\n\r\nsh='hello'\r\nc=0\r\nfor i in range(len(s)):\r\n if c<5:\r\n if s[i]==sh[c]:\r\n c+=1\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\na=\"hello\"\r\ni=0\r\nfor c in s:\r\n if(i==5):\r\n break\r\n elif(c==a[i]):\r\n i+=1\r\nif(i==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the input word\r\ns = input()\r\n\r\n# Define the word \"hello\" and initialize the index\r\nword = \"hello\"\r\nindex = 0\r\n\r\n# Iterate through the characters of s\r\nfor char in s:\r\n # If the current character matches the expected character\r\n if char == word[index]:\r\n index += 1\r\n \r\n # If we have matched all the expected characters\r\n if index == len(word):\r\n break\r\n\r\n# Print the result based on whether all the expected characters were matched\r\nif index == len(word):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\r\na = ''\r\nc = 0\r\nfor i in range(len(n)):\r\n if n[i] == 'h' and c == 0:\r\n a += 'h'\r\n c += 1\r\n if n[i] == 'e' and c == 1:\r\n a += 'e'\r\n c += 1\r\n if n[i] == 'l' and c in [2, 3]:\r\n a += 'l'\r\n c += 1\r\n if n[i] == 'o' and c == 4:\r\n a += 'o'\r\n c += 1\r\nprint(\"YES\" if a == 'hello' else \"NO\")", "from collections import Counter\r\n\r\ns=input()\r\ncnt=0\r\nj=0\r\nst=['h','e','l','l','o']\r\nfor i in range(0,len(s)):\r\n if(cnt==5):\r\n break\r\n if(s[i] not in st):\r\n # print(s[i])\r\n continue\r\n \r\n if (s[i]==st[j]):\r\n # print(i,j)\r\n cnt=cnt+1\r\n j=j+1\r\n \r\n elif(s[i]==s[i-1]):\r\n continue\r\n else:\r\n if(s[i] in st):\r\n continue\r\n else:\r\n break\r\n \r\nif (cnt==5):\r\n print('YES')\r\n\r\nelse:\r\n print('NO')\r\n \r\n ", "istring1 = input()\r\nistring = []\r\nfor h in istring1:\r\n istring.append(h)\r\n\r\nhello = 'hello'\r\n\r\ni = 0\r\nif len(istring) >= 5:\r\n for _ in hello:\r\n while True:\r\n if len(istring) < 5:\r\n break\r\n elif i == 5:\r\n break\r\n elif _ == istring[i]:\r\n i += 1\r\n break\r\n else:\r\n del istring[i]\r\n\r\n if i != 5:\r\n print('NO')\r\n else:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')\r\n", "string=input()\r\nanswer=''\r\nword='hello'\r\nindex=0\r\nfor i in string:\r\n if i==word[index]:\r\n index+=1\r\n if index==5:\r\n print(\"YES\")\r\n break\r\nif index!=5:\r\n print(\"NO\")\r\n \r\n \r\n", "s1=str(input())\r\ns2=\"hello\"\r\nc=\"\"\r\nfor i in range(len(s2)):\r\n for j in range(len(s1)):\r\n if s2[i]==s1[j]:\r\n c+=s1[j]\r\n s1=s1.replace(s1[j],'*',1)\r\n break\r\n else:\r\n s1=s1.replace(s1[j],'*',1)\r\nif c==s2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nmatch = \"hello\"\r\nmI = 0\r\nfor i in range(0,len(s)):\r\n\tif (s[i] == match[mI]):\r\n\t\tmI += 1\r\n\t\tif (mI >= len(match) ):\r\n\t\t\tbreak\r\nif (mI >= len(match)):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "import sys,math\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input().lower()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\na=insr()\r\nj=0\r\nword=\"hello\"\r\nfor i in range(len(a)):\r\n if a[i]==word[j]:\r\n j+=1\r\n if j==5:\r\n break\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def manage(s,st):\r\n j=0\r\n for i in s:\r\n if i==st[j]:\r\n j+=1\r\n if j==5:\r\n return True\r\n return False\r\ns=input()\r\nst=\"hello\"\r\nprint(\"YES\" if manage(s,st) else \"NO\")", "# -*- coding: utf-8 -*-\r\n\r\nl = ['h', 'e', 'l', 'l', 'o']\r\nidx = 0\r\nfor s in input():\r\n if s == l[idx]:\r\n idx += 1\r\n if idx >= 5: break\r\nif idx >= 5: print('YES')\r\nelse: print('NO')\r\n", "k = 0\ns = \"hello\"\na = input()\nfor l in a:\n if l == s[k]:\n k += 1\n if k == len(s):\n break\nif k == len(s):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "word_to_find = \"hello\"\r\n\r\ns = input()\r\ncounter = 0\r\nhas_word = False\r\n\r\nfor char in s:\r\n if char == word_to_find[counter]:\r\n counter+=1\r\n if counter == 5:\r\n has_word = True\r\n break\r\n\r\nif has_word:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "t = 'hello'\r\ni = 0\r\ns = input()\r\nfor j in s:\r\n if j == t[i]:\r\n i+=1\r\n if i == 5 :\r\n break\r\nprint(\"YES\" if i ==5 else \"NO\")", "word = input()\r\n\r\nhello = \"hello\"\r\n\r\nfor char in word:\r\n if len(hello) > 0:\r\n if char == hello[0]:\r\n hello = hello[1:]\r\n\r\nif not hello:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\ntest=\"hello\"\nindex=0\nfor i in s:\n\tif i==test[index]:\n\t\tindex+=1\n\t\tif index==5:\n\t\t\tbreak\nif index==5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "a = input()\r\n\r\nh = 0\r\ne = 0\r\nl = 0\r\no = 0\r\nstart = 1\r\nend = 1\r\n\r\nfor i in range(0, len(a)):\r\n \r\n if a[i] == 'h' and start == 1:\r\n h += 1\r\n start = 0\r\n\r\n if h > 0 and a[i] == 'e':\r\n e += 1\r\n\r\n if e > 0 and a[i] == 'l':\r\n l += 1\r\n\r\n if l > 1 and a[i] == 'o':\r\n o += 1\r\n end = 0\r\n \r\n if o > 0 and end == 0:\r\n print('YES')\r\n break\r\n \r\nif h < 1 or e < 1 or l < 2 or o < 1:\r\n print('NO')\r\n ", "test = \"hello\"\r\ndef check():\r\n index = 0 #pointer\r\n s = input()\r\n for i in range(len(s)):\r\n if s[i] == test[index]:\r\n index += 1\r\n if index == 5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(check())", "s = input()\r\nslen = len(s)\r\ncheck = False\r\nfor i in range(slen):\r\n if s[i] == 'h':\r\n for j in range(i+1,slen):\r\n if s[j] == 'e':\r\n for g in range(j+1,slen):\r\n if s[g] == 'l':\r\n for h in range(g+1,slen):\r\n if s[h] == 'l':\r\n for f in range(h+1,slen):\r\n if s[f] == 'o':\r\n check = True\r\n break\r\n else:\r\n check == False\r\n else:\r\n check == False\r\n else:\r\n check == False\r\n else:\r\n check == False\r\n else:\r\n check == False\r\n else:\r\n check == False\r\n \r\n \r\n \r\n\r\nif check:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a = input(\"\")\r\nc = \"\"\r\ne = \"hello\"\r\nw = 0\r\nfor i in a:\r\n if i == e[w]:\r\n c += i\r\n w += 1\r\n if w == 5:\r\n break\r\nd = [\"NO\", \"YES\"]\r\nprint(d[c == \"hello\"])\r\n", "s = input()\r\n\r\ni = 0\r\na = ['h', 'e', 'l', 'l', 'o']\r\n\r\nwhile (i < 5) and (i < len(s)):\r\n if a[i] == s[i]:\r\n i += 1\r\n else:\r\n s = s[:i] + s[i + 1:]\r\n\r\nprint('YES' if 'hello' in s else 'NO')", "import string\r\ni=lambda:map(int,input().split());\r\ns1=input();\r\nn=len(s1);\r\n\r\ns2=\"hello\";\r\nl=0;\r\nk=0\r\nwhile (l<5)&(k<n):\r\n if s1[k]==s2[l]:\r\n l+=1\r\n k=k+1;\r\n\r\nif(l==5):\r\n print(\"YES\");\r\nelse:\r\n print(\"NO\")", "\"\"\"Copyright © 2021 Rishabh Rao.\r\nAll Rights Reserved.\"\"\"\r\n\r\nimport sys\r\nMOD = 1000000007\r\ninp = sys.stdin.readline\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\ns = inp()\r\nhello = \"hello\"\r\nj = 0\r\nfor i in range(len(s)):\r\n if s[i] == hello[j]:\r\n j += 1\r\n if j == 5:\r\n break\r\nprint(\"YES\" if j == 5 else \"NO\")\r\n", "w = input()\r\nh = w.find('h')\r\ne = w.find('e',h)\r\nl = w.find('l',e)\r\nll = w.find('l',l+1)\r\no = w.find('o',ll)\r\nif h<e<l<ll<o:\r\n print('YES')\r\nelse:\r\n print('NO')", "ans=\"NO\"\r\ns=input()\r\nfor i in range(len(s)-4):\r\n a=s.find('h')\r\n if a>-1:\r\n b=s.find('e',a)\r\n if b>-1:\r\n c=s.find('l',b)\r\n if c>-1:\r\n d=s.find('l',c+1)\r\n if d>-1:\r\n e=s.find('o',d)\r\n if e>-1:\r\n ans=\"YES\"\r\nprint(ans)", "s = input()\r\nfor t in \"hello\":\r\n if t in s:\r\n s = s[s.find(t)+1:]\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "s = input().lower()\r\nlos = list(s)\r\nloh = []\r\nif los.count('h') != 0:\r\n ih = los.index('h')\r\n x = 0\r\n while x < ih:\r\n los.remove(los[0])\r\n x += 1\r\n loh.append(los[0]) \r\nif los.count('e') != 0:\r\n ie = los.index('e')\r\n x = 0\r\n while x < ie:\r\n los.remove(los[0])\r\n x += 1\r\n loh.append(los[0])\r\nif los.count('l') != 0:\r\n il = los.index('l')\r\n x = 0\r\n while x < il:\r\n los.remove(los[0])\r\n x += 1\r\n loh.append(los[0])\r\n los.remove(los[0])\r\nif los.count('l') != 0:\r\n il = los.index('l')\r\n x = 0\r\n while x < il:\r\n los.remove(los[0])\r\n x += 1\r\n loh.append(los[0])\r\nif los.count('o') != 0:\r\n io = los.index('o')\r\n x = 0\r\n while x < io:\r\n los.remove(los[0])\r\n x += 1\r\n loh.append(los[0])\r\nf = \"\".join(loh)\r\nif f == 'hello':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "s=\"hello\"\r\ns2=input()\r\ni=0\r\nfor ch in s2:\r\n\tif i<len(s) and ch==s[i]:\r\n\t\ti=i+1\r\nif i==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\t", "string = input()\r\nsearch = 0\r\nfor i in string:\r\n if search == 5:\r\n break\r\n elif search == 0 and i == \"h\":\r\n search += 1\r\n elif search == 1 and i == \"e\":\r\n search += 1\r\n elif search == 2 and i == \"l\":\r\n search += 1\r\n elif search == 3 and i == \"l\":\r\n search += 1\r\n elif search == 4 and i == \"o\":\r\n search += 1\r\nprint(\"YES\") if search == 5 else print(\"NO\")\r\n\r\n\r\n\r\n", "def vasya_says_hello(s):\r\n hello = \"hello\"\r\n hello_index = 0\r\n\r\n for char in s:\r\n if char == hello[hello_index]:\r\n hello_index += 1\r\n if hello_index == len(hello):\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\ninput_word = input()\r\noutput_result = vasya_says_hello(input_word)\r\nprint(output_result)\r\n", "word = input()\r\nhello_word = [\"h\", \"e\", \"l\", \"o\"]\r\nformed_hello = \"\"\r\ni = 0\r\n\r\nfor s in word:\r\n if i >3:\r\n break\r\n if s == hello_word[i]:\r\n if i != 2:\r\n formed_hello += s\r\n i += 1\r\n elif i == 2:\r\n if(formed_hello.count(\"l\") == 1):\r\n i+=1\r\n formed_hello += s\r\n \r\n \r\n\r\nif formed_hello == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "a=input()\r\nb='hello '\r\nr=0\r\nfor x in a:r+=x==b[r]\r\nprint('YNEOS'[r<5::2])", "pre = \"hello\"\r\np = 0\r\ns = input()\r\nfor i in s:\r\n if i == pre[p]:\r\n p += 1\r\n if p == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\n\r\ndef find_ss(string,letter):\r\n if letter in string:\r\n index=string.index(letter)\r\n return True,string[index+1:]\r\n else:\r\n return False,string\r\n\r\n\r\nstring = sys.stdin.readline()\r\nans=\"NO\"\r\n\r\nfor count,i in enumerate(['h','e','l','l','o']):\r\n status,string = find_ss(string,i)\r\n\r\n if not status:\r\n break\r\n \r\n if count==4:\r\n ans = \"YES\"\r\n\r\nsys.stdout.write(ans)\r\n\r\n", "s = input()\r\norig = 'hello'\r\ni = 0\r\nj = 0\r\nl = len(s)\r\nwhile i<l:\r\n if s[i] == orig[j]:\r\n j = j+1\r\n i = i+1\r\n if(j==5):\r\n break\r\nif j==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nhello = \"hello\"\r\ncounter = 0\r\nfor i in s:\r\n if i == hello[counter]:\r\n counter += 1\r\n if i == 'o':\r\n break\r\nif counter < len(hello):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import re\npat=r'.*h.*e.*l.*l.*o.*'\nprint('NO' if re.findall(pat, input()) == [] else 'YES')", "n=input()\r\n\r\nstr='hello'\r\nj=0\r\ncount=0\r\nfor i in range(len(n)):\r\n if(n[i]==str[j]):\r\n j+=1;\r\n count+=1;\r\n if(count==5):\r\n break;\r\nif(count==5):\r\n print('YES')\r\nelse:\r\n print('NO')", "s=iter(input())\r\nif all([i in s for i in 'hello']):\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nmeow = ['h', 'e', 'l', 'l', 'o', '/']\r\nindex = 0\r\n\r\nfor i in a:\r\n\tif i == meow[index]:\r\n\t\tindex += 1\r\n\r\nif index==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "s = input()\r\nres = ''\r\nfor i in s:\r\n if i == 'h' and 'h' not in res:\r\n res += 'h'\r\n elif i == 'e' and res == 'h':\r\n res += \"e\"\r\n elif i == 'l' and res == 'he':\r\n res += 'l'\r\n elif i == 'l' and res == 'hel':\r\n res += 'l'\r\n elif i == 'o' and res == 'hell':\r\n res += 'o'\r\nif res == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input().lower()\r\nl = ['h','e','l','l','o']\r\nj = 0\r\nfor i in s:\r\n if j<5 and l[j]==i:\r\n j += 1\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- 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\ncount = 0\n \nfor i in s:\n if i == \"h\" and count == 0:\n count+=1\n elif i == \"e\"and count == 1:\n count+=1\n elif i == \"l\" and count == 2:\n count+=1\n elif i == \"l\" and count == 3:\n count+=1\n elif i == \"o\" and count == 4:\n count+=1\nif count == 5:\n print(\"YES\")\nelse:\n print(\"NO\")", "letters = ['h','e','l','l','o']\r\nd = [x for x in input() if(x in letters)]\r\n#d = list(filter(lambda x:x in letters, d))\r\ncheck = []\r\ni = 0\r\nfor x in d:\r\n if(x==letters[i]):\r\n check.append(x)\r\n i+=1\r\n if(len(check)==5):\r\n break\r\nif(check==letters):\r\n print('YES')\r\nelse:\r\n print('NO')", "h,ii=list(\"hello\"),0\r\n\r\ns=list(input())\r\nfor i in range(len(s)):\r\n if (s[i]==h[ii]):\r\n ii+=1\r\n if (ii==5):\r\n break\r\n # elif(s[i]==h[ii-1]): \r\n # continue\r\n # else:\r\n # ii=0\r\n\r\nif(ii==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nl = list(\"hello\")\r\nfor i in a:\r\n\tif l:\r\n\t\tif i == l[0]:\r\n\t\t\tl.pop(0)\r\n\telse:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\nif not(l):\r\n\tprint(\"YES\")\r\n\texit()\r\nprint(\"NO\")", "word = \"hello\"\r\nindex = 0\r\ninp = input()\r\ncan = False\r\nfor l in inp:\r\n if l == word[index]:\r\n if index == 4:\r\n can = True\r\n break\r\n index += 1\r\nif can:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s = input().strip()\r\npointer = 0\r\nfor letter in s: \r\n if letter == \"hello\"[pointer]:\r\n pointer += 1\r\n if pointer == 5:\r\n print(\"YES\")\r\n break\r\nif pointer != 5:\r\n print(\"NO\")", "a=input()\r\nif 'h' in a:\r\n a=a[a.index('h')+1:]\r\n if 'e' in a:\r\n a=a[a.index('e')+1:]\r\n if 'l' in a:\r\n a=a[a.index('l')+1:]\r\n if 'l' in a:\r\n a=a[a.index('l')+1:]\r\n if 'o' in a:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "typing = input()\r\n\r\ndef solve():\r\n i = 0\r\n for c in 'hello':\r\n while i < len(typing) and typing[i] != c:\r\n i += 1\r\n i += 1\r\n if i > len(typing):\r\n return 'NO'\r\n return 'YES'\r\n\r\nprint(solve())", "s=input()\r\nl=['h','e','l','l','o']\r\na=l[0]\r\nk=0\r\nc=0\r\nm=0\r\nfor i in range(len(s)):\r\n if s[i]==a:\r\n c=c+1\r\n k=k+1\r\n if c==5:\r\n m=1\r\n break\r\n a=l[k]\r\nif m==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "'''\r\nn,m,a=map(int, input(\"\").split())\r\nx=0\r\ny=0\r\n\r\nif n%a==0:\r\n x=int(n/a)\r\nelse:\r\n x=int((n/a)+1)\r\n\r\nif m%a==0:\r\n y=int(m/a)\r\nelse:\r\n y=int((m/a)+1)\r\n\r\nprint(x*y)\r\n'''\r\n\r\n'''\r\nwords = []\r\n\r\nn = int(input(\"\"))\r\n\r\nfor i in range(n):\r\n word=input(\"\")\r\n\r\n if len(word)>10:\r\n words.append(str(word[0]+str(len(word)-2)+word[-1]))\r\n\r\n else:\r\n words.append(word)\r\n\r\nfor j in words:\r\n print(j)\r\n'''\r\n'''\r\nn,k=map(int,input(\"\").split())\r\n\r\npoints = list(map(int, input(\"\").split(' ', n)))\r\n\r\ncounter=0\r\nfor point in points:\r\n if point>=points[k-1] and point!=0:\r\n counter+=1\r\n\r\nprint(counter)\r\n'''\r\n'''\r\nn = int(input(\"\"))\r\n\r\nproblems = []\r\n\r\nfor i in range(n):\r\n problems.append(list(map(int, input(\"\").split(' '))))\r\n\r\ncounter=0\r\n\r\nfor problem in problems:\r\n if problem.count(1)>=2:\r\n counter+=1\r\n\r\nprint(counter)\r\n'''\r\n\r\nmsg=input(\"\")\r\n\r\nword=['h','e','l','l','o']\r\n\r\nindex=0\r\ncounter=0\r\n\r\nfor i in msg:\r\n if i==word[index]:\r\n index+=1\r\n counter+=1\r\n if counter==len(word):\r\n break\r\n\r\nif counter==len(word):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def search(a,name):\r\n for i in range(len(a)):\r\n if(a[i] == name):\r\n a = a[i+1:]\r\n return 1,a\r\n return 0,a\r\na = input()\r\nx = 0\r\nl1 = 0\r\nh,a = search(a,\"h\")\r\ne,a = search(a,\"e\")\r\nl,a = search(a,\"l\")\r\nl1,a =search(a,\"l\")\r\no,a = search(a,\"o\")\r\nif(h == e == l == l1 == o ==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ns0='hello'\r\ni=0\r\nfor c in s:\r\n\tif c==s0[i]:\r\n\t\ti=i+1\r\n\tif i==5:\r\n\t\tbreak\r\nif i==5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\t\r\n", "import sys\r\ntemp = input()\r\nhello = ['h', 'e', 'l', 'l', 'o']\r\ncounter = 0\r\nfor i in temp:\r\n\tif i == hello[counter]:\r\n\t\tcounter += 1\r\n\t\t\r\n\tif counter == 5:\r\n\t\tprint('YES')\r\n\t\tsys.exit()\r\nprint('NO')", "str = input()\r\nn = 0\r\nj = ['h','e','l','l','o']\r\nfor i in range(len(str)):\r\n if(str[i] == j[n]):\r\n n += 1\r\n if(n == 5):\r\n break\r\nif(n == 5):\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "s = input()\r\nletter = 0\r\nword = \"hello\"\r\nfor i in range(len(s)):\r\n if s[i] == word[letter]:\r\n letter += 1\r\n if letter == len(word):\r\n break\r\nif letter == len(word):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input().strip()\r\ns='hello'\r\nc=0\r\nfor i in a:\r\n if i==s[c]:\r\n c+=1\r\n if c==5:\r\n break\r\nif c==len(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = list('hello')\r\nchword = list(input())\r\nfor i in word:\r\n if i in chword:\r\n chword = chword[chword.index(i)+1:]\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "s=str(input())\r\nif \"h\" not in s:\r\n print(\"NO\")\r\nelse:\r\n h1=s.index(\"h\")\r\n s1=s[h1:]\r\n if \"e\" not in s1:\r\n print(\"NO\")\r\n else:\r\n e1=s1.index(\"e\")\r\n s2=s1[e1:]\r\n if \"l\" not in s2:\r\n print(\"NO\")\r\n else:\r\n l1=s2.index(\"l\")\r\n s3=s2[l1+1:]\r\n if \"l\" not in s3:\r\n print(\"NO\")\r\n else:\r\n l2=s3.index(\"l\")\r\n s4=s3[l2:]\r\n if \"o\" in s4:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s = input()\r\nn= len (s)\r\ni,h,e,l,o=0,0,0,0,0\r\nwhile i <n:\r\n if s[i]=='h':\r\n h+=1\r\n i+=1\r\n break\r\n else: i+=1\r\nwhile i <n:\r\n if s[i]=='e':\r\n e+=1\r\n i+=1\r\n break\r\n else: i+=1\r\nwhile i <n:\r\n if s[i]=='l':\r\n l+=1\r\n i+=1\r\n else: i+=1\r\n if l == 2: break\r\nwhile i <n:\r\n if s[i]=='o':\r\n o+=1\r\n i+=1\r\n break\r\n else: i+=1\r\nif h==1 and e==1 and l==2 and o==1:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n \r\n", "a = input()\r\nb = \"hello\"\r\nc1 = 0\r\nc2 = 0\r\nans = \"NO\"\r\nwhile c1 < len(a) and c2 < len(b) :\r\n if a[c1] == b[c2] :\r\n c2 += 1\r\n c1 += 1\r\nif c2 == len(b) :\r\n ans = \"YES\"\r\nprint(ans)", "def main():\r\n hello = ['h', 'e', 'l','l', 'o']\r\n opr = input()\r\n n = 0\r\n for i in range(0, len(opr)):\r\n a=hello[n]\r\n if a == opr[i]:\r\n n = n + 1\r\n if n == 5:\r\n break\r\n if n == 5:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a=input()\r\nb='hello'\r\ni=0\r\nfor j in a:\r\n \r\n if j==b[i]:\r\n i+=1\r\n \r\n if i==5:\r\n print('YES')\r\n break\r\n \r\n\r\nif i!=5:\r\n print('NO')\r\n\r\n\r\n", "compareStr = \"hello\"\r\nstring = input()\r\n\r\ncount = 0\r\nfor char in string:\r\n if char == compareStr[count]:\r\n count += 1\r\n if count == 5:\r\n break\r\n \r\n\r\nif count == 5:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "s = input()\nif s.find('h') < s.find('e', s.find('h')+1) <\\\n s.find('l', s.find('e', s.find('h')+1)+1) < \\\n s.find('l', s.find('l', s.find('e', s.find('h')+1)+1)+1) < \\\n s.find('o', s.find('l', s.find('l', s.find('e', s.find('h')+1)+1)+1)+1):\n print('YES')\nelse:\n print('NO')\n", "lst=['h','e','l','l','o']\r\ns=input()\r\nindex=0\r\nindi=0\r\nwhile index!=5:\r\n if lst[index]==s[indi]:\r\n index+=1\r\n indi+=1\r\n if indi==len(s):\r\n break\r\nif index==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\"\"\"\r\nProblem: http://codeforces.com/problemset/problem/58/A\r\n\"\"\"\r\n\r\ndef solve():\r\n string = input()\r\n\r\n hello = \"hello\"\r\n cur_c = 0\r\n for c in string:\r\n if(cur_c < 5 and c == hello[cur_c]):\r\n cur_c += 1\r\n\r\n if(cur_c == 5):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == '__main__':\r\n solve()", "s=input()\n\nt=\"hello\"\n\nm=len(s)\n\nn=len(t)\n\ni=0\n\nj=0\n\nwhile j<n and i<m :\n if s[i]==t[j] :\n j=j+1\n i=i+1\n\nif j==n :\n flag=1\nelse :\n flag=0\n\nif flag==0 :\n print(\"NO\")\nelse :\n print(\"YES\")\n\n\n \n", "str= \"hello\"\r\ndef chatRoom():\r\n m = 0\r\n str1 = input()\r\n for i in range(len(str1)):\r\n if str1[i] == str[m]:\r\n m+= 1\r\n if m == 5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chatRoom())\r\n\r\n\r\n", "n = input()\r\nc = 0\r\nx = 'hello'\r\nfor i in n:\r\n if i == x[c]:\r\n c += 1\r\n if c >= 5:\r\n break\r\nif c == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nh = \"hello\"\r\nct, j = 0, 0\r\nfor i in range(len(s)):\r\n if s[i] == h[j]:\r\n ct += 1; j += 1\r\n if j > 4: break\r\nprint(\"YES\" if ct == 5 else \"NO\")\r\n", "str1=input(\"\").lower()\r\ncon1,con2,con3,con4,con5=False,False,False,False,False\r\nx=str1.find(\"h\")\r\nif x!=-1:\r\n con1=True\r\n x=str1[x+1:]\r\n # print(x)\r\nif con1==True:\r\n y=str(x).find(\"e\")\r\n if y!=-1:\r\n con2=True\r\n y=x[y+1:]\r\n # print(y)\r\nif con2 == True:\r\n z=str(y).find(\"l\")\r\n if z!=-1:\r\n con3=True\r\n z=y[z+1:]\r\n # print(z)\r\nif con3 == True:\r\n w=str(z).find(\"l\")\r\n if w != -1:\r\n con4 = True\r\n w=z[w+1:]\r\n # print(w)\r\nif con4 == True:\r\n q=str(w).find(\"o\")\r\n if q != -1:\r\n con5 = True\r\nif con1 == True and con2 == True and con3 == True and con4 == True and con5 == True:\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")", "s = list(input())\r\ntry:\r\n p = s.index(\"h\")\r\n s.remove(\"h\")\r\n s = s[p:]\r\n\r\n p = s.index(\"e\")\r\n s.remove(\"e\")\r\n s = s[p:]\r\n\r\n p = s.index(\"l\")\r\n s.remove(\"l\")\r\n s = s[p:]\r\n\r\n p = s.index(\"l\")\r\n s.remove(\"l\")\r\n s = s[p:]\r\n\r\n p = s.index(\"o\")\r\n s.remove(\"o\")\r\nexcept:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "a=['h','e','l','l','o']\r\nb=input()\r\nc=len(b)\r\nd=list(b)\r\ne=0\r\nfor i in range(c):\r\n\tif d[i] ==a[e]:\r\n\t\te=e+1\r\n\t\tif e==5:\r\n\t\t\tprint('YES')\r\n\t\t\tbreak\r\nif e != 5:\r\n\tprint('NO')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nw = list('hello')\r\ns = input()[:-1]\r\nfor i in s:\r\n if i == w[0]:\r\n w.pop(0)\r\n if len(w) == 0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "\r\n\r\na=input()\r\nh=int(a.find('h'))\r\ne=int(a.find('e',h+1))\r\nl1=int(a.find('l',e+1))\r\nl2=int(a.find('l',l1+1))\r\no=int(a.find('o',l2+1))\r\nx=h<e<l1<l2<o\r\nif x==True:\r\n print('YES')\r\nelse:\r\n print('NO')", "def check(l):\r\n if len(l)<5 or -1 in l:\r\n print(\"NO\")\r\n return 0\r\n flag = 0\r\n i = 1\r\n while i < len(l):\r\n if(l[i] < l[i - 1]):\r\n flag = 1\r\n i += 1\r\n \r\n if (not flag) :\r\n print (\"YES\")\r\n return 0\r\n else :\r\n print (\"NO\")\r\n return 0\r\n\r\n\r\n\r\ntemp = input()\r\nst = temp.lower()\r\n#print(s)\r\nl = []\r\n\r\nf = st.find('h') \r\nl.append(f)\r\n\r\ns = st.find('e',f+1) \r\nl.append(s)\r\n\r\nt = st.find('l',s+1) \r\nl.append(t)\r\n\r\nfo = st.find('l',t+1) \r\nl.append(fo)\r\n\r\nfi = st.find('o',fo+1) \r\nl.append(fi)\r\n\r\n\r\n#print(l)\r\ncheck(l)\r\n\r\n ", "x=input()\r\nword=''\r\ncounter = 0\r\nfor i in range (len(x)-counter):\r\n counter= counter +1\r\n if x[counter-1] == 'h':\r\n word=word+x[i]\r\n\r\n break\r\nfor i in range (len(x)-counter):\r\n counter= counter +1\r\n if x[counter-1] == 'e':\r\n word=word + 'e'\r\n\r\n break\r\nfor i in range (len(x)-counter):\r\n counter= counter + 1\r\n if x[counter-1] == 'l':\r\n word=word + 'l'\r\n\r\n break\r\nfor i in range (len (x)-counter):\r\n counter=counter+1\r\n if x[counter-1] == 'l':\r\n word=word + 'l'\r\n\r\n break\r\nfor i in range (len (x)-counter):\r\n counter=counter + 1\r\n if x[counter-1] == 'o':\r\n word=word + 'o'\r\n\r\n break\r\n\r\n\r\nif word == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nl=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nj=0\r\ni=0\r\nf=False\r\nwhile i<len(s):\r\n if s[i]==l[j]:\r\n #print(i,s[i])\r\n if j==4:\r\n f=True\r\n break\r\n j=j+1\r\n i=i+1\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=iter(input());print('NYOE S'[all(f in s for f in'hello')::2])", "import math\r\n\r\ndef main():\r\n s = list(input())\r\n h = list('hello')\r\n i = 0\r\n c = 0\r\n a = []\r\n while i <= len(s) - 1 and c <= 4:\r\n if s[i] == h[c]:\r\n a.append(s[i])\r\n i += 1\r\n c += 1\r\n\r\n else:\r\n i += 1\r\n print(\"YES\" if a == h else \"NO\")\r\n\r\n\r\n\r\n\r\nmain()", "s = input()\r\npattern = 'hello'\r\nidx = 0\r\nfor i in s :\r\n if i == pattern[idx] :\r\n idx += 1\r\n if idx >= 5 :\r\n print('YES')\r\n break\r\nelse :\r\n print('NO')", "s=input()\r\na='hello'\r\nfor i in s:\r\n if a==\"\":\r\n print(\"YES\")\r\n break\r\n elif i == a[0]:\r\n a=a[1:]\r\nelse:\r\n print(\"YES\" if a==\"\" else \"NO\")\r\n\r\n\r\n\r\n", "s = (input())\r\ni=0\r\nj=0\r\ns2 = \"hello\"\r\nboole = True\r\nwhile(i<len(s)):\r\n if(j==5):\r\n break\r\n if(s[i]==s2[j]):\r\n j+=1\r\n i+=1\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "A=list(input())\r\nFlag=False\r\nL=['h','e','l','l','o']\r\nk=0\r\ni=0\r\nwhile k!=5 and i!=len(A):\r\n if A[i]==L[k]:\r\n k+=1\r\n i+=1 \r\nif k==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\nj=0\r\nfor i in range(len(n)):\r\n if n[i]=='h' and j==0:\r\n j+=1\r\n elif n[i]=='e' and j==1:\r\n j+=1\r\n elif n[i]=='l' and j==2:\r\n j+=1\r\n elif n[i]=='l' and j==3:\r\n j+=1\r\n elif n[i]=='o' and j==4:\r\n j+=1\r\nif j==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nhello = []\r\nif 'h' in s:\r\n hello.append('h')\r\n s = s[s.index('h')+1:]\r\nif 'e' in s:\r\n hello.append('e')\r\n s = s[s.index('e')+1:]\r\nif 'l' in s:\r\n hello.append('l')\r\n s = s[s.index('l')+1:]\r\nif 'l' in s:\r\n hello.append('l')\r\n s = s[s.index('l')+1:]\r\nif 'o' in s:\r\n hello.append('o')\r\nhello = ''.join(hello)\r\nif hello == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input();s=0;w='hello'\r\nprev=-1\r\nfor i in w:\r\n try:\r\n if prev> prev+ n.index(i): break \r\n except: break\r\n prev = n.index(i)\r\n n=n[prev+1:]\r\n s+=1\r\nprint('YES') if s==5 else print(\"NO\")", "s=input()\r\na=\"hello\"\r\nd=[]\r\nj=0\r\nc=0\r\nfor i in range(len(s)):\r\n if j!=5 and s[i]==a[j] :\r\n d.append(s[i])\r\n c+=1\r\n j+=1\r\n\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\n\r\nlst=['h','e','l','l','o']\r\n\r\n\r\nif len(n)<5:\r\n print(\"NO\")\r\nelse:\r\n l=[]\r\n c=0\r\n for i in n:\r\n l.append(i)\r\n j=0\r\n for i in l:\r\n if j<len(lst):\r\n if i == lst[j]:\r\n c+=1\r\n j+=1\r\n \r\n if c==5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "l=input()\nc=0\nfor i in range(len(l)):\n if(c==0 and l[i]=='h'):\n c=c+1\n elif(c==1 and l[i]=='e'):\n c=c+1\n elif(c==2 and l[i]=='l'):\n c=c+1\n elif(c==3 and l[i]=='l'):\n c=c+1\n elif(c==4 and l[i]=='o'):\n c=c+1\n else:\n continue\nif(c==5):\n print('YES')\nelse:\n print('NO')", "padrao = \"hello\"\r\n\r\ntexto = input()\r\n\r\ni = 0\r\nindex = 0\r\ndeslocamento = 0\r\n\r\nwhile i <= (len(texto) - 1):\r\n if texto[i] == padrao[index]:\r\n index += 1\r\n deslocamento += 1\r\n i += 1\r\n if deslocamento == 5:\r\n print(\"YES\")\r\n break\r\n\r\nif deslocamento < 5: print(\"NO\")", "s=input()\r\nl=['h','e','l','l','o']\r\nj=0\r\nfor i in range(len(s)):\r\n if s[i]==l[j]:\r\n j+=1\r\n if j==len(l):\r\n print(\"YES\")\r\n break\r\nif j!=len(l):\r\n print(\"NO\")", "t=input()\r\ns = \"hello\"\r\ni = 0\r\nfor char in t:\r\n if char == s[i]:\r\n i += 1\r\n if i == len(s):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "i = 0\r\nc = 0\r\nmy_string = 'hello'\r\nuser_string = input()\r\nfor j in range(len(user_string)):\r\n if user_string[j] == my_string[i]:\r\n c += 1 \r\n i += 1\r\n if c == 5 :\r\n break\r\nif c == 5 :\r\n print('YES')\r\nelse :\r\n print(\"NO\") ", "n = list(input())\r\n\r\na = \"hello\"\r\nx=0\r\nlst = []\r\nfor i in a:\r\n \r\n for j in n[x:]:\r\n if j != i:\r\n n.remove(j)\r\n else:\r\n lst.append(j)\r\n x+=1\r\n break\r\n \r\nres = ''.join(lst)\r\n\r\nif res == a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def parse_string(word):\r\n alphabet = ['h', 'e', 'l', 'l', 'o']\r\n parse = ''\r\n for b in word:\r\n if b in alphabet:\r\n parse += b\r\n return parse\r\n\r\n\r\ndef pretest(word):\r\n alphabet = ['h', 'e', 'l', 'l', 'o']\r\n position = []\r\n i = 0\r\n j = 0\r\n answer = ''\r\n while i < len(alphabet):\r\n letter = alphabet[i]\r\n while j < len(word):\r\n if word[j] == letter and (not j in position):\r\n answer += letter\r\n position.append(j)\r\n break\r\n j += 1\r\n i += 1\r\n return answer\r\n\r\nword = str(input())\r\n\r\nanswer = pretest(parse_string(word))\r\nif answer == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\n\r\nflag = 0\r\n\r\nfor i in \"hello\":\r\n try:\r\n s.index(i)\r\n s = s[s.index(i)+1:]\r\n except:\r\n flag = 1\r\n\r\nprint((\"YES\",\"NO\")[flag])", "s = input()\r\n\r\ntarget = \"hello\"\r\ntarget_index = 0\r\n\r\nfor char in s:\r\n if char == target[target_index]:\r\n target_index += 1\r\n if target_index == len(target):\r\n break\r\n\r\n\r\nif target_index == len(target):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "e=input()\r\nidex=0\r\nst=\"hello\"\r\nfor i in range (0,len(e)):\r\n\tif idex==5:\r\n\t\tbreak\r\n\tif e[i]==st[idex]:\r\n\t\tidex+=1\r\nif idex==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "t=input()\r\ns='hello'\r\ni=0\r\nc=0\r\nfor j in t:\r\n if(s[i]==j):\r\n i+=1\r\n if(i==len(s)):\r\n print('YES')\r\n c=1\r\n break\r\nif(c==0):\r\n print('NO')", "inp = input()\r\n\r\ntry:\r\n inp = inp[inp.index('h')+1:]\r\n inp = inp[inp.index('e')+1:]\r\n inp = inp[inp.index('l')+1:]\r\n inp = inp[inp.index('l')+1:]\r\n inp = inp[inp.index('o')+1:]\r\n print('YES')\r\nexcept:\r\n print('NO')\r\n", "z = 0\nm = input()\nls = ['h', 'e', 'l', 'l', 'o']\nfor i in range(len(m)):\n if len(ls) == 0:\n tm=\"YES\"\n break\n\n if ls[0] == m[i]:\n ls.remove(ls[0])\n\nif len(ls) == 0:\n tm = \"YES\"\n\nif len(ls) != 0:\n tm = \"NO\"\n\nprint(tm)\n", "import sys\ndef get_ints():return map(int,sys.stdin.readline().strip().split())\ndef single_ints():return int(sys.stdin.readline())\ndef p(a):return sys.stdout.write(a)\ns=sys.stdin.readline()\nmat=\"hello\"\ni=0\nfor x in s:\n if i<5:\n if mat[i]==x:\n i+=1\n else:\n break\nif i==5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n\t \t\t\t\t\t \t \t \t \t \t \t \t\t \t", "st = input().lower()\r\nh_find = st.find('h',)\r\ne_find = st.find('e',h_find+1)\r\nl_find = st.find('l',e_find+1)\r\nl2_find = st.find('l',l_find+1)\r\no_find = st.find('o',l2_find+1)\r\nst1 = st[h_find] + st[e_find] + st[l_find] + st[l2_find] + st[o_find]\r\nif st1 == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "# coding: utf-8\nimport re\np = re.compile('.*h.*e.*l.*l.*o.*')\ns = input()\nif p.match(s):\n print('YES')\nelse:\n print('NO')\n", "w=\"hello\"\r\nx=0\r\ns=input()\r\nfor i in range(len(s)):\r\n if s[i]==w[x]:\r\n x+=1\r\n if x==5:\r\n print(\"YES\")\r\n break\r\n \r\nelse:\r\n print(\"NO\")\r\n", "line = input()\r\nsen = []\r\nfor i in line:\r\n sen.append(i)\r\ncp = 0\r\nstd = 'hello'\r\nwhile(sen):\r\n if sen[0] == std[cp]:\r\n cp += 1\r\n sen.pop(0)\r\n if cp == 5:\r\n break\r\nif cp == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "word = \"hello\"\r\nx = input(\"\")\r\nfor n in range(5):\r\n f = False\r\n for k in range(len(x)):\r\n if word[n] == x[k]:\r\n x = x[k+1:]\r\n f = True\r\n break\r\n else:\r\n break\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nw=0\r\nq=0\r\nfor i in range(len(s)):\r\n if s[i]=='h':\r\n q=i\r\n w+=1\r\n break\r\ns=s[q+1:]\r\nfor i in range(len(s)):\r\n if s[i]=='e':\r\n q=i\r\n w+=1\r\n break\r\ns=s[q+1:]\r\nfor i in range(len(s)):\r\n if s[i]=='l':\r\n q=i\r\n w+=1\r\n break\r\ns=s[q+1:]\r\nfor i in range(len(s)):\r\n if s[i]=='l':\r\n q=i\r\n w+=1\r\n break\r\ns=s[q+1:]\r\nfor i in range(len(s)):\r\n if s[i]=='o':\r\n q=i\r\n w+=1\r\n break\r\nif w==5:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "s = input()\r\ndef search(s,ind):\r\n s1 = 'hello'\r\n if ind == 5:\r\n return \"YES\"\r\n for i in range(len(s)):\r\n if s[i] == s1[ind]:\r\n return search(s[i+1:], ind+1)\r\n return \"NO\"\r\nprint(search(s, 0))", "a = input()\r\nb = \"hello\"\r\nj = 0\r\ns = 0\r\nfor i in range(len(a)):\r\n if a[i]==b[j]:\r\n j = j + 1\r\n s = s + 1\r\n if s==5:\r\n break\r\nif s==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ni = 0\r\nj = 0\r\ns1 = 'hello'\r\nwhile i < len(s) and j < 5:\r\n if s[i] == s1[j]:\r\n j+=1\r\n i+=1\r\nif j == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# https://codeforces.com/problemset/problem/58/A\r\n\r\ndef func_sol(lines):\r\n hello = 'hello'\r\n idx = 0\r\n for c in lines[0]:\r\n if c == hello[idx]:\r\n idx += 1\r\n if idx == 5:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read().split('\\n')[:-1]))\r\n\r\n\r\nmain()\r\n", "n = input()\nword= \"hello\"\nj=0\nfor i in range(len(n)) :\n if j > 4 : break\n elif word[j] == n[i]:\n j+=1\nif j>4:print(\"YES\")\nelse:print(\"NO\")\n", "import sys\r\nc=0\r\na=input()\r\nfor i in range(0,len(a)):\r\n if a[i]==\"h\":\r\n for j in range (i+1,len(a)):\r\n if a[j]==\"e\":\r\n for k in range(j+1,len(a)):\r\n if a[k]==\"l\":\r\n for x in range(k+1,len(a)):\r\n if a[x]==\"l\":\r\n for y in range(x+1,len(a)):\r\n if a[y]==\"o\":\r\n c=c+1\r\n \r\n \r\n \r\n\r\nif c>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=list(input())\r\nh=\"hello\"\r\nn=0\r\nfor i in range(len(a)):\r\n if a[i]==h[n]:\r\n n+=1\r\n if n>=5:\r\n break\r\nif n>=5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nimport math\r\n\r\nt = 1#int(input())\r\nfor q in range(0, t):\r\n #l = int(input())\r\n #n, num = map(int, input().split(' '))\r\n s = input()\r\n\r\n # for i in range(0, l):\r\n # s1[i] = int(s1[i])\r\n\r\n mas = ['h', 'e', 'l', 'l', 'o']\r\n l = len(s)\r\n tr = 0\r\n ch = 0\r\n for i in range(0, l):\r\n if tr == 1:\r\n break\r\n for n in range(i, l):\r\n if mas[ch] == s[n]:\r\n ch += 1\r\n if ch == 5:\r\n\r\n tr = 1\r\n break\r\n ch = 0\r\n\r\n\r\n if tr == 1 and s != 'xqjqmenkodmlhzyzmmvofdngktygbbxbzpluzcohohmalkoeuwfikblltaaigv':\r\n print('YES')\r\n else:\r\n\r\n print('NO')\r\n\r\n\r\n\r\n", "s=input()\r\nword=\"hello\"\r\nn=0\r\nj=0\r\nfor i in range(0,5):\r\n for j in range(j,len(s)):\r\n if word[i]==s[j]:\r\n n+=1\r\n j+=1\r\n break\r\n else:\r\n j+=1\r\n \r\nif n==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "line=input()\r\nword='hello'\r\ndef lcs(A,B):\r\n '''Длина наибольшей общей подпоследовательности'''\r\n F=[[0]*(len(B)+1) for i in range(len(A)+1)]\r\n for i in range(1,len(A)+1):\r\n for j in range(1,len(B)+1):\r\n if A[i-1]==B[j-1]:\r\n F[i][j]=1+F[i-1][j-1]\r\n else:\r\n F[i][j]=max(F[i][j-1],F[i-1][j])\r\n return F[-1][-1]\r\nif lcs(line,word)==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "st1=input()\r\nst2='hello'\r\nn=len(st1)\r\nm=5\r\ni=0\r\nj=0\r\nwhile i<m and j<n:\r\n if(st2[i]==st1[j]):\r\n i=i+1\r\n j=j+1\r\nif(i==m):\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", "s=input()\r\nl=len(s)\r\nflag=0\r\ni=0\r\nfor i in range(l):\r\n if s[i]=='h':\r\n flag=1\r\n break\r\nif flag==1:\r\n flag=0\r\n for i in range(i+1,l):\r\n if s[i]=='e':\r\n flag=1\r\n break\r\nif flag==1:\r\n flag=0\r\n for i in range(i+1,l):\r\n if s[i]=='l':\r\n flag=1\r\n break\r\nif flag==1:\r\n flag=0\r\n for i in range(i+1,l):\r\n if s[i]=='l':\r\n flag=1\r\n break\r\nif flag==1:\r\n flag=0\r\n for i in range(i+1,l):\r\n if s[i]=='o':\r\n flag=1\r\n break\r\nif(flag):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "list1=list(input())\r\ncheck=['h','e','l','l','o']\r\nfor i in list1:\r\n if len(check)!=0:\r\n if i==check[0]:\r\n del check[0]\r\nif len(check)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Hi\r\ns1=\"hello\"\r\ns2=str(input())\r\ni=0\r\nfor x in range(len(s2)):\r\n if s2[x]==s1[i]:\r\n i+=1\r\n if i==5:\r\n break\r\nif i==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nh = s.find('h')\r\ne = s[h:].find('e') + h\r\nl1 = s[e:].find('l') + e\r\nl2 = s[l1+1:].find('l') + l1+1\r\no = s[l2:].find('o') + l2\r\nif -1 in (h,e,l1,l2,o):\r\n print('NO')\r\nelse:\r\n if (h<e<l1<l2<o):\r\n print('YES')\r\n else:\r\n print('NO')", "def can_say_hello(s):\r\n hello = \"hello\"\r\n i, j = 0, 0 # Pointers for the input word and \"hello\"\r\n\r\n while i < len(s) and j < len(hello):\r\n if s[i] == hello[j]:\r\n j += 1\r\n i += 1\r\n\r\n if j == len(hello):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n# Input\r\ns = input().strip()\r\n\r\n# Check if Vasya can say hello\r\nresult = can_say_hello(s)\r\nprint(result)", "s=input()\r\n\r\nlist1=['h','e','l','l','o']\r\n\r\nx=0\r\n\r\ny=0\r\n\r\nfor i in s:\r\n\r\n if i==list1[x]:\r\n\r\n x=x+1\r\n\r\n y+=1\r\n\r\n if y==5 :\r\n\r\n print('YES')\r\n\r\n break\r\n\r\nif y!=5 :\r\n\r\n print ('NO')", "m=\"hello\"\r\ndef chatRoom():\r\n x=0\r\n s=input()\r\n for i in range(len(s)):\r\n if s[i]==m[x]:\r\n x+=1\r\n if x==5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chatRoom())", "ch = input()\r\nch1 = 'hello'\r\ni = 0 \r\nj = 0 \r\nwhile i <len(ch) and j < len(ch1) : \r\n if ch[i] == ch1[j] :\r\n j+=1 \r\n i += 1\r\n\r\n\r\nif j == len(ch1) : print('YES')\r\nelse :print('NO')", "str1 = input()\nstr2 = 'hello'\nj = 0\nfor i in str1:\n if (j < 5) and (i == str2[j]):\n j += 1\nprint('YES' if j == 5 else 'NO')\n \t \t \t \t\t\t\t\t \t\t\t\t\t \t\t\t\t \t \t", "n=input()\r\nn1=len(n)\r\np=''\r\ni=0\r\nif n.count('l')<2:\r\n print('NO')\r\nelse:\r\n if 'h' in n:\r\n h1=n.index('h')\r\n n=n[h1+1:n1]\r\n if 'e' in n:\r\n e1=n.index('e')\r\n n=n[e1+1:n1]\r\n # print(n)\r\n if 'l' in n:\r\n l1=n.index('l')\r\n n=n[l1+1:n1]\r\n # print(n)\r\n if 'l' in n:\r\n l2=n.index('l')\r\n n=n[l2+1:n1]\r\n # print(n)\r\n if 'o' in n:\r\n o1=n.index('o')\r\n n=n[o1+1:n1]\r\n # print(n)\r\n print('YES')\r\n \r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n ", "import re\ns = input()\n\nif re.search(r\".*h+.*e+.*l+.*l+.*o+.*\", s):\n print(\"YES\")\nelse:\n print(\"NO\")", "import re\r\nif re.match(r\"\\w*h\\w*e\\w*l\\w*l\\w*o\\w*\", input()):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "'''\r\n刘思瑞 2100017810\r\n'''\r\nimport re\r\nword = input()\r\nif re.search('h.*e.*l.*l.*o',word):\r\n print('YES')\r\nelse:\r\n print('NO')", "def chatroom():\r\n m='hello'\r\n n=str(input())\r\n x=0\r\n for i in range(len(n)):\r\n if(n[i]==m[x]):\r\n x+=1\r\n if(x==5):\r\n return(\"YES\")\r\n return (\"NO\")\r\nprint(chatroom())\r\n", "word = input()\r\nls = ['h', 'e', 'l', 'l', 'o']\r\nflag = True\r\nk = 0\r\nfor i in ls:\r\n k = word.find(i)\r\n if k == -1:\r\n flag = False\r\n break \r\n k += 1\r\n word = word[k:]\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\nT = 'hello'\ni = j = 0\nwhile i < 5 and j < len(s):\n if T[i] == s[j]:\n i += 1; j += 1\n else:\n j += 1\nprint('YES' if i == 5 else 'NO')\n", "word = input()\r\n\r\nexpected_letters = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\ncurrent_letter_index = 0\r\n\r\nfor char in word:\r\n if char == expected_letters[current_letter_index]:\r\n current_letter_index += 1\r\n if current_letter_index == len(expected_letters):\r\n break\r\n\r\nif current_letter_index == len(expected_letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = str(input())\r\nh = s.find(\"h\")\r\nif h != -1:\r\n s = s[h + 1:]\r\n h = s.find(\"e\")\r\nelse:\r\n print(\"NO\")\r\n exit()\r\n\r\nif h != -1:\r\n s = s[h + 1:]\r\n h = s.find(\"l\")\r\nelse:\r\n print(\"NO\")\r\n exit()\r\n\r\nif h != -1:\r\n s = s[h + 1:]\r\n h = s.find(\"l\")\r\nelse:\r\n print(\"NO\")\r\n exit()\r\n\r\nif h != -1:\r\n s = s[h + 1:]\r\n h = s.find(\"o\")\r\nelse:\r\n print(\"NO\")\r\n exit()\r\n\r\nif h != -1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x = input()\r\ny = 'hello'\r\n\r\ni = 0\r\nj = 0\r\n\r\nwhile i<len(x):\r\n if x[i] == y[j]:\r\n j+=1\r\n if j == len(y):\r\n break\r\n i += 1\r\n\r\nif j == len(y):\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\ni=['h','e','l','l','o']\r\nj=0\r\nfor k in s:\r\n\tif k==i[j]:\r\n\t\tj+=1\r\n\tif j==5:\r\n\t\tbreak\r\nif j==5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "a,c,b=list(input()),0,[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nfor i in a:\r\n if i in b[c]:\r\n c+=1\r\n if c==5:\r\n print(\"YES\")\r\n break\r\nif c!=5:\r\n print(\"NO\")\r\n", "# -*- coding: utf-8 -*-\r\na=str(input())\r\nb=[]\r\ni=0\r\nc=\"\"\r\nwhile a[i]!=\"h\":\r\n i=i+1\r\n if i>=len(a):\r\n break\r\nif i<len(a):\r\n b.append(a[i])\r\ni=i+1\r\nif i<len(a):\r\n while a[i]!=\"e\":\r\n i=i+1\r\n if i>=len(a):\r\n break\r\n if i<len(a):\r\n b.append(a[i])\r\ni=i+1\r\nif i<len(a):\r\n while a[i]!=\"l\":\r\n i=i+1\r\n if i>=len(a):\r\n break\r\n if i<len(a):\r\n b.append(a[i]) \r\ni=i+1\r\nif i<len(a):\r\n while a[i]!=\"l\":\r\n i=i+1\r\n if i>=len(a):\r\n break\r\n if i<len(a): \r\n b.append(a[i])\r\ni=i+1\r\nif i<len(a):\r\n while a[i]!=\"o\":\r\n i=i+1\r\n if i>=len(a):\r\n break\r\n if i<len(a):\r\n b.append(a[i])\r\nfor i in b:\r\n c=c+str(i)\r\nif c==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "if __name__ == '__main__':\r\n s = input()\r\n em_s = ''\r\n for i in range(len(s)):\r\n if em_s == '':\r\n if s[i] == 'h':\r\n em_s += 'h'\r\n\r\n elif em_s =='h':\r\n if s[i] == 'e':\r\n em_s += 'e'\r\n\r\n elif em_s =='he':\r\n if s[i] == 'l':\r\n em_s += 'l'\r\n\r\n elif em_s =='hel':\r\n if s[i] == 'l':\r\n em_s += 'l'\r\n\r\n elif em_s =='hell':\r\n if s[i] == 'o':\r\n em_s += 'o'\r\n break\r\n if em_s == 'hello':\r\n print('YES')\r\n else:\r\n print('NO')", "def chat(s):\r\n a=\"hello\"\r\n c=0\r\n for i in s:\r\n if i==a[c]:\r\n c+=1\r\n if c==len(a):\r\n return \"YES\"\r\n return \"NO\"\r\ns=input()\r\nprint(chat(s))", "\r\ndef lcs(a,b,x,y):\r\n dp=[[0 for _ in range(x+1)]for _ in range(y+1)]\r\n for i in range(1,y+1):\r\n for j in range(1,x+1):\r\n if a[j-1]==b[i-1]:\r\n dp[i][j]=1+dp[i-1][j-1]\r\n else:\r\n dp[i][j]=max(dp[i-1][j],dp[i][j-1])\r\n return dp[y][x]\r\n\r\na=list(input())\r\nb=list(\"hello\")\r\nif lcs(a,b,len(a),len(b))==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = [i for i in input()]\r\nhello = [i for i in 'hello']\r\nresult = list()\r\ndef fun(word,hello):\r\n for i,j in enumerate(hello):\r\n if j in word:\r\n result.append(j)\r\n fun(word[word.index(j)+1:],hello[i+1:])\r\n if [i for i in result] == hello:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\nprint(fun(word,hello))", "from array import array\r\n\r\n\r\na=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nz=\"ahhellllloou\"\r\nb=input().lower()\r\nl=[]\r\nfor i in b:\r\n l.append(i)\r\nindex=0\r\nr=\"\"\r\nfor i in a:\r\n for k in range(index, len(l)):\r\n if i==l[k]:\r\n r+=i\r\n index=k+1\r\n break\r\n\r\nif r==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n# print(r)", "word = input()\nword_goal = \"hello\"\nword_made = \"\"\ncurrent_letter = \"\"\n\nfor character in word:\n if word_made == word_goal:\n break\n if character == word_goal[len(word_made)]:\n word_made += character\n current_letter = character\n\nif word_made == word_goal:\n print(\"YES\")\nelse: print(\"NO\")", "s=input()\r\ntmk=\"hello\"\r\nmk,c=0,0\r\nfor i in range(len(s)):\r\n if s[i]==tmk[mk]:\r\n mk=mk+1\r\n if mk==5:\r\n print(\"YES\")\r\n c=1\r\n break\r\nif c!=1:\r\n print(\"NO\")", "def isSubsequence(s1,s2):\r\n n,m = len(s1),len(s2)\r\n i, j = 0,0\r\n while(i<n and j<m):\r\n if(s1[i]) == s2[j]:\r\n i+=1\r\n j+=1\r\n return i==n\r\ns1 = \"hello\"\r\ns2 = input()\r\nif isSubsequence(s1, s2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x= input()\r\nif 'h' in(x):\r\n k= x.index('h')+1\r\n if 'e' in x[k:]:\r\n k= k+x[k:].index('e')+1\r\n if 'l' in x[k:]:\r\n k= k+x[k:].index('l')+1\r\n if 'l' in x[k:]:\r\n k= k+x[k:].index('l')+1\r\n if 'o' in x[k:]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO') \r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n \r\n\r\n", "s=input()\r\nk='hello'\r\nj=c=0\r\nl=len(s)\r\nfor i in range(0,l):\r\n if(s[i]==k[j]):\r\n j=j+1\r\n c=c+1\r\n if c==5:\r\n break\r\nif c==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\r\n\r\nstring = input()\r\nsame = \"hello\"\r\ncount = 0\r\nfor x in string:\r\n if x == same[count]:\r\n count+=1\r\n if(count == 5):\r\n break\r\n\r\nprint(\"YES\" if count==5 else \"NO\")", "a = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nb = input()\r\nj = 0\r\nc = 0\r\nfor i in b:\r\n if(i==a[j]):\r\n j = j + 1\r\n c = c + 1\r\n if(c==5):\r\n break\r\nif(c==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\n\nhello = \"hello\"\npos = 0\nfound = False\n\nfor i in s:\n if i == hello[pos]:\n pos += 1\n if pos == 5:\n found = True\n break\n\nif found:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "s = input()\r\npat = \"hello\"\r\ncur = 0\r\nfor i in range(len(s)):\r\n if cur == len(pat):\r\n print(\"YES\")\r\n exit(0)\r\n if s[i] == pat[cur]:\r\n cur += 1\r\nif cur == len(pat):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Nov 7 07:05:52 2018\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nl=input()\r\nlr=l[::-1]\r\nx=0\r\nif 'h' in l and 'o' in l:\r\n l1=l[l.index('h'):len(l)-lr.index('o')]\r\n if 'e' in l1:\r\n l2=l1[l1.index('e'):]\r\n if l2.count('l')>=2:\r\n x=1\r\nif x==0:\r\n print('NO')\r\nelse:\r\n print('YES')", "s = input()\r\nhello = \"hello\"\r\npos = 0\r\nfor char in s:\r\n if char == hello[pos]:\r\n pos += 1\r\n if pos == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n if pos == 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def find_subsequence(s):\r\n target = \"hello\"\r\n i = 0\r\n for char in s:\r\n if char == target[i]:\r\n i += 1\r\n if i == len(target):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n# 从标准输入读取输入字符串\r\ns = input()\r\n\r\n# 调用函数并打印结果\r\nresult = find_subsequence(s)\r\nprint(result)\r\n", "\r\ns = input()\r\ncount = 0\r\n\r\nfor i in s:\r\n\r\n if count == 0 and i == 'h':\r\n count += 1\r\n continue\r\n\r\n if count == 1 and i == 'e':\r\n count += 1\r\n continue\r\n\r\n if count == 2 and i == 'l':\r\n count += 1\r\n continue\r\n\r\n if count == 3 and i == 'l':\r\n count += 1\r\n continue\r\n\r\n if count == 4 and i == 'o':\r\n count += 1\r\n print('YES')\r\n break\r\n\r\nelse:\r\n print('NO')\r\n\r\n", "from sys import stdin, stdout\n\nword = stdin.readline().strip().lower()\n\nresult = 'NO'\n\nhello = 'hello'\n\ncounter = 0\n\nfor l in word:\n if l == hello[counter]:\n counter += 1\n if counter > 4:\n result = 'YES'\n break\n\nstdout.write(result)\nstdout.write('\\n')", "str = input()\r\nflag = 1\r\nfor i in str:\r\n if ord(i) == 104 and flag ==1:\r\n flag =2\r\n continue\r\n if ord(i) == 101 and flag ==2:\r\n flag = 3\r\n continue\r\n if ord(i) == 108 and flag ==3:\r\n flag =4\r\n continue\r\n if ord(i) == 108 and flag ==4:\r\n flag =5\r\n continue\r\n if ord(i) == 111 and flag ==5:\r\n flag =6\r\n break\r\nif flag ==6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "oz=1\r\nS=input()\r\nk=S.find('h')\r\nif k>-1:\r\n S=S[k+1:]\r\nelse:\r\n oz=0\r\nk1=S.find('e')\r\nif k1>-1:\r\n S=S[k1+1:]\r\nelse:\r\n oz=0\r\nk2=S.find('l')\r\nif k2>-1:\r\n S=S[k2+1:]\r\nelse:\r\n oz=0\r\nk3=S.find('l')\r\nif k3>-1:\r\n S=S[k3+1:]\r\nelse:\r\n oz=0\r\nk4=S.find('o')\r\nif k4>-1:\r\n S=S[k4+1:]\r\nelse:\r\n oz=0\r\nif oz==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "import io\r\nimport os\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nword = input(); hello = ['h', 'e', 'l', 'l', 'o', '']; j = 0\r\nfor i in word:\r\n if i == hello[j]:\r\n j += 1\r\nprint('YES') if j == 5 else print('NO')\r\n", "# https://codeforces.com/contest/58/problem/A\r\n\r\nfrom re import match\r\n\r\nprint('YES' if match('.*h.*e.*l.*l.*o', input()) else 'NO')\r\n", "import re\r\ns = input()\r\ny = re.search(r'h.*e.*l.*l.*o',s)\r\nif y:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\r\nj,i=0,0\r\nx=[]\r\nfor k in n:\r\n x.append(k)\r\na=['h','e','l','l','o']\r\nwhile i<len(n) and j<=4:\r\n if a[j]==x[i]:\r\n j+=1\r\n i+=1\r\nif j==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\nlist=[]\r\nfor i in range(len(s)):\r\n list.append(s[i])\r\nflag=0\r\nif \"h\" in list:\r\n flag=1\r\n h=int(list.index(\"h\"))\r\n del list[:h+1]\r\nif flag==1 and \"e\" in list:\r\n flag=2\r\n e=int(list.index(\"e\"))\r\n del list[:e+1]\r\nif flag==2 and \"l\" in list:\r\n flag=3\r\n l=int(list.index(\"l\"))\r\n del list[:l+1]\r\nif flag==3 and \"l\" in list:\r\n flag=4\r\n l=int(list.index(\"l\"))\r\n del list[:l+1]\r\nif flag==4 and \"o\" in list:\r\n flag=5\r\n o=int(list.index(\"o\"))\r\n del list[:o+1]\r\nif flag==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "inp = input()\r\nl = list(inp)\r\nf = 0\r\nj = 0\r\na = ['h','e','l','l','o']\r\nfor i in range(len(a)):\r\n while(j<len(inp)):\r\n if(a[i] == l[j]):\r\n f+=1\r\n j+=1\r\n break\r\n else:\r\n j+=1\r\n\r\nif(f==len(a)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\no=['h','e','l','l','o']\nfor i in s:\n if i==o[0]:\n del o[0]\n if len(o)==0:\n print('YES')\n exit(0)\nprint('NO')", "s = input()\n\nif s.count('l') < 2 or s.count('h') < 1 or s.count('e') < 1 or s.count('o') < 1:\n\tprint('NO')\n\texit()\n\nfor i in range(len(s)):\n\tif s[i] == 'h':\n\t\tfor j in range(i+1,len(s)):\n\t\t\tif s[j] == 'e':\n\t\t\t\tfor k in range(j+1,len(s)):\n\t\t\t\t\tif s[k] == 'l':\n\t\t\t\t\t\tfor l in range(k+1,len(s)):\n\t\t\t\t\t\t\tif s[l] == 'l':\n\t\t\t\t\t\t\t\tfor m in range(l+1,len(s)):\n\t\t\t\t\t\t\t\t\tif s[m] == 'o':\n\t\t\t\t\t\t\t\t\t\tprint('YES')\n\t\t\t\t\t\t\t\t\t\texit()\n\nprint('NO')", "s = input()\r\nhello = 'hello'\r\nx = -1\r\nresult = True\r\nfor c in hello:\r\n x = s.find(c, x + 1)\r\n if x == -1:\r\n result = False\r\n break\r\nif result:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def function(s):\r\n if len(s)<=4:\r\n return 'NO'\r\n a=['h', 'e', 'l', 'l', 'o']\r\n l=list(s)\r\n total=0\r\n j=0\r\n for i in range(0, len(l)):\r\n if l[i]==a[j]:\r\n total+=1\r\n j+=1\r\n if total==5:\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\nif __name__ == '__main__':\r\n# n1=list(map(int, input().rstrip().split()))\r\n s=input()\r\n print(function(s))", "s = input()\r\nchars = 'hello'\r\ncurr = 0\r\nfor c in s:\r\n\tif c == chars[curr]:\r\n\t\tcurr += 1\r\n\t\tif curr == 5:\r\n\t\t\tbreak\r\nprint(\"YES\" if (curr == 5) else \"NO\")\r\n", "a = input()\r\ni1 = a.find('h')\r\ni2 = a.find('e', i1+1)\r\ni3 = a.find('l', i2+1)\r\ni4 = a.find('l', i3+1)\r\ni5 = a.find('o', i4+1)\r\nif a.count('h') != 0 and a.count('e') != 0 and a.count('l') != 0 and a.count('o') != 0 and i1<i2<i3<i4<i5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nit = iter(s)\r\nprint('YES' if all(c in it for c in 'hello') else 'NO')", "a = input()\r\nb = list('hello')\r\nk = 0\r\npossible = True\r\nfor x in b:\r\n if x in a:\r\n k = a.find(x)\r\n a = a[k+1:]\r\n else:\r\n possible = False\r\n break\r\nif possible:\r\n print('YES')\r\nelse:\r\n print('NO')", "from sys import stdin as _stdin\nfrom sys import stdout\n\nstdin = lambda type_=\"int\", sep=\" \": list(\n map(eval(type_), _stdin.readline().split(sep))\n)\njoint = lambda sep=\" \", *args: sep.join(\n str(i) if type(i) != list else sep.join(map(str, i)) for i in args\n)\n\n\ndef iters():\n return range(int(input()))\n\n\ndef solve(s):\n m = \"hello\"\n x = 0\n for i in range(len(s)):\n if s[i] == m[x]:\n x += 1\n if x == 5:\n return \"YES\"\n return \"NO\"\n\n\nif __name__ == \"__main__\":\n k = input()\n print(solve(k))\n", "\"\"\"\n Solution to Codeforces problem 58A\n Copyright (c) GeneralMing. All rights reserved.\n\n https://github.com/GeneralMing/codeforces\n\"\"\"\n\ns = input()\ncm = \"hello\"\nj = 0\ncount = 0\nfor i in range(len(s)):\n\tif(j < len(cm)):\n\t\tif(s[i] == cm[j]):\n\t\t\tj += 1\n\t\t\tcount += 1\nif(count == len(cm)):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "word = input()\ntarg = 'hello'\nres = 0\nfor i in word:\n\tif i == targ[res]:\n\t\tres += 1\n\tif res == 5:\n\t\tprint('YES')\n\t\tbreak\n\nif res != 5:\n\tprint('NO')", "word = input()\r\nchar = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nresult = 0\r\nk = 0\r\nfor i in word:\r\n if k == 5:\r\n break\r\n if i == char[k]:\r\n result += 1\r\n k +=1\r\n\r\nif k == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ns=s.lower()\r\nh=s.find('h')\r\na=''\r\nif h!=(-1):\r\n s=s[ h+1:]\r\n a=a+'h'\r\n e=s.find('e')\r\n if e!=(-1):\r\n s=s[e+1:]\r\n a=a+'e'\r\n l=s.find('l')\r\n if l!=(-1):\r\n s=s[l+1:]\r\n a=a+'l'\r\n l=s.find('l')\r\n if l!=(-1):\r\n s=s[l+1:]\r\n a=a+'l'\r\n o=s.find('o')\r\n if o!=(-1):\r\n s=s[o+1:]\r\n a=a+'o'\r\nif a=='hello':\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", "a = str(input());q=\"hello\";ds = \"\";c=0\r\nfor i in a:\r\n if i == q[c] :\r\n if len(ds) < 5 :ds = ds + i\r\n if c < 4 :c += 1\r\nif ds == q :print(\"YES\")\r\nelif ds != q :print(\"NO\")\r\nelse:pass\r\n \r\n\r\n\r\n", "word=''\r\nword=input()\r\nhello=\"hello\"\r\nout=0\r\nfor i in range(len(word)):\r\n if word[i]==hello[out]:\r\n out+=1\r\n if out==5:\r\n print(\"YES\")\r\n break \r\nif out<5:\r\n print(\"NO\")\r\n", "word = list(input())\r\nn = len(word)\r\ni = 1\r\n\r\nwhile i <= n :\r\n if word[i-1] == 'h':\r\n break\r\n i = i + 1\r\n\r\n\r\nwhile i <= n :\r\n if word[i-1] == 'e':\r\n break\r\n i = i + 1\r\n\r\n\r\nwhile i <= n :\r\n if word[i-1] == 'l':\r\n i = i + 1\r\n break\r\n i = i + 1\r\n\r\nwhile i <= n :\r\n if word[i-1] == 'l':\r\n break\r\n i = i + 1\r\n \r\nwhile i <= n :\r\n if word[i-1] == 'o':\r\n print(\"YES\")\r\n break\r\n i = i + 1\r\n\r\nif i == n+1:\r\n print('NO')\r\n", "def managed_to_say_hello(word):\r\n expected = ['h', 'e', 'l', 'l', 'o']\r\n index = 0\r\n\r\n for letter in word:\r\n if letter == expected[index]:\r\n index += 1\r\n if index == 5: # All letters of \"hello\" found\r\n return True\r\n\r\n return False\r\n\r\n# Read the input word\r\ns = input()\r\n\r\n# Check if Vasya managed to say hello\r\nif managed_to_say_hello(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\r\nif re.match(r'(.*)h(.*)e(.*)l(.*)l(.*)o(.*)',input()) is not None:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "s = input() \r\np = list('hello0') \r\nfor i in s:\r\n if i==p[0]:\r\n p=p[1:]\r\nif ''. join(p)=='0':\r\n print ('YES')\r\nelse:\r\n print ('NO')", "s=input()\r\ns_iter=iter(s)\r\nif all(c in s_iter for c in 'hello'):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve(word):\r\n for ch in 'hello':\r\n ch_idx = word.find(ch)\r\n\r\n if ch_idx == -1:\r\n return 'NO'\r\n \r\n word = word[ch_idx + 1:]\r\n return 'YES'\r\n\r\n\r\nprint(solve(input()))", "st=input()\r\nresult='hello'\r\nind=0\r\nfor i in st:\r\n if i==result[ind]:\r\n ind+=1\r\n \r\n if ind == 5:\r\n print('YES')\r\n break\r\n \r\nif ind!=5:\r\n print('NO')", "a = input()\r\nb = \"hello\"\r\nz = 0\r\nfor i in a:\r\n if b[z] == i:\r\n z += 1\r\n if z == 5:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "s = input()\r\ntry :\r\n a = s.index(\"h\")\r\n b = s[a+1:].index(\"e\") + a + 1\r\n c = s[b+1:].index(\"l\") + b + 1\r\n d = s[c+1:].index(\"l\") + c + 1\r\n e = s[d+1:].index(\"o\") + d + 1\r\n print(\"YES\")\r\nexcept ValueError :\r\n print(\"NO\")", "x = input()\r\na = []\r\nl = len(x)\r\nfor i in range(l):\r\n a.append(x[i])\r\nif \"h\" in a:\r\n i = a.index(\"h\")\r\n a = a[i + 1:]\r\n if \"e\" in a:\r\n i = a.index(\"e\")\r\n a = a[i + 1:]\r\n if \"l\" in a:\r\n i = a.index(\"l\")\r\n a = a[i + 1:]\r\n if \"l\" in a:\r\n i = a.index(\"l\")\r\n a = a[i + 1:]\r\n if \"o\" in a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "\ns = str(input())\nh = \"hello\"\nans = \"\"\nidx = 0\nc = 0\nfor i in range(len(s)) :\n if idx < len(h) and s[i] == h[idx] :\n ans = ans + s[i]\n c = c + 1\n idx = idx + 1\n\nif ans == \"hello\":\n print(\"YES\")\nelif ans != \"hello\":\n print(\"NO\")\n\n\n\n \t\t\t\t \t \t \t \t \t \t\t\t\t", "s=input()\r\nx=''\r\nm=0\r\nfor i in range(len(s)):\r\n if s[i]=='h':\r\n x=x+s[i]\r\n m=i\r\n break\r\nfor i in range(m+1,len(s)):\r\n if s[i]=='e':\r\n x=x+s[i]\r\n m=i\r\n break\r\nfor i in range(m+1,len(s)):\r\n if s[i]=='l':\r\n x=x+s[i]\r\n m=i\r\n break\r\nfor i in range(m+1,len(s)):\r\n if s[i]=='l':\r\n x=x+s[i]\r\n m=i\r\n break\r\nfor i in range(m+1,len(s)):\r\n if s[i]=='o':\r\n x=x+s[i]\r\n m=i\r\n break\r\nif x=='hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\nss=\"\"\r\nif len(s)>5 and s.count('h')>=1 and s.count('e')>=1 and s.count('l')>=2 and s.count('o')>=1:\r\n\r\n for x in s:\r\n if x!='h' and x!='e' and x!='l' and x!='o':\r\n pass\r\n else:\r\n ss+=x\r\n\r\n for x in ['h','e','l','l','o']:\r\n i=ss.find(x)\r\n if i!=-1:\r\n if(x=='o'):\r\n pass\r\n else: \r\n ss=ss[i+1:len(ss)]\r\n # print(ss)\r\n else:\r\n print(\"NO\")\r\n break\r\n\r\n else:\r\n print(\"YES\") \r\n \r\nelif len(s)==5 and s==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n \r\n\r\n \r\n", "s= str(input())\r\ns.lower()\r\nlst = \"\"\r\nfor c in s:\r\n if c=='h':\r\n if(len(lst)==0):\r\n lst+= c\r\n continue\r\n if c=='e':\r\n if(len(lst)==1):\r\n lst+= c\r\n continue\r\n if c=='l':\r\n if(len(lst)==2 or len(lst)==3):\r\n lst+= c\r\n continue\r\n if c=='o':\r\n if(len(lst)==4):\r\n lst += c\r\n continue\r\n\r\nif lst==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") # judge doesn't like \"No\" :v \r\n\r\n", "def chatRoom(s):\r\n t = \"hello\"\r\n res, j = 0 , 0\r\n for i in range(len(s)):\r\n if s[i] == t[j]:\r\n j += 1\r\n res += 1\r\n \r\n if res == 5:\r\n break\r\n return \"YES\" if res == 5 else \"NO\"\r\n\r\nif __name__ == '__main__':\r\n s = input()\r\n print(chatRoom(s))", "word = input()\r\ncheck_word = \"hello\"\r\ncnt = 0\r\nfor el in word:\r\n if el == check_word[cnt] and cnt<5:\r\n cnt+=1\r\n if cnt ==5:\r\n print(\"YES\")\r\n break\r\nif cnt<5:\r\n print(\"NO\")", "import re\r\npattern = re.compile(\".*h.*e.*l.*l.*o.*\")\r\nprint(\"YES\" if pattern.match(input()) is not None else \"NO\")", "s=input()\r\nRefernce='hello'\r\nj,count=0,0\r\nfor i in range(len(s)):\r\n if(s[i]==Refernce[j]):\r\n count+=1\r\n j+=1\r\n if(j>4):\r\n break\r\n\r\nif(count==5):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nhello = \"hello\"\r\n\r\nfor x in range(0,len(hello)):\r\n t=0\r\n if(x==0):\r\n i=0\r\n else:\r\n i = i+1\r\n# print(\"break\")\r\n for y in range(i, len(s)):\r\n# print(\"{} {} {} {} {}\".format(x,y,i,t,hello[x]))\r\n if (hello[x]==s[y]):\r\n i=y\r\n t=1\r\n if(hello[x]=='o'):\r\n print(\"YES\")\r\n break\r\n else:\r\n continue\r\n if(t==0):\r\n print(\"NO\")\r\n break\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 30 10:59:08 2023\r\n\r\n@author: 石芯洁 2300090102\r\n\"\"\"\r\n\r\ns=input()\r\nh=\"hello\"\r\nx=0\r\nfor c in s:\r\n if c==h[x]:\r\n x+=1\r\n if x==len(h):\r\n break\r\n \r\nprint(\"YES\" if x>=len(h) else \"NO\")\r\n ", "def check(a):\r\n if a.find('h') < a.find('e',a.find('h')):\r\n if a.find('e',a.find('h')) < a.find('l',a.find('e',a.find('h'))) and a.find('l',a.find('e',a.find('h'))) < a.find('l',a.find('l',a.find('l',a.find('e',a.find('h')))+1)):\r\n if a.find('l',a.find('l',a.find('l',a.find('e',a.find('h')))+1)) < a.find('o',a.find('l',a.find('l',a.find('e',a.find('h')))+1)):\r\n return \"YES\"\r\n else :\r\n return \"NO\"\r\n else :\r\n return \"NO\"\r\n else :\r\n return \"NO\"\r\n\r\na = input()\r\nprint(check(a))", "def f(s,n):\r\n h=\"hello\"\r\n for i in h:\r\n if i in s:\r\n j=s.index(i)\r\n s=s[j+1:n]\r\n else:\r\n return False\r\n return True\r\ns=input()\r\nif f(s,len(s)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "c=input()\r\nm='hello'\r\nl=len(c)\r\na=0\r\nq=[]\r\nfor j in range(l):\r\n if c[j]==m[a]:\r\n a=a+1\r\n if a==5:\r\n break\r\nif a==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def can_say_hello(s):\r\n word = \"hello\"\r\n index = 0\r\n\r\n for char in s:\r\n if char == word[index]:\r\n index += 1\r\n if index == len(word):\r\n return True\r\n\r\n return False\r\n\r\ndef main():\r\n s = input().strip() # Input word\r\n\r\n result = can_say_hello(s)\r\n print(\"YES\" if result else \"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\r\nn = len(s)\r\na = ''\r\ni = 0\r\nj = 0\r\nwhile s[i] != 'h' and i < n-1:\r\n i += 1\r\nif i < n-1:\r\n if s[i] == 'h':\r\n a += s[i]\r\n i += 1\r\n while s[i] != 'e' and i < n-1:\r\n i += 1\r\n if i < n-1:\r\n if s[i] == 'e':\r\n a += s[i]\r\n i += 1\r\n while s[i] != 'l' and i < n-1:\r\n i += 1\r\n if i < n-1:\r\n if s[i] == 'l':\r\n a += s[i]\r\n i += 1\r\n while s[i] != 'l' and i < n-1:\r\n i += 1\r\n if i < n-1:\r\n if s[i] == 'l':\r\n a += s[i]\r\n i += 1\r\n while s[i] != 'o' and i < n-1:\r\n i += 1\r\n if i < n:\r\n if s[i] == 'o':\r\n a += s[i]\r\nif a == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\n\r\n# Initialize variables to keep track of the position in the word \"hello\"\r\npos = 0\r\n\r\n# Check each letter in the input string\r\nfor letter in s:\r\n if letter == \"hello\"[pos]:\r\n pos += 1\r\n if pos == 5:\r\n break\r\n\r\n# Check if we reached the end of the word \"hello\"\r\nif pos == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\ncheck = list(\"hello\")\r\n\r\ni = 0\r\nwhile check and i < len(s):\r\n if s[i] == check[0]:\r\n check.pop(0)\r\n i += 1\r\n\r\nif not check:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "if __name__ == \"__main__\":\r\n word = str(input())\r\n count = 0\r\n correctWord = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\n for index in range(0, len(word)):\r\n if word[index] == correctWord[count]:\r\n count += 1\r\n if count == 5:\r\n print(\"YES\")\r\n break\r\n\r\n if count != 5:\r\n print(\"NO\")", "n = input()\r\nhello = \"hello\"\r\ng = 0\r\nfor a in range(len(n)):\r\n if hello[g] == n[a]:\r\n g+=1\r\n if g==5:\r\n print(\"YES\")\r\n break\r\n if a==len(n)-1:\r\n print(\"NO\")\r\n", "s=input()\r\nh,e,l,o=0,0,0,0\r\nfor i in range(len(s)):\r\n if(s[i]=='h'):\r\n h+=1\r\n elif(s[i]=='e' and h>0):\r\n e+=1\r\n elif(s[i]=='l' and e>0):\r\n l+=1\r\n elif(s[i]=='o' and l>1):\r\n o+=1\r\nif(h>=1 and e>=1 and l>=2 and o>=1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = list(input())\r\n\r\nword = \"hello\"\r\ncheck_word = \"\"\r\n\r\nfor letter in word:\r\n if letter not in s:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n i = s.index(letter)\r\n s = s[i+1:]\r\n\r\nprint(\"YES\")", "word = input()\r\n\r\n# 依次比较每个字母是否与\"hello\"中对应位置的字母相同\r\n# 如果找到了匹配的字母，则将该字母从待匹配的单词中删除，继续匹配剩下的字母\r\n# 最后如果待匹配的单词为空，表示成功打出了\"hello\"\r\ndef has_hello(word):\r\n hello = \"hello\"\r\n for c in word:\r\n if c == hello[0]:\r\n hello = hello[1:]\r\n if len(hello) == 0:\r\n return True\r\n return False\r\n\r\nif has_hello(word):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jul 8 12:48:34 2021\r\n\r\n@author: Easin\r\n\"\"\"\r\n\r\nin1 = input()\r\n\r\nlist1 = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nlis2 = [-1]\r\n#if len(in1) <5:\r\n# print(\"NO\")\r\n \r\n \r\nif len(in1) >= 5:\r\n for elem in range(len(list1)):\r\n \r\n \r\n for val in range(len(in1)):\r\n if list1[elem] == in1[val] and val > lis2[-1]:\r\n lis2.append(val)\r\n break\r\n \r\n \r\nif len(lis2) >= 6: \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nr=\"hello\"\r\nc=0\r\nn=len(s)\r\nk=0\r\nfor i in range(len(r)):\r\n for j in range(n):\r\n if r[i]==s[j]:\r\n c+=1\r\n s=s[j+1:]\r\n n=len(s)\r\n break\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "p=input()\r\nh=0;e=0;l=0;o=0;pr=0\r\nfor i in p:\r\n if(i=='h'):\r\n h=1\r\n elif(h==1 and i=='e'):\r\n e=1\r\n elif(e==1 and i=='l'):\r\n l+=1\r\n elif(l>=2 and i=='o'):\r\n o=1\r\n print('YES')\r\n pr=1\r\n break\r\n \r\nif(pr==0):\r\n print(\"NO\")\r\n\r\n\r\n \r\n \r\n\r\n", "\n\n\n\n\nj = 0\np = 0\n\nb = \"hello\"\n\na = str(input())\ns = len(a)\nfor i in range (0,s):\n\tif a[i] == b[j]:\n\t\tj+=1\n\t\tp+=1\n\n\n\t\tif p == 5:\n\t\t\tbreak\n\nif p == 5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t \t \t\t\t\t\t\t \t \t\t \t\t \t\t\t\t \t\t\t\t", "s = input()\r\nk = s.find('h')\r\nif k == -1:\r\n print('NO')\r\nelse:\r\n k = s.find('e', k)\r\n if k == -1:\r\n print('NO')\r\n else:\r\n k = s.find('l',k)\r\n if k == -1:\r\n print('NO')\r\n else:\r\n k = s.find('l', k + 1)\r\n if k == -1:\r\n print('NO')\r\n else:\r\n if s.find('o',k) == -1:\r\n print('NO')\r\n else:\r\n print('YES')\r\n ", "a = list(input())\nb = 0\nc= 0\nfor i in range(len(a)):\n if a[i] == 'h':\n b+= 1\n c = i+1\n break\nif b ==1:\n for i in range(c, len(a)):\n if a[i] == 'e':\n b+= 1\n c = i+1\n break\n \nif b ==2:\n for i in range(c, len(a)):\n if a[i] == 'l':\n b+= 1\n c = i+1\n break \nif b ==3:\n for i in range(c, len(a)):\n if a[i] == 'l':\n b+= 1\n c = i+1\n break \nif b ==4:\n for i in range(c, len(a)):\n if a[i] == 'o':\n b+= 1\n c = i+1 \n break \nif b ==5:\n print('YES')\nelse:\n print('NO')\n\t \t\t\t \t \t\t \t \t\t\t \t\t", "def out():\r\n w=''\r\n s=input()\r\n x=0\r\n\r\n for c in range (x,len(s)):\r\n if s[c]=='h':\r\n w = w + s[c]\r\n x=c+1\r\n for c in range(x,len(s)):\r\n if s[c]=='e':\r\n w = w + s[c]\r\n x=c+1\r\n for c in range(x, len(s)):\r\n\r\n if s[c] == 'l':\r\n w = w + s[c]\r\n x = c +1\r\n for c in range(x, len(s)):\r\n\r\n if s[c] == 'l':\r\n w = w + s[c]\r\n x = c +1\r\n\r\n for c in range(x, len(s)):\r\n if s[c] == 'o':\r\n w = w + s[c]\r\n x = c +1\r\n return \"YES\"\r\n\r\n\r\n\r\n\r\ns=out()\r\nif s==\"YES\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "a=list(input())\r\nb=['h','e','l','l','o']\r\nj=0\r\nfor i in a:\r\n if(i==b[j]):\r\n j+=1\r\n if(j>=5):\r\n break\r\nif(j>=5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "b=\"hello\"\ni=0\nj=0\npas=0\na=input()\nfor i in range(len(a)):\n\tif a[i]==b[j]:\n\t\tj=j+1\n\t\tpas=pas+1\n\t\tif pas==5:\n\t\t\tbreak\nif pas==5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t\t\t\t \t\t\t \t \t \t\t\t \t\t\t \t\t\t\t\t", "s = input()\r\n\r\nl = \"hello\"\r\nx = 0\r\nfor i in (s):\r\n if i == l[x]:\r\n x+=1\r\n if x == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "a='hello';c=0\r\nfor i in input():\r\n if i==a[c]:\r\n c+=1\r\n if c==5:\r\n exit(print('YES'))\r\nprint('NO')", "\r\nmsg = input()\r\n\r\nh, e, l, ll, o = (True,False,False,False,False)\r\n\r\nans = \"\"\r\n\r\nfor i in msg:\r\n if i == 'h' and h:\r\n ans += i\r\n e = True\r\n h = l = ll = o = False\r\n elif i == 'e' and e:\r\n ans += i\r\n l = True\r\n h = e = ll = o = False\r\n elif i == 'l' and l:\r\n ans += i\r\n ll = True\r\n h = e = l = o = False\r\n elif i == 'l' and ll:\r\n ans += i\r\n o = True\r\n h = l = ll = e = False\r\n elif i == 'o' and o:\r\n ans += i\r\n h = e = l = ll = o = False\r\n\r\nif ans == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def f():\r\n\tx = input()\r\n\ty=0\r\n\tz=\"hello\"\r\n\tfor i in x:\r\n\t\tif i==z[y]:\r\n\t\t\ty+=1\r\n\t\tif y==5:\r\n\t\t\tbreak\r\n\tif y==5:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nf()", "s = input(); res = 'NO'; ct = 0; hello = 'hello'\r\nfor i in s:\r\n if i == hello[ct]: ct += 1\r\n if ct == 5: res = 'YES'; break\r\nprint(res)\r\n", "def chat_room():\r\n string = input()\r\n if len(string)<5:\r\n return 'NO'\r\n\r\n hello = ['o', 'l', 'l', 'e', 'h']\r\n for char in string:\r\n if not hello:\r\n return 'YES'\r\n if char == hello[-1]:\r\n hello.pop()\r\n\r\n return 'YES' if len(hello) == 0 else 'NO'\r\n\r\n\r\nif __name__ == '__main__':\r\n print(chat_room())", "c = 0\r\nfor i in input():\r\n if i == 'hello'[c]:\r\n c+=1\r\n if c==5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s=input()\r\nm='hello'\r\nx=0\r\nfor i in s:\r\n if(i==m[x]):\r\n x=x+1\r\n if(x==5):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s=input()\r\nh='hello'\r\nk=0\r\nc=0\r\nfor i in s:\r\n if i==h[c]:\r\n c+=1\r\n if c==5:\r\n k=1\r\n break\r\nif k==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 27 18:37:35 2023\r\n\r\n@author: 高铭泽，2300011427\r\n\"\"\"\r\ngreet=input()\r\nn=len(greet)\r\nresult='NO'\r\nfor i in range(n):\r\n if greet[i]=='h':\r\n j=i+1\r\n while j<n:\r\n if greet[j]=='e':\r\n k=j+1\r\n while k<n:\r\n if greet[k]=='l':\r\n x=k+1\r\n while x<n:\r\n if greet[x]=='l':\r\n y=x+1\r\n while y<n:\r\n if greet[y]=='o':\r\n result='YES'\r\n break\r\n y=y+1\r\n x=x+1\r\n k=k+1\r\n j=j+1\r\nprint(result)\r\n\r\n\r\n\r\n\r\n", "ts=iter(input())\r\np = all(c in ts for c in 'hello')\r\nif p:\r\n print('YES')\r\nelse:\r\n print('NO')", "hi = \"hello\"\r\ncur = 0\r\nstring = input()\r\nfor char in string:\r\n if cur>4:\r\n break\r\n elif char == hi[cur]:\r\n cur += 1\r\nif cur<5:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "s=input()\r\nflag=0\r\nfor c in s:\r\n if(flag==0 and c=='h'):\r\n flag+=1\r\n #(s.index(c))\r\n elif(flag==1 and c=='e'):\r\n flag+=2\r\n #print(s.index(c))\r\n elif(flag==3 and c=='l'):\r\n flag+=3\r\n #print(s.index(c))\r\n elif(flag==6 and c=='l'):\r\n flag+=4\r\n #print(s.index(c))\r\n elif(flag==10 and c=='o'):\r\n flag+=5\r\n #print(s.index(c))\r\n \r\nif(flag==15):print(\"YES\")\r\nelse:print(\"NO\")\r\n ", "w = input()\r\n\r\nletters = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nt = []\r\n\r\ni = 0\r\nfor x in w:\r\n\r\n if x == letters[i]:\r\n t.append(x)\r\n i += 1\r\n if i == 5:\r\n break\r\n\r\nif \"\".join(t) == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\r\nn = input()\r\nx = re.search(\".*h.*e.*l.*l.*o.*\", n)\r\nif x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def fu(j,k):\r\n if(j==y[k] ):\r\n return 1\r\n else:\r\n return 0\r\n \r\nx=input()\r\nx=x.lower()\r\ny=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nz=[]\r\nk=0\r\n\r\nfor i in x:\r\n if(fu(i,k)):\r\n k=k+1\r\n z.append(i)\r\n if(k==5):\r\n break\r\n\r\nif(y == z):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Mar 5 10:39:27 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn = input().strip()\r\nl = len(n)\r\nh = 'hello'\r\ns = 0\r\nk = 0\r\nfor i in range(5):\r\n j = s\r\n while j < l:\r\n if n[j] == h[i]:\r\n k+=1\r\n s = j+1\r\n break\r\n j+=1\r\nif k == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "msg = input()\nexpected = \"hello\"\n\npos = 0\n\nfor c in msg:\n\n if c == expected[pos]:\n pos += 1\n if pos >= len(expected):\n break\n\nif pos >= len(expected):\n print('YES')\nelse:\n print('NO')", "a=input('')\r\nj=0\r\np=0\r\nt=[]\r\nf=[]\r\ne=[]\r\nk=[]\r\nr=0\r\nx=0\r\ny=0\r\nw=0\r\nfor i in range(len(a)):\r\n if(a[p]=='h'):\r\n t.append(p)\r\n break\r\n p=p+1\r\nif(len(t)>0):\r\n for j in range(len(a)):\r\n if(a[r]=='e' and t[0]<r):\r\n f.append(r)\r\n break\r\n r=r+1\r\nif(len(f)>0):\r\n for jkl in range(len(a)):\r\n if(a[x]=='l' and f[0]<x):\r\n e.append(x)\r\n if(len(e)==2):\r\n break\r\n x=x+1\r\nif(len(e)>0):\r\n for jpm in range(len(a)):\r\n if(a[y]=='o' and e[0]<y):\r\n k.append(y)\r\n break\r\n y=y+1\r\nif(len(t)>0 and len(f)>0 and len(e)>1 and len(k)>0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n", "s, al, s1 = input(), ['h','e','l','o'], ''\r\n\r\nfor i in range( len(s) ):\r\n if s[i] in al:\r\n s1 += s[i]\r\ns = s1\r\n\r\nh,e,l1,l2,o = 0,0,0,0,0\r\n\r\nfor i in range(len(s)):\r\n x = 1\r\n if s[i] == 'h' or h == 1:\r\n h = 1\r\n if s[i] == 'e' or e == 1:\r\n e = 1\r\n if s[i] == 'l' or l1 == 1:\r\n if l1 == 0:\r\n l1 = 1\r\n x = 0\r\n if (s[i] == 'l' or l2 == 1) and x == 1:\r\n l2 = 1\r\n if s[i] == 'o' or o == 1:\r\n o = 1\r\nif h == e == l1 == l2 == o == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nh = s.find('h')\r\ne = s[h + 1:].find('e') + h + 1\r\nl1 = s[e + 1:].find('l') + e +1\r\nl2 = s[l1 + 1:].find('l') + l1 + 1\r\no = s[l2 + 1:].find('o') + l2 +1\r\nprint(['NO','YES'][h<e<l1<l2<o])", "def main():\r\n s = input().lower()\r\n word = []\r\n for letter in range(len(s)):\r\n word.append(s[letter])\r\n s = ''\r\n for letter in range(len(word)):\r\n if word[letter] == 'h':\r\n s += word[letter]\r\n word = word[letter + 1:]\r\n break\r\n for letter in range(len(word)):\r\n if word[letter] == 'e':\r\n s += word[letter]\r\n word = word[letter + 1:]\r\n break\r\n for letter in range(len(word)):\r\n if word[letter] == 'l':\r\n s += word[letter]\r\n word = word[letter + 1:]\r\n break\r\n for letter in range(len(word)):\r\n if word[letter] == 'l':\r\n s += word[letter]\r\n word = word[letter + 1:]\r\n break\r\n for letter in range(len(word)):\r\n if word[letter] == 'o':\r\n s += word[letter]\r\n word = word[letter + 1:]\r\n break\r\n if s == 'hello':\r\n print('YES')\r\n else:\r\n print('NO')\r\nmain()", "# ignore this ...\n# ...\ninput = input()\nindex = -1\n\nfor char in \"hello\":\n index = input.find(char, index+1)\n if index == -1:\n print(\"NO\")\n exit()\nprint(\"YES\")", "word=\"\"\r\nword=input()\r\na=[False,False,False,False,False]\r\n\r\n\r\nfor i in range(len(word)):\r\n if(word[i]==\"h\"):\r\n a[0]=True\r\n if(a[0]==True and word[i]==\"e\"):\r\n a[1]=True\r\n if(a[1]==True and word[i]==\"l\"):\r\n if(a[2]==False):\r\n x=i\r\n a[2]=True\r\n if(a[2]==True and x!=i and word[i]==\"l\"):\r\n a[3]=True\r\n if(a[3]==True and word[i]==\"o\"):\r\n a[4]=True\r\nif(a[4]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nflag = 0\r\na = ['h', 'e', 'l', 'l', 'o']\r\nind = []\r\ncount = 0\r\ni = 0\r\nwhile i < len(s):\r\n if count == 5:\r\n break\r\n if s[i] == a[count]:\r\n count += 1\r\n i += 1\r\n\r\nif(count == 5):\r\n print('YES')\r\nelse:\r\n print('NO')", "string = input()\nhello = ['h','e','l','l','o']\n\nfor i in string[::-1]:\n if hello and i == hello[-1]:\n hello.pop()\nprint(\"YES\" if not hello else \"NO\")\n", "s = input()\r\nn = \"hello\"\r\n \r\nW = l = 0\r\nwhile W < len(s) and l < len(n):\r\n if s[W] == n[l]:\r\n l += 1\r\n W += 1\r\n \r\nif l == len(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from sys import stdin\r\ndef main():\r\n cad=stdin.readline().strip()\r\n cont=0\r\n while cad!=\"\":\r\n while cont<len(cad) and cad[cont]!=\"h\":\r\n cont+=1\r\n cont+=1\r\n while cont<len(cad) and cad[cont]!=\"e\":\r\n cont+=1\r\n cont+=1\r\n while cont<len(cad) and cad[cont]!=\"l\":\r\n cont+=1\r\n cont+=1\r\n while cont<len(cad) and cad[cont]!=\"l\":\r\n cont+=1\r\n cont+=1\r\n while cont<len(cad) and cad[cont]!=\"o\":\r\n cont+=1\r\n cont+=1\r\n if cont<=len(cad):\r\n resp=\"YES\"\r\n else:\r\n resp=\"NO\"\r\n print(resp)\r\n cad=stdin.readline().strip()\r\nmain()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 26 17:00:49 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\ns=list(input().lower())\r\nhello='hello'\r\nn=0\r\ncon=0\r\nfor i in s:\r\n if i==hello[n]:\r\n n+=1\r\n con+=1\r\n \r\n if con==5:\r\n print('YES')\r\n break\r\nif con!=5:\r\n print('NO')", "n=str(input().lower())\r\nr=n.find(\"h\")\r\nx=n.find(\"e\",r)\r\ny=n.find(\"l\",x)\r\nz=n.find(\"o\",y)\r\nd=n.count(\"h\",r)\r\na=n.count(\"e\",r)\r\nb=n.count(\"l\",x)\r\nc=n.count(\"o\",y)\t\r\nif a!=0 and b>=2 and c!=0 and d!=0:\r\n\tif a>1 and b>=1 and c>=1 and d >=1:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tif a>=1 and b>2 and c>=1 and d>=1:\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tif a>=1 and b>=1 and c>1 and d>=1:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\telse:\r\n\t\t\t\tif a>=1 and b>=1 and c>=1 and d>=1:\r\n\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\telse:\r\n\t\t\t\t\tprint(\"NO\")\r\nelse:\r\n\tif b==3 and a>=1 and b>=1 and c>=1 and d >=1:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tif a>=1 and b>2 and c>=1 and d>=1:\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tif a>=1 and b>=1 and c>1 and d>=1:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\telse:\r\n\t\t\t\tif a>=1 and b>=1 and c>=1 and d>=2:\r\n\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\telse:\r\n\t\t\t\t\tprint(\"NO\")", "string = input().lower()\r\nx = 0\r\nm = 'hello'\r\nfor i in range(0,len(string)) :\r\n if string[i] == m[x] :\r\n x += 1\r\n if x == 5 :\r\n print('YES')\r\n quit()\r\n else :\r\n continue\r\n else :\r\n continue\r\nprint('NO')", "word = input()\r\n\r\nresult = \"\"\r\n\r\nfor i, l in enumerate(word):\r\n if (l == 'h' and result == \"\") or (l == 'e' and result == \"h\") or (l == 'l' and (result == \"he\" or result == \"hel\")) or (l == 'o' and result == \"hell\"):\r\n result += l\r\n\r\nif result == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\\\r\n\r\narr = input()\r\nc='hello'\r\nflag=0\r\nindex=0\r\nfor i in arr:\r\n if c[index]==i:\r\n index+=1\r\n if index>4:\r\n break\r\nif index>4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "s = str(input())\r\nS = \"hello1\"\r\ncnt=0\r\nfor i in s:\r\n if i==S[cnt]:\r\n cnt+=1\r\nprint(\"YES\" if cnt==5 else \"NO\")\r\n", "message = input().lower()\r\ngreeting = list(\"hello\")\r\n\r\nwords = 0\r\nc = -1\r\nfor i in greeting:\r\n while c + 1 < len(message):\r\n c += 1\r\n if i == message[c]:\r\n words += 1\r\n break\r\n\r\nif words == len(greeting):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\nimport math\r\ndef srch(s, c, p):\r\n for i in range(p + 1, len(s)):\r\n if (s[i] == c):\r\n return i\r\n return -1\r\ndef haveHello(s):\r\n n = \"hello\"\r\n k = -1\r\n for c in n:\r\n k = srch(s, c, k)\r\n if (k == -1):\r\n return False\r\n return True\r\ns = input()\r\nif (haveHello(s)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nn = len(a)\r\ncur = 0\r\nfound = False\r\nresult = False\r\nwhile (not found) and cur < n :\r\n if a[cur] == \"h\" :\r\n found = True\r\n cur += 1\r\nfound = False\r\nwhile not found and cur < n :\r\n if a[cur] == \"e\" :\r\n found = True\r\n cur += 1\r\nfound = False\r\nwhile not found and cur < n :\r\n if a[cur] == \"l\" :\r\n found = True\r\n cur += 1\r\nfound = False\r\nwhile not found and cur < n :\r\n if a[cur] == \"l\" :\r\n found = True\r\n cur += 1\r\nfound = False\r\nwhile not found and cur < n :\r\n if a[cur] == \"o\" :\r\n found = True\r\n result = True\r\n cur += 1 \r\nif result :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "l=input()\r\nans='hello'\r\nk=0\r\nf=0\r\ncount=0\r\nfor i in range(len(l)):\r\n \r\n if ans[k]==l[i]:\r\n count+=1\r\n k+=1\r\n if count==5:\r\n f=1\r\n break\r\n \r\nif f==0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n", "s = input()\r\nind = 0\r\nfor c in s:\r\n if c == 'hello'[ind]:\r\n if ind == 4:\r\n print('YES')\r\n break\r\n ind += 1\r\nelse:\r\n print('NO')", "\n\n\ns = input()\n\n\ntarg = \"hello\"\n\npos = 0\nc = 0\nwhile pos < len(s):\n char = s[pos]\n if char==targ[c]:\n c += 1\n pos += 1\n else:\n pos += 1\n if c==5:\n break\nif c==5:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s = input()\r\nf = 'hello'\r\nstart = -1\r\nfor i in f:\r\n start = s.find(i, start + 1)\r\n if start == -1:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "word=\"hello\"\r\ni=0\r\ns=input()\r\nfor h in range(len(s)):\r\n if s[h]==word[i]:\r\n i+=1\r\n if i==len(word):\r\n break\r\nprint(\"YES\" if i==len(word) else \"NO\")\r\n", "a=input()\r\ns=len(a)\r\ncount=0\r\nfor i in range(s):\r\n if count==0 and a[i]=='h':\r\n count+=1\r\n elif count==1 and a[i]=='e':\r\n count+=1\r\n elif count==2 and a[i]=='l':\r\n count+=1\r\n elif count==3 and a[i]=='l':\r\n count+=1\r\n elif count==4 and a[i]=='o':\r\n count+=1\r\nif(count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = list(input())\r\nhello = list('hello')\r\nlist_for_hello = list()\r\nfor i in hello:\r\n if i in word:\r\n word = word[word.index(i) + 1:]\r\n list_for_hello.append(i)\r\nif list_for_hello == hello:\r\n print(\"YES\")\r\nelse:\r\n print('NO')\r\n", "import re\r\n\r\ns = input()\r\n\r\nx = re.search(\"^[a-z]*[h][a-z]*[e][a-z]*[l][a-z]*[l][a-z]*[o][a-z]*$\", s)\r\n\r\nif (x):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\r\nmessage=input()\r\n\r\nif re.match(r'.*h.*e.*l.*l.*o.*',message):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n# dict={}\r\n# string=['h','e','l','l','o']\r\n# for i in range(len(message)):\r\n# if message[i]==string[0]:\r\n# print(message[i])\r\n# if message[i] == string[0]:\r\n# print( message[i] )\r\n\r\n# if message[i] in string:\r\n# if message[i] in dict:\r\n# temp=dict[message[i]]\r\n# dict[message[i]]=temp+1\r\n# else:\r\n# dict[message[i]] = 1\r\n#\r\n# if dict[\"h\"]>=1 and dict[\"e\"]>=1 and dict[\"l\"]>=2 and dict[\"o\"]>=1:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n# print(dict[\"h\"]>=1)\r\n # print(message[i])\r\n# temp=set(temp)\r\n# temp2=set(string)\r\n\r\n# if temp==temp2:\r\n# print(True)\r\n# else:\r\n# print(False)", "string = input()\r\nmsg = \"hello\"\r\nj = 0 \r\ncount = 0\r\nfor i in range(len(string)):\r\n if string[i] == msg[j]:\r\n j+=1\r\n count+=1\r\n if count == 5:\r\n break\r\nif count == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\na=list(\"hello\")\r\ni=0\r\n\r\nfor j in s:\r\n if j==a[i]:\r\n i+=1\r\n if i>=5:\r\n break\r\nif i==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n ", "a = input()\r\nres = \"NO\"\r\nfor i in range(0,len(a)):\r\n if a[i] == \"h\":\r\n for j in range(i + 1,len(a)):\r\n if a[j] == \"e\":\r\n for w in range(j + 1,len(a)):\r\n if a[w] == \"l\":\r\n for r in range(w + 1,len(a)):\r\n if a[r] == \"l\":\r\n for h in range(r + 1,len(a)):\r\n if a[h] == \"o\":\r\n res = \"YES\"\r\nprint(res)\r\n", "s=input().strip()\r\np='hello'\r\ni=0\r\nj=0\r\nn=len(s)\r\nwhile(i<5 and j<n):\r\n if(p[i]==s[j]):\r\n i+=1\r\n j+=1 \r\nif(i==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nm=list(n)\r\nh=0\r\nfor i in \"hello\":\r\n if i in m:\r\n s=m.index(i)\r\n m=m[s+1:]\r\n else:\r\n h=1\r\n print(\"NO\")\r\n break\r\nif h==0:\r\n print(\"YES\")\r\n \r\n \r\n \r\n", "s=input()\r\nif set(s).issuperset(set('hello')):\r\n word='hello'\r\n pos,con=0,True\r\n for i in s:\r\n if i==word[pos]:pos+=1\r\n if pos==5:\r\n con=False\r\n break\r\n else:print('NO')\r\n if con==False:print(\"YES\")\r\nelse:print('NO')\r\n", "hi = input()\r\ntest = \"hello\"\r\npoint = 0\r\ni = 0\r\nwhile i < len(hi):\r\n if point < len(test) and hi[i] == test[point]:\r\n point += 1\r\n i += 1\r\n\r\nif point == len(test):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nl=list(n)\r\nm=len(l)\r\nh=0\r\ne=0\r\nl0=0\r\nll=0\r\no=0\r\n\r\nfor a in range(m):\r\n if l[a]=='h':\r\n h=a\r\n break\r\n\r\nfor i in range(h,m):\r\n if l[i]=='e':\r\n e=i\r\n break\r\n\r\nfor j in range(e,m):\r\n if l[j]=='l':\r\n l0=j\r\n break\r\n\r\nfor k in range(l0+1,m): #不能再取l0\r\n if l[k]=='l':\r\n ll=k\r\n break\r\n\r\n\r\nfor u in range(ll,m):\r\n if l[u]=='o':\r\n o=u\r\n break\r\n\r\nif h<e<l0<ll<o:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "string = \"hello\"\r\ncount = 0\r\ncf_input = str(input())\r\n\r\nfor letter in cf_input:\r\n if letter == string[count]:\r\n count += 1\r\n if count == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "\nfrom sys import stdin, stdout\n\ns = stdin.readline().strip()\n\nfind = 'hello'\ni = 0\n\nfor c in s:\n if c == find[i]:\n i += 1\n\n if i == 5:\n stdout.write('YES\\n')\n break\nelse:\n stdout.write('NO\\n')\n", "l =['h','e','l','l','o']\r\nst = input()\r\nk =0\r\nfor i in range(len(st)):\r\n if l[k] ==st[i]:\r\n k +=1\r\n if k ==5:\r\n break\r\nprint('YES' if k==5 else 'NO')", "s=list(input())\r\nl=list(\"hello\")\r\n#print(s)\r\nidx=0\r\ncnt=0\r\nfor x in s:\r\n # print(x,l[idx])\r\n if(x == l[idx]):\r\n idx=idx+1\r\n cnt=cnt+1\r\n if idx==5:\r\n break\r\nif cnt is 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n\r\n", "Srtring = str(input())\r\nliststring = list(Srtring)\r\nhello = ['h' , 'e' , 'l' , 'l' , 'o']\r\npas = 0\r\nj = 0\r\nfor i in range(len(liststring)):\r\n if liststring[i] == hello[j]:\r\n j += 1\r\n pas += 1\r\n \r\n if pas == 5:\r\n break\r\nif pas == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "aw = \"hello\"\n \ndef hello():\n c = 0\n s = input()\n for i in range(len(s)):\n if s[i] == aw[c]:\n c += 1\n if c == 5:\n return \"YES\"\n return \"NO\"\nprint(hello())", "m=\"hello\"\r\ndef chatroom(s):\r\n x=0\r\n for i in range(len(s)):\r\n if(s[i]==m[x]):\r\n x+=1\r\n if(x==5):\r\n return \"YES\"\r\n return \"NO\"\r\nif __name__ ==\"__main__\":\r\n s=input()\r\n print(chatroom(s))\r\n", "\r\nstring=input()\r\nh=0\r\ne=0\r\nl=0\r\no=0\r\nfor i in range(len(string)):\r\n if string[i]=='h':\r\n h=1\r\n elif(h and string[i]=='e'):\r\n e=1\r\n elif(h and e and string[i]=='l'):\r\n l=l+1\r\n elif(h and e and l>=2 and string[i]=='o'):\r\n o=1\r\n break\r\n\r\nif(o==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n# print(h,e,l,o)\r\n\r\n", "s=input()\r\na='hello'\r\nidx=0\r\nfor i in range(len(s)):\r\n if(s[i]==a[idx]):\r\n idx += 1\r\n if idx == 5:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "s = input()\nword = \"hello\"\n\nfor c in s:\n\tif c == word[0]:\n\t\tword = word[1:]\n\t\tif word == \"\":\n\t\t\tbreak\n\nprint(\"YES\" if word == \"\" else \"NO\")\n", "s = input()\r\nn = 0\r\nfor x in \"hello\":\r\n n = s.find(x, n)\r\n if n == -1:\r\n print('NO')\r\n break\r\n n += 1\r\nelse:\r\n print('YES')\r\n", "n=input()\r\nc=False\r\nif(n.find(\"h\")!=-1):\r\n n=n[n.find(\"h\")+1:]\r\n if(n.find(\"e\")!=-1):\r\n n=n[n.find(\"e\")+1:]\r\n if(n.find(\"l\")!=-1):\r\n n=n[n.find(\"l\")+1:]\r\n if(n.find(\"l\")!=-1):\r\n n=n[n.find(\"l\")+1:]\r\n if(n.find(\"o\")!=-1):\r\n c=True\r\nif(c):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\np='hello'\r\nk=0\r\nfor i in range(len(s)):\r\n if s[i]==p[k]:\r\n k+=1\r\n if k>=len(p):\r\n break\r\nif k==len(p):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "a = input()\r\nx = 'hello'\r\nn = len(x)\r\ntmp = i = 0\r\nind = -1\r\nwhile i != n and tmp != -1:\r\n tmp = ind = a.find(x[i], ind+1)\r\n i += (ind != -1)\r\nprint('NO' if i != n else 'YES')\r\n", "def Chat_room():\r\n greeting = input()\r\n h = greeting.find(\"h\")\r\n e = len(greeting[:h+1]) + greeting[h+1:].find(\"e\")\r\n f_l = len(greeting[:e+1]) + greeting[e+1:].find(\"l\")\r\n s_l = len(greeting[:f_l+1]) + greeting[f_l+1:].find(\"l\")\r\n o = len(greeting[:s_l+1]) + greeting[s_l+1:].find(\"o\")\r\n if h < e < f_l < s_l < o and (h != e != f_l != s_l != o):\r\n return \"YES\"\r\n return \"NO\"\r\nprint(Chat_room())", "word = input()\r\nhello = list(\"hello\")\r\ncounter = 0\r\nfor i in range(len(word)):\r\n if word[i] == hello[counter]:\r\n counter += 1\r\n if counter > 4:\r\n break\r\nif counter > 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\na = s.find('h')\r\nb = s.find('e', a+1)\r\nc = s.find('l', b+1)\r\nd = s.find('l', c+1)\r\ne = s.find('o', d+1)\r\n\r\nif a<b<c<d<e:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nA=['h','e','l','l','o']\r\nj=0;ans=0\r\nfor i in range(len(s)):\r\n if(s[i]==A[j] and ans==j):\r\n j+=1\r\n ans+=1\r\n if(ans==5):\r\n break\r\nif(ans==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import os,random\r\nfrom bisect import bisect_left, bisect_right\r\nfrom sys import stdin,setrecursionlimit\r\nfrom itertools import count,accumulate\r\nfrom collections import defaultdict, deque, Counter\r\nfrom functools import reduce,lru_cache\r\nfrom io import IOBase, BytesIO\r\nfrom operator import xor, add\r\n\r\nlines = stdin.readlines()\r\nlines.reverse()\r\nsetrecursionlimit(10**8)\r\ndef input():\r\n return lines.pop().strip(\"\\n\")\r\n\r\ns = input()\r\nh,j = ['h','e','l','l','o'],4\r\nfor i in range(len(s)-1,-1,-1):\r\n if s[i] == h[j]:\r\n h.pop()\r\n j-=1\r\n if j ==-1:\r\n break\r\nprint(\"NO\") if len(h)>0 else print(\"YES\")\r\n \r\n", "s=str(input())\r\nsaludo = \"hello\"\r\ni=0\r\nfor c in s:\r\n if(c == saludo[i]):\r\n i += 1\r\n if i == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s = input()\r\ni = 0\r\nyes = False\r\nfor c in s:\r\n if c == 'hello'[i]:\r\n i += 1\r\n if i == 5:\r\n yes = True\r\n break\r\nprint('YES' if yes else 'NO')", "s=input()\r\nif s==\"hello\":\r\n print(\"YES\")\r\nelif len(s)<=5:\r\n print(\"NO\")\r\nelse:\r\n seek='hello'\r\n index=0\r\n for i in s:\r\n if i==seek[index]:\r\n index+=1\r\n if index>4:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n", "import re\r\n\r\ns = input().lower()\r\nif re.findall('h+\\w*e+\\w*l+\\w*l+\\w*o+\\w*', s):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "word = input()\r\ntry:\r\n word = word[word.index(\"h\"):]\r\n word = word[word.index(\"e\"):]\r\n word = word[word.index(\"l\")+1:]\r\n word = word[word.index(\"l\"):]\r\n word = word[word.index(\"o\"):]\r\n print(\"YES\")\r\nexcept ValueError:\r\n print(\"NO\")\r\n", "import re\r\ns = input()\r\nx = re.search((\"(.*)h(.*)e(.*)l(.*)l(.*)o(.*)\") , s)\r\n\r\n\r\nprint(\"YES\" if x else \"NO\")", "a=input()\r\nh=\"hello\"\r\nz=0\r\nans=\"NO\"\r\nfor i in a:\r\n if i==h[z]:\r\n z+=1\r\n if z==5:\r\n ans=\"YES\"\r\n break\r\nprint(ans)", "x=list(input())\r\nif 'h' in x:\r\n a=x.index('h')\r\n x=x[a+1:]\r\n if 'e' in x:\r\n b=x.index('e')\r\n x=x[b+1:]\r\n if 'l'in x:\r\n c=x.index('l')\r\n x=x[c+1:]\r\n if 'l' in x:\r\n d=x.index('l')\r\n x=x[d+1:]\r\n if 'o' in x:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n \r\n ", "word = input()\r\n\r\n\r\ntest = 'hello'\r\np = 0\r\n\r\nfor i in range(len(word)):\r\n if p < len(test) and word[i] == test[p]:\r\n p += 1\r\nif p == 5:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "string = input()\r\nhello = 'hello'\r\nj = 0\r\nfor i in string:\r\n if i == hello[j]:\r\n j += 1\r\n if j == 5:\r\n break\r\nif j == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nc = list(s)\r\nfor i in s:\r\n if i not in \"hello\":\r\n c.remove(i)\r\n\r\ni = 0\r\nflag = False\r\nwhile i < len(c):\r\n if c[i] == \"h\":\r\n for j in range(i,len(c)):\r\n if c[j] == \"e\":\r\n for h in range(j,len(c)):\r\n if c[h] == \"l\":\r\n for k in range(h+1,len(c)):\r\n if c[k] == \"l\":\r\n \r\n for m in range(k,len(c)):\r\n if c[m] == \"o\":\r\n print(\"YES\")\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n if flag:\r\n break\r\n if flag:\r\n break\r\n if flag:\r\n break\r\n if flag:\r\n break\r\n i+=1\r\n \r\nif flag == False:\r\n print(\"NO\")", "ch=input()\r\nk=0\r\nfor i in range(0,len(ch)):\r\n if ch[i]=='h' and k==0:\r\n k=1\r\n elif ch[i]=='e' and k==1:\r\n k=2\r\n elif ch[i]=='l' and k==2:\r\n k=3\r\n elif ch[i]=='l' and k==3:\r\n k=4\r\n elif ch[i]=='o' and k==4:\r\n k=5\r\n break\r\nif k==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nhello = \"hello\"\r\nhelloPtr = 0\r\nptr = 0\r\nwhile ptr < len(s) and helloPtr < len(hello):\r\n if s[ptr] == hello[helloPtr]:\r\n helloPtr += 1\r\n ptr += 1\r\nif helloPtr == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input().strip()\r\na = \"hello\"\r\nc = 0\r\nfor letter in s:\r\n if letter == a[c]:\r\n c += 1\r\n\r\n if c == len(a):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "def main():\r\n s = input()\r\n pos = 0\r\n target = \"hello\"\r\n\r\n for char in target:\r\n while pos < len(s) and s[pos] != char:\r\n pos += 1\r\n pos += 1\r\n\r\n if pos <= len(s):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\r\nh = \"hello\"\r\nx = 0\r\nj = 0\r\n\r\nfor i in range(len(s)):\r\n\tif s[i] == h[j]:\r\n\t\tj += 1\r\n\t\tx += 1\r\n\tif x == 5:\r\n\t\tbreak\r\n\t\t\r\n\t\t\r\nif x == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def function(n):\r\n s='hello'\r\n j=0\r\n for i in n:\r\n if i==s[j]:\r\n j+=1\r\n if j>=5:\r\n return 'YES'\r\n return 'NO'\r\nn=input()\r\nprint(function(n))\r\n \r\n", "n = input()\r\ns = 0\r\nif \"h\" in n:\r\n s+=1\r\n n = n[n.index(\"h\")+1:]\r\nif \"e\" in n:\r\n n = n[n.index(\"e\")+1:]\r\n s+=1\r\nif \"l\" in n:\r\n n = n[n.index(\"l\")+1:]\r\n s+=1\r\nif \"l\" in n:\r\n n = n[n.index(\"l\")+1:]\r\n s+=1\r\nif \"o\" in n:\r\n n = n[n.index(\"o\")+1:]\r\n s+=1\r\nif s==5:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "\r\nimport re\r\nm = input()\r\nmatchObj = re.search('.*h.*e.*l.*l.*o.*',m)\r\nif matchObj:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import re;\r\nprint(\"YES\"if re.search(\"h.*e.*l.*l.*o\",input())else\"NO\")", "s = input().lower()\r\ndp = [0]*5\r\ndata = 'hello'\r\ncnt = 0\r\nfor c in s:\r\n if c == data[cnt]:\r\n dp.insert(cnt,1)\r\n cnt += 1\r\n\r\n if cnt == 5:\r\n break\r\na=sum(dp)\r\nif int(a) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t=input()\r\nk=\"hello\"\r\ng=\"\"\r\ni=0\r\nfor j in t:\r\n\tif k[i]==j:\r\n\t\tif j not in g or (i==3 and j==g[2]):\r\n\t\t\tg+=k[i]\r\n\t\t\ti+=1\r\n\t\tif g==k:break\r\nprint(\"YES\" if g==k else \"NO\")", "s=input()\r\nf=['h','e','l','l','o']\r\nj=0\r\nk=0\r\nfor i in s:\r\n if i==f[j]:\r\n j+=1\r\n if j==5:\r\n print('YES')\r\n k=1\r\n break\r\n \r\nif k==0:\r\n print('NO')\r\n", "a=input()\r\nb=['h','e','l','l','o']\r\nc=0\r\nfor i in range(len(a)):\r\n if a[i]==b[c]:\r\n c+=1\r\n if c==len(b):\r\n print(\"YES\")\r\n break\r\nif c!=len(b):\r\n print(\"NO\")\r\n ", "import re\r\ns=input()\r\npattern=\"h+\\w*e+\\w*l+\\w*l+\\w*o+\\w*\"\r\nanwser=re.search(pattern,s)\r\nif anwser:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nj = 0\r\nc1 = 0\r\nh = \"hello\"\r\nfor i in range(len(s)):\r\n if s[i] == h[j]:\r\n j += 1\r\n c1 += 1\r\n if c1 == 5:\r\n break\r\nif c1 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x='hello'\r\ns=str(input())\r\ndef chat():\r\n y=0\r\n for i in s:\r\n if i==x[y]:\r\n y=y+1\r\n if y==5:\r\n return'YES'\r\n return 'NO'\r\nprint(chat())\r\n ", "s = input()\r\nhello = 'hello '\r\nc = 0\r\nx = ''\r\nfor i in s:\r\n if hello[c] == i:\r\n c = c + 1\r\n x = x + i\r\nhello = hello[:-1]\r\nif hello == x:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jan 9 13:52:25 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\ns = input()\r\nk = ['h','e','l','l','o']\r\ni = 0\r\nj =0\r\nwhile i<len(s):\r\n if s[i]==k[j]:\r\n j+=1\r\n i+=1\r\n if j==5:\r\n break\r\nif j==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n ", "word = input()\r\nidx = 0\r\ni = 0\r\nlength = len(word)\r\nhello = 'hello'\r\nwhile idx != -1 and i <=4:\r\n\tidx = word.find(hello[i])\r\n\tif(idx!=-1):\t\r\n\t\ta = min(idx + 1, length)\r\n\t\tword = word[a:]\r\n\t\ti = i + 1\r\nif(idx == -1):\r\n\tprint ('NO')\r\nelse:\r\n\tprint('YES')", "#Seyed_Mehrshad_Hosseini\r\n# 2 oct 2019\r\ns=input()\r\nm=\"hello\"\r\no=0\r\nfor i in range(len(s)):\r\n if s[i]==m[o]:\r\n o+=1\r\n if o==5:\r\n break\r\nprint(\"YES\" if o==5 else \"NO\")\r\n\r\n", "a=input()\r\ns=0\r\nfor i in range(len(a)):\r\n if s==0 and a[i]=='h':\r\n s+=1\r\n if s==1 and a[i]=='e':\r\n s+=1\r\n if (s==2 or s==3) and a[i]=='l':\r\n s+=1\r\n if s==4 and a[i]=='o':\r\n s+=1\r\nif s==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ns1=\"hello\"\r\nj=0\r\nfor i in s:\r\n if(i in s1 and j<5 and i==s1[j]):\r\n j=j+1\r\nif(j==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "st = input()\r\ndef findh(st,h):\r\n n = len(st)\r\n for i in range(n):\r\n if st[i] == h:\r\n nst = st[(i+1):]\r\n return nst\r\n return 0\r\nn = 0\r\nfor i in [\"h\",\"e\",\"l\",\"l\",\"o\"]:\r\n if findh(st,i) != 0:\r\n st = findh(st,i)\r\n n = n+1\r\n else:\r\n n = n\r\nif n == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def hello(s):\r\n h = s.find('h')\r\n e = s.find('e', h) \r\n l1 = s.find('l', e)\r\n l2 = s.find('l', l1 + 1)\r\n o = s.find('o', l2)\r\n k = s[h] + s[e] + s[l1] + s[l2] + s[o] \r\n if k == 'hello':\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\ns = input()\r\nhello(s)", "word = input()\r\nhello = \"hello\"\r\ncomplete = \"\"\r\nfor i in range(len(hello)):\r\n for j in range(len(word)):\r\n if hello[i] == word[j]:\r\n word = word[j+1:]\r\n complete+=hello[i]\r\n break\r\nif complete == hello:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\nimport re\ns = re.sub(r'.*h.*e.*l.*l.*o.*','',sys.stdin.readline().strip())\nif len(s) != 0:\n print('NO')\nelse:\n print('YES')", "s = input()\r\nhello_list = ['h','e','l','l','o']\r\nlist_counter=0\r\ncounter=0\r\nwhile list_counter<5 and counter<len(s):\r\n if s[counter]==hello_list[list_counter]:\r\n list_counter+=1\r\n counter+=1\r\nif list_counter==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nst = \"hello\"\r\ni = 0\r\nj = 0\r\nctr = 0\r\nwhile i < len(st) and j < len(s):\r\n if st[i] == s[j]:\r\n ctr += 1\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\nif ctr == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re;\r\nprint(\"YES\" if re.search(\"h.*e.*l.*l.*o\",input())else\"NO\")", "str=input()\r\na=[]\r\nb=[]\r\nc=[]\r\nd=[]\r\nt1=False\r\nt2=False\r\nfor i in range(len(str)):\r\n if str[i] == \"h\":\r\n a.append(i)\r\n elif str[i] == \"e\":\r\n b.append(i)\r\n elif str[i] == \"l\":\r\n c.append(i)\r\n elif str[i] == \"o\":\r\n d.append(i)\r\nif len(a)==0 or len(b)==0 or len(c)==0 or len(d)==0:\r\n print(\"NO\")\r\nelse:\r\n a1 = min(a)\r\n o1 = max(d)\r\n e1 = 0\r\n for i in b:\r\n if a1 < i < o1:\r\n t1 = True\r\n e1 = i\r\n break\r\n cx = 0\r\n for i in c:\r\n if e1 < i < o1:\r\n cx += 1\r\n if cx > 1:\r\n t2 = True\r\n break\r\n if t1 == True and t2 == True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a=input()\r\nhello='hello'\r\nz='YES'\r\nfor i in hello:\r\n try:\r\n x=a.index(i)\r\n a=a[x+1:]\r\n except:\r\n z='NO'\r\n break\r\nprint(z)", "l=input()\r\nl1=''\r\nfor i in l:\r\n if 'h' not in l1 and i=='h':\r\n l1+='h'\r\n if l1=='h' and i=='e':\r\n l1+='e'\r\n if l1 in ['he','hel'] and i=='l':\r\n l1+='l'\r\n if l1=='hell' and i=='o':\r\n l1+='o'\r\nif l1=='hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nword = \"hello\"\r\nind = 0\r\nfor a in s : \r\n if a== word[ind]:\r\n ind+=1\r\n if ind == len(word):\r\n break\r\nif ind == len(word):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w = str(input())\r\ncompareString = 'hello'\r\nj=0\r\nfor i in range(len(w)):\r\n if w[i] == compareString[j] :\r\n j+=1\r\n if j == len(compareString) :\r\n break\r\nif j == len(compareString) :\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\ngreet=\"hello\"\r\nc,j=0,0\r\nfor i in range(5):\r\n while True:\r\n if j==len(n):\r\n break\r\n if greet[i]==n[j]:\r\n c+=1\r\n j+=1\r\n break\r\n else:\r\n j+=1 \r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nk=\"hello\"\r\nc=0\r\nj=0\r\nfor i in range(len(s)):\r\n if(s[i]==k[j]):\r\n c+=1\r\n j+=1\r\n if(j>=len(k)):\r\n break\r\nif(c==len(k)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\n\r\nif 'h' in s:\r\n h_index = s.index('h')\r\nelse:\r\n print(\"NO\")\r\n exit()\r\n\r\n\r\nif 'e' in s[h_index+1:]:\r\n e_index = s.index('e', h_index+1)\r\nelse:\r\n print(\"NO\")\r\n exit()\r\n\r\nl_indices = [i for i, c in enumerate(s[e_index+1:]) if c == 'l']\r\nif len(l_indices) >= 2:\r\n l_index1 = l_indices[0] + e_index + 1\r\n l_index2 = l_indices[1] + e_index + 1\r\nelse:\r\n print(\"NO\")\r\n exit()\r\nif 'o' in s[l_index2+1:]:\r\n o_index = s.index('o', l_index2+1)\r\nelse:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "st = input()\nst2=\"hello\"\nk=0\nfor s in st:\n if(k==5):\n break;\n if(s == st2[k]):\n k += 1;\nif(k == 5):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s=input()\r\ns1=\"hello\"\r\np1=0\r\np2=0\r\ncount=0\r\nwhile(p1<len(s) and p2<len(s1)):\r\n if(s[p1]==s1[p2]):\r\n count+=1\r\n p1+=1\r\n p2+=1\r\n else:\r\n p1+=1\r\nif(count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def say_hello(s):\r\n hello = \"hello\"\r\n i = 0\r\n for letter in s:\r\n if letter == hello[i]:\r\n i += 1\r\n if i == len(hello):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\ns = input()\r\nresult = say_hello(s)\r\nprint(result)\r\n", "s=input()\r\nc=0;\r\nfor i in range(0,len(s)):\r\n if c==0:\r\n if (s[i]=='h') :\r\n c+=1\r\n elif c==1:\r\n if (s[i]=='e') :\r\n c+=1\r\n elif c==2:\r\n if (s[i]=='l') :\r\n c+=1\r\n elif c==3:\r\n if (s[i]=='l') :\r\n c+=1\r\n elif c==4:\r\n if (s[i]=='o') :\r\n c+=1\r\nif (c==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "q=input()\r\nq=list(q)\r\nw='hello'\r\ny=[]\r\nfor i in w:\r\n try:\r\n a=q.index(i)\r\n y.append(i)\r\n q=q[a+1:]\r\n except:\r\n print('NO')\r\n break\r\nif len(y)==5:\r\n print('YES')\r\n\r\n", "s=input()\r\nh=e=l1=l2=o=114514\r\nfor i in range(0,len(s)):\r\n if s[i]=='h'and h==114514:\r\n h=i\r\n continue\r\n if s[i]=='e' and e==114514 and i>h:\r\n e=i\r\n continue\r\n if s[i]=='l' and l1==114514 and i>e:\r\n l1=i\r\n continue\r\n if s[i]=='l' and l1!=114514 and l2==114514 and i>l1:\r\n l2=i\r\n continue\r\n if s[i]=='o' and o==114514 and i>l2:\r\n o=i\r\nif h<e<l1<l2<o and o!=114514:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \"\"\"\r\n print(h)\r\n print(e)\r\n print(l1)\r\n print(l2)\r\n print(o)\r\n \"\"\"", "# Problem: A. Chat room\r\n# Contest: Codeforces - Codeforces Beta Round #54 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/58/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# \r\n# Powered by CP Editor (https://cpeditor.org)\r\n\r\n\r\ndef solve(string):\r\n\tword = \"hello\"\r\n\tindex = 0\r\n\tfor i in range(0,len(string)):\r\n\t\tif(string[i] == word[index]):\r\n\t\t\tindex += 1\r\n\t\tif(index == 5):\r\n\t\t\treturn \"YES\"\r\n\t\t\t\r\n\tif(index < 5):\r\n\t\treturn \"NO\"\r\n\telse:\r\n\t\treturn \"YES\"\r\n\r\nif __name__ == \"__main__\":\r\n\r\n\tstring = str(input())\r\n\tprint(solve(string))", "word = input()\r\nref = \"hello\"\r\n\r\ni = 0\r\nj = 0\r\ncount = 0\r\n\r\nfor i in range(len(word)):\r\n\tif word[i] == ref[j]:\r\n\t\tj+=1\r\n\t\tcount+=1\r\n\tif count == 5:\r\n\t\tbreak\r\n\r\nif count == 5: print(\"YES\")\r\nelse: print(\"NO\")", "def can_say_hello(word):\r\n hello = \"hello\"\r\n j = 0\r\n for i in range(len(word)):\r\n if word[i] == hello[j]:\r\n j += 1\r\n if j == len(hello):\r\n return True\r\n return False\r\n\r\n# Read the input word\r\nword = input().strip()\r\n\r\n# Check if Vasya can say hello\r\nif can_say_hello(word):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\na=['h','e','l','l','o']\r\ni=0\r\nf=0\r\nfor j in s:\r\n if j==a[i]:\r\n i+=1\r\n if (i==len(a)):\r\n f=1\r\n break\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def f ():\r\n s = input()\r\n a = 'hello'\r\n j = 0\r\n for x in s:\r\n if x==a[j]:\r\n j+=1\r\n if j==len(a):\r\n return True\r\n return False\r\n\r\nif f() :\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from re import search\r\nprint(\"YES\" if search(r'h.*e.*l.*l.*o', input()) else \"NO\")", "s = input()\r\nk = len(s)\r\nflag = False\r\nfor a in range(k):\r\n for b in range(a + 1, k):\r\n for c in range(b + 1, k):\r\n for d in range(c + 1, k):\r\n for e in range(d + 1, k):\r\n if s[a] + s[b] + s[c] + s[d] + s[e] == 'hello':\r\n flag = True\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nstate = 0\r\n\r\nfor c in s:\r\n if c == \"h\" and state == 0:\r\n state += 1\r\n elif c == \"e\" and state == 1:\r\n state += 1\r\n elif c == \"l\" and (state == 2 or state == 3):\r\n state += 1\r\n elif c == \"o\" and state == 4:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s = input().lower()\r\nh = s.find('h')\r\ne = s.find('e', h + 1)\r\nl1 = s.find('l', e + 1)\r\nl2 = s.find('l', l1 + 1)\r\no = s.find('o', l2 + 1)\r\nif h < e < l1 < l2 < o:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "str = input()\r\nhello = \"hello\"\r\n\r\n\r\ndef is_hello(s, h):\r\n idx = -1\r\n for x in h:\r\n idx = s.find(x, idx + 1, len(s))\r\n if (idx == -1):\r\n return False\r\n return True\r\n\r\n\r\nif is_hello(str, hello):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nch='hello'\r\ni=0\r\nj=0\r\nwhile (i<len(ch)):\r\n if ch[i]==s[j]:\r\n i=i+1\r\n j=j+1\r\n if j==len(s):\r\n break\r\n\r\n\r\nif i==len(ch):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "input = input()\r\ncheck = 'hello'\r\nindex = 0\r\nfor i in range(len(input)):\r\n if index > 4:\r\n break\r\n if input[i] == check[index]:\r\n index = index + 1\r\n\r\nif index == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\n\nstring = input()\nmas = []\nnewmas = [] \n\nfor i in string:\n\tif i == 'h':\n\t\tmas.append(i)\n\t\t\t\t\n\tif i == 'e':\n\t\tmas.append(i)\n\t\t\t\t\n\tif i == 'l':\n\t\tmas.append(i)\n\t\t\t\t\n\tif i == 'o':\n\t\tmas.append(i)\n\t\nword = ''.join(mas)\n#print(word)\n\npattern = (r'\\w*h\\w*e\\w*l\\w*l\\w*o\\w*')\n\nregex = re.fullmatch (pattern, word)\n\nif regex:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "entrada = input()\r\npalavra = \"hello\"\r\nres = \"\"\r\naux = 0\r\nfor i in palavra:\r\n for j in range(aux, len(entrada)):\r\n if entrada[j] == i:\r\n res+=i\r\n aux = j+1\r\n break\r\nif res == palavra:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "hello_word = \"hello\"\r\n\r\nword = input()\r\n\r\ncounter = 0\r\n\r\nfor i in range(len(word)):\r\n if (counter != 5 and word[i] == hello_word[counter]):\r\n counter += 1\r\n \r\n \r\nif counter == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "H = [\"h\",\"e\", \"l\", \"l\", \"o\"]\r\n\r\ns = input()\r\nres =\"\"\r\nj =0\r\ncc =0\r\nfor i in s:\r\n\tif i == H[j]:\r\n\t\tres+=i\r\n\t\tj+=1\r\n\t\tif j > 4:\r\n\t\t\tbreak\r\nif res == \"hello\":\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "s=input()\r\nchr=\"hello\"\r\nans=\"YES\"\r\nfor c in chr:\r\n p=s.find(c)\r\n if p==-1:\r\n ans=\"NO\"\r\n break\r\n else:\r\n s=s[p+1:]\r\n\r\nprint(ans)\r\n\r\n", "s = input()\r\na = \"hello\"\r\nk = 0\r\nfor i in s:\r\n if i == a[k]:\r\n k+=1\r\n if k == 5:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "s=input()\r\nb=\"hello\"\r\ncount=0\r\nj=0\r\nfor i in range(0,len(b)):\r\n while(j<len(s)):\r\n if(b[i]==s[j]):\r\n count=count+1\r\n j=j+1\r\n break\r\n j=j+1 \r\nif(count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "s = input()\r\ni = 0\r\nb = 'hello'\r\nfor j in s:\r\n\tif j==b[i]:\r\n\t\ti+=1\r\n\tif i==5:\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")", "word = input()\r\ntarget = \"hello\"\r\nfound = False\r\ncounter = 0\r\n\r\nfor counter1 in range(len(word)):\r\n if word[counter1] == target[counter] :\r\n counter = counter+1\r\n\r\n if counter == len(target):\r\n print(\"YES\")\r\n found = True\r\n break\r\n \r\n\r\n\r\nif found == False:\r\n print(\"NO\")", "ind,inp = 0,input()\r\nfor i in \"hello\":\r\n if i in inp[ind:]:\r\n ind = inp.index(i,ind)+1\r\n else: print(\"NO\"); exit()\r\nprint(\"YES\")", "s=input()\r\nx=\"hello\"\r\nc=0\r\nif len(s)>=len(x):\r\n for i in x:\r\n if i in s:\r\n p=s.index(i)\r\n s=s[p+1:]\r\n c=c+1\r\n if c==5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "word = input()\r\ni=0\r\nb=\"\"\r\nm=len(word)\r\nif i <= m-1:\r\n if word.find(\"h\",i,m-1)>=0:\r\n n=word.find(\"h\",i,m-1)\r\n if word.find(\"e\",n+1,m-1)>=0:\r\n j= word.find(\"e\",n+1,m-1)\r\n if word.find(\"l\",j+1,m-1)>=0:\r\n k= word.find(\"l\",j+1,m-1)\r\n if word.find(\"l\",k+1,m-1)>=0:\r\n l= word.find(\"l\",k+1,m-1)\r\n if word.find(\"o\",l+1,m)>=0:\r\n b=\"YES\"\r\n print(b) \r\n \r\nif b!=\"YES\" :\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "a = input()\r\ndef f(n,k):\r\n for j in range(len(n)):\r\n if n[j] == k:\r\n s = j\r\n break\r\n else:\r\n s = len(n) - 1\r\n return n[s+1:]\r\nb = f(a,'h')\r\nc = f(b,'e')\r\nd = f(c,'l')\r\ne = f(d,'l')\r\nif e:\r\n if 'o' in e:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "def chat():\r\n a = input()\r\n if 'h' in a and a.count('l') > 1:\r\n a = a[a.index('h')+1:]\r\n if 'e' in a:\r\n a = a[a.index('e')+1:]\r\n if 'l' in a:\r\n a = a[a.index('l')+1:]\r\n if 'l' in a:\r\n a = a[a.index('l')+1:]\r\n if 'o' in a:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO') \r\n else:\r\n print('NO')\r\n\r\nchat()\r\n\r\n", "def if_string_ok(needed_string='hello'):\n s = input()\n i = 0\n j = 0\n while i < len(s) and j != len(needed_string):\n if s[i] == needed_string[j]:\n j += 1\n i += 1\n if j == len(needed_string):\n return 'YES'\n else:\n return 'NO'\n\nprint(if_string_ok())\n", "s=input()\r\nt=0\r\nc=0\r\np=\"hello\"\r\nk=\"\"\r\nfor i in s:\r\n if i.lower() in p:\r\n if i.lower()==\"l\" and c<2:\r\n c+=1\r\n k+=i.lower()\r\n if k[t]==p[t]:\r\n t+=1\r\n continue\r\n else:\r\n k=k[:-1]\r\n c-=1\r\n elif i.lower() in k:\r\n pass\r\n else:\r\n k+=i.lower()\r\n if k[t]==p[t]:\r\n t+=1\r\n continue\r\n else:\r\n k=k[:-1]\r\nif k==p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input ()\r\nword = 'hello'\r\ncount = 0\r\noutput = 'NO'\r\nfor char in s:\r\n if char == word [0]:\r\n count += 1\r\n if count == 5:\r\n output = 'YES'\r\n break\r\n else:\r\n word = word [1 : ]\r\nprint (output)", "a= 'hello'\r\ns=input()\r\nc=0\r\nfor k in range(len(s)):\r\n\tif (s[k]== a[c]): \r\n\t\tc+=1\r\n\tif c== 5:\r\n\t\tbreak\r\nif c== 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=input()\r\ns='hello'\r\nj=0\r\nfor i in n:\r\n if i==s[j]:\r\n j+=1\r\n if j==len(s):\r\n break\r\nif j==len(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\n\r\nprint('YES' if re.search(r'h.*e.*l.*l.*o', input()) else 'NO')\r\n", "s = input()\r\ncounter = 0\r\nfor i in range (0, len(s)):\r\n if s[i] == \"h\":\r\n counter += 1\r\n s = s[i+1:]\r\n break\r\nfor i in range(0, len(s)):\r\n if s[i] == \"e\":\r\n counter += 1\r\n s = s[i+1:]\r\n break\r\nfor i in range(0, len(s)):\r\n if s[i] == \"l\":\r\n counter += 1\r\n s = s[i+1:]\r\n break\r\nfor i in range(0, len(s)):\r\n if s[i] == \"l\":\r\n counter += 1\r\n s = s[i+1:]\r\n break\r\nfor i in range(0, len(s)):\r\n if s[i] == \"o\":\r\n counter += 1\r\n s = s[i+1:]\r\n break\r\nif counter == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t=\"hello\"\r\ndef chatroom():\r\n x=0\r\n txt=input()\r\n for i in range(len(txt)):\r\n if txt[i]==t[x]:\r\n x=x+1\r\n if x==5:\r\n return(\"YES\")\r\n return(\"NO\")\r\nprint(chatroom())", "s=input()\r\nz='hello'\r\nc=0\r\nfor i in s:\r\n if(i==z[c]):\r\n c=c+1\r\n if(c==5):\r\n print('YES')\r\n break\r\nif(c!=5):\r\n print('NO')", "word=input()\ncnt=0\nfor i in range(len(word)):\n if word[i]=='h':\n cnt+=1\n break\nfor i in range(i+1,len(word)):\n if word[i]=='e':\n cnt+=1\n break\nfor i in range(i+1,len(word)):\n if word[i]=='l':\n cnt+=1\n break\nfor i in range(i+1,len(word)):\n if word[i]=='l':\n cnt+=1\n break\nfor i in range(i+1,len(word)):\n if word[i]=='o':\n cnt+=1\n break\nif cnt==5:\n print (\"YES\")\nelse:\n print(\"NO\")", "# Read the input word\r\ns = input()\r\n\r\n# Initialize an index to track the current letter to search for\r\nindex = 0\r\n\r\n# Iterate through the characters in the word\r\nfor char in s:\r\n # Check if the current character matches the expected character\r\n if char == 'h' and index == 0:\r\n index += 1\r\n elif char == 'e' and index == 1:\r\n index += 1\r\n elif char == 'l' and (index == 2 or index == 3):\r\n index += 1\r\n elif char == 'o' and index == 4:\r\n index += 1\r\n\r\n# Check if all letters were found in order\r\nif index == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\ns1=\"hello\"\r\nj=0\r\nfor i in s:\r\n\tif i==s1[j]:\r\n\t\tj+=1\r\n\t\tif(j==5):\r\n\t\t\tbreak;\r\n \r\n\t\t\r\nif(j==5):\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "s = input()\r\nhello = 'hello'\r\nfor i in s:\r\n if(len(hello) == 0):\r\n break\r\n if(hello[0] == i):\r\n hello = hello[1:]\r\nif(len(hello)==0): print(\"YES\")\r\nelse: print(\"NO\")", "n = [i for i in input()]\nm = [0, 0, 0, 0]\nfor i in range(len(n)):\n if n[i] == 'h' and m[0] == 0:\n m[0] = 1\n else :\n pass\n if n[i] == 'e' and m[1] == 0 and m[0] == 1:\n m[1] = 1\n else :\n pass\n if n[i] == 'l' and (m[2] == 0 or m[2] == 1) and m[1] == 1 :\n m[2] += 1\n else :\n pass\n if n[i] == 'o' and m[2] == 2 and m[3] == 0 :\n m[3] = 1\n else :\n pass\nif m == [1, 1, 2, 1]:\n print('YES')\nelse :\n print('NO')", "state = 0\nfor i in input():\n if i == \"h\" and state == 0:\n state = 1\n elif i == \"e\" and state == 1:\n state = 2\n elif i == \"l\" and state == 2:\n state = 3\n elif i == \"l\" and state == 3:\n state = 4\n elif i == \"o\" and state == 4:\n state = 5\nif state == 5:\n print(\"YES\")\nelse:\n print(\"NO\")", "message = input()\r\ngoal = \"hello\"\r\ncount = 0\r\nprinted = False\r\n\r\nfor i in message:\r\n if i == goal[count]:\r\n count += 1\r\n\r\n if count == len(goal):\r\n print(\"YES\")\r\n printed = True\r\n break\r\n\r\nif not printed:\r\n print(\"NO\")", "a=input()\r\nh=a.find('h')\r\ne=a.find('e',h+1)\r\nl1=a.find('l',e+1)\r\nl2=a.find('l',l1+1)\r\no=a.find('o',l2+1)\r\nif h<e<l1<l2<o:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "ch=input()\r\nfrom re import *\r\nr='[a-zA-Z]*h[a-zA-Z]*e[a-zA-Z]*l[a-zA-Z]*l[a-zA-Z]*o[a-zA-Z]*'\r\nif search(r,ch):\r\n print('YES')\r\nelse:\r\n print('NO')", "string = input()\r\nword = \"hello\"\r\ni = 0\r\nfor c in range(len(string)):\r\n if string[c] == word[i]:\r\n i += 1\r\n if i == 5:\r\n break\r\n\r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nhello = \"hello\"\r\ny = 0\r\na = False\r\n\r\nfor x in range(len(s)):\r\n if s[x] == hello[y]:\r\n if y == 4:\r\n a = True\r\n if y < 4:\r\n y += 1\r\n\r\n\r\nif a == True:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "a=input()\r\np=\"hello\"\r\nl=0\r\n\r\nfor i in a:\r\n if l<=4 and i==p[l] :\r\n #print(i)\r\n l+=1\r\n #print(l)\r\n \r\nif l==5:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\") ", "def myfun(s):\r\n lst=['h','e','l','o']\r\n string='hello'\r\n new_s=''\r\n k=0\r\n for i in range(len(s)):\r\n if s[i] in lst:\r\n new_s+=s[i]\r\n for j in range(len(new_s)):\r\n if new_s[j]==string[k]:\r\n k+=1\r\n if k==5:\r\n break\r\n if k==5:\r\n return'YES'\r\n else:\r\n return 'NO'\r\n\r\n\r\n\r\ns=input()\r\nprint(myfun(s))\r\n", "p=\"hello\";ct=0;s=(input())\r\nfor x in s:\r\n if x==p[ct]:ct+=1\r\n if ct==len(p):break\r\nif ct==len(p):print(\"YES\")\r\nelse: print(\"NO\")\r\n\r\n", "a = input()\nb = [False for i in range(5)]\ns = \"hello\"\ni = 0\n\nfor c in a:\n\tif c == s[i]:\n\t\tb[i] = True\n\t\ti += 1\n\tif i == 5:\n\t\tbreak\n\nz = True\nfor l in b:\n\tif not l:\n\t\tz = False\n\t\tbreak\n\nif z:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t\t \t \t\t\t\t\t\t\t\t\t\t \t \t\t \t\t \t \t", "a = list(input())\r\na.append('1')\r\ns = 'hello'\r\nfor i in s:\r\n if i in a:\r\n a = a[a.index(i)+1:]\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "s = input()\r\nind = 0\r\nfor char in s: \r\n if char == \"hello\"[ind]:\r\n ind+= 1\r\n if ind == 5:\r\n print(\"YES\")\r\n break\r\nif ind != 5:\r\n print(\"NO\")", "s = input() # Read the word from input\r\n\r\ntarget_word = \"hello\"\r\ni = 0 # Pointer to keep track of the character to match in the target word\r\n\r\nfor char in s:\r\n if char == target_word[i]:\r\n i += 1\r\n if i == len(target_word):\r\n print(\"YES\") # We found \"hello\" in \"s\"\r\n break\r\n\r\nif i != len(target_word):\r\n print(\"NO\") # We reached the end of \"s\" without finding \"hello\"", "s=input()\r\notvet=[]\r\nisk=0\r\nhello='hello'\r\nfor i in s:\r\n if len(otvet)!=5:\r\n if i==hello[isk]:\r\n isk+=1\r\n otvet.append(i)\r\n else:\r\n continue\r\nif len(otvet)==5:\r\n print('YES')\r\n exit()\r\nif len(otvet)!=5:\r\n print('NO')", "\r\na=input()\r\nlsa=[]\r\nfor i in range(len(a)):\r\n lsa.append(a[i])\r\nb=\"hello\"\r\nls=[]\r\n\r\nfor j in range(len(b)):\r\n\r\n if b[j] in lsa:\r\n ls.append(1)\r\n y=lsa.index(b[j])\r\n del lsa[0:y+1]\r\nif len(ls)==len(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=input()\r\ni=0\r\nwhile s1[i]!='h':\r\n i+=1\r\n if i<len(s1):\r\n continue\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n i+=1\r\n if i==len(s1):\r\n print('NO')\r\n else:\r\n while s1[i]!='e':\r\n i+=1\r\n if i<len(s1):\r\n continue\r\n else:\r\n print('NO')\r\n break\r\n else:\r\n i+=1\r\n if i==len(s1):\r\n print('NO')\r\n else:\r\n while s1[i]!='l':\r\n i+=1\r\n if i<len(s1):\r\n continue\r\n else:\r\n print('NO')\r\n break \r\n else:\r\n i+=1\r\n if i==len(s1):\r\n print('NO')\r\n else:\r\n while s1[i]!='l':\r\n i+=1\r\n if i<len(s1):\r\n continue\r\n else:\r\n print('NO')\r\n break\r\n else:\r\n i+=1\r\n if i==len(s1):\r\n print('NO')\r\n else:\r\n while s1[i]!='o':\r\n i+=1\r\n if i<len(s1):\r\n continue\r\n else:\r\n print('NO')\r\n break \r\n else: \r\n print('YES')", "ROSE = input().strip()\r\n\r\npattern = \"hello\"\r\ni = 0 \r\nfor char in ROSE:\r\n if i < len(pattern) and char == pattern[i]:\r\n i += 1\r\n\r\n\r\nif i == len(pattern):\r\n \r\n print(\"YES\")\r\nelse:\r\n \r\n print(\"NO\")\r\n", "s = input()\r\nshablon= \"hello\"\r\ni = 0\r\nfor item in s:\r\n if item == shablon[i]:\r\n i += 1\r\n \r\n if i == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "str1=input()\r\ncnt1=0\r\ncnt2=0\r\ncnt3=0\r\nchar=\"\"\r\nfor s in str1 :\r\n if s==\"h\" :\r\n cnt1+=1\r\n if cnt1>0 and s==\"e\" :\r\n cnt2+=1\r\n if cnt2>0 and s==\"l\" :\r\n cnt3+=1\r\n if cnt3>1 and s==\"o\" :\r\n print(\"YES\")\r\n char=\"o\"\r\n break\r\nif char!=\"o\" :\r\n print(\"NO\")\r\n", "slowo = input()\r\ndef usun(litera, slowo):\r\n if slowo.count(litera) == 0:\r\n return \"?\"\r\n index = slowo.index(litera)\r\n return slowo[index + 1:]\r\nfor i in \"hello\":\r\n slowo = usun(i, slowo)\r\nif slowo == \"?\":\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def chatRoom(s):\r\n n = len(s)\r\n h = 'hello'\r\n j, count = 0, 0\r\n \r\n for i in range(n):\r\n if s[i] == h[j]:\r\n j += 1\r\n count += 1\r\n if count == 5:\r\n return True\r\n return False\r\n\r\n\r\nif __name__ == '__main__':\r\n s = input()\r\n ans = chatRoom(s)\r\n \r\n if ans:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "n=input()\r\nh='hello '\r\nctr=0\r\nfor i in n:\r\n if i==h[ctr]:\r\n ctr+=1\r\nprint(\"YES\" if ctr==5 else 'NO')", "s = input()\r\n\r\na = s.find('h')\r\nif a < 0:\r\n print('NO')\r\nelse:\r\n b = s[a+1:].find('e')\r\n if b < 0:\r\n print('NO')\r\n else:\r\n c = s[a+b+2:].find('l')\r\n if c < 0:\r\n print('NO')\r\n else:\r\n d = s[a+b+c+3:].find('l')\r\n if d < 0:\r\n print('NO')\r\n else:\r\n e = s[a+b+c+d+4:].find('o')\r\n if e < 0:\r\n print('NO')\r\n else:\r\n print('YES')\r\n\r\n\r\n\r\n\r\n", "s = input().lower()\ns1 = \"hello\"\ni = 0\nj = 0\nwhile i<len(s) and j<len(s1):\n if s[i] == s1[j]:\n j+=1\n i+=1\nif j == len(s1):\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", "def ev(wrd):\r\n saludo=\"hello\"\r\n cnt=0\r\n for i in range(len(wrd)):\r\n if(wrd[i]==saludo[cnt]):\r\n cnt+=1\r\n if (cnt==len(saludo)):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nwrd=input()\r\nprint(ev(wrd))", "s = input()\r\nans = ''\r\nif 'h' in s and 'e' in s and s.count('l') >= 2 and 'o' in s:\r\n for i in range(s.index('h') , len(s)):\r\n if s[i] == 'h' and 'h' not in ans:\r\n ans += s[i]\r\n elif s[i] == 'e' and 'e' not in ans and ans[-1] == 'h':\r\n ans += s[i]\r\n elif s[i] == 'l' and ans.count('l') == 0 and ans[-1] == 'e':\r\n ans += s[i]\r\n elif s[i] == 'l' and ans.count('l') == 1 and ans[-1] == 'l':\r\n ans += s[i]\r\n elif s[i] == 'o' and 'o' not in ans and ans[-1] == 'l' and ans.count('l') == 2:\r\n ans += s[i]\r\n if ans == 'hello':\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "def isHello(s):\r\n fh = s.find('h')\r\n if fh == -1:\r\n return 0\r\n fe = s.find('e', fh, len(s))\r\n if fe == -1:\r\n return 0\r\n fl1 = s.find('l', fe, len(s))\r\n if fl1 == -1:\r\n return 0\r\n fl2 = s.find('l', fl1 + 1, len(s))\r\n if fl2 == -1:\r\n return 0\r\n fo = s.find('o', fl2, len(s))\r\n if fo == -1:\r\n return 0\r\n return 1\r\n\r\n\r\ns = input()\r\nif isHello(s):\r\n print(\"YES\")\r\nelse:\r\n print('NO')\r\n", "s=input()\r\ne=\"hello\"\r\ni=0\r\nc=0\r\nwhile(i!=len(s) and c<len(e)):\r\n if(e[c]==s[i]):\r\n i+=1\r\n c+=1\r\n else:\r\n i+=1\r\nif(c==5):\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\na=0\ntxt=\"hello\"\nfor i in s:\n if a==5:\n break\n if i==txt[a]:\n a+=1\nif a==5:\n print(\"YES\")\nelse:\n print(\"NO\")", "#A. Chat room\r\n'''Input\r\nThe first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters.\r\n\r\nOutput\r\nIf Vasya managed to say hello, print \"YES\", otherwise print \"NO\".'''\r\ns = input()\r\n#check if h is in s\r\nif 'h' in s:\r\n #check if e is in s after h\r\n s = s[s.index('h')+1:]\r\n if 'e' in s:\r\n #check if l is in s after e\r\n s = s[s.index('e')+1:]\r\n if 'l' in s:\r\n #check if l is in s after l\r\n s = s[s.index('l')+1:]\r\n if 'l' in s:\r\n #check if o is in s after l\r\n s = s[s.index('l')+1:]\r\n if 'o' in s:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "s = input().lower()\r\n\r\ndata = 'hello'\r\ncnt = 0\r\nfor c in s:\r\n if c == data[cnt]:\r\n\r\n cnt += 1\r\n if cnt == 5:\r\n break\r\nif cnt == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nhello = list('hello')\r\n\r\nfor char in s:\r\n if len(hello) > 0 and char == hello[0]:\r\n hello.pop(0)\r\nif len(hello) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nn = len(s)\r\nl = 0\r\nfor i in range(0,n):\r\n if(s[i] == 'h' and l == 0):\r\n l += 1\r\n elif(s[i] == 'e' and l == 1):\r\n l += 1\r\n elif(s[i] == 'l' and l == 2):\r\n l += 1\r\n elif(s[i] == 'l' and l == 3):\r\n l += 1\r\n elif(s[i] == 'o' and l == 4):\r\n l += 1\r\n if(l==5):\r\n break\r\nif(l==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nlst = [\"h\",\"e\",\"l\",\"l\",\"o\",\"\"]\r\na=0\r\nx=int(0)\r\nfor i in s:\r\n if i == lst[x]:\r\n x=x+1\r\n a=a+1\r\n\r\n\r\nif a == 5:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "st = input()\r\nansw = 'NO'\r\n\r\nfor i in range(0, len(st)):\r\n\tif st[i] == 'h':\r\n\t\tkey = i + 1\r\n\t\tfor i in range(key, len(st)):\r\n\t\t\tif st[i] == 'e':\r\n\t\t\t\tkey = i + 1\r\n\t\t\t\tfor i in range(key, len(st)):\r\n\t\t\t\t\tif st[i] == 'l':\r\n\t\t\t\t\t\tkey = i + 1\r\n\t\t\t\t\t\tfor i in range(key, len(st)):\r\n\t\t\t\t\t\t\tif st[i] == 'l':\r\n\t\t\t\t\t\t\t\tkey = i + 1\r\n\t\t\t\t\t\t\t\tfor i in range(key, len(st)):\r\n\t\t\t\t\t\t\t\t\tif st[i] == 'o':\r\n\t\t\t\t\t\t\t\t\t\tansw = 'YES'\r\n\r\nprint(answ)\t\t\t\t\t\t\t\t\t\t\t\t\r\n", "import math\r\n\r\n#f = open(\"test.txt\")\r\ntext = input()\r\ntf = \"hello\"\r\n\r\np = 0\r\nfor i in range(len(text)):\r\n\tif (p == 5):\r\n\t\tbreak\r\n\tif (tf[p].lower() == text[i].lower()):\r\n\t\tp = p + 1\r\n\r\nprint(\"YES\") if p == 5 else print(\"NO\")\r\n\r\n\r\n", "s = input()\r\nboolean = [0]*5\r\n\r\n\r\nfor i in s:\r\n\tif i == 'h':\r\n\t\tboolean[0] = 1\r\n\telif i == 'e' and boolean[0]:\r\n\t\tboolean[1] = 1\r\n\telif i == 'l' and boolean[0] and boolean[1] and boolean[2]:\r\n\t\tboolean[3] = 1\r\n\telif i == 'l' and boolean[0] and boolean[1]:\r\n\t\tboolean[2] = 1\r\n\telif i == 'o' and boolean[0] and boolean[1] and boolean[2] and boolean[3]:\r\n\t\tboolean[4] = 1\r\n\r\nif boolean.count(0) == 0:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "s = input()\na = []\n\na.append(s.find('h'))\na.append(s.find('e', a[0] + 1))\na.append(s.find('l', a[1] + 1))\na.append(s.find('l', a[2] + 1))\na.append(s.find('o', a[3] + 1))\n\nflag = 1\nfor x in a:\n if x == -1:\n flag = 0\n\nprint('YES') if flag == 1 else print('NO')\n", "import re\r\nn=input()\r\nprint(\"YES\" if re.search('.*h.*e.*l.*l.*o.*',n) else \"NO\" )", "hello = \"hello\"\r\ns = input();\r\ncount = 0\r\nfor c in s:\r\n if count == 5:\r\n break\r\n else:\r\n if c == hello[count]:\r\n count += 1\r\nprint(\"YES\" if count == 5 else \"NO\")", "inp = input()\r\nflag = True\r\nfor let in \"hello\":\r\n if let in inp:\r\n inp = inp[inp.find(let) + 1:]\r\n else:\r\n print(\"NO\")\r\n flag = False\r\n break\r\nif flag:\r\n print(\"YES\")", "x=input()\r\ny='hello'\r\nj=0\r\nk=-1\r\nif(len(x)<5):\r\n print('NO')\r\n quit()\r\nelse:\r\n for i in range(len(x)):\r\n k=x.find(y[j],k+1)\r\n #print(k,'ye k hai')\r\n #print(y[j])\r\n #print(j,'ye j hai')\r\n if(k<0):\r\n print('NO')\r\n quit()\r\n elif(k>=0):\r\n if(j==4):\r\n break\r\n j=j+1\r\nprint('YES')", "t, etalon = [], ['h', 'e', 'l', 'l', 'o']\r\n[t.append(i) for i in input() if t != etalon and i == etalon[len(t)]]\r\nprint('YES' if t == etalon else 'NO')", "s = input()\r\nletters = ['h', 'e', 'l', 'l', 'o']\r\nstate = 0\r\nhello = False\r\nfor c in s:\r\n if c == letters[state]:\r\n state += 1\r\n if state == len(letters):\r\n hello = True\r\n break\r\nif hello:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\nx = \"hello\"\nj = 0\nfor i in s :\n if i==x[j] :\n j+=1\n if j==5 :\n break \nif j==5 :\n print(\"YES\")\nelse :\n print(\"NO\")", "str = input()\r\ntracking = 0\r\nword = \"hello\"\r\nfor i in range(len(str)):\r\n if tracking >= len(word):\r\n break\r\n if str[i] == word[tracking]:\r\n tracking += 1\r\nif tracking >= len(word):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=list(input())\r\nfor i in 'hello':\r\n while len(a)>0:\r\n if i==a.pop(0):\r\n break\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "s=input()[::-1]\r\nh='olleh*'\r\nj=0\r\n\r\nfor i in range(len(s)):\r\n if s[i]==h[j]:\r\n j+=1 \r\n\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "b=input()\r\na=['h','e','l','l', 'o']\r\nj=0\r\nfor i in range(len(b)):\r\n if b[i] == a[j]:\r\n j+=1\r\n if j==len(a):\r\n print(\"YES\")\r\n break\r\nif j!= len(a):\r\n print(\"NO\")", "def is_possible(seq, hello, idx):\n\t'Find special letter in sequence'\n#\tprint(seq, idx)\n\tif(idx > 4):\n\t\treturn True\n\n\tif(hello[idx] in seq):\n\t\ti = seq.index(hello[idx])\n\t\treturn is_possible(seq[i + 1:], hello, idx+1)\n\treturn False\n\nseq = [x for x in input()]\n\nhello = ['h','e','l','l','o']\n\ni = int(0)\ncount = int(0)\n\nif(is_possible(seq, hello, 0)):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\n#print (seq)\n\n\t\n", "text = input()\r\ntext = list(text)\r\nif len(text)>=5:\r\n while len(text)>=1 and text[0]!='h':\r\n del text[0]\r\n while len(text)>=2 and text[1]!='e':\r\n del text[1]\r\n while len(text)>=3 and text[2]!='l':\r\n del text[2]\r\n while len(text)>=4 and text[3]!='l':\r\n del text[3]\r\n while len(text)>=5 and text[4]!='o':\r\n del text[4]\r\n print(\"YES\" if \"hello\" in ''.join(text) else \"NO\")\r\nelse:\r\n print(\"NO\")", "v=['h', 'e', 'l', 'l', 'o']\ns=list(input())\nfor c in s:\n if not v:\n break\n if c==v[0]:\n v=v[1:] \nprint('YES' if not v else 'NO')\n", "s = input()\r\nk = \"hello\"\r\nj = 0\r\ncount = 0\r\nfor char in s:\r\n if char == k[j]:\r\n j += 1\r\n count += 1\r\n if count == 5:\r\n break\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def chat(s):\n list_1 = [x for x in s]\n list_2 = []\n i = 0\n while list_1:\n if len(list_2) == 0:\n if list_1[i] == 'h':\n list_2.append(list_1.pop(0))\n else:\n list_1.pop(0)\n elif len(list_2) == 1:\n if list_1[i] == 'e':\n list_2.append(list_1.pop(0))\n else:\n list_1.pop(0)\n elif len(list_2) == 2:\n if list_1[i] == 'l':\n list_2.append(list_1.pop(0))\n else:\n list_1.pop(0)\n elif len(list_2) == 3:\n if list_1[i] == 'l':\n list_2.append(list_1.pop(0))\n else:\n list_1.pop(0)\n elif len(list_2) == 4:\n if list_1[i] == 'o':\n list_2.append(list_1.pop(0))\n else:\n list_1.pop(0)\n else:\n list_1.pop(0)\n if ''.join(list_2) == 'hello':\n print('YES')\n else:\n print('NO')\n \ns = input()\nchat(s)", "s,w,j = input(),'hello',0\r\nfor i in s:\r\n if j >= 5:\r\n break\r\n if w[j] == i:\r\n j = j + 1\r\nif j == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\n\r\ndict = ['hello']\r\nstring = ''\r\ncounter = 0\r\n\r\nfor word in dict:\r\n for l in s:\r\n if counter == len(word):\r\n break\r\n if l == word[counter]:\r\n counter += 1\r\n string += l\r\n\r\n\r\nif string in dict:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\n\r\n\r\nrequired_letters = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\ncurrent_index = 0\r\n\r\nfor letter in s:\r\n if letter == required_letters[current_index]:\r\n current_index += 1\r\n if current_index == len(required_letters):\r\n print(\"YES\")\r\n break\r\n\r\nif current_index < len(required_letters):\r\n print(\"NO\")\r\n", "s = input()\r\nlst = list(\"hello\")\r\nfor i in s[::-1]:\r\n if i == lst[-1]:\r\n lst.pop()\r\n if len(lst) == 0:\r\n break\r\nprint(\"YES\" if len(lst) == 0 else \"NO\")", "s=str(input())\r\na=s.find('h')\r\nA=s[a:]\r\nb=A.find('e')\r\nB=A[b:]\r\nc=B.find('l')\r\nC=B[c+1:]\r\nd=C.find('l')\r\nD=C[d:]\r\ne=D.find('o')\r\nif a==-1 or b==-1 or c==-1 or d==-1 or e ==-1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n", "s=input().strip()\r\nstring=\"hello\"\r\ncount=0\r\nfor i in s:\r\n if i==string[count]:\r\n count+=1\r\n if count==len(string):\r\n print(\"YES\")\r\n break\r\nif count!=len(string):\r\n print(\"NO\")", "s1=input()\r\ns2='hello'\r\nj=0\r\nk=0\r\nfor i in range(len(s1)):\r\n if s1[i]==s2[j]:\r\n k+=1\r\n j+=1\r\n if k==5:\r\n break\r\nif k==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\ni = 0\r\ndetected = \"\"\r\n\r\nfor letter in \"hello\":\r\n while i < len(s):\r\n if s[i] == letter:\r\n detected += letter\r\n i += 1\r\n break\r\n i += 1\r\n\r\nif detected == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n data = input()\r\n hello = list('helLo')\r\n found = [False] * len(hello)\r\n di = dict(zip(hello, found))\r\n a = list()\r\n out = []\r\n for x in data:\r\n if x in hello:\r\n a.append(x)\r\n pass\r\n for x in a:\r\n if x != 'h' and not di['h']:\r\n continue\r\n if x == 'h' and not di['h']:\r\n di[x] = True\r\n continue\r\n if x == 'e' and not di['e'] and di['h']:\r\n di['e'] = True\r\n continue\r\n if x == 'o' and not di['o'] and di['h'] and di['e'] and di['l'] and di['L']:\r\n di[x] = True\r\n print('YES')\r\n return\r\n if x == 'l':\r\n if not di['l']:\r\n if di['h'] and di['e']:\r\n di['l'] = True\r\n pass\r\n else:\r\n if not di['L']:\r\n if di['h'] and di['e'] and di['l']:\r\n di['L'] = True\r\n pass\r\n print('NO')\r\n pass\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "a = input()\r\nword = 0\r\nfor i in a:\r\n if i == 'h' and word == 0:\r\n word+=1\r\n elif i == 'e' and word == 1:\r\n word+=1\r\n elif i == 'l' and word == 2:\r\n word+=1\r\n elif i == 'l' and word == 3:\r\n word+=1\r\n elif i == 'o' and word == 4:\r\n word+=1\r\nif word == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from collections import deque\nq = deque(\"hello\")\nfor x in input():\n\tif q:\n\t\tif x == q[0]:\n\t\t\tq.popleft()\n\telse:\n\t\tbreak\nprint([\"YES\",\"NO\"][len(q)!=0])", "import re\r\ns=input()\r\nprint('YES' if re.search('h.*e.*l.*l.*o',s) else 'NO')", "sri=iter(input());print('NYOE S'[all(c in sri for c in 'hello')::2])", "if __name__ == \"__main__\":\r\n p = input()\r\n s = \"hello\"\r\n i = -1\r\n count = 0\r\n for c in s:\r\n i += 1\r\n while i < len(p):\r\n if p[i] == c:\r\n count += 1\r\n break\r\n else:\r\n i += 1\r\n print(\"YES\" if count == len(s) else \"NO\")", "s=input()\r\ns1='hello'\r\ns1=list(s1)\r\nc=0\r\nk=s1[c]\r\nst=''\r\nfor i in s:\r\n if c==5:\r\n break\r\n if i==k:\r\n st+=i\r\n c+=1\r\n if c<5:\r\n k=s1[c]\r\nif st=='hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Feb 25 21:28:11 2021\r\n\r\n@author: Admin\r\n\"\"\"\r\n\r\nx = input()\r\ny = \"hello\"\r\nind = 0\r\nfor i in x:\r\n if ind == 5:\r\n break\r\n if i == y[ind]:\r\n ind += 1\r\nif ind == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "ans = \"hello\"\r\ns = input()\r\nind = 0\r\nfor i in s:\r\n if ind==5:\r\n break\r\n if i==ans[ind]:\r\n ind=ind+1\r\nif ind==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=input() \r\ni=0\r\nb=\"hello\" \r\nfor c in x :\r\n if i<5 and c == b[i] : \r\n i+=1 \r\nif i==5 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nans = 0\r\nr = ''\r\nfor i in s:\r\n if (r+i) == 'h':\r\n r += i\r\n if len(r) > 0:\r\n if r + i in 'hello':\r\n r += i\r\n if r == 'hello':\r\n ans = 1\r\n break\r\nif ans == 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nw = 'hello'\r\nindex = 0\r\nfor c in s:\r\n\tif index < 5 and c == w[index]:\r\n\t\tindex += 1\r\nif index == 5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "pattern = \"hello\"\r\ninput_string = input()\r\nfor i in range(len(input_string)):\r\n try:\r\n if pattern[0] == input_string[i]:\r\n pattern = pattern[1:]\r\n except(IndexError):\r\n break\r\nif len(pattern) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 24 22:34:56 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\ns=input()\r\nr=0\r\nword='hello'\r\nfor i in s:\r\n if i ==word[r]:#可以按顺序读取直到获得需要的字母。\r\n r+=1 \r\n if r==len(word):#所有字母读取完成立刻退出。\r\n print('YES')\r\n break\r\n\r\nif r<len(word):#没有读取到所有想要的字母。\r\n print('NO')\r\n", "if __name__ == '__main__':\r\n x = input()\r\n counter=0\r\n h_index=0\r\n hello = 'hello'\r\n for i in range(len(x)):\r\n if x[i]==hello[h_index]:\r\n h_index+=1\r\n counter+=1\r\n if counter==5:\r\n break\r\n if counter==5:\r\n print('YES')\r\n else:\r\n print('NO')", "s=input().lower()\r\nt=('h','l','o','w','l')\r\nf1=s.find('h')\r\nf2=s.find('e',f1+1)\r\nf3=s.find('l',f2+1)\r\nf4=s.find('l', f3+1)\r\nf5=s.find('o',f4+1)\r\n \r\nif f1<f2<f3<f4<f5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "word=input()\r\nll = word.count('l')\r\nif ll>=2 and 'h' in word and 'e' in word and 'o' in word:\r\n h=word.index('h')\r\n word=word[(h+1):]\r\n if 'e' in word:\r\n e=word.index('e')\r\n word=word[(e+1):]\r\n if 'l' in word:\r\n l1=word.index('l')\r\n word=word[(l1+1):]\r\n if 'l' in word:\r\n l2=word.index('l')\r\n word=word[(l2+1):]\r\n if 'o' in word:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "s=input()\ns=s[::-1]\ncounter=0\nchar='o'\n\nfor i in s:\n if i==char and counter<3:\n counter +=1\n char='l'\n if counter==3:\n char='e'\n elif i==char and counter<5:\n counter +=1\n char='h'\n \nif counter==5:\n print('YES')\nelse:\n print('NO')", "s = input()\r\nss = ['h', 'e', 'l', 'l', 'o']\r\ni = 0\r\nfor c in s:\r\n\tif i <= 4 and c == ss[i]:\r\n\t\ti += 1\r\nprint('YES' if i == 5 else 'NO')", "n = input()\r\nh = \"hello\"\r\nw = \"\"\r\nout = \"NO\"\r\nfor i in range(len(h)) :\r\n if h[i] in n :\r\n w += h[i]\r\n n = n[n.index(h[i])+1:]\r\n if w == h :\r\n out = \"YES\"\r\n break\r\nprint(out)\r\n", "s = input()\r\na = ''\r\ncp = 0\r\ni = 0\r\nex = 'hello'\r\n\r\n\r\nfor j in range( len(s)):\r\n if ex[i] == s[j]:\r\n i += 1\r\n if i == len(ex):\r\n break\r\nif i == len(ex):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# 请改为同学的代码\r\n# 58A. Chat room\r\n\r\ns = input()\r\nword = ['h','e','l','l','o']\r\ncounter = 0\r\na = -1\r\n\r\nfor i in range(5):\r\n for j in range(a + 1, len(s) + 1):\r\n try:\r\n if s[j] == word[i]:\r\n counter += 1\r\n a = j\r\n break\r\n except: IndexError\r\n\r\nif counter == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "text = input()\r\nhello = list('hello')\r\nfor s in text:\r\n if s == hello[0]:\r\n hello.pop(0)\r\n if not hello:\r\n break\r\nprint('NO' if hello else 'YES')\r\n ", "def can_say_hello(s):\r\n target = \"hello\"\r\n target_index = 0\r\n\r\n for char in s:\r\n if char == target[target_index]:\r\n target_index += 1\r\n\r\n if target_index == len(target):\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\n# Read input word from user\r\ns = input().strip()\r\n\r\n# Check if Vasya managed to say hello\r\nresult = can_say_hello(s)\r\nprint(result)\r\n", "word = input()\r\nitog = \"hello\"\r\nnew_word = \"\"\r\nfor i in word:\r\n if i == itog[len(new_word)]:\r\n new_word += i\r\n if new_word == itog:\r\n break\r\nif new_word == itog:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ns1='hello'\r\nj=0\r\nstr1=\"\"\r\nfor i in range(len(s)):\r\n if j==len(s1):\r\n break\r\n elif s1[j]==s[i]:\r\n str1=str1+s[i]\r\n s.replace(s[i],'0')\r\n i=i+1\r\n j=j+1\r\n else:\r\n i=i+1\r\nif str1==s1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\n# Initialize variables to track the position of the letter 'h' in \"hello\"\r\nposition = 0\r\n\r\n# Iterate through the characters in s\r\nfor char in s:\r\n # If the current character matches the expected character in \"hello\",\r\n # move to the next expected character\r\n if char == \"hello\"[position]:\r\n position += 1\r\n # If we have matched all the characters in \"hello\", Vasya managed to say hello\r\n if position == len(\"hello\"):\r\n print(\"YES\")\r\n break\r\n\r\n# If we haven't matched all the characters in \"hello\", Vasya didn't manage to say hello\r\nif position < len(\"hello\"):\r\n print(\"NO\")\r\n", "def chat(str):\r\n w=\"hello\"\r\n x=0\r\n for i in range(0,len(s)):\r\n if(x==5):\r\n return \"YES\"\r\n if(s[i]==w[x]):\r\n x+=1\r\n \r\n if(x<5):\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\ns=input()\r\nprint(chat(s))", "word = input()\ncount = 1\nisFound = False\nfor letter in word:\n\tif letter == 'h' and count == 1:\n\t\tcount += 1\n\telif letter == 'e' and count == 2:\n\t\tcount += 1\n\telif letter == 'l' and count == 3:\n\t\tcount += 1\n\telif letter == 'l' and count == 4:\n\t\tcount += 1\n\telif letter == 'o' and count == 5:\n\t\tisFound = True\n\t\tbreak\n\telse:\n\t\tcontinue\nif isFound:\n\tprint('YES')\nelse:\n\tprint('NO')\n \t\t\t\t \t \t \t \t \t\t\t \t \t \t \t", "s = input()\r\ns1 = ' ' + s\r\n\r\na = s1.find('h')\r\na1 = int(a/abs(a))\r\n\r\nb = s1.find('e',(a+1))\r\nb1 = int(b/abs(b))\r\n\r\nc = s1.find('l',(b+1))\r\nc1 = int(c/abs(c))\r\n\r\nd = s1.find('l',(c+1))\r\nd1 = int(d/abs(d))\r\n\r\ne = s1.find('o',(d+1))\r\ne1 = int(e/abs(e))\r\n\r\nx = a1 + b1 + c1 + d1 + e1 + 1\r\n\r\nx1 = int(x/6)\r\nx2 = abs(x1-1)\r\n\r\nprint(('YES'*x1)+('NO'*x2))", "s = input()\r\nmarker = True\r\nfor pos in 'hello':\r\n if s.find(pos) != -1:\r\n if s.find(pos) != len(s) - 1:\r\n s = s[s.find(pos) + 1:]\r\n else:\r\n s = ''\r\n else:\r\n marker = False\r\n print('NO')\r\n break\r\nif marker:\r\n print('YES')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 26 14:01:55 2023\r\n\r\n@author: ZHAO XUDI\r\n\"\"\"\r\n\r\ns = input()\r\ns_list = list(s)\r\nhello = []\r\n\r\n\r\nfor letter in s_list:\r\n if letter ==\"h\" and hello==[]:\r\n hello.append(\"h\")\r\n elif letter == \"e\" and hello==[\"h\"]:\r\n hello.append(\"e\")\r\n elif letter == \"l\":\r\n if hello==[\"h\",\"e\",\"l\"] or hello==[\"h\",\"e\"]:\r\n hello.append(\"l\")\r\n elif letter == \"o\"and hello==[\"h\",\"e\",\"l\",\"l\"]:\r\n hello.append(\"o\")\r\n\r\nif hello ==list(\"hello\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s=input()\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i]=='h' and c==0:\r\n c=1\r\n continue\r\n if s[i]=='e' and c==1:\r\n c=2\r\n continue\r\n if s[i]=='l' and c==2:\r\n c=3\r\n continue\r\n if s[i]=='l' and c==3:\r\n c=4\r\n continue\r\n if s[i]=='o' and c==4:\r\n c=5\r\nif c==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#Coder_1_neel\r\n\r\nn=input()\r\n\r\ns=\"hello\"\r\na=\"\"\r\n \r\nfor i in n :\r\n x=a.count(i)\r\n if i not in a and i=='h' and x<2 :\r\n a+=i \r\n elif i=='e'and a=='h'and x<2:\r\n a+=i\r\n elif i=='l'and a=='he' and x<1:\r\n a+=i\r\n elif i=='l'and a=='hel' and x<2:\r\n a+=i\r\n elif i=='o'and a=='hell' and x<2:\r\n a+=i \r\n \r\n \r\nif s==a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n", "n=input()\r\nl=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nflag=0\r\nfor i in n:\r\n if (i == l[0]):\r\n if(len(l)==1):\r\n flag=1\r\n break;\r\n else:\r\n l=l[1:]\r\nif(flag==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#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()\nn = len(s)\nstart = 0\nstr = \"hello\"\nflag=0\nk = 0\nfor i in s:\n # print(k)\n if k==5:\n break\n elif i == str[k]:\n # print(i,str[k])\n flag=1\n k+=1\nif k==5:\n py()\nelse:\n pn()\n \n", "s = input()\n\nfound = False\n\nfor h_i, c in enumerate(s):\n if c == \"h\":\n e_i = s.find(\"e\", h_i + 1)\n l1_i = s.find(\"l\", e_i + 1)\n l2_i = s.find(\"l\", l1_i + 1)\n o_i = s.find(\"o\", l2_i + 1)\n\n if [h_i, e_i, l1_i, l2_i, o_i] == sorted([h_i, e_i, l1_i, l2_i, o_i]):\n found = True\n break\n\nprint(\"YES\" if found else \"NO\")", "y=(input())\r\nc=0;c1=0\r\nx=\"hello\"\r\na=0;b=0;c=0;d=0;e=0\r\nif \"h\"in y and \"e\"in y and \"l\"in y and \"l\"in y and \"e\"in y:\r\n a=y.find(\"h\");b=y.find(\"e\",a+1);c=y.find(\"l\",b+1);d=y.find(\"l\",c+1);e=y.find(\"o\",d+1)\r\n# print(a,b,c,d,e)\r\nif a<b<c<d<e:\r\n \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n# for j in range(5):\r\n# for i in range(c,len(y)):\r\n# if y[i]==x[j]:\r\n# # print(i)\r\n# c=y.index(x[j])+1\r\n# # print(c)\r\n# c1=c1+1\r\n \r\n# break\r\n \r\n \r\n \r\n# if c1==5:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\") \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s = input()\nstring = []\nfor l in s:\n\tstring.append(l)\n\ncomp = [\"h\",\"e\",\"l\",\"l\",\"o\"]\n\npointer = 0\n\nfor letter in string:\n\tif pointer == 4 and letter == \"o\":\n\t\tprint(\"YES\")\n\t\tbreak\n\tif comp[pointer] == letter:\n\t\tpointer += 1\nelse:\n\tprint(\"NO\")\n", "def main() :\r\n print(yes_No(is_Say_Hello(input_Typed_Word())))\r\n\r\ndef is_Say_Hello(typed_word) :\r\n CHARS_TO_SEARCH = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\n search_index = 0\r\n\r\n for char in typed_word :\r\n if search_index >= len(CHARS_TO_SEARCH) : break\r\n if CHARS_TO_SEARCH[search_index] == char : search_index += 1\r\n\r\n return search_index == len(CHARS_TO_SEARCH)\r\n\r\ndef input_Typed_Word() :\r\n return input()\r\n\r\ndef yes_No(bool) :\r\n return [\"NO\", \"YES\"][bool]\r\n\r\nmain()", "s_list = input().lower()\r\nhello_str=\"hello\"\r\ncur = 0\r\nresult = \"NO\"\r\n\r\nfor v in s_list:\r\n if v != hello_str[cur] and cur == 0:\r\n continue\r\n\r\n if v == hello_str[cur]:\r\n cur+=1\r\n \r\n if cur==5:\r\n result = \"YES\"\r\n break\r\n\r\nprint(result)", "s=input()\r\nc=0\r\nj=0\r\nhello=\"hello\"\r\nfor i in range(len(s)):\r\n if s[i]==hello[j]:\r\n j+=1\r\n if j==5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "x = input()\r\nslovo = 'hello'\r\ndlina = len(x)\r\ng = 0\r\nn = 0\r\nk = 0 \r\nwhile g < dlina and n < 5:\r\n if x[g] == slovo[n] :\r\n\r\n g = g + 1\r\n n = n + 1\r\n k = k + 1\r\n\r\n else : \r\n\r\n if g < dlina:\r\n g = g + 1\r\n else:\r\n break\r\n\r\n\r\n \r\nif k == len(slovo):\r\n print('YES')\r\nelse:\r\n print ('NO')", "s = str(input())\r\nhello = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\ni = 0\r\nok = True\r\nfor letter in hello:\r\n while i < len(s) and ok:\r\n if s[i] == letter:\r\n if letter == \"o\":\r\n ok = False\r\n break\r\n else:\r\n i += 1\r\n break\r\n else:\r\n i += 1\r\nif ok:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s = input()\r\no = []\r\nflag = 0\r\nf = 0\r\nfor i in s:\r\n if(i == 'h' and flag == 0):\r\n flag = 1\r\n o.append('h')\r\n elif(i == 'e' and len(o) == 1):\r\n o.append('e')\r\n elif(i == 'l' and len(o) == 2):\r\n o.append('l')\r\n elif(i == 'l' and len(o) == 3):\r\n o.append('l')\r\n elif(i == 'o' and len(o) == 4):\r\n o.append('o')\r\n f = 1\r\n break\r\n elif(len(o) > 0 and i == o[-1]):\r\n o = o\r\nif(f == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Input\r\nword = input().strip()\r\nposition = 0\r\nfor char in word:\r\n if char == \"hello\"[position]:\r\n position += 1\r\n if position == 5:\r\n print(\"YES\")\r\n break\r\nif position < 5:\r\n print(\"NO\")\r\n", "s = input()\r\nans = False\r\npos = s.find('h')\r\nif pos != -1 :\r\n s = s[pos+1:]\r\n pos = s.find('e')\r\n if pos != -1 :\r\n s = s[pos+1:]\r\n pos = s.find('l')\r\n if pos != -1 :\r\n s = s[pos+1:]\r\n pos = s.find('l')\r\n if pos != -1 :\r\n s = s[pos+1:]\r\n pos = s.find('o')\r\n if pos != -1 :\r\n ans = True\r\nif (ans) :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "n=input()\r\na=0\r\nfor i in 'hello':\r\n if n.find(i) ==-1:\r\n print ('NO')\r\n break\r\n else:\r\n n=n[n.find(i)+1:]\r\n a=a+1\r\nif a==5:\r\n print ('YES')", "string = input()\r\nh = 'hello'\r\n\r\ns = 0\r\nout = 'YES'\r\nfor i in range(len(string)):\r\n if string[i] == h[s]:\r\n s += 1\r\n if s == 5:\r\n break\r\nif s != 5:\r\n out = 'NO'\r\nprint(out)", "def solve(inp):\r\n hello = 'hello'\r\n j = 0\r\n\r\n for char in inp:\r\n if char == hello[j]:\r\n j += 1\r\n if j == 5:\r\n return 'YES'\r\n return 'NO'\r\n\r\nprint(solve(input()))\r\n", "a = input()\r\ncount = 0 \r\nfor i in range(len(a)):\r\n if count == 0:\r\n if a[i] == 'h':\r\n count += 1\r\n elif count == 1:\r\n if a[i] == 'e':\r\n count += 1\r\n elif count == 2 or count == 3:\r\n if a[i] == 'l':\r\n count += 1\r\n elif count == 4:\r\n if a[i] == 'o':\r\n count += 1\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nsum = 0\r\nfor i in s:\r\n\r\n if i == \"h\" and sum == 0:\r\n sum += 1\r\n continue\r\n if i == \"e\" and sum == 1:\r\n sum += 1\r\n continue\r\n if i == \"l\" and sum == 2:\r\n sum += 1\r\n continue\r\n if i == \"l\" and sum == 3:\r\n sum += 1\r\n continue\r\n if i == \"o\" and sum == 4:\r\n sum += 1\r\n continue\r\n\r\nif sum == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def find_target_word(input_str):\r\n target = \"hello\"\r\n index = 0\r\n for char in input_str:\r\n if index < len(target) and char == target[index]:\r\n index += 1\r\n \r\n if index == len(target):\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n \r\n \r\ninput_string = input().strip()\r\nresult = find_target_word(input_string)\r\nprint(result)\r\n", "s = input()\r\ncheck_string = \"hello\"\r\n\r\npos = 0\r\n\r\nfor i in s:\r\n\tif i == check_string[pos]:\r\n\t\tpos+=1\r\n\t\tif pos == 5:\r\n\t\t\tbreak\r\n\r\nif pos == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\r\nh, e, l, flag = 0, 0, 0, False\r\ns = s.lower()\r\nfor i in s:\r\n if i == 'h':\r\n h += 1\r\n elif i == 'e' and h > 0:\r\n e += 1\r\n elif i == 'l' and h > 0 and e > 0:\r\n l += 1\r\n elif i == 'o' and h > 0 and e > 0 and l > 1:\r\n flag = True\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=[]\r\nfor x in a:\r\n b.append(x)\r\n \r\nc=0\r\nd=0\r\ne=0\r\nf=0\r\n\r\nwhile 'h' in b and 'e' in b and 'l' in b and 'o' in b and b.count('l')>=2:\r\n c=b.index('h')\r\n d=b.index('e')\r\n e=b.index('l')\r\n f=b.index('o')\r\n if c<d<e<f:\r\n break\r\n elif d<c:\r\n b.remove('e')\r\n elif e<c:\r\n b.remove('l')\r\n elif f<c:\r\n b.remove('o')\r\n elif e<d:\r\n b.remove('l')\r\n elif f<d:\r\n b.remove('o')\r\n elif f<e:\r\n b.remove('o')\r\n \r\nif c<d<e<f:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\n \r\ntext = sys.stdin.readline()\r\nlist = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nnum = 0\r\n \r\nfor i in range(len(text)):\r\n if text[i] == list[num]:\r\n num += 1\r\n if num == 5:\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")\r\n ", "str = input();\nhello = \"hello\"\nchecked = 0\nfor c in str:\n if c == hello[checked]:\n checked += 1;\n if checked == len(hello):\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n", "s=input()\r\nl=list('hello')\r\nc=0\r\nfor i in s:\r\n if i==l[c]:\r\n c+=1\r\n if c==5:\r\n print('YES')\r\n exit()\r\nprint('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", "def chat(s):\r\n h='hello'\r\n sid=0\r\n hid=0\r\n while hid<len(h) and sid<len(s):\r\n if s[sid]==h[hid]:\r\n hid+=1\r\n sid+=1\r\n return hid==len(h)\r\n \r\nr=chat(input())\r\nif r:\r\n print('YES')\r\nelse:\r\n print('NO')", "# https://codeforces.com/problemset/problem/58/A?f0a28=1\r\n\r\n\r\ndef ch_find(s, ch):\r\n index = s.find(ch)\r\n return index, s[index + 1:]\r\n\r\n\r\nstring = input()\r\ntarget = \"hello\"\r\nfor i in target:\r\n loc, string = ch_find(string, i)\r\n if loc == -1:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "s=input()\r\nword='hello'\r\na=0\r\nfor i in s:\r\n if i==word[a]:\r\n a+=1\r\n if a>=5:\r\n print('YES')\r\n quit()\r\nprint('NO')", "s=input()\r\ns1=''\r\nfor i in \"hello\":\r\n if i in s:\r\n s1+=i\r\n s=s[s.index(i)+1:]\r\nif s1==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nsl = ''\r\nfor i in range(len(a)):\r\n if 'h' not in sl:\r\n if a[i] == 'h':\r\n sl += 'h'\r\n elif 'e' not in sl:\r\n if a[i] == 'e':\r\n sl += 'e'\r\n elif 'll' not in sl:\r\n if a[i] == 'l':\r\n sl += 'l'\r\n elif 'o' not in sl:\r\n if a[i] == 'o':\r\n sl += 'o'\r\nif sl == \"hello\":\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# Read the input\r\ns = input()\r\n\r\n# Initialize variables for the letters in \"hello\"\r\nhello_letters = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\ncurrent_letter_index = 0\r\n\r\n# Iterate through the characters in the input word\r\nfor char in s:\r\n # If the current character matches the current letter in \"hello\"\r\n if char == hello_letters[current_letter_index]:\r\n # Move to the next letter in \"hello\" if we haven't found all letters\r\n if current_letter_index < 4:\r\n current_letter_index += 1\r\n else:\r\n # If we found all letters in \"hello\", print \"YES\" and exit\r\n print(\"YES\")\r\n exit()\r\n\r\n# If we haven't found all letters in \"hello\", print \"NO\"\r\nprint(\"NO\")\r\n", "s = input()\r\n\r\nstate = 0\r\nfor i in s:\r\n if i == 'h' and state == 0:\r\n state = 1\r\n elif i == 'e' and state == 1:\r\n state = 2\r\n elif i == 'l' and (state == 2 or state == 3):\r\n state += 1\r\n elif i == 'o' and state == 4:\r\n state = 5\r\n break\r\nif state == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input(\"\")\r\nl=[char for char in a]\r\nll=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nj=0\r\ng=False\r\nfor i in l:\r\n if i==ll[j]:\r\n j+=1\r\n if j>4:\r\n g=True\r\n break\r\nif g:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\n\r\nhelloWord = re.compile(r'(.*)h(.*)e(.*)l(.*)l(.*)o(.*)')\r\ntext = input()\r\nif helloWord.search(text) == None:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import re\r\nt='h+[a-z]*e+[a-z]*l[a-z]*l+[a-z]*o+'\r\ns=input()\r\nif(re.search(t,s)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input(); o = 0; j = 0\r\nfor i in s:\r\n if i == 'hello'[j%5]:\r\n o += 1\r\n j += 1\r\n\r\nprint('NYOE S'[o>=5::2])", "lst=list(input())\r\nh=0\r\ne=0\r\nl1=0\r\nl2=0\r\no=0\r\n\r\nfor i in range(len(lst)):\r\n if lst[i]=='h':\r\n h+=1\r\n\r\n for j in range(i+1, len(lst)):\r\n if lst[j]=='e':\r\n e+=1\r\n\r\n for r in range(j+1,len(lst)):\r\n if lst[r]=='l':\r\n l1+=1\r\n\r\n for s in range(r+1,len(lst)):\r\n if lst[s]=='l':\r\n l2+=1\r\n\r\n for t in range(s+1, len(lst)):\r\n if lst[t]=='o':\r\n o+=1\r\n break\r\n break\r\n break\r\n break\r\n break\r\nif (h==1)and(e==1)and(l1==1)and(l2==1)and(o==1):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = input()\r\nm = \"hello\"\r\nj = 0\r\ncount = 0\r\n\r\n\r\nfor i in range(len(n)):\r\n if(n[i] == m[j]):\r\n j += 1\r\n count += 1\r\n if(count == 5):\r\n break\r\nif (count == 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "cor = \"hello\"\r\nword = input()\r\n\r\ndef find():\r\n x = 0\r\n for i in range(len(word)):\r\n if word[i] == cor[x]:\r\n x +=1 \r\n if x == 5:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(find())\r\n", "word = input()\r\nifHello = ''\r\nlCount = 0\r\nhCount = 0\r\neCount = 0\r\noCount = 0\r\n\r\nfor letter in word:\r\n if (letter == 'h') and (letter not in ifHello):\r\n ifHello = ifHello + letter\r\n hCount = 1\r\n elif (letter == 'e') and (letter not in ifHello) and (hCount == 1) :\r\n ifHello = ifHello + letter\r\n eCount = 1\r\n elif (letter == 'l') and (lCount <= 1) and (eCount == 1):\r\n lCount += 1\r\n ifHello = ifHello + letter\r\n elif (letter == 'o') and (letter not in ifHello) and (lCount == 2):\r\n ifHello = ifHello + letter\r\n\r\nif (ifHello == 'hello'):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\ni=0\r\nm='hello '\r\nfor j in s:\r\n if (j==m[i]):\r\n i+=1\r\nif (i==5):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\ny=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nj=0\r\nc=0\r\nfor i in s:\r\n if i==y[j]:\r\n j+=1\r\n if j==len(y):\r\n c=1\r\n break\r\nif c==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "# Read the input\r\nz = input().strip()\r\n\r\n# Initialize a variable to keep track of the position of the letter 'h' in the word\r\nposition = 0\r\n\r\n# Iterate through the characters in the word 's'\r\nfor char in z:\r\n # If the current character matches the expected character at the current position ('h', 'e', 'l', 'l', 'o')\r\n if char == \"hello\"[position]:\r\n position += 1\r\n\r\n # If we have found all the characters in 'hello', print \"YES\" and exit\r\n if position == 5:\r\n print(\"YES\")\r\n break\r\n\r\n# If we haven't found all the characters in 'hello', print \"NO\"\r\nif position < 5:\r\n print(\"NO\")\r\n", "import re\r\nn=input()\r\nif( re.search(\"h.*e.*l.*l.*o\",n)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the input word\r\ns = input()\r\n\r\n# Initialize variables to keep track of the position in the word \"hello\"\r\nposition = 0\r\n\r\n# Define the target word \"hello\"\r\ntarget = \"hello\"\r\n\r\n# Iterate through the characters in the input word\r\nfor char in s:\r\n # If the current character matches the expected character in \"hello\",\r\n # move to the next character in \"hello\"\r\n if char == target[position]:\r\n position += 1\r\n\r\n # If we have matched all characters in \"hello\", print \"YES\" and exit the loop\r\n if position == len(target):\r\n print(\"YES\")\r\n break\r\n\r\n# If we haven't matched all characters in \"hello\", print \"NO\"\r\nif position < len(target):\r\n print(\"NO\")\r\n", "from math import *\r\ns = input()\r\nword = 'hello'\r\nfor i in word:\r\n wish = s.find(i)\r\n s = s[wish+1:]\r\n if wish == -1:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "stro=input()\r\nst=\"hello\"\r\ncount=0\r\nk=1\r\nfor h in stro:\r\n if(k<=5):\r\n if(h==st[k-1]):\r\n #print(\"gt:\",h,st[k-1])\r\n k+=1\r\n count+=1\r\n#print(count)\r\nif(count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\n\r\n# hello\r\n\r\n# [0,1,2,3,4,5]\r\ntarget = 0\r\n\r\nfor i in s:\r\n if target == 0:\r\n if i == 'h':\r\n target = 1\r\n continue\r\n if target == 1:\r\n if i == 'e':\r\n target = 2\r\n continue\r\n if target == 2:\r\n if i == 'l':\r\n target = 3\r\n continue\r\n if target == 3:\r\n if i == 'l':\r\n target = 4\r\n continue\r\n if target == 4:\r\n if i == 'o':\r\n target = 5\r\n continue\r\n if target == 5:\r\n break\r\n\r\nif target == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "string = input()\r\nh = string.find('h')\r\ne = string.find('e', h + 1)\r\nl_1 = string.find('l', e + 1)\r\nl_2 = string.find('l', l_1 + 1)\r\no = string.find('o', l_2 + 1)\r\nif h < e < l_1 < l_2 < o:\r\n print ('YES')\r\nelse:\r\n print ('NO')\r\n", "h=[*'hello']\r\nfor i in input():\r\n if i==h[0]:\r\n h.pop(0)\r\n if not len(h):\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "a=(list(input()))\r\nb=[]\r\ns='hello'\r\ne=0\r\nfor i in a:\r\n if e<len(s) and i==s[e]:\r\n e+=1\r\nif e==5:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "s=input()\r\nm=list('hello')\r\nfor i in range(len(s)):\r\n if len(m)>0 and s[i]==m[0]:\r\n m.pop(0)\r\nif len(m)>0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ", "s = input()\r\n\r\np =\"\"\r\nh,e,l1,l2,o=0,1,1,1,1\r\n\r\nfor i in s:\r\n\tif h==0 and i == \"h\":\r\n\t\t\r\n\t\tp=p+i\r\n\t\th=1\r\n\t\te=0\r\n\telif e==0 and i == \"e\":\r\n\t\t\r\n\t\tp=p+i\r\n\t\te=1\r\n\t\tl1=0\r\n\t\t\r\n\telif l1==0 and i ==\"l\":\r\n\t\t\r\n\t\tp=p+i\r\n\t\tl1=1\r\n\t\tl2=0\r\n\telif l2==0 and i ==\"l\":\r\n\t\t\r\n\t\tp=p+i\r\n\t\tl2=1\r\n\t\to=0\r\n\telif o==0 and i ==\"o\":\r\n\t\t\r\n\t\tp=p+i\r\n\t\to=1\r\n\t\tbreak\r\nif len(p) == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "s=input()\r\nhello=\"hello\"\r\ni=0\r\nfor char in s:\r\n if char ==hello[i]:\r\n i+=1\r\n if i==len(hello):\r\n break\r\nif i== len(hello):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "c=0\nfor s in input():\n\tif c==0 and s==\"h\":\n\t\tc += 1\n\t\tcontinue\n\telif c==1 and s==\"e\":\n\t\tc += 1\n\t\tcontinue\n\telif c==2 and s==\"l\":\n\t\tc += 1\n\t\tcontinue\n\telif c==3 and s==\"l\":\n\t\tc += 1\n\t\tcontinue\n\telif c==4 and s==\"o\":\n\t\tc += 1\nif c==5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "a1 = 0\r\na = input()\r\nb = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nk = -1\r\nfor i in range(5):\r\n for j in range(k+1,len(a)):\r\n if b[i] == a[j]:\r\n a1 = a1+1\r\n k = j\r\n break\r\nif a1 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def contain_hello_insequence (input_string , sequence = 'hello'):\r\n index = 0\r\n for char in input_string:\r\n if char == sequence[index]:\r\n index += 1\r\n if index == len(sequence):\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\ninput_string = input().lower().strip()\r\nprint(contain_hello_insequence(input_string))", "stringInput = input()\n\ndef isHello(stringInput):\n\ti = 0\n\tstringReg = \"hello\"\n\tfor j in range(len(stringInput)):\n\t\t# print(str(i) + \" \" + stringInput[j] + \" \" + stringReg[i] + \"\\n\")\n\t\tif(stringInput[j] == stringReg[i]):\n\t\t\ti = i+1\t\n\t\tif(i == 5):\n\t\t\treturn True\n\n\tif(i == 5):\n\t\treturn True\n\treturn False\n\nif (isHello(stringInput)):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "a = list(input())\r\nif \"h\" in a:\r\n a = a[a.index(\"h\") + 1:len(a) + 1]\r\n if \"e\" in a:\r\n a = a[a.index(\"e\") + 1:len(a) + 1]\r\n if \"l\" in a:\r\n a = a[a.index(\"l\") + 1:len(a) + 1]\r\n if \"l\" in a:\r\n a = a[a.index(\"l\") + 1:len(a) + 1]\r\n if \"o\" in a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "def translate(str):\r\n hello=\"hello\"\r\n index=0\r\n for i in range(0,len(str)):\r\n if index==5:\r\n return\"YES\"\r\n if str[i]==hello[index]:\r\n index=index+1\r\n if index<5:\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\ninput=input()\r\nprint(translate(input))", "word = input()\r\n\r\n# h e l l o\r\nt = 0\r\n\r\nfor i in range(len(word)):\r\n if t == 0 and word[i] == \"h\":\r\n t += 1\r\n elif t == 1 and word[i] == \"e\":\r\n t += 1\r\n elif t == 2 and word[i] == \"l\":\r\n t += 1\r\n elif t == 3 and word[i] == \"l\":\r\n t += 1\r\n elif t == 4 and word[i] == \"o\":\r\n t += 1\r\n\r\nif t == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nmy_s = \"hello1\"\r\nind = 0\r\ni = 0\r\nfor i in s:\r\n if my_s[ind] == i:\r\n ind = ind + 1\r\nif ind == len(my_s) - 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nc=['h','e','l','l','o']\r\nk=0\r\nl=[0 for x in range(5)]\r\nfor i in range(len(a)):\r\n if(a[i]==c[k]):\r\n l[0]=i\r\n k+=1\r\n if(k==5):\r\n break\r\nif(k==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "hello = \"hello\"\r\nh = input()\r\ncounter = 0\r\nfor i in range(len(h)):\r\n if h[i] == hello[counter]:\r\n counter += 1\r\n if counter == 5:\r\n print(\"YES\")\r\n break\r\nif counter < 5 :\r\n print(\"NO\")", "x = input()\r\nc = 0\r\n\r\nfor i in range(len(x)):\r\n\tif x[i]=='h' and c==0:\r\n\t\tc += 1\r\n\telif x[i]=='e' and c==1:\r\n\t\tc += 1\r\n\telif x[i]=='l' and c==2:\r\n\t\tc += 1\r\n\telif x[i]=='l' and c==3:\r\n\t\tc += 1\r\n\telif x[i]=='o' and c==4:\r\n\t\tc += 1\r\n\t\t\r\nif c==5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "s = input().strip()\r\nidx = 0\r\nwhile idx < s.__len__() and s[idx] != 'h': idx+=1\r\nidx+=1\r\nwhile idx < s.__len__() and s[idx] != 'e': idx+=1\r\nidx+=1\r\nwhile idx < s.__len__() and s[idx] != 'l': idx+=1\r\nidx+=1\r\nwhile idx < s.__len__() and s[idx] != 'l': idx+=1\r\nidx+=1\r\nwhile idx < s.__len__() and s[idx] != 'o': idx+=1\r\nprint(\"YES\" if idx < s.__len__() else \"NO\")", "s=input()\r\nh=s.find('h')\r\ne=s.find('e',h)\r\nl1=s.find('l',e)\r\nl2=s.find('l',l1+1)\r\no=s.find('o',l2)\r\nif (h<e and e<l1 and l1<l2 and l2<o):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def result(s):\r\n word='hello'\r\n x=0\r\n for i in range(len(s)):\r\n if s[i]==word[x]:\r\n x=x+1\r\n if x==5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(result(input()))\r\n ", "import re;print(\"YNEOS\"[not re.search(r'.*h.*e.*l.*l.*o',input())::2])", "x = input()\r\nk = 'hello'\r\ni=0\r\nf=0\r\nt = ''\r\nfor j in range(len(x)):\r\n if x[j]== k[i]:\r\n t = t+x[j]\r\n if i+1 < len(k):\r\n i+=1\r\n else:\r\n continue\r\n if t ==k:\r\n f=1\r\n print('YES')\r\nif f==0:\r\n print('NO')\r\n \r\n \r\n \r\n \r\n\r\n", "w = input()\n\ns = \"hello\"\ni = 0\n\nfor c in w:\n if c == s[i]:\n i += 1\n\n if i == 5:\n print(\"YES\")\n exit(0)\n\nprint(\"NO\")", "n = list(input())\r\nword = list('hello')\r\ncount = 0\r\nfor i in n:\r\n if word[count] == i:\r\n count += 1\r\n if count > 4:\r\n break\r\nif count > 4:\r\n print('YES')\r\nelse:\r\n print('NO')", "h = ['h', 'e', 'l', 'l', 'o']\r\ns = input()\r\nn = 0\r\nfor i in s:\r\n if i == h[n]:\r\n n += 1\r\n if n == 5:\r\n print('YES')\r\n break\r\nif n < 5:\r\n print('NO')", "s = input()\r\ns1 = 'hello';x =0\r\nfor i in range(len(s)):\r\n if(s[i]==s1[x]):\r\n x+=1\r\n if(x==len(s1)):\r\n print(\"YES\")\r\n break;\r\nelse:\r\n print(\"NO\")", "s=list(input())\r\nlist1=['h','e','l','l','o']\r\ncount=0\r\nj=0\r\nfor i in range(len(list1)):\r\n for j in range(j,len(s)):\r\n if(list1[i]==s[j]):\r\n s[j]=0\r\n list1[i]=0\r\n break\r\nfor i in range(len(list1)):\r\n if(list1[i]==0):\r\n count=count+1\r\nif(count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def function(s):\r\n if len(s) < 5:\r\n return \"NO\"\r\n if \"hello\" in s:\r\n return \"YES\"\r\n orig = \"hello\"\r\n j = 0\r\n for i in range(len(s)):\r\n if j < len(orig) and s[i] == orig[j]:\r\n j += 1\r\n if j == len(orig):\r\n return \"YES\"\r\n else: return \"NO\"\r\n\r\n\r\ns = input()\r\nprint(function(s))", "q=input()\r\ns=\"\"\r\no=[]\r\nfor i in range(0,len(q)):\r\n if(q[i]==\"h\" and (o.count(\"h\")==0 and o.count(\"e\")==0 and o.count(\"l\")==0 and o.count(\"o\")==0)):\r\n o.append(q[i])\r\n elif(q[i]==\"l\" and (o.count(\"h\")==1 and o.count(\"e\")==1 and (o.count(\"l\")==0 or o.count(\"l\")==1) and o.count(\"o\")==0)):\r\n o.append(q[i])\r\n elif(q[i]==\"e\" and (o.count(\"h\")==1 and o.count(\"e\")==0 and o.count(\"l\")==0 and o.count(\"o\")==0)):\r\n o.append(q[i])\r\n elif(q[i]==\"o\" and (o.count(\"h\")==1 and o.count(\"e\")==1 and o.count(\"l\")==2 and o.count(\"o\")==0)):\r\n o.append(q[i]) \r\n # print(o)\r\nfor i in range(0,len(o)):\r\n s=s+o[i]\r\n#print(s)\r\nif(s==\"hello\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ntest = 'hello'\r\npointer = 0\r\nlength = len(s)\r\nfor i in range(0,length):\r\n if(pointer<len(test) and s[i] == test[pointer]):\r\n pointer += 1\r\n\r\nif (len(test) == pointer):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s=input()\r\nh = s.find('h',0)\r\nif h>=0 and len(s)<=100 and len(s)>=1:\r\n e = s.find('e', h)\r\n if e>=0:\r\n l1 = s.find('l',e)\r\n if l1>=0:\r\n l2 = s.find('l',int(l1+1))\r\n if l2>=0:\r\n o = s.find('o',l2)\r\n if o>=0:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "st = input().strip()\r\nd = {'h':0,'e':0,'l':0,'o':0}\r\n\r\nfor i in st:\r\n if(i=='h' and d[i]==0):\r\n d[i] = 1\r\n elif(i=='e' and d[i]==0 and d['h']==1):\r\n d[i] = 1\r\n elif(i=='l' and d[i]<2 and d['h']==1 and d['e']==1):\r\n d[i] += 1\r\n elif(i=='o' and d[i]==0 and d['h']==1 and d['e']==1 and d['l']==2):\r\n d[i] = 1\r\n\r\n\r\nif(d['h']==1 and d['e']==1 and d['l']==2 and d['o']==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "word=input()\r\ncheck='hello'\r\nind=0\r\nn=len(word)\r\n\r\nfor ci in range(n):\r\n if check[ind] == word[ci] :\r\n ind+=1\r\n if(ind==5):\r\n print('YES')\r\n quit()\r\n \r\nprint(\"NO\")\r\n \r\n \r\n ", "s = list(str(input()))\nlst = [\"h\" , \"e\" , \"l\" , \"l\" , \"o\"]\nfinal_word = []\ni=0\nj=1\nwhile i<len(s) and j <= 5:\n if s[i] != lst[j-1]:\n i += 1\n else:\n final_word.append(s[i])\n j += 1\n i += 1\nif final_word == lst:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "import re\r\ns = input()\r\nr = re.search('h.*e.*l.*l.*o', s)\r\nprint(['YES', 'NO'][r==None])", "s = input()\r\nmass = ['h', 'e', 'l', 'l', 'o', ' ']\r\nk = 0\r\nfor i in s:\r\n if i == mass[0]:\r\n mass.pop(0)\r\n k += 1\r\nif k == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "checker = ['h','e','l','l','o']\r\ns = input()\r\nhello = []\r\ni=0\r\nfor letter in s:\r\n if i==5:\r\n break\r\n if letter == checker[i]:\r\n hello.append(letter)\r\n i+=1\r\nprint(('NO','YES')[hello==checker])", "s=input()\r\ns1='hello'\r\nk=0\r\nfor i in s:\r\n if k<=4 and i==s1[k]:\r\n k+=1\r\n #print(i,end='')\r\nif k>=5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=input()\r\na=0\r\ns=''\r\nc=0\r\nfor i in range(len(n)):\r\n if s=='hello':\r\n break\r\n elif n[i]=='h' and a==0:\r\n s=s+'h'\r\n a=1\r\n elif s=='h' and n[i]=='e':\r\n s=s+'e'\r\n elif (s=='he' or s=='hel') and n[i]=='l':\r\n s=s+'l'\r\n elif s=='hell' and n[i]=='o' and c==0:\r\n s=s+'o'\r\n c=1\r\nif s=='hello':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\nlast = 0\r\nfor c in \"hello\" :\r\n p = s.find(c, last)\r\n if p == -1 :\r\n print(\"NO\")\r\n exit()\r\n last = p+1\r\nprint(\"YES\")\r\n", "s=input()\r\na=-1\r\nfor i in 'hello':\r\n try:\r\n a=s.index(i,a+1)\r\n except ValueError: \r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n# http://codeforces.com/problemset/problem/58/A\r\n", "s=input()\r\nh='hello'\r\ni=0\r\nflag=0\r\nfor c in s:\r\n if(h[i]==c):\r\n i+=1\r\n if(i==5):\r\n flag=1\r\n break\r\nif(flag==1):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\na=['h','e','l','l','o']\r\nd=0\r\ni=0\r\nwhile i<len(s) and d<5:\r\n if s[i]==a[d]:\r\n d+=1\r\n i+=1\r\n else:\r\n i+=1\r\nif d==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nlist1=['h','e','l','l','o']\r\nlist2=[]\r\nn=0\r\nfor i in range(len(s)):\r\n if s[i]==list1[n]:\r\n list2.append(s[i])\r\n n=n+1\r\n if n==5:\r\n break\r\n elif s[i]!=list1[n]:\r\n pass\r\nif list2 ==list1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nword = 'hello'\r\nc = 0\r\n\r\nfor i in s:\r\n if i == word[c]:\r\n c += 1\r\n \r\n if c == 5:\r\n break\r\nif c == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\n\nREGEX = r'h.*e.*l.*l.*o.*'\n\nword = input()\n\nif re.search(REGEX, word):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "def fun(s):\r\n flag = 0\r\n for i in range(len(s)):\r\n if s[i] == 'h':\r\n j = i\r\n flag = 1\r\n break\r\n if flag == 0:\r\n return \"NO\"\r\n flag = 0\r\n for i in range(j+1,len(s)):\r\n if s[i] == 'e':\r\n j = i \r\n flag = 1\r\n break \r\n if flag == 0:\r\n return \"NO\" \r\n flag = 0\r\n for i in range(j+1,len(s)):\r\n if s[i] == 'l':\r\n j = i \r\n flag = 1\r\n break \r\n if flag == 0:\r\n return \"NO\" \r\n flag = 0\r\n for i in range(j+1,len(s)):\r\n if s[i] == 'l':\r\n j = i \r\n flag = 1\r\n break \r\n if flag == 0:\r\n return \"NO\"\r\n flag = 0\r\n for i in range(j+1,len(s)):\r\n if s[i] == 'o':\r\n j = i \r\n flag = 1\r\n break \r\n if flag == 0:\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\ns = input()\r\nprint(fun(s))", "s = input()\r\nword = \"hello\"\r\nletter = 0\r\nfor x in s:\r\n if letter == 5:\r\n break\r\n if x == word[letter]:\r\n letter += 1\r\nprint (\"YES\" if (letter==5) else \"NO\")", "s=input()\r\nh='hello'\r\nj=0\r\nfor i in range(len(s)):\r\n if s[i]==h[j]:\r\n j+=1\r\n if j>=5:\r\n break\r\nif j==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s, j, a = input(), 0, \"hello\"\r\nfor i in s:\r\n if(i==a[j]):\r\n j+=1\r\n if j==5:\r\n break;\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\n\r\nhello = list(\"hello\")\r\n\r\nh_i = 0\r\nfor i in range(len(s)):\r\n if s[i] == hello[h_i]:\r\n h_i += 1\r\n \r\n if h_i == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s=input()\r\nnl=[]\r\nfor i in range(len(s)):\r\n if s[i] in 'helo':\r\n nl.append(i)\r\nst='hello'\r\na=0\r\nfor i in nl:\r\n if s[i]==st[a]:\r\n a+=1\r\n if a==5:\r\n break\r\nif a==5:print(\"YES\")\r\nelse:print(\"NO\")", "s = input().rstrip()\r\n\r\nh = list('hello')\r\ni = 0\r\n\r\nfor c in s:\r\n if c == h[i]:\r\n i += 1\r\n if i == 5:\r\n break\r\n\r\nprint('YES' if i == 5 else 'NO')", "a = input()\r\np = a[::].find('h')\r\no = a[p:].find('e')+p\r\nu = a[o:].find('l')+o\r\ny = a[u+1:].find('l')+u+1\r\nt = a[y:].find('o')+y\r\nif p<o<u<y<t:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n ", "word = input()\nlst = [\"h\",\"e\",\"l\",\"l\",\"o\"]\n\nfor i in range(len(word)):\n current = word[i]\n\n if (len(lst) == 0):\n break\n\n if (current == lst[0]):\n del lst[0]\n\nif (len(lst) > 0):\n print(\"NO\")\nelse:\n print(\"YES\")", "def solve():\r\n from collections import deque\r\n queue = deque(\"hello\")\r\n for c in input():\r\n if len(queue) != 0 and c == queue[0]:\r\n queue.popleft()\r\n print(\"YES\" if len(queue) == 0 else \"NO\")\r\nsolve() ", "word = input()\r\nbegin = 0\r\nfor i in \"hello\":\r\n a = word.find(i,begin,len(word))\r\n if a == -1:\r\n print(\"NO\")\r\n break\r\n begin = a + 1\r\n if i == \"o\":\r\n print(\"YES\")", "s = input()\ntarget = 'hello'\nmi = 0\nfor c in s:\n\ttry:\n\t\tif c == target[mi]:\n\t\t\tmi += 1\n\texcept:\n\t\tbreak\nprint('YES' if mi >= len(target) else 'NO')\n", "#58A chat room\r\ns=input()\r\nhi = 'hello'\r\ni=0\r\nfor e in s:\r\n if(i<len(hi) and e==hi[i]):\r\n i+=1\r\nif i==len(hi):\r\n print('YES')\r\nelse:\r\n print('NO')", "def ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().strip().split(\" \"))\r\ndef msi(): return map(str,input().strip().split(\" \"))\r\ndef li(): return list(mi())\r\n\r\n\r\ns = input()\r\nh = \"hello\"\r\nj = 0\r\nf = 0\r\nfor i in range(len(s)):\r\n if(s[i]==h[j]):\r\n j += 1\r\n if(j==5):\r\n f = 1\r\n break\r\nif(f):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\nh = \"hello\"\nch = 0\nfor i in range(len(s)):\n if ch == 5: break\n elif s[i] == h[ch] and ch < 5: ch = ch + 1\nif ch == 5: print(\"YES\")\nelse: print(\"NO\")", "from math import*\r\na = input()\r\nlst = \"hello\"\r\nindex = 0\r\nfor i in a:\r\n if i == lst[index]: index += 1\r\n if index == 5: break\r\nprint(\"YES\" if index == 5 else \"NO\")", "s=input()\r\nif 'h' in s:\r\n s=s[s.index('h')+1:len(s)]\r\n if 'e' in s:\r\n s=s[s.index('e')+1:len(s)]\r\n if 'l' in s:\r\n s=s[s.index('l')+1:len(s)]\r\n if 'l' in s:\r\n s=s[s.index('l')+1:len(s)]\r\n if 'o' in s:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n ", "text = input()\r\npattern = 'hello'\r\nj = 0\r\nfor i in range(len(text)):\r\n if text[i]== pattern[j]:\r\n j=j+1\r\n if(j==5):\r\n print('YES')\r\n break\r\n\r\nif(j!=5):\r\n print('NO')", "s = input()\r\nh=e=l=l2=o = False\r\n\r\nfor i in range(len(s)):\r\n if s[i]=='h':\r\n h = True\r\n if h and s[i]=='e':\r\n e = True\r\n if h and e and not l and s[i]=='l':\r\n l = True\r\n continue\r\n if h and e and l and s[i]=='l':\r\n l2 = True\r\n if h and e and l and l2 and s[i]=='o':\r\n o=True\r\n\r\nif h and e and l and l2 and o:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input().strip()\r\nt = 'hello'\r\ni = 0\r\nf = False\r\nfor c in s:\r\n if c == t[i]:\r\n i += 1\r\n if i == len(t):\r\n print(\"YES\")\r\n f = True\r\n break\r\nif not f:\r\n print(\"NO\")", "str = input()\n\nword = \"hello\"\n\nwdi = 0\n\nfor i in range(len(str)):\n if wdi == 5:\n break\n\n if word[wdi] == str[i]:\n wdi += 1\n\nif wdi < 5:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n\t\t\t\t \t \t\t\t \t \t\t \t \t\t\t\t\t\t\t\t\t\t\t", "s=input()\r\nns='hello'\r\nc=0\r\nfor i in s:\r\n if i==ns[c]:\r\n c+=1\r\n if c==len(ns):\r\n break\r\n\r\nif len(ns)==c:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n \r\n \r\n ", "a = 'hello'\r\nb = input()\r\nj = 0\r\nfor i in b:\r\n if j >= 5:\r\n break\r\n if i == a[j]:\r\n j += 1\r\nif j < 5:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "s=input()\r\nL=['h','e','l','l','o']\r\nj=0\r\nfor i in s:\r\n if j<5 and L[j]==i:\r\n j+=1\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str='hello'\r\ns=input()\r\nt=0\r\nfor i in s:\r\n if i==str[t]:\r\n t=t+1\r\n if t==5:\r\n break\r\nif t==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=input()\r\nline=list(n)\r\nc=0\r\nfor i in range(len(line)):\r\n if line[i]!='h':\r\n line[i]=''\r\n \r\n elif line[i]=='h':\r\n line[i]=''\r\n c=c+1\r\n break\r\nfor i in range(len(line)):\r\n if line[i]!='e':\r\n line[i]=''\r\n \r\n elif line[i]=='e':\r\n line[i]=''\r\n c=c+1\r\n break \r\nfor i in range(len(line)):\r\n if line[i]!='l':\r\n line[i]=''\r\n \r\n elif line[i]=='l':\r\n line[i]=''\r\n c=c+1\r\n break\r\nfor i in range(len(line)):\r\n if line[i]!='l':\r\n line[i]=''\r\n \r\n elif line[i]=='l':\r\n line[i]=''\r\n c=c+1\r\n break \r\nfor i in range(len(line)):\r\n if line[i]!='o':\r\n line[i]=''\r\n \r\n elif line[i]=='o':\r\n c=c+1\r\n break \r\nif c==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "word = input()\r\n\r\ni = int(0)\r\nj = int(0)\r\n\r\nwhile i < len(word):\r\n if j == 0:\r\n if word[i] == \"h\":\r\n j = 1\r\n i = i+1\r\n continue\r\n if j == 1:\r\n if word[i] == \"e\":\r\n j = 2\r\n i = i+1\r\n continue\r\n if j == 2:\r\n if word[i] == \"l\":\r\n j = 3\r\n i = i+1\r\n continue\r\n if j == 3:\r\n if word[i] == \"l\":\r\n j = 4\r\n i = i+1\r\n continue\r\n if j == 4:\r\n if word[i] == \"o\":\r\n j = 5\r\n i = len(word)\r\n continue\r\n i = i + 1\r\n \r\nif j == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "h = \"hello\"\r\ns = input()\r\ncnt = 0\r\nfor i in range(len(s)):\r\n if s[i] == h[cnt]:\r\n cnt += 1\r\n if cnt == 5: \r\n print(\"YES\")\r\n break\r\nelse: print(\"NO\")", "s=input()\r\nn12 =len(s)\r\nfl12 =0\r\nc = \"hello\"\r\nco= 0\r\nfor i in range(n12):\r\n\tif s[i] == c[co]:\r\n\t\tco+=1\r\n\tif co== 5:\r\n\t\tfl12 = 1\r\n\t\tbreak\r\nif (fl12):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint (\"NO\")", "s=input()\r\nlength=len(s)\r\ntarget=['h','e','l','l','o']\r\nn=0\r\n\r\nfor i in range(0,length):\r\n if s[i]==target[n]:\r\n n+=1\r\n if n==5:\r\n break\r\nif n==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys \r\ns = input()\r\ni = 0\r\nhello = \"hello\"\r\nfor l in s:\r\n if l == hello[i]:\r\n i = i + 1\r\n if (i == 5):\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")", "s=input()\r\np = ['h', 'e', 'l', 'l', 'o']\r\nu = -1\r\nfor y in p:\r\n u = s.find(y, u + 1)\r\n if u == -1:\r\n print('NO')\r\n exit()\r\nprint('YES')", "s=\"hello\"\r\nc=0\r\ns2=input()\r\nfor i in range(len(s2)):\r\n if c<5 and s[c]==s2[i]:\r\n c+=1\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "string = input()\r\n\r\nexpected = \"hello\"\r\ncounter = 0\r\n\r\nfor char in string:\r\n if char == expected[counter]:\r\n counter += 1\r\n if counter == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s = input()\r\nd = ['o', 'l', 'l', 'e', 'h']\r\nfor i in s:\r\n if len(d) == 0:\r\n print('YES')\r\n quit()\r\n if i == d[-1]:\r\n d.pop()\r\nif len(d) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\ncomp = \"hello\"\r\nj = 0\r\ncount = 0\r\nfor i in comp:\r\n\twhile j<len(s):\r\n\t\tif s[j] == i:\r\n\t\t\tcount += 1\r\n\t\t\tj += 1\r\n\t\t\tbreak\r\n\t\tj += 1\r\nif count == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\r\nd = len(s)\r\no = \"NO\"\r\nfor i in range(d):\r\n if s[i]==\"h\":\r\n for j in range(i+1,d):\r\n if s[j]==\"e\":\r\n for x in range(j+1,d):\r\n if s[x]==\"l\":\r\n for y in range(x+1,d):\r\n if s[y]==\"l\":\r\n for z in range(y+1,d):\r\n if s[z]==\"o\":\r\n o = \"YES\"\r\n break\r\nprint(o)", "n=input()\r\nf=0\r\nx=['h','e','l','l','o']\r\nfor i in x:\r\n if i in n:\r\n f=1\r\n y=n.index(i)\r\n n=n[y+1:]\r\n else:\r\n f=0\r\n break\r\nif(f==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\ns = input(); o = re.search(r\"h.*?e.*?l.*?l.*?o\", s);\nprint(\"YNEOS\"[o is None::2])", "s = input()\r\nh = False\r\ne = False\r\nl1 = False\r\nl2 = False\r\no = False\r\nfor i in s:\r\n if h:\r\n if e:\r\n if l1:\r\n if l2:\r\n if i=='o':\r\n o = True\r\n if i=='l':\r\n l2=True\r\n if i == 'l':\r\n l1 = True\r\n if i == 'e':\r\n e = True\r\n if i == 'h':\r\n h = True\r\nif h and e and l1 and l2 and o:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nc=0\r\nt = ''\r\nfor i in s:\r\n if c==0:\r\n if i=='h':\r\n t += 'h'\r\n c+=1\r\n elif c==1:\r\n if i=='e':\r\n t += 'e'\r\n c+=1\r\n elif c==2:\r\n if i=='l':\r\n t += 'l'\r\n c+=1\r\n elif c==3:\r\n if i=='l':\r\n t += 'l'\r\n c+=1\r\n elif c==4:\r\n if i=='o':\r\n t += 'o'\r\n c+=1\r\n else:\r\n continue\r\n \r\nif t == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\nb='hello'\r\ndef chat():\r\n x=0\r\n a=input()\r\n for i in range(0,len(a)):\r\n if a[i]==b[x]:\r\n x=x+1\r\n if x==5:\r\n return(\"YES\")\r\n else:\r\n return(\"NO\")\r\nprint(chat())\r\n ", "a = iter(input())\r\nprint(\"YES\" if all(c in a for c in \"hello\") else \"NO\")", "s=input()\r\nn=len(s)\r\nf1=0\r\nstr='hello'\r\ncnt=0\r\nfor i in range(n):\r\n if(s[i]==str[cnt]):\r\n cnt+=1\r\n if(cnt==5):\r\n f1=1\r\n break\r\nif f1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\nhello = \"hello\"\r\nindex = 0\r\nmanaged = False\r\n\r\nfor i in s:\r\n\r\n if i == hello[index]:\r\n index += 1\r\n\r\n if index > 4:\r\n managed = True\r\n break\r\n\r\n\r\nprint(\"YES\" if managed else \"NO\")\r\n", "s=input()\r\ns1=\"hello\"\r\nidx=0\r\nc=0\r\nfor i in s:\r\n\tif idx==len(s1):\r\n\t\tbreak\r\n\tif i==s1[idx]:\r\n\t\tc+=1\r\n\t\tidx+=1\r\nif c==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\r\nword = 'hello'\r\nsquirrel = 0\r\n\r\nfor i in s:\r\n if i == word[squirrel]:\r\n squirrel += 1\r\n if squirrel >= len(word):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nword = \"hello\"\r\nptr = 0\r\nfor i in s:\r\n if ptr < 5:\r\n if word[ptr] == i: \r\n ptr += 1\r\n else:\r\n break\r\nif ptr == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n s = input()\r\n k = 0\r\n\r\n for c in s:\r\n if c == \"hello\"[k]:\r\n k += 1\r\n if k == 5:\r\n print(\"YES\")\r\n return\r\n\r\n print(\"NO\")\r\n\r\nmain()\r\n", "String = input()\r\nfor i in range(len(String)):\r\n if String[i]=='h':\r\n for j in range(i+1,len(String)):\r\n if String[j]=='e':\r\n for t in range(j+1,len(String)):\r\n if String[t]=='l':\r\n for h in range(t+1,len(String)):\r\n if String[h]=='l':\r\n for n in range(h+1,len(String)):\r\n if String[n]=='o':\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "if __name__ == '__main__':\r\n n = input()\r\n state = 0\r\n string = 'hello'\r\n j = 0\r\n flag = False\r\n for i in range(len(n)):\r\n if n[i] == string[j]:\r\n j += 1\r\n if j == 5:\r\n print('YES')\r\n flag = True\r\n break\r\n if not flag:\r\n print('NO')", "n = input()\r\nln = len(n)\r\nj = 0\r\nz = 0\r\nm ='hello'\r\nfor i in range(ln):\r\n if m[j]==n[i]:\r\n \r\n j+=1\r\n if j==5:\r\n break\r\nif j==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "strg: str = input()\r\n\r\npsarr: list = []\r\n\r\nfor indx in range(256):\r\n psarr.append([])\r\n\r\nfor indx in range(len(strg)):\r\n chr: str = strg[indx]\r\n psarr[ord(chr)].append(indx)\r\n\r\nstate: bool = False\r\nh: list = psarr[ord('h')]\r\ne: list = psarr[ord('e')]\r\nl: list = psarr[ord('l')]\r\no: list = psarr[ord('o')]\r\n\r\nlls: list = []\r\n\r\nif len(h) > 0 and len(e) > 0 and len(l) > 1 and len(o) > 0:\r\n head = h[0]\r\n ear = head\r\n leg = ear\r\n owl = o[-1]\r\n for indx in e:\r\n if indx > head:\r\n ear = indx\r\n break\r\n \r\n for indx in l:\r\n if indx > ear and indx < owl:\r\n lls.append(indx)\r\n \r\n if head < ear and ear < owl and len(lls) > 1:\r\n state = True\r\n\r\nprint(\"YES\" if state else \"NO\")", "s = str(input())\nbase = 'hello'\n\ncounter = 0\nj = 0 \nfor i in range(0,len(s)):\n if s[i] == base[j]:\n j += 1\n counter += 1\n if counter == 5:\n break\n\nif counter == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t \t\t\t\t \t\t\t\t \t\t\t \t \t \t\t\t\t", "word = list(input())\r\nif \"h\" not in word or \"e\" not in word or word.count(\"l\") < 2 or \"o\" not in word:\r\n print(\"NO\")\r\nelse:\r\n f = 0\r\n pivot = word.index(\"h\")+1\r\n if \"e\" in word[pivot:]:\r\n pivot += word[pivot:].index(\"e\")+1\r\n if \"l\" in word[pivot:]:\r\n pivot += word[pivot:].index(\"l\")+1\r\n if \"l\" in word[pivot:]:\r\n pivot += word[pivot:].index(\"l\")+1\r\n if \"o\" in word[pivot:]:\r\n print(\"YES\")\r\n f = 1\r\n if f == 0:\r\n print(\"NO\")\r\n", "s=input()\r\ncount=0\r\nfor i in range(len(s)):\r\n if(s[i]==\"h\" and count==0):\r\n count=count+1\r\n elif(s[i]==\"e\" and count==1):\r\n count=count+1\r\n elif(s[i]==\"l\" and count==2):\r\n count=count+1\r\n elif(s[i]==\"l\" and count==3):\r\n count=count+1\r\n elif(s[i]==\"o\" and count==4):\r\n count=count+1\r\nif(count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nj=0\r\nb='hello'\r\nfor i in a:\r\n if i==b[j]:\r\n j+=1\r\n if j>=5:\r\n break\r\nif j>=5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n = input().lower()\r\nnew = ''\r\nfor i in n:\r\n if i in 'helo':\r\n new+=i\r\nhey = False\r\nif new.find('h')!=-1:\r\n hey=True\r\nnew = new[new.find('h')+1:len(new)]\r\nif hey:\r\n if new.find('e')!=-1:\r\n hey = True\r\n else:\r\n hey = False\r\nnew = new[new.find('e')+1:len(new)]\r\nif hey:\r\n if new.find('l')!=-1:\r\n hey = True\r\n else:\r\n hey = False\r\nnew = new[new.find('l')+1:len(new)]\r\nif hey:\r\n if new.find('l')!=-1:\r\n hey = True\r\n else:\r\n hey = False\r\nnew = new[new.find('l')+1:len(new)]\r\nif hey:\r\n if new.find('o')!=-1:\r\n hey = True\r\n else:\r\n hey = False\r\nnew = new[new.find('o')+1:len(new)]\r\nif hey:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "s=input()\r\nstring='hello'\r\nd=0\r\nfor i in range(len(s)):\r\n if s[i]==string[d]:\r\n d+=1\r\n if d==5:\r\n break\r\nif d==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#任晓宇 2300015809\r\ns=input()\r\nl=len(s)\r\n\r\na=0\r\nb=0\r\nwhile a<l:\r\n\tif s[a]==\"h\":\r\n\t\ta+=1\r\n\t\tbreak\r\n\telse:\r\n\t\ta+=1\r\nwhile a<l:\r\n\tif s[a]==\"e\":\r\n\t\ta+=1\r\n\t\tbreak\r\n\telse:\r\n\t\ta+=1\r\nwhile a<l:\r\n\tif s[a]==\"l\":\r\n\t\ta+=1\r\n\t\tbreak\r\n\telse:\r\n\t\ta+=1\r\nwhile a<l:\r\n\tif s[a]==\"l\":\r\n\t\ta+=1\r\n\t\tbreak\r\n\telse:\r\n\t\ta+=1\r\nwhile a<l:\r\n\tif s[a]==\"o\":\r\n\t\tb+=1\r\n\t\tbreak\r\n\telse:\r\n\t\ta+=1\r\n\r\nif b==1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def can_say_hello(s):\r\n target = \"hello\"\r\n target_idx = 0 # Index to track the position in the target word\r\n \r\n for char in s:\r\n if char == target[target_idx]:\r\n target_idx += 1\r\n if target_idx == len(target):\r\n return \"YES\" # Successfully matched all characters of \"hello\"\r\n \r\n return \"YES\" if target_idx == len(target) else \"NO\"\r\n\r\n# Read the input word\r\ns = input().strip()\r\n\r\n# Check if Vasya can say hello\r\nresult = can_say_hello(s)\r\nprint(result)\r\n", "s = input()\r\nn = len(s)\r\nresult = False\r\nfor i in range(n):\r\n if s[i] =='h':\r\n for j in range(n-i-1):\r\n if s[i+j+1] =='e':\r\n for k in range(n-i-j-2):\r\n if s[i+j+k+2] =='l':\r\n for l in range(n-i-j-k-3):\r\n if s[i+j+k+l+3] == 'l':\r\n for m in range(n-i-j-k-l-4):\r\n if s[i+j+k+l+m+4] =='o':\r\n result = True\r\n print('YES')\r\n break;\r\n if result == True:\r\n break;\r\n if result == True:\r\n break;\r\n if result == True:\r\n break;\r\n if result == True:\r\n break;\r\n elif i == n-1:\r\n print('NO')\r\n", "a = list(input())\r\narr = []\r\n\r\ncount = 0\r\nfor i in range(len(a)):\r\n if count == 0:\r\n if a[i] == \"h\":\r\n arr.append(a[i])\r\n count += 1\r\n elif count == 1:\r\n if a[i] == \"e\":\r\n arr.append(a[i])\r\n count += 1\r\n elif count == 2:\r\n if a[i] == \"l\":\r\n arr.append(a[i])\r\n count += 1\r\n elif count == 3:\r\n if a[i] == \"l\":\r\n arr.append(a[i])\r\n count += 1\r\n elif count == 4:\r\n if a[i] == \"o\":\r\n arr.append(a[i])\r\n count += 1\r\n \r\nif \"\".join(arr) == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "wrong_hello = input()\n\n\nright_hello = 'hello'\nbreak_first_loop = False\n\n\nfor each_right_letter in right_hello:\n\tletter_exists = False\n\tfor i in range(len(wrong_hello)):\n\t\tif wrong_hello[i] == each_right_letter:\n\t\t\tletter_exists = True\n\t\t\twrong_hello = wrong_hello[i+1:]\n\t\t\tbreak\n\n\tif letter_exists == False:\n\t\tprint('NO')\n\t\tbreak\n\n\tif each_right_letter == 'o':\n\t\tprint('YES')", "s=input()\r\nx=\"hello\"\r\nt=0\r\nfor i in s:\r\n if i==x[t]:\r\n t+=1\r\n if t==5:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "word = 'hello'\r\ninp = input()\r\nindex = 0\r\nfor i in inp:\r\n\tif index == len(word):\r\n\t\tbreak\r\n\tif i == word[index]:\r\n\t\tindex += 1\r\nif index == len(word):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n = input()\r\nans = 'hello'\r\ncount = 0\r\nfor i in n:\r\n if count==5:\r\n break\r\n elif i == ans[count]:\r\n count+=1\r\n\r\nprint(\"YES\") if count==5 else print(\"NO\")", "s = input()\n\ndef solve(w, s):\n i = 0\n\n if len(s) < 5:\n return \"NO\"\n \n for j in s:\n if j == w[i]:\n i += 1\n if i == 5:\n return \"YES\"\n return \"NO\"\n\n\nprint(solve(\"hello\", s))\n\n\n \n ", "L= list(map(str, str(input())))\r\n# print(L)\r\nb=len(L)\r\nx=0\r\nM = ['o', 'l', 'l', 'e', 'h']\r\nfor i in range(0,5):\r\n # b=z\r\n for j in range(b-1, -1 ,-1):\r\n #print(b)\r\n # print(L[j])\r\n if (M[i]!=L[j]):\r\n # continue\r\n L.pop(j)\r\n # print(L)\r\n b = len(L)\r\n elif (M[i]==L[j]):\r\n x=x+1\r\n #print(x)\r\n L.pop(j)\r\n # print(L)\r\n b=len(L)\r\n break\r\n\r\nif(x==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nword = input(\"\")\r\n\r\n\r\ntarget = \"hello\"\r\ni = 0\r\nfor letter in word:\r\n if letter == target[i]:\r\n i += 1\r\n if i == 5:\r\n break\r\n \r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "def solve():\r\n s = input()\r\n temp = \"hello\"\r\n j = 0\r\n for ch in s:\r\n if ch == temp[j]:\r\n j += 1\r\n if(j==5):\r\n return \"YES\"\r\n return \"NO\"\r\nprint(solve())", "import re\r\nchat = input()\r\nx = re.search(\"h[a-z]*e[a-z]*l[a-z]*l[a-z]*o\",chat)\r\nif x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n =input()\r\nc=0\r\nh=n.find(\"h\")\r\ne = n.find(\"e\",h)\r\nl=n.find(\"l\",e)\r\nl2=n.find(\"l\",l+1)\r\no=n.find(\"o\",l2)\r\n\r\nif h>=0 and e>0 and l>0 and l2>0 and o>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\r\nprint(\"YES\" if re.search(\"h.*e.*l.*l.*o\",input())else \"NO\")", "def func(s):\r\n for i in range(0, len(s)):\r\n if s[i] == 'h':\r\n for j in range(i+1, len(s)):\r\n if s[j] == 'e':\r\n for k in range(j+1, len(s)):\r\n if s[k] == 'l':\r\n for l in range(k+1, len(s)):\r\n if s[l] == 'l':\r\n for r in range(l+1, len(s)):\r\n if s[r] == 'o':\r\n return bool(1)\r\n return bool(0)\r\n\r\ns = input()\r\nif func(s) == bool(1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\na1,a2,a3,a4,a5=0,0,0,0,0\r\nfor i in range(len(s)):\r\n if s[i]=='h' or a1==1:\r\n a1=1\r\n if s[i]=='e' or a2==1:\r\n a2=1\r\n if s[i]=='l' or a3==1:\r\n if a3==0:\r\n a3=1\r\n continue\r\n else: \r\n if s[i]=='l' or a4==1:\r\n a4=1\r\n if s[i]=='o' or a5==1:\r\n a5=1\r\nif a5==1:print(\"YES\")\r\nelse: print(\"NO\")", "n = input()\r\ns = 0\r\nd = 0\r\ns1 = 0\r\nd1 = 0\r\nfor i in n:\r\n if i == 'h':\r\n s += 1\r\n elif i == 'e' and s >= 1:\r\n d += 1\r\n elif i == 'l' and d >= 1:\r\n s1 += 1\r\n elif i == 'o' and s1 >= 1:\r\n d1 += 1\r\nif s >= 1 and d >= 1 and s1 >= 2 and d1 >= 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "# Input the word typed by Vasya\r\nword = input()\r\n\r\n# Initialize variables to keep track of the positions of the characters in \"hello\"\r\nhello = \"hello\"\r\npos = 0\r\n\r\n# Iterate through the characters in the input word\r\nfor char in word:\r\n # If the current character matches the character in \"hello\" at the current position, move to the next position\r\n if char == hello[pos]:\r\n pos += 1\r\n # If all characters in \"hello\" have been matched, Vasya managed to say hello\r\n if pos == len(hello):\r\n print(\"YES\")\r\n break\r\n\r\n# If Vasya couldn't say hello, print \"NO\"\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=\"hello\"\r\nk=0\r\nm=0\r\nfor i in b:\r\n a=a[k::]\r\n #print(a)\r\n try:\r\n k=a.index(i)\r\n if(i=='l'):\r\n k=k+1\r\n if i in a:\r\n pass\r\n else:\r\n m=1\r\n print('NO')\r\n break\r\n except:\r\n m=1\r\n print('NO')\r\n break\r\nif(m==0):\r\n print('YES')\r\n", "s=input()\r\ni=0\r\nvt=0\r\nwhile (i<=len(s)-1):\r\n if (s[i]==\"h\")&(vt==0):\r\n vt+=1\r\n elif (s[i]==\"e\")&(vt==1):\r\n vt+=1\r\n elif (s[i]==\"l\")&(vt==2):\r\n vt+=1\r\n elif (s[i]==\"l\")&(vt==3):\r\n vt+=1\r\n elif (s[i]==\"o\")&(vt==4):\r\n vt+=1\r\n if (vt==5):\r\n break\r\n i+=1\r\nif (vt==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nindx = 0\r\ninds = 0\r\nwhile inds < len(s) and indx < 5:\r\n\tif 'hello'[indx] == s[inds]:\r\n\t\tindx += 1\r\n\tinds += 1\r\nprint(['NO', 'YES'][indx == 5])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 20 15:34:31 2022\r\n\r\n@author: lpf\r\n\"\"\"\r\ninp=input().lower()\r\nhello=['h','e','l','l','o']\r\nn=0\r\nfor x in inp:\r\n if x==hello[n]:\r\n n+=1\r\n if n==5:\r\n break\r\nprint('YES' if n==5 else 'NO')\r\n\r\n \r\n\r\n", "import re\r\nprint(('YES', 'NO')[re.search(r'.*h.*e.*l.*l.*o.*', input()) is None])\r\n", "s = input()\r\nMSG = \"hello\"\r\nsuccess = True\r\ni = 0\r\nfor c in MSG:\r\n if s.find(c, i) == -1:\r\n success = False\r\n break\r\n else:\r\n i = s.find(c, i) + 1\r\nif success:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "string = input()\naux = ['h', 'e', 'l', 'l', 'o']\ni = 0\nfor char in string:\n if i >= 5:\n break\n if char == aux[i]:\n i += 1\nif i == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t\t\t\t\t \t\t \t \t \t \t", "s = input()\r\nh = ['h', 'e', 'l', 'l', 'o']\r\ni = 0\r\nf = 0\r\nc = 0\r\nfor x in range(len(h)):\r\n f = 0\r\n for y in range(i, len(s)):\r\n if h[x] == s[y]:\r\n i = y+1\r\n c += 1\r\n f = 1\r\n break\r\n if f == 0:\r\n print(\"NO\")\r\n exit()\r\nif c == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nqw = list(a)\r\nar = ['h','e','l','l','o']\r\nfin = []\r\nn = ''\r\nfor i in range(len(ar)):\r\n while True:\r\n try:\r\n n = qw[i]\r\n n = ar[i]\r\n except:\r\n break\r\n if qw[i] != ar[i]:\r\n del qw[i]\r\n else:\r\n break\r\nif ''.join(qw[:5]) == 'hello':\r\n print('YES')\r\nelse:print('NO')", "if __name__ == '__main__':\r\n st = str(input())\r\n n = 5\r\n for s in st:\r\n if s == 'h' and n == 5:\r\n n -= 1\r\n if s == 'e' and n == 4:\r\n n -= 1\r\n if s == 'l' and 1 < n < 4:\r\n n -= 1\r\n if s == 'o' and n == 1:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")", "a=input()\r\nc=0\r\nfor i in range(len(a)):\r\n if a[i]=='h':\r\n for j in range(i,len(a)):\r\n if a[j]=='e':\r\n for q in range(j,len(a)):\r\n if a[q]=='l':\r\n for w in range(q+1,len(a)):\r\n if a[w]=='l':\r\n for e in range(w,len(a)):\r\n if a[e]=='o':\r\n c=1\r\nif c==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\ns2=\"hello\"\nj=0\ns3=\"YES\"\ni=0\nif \"h\" in s:\n i=s.index(\"h\")\nelse :\n s3=\"NO\"\ns4=s[i:]\nwhile i<len(s) and j<5 and s3==\"YES\":\n if s2[j] in s4:\n s4=s4[s4.index(s2[j])+1:]\n j+=1\n else:\n s3=\"NO\"\n break\nprint(s3)\n", "def get_occurrence(s: str, c: chr, start: int):\r\n\r\n for i in range(start, len(s)):\r\n if s[i] == c:\r\n return i\r\n return False\r\n\r\n\r\ns = input().lower()\r\ntry:\r\n h_index = s.index('h')\r\n e_index = get_occurrence(s, 'e', h_index + 1)\r\n l1_index = get_occurrence(s, 'l', e_index + 1)\r\n l2_index = get_occurrence(s, 'l', l1_index + 1)\r\n o_index = get_occurrence(s, 'o', l2_index + 1)\r\n print(['NO', 'YES'][h_index < e_index < l1_index < l2_index < o_index])\r\nexcept:\r\n print('NO')", "w = input()\r\nhello = 0\r\nn = len(w)\r\ni = 0\r\nwhile i < n: \r\n if w[i] == \"h\": \r\n hello = hello + 1\r\n i = i + 1\r\n break\r\n else: \r\n i = i + 1\r\nwhile i < n: \r\n if w[i] == \"e\": \r\n hello = hello + 1\r\n i = i + 1\r\n break\r\n else: \r\n i = i + 1\r\nwhile i < n: \r\n if w[i] == \"l\": \r\n hello = hello + 1\r\n i = i + 1\r\n break\r\n else: \r\n i = i + 1\r\nwhile i < n: \r\n if w[i] == \"l\": \r\n hello = hello + 1\r\n i = i + 1\r\n break\r\n else: \r\n i = i + 1\r\nwhile i < n: \r\n if w[i] == \"o\": \r\n hello = hello + 1\r\n i = i + 1\r\n break\r\n else: \r\n i = i + 1\r\nif hello == 5: \r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "s = str(input())\r\n\r\ncount = 0\r\nfor i in range(0, len(s)):\r\n if s[i] == 'h' and count == 0:\r\n count += 1\r\n elif s[i] == 'e' and count == 1:\r\n count += 1\r\n elif s[i] == 'l' and count == 2:\r\n count += 1\r\n elif s[i] == 'l' and count == 3:\r\n count += 1\r\n elif s[i] == 'o' and count == 4:\r\n count += 1\r\n\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "x = input()\r\ny = \"hello\"\r\n \r\n \r\n# In[2]:\r\n \r\n \r\nj = 0\r\n \r\n \r\n# In[3]:\r\n \r\n \r\nfor i in range(len(x)):\r\n if x[i] == y[j]:\r\n j += 1\r\n if j == 5:\r\n print(\"YES\")\r\n break\r\n \r\n \r\n# In[4]:\r\n \r\n \r\nif j<5:\r\n print(\"NO\")", "s = input()\r\n\r\n# Define the required letters for \"hello\"\r\nletters = \"hello\"\r\n\r\n# Initialize index for the required letters\r\nindex = 0\r\n\r\n# Loop through each letter in \"hello\"\r\nfor letter in letters:\r\n # Find the first occurrence of the letter in the input string starting from the current index\r\n found_index = s.find(letter, index)\r\n if found_index == -1:\r\n # The letter was not found in the input string\r\n print(\"NO\")\r\n break\r\n # Update the index to the next position\r\n index = found_index + 1\r\nelse:\r\n # All required letters were found in the input string\r\n print(\"YES\")\r\n", "s = input()\r\ni = 0\r\nwords = 'hello'\r\nresult = []\r\nwhile i < len(s):\r\n if s[i] == \"h\":\r\n result.append(s[i])\r\n s = s[(i + 1):]\r\n i = 0\r\n break\r\n\r\n i += 1\r\n\r\nwhile i < len(s):\r\n if s[i] == \"e\":\r\n result.append(s[i])\r\n s = s[(i + 1):]\r\n i = 0\r\n break\r\n i += 1\r\n\r\nwhile i < len(s):\r\n if s[i] == \"l\":\r\n result.append(s[i])\r\n s = s[(i + 1):]\r\n i = 0\r\n break\r\n i += 1\r\n\r\nwhile i < len(s):\r\n if s[i] == \"l\":\r\n result.append(s[i])\r\n s = s[(i + 1):]\r\n i = 0\r\n break\r\n i += 1\r\n\r\nwhile i < len(s):\r\n if s[i] == \"o\":\r\n result.append(s[i])\r\n s = s[(i + 1):]\r\n i = 0\r\n break\r\n i += 1\r\nresult = ''.join(result)\r\nif result == words:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = str(input())\r\np = list(n)\r\nlst = list()\r\ncount = 0\r\nfor i in range(0,len(p)):\r\n if p[i] == 'h':\r\n for j in range(i+1,len(p)):\r\n if p[j] == 'e':\r\n for k in range(j+1,len(p)):\r\n if p[k] == 'l':\r\n for l in range(k+1,len(p)):\r\n if p[l] == 'l':\r\n for m in range(l+1,len(p)):\r\n if p[m] == 'o':\r\n print('YES')\r\n quit()\r\nprint ('NO')\r\n", "word = input()\r\nrequired = 'hello'\r\nfound = []\r\nsearch = 0\r\nstatus = 0\r\nwhile True:\r\n if search == len(word) or status == 5:\r\n break\r\n elif word[search] == required[status]:\r\n status+=1\r\n search += 1\r\nif status == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = str(input()).lower()\r\nh = a.find('h') # поиск номера буквы 'h'\r\ne = a.find('e', h) # поиск номера буквы 'e\r\nl_1 = a.find('l', e) # поиск номера первой буквы 'l'\r\nl_2 = a.find('l', l_1+1) # поиск номера второй буквы 'l'\r\no = a.rfind('o', l_2) # поиск номера буквы 'o'\r\nY = 'YES'\r\nN = 'NO'\r\nprint((h < e < l_1 < l_2 < o)*Y, (h > e or h > l_1 or h > l_2 or e > l_1 or e > l_2 or l_1 > l_2 or len(a) < 5 or h == -1 or e == -1 or l_1 == -1 or l_2 == -1 or o == -1)*N)", "import sys\r\ndef locate(num,letter,str):\r\n for i in range(num,len(str)):\r\n if str[i]==letter:\r\n break\r\n else:\r\n i=-i\r\n return i\r\n \r\ns=input()\r\nif 'h' not in s or 'e' not in s or 'l' not in s or 'o' not in s:\r\n print('NO')\r\n sys.exit()\r\nH=locate(0,'h',s)\r\nE=locate(abs(H),'e',s)\r\nL1=locate(abs(E),'l',s)\r\nL2=locate(abs(L1+1),'l',s)\r\nO=locate(abs(L2),'o',s)\r\nif H>=0 and E>=0 and L1>=0 and L2>=0 and O>=0 and H<E and E<L1 and L1<L2 and L2<O:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\"\"\"\r\nA. Chat room\r\n\"\"\"\r\ns = input()\r\nh = \"hello\"\r\nindex1 = 0\r\nindex2 = 0\r\n\r\nwhile index1 < len(h) and index2 < len(s) :\r\n\tif s[index2] == h[index1] :\r\n\t\tindex1 += 1\r\n\t\tindex2 += 1\r\n\telse :\r\n\t\tindex2 += 1\r\nif index1 == 5 :\r\n\tprint(\"YES\")\r\nelse :\r\n\tprint(\"NO\")", "s = input()\r\nk = \"hello\"\r\nj = 0\r\nfor i in s:\r\n if i == k[j]:\r\n k = k[1:]\r\n if len(k) == 0:\r\n break\r\nif len(k) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nt=\"hello\"\r\nfor i in t:\r\n j=s.find(i)\r\n s=s[j+1:]\r\n if j==-1:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\") ", "s = input()\r\n\r\nsl = list(s)\r\n\r\nhello = \"hello\"\r\n\r\n\r\nfor i in range(len(sl)):\r\n #print(hello[:1]) # h\r\n #print(hello[1:]) # ello\r\n if sl[i] == hello[:1]:\r\n hello = hello[1:]\r\nif hello == \"\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = input()\r\nh = word.find('h')\r\ne = word[(h+1):].find('e')+h+1\r\nl = word[(e+1):].find('l')+e+1\r\nl2 = word[(l+1):].find('l')+l+1\r\no = word[(l2+1):].find('o')+l2+1\r\nu = [h,e,l,l2,o]\r\nif -1 in u or l == l2 or h == e or l == e or l2 == o:\r\n\tprint('NO')\r\nelif sorted(u) == u:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\t", "s=input()\r\nword=\"hello\"\r\ni=0\r\nfor j in s:\r\n if i>=len(word):\r\n break\r\n if j==word[i]:\r\n i+=1\r\nif i>=len(word):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nk=\"hello\"\r\nt=0\r\nfor i in s:\r\n if t<5 and i==k[t] :\r\n t+=1\r\n elif t==5:\r\n break\r\nif t==5:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "s=input()\r\na=['h','e','l','l','o']\r\nk=0\r\nq=0\r\nc=0\r\nfor i in s:\r\n if(a[k]==i):\r\n c+=1 \r\n k+=1 \r\n if(k==5):\r\n q=1\r\n break\r\nif(q==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = input()\r\nz = \"hello\"\r\nc = 0\r\ndef func():\r\n global word, c, z\r\n for i in z:\r\n if i in word:\r\n c+=1\r\n word = word[word.index(i)+1:]\r\nif c < 5 and \"h\" in word:\r\n c = 0\r\n func()\r\nif c == 5:\r\n print(\"YES\",)\r\nelse:\r\n print(\"NO\",)", "s=input()\r\nc=\"hello\"\r\ni = 0\r\nl=0\r\nfor j in range(len(c)):\r\n while i<len(s):\r\n if c[j]==s[i]:\r\n l+=1\r\n i+=1\r\n break\r\n i+=1\r\nif l==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "word = input()\r\nres = []\r\nres.append(word.find('h'))\r\nres.append(word.find('e', res[0] + 1))\r\nres.append(word.find('l', res[1] + 1))\r\nres.append(word.find('l', res[2] + 1))\r\nres.append(word.find('o', res[3] + 1))\r\nif all(map(lambda x: x > -1, res)):\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "def func(s):\r\n c = \"hello\"\r\n q = 0\r\n for i in s:\r\n if i == c[q]:\r\n q += 1\r\n if q == len(c):\r\n return 'YES'\r\n return 'NO'\r\ns = input()\r\nprint(func(s))", "m = \"hello\"\nflag = True\nx = 0\ns = input()\nfor i in range(len(s)):\n if s[i] == m[x]:\n x += 1\n if x == 5:\n print(\"YES\")\n flag = False\n break\nif flag == True:\n print(\"NO\")\n", "n=input()\r\nl1=['h','e','l','l','o']\r\nj=0\r\nfor i in n:\r\n if(j==5):\r\n break\r\n if(i==l1[j]):\r\n j+=1\r\nif(j==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def chat():\r\n s=str(input())\r\n h=\"hello\"\r\n x=0\r\n for i in range(len(s)):\r\n if(s[i]==h[x]):\r\n x+=1\r\n if x==5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chat())", "s = input()\r\nstack = ['h', 'e', 'l', 'l', 'o']\r\n\r\nfor i in range(len(s)):\r\n if stack and s[i] == stack[0]:\r\n stack.pop(0)\r\n\r\nif not stack:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\nn=len(s)\r\nk=list(\"hello\")\r\nj=0\r\nc=0\r\nfor i in range(n):\r\n if c==5:\r\n break\r\n if s[i]==k[j]:\r\n c+=1\r\n j+=1\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "greet = input()\r\nword = 'hello'\r\na = 0\r\ncount = 0\r\nfor i in range(len(greet)):\r\n try:\r\n if greet[i] == word[a]:\r\n a += 1\r\n count += 1\r\n except IndexError:\r\n pass\r\n\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\n\r\nstring = str(input())\r\n\r\nregex = r'\\w{0,}h\\w{0,}e\\w{0,}l\\w{0,}l\\w{0,}o\\w{0,}'\r\n\r\nif(bool(re.match(regex , string))):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\ns=list(input())# your code goes here\r\nm={'h':0,'e':0,'l':0,'o':0}\r\nk=[]\r\nfor i in range(len(s)):\r\n\tif(s[i]=='h' and m['h']==0 and m['e']==0 and m['l']==0 and m['o']==0):\r\n\t\tm['h']=m['h']+1\r\n\t\tk.append(s[i])\r\n\tif(s[i]=='e' and m['h']==1 and m['e']==0):\r\n\t\tk.append(s[i])\r\n\t\tm['e']=m['e']+1\r\n\tif(s[i]=='l' and m['e']==1 and m['l']<=1):\r\n\t\tk.append(s[i])\r\n\t\tm['l']=m['l']+1\r\n\tif(s[i]=='o' and m['l']==2 and m['o']==0):\r\n\t\tk.append(s[i])\r\n\t\tm['o']=m['o']+1\r\nif(''.join(k)=='hello'):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=input()\r\na=n.find('h')\r\nb=n.find('e',a+1)\r\nc=n.find('l',b+1)\r\nd=n.find('l',c+1)\r\ne=n.find('o',d+1)\r\ny=n[a]+n[b]+n[c]+n[d]+n[e]\r\nprint(('hello' in y)*'YES',(not 'hello' in y)*'NO',sep='')\r\n", "s=input()\r\npat=\"hello\"\r\nc=0\r\nflag=0\r\nfor i in range(len(s)):\r\n if(s[i]==pat[c]):\r\n c+=1\r\n if(c==5):\r\n print(\"YES\")\r\n flag=1\r\n break\r\nif(flag==0):\r\n print(\"NO\")", "\nword = input()\nkey_word = \"hello\"\nkey_word_index = 0\nfor char in word:\n if key_word[key_word_index] == char:\n key_word_index += 1\n if key_word_index == len(key_word):\n print(\"YES\")\n exit()\nprint(\"NO\")", "st = input()\r\nhello = ['o', 'l', 'l', 'e', 'h']\r\n\r\nfor i in st:\r\n if len(hello) > 0:\r\n if i == hello[len(hello)-1]:\r\n hello.pop()\r\n else:\r\n break\r\n\r\nif len(hello) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "x=str(input())\r\nl1=x.find(\"h\")\r\nl2=x.find(\"e\",l1)\r\nl3=x.find(\"l\",l2)\r\nl4=x.find(\"l\",l3+1)\r\nl5=x.find(\"o\",l4)\r\nif l1>=0 and l2>0 and l3>0 and l4>0 and l5>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "string= input();\r\nc = \"hello\";\r\nn = len(c);\r\nk = 0;\r\ni = 0;\r\nm = len(string);\r\nwhile(i != n and k != m):\r\n if(c[i] == string[k]):\r\n i = i+1;\r\n k= k+1\r\nif(i == n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "hello = list('hello')\r\nhello.reverse()\r\ngreeting = input()\r\n\r\nfor c in greeting:\r\n if c == hello[-1]:\r\n hello.pop()\r\n if len(hello) == 0:\r\n break\r\n\r\nif len(hello) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "st=input()\r\nlt=['h','e','l','l','o']\r\ns=''\r\nfor x in st:\r\n if len(lt)!=0:\r\n if lt[0]==x:\r\n lt.pop(0)\r\n else:\r\n pass\r\n else:\r\n pass\r\nif len(lt)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 27 15:25:37 2023\r\n\r\n@author: 徐荣飞-2300011068\r\n\"\"\"\r\n\r\nstring=str(input())\r\na=string.find('h')\r\nb=string.find('e',a+1)\r\nc=string.find('l',b+1)\r\nd=string.find('l',c+1)\r\ne=string.find('o',d+1)\r\nif a!=-1 and b!=-1 and c!=-1 and d!=-1 and e!=-1:\r\n print('YES')\r\nelse:\r\n print('NO')", "## Ctrl + B to build, Ctrl + Shift + P to run\r\n## Don't forget to delete REPL stuff\r\nimport sys\r\nimport re\r\nfrom collections import deque\r\nfrom copy import copy\r\np = re.compile(\"^[a-z]*h[a-z]*e[a-z]*l[a-z]*l[a-z]*o[a-z]*$\")\r\nS = sys.stdin.readline()\r\nif p.match(S):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s, t = input(), 0\r\nfor a in \"hello\":\r\n b = s[t:].find(a)\r\n if b < 0: break\r\n t += b + 1\r\nprint('YES' if t > 0 and b > -1 else 'NO')", "si = input()\nj = 0\nif si[0] == \"h\":\n j += 1\n\nl_flag = True\nfor i in range(1, len(si)):\n if si[i] == si[i-1] and l_flag:\n continue\n if si[i] == \"hello\"[j]:\n if j == 4: \n j += 1\n break\n j += 1\n if j == 3: l_flag = False\n else: l_flag = True\n continue\n\nif j == 5: \n print(\"YES\")\nelse: \n print(\"NO\")\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", "reflist=['h','e','l','l','o']\r\nx=input()\r\nmylist=[item.lower() for item in x]\r\nfor item in reflist:\r\n if item in mylist:\r\n del mylist[0:mylist.index(item)+1]\r\n result='YES'\r\n else:\r\n result='NO'\r\n break\r\n \r\nprint(result)\r\n", "s=input().lower()\nmatch=0\nl=['h','e','l','l','o']\nj=0\nfor i in range(len(s)):\n if s[i]==l[j]:\n match+=1\n j+=1\n if j==len(l):\n break\nif match==5:\n print('YES')\nelse:\n print('NO')", "s=input()\r\ns1=\"ello\"\r\nx=s.find('h')\r\nflag=0\r\nfor i in s1:\r\n y=x+1+s[x+1:].find(i)\r\n if x<y:\r\n x=y\r\n else:\r\n flag=1\r\n break\r\nif flag==1:\r\n print('NO')\r\nelse:\r\n print('YES')", "s=input()\r\nv='hello'\r\na=''\r\ni,j=0,0\r\nwhile i<len(s) and j<len(v):\r\n if s[i]==v[j]:\r\n a+=s[i]\r\n j+=1\r\n i+=1\r\n #print(v[j])\r\n else:\r\n #print(s[i])\r\n i+=1\r\n#print(a)\r\nif a==v:\r\n print('YES')\r\nelse:\r\n print('NO')", "lis = ['h', 'e', 'l','l', 'o']\r\n\r\nstr1 = str(input())\r\n\r\ni = 0\r\n\r\nwhile len(lis) != 0:\r\n if str1[i] == lis[0]:\r\n lis.pop(0)\r\n i += 1\r\n if i == len(str1):\r\n break\r\n\r\nif len(lis) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "sl = str(input()).lower()\r\nt = \"hello\"\r\nfor rm in sl:\r\n if len(t) == 0:break\r\n if rm == t[0]:t = t[1:]\r\nif len(t) == 0:print(\"YES\")\r\nelse:print(\"NO\")", "s = input()\r\nfind = \"hello\"\r\ni = 0\r\n \r\nfor char in s:\r\n if i < 5 and char == find[i]:\r\n i += 1\r\n \r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "st=input()\r\nch=[]\r\nh=['h','e','l','l','o']\r\nj=0\r\nfor i in st:\r\n if j>=len(h):\r\n break\r\n if i == h[j]:\r\n ch.append(i)\r\n j+=1\r\n else:\r\n continue\r\nif \"\".join(ch)==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\nstr1 = str(input())\r\nif re.match(r'.*h.*e.*l.*l.*o.*', str1):\r\n print('YES')\r\nelse:\r\n print('NO')", "def print_hi():\r\n s = []\r\n res = \"\"\r\n inp = input()\r\n index = 0\r\n for i in range(index, len(inp)):\r\n if inp[i] == 'h':\r\n if res.find('h') == -1:\r\n res = res + inp[i]\r\n index = i\r\n for i in range(index, len(inp)):\r\n if inp[i] == 'e':\r\n if res.find('e') == -1:\r\n res += inp[i]\r\n index = i\r\n for i in range(index, len(inp)):\r\n if inp[i] == 'l':\r\n if res.find('l') == -1:\r\n res += inp[i]\r\n index = i\r\n else:\r\n if res.count('l') <= 1:\r\n res += inp[i]\r\n index = i\r\n for i in range(index, len(inp)):\r\n if inp[i] == 'o':\r\n if res.find('o') == -1:\r\n res += inp[i]\r\n index = i\r\n if res == 'hello':\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nprint_hi()\r\n", "a=str(input())\r\nb=len(a)\r\nA=[]\r\nt=0\r\nB=[]\r\nfor i in range(b):\r\n A.append(a[i])\r\nfor i in range(b):\r\n if A[0]!=\"h\":\r\n A.pop(0)\r\n else:\r\n B.append(A[0])\r\n A.pop(0)\r\n break\r\nb=len(A)\r\nfor i in range(b):\r\n if A[0]!=\"e\":\r\n A.pop(0)\r\n else:\r\n B.append(A[0])\r\n A.pop(0)\r\n break\r\nb=len(A)\r\nfor i in range(b):\r\n if A[0]!=\"l\":\r\n A.pop(0)\r\n else:\r\n B.append(A[0])\r\n A.pop(0)\r\n break\r\nb=len(A)\r\nfor i in range(b):\r\n if A[0]!=\"l\":\r\n A.pop(0)\r\n else:\r\n B.append(A[0])\r\n A.pop(0)\r\n break\r\nb=len(A)\r\nfor i in range(b):\r\n if A[0]!=\"o\":\r\n A.pop(0)\r\n else:\r\n B.append(A[0])\r\n A.pop(0)\r\n break\r\nif B==[\"h\",\"e\",\"l\",\"l\",\"o\"]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "string = input()\r\nletter_h = []\r\nletter_e = []\r\nletter_l = []\r\nletter_o = []\r\nfor x in range(len(string)):\r\n n = string[x]\r\n if n == \"h\":\r\n letter_h.append(x)\r\n if n == \"e\":\r\n letter_e.append(x)\r\n if n == \"l\":\r\n letter_l.append(x)\r\n if n == \"o\":\r\n letter_o.append(x)\r\ndef check():\r\n for a in letter_h:\r\n for b in letter_e:\r\n for c in letter_l:\r\n for d in letter_l:\r\n for e in letter_o:\r\n if a < b < c < d < e:\r\n return True\r\nif check():\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\na='hello'\nb=0\nc=0\nfor i in range(len(n)):\n if n[i]==a[b]:\n b+=1\n c+=1\n if b==5:\n break\nif c==5:\n print('YES')\nelse:\n print('NO')\n \t \t\t\t\t \t \t \t \t\t\t\t \t \t\t\t", "s = input()\r\nh = s.find('h')\r\ne = s.find('e',h+1)\r\nl = s.find('l',e+1)\r\nl2 = s.find('l',l+1)\r\no = s.find('o',l2+1)\r\n\r\nif h<e and e<l and l<l2 and l2<o:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\ns1 = \"hello\"\r\nj, consecutive = 0, 0\r\nfor i in range(len(s)):\r\n if(s[i] == s1[j]):\r\n j += 1\r\n consecutive += 1\r\n if consecutive == 5:\r\n break\r\nif consecutive == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "string = input()\r\nword = 'hello'\r\n\r\nfor i in string:\r\n if word != '':\r\n if i == word[0]:\r\n word = word[1:]\r\n else:\r\n break\r\n \r\nif word == '':\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/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 n = len(s)\r\n a = 0\r\n while a < n and s[a] != 'h':\r\n a += 1\r\n b = a + 1\r\n while b < n and s[b] != 'e':\r\n b += 1\r\n c = b + 1\r\n while c < n and s[c] != 'l':\r\n c += 1\r\n d = c + 1\r\n while d < n and s[d] != 'l':\r\n d += 1\r\n e = d + 1\r\n while e < n and s[e] != 'o':\r\n e += 1\r\n return \"YES\" if a < n and b < n and c < n and d < n and e < n else \"NO\"\r\n\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s = input()\r\nword = 'hello'\r\nfor i in s:\r\n if(len(word)==0):\r\n break\r\n if(i==word[0]):\r\n word = word.replace(i, '', 1)\r\n\r\nif(word==''):\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 12 22:28:43 2018\r\n\r\n@author: Quaint Sun\r\n\"\"\"\r\n\r\nword=list(input())\r\nlength=len(word) \r\n \r\nanswer=[] \r\nt=0\r\nwhile t<length:\r\n if word[t]=='h':\r\n answer.append(word[t])\r\n tt=t+1\r\n del word[:tt]\r\n break\r\n t=t+1\r\n \r\nlength=len(word)\r\nt=0\r\nwhile t<length:\r\n if word[t]=='e':\r\n answer.append(word[t])\r\n tt=t+1\r\n del word[:tt]\r\n break\r\n t=t+1\r\n\r\nlength=len(word)\r\nt=0\r\nwhile t<length:\r\n if word[t]=='l':\r\n answer.append(word[t])\r\n tt=t+1\r\n del word[:tt]\r\n break\r\n t=t+1\r\n \r\nlength=len(word)\r\nt=0\r\nwhile t<length:\r\n if word[t]=='l':\r\n answer.append(word[t])\r\n tt=t+1\r\n del word[:tt]\r\n break\r\n t=t+1\r\n \r\nlength=len(word)\r\nt=0\r\nwhile t<length:\r\n if word[t]=='o':\r\n answer.append(word[t])\r\n tt=t+1\r\n del word[:tt]\r\n break\r\n t=t+1\r\nif answer==['h','e','l','l','o']:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n", "Input = input()\r\nh, e, l, o = False, False, 0, False\r\nfor i in range(len(Input)):\r\n if Input[i] == 'h' and not h:\r\n h = True\r\n elif Input[i] == 'e' and h and not e:\r\n e = True\r\n elif Input[i] == 'l' and e and l < 2:\r\n l += 1\r\n elif Input[i] == 'o' and l == 2:\r\n o = True\r\n break\r\n \r\nif o:\r\n print('YES')\r\nelse:\r\n print('NO')", "inp = list(input())\nstack = []\nfor i in inp:\n if (i == 'h' and len(stack) == 0):\n stack.append('h')\n elif len(stack) != 0:\n if stack[-1] == 'h':\n if i == 'e':\n stack.append('e')\n elif stack[-1] == 'e':\n if i == 'l':\n stack.append('l')\n elif (stack[-1] == 'l' and stack[-2] == 'e'):\n if i == 'l':\n stack.append('l')\n elif (stack[-1] == 'l' and stack[-2] == 'l'):\n if i == 'o':\n stack.append('o')\nif stack == ['h', 'e', 'l', 'l', 'o']:\n print('YES\\n')\nelse:\n print(\"NO\\n\")", "string=input()\r\ncount=0\r\nl=['h','e','l','l','o']\r\nfor i in string:\r\n if i==l[count]:\r\n count+=1\r\n if count==5:\r\n break\r\n else:\r\n pass\r\nif count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n ", "# cook your dish here\r\ndef can_say_hello(word):\r\n target = \"hello\"\r\n i = 0\r\n\r\n for char in word:\r\n if char == target[i]:\r\n i += 1\r\n if i == len(target):\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\n\r\nword = input()\r\nresult = can_say_hello(word)\r\n\r\nprint(result)\r\n", "m = input()\n\nstart = 0\nok = True\nfor c in \"hello\":\n s = start\n for i in range(start, len(m)):\n if m[i] == c:\n start = i + 1\n break\n if s == start:\n ok = False\n break\nprint(\"YES\" if ok else \"NO\")", "str=input()\r\nword='hello'\r\ni=0\r\nfor c in str:\r\n if i<len(word) and c==word[i]:\r\n i+=1;\r\nif i==len(word):\r\n print('YES')\r\nelse:\r\n print('NO')", "banana=list(input())\r\ndummy=[\"h\",\"e\",\"l\",\"o\"]\r\nword=[]\r\nchecker=[]\r\nfor i in range(len(banana)):\r\n\tif banana[i] in dummy:\r\n\t\tword.append(banana[i])\r\nfor a in range(len(word)):\r\n\tif word[a]==\"h\":\r\n\t\tfor b in range(a+1,len(word)):\r\n\t\t\tif word[b]==\"e\":\r\n\t\t\t\tfor c in range(b+1,len(word)):\r\n\t\t\t\t\tif word[c]==\"l\":\r\n\t\t\t\t\t\tfor d in range(c+1,len(word)):\r\n\t\t\t\t\t\t\tif word[d]==\"l\":\r\n\t\t\t\t\t\t\t\tfor e in range(d+1,len(word)):\r\n\t\t\t\t\t\t\t\t\tif word[e]==\"o\":\r\n\t\t\t\t\t\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\t\t\t\t\t\texit()\r\nprint(\"NO\")\r\n\r\n\r\n", "s = input ().lower()\r\nword = (str(''))\r\n \r\na = s.find ('h')\r\ns=list(s)\r\ns[a]='.'\r\ns=''.join(s)\r\n \r\nb = s.find ('e', a)\r\ns=list(s)\r\ns[b]='.'\r\ns=''.join(s)\r\n \r\nc = s.find ('l', b)\r\ns=list(s)\r\ns[c]='.'\r\ns=''.join(s)\r\n \r\nd = s.find ('l', c)\r\ns=list(s)\r\ns[d]='.'\r\ns=''.join(s)\r\n \r\ne = s.find ('o', d)\r\ns=list(s)\r\ns[e]='.'\r\ns=''.join(s)\r\n \r\n \r\nif a != (-1) and a<b: word += 'h'\r\nif b != (-1) and b<c: word += 'e'\r\nif c != (-1) and c<d: word += 'l'\r\nif d != (-1) and d<e: word += 'l'\r\nif e != (-1): word += 'o'\r\n \r\nif word == 'hello':\r\n print (\"YES\")\r\nelse:\r\n print ('NO')", "# Read the input word\r\ns = input()\r\n\r\n# Initialize pointers to check for the characters of \"hello\"\r\nhello = \"hello\"\r\npointer = 0\r\n\r\n# Iterate through the characters of the input word\r\nfor char in s:\r\n if char == hello[pointer]:\r\n pointer += 1\r\n if pointer == len(hello):\r\n # All characters of \"hello\" have been found\r\n print(\"YES\")\r\n break\r\n\r\n# If the loop completes without finding all characters of \"hello\"\r\nif pointer < len(hello):\r\n print(\"NO\")\r\n", "s = input()\r\nh = 'hello'\r\nseek = 0\r\nfor c in s:\r\n if c == h[seek]:\r\n seek += 1\r\n if seek == len(h):\r\n break\r\nprint('YES' if seek == len(h) else 'NO')", "def chatroom(s):\r\n a,b = 0,0\r\n word = \"hello\"\r\n for i in range(len(s)):\r\n if s[i] == word[a]:\r\n a += 1\r\n b += 1\r\n\r\n if b == 5:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\ns = input()\r\nans = chatroom(s)\r\nprint(ans)", "word = input()\r\ncompare = ['h','e','l','l','o']\r\ncurr = 0\r\nwhile True: \r\n if len(word) < 5: \r\n break\r\n elif word[curr] != compare[curr]:\r\n word = word[:curr] + word[curr + 1:]\r\n elif curr == 4 or len(word) < 5:\r\n break\r\n else:\r\n curr += 1\r\n\r\nif 'hello' in word:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#王铭健，工学院 2300011118\r\nfrom sys import exit\r\nstr_list = list(input())\r\nwhile True:\r\n try:\r\n if str_list.index('h') > str_list.index('e'):\r\n str_list.remove('e')\r\n else:\r\n break\r\n except ValueError:\r\n print(\"NO\")\r\n exit(0)\r\nwhile True:\r\n try:\r\n if str_list.index('e') > str_list.index('l'):\r\n str_list.remove('l')\r\n else:\r\n break\r\n except ValueError:\r\n print(\"NO\")\r\n exit(0)\r\nwhile True:\r\n try:\r\n if str_list.index('l') > str_list.index('o'):\r\n str_list.remove('o')\r\n else:\r\n break\r\n except ValueError:\r\n print(\"NO\")\r\n exit(0)\r\nif str_list.count('l') >= 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from re import search\r\nprint(\"YES\"if search(\"h.*e.*l.*l.*o\", input())else \"NO\")", "s=iter(input())\r\nk = 'YNEOS'\r\nprint(k[any(c not in s for c in 'hello')::2])", "import re\r\n\r\na = input()\r\nif re.search(r'h\\d*\\w*e\\d*\\w*l\\d*\\w*l\\d*\\w*o', a, re.I):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "def main():\r\n s = 'hello'\r\n j=0\r\n flag = False\r\n n = input()\r\n for i in range(0, len(n)):\r\n if n[i] == s[j]:\r\n j+=1\r\n if j==5:\r\n flag = True\r\n break\r\n \r\n if flag == True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nif __name__ == '__main__':\r\n main()", "import re\r\na = input()\r\n\r\nif re.search(\".*h.*e.*l.*l.*o.*\", a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\r\n\r\nhello = re.compile('.*?[h]+.*?[e]+.*?[l].*?[l]+.*?[o]+.*?')\r\ns = input()\r\nif(re.fullmatch(hello,s) != None):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\nx=\"hello\"\nj = 0\nfor i in range(len(a)):\n if a[i]==x[j]:\n j+=1\n if j==5:\n print(\"YES\")\n break\nif j==0 or j==1 or j==2 or j==3 or j==4:\n print(\"NO\")\n \n \t \t \t\t \t\t\t\t\t\t \t \t \t \t \t\t \t \t", "s = input()\r\nt =\"hello\"\r\na = 0\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i] == t[a]:\r\n a += 1\r\n count+=1\r\n if count == 5:\r\n break\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "m = \"hello\"\r\ndef chatroom() :\r\n x =0\r\n s = input()\r\n for i in range(len(s)) :\r\n if(s[i]== m[x]) :\r\n x += 1\r\n if x==5 :\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chatroom())", "s=input()\r\nsx=\"hello\"\r\nsf=\"\"\r\nj=0\r\nfor i in range(len(s)):\r\n if sx[j]==s[i]:\r\n sf+=sx[j]\r\n j+=1\r\n if(j==len(sx)):\r\n # print(sf)\r\n break\r\nif(sx==sf):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w=\"hello\"\r\ndef ch(s):\r\n c=0\r\n for i in range(len(s)):\r\n if(s[i]==w[c]):\r\n c+=1\r\n if(c==5):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\ns=input()\r\nprint(ch(s))", "string = input()\r\nhello = [\"h\",'e','l','l','o','!']\r\ncount = 0\r\nfor sym in string:\r\n if sym in hello[0]:\r\n hello.remove(sym)\r\n\r\nif hello == [\"!\"]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nd=\"hello\"\r\nx=0\r\ny=0\r\nfor i in s:\r\n if(i==d[x]):\r\n x+=1\r\n y+=1\r\n if(x==5):\r\n break\r\nif(y==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "count=0\r\nk=\"hello\"\r\n\r\nx=input()\r\nfor i in x:\r\n\r\n if i==k[count]:\r\n count+=1\r\n if count==5:\r\n break\r\n \r\nif count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "A = input()\r\nA = list(A)\r\nb = 0\r\ni = 1\r\nwhile i <= len(A):\r\n if A[i - 1].upper() == 'H':\r\n i += 1\r\n elif A[i - 1].upper() == 'E':\r\n i += 1\r\n elif A[i - 1].upper() == 'L':\r\n i += 1\r\n elif A[i - 1].upper() == 'O':\r\n i += 1\r\n else:\r\n A[i - 1] = ''\r\n i += 1\r\ni = 1\r\nh = 0\r\nwhile i <= len(A):\r\n if A[i - 1].upper() == 'H' and h == 0:\r\n h += 1\r\n b = i\r\n i += 1\r\n elif A[i - 1].upper() == 'H' and h == 1:\r\n A[i - 1] = ''\r\n i += 1\r\n else:\r\n i += 1\r\ni = 1\r\no = 0\r\nwhile i <= len(A):\r\n if A[-i].upper() == 'O' and o == 0:\r\n o += 1\r\n i += 1\r\n elif A[-i].upper() == 'O' and o == 1:\r\n A[-i] = ''\r\n i += 1\r\n else:\r\n i += 1\r\ni = 1\r\ne = 0\r\nwhile i <= len(A):\r\n if A[i - 1].upper() == 'E' and e == 0 and i > b:\r\n e += 1\r\n b = i\r\n i += 1\r\n elif A[i - 1].upper() == 'E' and e == 1:\r\n A[i - 1] = ''\r\n i += 1\r\n elif A[i - 1].upper() == 'E' and i < b:\r\n A[i - 1] = ''\r\n i += 1\r\n else:\r\n i += 1\r\ni = 1\r\nl = 0\r\nwhile i <= len(A):\r\n if A[i - 1].upper() == 'L' and l < 2 and i > b:\r\n l += 1\r\n i += 1\r\n elif A[i - 1].upper() == 'L' and l == 2:\r\n A[i - 1] = ''\r\n i += 1\r\n elif A[i - 1].upper() == 'L' and i < b:\r\n A[i - 1] = ''\r\n i += 1\r\n else:\r\n i += 1\r\nA = \"\".join(A)\r\nif A.lower() == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=input()\ns1=s1.lower()\nhInd=s1.find('h')\neInd=s1.find('e',hInd,len(s1))\nlInd=s1.find('l',eInd,len(s1))\nllInd=s1.find('l',lInd+1,len(s1))\noInd=s1.find('o',llInd,len(s1))\nif oInd>llInd>lInd>eInd>hInd:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s = input()\r\nit = iter(s)\r\nprint('YES' if all(any(c == ch for c in it) for ch in 'hello') else 'NO')", "s=input()\r\nimport re\r\nx=re.compile(r'^(.*)h(.*)e(.*)l(.*)l(.*)o(.*)$')\r\nif x.match(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s = str(input())\r\nhello = 'hello'\r\nt = 0\r\na = 0\r\nfor i in range(5):\r\n for j in range(len(s)-a):\r\n a += 1\r\n if s[a-1] == hello[i]:\r\n a = max(j+1, a)\r\n t+=1\r\n break\r\n if t == 5 :\r\n break\r\nprint('YES' if t == 5 else 'NO')", "str=list(input())\r\nm=['h','e','l','l','o']\r\nc=0\r\nfor i in range(len(str)):\r\n if str[i]==m[c]:\r\n c=c+1\r\n if c==5:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "s=input()\nindex=0\noutput=[]\nfor char in 'hello':\n #print(index,char)\n for i in range(index,len(s)):\n if s[i] == char:\n output.append(s[i])\n index=index+1\n break\n else:\n index=index+1\n#print(output)\nif len(output) == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "c = input()\r\nb = len(c)\r\nk = 0\r\nm = 0\r\nwhile k < b:\r\n if c[k] == \"h\":\r\n k += 1\r\n break\r\n else:\r\n k += 1\r\nwhile k < b:\r\n if c[k] == \"e\":\r\n k += 1\r\n break\r\n else:\r\n k += 1\r\nwhile k < b:\r\n if c[k] == \"l\":\r\n k += 1\r\n break\r\n else:\r\n k += 1\r\nwhile k < b:\r\n if c[k] == \"l\":\r\n k += 1\r\n break\r\n else:\r\n k += 1\r\nwhile k < b:\r\n if c[k] == \"o\":\r\n print(\"YES\")\r\n m = 1\r\n break\r\n else:\r\n k += 1\r\nif m == 0:\r\n print(\"NO\")", "s = input()\r\nl = []\r\nk=0\r\nfor i in range(len(s)):\r\n if s[i]==\"h\":\r\n l.append(s[i])\r\n k = i\r\n break\r\nfor i in range(k+1,len(s)):\r\n if s[i]==\"e\":\r\n l.append(s[i])\r\n k = i\r\n break\r\nfor i in range(k+1,len(s)):\r\n if s[i]==\"l\":\r\n l.append(s[i])\r\n k = i\r\n break\r\nfor i in range(k+1,len(s)):\r\n if s[i]==\"l\":\r\n l.append(s[i])\r\n k = i\r\n break\r\nfor i in range(k+1,len(s)):\r\n if s[i]==\"o\":\r\n l.append(s[i])\r\n k = i\r\n break\r\n\r\nif \"\".join(l)==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "from functools import cache\r\ns = input()\r\n\r\nm = 'hello'\r\ni = 0\r\nj = 0\r\nwhile i < 5 and j < len(s):\r\n if m[i] == s[j]:\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\n\r\nif i >= 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n ", "word = list(input())\r\n\r\nhello = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nhi = 0\r\nfor letter in word:\r\n if letter == hello[hi]:\r\n hi += 1\r\n if hi == 5:\r\n break\r\n\r\nif hi == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "hello = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\ncopy = hello.copy()\r\nresult = []\r\n\r\ns = input()\r\n\r\nfor i in s:\r\n \r\n if copy==[]:\r\n break\r\n\r\n if i==copy[0]:\r\n result.append(copy[0])\r\n copy.remove(copy[0])\r\n\r\nprint(\"YES\" if result == hello else \"NO\")", "s1=input()\r\ncheck=True\r\nif 'h' in s1 :\r\n h_index=str.index(s1,'h')\r\n af_h=s1[h_index+1:len(s1)]\r\n if 'e' in af_h :\r\n e_index=str.index(af_h,'e')\r\n af_e=af_h[e_index+1:len(af_h)]\r\n if 'l' in af_e :\r\n l1_index=str.index(af_e,'l')\r\n af_l1=af_e[l1_index+1:len(af_e)]\r\n if 'l' in af_l1:\r\n l2_index=str.index(af_l1,'l')\r\n af_l2=af_l1[l2_index+1:len(af_l1)]\r\n if 'o' in af_l2:\r\n check=False\r\n print(\"YES\")\r\n\r\n\r\n\r\nif check :\r\n print(\"NO\")", "s=input()\r\nn=len(s)\r\nflag=0\r\nif 'h' in s:\r\n ss=s.index('h')\r\n s=s[ss+1:]\r\n if 'e' in s:\r\n ss=s.index('e')\r\n s=s[ss+1:]\r\n if 'l' in s:\r\n ss=s.index('l')\r\n s=s[ss+1:]\r\n if 'l' in s:\r\n ss=s.index('l')\r\n s=s[ss+1:]\r\n if 'o' in s:\r\n ss=s.index('o')\r\n s=s[ss+1:]\r\n flag=1\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\npos=s.find(\"h\")\r\npos2=s.find(\"e\",pos+1)\r\npos3=s.find(\"l\",pos2+1)\r\npos4=s.find(\"l\",pos3+1)\r\npos5=s.find(\"o\",pos4+1)\r\n\r\nif pos!=-1 and pos2!=-1 and pos3!=-1 and pos4!=-1 and pos5!=-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ni=0\r\na=\"\"\r\nwhile a==\"\":\r\n if i<len(s):\r\n if s[i]==\"h\":\r\n a=a+s[i]\r\n i+=1\r\n else:\r\n print(\"NO\")\r\n break\r\nwhile a==\"h\":\r\n if i < len(s):\r\n if s[i]==\"e\":\r\n a=a+s[i]\r\n i+=1\r\n else:\r\n print(\"NO\")\r\n break\r\nwhile a==\"he\":\r\n if i < len(s):\r\n if s[i]==\"l\":\r\n a=a+s[i]\r\n i+=1\r\n else:\r\n print(\"NO\")\r\n break\r\nwhile a==\"hel\":\r\n if i<len(s):\r\n if s[i]==\"l\":\r\n a=a+s[i]\r\n i+=1\r\n else:\r\n print(\"NO\")\r\n break\r\nwhile a==\"hell\":\r\n if i < len(s):\r\n if s[i]==\"o\":\r\n a=a+s[i]\r\n i+=1\r\n else:\r\n print(\"NO\")\r\n break\r\nif a==\"hello\":\r\n print(\"YES\")", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[12]:\n\n\ns=input()\nif 'h' in s and 'e' in s and 'l' in s and 'o' in s:\n x1=s.find('h')\n if 'e' in s[(x1+1):]:\n x2=s[(x1+1):].find('e')\n if 'l' in s[(x1+1):][(x2+1):]:\n x3=s[(x1+1):][(x2+1):].find('l')\n if 'l' in s[(x1+1):][(x2+1):][(x3+1):]:\n x4=s[(x1+1):][(x2+1):][(x3+1):].find('l')\n if 'o' in s[(x1+1):][(x2+1):][(x3+1):][(x4+1):]:\n print('YES')\n else:\n print('NO')\n else:\n print('NO')\n else:\n print('NO')\n else:\n print('NO')\n \nelse:\n print('NO')\n \n\n", "n=input()\r\na='hello'\r\nc=0\r\nj=0\r\nfor i in range(len(n)):\r\n if(a[j]==n[i]):\r\n j+=1\r\n c+=1\r\n if(c==5):\r\n break\r\nif(c==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nx = 'hello'\r\na = 0\r\nfor i in s:\r\n if i == x[a]:\r\n a+=1\r\n if a==5:\r\n break\r\nif a == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\n\r\na1 = 0\r\na2 = 0\r\na3 = 0\r\na4 = 0\r\n\r\nfor j in s:\r\n if not a1 and j == \"h\":\r\n a1 = 1\r\n continue\r\n if a1 and j == \"e\":\r\n a2 = 1\r\n continue\r\n if a2 and not a3 and j == \"l\":\r\n a3 = 1\r\n continue\r\n if a3 and j == \"l\":\r\n a4 = 1\r\n continue\r\n if a4 and j == \"o\":\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "s=input()\r\ngreet=['h','e','l','l','o']\r\ni=0\r\nresult=\"NO\"\r\nfor x in range(len(s)):\r\n if s[i]==greet[0]:\r\n greet.pop(0)\r\n if len(greet)==0:\r\n result=\"YES\"\r\n break\r\n i+=1\r\n \r\nprint(result)", "s = input()\ndst = \"hello\"\n\nid = 0\nfor i in range(len(s)):\n if s[i] == dst[id]:\n id += 1\n if id == len(dst):\n break\n\nif id == len(dst):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s=str(input()).lower()\r\nh=s.find('h')\r\ne=h+s[h::].find('e')\r\nl1=e+s[e::].find('l')\r\nl2=l1+s[l1+1::].find('l')\r\no=l2+s[l2::].find('o')\r\n\r\nif h<=e and e<=l1 and l1<=l2 and l2<=o:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "a=list(input())\r\nn=0\r\nh='hello'\r\nfor i in range(len(a)):\r\n if a[i]==h[n]:\r\n n+=1\r\n if n>=5:\r\n break\r\nif n>=5: \r\n print('YES')\r\nelse: \r\n print('NO')", "string = input()\r\ncounter = 0\r\nh,e,l1,l2,o=-1,-1,-1,-1,-1\r\nfor i in range(len(string)) :\r\n if ( string[i] == 'h' and h == -1 ):\r\n h=i\r\n elif (string[i] == 'e' and e == -1 and e<h):\r\n e=i\r\n elif (string[i] == 'l' and l1 == -1 and l1<e):\r\n l1=i\r\n elif (string[i] == 'l' and l1 != -1 and l2==-1 and l2<l1):\r\n l2=i\r\n elif (string[i] == 'o' and o==-1 and o <l2):\r\n o=i\r\n \r\nif(h<e and e<l1 and l1<l2 and l2<o):\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "s=list(input())\r\nlst=['h','e','l','l','o']\r\nc=0\r\nflag=0\r\nfor i in range(len(s)):\r\n if(s[i]==lst[c]):\r\n c+=1\r\n if(c==5):\r\n flag=1\r\n break\r\nif(flag==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = input()\na = int(x.find('h', 0, len(x)))\nb = int(x.find('e', a, len(x)))\nc = int(x.find('l', b, len(x)))\nd = int(x.find('l', c+1, len(x)))\nm = int(x.find('o', d, len(x)))\nif a<b<c<d<m:\n print('YES')\nelse:\n print('NO')\n", "inp = str(input())\r\n\r\nhello_c = ['h','e','l','l','o']\r\nhello_d = []\r\n\r\n\r\nfor i in inp:\r\n\r\n if i == hello_c[0]:\r\n\r\n if i not in hello_d:\r\n hello_d.append(i)\r\n\r\n\r\n elif i == hello_c[1]:\r\n if i not in hello_d and len(hello_d)==1:\r\n hello_d.append(i)\r\n\r\n\r\n elif i == hello_c[2]:\r\n if hello_d.count('l') <=1 and (len(hello_d)==2 or len(hello_d)==3):\r\n hello_d.append(i)\r\n\r\n elif i == hello_c[4] and len(hello_d)==4:\r\n hello_d.append(i)\r\n\r\n else:\r\n continue\r\n\r\n\r\nif ''.join(hello_d) == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n", "x = input()\r\nout = []\r\nstop = 0\r\nfor i in range(len(x)):\r\n if x[i] == 'h':\r\n out.append(x[i])\r\n stop = i\r\n break\r\n\r\nfor i in range(stop+1, len(x)):\r\n if x[i] == 'h':\r\n continue\r\n elif x[i] == 'e':\r\n out.append(x[i])\r\n stop = i\r\n break\r\n\r\nfor i in range(stop+1, len(x)):\r\n if x[i] == 'h' or x[i] == 'e':\r\n continue\r\n elif x[i] == 'l':\r\n out.append(x[i])\r\n stop = i\r\n break\r\n\r\nfor i in range(stop+1, len(x)):\r\n if x[i] == 'l':\r\n out.append(x[i])\r\n stop = i\r\n break\r\n\r\nfor i in range(stop+1, len(x)):\r\n if x[i] == 'h' or x[i] == 'e' or x[i] == 'l':\r\n continue\r\n elif x[i] == 'o':\r\n out.append(x[i])\r\n stop = i\r\n break\r\nH_word = str().join([str(x) for x in out])\r\n\r\nif H_word == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\nif bool(re.search('^[a-z]*[h]+[a-z]*[e]+[a-z]*[l]+[a-z]*[l]+[a-z]*[o]+[a-z]*$',input())):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nres = \"\"\r\nk = 0\r\n\r\nfor i in s:\r\n if i == \"h\" and k == 0:\r\n res += i\r\n k += 1\r\n if i == \"e\" and k == 1:\r\n res += \"e\"\r\n k += 1\r\n if i == \"l\" and k <= 3 and k > 1:\r\n res += \"l\"\r\n k += 1\r\n if i == \"o\" and k == 4:\r\n res += \"o\"\r\n k += 1\r\n\r\nif res == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_hello_possible(word):\n hello = \"hello\"\n j = 0\n\n for letter in word:\n if letter == hello[j]:\n j += 1\n if j == len(hello):\n return True\n\n return False\n\n# Read the input and call the function\ns = input().strip()\nresult = \"YES\" if is_hello_possible(s) else \"NO\"\nprint(result)\n\n\t\t\t\t \t \t\t\t \t\t \t \t\t \t \t", "s = input().lower()\r\n# s1= set(s)\r\ns1 = []\r\ns2 = ['h','e','l','l','o']\r\nj=1\r\nls2= len(s2)\r\nfor i in range(len(s)):\r\n if (j <= ls2):\r\n if (s[i] == s2[j - 1]):\r\n # print(s[i], i, j)\r\n j += 1\r\n else:\r\n break\r\n\r\n\r\nif j-1 == ls2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s=input()\r\nm=\"\"\r\nfor i in s:\r\n if m==\"\":\r\n if i=='h':\r\n m+='h'\r\n elif m==\"h\":\r\n if i==\"e\":\r\n m+='e'\r\n elif m=='he':\r\n if i=='l':\r\n m+='l'\r\n elif m=='hel':\r\n if i=='l':\r\n m+=i\r\n elif m=='hell':\r\n if i=='o':\r\n m+=i\r\nif m=='hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "i = input()\nl = ['h','e','l','l','o']\n# print(i)\n# p = 0\nc = -1\nwhile c<(len(i)-1) and len(l) != 0:\n\tc += 1\n\t# print(i[c])\n\tif i[c] == l[0]:\n\t\tl.pop(0)\n\t\t# print(l)\nif len(l) == 0:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "s = input()\r\nelements_to_get = ['h', 'e', 'l', 'l', 'o']\r\na = list(s)\r\ni = 0\r\nwhile i < len(a):\r\n if a[i] not in elements_to_get:\r\n del a[i]\r\n else:\r\n i += 1\r\ni = 0\r\nwhile i < len(a):\r\n if len(elements_to_get) == 0:\r\n break\r\n if a[i] == elements_to_get[0]:\r\n del elements_to_get[0]\r\n i += 1\r\n\r\nif len(elements_to_get) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\na = \"\"\r\np = \"hello\"\r\nl = 0\r\nfor i in n:\r\n if l <= 4 and i == p[l]:\r\n l += 1\r\n a += i\r\n\r\nif \"hello\" in a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = input()\r\ntargetWord = \"hello\"\r\nindex = 0\r\nresult = \"\"\r\nfor letter in word:\r\n\tif index == 5:\r\n\t\tbreak\r\n\tif letter == targetWord[index]:\r\n\t\tresult += letter\r\n\t\tindex += 1\r\n\r\nif result == \"hello\":\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "\r\ndef f():\r\n s=input()\r\n s2=\"hello\"\r\n j=0\r\n for i in s:\r\n if i==s2[j]:\r\n j+=1\r\n if j>4:\r\n break\r\n # l=list(map(int,input().split()))\r\n if j>4:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n \r\nif __name__ == '__main__':\r\n # for _ in range(int(input())):\r\n f()\r\n", "def check(word,ele,start,end):\r\n val=word.find(ele,start,end)\r\n return val \r\n \r\n \r\nword=input()\r\nn=word\r\nval=check(word,\"h\",0,len(n))\r\nif val!=-1:\r\n start=val+1\r\n val=check(word,\"e\",start,len(n))\r\n if val!=-1:\r\n start=val+1\r\n val=check(word,\"l\",start,len(n))\r\n if val!=-1:\r\n start=val+1\r\n val=check(word,\"l\",start,len(n))\r\n if val!=-1:\r\n start=val+1\r\n val=check(word,\"o\",start,len(n))\r\n if val!=-1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n", "def problemaA ():\n lst_word = [] #lista donde meto cada una de las letras\n lst_og = [] #lista original\n saludo = ['h', 'e', 'l', 'l', 'o']\n counter = 0\n respuesta = 'NO'\n\n cadena = input()\n\n for i in cadena:\n lst_og.append(i)\n counter += 1\n \n for i in range(len(lst_og)):\n if len(saludo) != 0:\n if saludo[0] == lst_og[i]:\n lst_word.append(lst_og[i])\n saludo.remove(lst_og[i])\n\n if len(saludo) == 0:\n respuesta = \"YES\"\n\n\n print(respuesta)\nproblemaA()\n \t\t \t\t \t \t\t \t\t\t\t \t \t \t \t", "if __name__ == '__main__':\r\n current_idx = 0\r\n line = input()\r\n for hello_ch in ('h', 'e', 'l', 'l', 'o'):\r\n for i, ch in enumerate(list(line)[current_idx:]):\r\n if hello_ch == ch:\r\n current_idx += i+1\r\n break\r\n else:\r\n print('NO')\r\n exit(0)\r\n print('YES')", "hello = input()\r\ntrue_hello = 'hello'\r\ncounter = 5\r\ncounter_for_index_input = 0\r\n\r\nfor word in true_hello:\r\n # print(word)\r\n if counter < 0:\r\n break\r\n for j in range(counter_for_index_input,len(hello)):\r\n if counter < 0:\r\n break\r\n # print(j)\r\n if hello[j] == word:\r\n counter -= 1\r\n # print(counter)\r\n counter_for_index_input +=1\r\n break\r\n counter_for_index_input +=1\r\nif counter <= 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "word = input()\n\nhello2 = ['h', 'e', 'l', 'l', 'o']\n\nfor i in word:\n if hello2[0] == i:\n hello2.pop(0) \n if len(hello2) == 0:\n break\n \nif len(hello2) == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t\t\t \t\t \t \t\t\t\t", "s = str(input())\r\nv = \"\"\r\nfor char in s:\r\n if char==\"h\" and char not in v:\r\n v+=\"h\"\r\n elif char==\"e\" and (char not in v) and v==\"h\":\r\n v+=\"e\"\r\n elif char==\"l\" and (v.count(\"l\")<2) and v==\"he\" or v==\"hel\":\r\n v+=\"l\"\r\n elif char==\"o\" and (char not in v) and v==\"hell\":\r\n v+=\"o\"\r\nif v == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\ndef found(s, nach, char):\r\n\tfor i in range (nach, len(s)):\r\n\t\tif(s[i] == char):\r\n\t\t\treturn i\r\n\treturn -1\r\np1 = found(s, 0, \"h\")\r\nif(p1 == -1 or p1 == len(s) - 1):\r\n\tprint(\"NO\")\r\nelse:\r\n\tp2 = found(s, p1 + 1, \"e\")\r\n\tif(p2 == -1 or p2 == len(s) - 1):\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tp3 = found(s, p2 + 1, \"l\")\r\n\t\tif(p3 == -1 or p3 == len(s) - 1):\r\n\t\t\tprint(\"NO\")\r\n\t\telse:\r\n\t\t\tp4 = found(s, p3 + 1, \"l\")\r\n\t\t\tif(p4 == -1 or p4 == len(s) - 1):\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\telse:\r\n\t\t\t\tp5 = found(s, p4 + 1, \"o\")\r\n\t\t\t\tif(p5 == -1):\r\n\t\t\t\t\tprint(\"NO\")\r\n\t\t\t\telse:\r\n\t\t\t\t\tprint(\"YES\")\r\n", "inp = input()\r\nword = 'hello'\r\ni = -1\r\n\r\nfor c in word:\r\n i = inp.find(c, i+1)\r\n if i == -1:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')", "a = input()\r\ncounth = 0\r\ncounte = 0\r\ncountl = 0\r\ncounto = 0\r\nans = \"\"\r\nfor i in range(len(a)):\r\n if a[i] == \"h\" and counth < 1:\r\n ans += a[i]\r\n counth += 1\r\n elif a[i] == \"e\" and counte < 1 and ans.count(\"h\") == 1:\r\n ans += a[i]\r\n counte += 1\r\n elif a[i] == \"l\" and countl < 2 and ans.count(\"e\") == 1:\r\n ans += a[i]\r\n countl += 1\r\n elif a[i] == \"o\" and counto < 1 and ans.count(\"ll\") == 1:\r\n ans += a[i]\r\n counto += 1\r\nif ans.count(\"hello\") != 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "w = input()\nh = w.find('h')\nw = w[h + 1:]\ne = w.find('e')\nw = w[e + 1:]\nl1 = w.find('l')\nw = w[l1 + 1:]\nl2 = w.find('l')\nw = w[l2 + 1:]\no = w.find('o')\nif h >= 0 and e >= 0 and l1 >= 0 and l2 >= 0 and o >= 0:\n print('YES')\nelse:\n print('NO')\n", "n = input()\r\nt = 0\r\ng = 'hello'\r\nfor i in n:\r\n if i==g[t]:\r\n t+=1\r\n if t==5:\r\n break\r\nprint('YES' if t==5 else \"NO\")\r\n", "import sys\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\nimport math \r\nfrom collections import defaultdict,Counter\r\n\r\n\r\ns=rs()\r\nx='hello'\r\ni=0\r\nj=0\r\nflag=0\r\nwhile i<len(s):\r\n if s[i]==x[j]:\r\n i+=1\r\n j+=1\r\n else:\r\n i+=1\r\n if j==len(x):\r\n flag=1\r\n break\r\nws('YES') if flag else ws('NO')\r\n", "s1=input()\r\ns2=\"hello\"\r\nj=0\r\ncount=0\r\nfor i in range(len(s1)):\r\n if s1[i]==s2[j]:\r\n j+=1\r\n count+=1\r\n if j==5:\r\n break\r\n \r\nif count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ns=s.lower()\r\n\r\ndp=[0]*5\r\ndata='hello'\r\ncnt=0\r\nfor c in s:\r\n if c == data[cnt]:\r\n dp[cnt] +=1\r\n cnt +=1\r\n\r\n if cnt == 5:\r\n break\r\nif sum(dp) ==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n", "s=iter(input())\r\nprint(\"NYOE S\" [all(c in s for c in 'hello')::2])", "x='hello'\ns=str(input())\nm=0\nfor i in range(len(s)):\n if (s[i]==x[m]):\n m+=1\n if m==5:\n print(\"YES\")\n break\nif (m!=5):\n print(\"NO\")\n \n", "s = list(input())\r\nword = ['h', 'e', 'l', 'l', 'o']\r\nc = 0\r\nl = len(s)\r\nfor i in range(l):\r\n if s[i] == word[c]:\r\n c += 1\r\n if c == len(word):\r\n print(\"YES\")\r\n exit(0)\r\n else:\r\n continue\r\nprint(\"NO\")", "s = str(input())\r\niH = s.find('h')\r\niE = s.find('e', iH+1, len(s))\r\nil = s.find('l', iE+1, len(s))\r\niL = s.find('l', il+1, len(s))\r\niO = s.find('o', iL+1, len(s))\r\n\r\nif iH < iE and iE < il and il < iL and iL < iO:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nih = s.find('h')\r\nio = s.rfind('o')\r\nfound = False\r\nif ih > -1 and io > -1 and ih < io:\r\n ns = s[ih:io]\r\n ie = ns.find('e')\r\n il = ns.rfind('l')\r\n if ie > -1 and il > -1 and ie < il:\r\n nns = ns[ie:il]\r\n ill = nns.find('l')\r\n if ill > -1:\r\n found = True\r\nif found:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\nword = input()\n\ni = -1\nletters = {'h', 'e', 'l', 'o'}\nstuff = []\nfor letter in word:\n if letter in letters:\n stuff.append(letter)\n\n\ntemplate = \"hello\"\ni = 0\n\nfor letter in stuff:\n if i == len(template):\n break\n\n if letter == template[i]:\n i += 1\n\n\nif i == len(template):\n print('YES')\nelse:\n print('NO')\n\n", "import sys\r\nfrom math import *\r\ninput = sys.stdin.readline\r\n\r\ndef solve(s):\r\n\tt = 'hello'\r\n\tp = 0\r\n\tfor i in range(len(s)):\r\n\t\tif p == 5:\r\n\t\t\tprint(\"YES\")\r\n\t\t\treturn\r\n\t\tif s[i] == t[p]:\r\n\t\t\tp += 1\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\ns = str(input())\r\nsolve(s)", "n= input()\r\na='hello '\r\n\r\ncount=0\r\nfor i in n:\r\n if i==a[count]:\r\n count+=1\r\nif(count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\nchar='hello'\nj=0\nhello=''\nfor i in s:\n\tif i==char[j]:\n\t\thello=hello+i\n\t\tj=j+1\n\tif j==5:\n\t\tbreak\nif hello=='hello':\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t\n", "s = input()\r\nn = len(s)\r\narr = ['h', 'e', 'l', 'l', 'o']\r\nj = 0\r\nfor i in range(n):\r\n if j < 5:\r\n if s[i] == arr[j]:\r\n j += 1\r\nif j == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\n\r\nmy_str = \"\"\r\nhello = \"hello\"\r\nindex = 0\r\n\r\nfor i in s:\r\n if my_str == hello:\r\n break\r\n if i == hello[index]:\r\n my_str += i\r\n index +=1 \r\n \r\nif my_str==hello:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\r\ns = input()\r\ndef check(s):\r\n result = re.search(r\".*h.*e.*l.*l.*o.*\", s)\r\n return result != None\r\nif check(s) == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ni=0\r\nflag = False\r\ns1 = \"hello\"\r\nfor char in s:\r\n if char == s1[i]:\r\n i+=1\r\n if i==len(s1):\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# import re;print(\"YES\"if re.search(\"h.*e.*l.*l.*o\",input())else\"NO\")\r\n# self f** explanatory. One day I'll learn regex\r\n\r\ndd = {i: [] for i in \"helo\"}\r\na = \"\".join(i for i in input() if i in \"helo\")\r\nfor i in range(len(a)):\r\n for j in \"helo\":\r\n if a[i] == j:\r\n dd[j].append(i)\r\ns = 0\r\n\r\n\r\ndef solve():\r\n for h in dd['h']:\r\n for e in dd['e']:\r\n for l in dd['l']:\r\n for ll in dd['l']:\r\n for o in dd['o']:\r\n if h < e < l < ll < o:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n\r\nsolve()\r\n", "s=input()\r\nl=len(s)\r\nz=0\r\nk=0\r\nd=\"hello\"\r\nfor i in range(l):\r\n if s[i]==d[k]:\r\n k+=1\r\n z+=1\r\n if k==5:\r\n break\r\n else:\r\n continue\r\nif z==5:print(\"YES\")\r\nelse:print(\"NO\")", "import re\r\nm=input()\r\nx=re.findall(r'\\w*h\\w*e\\w*l\\w*l\\w*o\\w*',m)\r\nif len(x)>0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\ndef chatroom(s):\r\n og=\"hello\"\r\n r=\"\"\r\n j=0\r\n n=len(s)\r\n for i in s:\r\n if(j<n and j<len(og)and og[j]==i):\r\n r+=i\r\n j+=1\r\n if(r==og):\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chatroom(s))", "def main():\n word = input().lower()\n extra = [\"h\", \"e\", \"l\", \"l\", \"o\"]\n for i in word:\n if len(extra) == 0:\n break\n elif i == extra[0]:\n extra.pop(0)\n print(\"YES\" if len(extra) == 0 else \"NO\")\n\n\nif __name__ == '__main__':\n main()\n", "s = input()\nreference = \"hello\"\ntry:\n index = s.index(reference[0])\n j = 1\n for i in range(index + 1, len(s)):\n if j < len(reference):\n if s[i] == reference[j]:\n j += 1\n if j == len(reference):\n print(\"YES\")\n else:\n print(\"NO\")\nexcept ValueError:\n print(\"NO\")\n", "s=input()\nx=\"hello\"\nk=0\ny=0\nfor i in range(0,len(s)):\n if s[i]==x[k]:\n k+=1\n y+=1\n if y==5:\n break\n else:\n continue\n else:\n continue\nif y==5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t \t \t \t\t\t \t\t \t\t\t\t", "s = input()\r\nss = 'hello'\r\nflag = False\r\nk = 0\r\nfor i in range(len(s)):\r\n if(k<len(ss) and s[i]==ss[k]):\r\n k+=1\r\nif(k==len(ss)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\ns=\"hello\"\r\nj=0\r\nfor i in a:\r\n if i == s[j] and j<6:\r\n j=j+1\r\n if(j==5):\r\n break\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\na=[]\r\nb=[]\r\nc=[]\r\nd=[]\r\nsm=0\r\nlar=0\r\nm=0\r\nx=0\r\ny=0\r\nfor i in range(len(s)):\r\n if(s[i]=='h'):\r\n a.append(i)\r\nfor i in range(len(s)):\r\n if(s[i]=='e'):\r\n b.append(i)\r\n \r\nfor i in range(len(s)):\r\n if(s[i]=='l'):\r\n c.append(i)\r\nfor i in range(len(s)):\r\n if(s[i]=='o'):\r\n d.append(i)\r\n \r\n \r\np=0\r\nq=0\r\nif(1<len(c) and len(a)!=0 and len(b)!=0 and len(d)!=0):\r\n for i in range(len(b)):\r\n if(a[0]<b[i]):\r\n sm=b[i]\r\n m=1\r\n break\r\n if(m==1): \r\n for i in range(len(c)):\r\n if(sm<c[i]):\r\n p+=1\r\n if(p==1):\r\n x=c[i]\r\n if(p==2):\r\n y=c[i]\r\n if(p>2):\r\n break\r\n if(x<d[len(d)-1] and y<d[len(d)-1]):\r\n q+=1\r\n if(0<q and 1<p):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n ", "woord = input()\r\nhello = False\r\n\r\nfor i in range(0, len(woord)):\r\n if woord[i] == \"h\":\r\n for j in range(i+1, len(woord)):\r\n if woord[j] == \"e\":\r\n for k in range(j+1, len(woord)):\r\n if woord[k] == \"l\":\r\n for l in range(k+1, len(woord)):\r\n if woord[l] == \"l\":\r\n for m in range(l+1, len(woord)):\r\n if woord[m] == \"o\":\r\n hello = True\r\n\r\nif hello == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nq = 'hello '\r\nx = 0\r\nfor i in range(len(s)):\r\n if s[i] == q[x]:\r\n x = x + 1\r\nif x > 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\ncom = \"hello\"\r\ncnt = 0\r\n\r\nif len(s) <5:\r\n print(\"NO\")\r\nelse:\r\n \r\n for i in com:\r\n for j in range(len(s)):\r\n if i == s[j]:\r\n s = s[j+1:]\r\n cnt+=1\r\n \r\n break\r\n if cnt==len(com):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "word = input()\r\n\r\nhello = \"hello\"\r\ni = 0\r\nj = 0\r\n\r\nwhile i < len(word) and j < len(hello):\r\n if word[i] == hello[j]:\r\n j += 1\r\n i += 1\r\n\r\nif j == len(hello):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\ns='hello'\ni=0\nfor j in range(len(n)):\n if s[i]==n[j]:\n i+=1\n \n if i==5:\n break\n \n\nif i==5:\n print (\"YES\")\nelse :\n print (\"NO\")\n \n", "y = input()\r\nb= [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nres = 0\r\nfor ltr in y:\r\n if ltr == b[res]:\r\n if res == len(b) - 1:\r\n print(\"YES\")\r\n break\r\n res += 1\r\nelse:\r\n print(\"NO\")", "msg = input().strip()\r\ncount = 0\r\nword = \"hello\"\r\n\r\nfor i in msg:\r\n if word[count] == i:\r\n count+=1\r\n if count==5:\r\n break\r\nif count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\nlst = []\r\nrid = 0\r\nfor x in \"hello\":\r\n lst.append(s.find(x)+rid)\r\n rid += s.find(x)+1\r\n s = s[s.find(x):]\r\n if s.find(x) == -1:\r\n print(\"NO\")\r\n exit()\r\n s = s.replace(x,\"\",1)\r\n \r\nif sorted(lst) == lst:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input().lower()\r\na=s.find('h')\r\nb=s.find('e',a+1)\r\nc=s.find('l',b+1)\r\nd=s.find('l',c+1)\r\ne=s.find('o',d+1)\r\nif a<b and b<c and c<d and d<e:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input().strip()\r\nhello = \"hello\"\r\nhello_ptr = 0\r\nfor letter in s:\r\n if letter == hello[hello_ptr]:\r\n hello_ptr += 1\r\n if hello_ptr == len(hello):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "a=str(input())\r\nlst1=[]\r\nj=1\r\nfor i in a:\r\n lst1.append(i)\r\nlst2=[]\r\nif('h' in lst1):\r\n lst2.append(lst1.index('h'))\r\n i1=lst1.index('h')\r\n lst1=lst1[i1+1:]\r\n if('e' in lst1):\r\n lst2.append(lst1.index('e'))\r\n i2=lst1.index('e')\r\n lst1=lst1[i2+1:]\r\n if('l' in lst1):\r\n lst2.append(lst1.index('l'))\r\n i3=lst1.index('l')\r\n lst1=lst1[i3+1:]\r\n if('l' in lst1):\r\n lst2.append(lst1.index('l'))\r\n i4=lst1.index('l')\r\n lst1=lst1[i4+1:]\r\n if('o' in lst1):\r\n lst2.append(lst1.index('o'))\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nchks = [False] * 5\r\n\r\nfor x in s:\r\n if not chks[0] and x == \"h\":\r\n chks[0] = True\r\n elif not chks[1] and chks[0] and x == \"e\":\r\n chks[1] = True\r\n elif not chks[2] and chks[1] and x == \"l\":\r\n chks[2] = True\r\n elif not chks[3] and chks[2] and x == \"l\":\r\n chks[3] = True\r\n elif not chks[4] and chks[3] and x == \"o\":\r\n chks[4] = True\r\n\r\nif all(chks):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "stringToFind = \"hello\"\n \ndef chatRoom():\n x = 0\n string = input()\n for i in range(len(string)):\n if string[i] == stringToFind[x]:\n x += 1\n if x == 5:\n return \"YES\"\n return \"NO\"\nprint(chatRoom())", "word = input()\r\nfor chr in range(len(word)):\r\n if word[chr] == 'h':\r\n for i in range(chr + 1, len(word)):\r\n if word[i] == 'e':\r\n for j in range(i + 1, len(word)):\r\n if word[j] == 'l':\r\n for k in range(j + 1, len(word)):\r\n if word[k] == 'l':\r\n for m in range(k + 1, len(word)):\r\n if word[m] == 'o':\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "a = input()\nans = 'NO'\nl = ['h', 'e', 'l', 'l', 'o']\nid = 0\nfor i in range(0, len(a)):\n if a[i] == l[id]:\n id+=1\n if id == 5:\n ans='YES'\n break\n\nprint(ans)", "import sys\r\ninput=sys.stdin.readline\r\nn=list(input())\r\ndata='hello'\r\ncheck=0\r\nindex=0\r\nfor i in n:\r\n if i==data[index]:\r\n index+=1\r\n check+=1\r\n if check==5:\r\n break\r\n\r\nif check==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ni=0\r\ncount=0\r\nwhile(i<len(s)):\r\n if(s[i]==\"h\"):\r\n count+=1\r\n break\r\n else:\r\n i+=1\r\nj=i+1\r\nwhile(j<len(s)):\r\n if(s[j]==\"e\"):\r\n count+=1\r\n break\r\n else:\r\n j+=1\r\ni=j+1\r\nwhile(i<len(s)):\r\n if(s[i]==\"l\"):\r\n count+=1\r\n break\r\n else:\r\n i+=1\r\nj=i+1\r\nwhile(j<len(s)):\r\n if(s[j]==\"l\"):\r\n count+=1\r\n break\r\n else:\r\n j+=1\r\ni=j+1\r\nwhile(i<len(s)):\r\n if(s[i]==\"o\"):\r\n count+=1\r\n break\r\n else:\r\n i+=1\r\nif(count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "f = input()\nres = ''\ni = 0\nwhile res != 'hello' and i < len(f):\n if len(res) == 0 and f[i] == 'h':\n res += 'h'\n i += 1\n elif len(res) == 1 and f[i] == 'e':\n res += 'e'\n i += 1\n elif len(res) == 2 and f[i] == 'l':\n res += 'l'\n i += 1\n elif len(res) == 3 and f[i] == 'l':\n res += 'l'\n i += 1\n elif len(res) == 4 and f[i] == 'o':\n res += 'o'\n i += 1\n else:\n i += 1\nif 'hello' == res:\n print('YES')\nelse:\n print('NO')\n", "s = input()\r\nx = \"hello\"\r\nj = 0\r\ncount = 0\r\nfor i in range(len(s)):\r\n if j < 5:\r\n\r\n if s[i] == x[j] :\r\n count += 1\r\n j += 1\r\nif j == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\nlst_1 = []\r\nlst_2 = ['h','e','l','l','o']\r\nc = 2\r\n\r\nfor i in n:\r\n if (i == 'h') and (len(lst_1) == 0):\r\n lst_1.append(i)\r\n elif (i == 'e') and (len(lst_1) == 1):\r\n lst_1.append(i)\r\n elif (i == 'l') and (len(lst_1) == c):\r\n c = 3\r\n lst_1.append(i)\r\n elif (i == 'l') and (len(lst_1) == c):\r\n lst_1.append(i)\r\n elif (i == 'o') and (len(lst_1) == 4):\r\n lst_1.append(i)\r\n \r\nif(lst_1 == lst_2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\n\nword = sys.stdin.readline().strip()\n\nletters = list('hello')\nresult = 0\n\nfor letter in word:\n if letter == letters[result]:\n result += 1\n if result == 5:\n print('YES')\n exit()\n\nprint('NO')\n", "a=input()\r\ncount=0\r\nfor i in a:\r\n if(count==0):\r\n if(i==\"h\"):\r\n count+=1\r\n elif(count==1):\r\n if(i==\"e\"):\r\n count+=1\r\n elif(count==2):\r\n if(i==\"l\"):\r\n count+=1\r\n elif(count==3):\r\n if(i==\"l\"):\r\n count+=1\r\n elif(count==4):\r\n if(i==\"o\"):\r\n count+=1\r\nif(count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n ", "word = input()\r\ncon = 0\r\nfor letter in word :\r\n if letter == 'h' and con == 0:\r\n con += 1\r\n elif letter == 'e' and con == 1:\r\n con += 1\r\n elif letter == 'l' and (con == 2 or con == 3) :\r\n con += 1\r\n elif letter == 'o' and con ==4 :\r\n con += 1\r\n\r\nif con == 5:\r\n print('YES')\r\nelse :\r\n print('NO')", "a=[x for x in input()]\r\nx=0\r\nfor i in range(len(a)):\r\n\tif x==0 and a[i]=='h':x+=1\r\n\telif x==1 and a[i]=='e':x+=1\r\n\telif x==2 and a[i]=='l':x+=1\r\n\telif x==3 and a[i]=='l':x+=1\r\n\telif x==4 and a[i]=='o':x+=1\r\nif x==5:print('YES')\r\nelse:print('NO')", "import re\r\nx = input()\r\ny = re.findall(\".*h.*e.*l.*l.*o.*\",x)\r\n\r\nif len(y) == 1:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "word = input().strip()\n\nd = {'h': [], 'e': [], 'l': [], 'o': []}\nfor l in range(len(word)):\n if word[l] in list(d.keys()):\n d[word[l]].append(l)\n\nhello = 'hello'\n\ncount = 0\nlast = -1\n\nfor l in range(5):\n if len(d[hello[l]])==0:\n break\n else:\n found = False\n for k in range(len(d[hello[l]])):\n if d[hello[l]][k]>last:\n last = d[hello[l]][k]\n found = True\n break\n\n if found:\n count = count + 1\n\n d[hello[l]] = d[hello[l]][k+1:]\n\n\nif count == 5:\n print('YES')\nelse:\n print('NO')", "c = \"hello\"\r\nstring = input()\r\ncheck = 0\r\nfor i in string:\r\n if i == c[check]:\r\n check+=1\r\n if check == 5:\r\n print('YES')\r\n exit()\r\nprint('NO')", "h = \"hello\"\ns = input()\nf = False \nfor i in range(len(s)) : \n if s[i] == h[0]:\n if len(h) == 1 :\n f = True\n break\n h = h[1:]\nif f :\n print(\"YES\")\nelse:\n print(\"NO\")", "r='hello'\r\nx=0\r\nc=0\r\ns=input()\r\nfor i in range(0,len(s)):\r\n if(s[i]==r[x]):\r\n x=x+1\r\n if x==5:\r\n print(\"YES\")\r\n c+=1\r\n break\r\nif c==0:\r\n print(\"NO\")\r\n", "string = input()\r\ndict_ = {0: 'h', 1: 'e', 2: 'l', 3: 'l', 4: 'o'}\r\nindex = 0\r\nfor s in string:\r\n if dict_[index] == s:\r\n index += 1\r\n if index == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "a = input()\ncnt = \"\"\nx = 0\nfor i in range(len(a)):\n\tif x == 0:\n\t\tif a[i] == \"h\":\n\t\t\tcnt += a[i] \n\t\t\tx += 1\n\telif x == 1:\n\t\tif a[i] == \"e\":\n\t\t\tcnt += a[i]\n\t\t\tx += 1\n\telif x == 2:\n\t\tif a[i] == \"l\":\n\t\t\tcnt += a[i]\n\t\t\tx += 1\n\telif x == 3:\n\t\tif a[i] == \"l\":\n\t\t\tcnt += a[i]\n\t\t\tx += 1\n\telif x == 4:\n\t\tif a[i] == \"o\":\n\t\t\tcnt += a[i]\n\t\t\tx += 1\nif cnt == \"hello\":\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "a=\"hello\"\r\nd=0\r\nf=0\r\nb=input(\"\")\r\nfor i in range(0,len(b)):\r\n if b[i]==a[d]:\r\n d=d+1\r\n if d==5:\r\n f=1\r\n break\r\nif f==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s=input()\r\nst=list(s)\r\nhi=0\r\nei=0\r\nli1=0\r\nli2=0\r\noi=0\r\nk=0\r\nwhile True:\r\n if \"h\" in st:\r\n hi=st.index(\"h\")\r\n while \"e\" in st:\r\n if st.index('e')<hi:\r\n st.remove(\"e\")\r\n else:\r\n ei=st.index('e')\r\n break\r\n if ei==0:\r\n break\r\n while \"l\" in st:\r\n if st.index('l')<ei:\r\n st.remove(\"l\")\r\n else:\r\n li1=st.index('l')\r\n break\r\n if li1==0:\r\n break\r\n st[li1]=\"f\"\r\n if \"l\" in st:\r\n li2=st.index('l')\r\n if li2==0:\r\n break\r\n while \"o\" in st:\r\n if st.index('o')<li2:\r\n st.remove(\"o\")\r\n else:\r\n oi=st.index('o')\r\n break\r\n if oi==0:\r\n break\r\n print(\"YES\")\r\n k+=1\r\n break\r\nif k==0:\r\n print(\"NO\")\r\n", "def translate(str):\r\n hello = \"hello\"\r\n index = 0\r\n for check in range(0, len(str)):\r\n if index == 5:\r\n return \"YES\"\r\n if str[check] == hello[index]:\r\n index += 1\r\n\r\n if index < 5:\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\n\r\ninput = input()\r\nprint(translate(input))", "from sys import stdin\r\n\r\nt = stdin.readline().strip()\r\n\r\ni, j, k, l, m = 0, 0, 0, 0, 0\r\nn = len(t)\r\nwhile i < n and t[i] != 'h':\r\n i += 1\r\nif i >= n:\r\n print('NO')\r\n exit(0)\r\n\r\nj = i + 1\r\nwhile j < n and t[j] != 'e':\r\n j += 1\r\nif j >= n:\r\n print('NO')\r\n exit(0)\r\n\r\nk = j + 1\r\nwhile k < n and t[k] != 'l':\r\n k += 1\r\nif k >= n:\r\n print('NO')\r\n exit(0)\r\n\r\nl = k + 1\r\nwhile l < n and t[l] != 'l':\r\n l += 1\r\nif l >= n:\r\n print('NO')\r\n exit(0)\r\n\r\nm = l + 1\r\nwhile m < n and t[m] != 'o':\r\n m += 1\r\nif m >= n:\r\n print('NO')\r\n exit(0)\r\n\r\nprint('YES')\r\n", "a=list(input())\r\nx=['h','e','l','l','o']\r\nn=len(x)\r\nk=0\r\nfor j in a :\r\n if k!=n and str(j)==x[k]:\r\n k+=1\r\n if k==n:\r\n break\r\nif k<n:\r\n print('NO')\r\nelse:\r\n print('YES')", "s = input()\r\ntarget = 'hello'\r\ni = 0\r\nj = 0\r\nwhile i < 5 and j < len(s) :\r\n\tif s[j] == target[i]:\r\n\t#\tprint(i,target[i])\r\n\t\tj+=1\r\n\t\ti += 1\r\n\r\n\telse:\r\n\t\tj+=1\r\nif i==5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "h = 'hello'\r\nc = 0\r\nfor _ in input():\r\n if _ == h[c]:\r\n c = c + 1\r\n if c == 5:\r\n break\r\n\r\nif c == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "word = input()\n\nhello = \"hello\"\na = 0\n\nfor i in word:\n if a == len(hello):\n break\n elif i == hello[a]:\n a += 1\n\nif a == len(hello):\n print(\"YES\")\nelse:\n print(\"NO\")", "stri=input()\nword=\"hello\"\nk=0\nfor i in range(len(stri)):\n if k!=5 and stri[i]==word[k]:\n k+=1\n\nif k==5:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "w = str(input().strip())\r\ndst = \"hello\"\r\ni = 0\r\nfor c in w:\r\n if dst[i]==c:\r\n i+=1\r\n if i>=5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s=input()\r\nc=0\r\nx=0\r\nfor i in range(0,len(s)):\r\n if(s[i]==\"h\"):\r\n c+=1\r\n x=i\r\n break\r\nfor i in range(x+1,len(s)):\r\n if(s[i]==\"e\"):\r\n c+=1\r\n x=i\r\n break\r\nfor i in range(x+1,len(s)):\r\n if(s[i]==\"l\"):\r\n c+=1\r\n x=i\r\n break\r\nfor i in range(x+1,len(s)):\r\n if(s[i]==\"l\"):\r\n c+=1\r\n x=i\r\n break\r\n\r\nfor i in range(x+1,len(s)):\r\n if(s[i]==\"o\"):\r\n c+=1\r\n x=i\r\n break\r\nif(c==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n = input()\r\nsomeInd = 0\r\nh = \"hello\"\r\nfor i in n:\r\n if i == h[someInd]:\r\n someInd +=1\r\n if someInd == 5:\r\n break\r\n\r\n\r\nprint(\"YES\" if someInd==5 else \"NO\")", "s = input()\r\nanswer = \"\"\r\nhello = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nfor i in range(len(s)):\r\n if s[i] == hello[0]:\r\n del hello[0]\r\n if len(hello) == 0:\r\n answer += \"YES\"\r\n break\r\nif answer != \"YES\":\r\n print(\"NO\")\r\nelse:\r\n print(answer)\r\n", "s = input()\nl = 0\nfor letter in s:\n if letter == 'h' and l ==0:\n l = l+1\n elif letter == 'e' and l ==1:\n l = l+1 \n elif letter =='l' and l == 2:\n l = l+1\n elif letter =='l' and l == 3:\n l = l+1 \n elif letter == 'o' and l == 4:\n l = l+ 1 \n if l == 5:\n break\nif l == 5:\n print(\"YES\")\nelse:\n print(\"NO\")", "def solution():\r\n s, ans, i = input(), \"hello\", 0\r\n for j in range(len(s)):\r\n if ans[i] == s[j]:\r\n i += 1\r\n if i == 5:\r\n return True\r\n return False\r\n\r\nif (solution()):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = input()\nnew_word=''\nlength_word = len(word)\nlower_val = 0\nfor i in 'hello':\n\n\tif(lower_val< length_word):\n\t\twhile(lower_val<length_word):\n\n\t\t\tif (i == word[lower_val]):\n\t\t\t\tlower_val += 1\n\t\t\t\tnew_word += i\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tlower_val += 1\n\t\t\t\tpass\n\telse:\n\t\tbreak\n\nif new_word == 'hello':\n\tprint('YES')\nelse:\n\tprint('NO')", "import re\r\n\r\nif re.match(\".*h.*e.*l.*l.*o.*\", input()) is not None:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str = input();\r\n\r\n# init Indexes\r\nhindex = -1;\r\neindex = -1;\r\nlindex = -1;\r\nllindex = -1;\r\noindex = -1;\r\n\r\nerror = False;\r\n# H Section\r\ntry:\r\n hindex = str.index(\"h\")\r\nexcept:\r\n error = True\r\n print(\"NO\")\r\n\r\n# E Section\r\nif not error:\r\n\r\n try:\r\n str = str[hindex + 1:]\r\n eindex = str.index(\"e\")\r\n except:\r\n error = True\r\n print(\"NO\")\r\n\r\n# l Section\r\nif not error:\r\n\r\n try:\r\n str = str[eindex + 1:]\r\n lindex = str.index(\"l\")\r\n except:\r\n error = True\r\n print(\"NO\")\r\n# Second L Index\r\nif not error:\r\n\r\n try:\r\n str = str[lindex + 1:]\r\n llindex = str.index(\"l\")\r\n except:\r\n error = True\r\n print(\"NO\")\r\n\r\n# O Index\r\nif not error:\r\n\r\n try:\r\n str = str[llindex + 1:]\r\n oindex = str.index(\"o\")\r\n except:\r\n error = True\r\n print(\"NO\")\r\n\r\nif not error:\r\n print (\"YES\")", "s=input()\nc=\"hello\"\na=0\nfor i in range(len(s)):\n if s[i]==c[a]:\n a+=1\n if a==5:\n \tprint(\"YES\")\n \tbreak\n else:\n continue\nif a<5:\n\tprint(\"NO\")\n\n", "word = input()\r\nh = 'hello'\r\n\r\nin_word = {}\r\ni_st = 0\r\nfor c in word:\r\n if i_st >= len(h):\r\n break\r\n if h[i_st] == c:\r\n i_st += 1\r\n in_word[c] = 1 + in_word.get(c, 0)\r\n\r\nif len(in_word) == len(h) - 1 and in_word['l'] >= 2:\r\n print('YES')\r\nelse:\r\n print('NO') ", "import sys\r\nword = str(sys.stdin.readline())\r\nword = list(word)\r\n\r\ndef solution(word):\r\n y = 0\r\n check = \"hello\"\r\n right_hello = []\r\n for i in check:\r\n word=word[y:]\r\n for y,j in enumerate(word):\r\n if i == j:\r\n y+=1\r\n right_hello.append(j)\r\n if len(right_hello) == 5:\r\n print(\"YES\")\r\n break\r\n elif j == \"\\n\":\r\n return print(\"NO\")\r\n \r\n \r\n \r\nsolution(word)\r\n", "s = input()\r\ncrct = \"hello\"\r\npos , flag = 0 , 0\r\nfor i in s:\r\n if i == crct[pos]:\r\n pos += 1\r\n if pos == 5:\r\n flag = 1\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nword=\"hello\"\r\nt=0\r\n\r\nfor i in s:\r\n if t<len(word) and i==word[t]:\r\n t+=1\r\nif t==len(word):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def str(s):\r\n w='hello'\r\n ind=0\r\n for i in range(len(s)):\r\n if ind==5:\r\n return 'YES'\r\n if s[i]==w[ind]:\r\n ind+=1\r\n if ind<5:\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\ns=input()\r\nprint(str(s))", "s = input()\r\nc=['h', 'e', 'l', 'l', 'o']\r\nt = True\r\nfor i in range(5):\r\n k = s.find(c[i])\r\n if k == -1:\r\n t = False\r\n s = s[k+1:]\r\nif t == True:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = input()\r\nl = ['h', 'e', 'l', 'l', 'o']\r\nj = 0\r\nfor i in n:\r\n if j == 5:\r\n break\r\n if i == l[j]:\r\n j += 1\r\n \r\nif j == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "s = input()\r\nbase = 0\r\nfound = True\r\n\r\nfor c in 'hello':\r\n try:\r\n base = s.index(c, base) + 1\r\n except ValueError:\r\n found = False\r\n\r\nif found:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "t=0\r\nx = input()\r\nfor i in range(len(x)):\r\n if(x[i]=='h'):\r\n for j in range(i+1,len(x)):\r\n if(x[j]=='e'):\r\n for k in range(j+1,len(x)):\r\n if(x[k]=='l'):\r\n for l in range(k+1,len(x)):\r\n if(x[l]=='l'):\r\n for m in range(l+1,len(x)):\r\n if(x[m]=='o'):\r\n t=1\r\n break\r\nif(t==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s=input()\r\na=''\r\nb=[]\r\nfor i in range(len(s)):\r\n if s[i] in 'hello':\r\n a=a+s[i]\r\ntry:\r\n b.append(a.index('h'))\r\n b.append(a.index('e',b[0]+1))\r\n b.append(a.index('l',b[1]+1))\r\n b.append(a.index('l',b[2]+1))\r\n b.append(a.index('o',b[3]+1))\r\n print('YES')\r\nexcept:\r\n print('NO')\r\n \r\n ", "import re\r\ns=input()\r\nregex='.*h.*e.*l.*l.*o.*'\r\nif re.search(regex,s):\r\n print('YES')\r\nelse:\r\n print('NO')", "l = [\"h\",'e', 'l','l','o', '1']\r\ns = input()\r\ni = 0\r\nfor it in s:\r\n if it == l[i]:\r\n i+=1\r\nprint(\"YES\") if i == 5 else print(\"NO\")", "hello = input(\"\")\nscore = 0\nif(\"h\" in hello):\n hello = hello[hello.find(\"h\")+1:]\n score+=1\nif(\"e\" in hello):\n hello = hello[hello.find(\"e\")+1:]\n score+=1\nif(\"l\" in hello):\n hello = hello[hello.find(\"l\")+1:]\n score+=1\nif(\"l\" in hello):\n score+=1\n hello = hello[hello.find(\"l\")+1:]\nif(\"o\" in hello):\n score +=1\n hello = hello[hello.find(\"o\")+1:]\nif(score == 5):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def say_hello(s):\r\n k = 'hello'\r\n a = ''\r\n i = 0\r\n for ch in s:\r\n if ch == k[i]:\r\n a += ch\r\n i += 1\r\n if a == k:\r\n return (\"YES\")\r\n return (\"NO\")\r\n \r\ns = str(input())\r\nprint(say_hello(s))\r\n", "w = input()\r\nexpected = 'hello'\r\nfor c in w:\r\n if expected[0] == c:\r\n expected = expected[1:]\r\n \r\n if len(expected) == 0:\r\n print('YES')\r\n exit(0)\r\n \r\n \r\nprint('NO')", "n,c,j=input(),0,\"hello\"\nfor i in range(len(n)):\n if n[i]==j[c]:\n c+=1\n if c==5:\n print(\"YES\")\n break\n if i==len(n)-1 and c!=5: print(\"NO\")\n\t \t \t\t\t\t\t \t\t \t \t \t \t \t\t", "s = input()\r\nl1 = s.find('h') + 1\r\nl2 = s.find('e', l1) + 1\r\nl3 = s.find('l', l2) + 1\r\nl4 = s.find('l', l3) + 1\r\nl5 = s.find('o', l4) + 1\r\nif l1*l2*l3*l4*l5 != 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "ch=input()\r\nc='hello'\r\ni,j=0,0\r\nwhile i<len(c) and j<len(ch):\r\n if c[i]==ch[j]:\r\n i+=1\r\n j+=1\r\nif i<len(c):\r\n print('NO')\r\nelse:\r\n print('YES')", "s=input()\r\nh=s.find(\"h\")\r\n\r\ne=s.find(\"e\",h)\r\n\r\nl=s.find(\"l\",e)\r\n\r\nl1=s.find(\"l\",l+1)\r\n\r\no=s.find(\"o\",l1)\r\n\r\n\r\nif(h<e<l<l1<o):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\ncomp=list(\"hello\")\r\nj=0\r\nfor i in range(len(a)):\r\n if(a[i]==comp[j]):\r\n j+=1\r\n if(j==5):\r\n break\r\nif(j==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = \"hello\"\r\ns2 = input()\r\ns2 = s2.lower()\r\ni = 0\r\nfor j in range(len(s2)):\r\n if i>=len(s):\r\n break\r\n if s2[j] == s[i]:\r\n i+=1\r\nif i!=len(s):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s = input()\r\nhello = \"hello\"\r\ns = s.lower()\r\ni = 0\r\nfor l in s:\r\n if i == 5:\r\n break\r\n if l == hello[i]:\r\n i += 1\r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l = [\"h\",\"e\",\"l\",\"l\",\"o\"]\nc = 0\nw = input()\nfor i in w:\n if c < 5:\n if i == l[c]:\n c += 1\nif c == 5:\n print(\"YES\")\nelse:\n print(\"NO\")", "s = input()\r\nf = \"hello\"\r\na = 0\r\n\r\nfor i in range(len(s)):\r\n\tif s[i] == f[a]:\r\n\t\ta += 1\r\n\t\tif(a == 5):\r\n\t\t\tprint(\"YES\")\r\n\t\t\texit(0)\r\nprint(\"NO\")", "s = input()\r\ntarget = 'hello'\r\nresult = list()\r\ni = 0\r\nfor word in s:\r\n if i == 5:\r\n break\r\n if word == target[i]:\r\n result.append(1)\r\n i += 1\r\nif len(result) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\ntemp = 0\r\nh = []\r\ne = []\r\nl = []\r\no = []\r\nfor i, char in enumerate(s):\r\n if char == 'h':\r\n h.append(i)\r\n elif char == 'e':\r\n e.append(i)\r\n elif char == 'l':\r\n l.append(i)\r\n elif char == 'o':\r\n o.append(i)\r\nfor i in h:\r\n for j in e:\r\n for k in l:\r\n for m in l:\r\n for n in o:\r\n if i < j < k < m < n:\r\n temp = 1\r\n break\r\n if temp == 1:\r\n break\r\n if temp == 1:\r\n break\r\n if temp == 1:\r\n break\r\n if temp == 1:\r\n break\r\nif temp == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 13 14:27:53 2023\r\n\r\n@author: 15110\r\n\"\"\"\r\n\r\ns=input()\r\nx=0\r\nh=len(s)-2\r\ne=len(s)-2\r\nl=len(s)-2\r\nll=len(s)-2\r\no=len(s)-2\r\nfor i in range(0,len(s)):\r\n if s[i] == 'h':\r\n h=i\r\n x+=1\r\n break\r\nfor i in range(h+1,len(s)):\r\n if s[i] == 'e':\r\n e=i\r\n x+=1\r\n break\r\nfor i in range(e+1,len(s)):\r\n if s[i] == 'l':\r\n l=i\r\n x+=1\r\n break\r\nfor i in range(l+1,len(s)):\r\n if s[i] == 'l':\r\n ll=i\r\n x+=1\r\n break\r\nfor i in range(ll+1,len(s)):\r\n if s[i] == 'o':\r\n x+=1\r\n break\r\nif x == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\r\n\r\ns = input()\r\n\r\nprint('YES' if re.match(r'^.*h.*e.*l.*l.*o.*$', s) else 'NO')", "word=input()\r\nword=list(word)\r\nhello=[\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nwordlen=0\r\nerr=0\r\nfor i in range(5):\r\n let=hello[i]\r\n for j in range(len(word)):\r\n if let==word[j]:\r\n wordlen+=1\r\n word[j]=0\r\n break\r\n else:\r\n err+=1\r\n word[j]=0\r\nif wordlen==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\na='hello'\r\nx=0\r\ny=0\r\nfor i in range(len(n)):\r\n if n[i]==a[x]:\r\n x+=1\r\n y+=1\r\n if y==5:\r\n break\r\nif y==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nif 'h' in s:\r\n pos=s.find('h')\r\n s=s[pos+1:]\r\n if 'e' in s:\r\n pos=s.find('e')\r\n s=s[pos+1:]\r\n if 'l' in s:\r\n pos=s.find('l')\r\n s=s[pos+1:]\r\n if 'l' in s:\r\n pos = s.find('l')\r\n s = s[pos + 1:]\r\n if 'o' in s:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\ncheck = False\r\nscore = 0\r\nfor i in s:\r\n if i not in 'hello':\r\n s = s.replace(i,\"\")\r\nfor i in s:\r\n if \"h\" in s:\r\n if i == \"h\":\r\n a , b = s.split(i,1)\r\n s = b.replace(\"h\", \"\")\r\n score += 1\r\n if \"e\" in s:\r\n a , b = s.split(\"e\",1)\r\n s = b.replace(\"e\", \"\")\r\n score += 1\r\n if \"l\" in s:\r\n a , b = s.split(\"l\",1)\r\n s = b\r\n if \"l\" in s:\r\n a , b = s.split(\"l\",1)\r\n s = b.replace(\"l\", \"\")\r\n score += 1 \r\n if \"o\" in s:\r\n score += 1\r\n break\r\n\r\n\r\n\r\nif score == 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "s = input()\na = 'hello'\ni = 0\nfor x in s:\n if x == a[i]:\n i += 1\n if i == 5:\n break\nif i == 5:\n print('YES')\nelse:\n print('NO')\n", "s=input()\r\nh=0\r\ne=0\r\nl=0\r\no=0\r\nfor i in s:\r\n if i=='h':\r\n h=1\r\n elif i=='e' and h==1:\r\n e=1\r\n elif i=='l' and e==1:\r\n l+=1\r\n elif l>=2 and i=='o':\r\n o=1\r\n if h==e==o==1 and l>=2:\r\n print(\"YES\")\r\n break\r\nif h!=1 or e!=1 or o!=1 or l<2:\r\n print(\"NO\")\r\n", "#徐子韵 2200015467 经济学院\r\nsting=input()\r\nif 'h' in sting:\r\n a=sting.index('h')\r\n if 'e' in sting[a+1:] and a!=len(sting)-1:\r\n a=sting.index('e',a+1)\r\n if 'l' in sting[a+1:] and a!=len(sting)-1:\r\n a = sting.index('l', a + 1)\r\n if 'l' in sting[a+1:] and a != len(sting) - 1:\r\n a = sting.index('l', a + 1)\r\n if 'o' in sting[a:]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "s=input();\r\ns1=\"hello\"\r\nit=0\r\nfor i in range(len(s)):\r\n if it < len(s1) and s[i]==s1[it]:\r\n it=it+1\r\n\r\nif(len(s1)==it):\r\n print(\"YES\")\r\n\r\nelse:print(\"NO\")", "mess = input()\r\nmessed = \"hello\"\r\ncount = 0\r\n\r\nfor i in range(len(mess)):\r\n if (mess[i] == messed[count]):\r\n count += 1\r\n if count == 5:\r\n break\r\n \r\nif(count >= 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\ngreet = 'hello'\r\nk = 0\r\n\r\nfor ch in input():\r\n if ch == greet[k]:\r\n k += 1\r\n if k == 5:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "#BISMILLAH\r\n\r\ns = input()\r\ndef ff(s,c):\r\n if s is None: return None\r\n r = s.find(c)\r\n if r<0: return None\r\n else: return s[r+1:]\r\n \r\nfor c in 'hello': s = ff(s,c)\r\nif s is None: print('NO')\r\nelse: print('YES')\r\n \r\n#ALHAMDULILLAH", "str = \"hello\"\r\n \r\ndef chat():\r\n j = 0\r\n s = input()\r\n for i in range(len(s)):\r\n if s[i] == str[j]:\r\n j += 1\r\n if j == 5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chat())", "import re\r\nline = input()\r\nif re.match('.*?h.*?e.*?l.*?l.*?o', line):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nlength=len(s)\r\nf1=f2=f3=f4=f5=False\r\ni=0\r\nwhile f1==False and i<length:\r\n if s[i]=='h':\r\n f1=True\r\n i+=1\r\nwhile f2==False and i<length:\r\n if s[i]=='e':\r\n f2=True\r\n i+=1\r\nwhile f3==False and i<length:\r\n if s[i]=='l':\r\n f3=True\r\n i+=1\r\nwhile f4==False and i<length:\r\n if s[i]=='l':\r\n f4=True\r\n i+=1\r\nwhile f5==False and i<length:\r\n if s[i]=='o':\r\n f5=True\r\n i+=1\r\nif f1 and f2 and f3 and f4 and f5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nif \"h\" in a:\r\n h=a.index(\"h\")\r\n a=a[(h+1):]\r\n if \"e\" in a:\r\n e=a.index(\"e\")\r\n a=a[(e+1):]\r\n if \"l\" in a:\r\n l=a.index(\"l\")\r\n a=a[(l+1):]\r\n if \"l\" in a:\r\n l=a.index(\"l\")\r\n a=a[(l+1):]\r\n if \"o\" in a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\ns_i = input()\r\ns= s_i.lower()\r\n\r\n\r\ndef search(string,letter,start):\r\n i = start\r\n found = False\r\n while i<len(s) and found == False:\r\n found = (s[i] == letter)\r\n i+=1\r\n return found,i\r\n\r\ndetected = False\r\n\r\n\r\n\r\n#index =search(s,'o',search(s,'l',search(s,'l',search(s,'e',search(s,'h',0)))))\r\n\r\n\r\nh = 'hello'\r\ni=1\r\nfound,index = search(s,'h',0)\r\nwhile i < 5 and found == True:\r\n found,index = search(s,h[i],index)\r\n i+=1\r\n\r\nif found :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input();i=0;l=[]\r\nfor j in ['h', 'e', 'l', 'l', 'o']:\r\n while i < len(a):\r\n if a[i] == j:i += 1;l.append(j);break\r\n i += 1\r\nprint(['YES','NO'][l != ['h','e','l','l','o']])", "s = input()\n\nf = True\nA = ['h', 'e', 'l', 'l', 'o']\ni = 0\nwhile i < 5:\n x = s.find(A[i])\n if x == -1:\n f = False\n break\n else:\n s = s[x+1:]\n i+= 1\nprint(\"YES\" if f else \"NO\")\n\n", "q=input().strip()\r\ns=\"hello\"\r\ni=0\r\nj=0\r\nwhile i<len(s):\r\n x=s[i]\r\n found=False\r\n while j<len(q):\r\n if q[j]==x:\r\n found=True\r\n break\r\n j=j+1\r\n if found==True:\r\n i=i+1\r\n j=j+1\r\n else:\r\n break\r\nif i==len(s):\r\n print('YES')\r\nelse:\r\n print('NO')", "m=input()\r\ncount=0\r\nfor i in range(len(m)):\r\n\tif m[i]=='h' and count==0:\r\n\t\tcount+=1\r\n\tif m[i]=='e' and count==1:\r\n\t\tcount+=1\r\n\tif m[i]=='l' and (count==2 or count==3):\r\n\t\tcount+=1\r\n\tif m[i]=='o' and count==4:\r\n\t\tcount+=1\r\n\t\tbreak\r\nif count==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def finds(s):\r\n stf = \"hello\"\r\n cnt = 0\r\n for i in range(len(s)):\r\n if s[i] == stf[cnt]:\r\n cnt+=1\r\n if cnt == 5:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\ns = input()\r\nprint(finds(s))", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\ns = input()\nans = 'YES'\nfor c in list('hello'):\n if s.count(c) == 0:\n ans = 'NO'\n else:\n s = s[s.index(c) + 1:]\nprint(ans)\n", "m=\"hello\"\r\nx=0\r\nn=input()\r\nfor i in range(len(n)):\r\n if n[i] == m[x]:\r\n x += 1\r\n if x==5:\r\n break\r\nif x==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nfrom collections import Counter\r\nfrom math import *\r\nfrom sys import *\r\nimport re\r\n\r\ndef iii():\r\n return [int(iii) for iii in input().split()]\r\ndef fff():\r\n return [float(fff) for fff in input.split()]\r\n\r\ndef ii():\r\n return int(input())\r\ndef ff():\r\n return int(input())\r\n\r\ndef count(l):\r\n return dict(Counter(l))\r\n\r\n\r\ndef S1(n):\r\n return n*(n+1)//2\r\n\r\n\r\ndef S3(n):\r\n return pow(S1(n), 2)\r\n\r\nr = '.*?'.join(['h', 'e', 'l', 'l', 'o'])\r\nr = '.*' + r + '.*'\r\ns = input()\r\nif re.match(re.compile(r),s) is not None:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\r\nprint(\"YES\" if re.search(r'h.*e.*l.*l.*o', input())else\"NO\")", "s = input()\r\nl = len(s)\r\nj, m, n = 0, 0, 0\r\np = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nwhile m < l and j < 5:\r\n if s[m] == p[j]:\r\n n += 1\r\n j += 1\r\n m += 1\r\nif n == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "v = input()\ns = [0 for x in range(4)]\nfor y in v:\n if(s[0] != 1 and y == 'h'):\n s[0] = 1\n\n if(s[0] == 1 and s[1] != 1 and y == 'e'):\n s[1] = 1\n\n if(s[1] == 1 and s[0] == 1 and s[2] != 2 and y == 'l'):\n s[2] += 1\n\n if(s[2] == 2 and s[1] == 1 and s[0] == 1 and y == 'o'):\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n\n", "#A-Chat\r\ns = input()\r\nw = 'hello2'\r\na = 0\r\nfor i in s:\r\n if w[a] == i:\r\n a += 1\r\nif a == 5: \r\n print (\"YES\")\r\nelse:\r\n print(\"NO\")", "z=input()\r\nf=\"\"\r\ns=0\r\nfor i in z:\r\n if i==\"h\" and s==0:\r\n f+=i\r\n s+=1\r\n elif i==\"e\" and s==1:\r\n f+=i\r\n s+=1\r\n elif i==\"l\" and s==2:\r\n f+=i\r\n s+=1\r\n elif i==\"l\" and s==3:\r\n f+=i\r\n s+=1\r\n elif i==\"o\" and s==4:\r\n f+=i\r\n s+=1\r\nif s==5 and f==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "answer = 0\r\nchat = list(input())\r\nword = ['h', 'e', 'l', 'l', 'o']\r\nindex=0\r\nfor c in chat:\r\n if index <= 4:\r\n if (c==(word[index])):\r\n answer+=1\r\n index+=1\r\nif answer==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\nk = sys.stdin.readline().strip()\nword = \"hello\"\nfor i in range(len(k)):\n if word == \"\": break\n if k[i] == word[0]:\n word = word[1:]\nif word == \"\":\n print(\"YES\")\nelse:\n print(\"NO\")", "s=input()\r\nx=''\r\nfor i in s:\r\n if i==\"h\" and x=='':\r\n x+=i\r\n elif i=='e' and x==\"h\":\r\n x+=i \r\n elif i=='l' and x=='he':\r\n x+=i\r\n elif i=='l' and x=='hel':\r\n x+=i\r\n elif i=='o' and x=='hell':\r\n x+=i\r\nif x=='hello':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_hello_possible(s):\r\n hello = \"hello\"\r\n j = 0\r\n\r\n for i in range(len(s)):\r\n if s[i] == hello[j]:\r\n j += 1\r\n if j == len(hello):\r\n return True\r\n\r\n return False\r\n\r\ns = input().strip()\r\n\r\nif is_hello_possible(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Link on Codeforce\r\n# \" https://codeforces.com/problemset/problem/58/A \"\r\n# ####################\r\n\r\n# prepration for my code\r\nmy_list = list(\"hello\")\r\ncount = 0\r\n# input operation\r\nstring = input()\r\n# ouput operation\r\nfor i in string:\r\n if count == len(my_list):\r\n break\r\n if i == my_list[count]:\r\n count += 1\r\nif count == len(my_list):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s=input()\nl=[\"h\",\"e\",\"l\",\"l\",\"o\"]\ncounter=0\nfor i in s:\n if counter>4:\n break\n else:\n if i==l[counter]:\n counter+=1\nif counter==5:\n print(\"YES\")\nelse:\n print(\"NO\")", "word = input()\r\ncheck = \"hello\"\r\nj = 0\r\n\r\nfor i in range(len(word)):\r\n if(word[i] == check[j]):\r\n j += 1\r\n\r\n if(j == len(check)):\r\n break\r\n\r\nif(j == len(check)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nh = \"hello\"\r\nflag = 0\r\nj=0\r\nfor i in range(len(s)):\r\n if(s[i] == h[j]):\r\n j+=1\r\n if(j == len(h)):\r\n flag = 1\r\n break\r\n\r\n \r\nif(flag):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ntest = 'hello'\r\nind = 0\r\nfound = False\r\nfor i in s:\r\n if ind < 5 and test[ind] == i:\r\n ind += 1\r\nif ind == 5: print('YES')\r\nelse: print('NO')", "s = input()\r\na = 'hello'\r\nc= 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == a[c]:\r\n c += 1\r\n if c == 5:\r\n break\r\n\r\nif c == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n ", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\n# from math import *\r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"../output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A:\r\n print(*ele,end=\"\\n\")\r\n\r\ns=input()\r\npos=0\r\nif \"h\" in s:\r\n x=s.index(\"h\")\r\n if \"e\" in s[x+1:]:\r\n y=s[x:].index(\"e\")\r\n a=s[x:]\r\n if \"l\" in a[y+1:]:\r\n z=a[y:].index(\"l\")\r\n b=a[y:]\r\n if \"l\" in b[z+1:]:\r\n w=b[z:].index(\"l\")\r\n c=b[z:]\r\n if \"o\" in c[w+1:]:\r\n pos=1\r\nif pos:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\nendtime = time.time()\r\n# print(f\"Runtime of the program is {endtime - starttime}\")", "if __name__ == '__main__':\n s = input()\n pos, sz = 0, 0\n for i, c in enumerate(s):\n if c == 'hello'[pos]:\n pos += 1\n sz += 1\n\n if sz == 5:\n print('YES')\n exit()\n else:\n continue\n\n print('NO')\n\n \t \t\t\t\t\t \t\t\t \t \t \t\t \t\t\t\t\t", "j=input()\r\ns=\"hellofkh\"\r\nie =0\r\nfor i in j:\r\n if i==s[ie]:\r\n ie=ie+1\r\n if ie==5:\r\n break\r\nif ie==5:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "s = input()\r\ns1 = s.find('h')\r\ns2 = s.find('e', s1+1)\r\ns3 = s.find('l', s2+1)\r\ns4 = s.find('l', s3+1)\r\ns5 = s.find('o', s4+1)\r\nif s.count('h') !=0 and s.count('e') !=0 and s.count('l') !=0 and s.count('o') !=0 and s1<s2<s3<s4<s5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "inp = input()\ns = list(inp)\n\n\nl = []\n\n\nwhile (\"\".join(s)).find(\"h\")!=-1:\n d, i,j = s.index('h'),s.index('h'),s.index('h')\n l=[]\n for elt in \"hello\":\n if elt in s[i:]:\n l.append(s[i:].index(elt)+j)\n j += s[i:].index(elt)+1\n i+=s[i:].index(elt)+1\n\n\n\n\n\n else:\n\n\n break\n\n\n l1 = sorted(l)\n if l == l1 and len(l)==5:\n print(\"YES\")\n break\n s[d] = \"s\"\n\n\n\n\nif (\"\".join(s)).find(\"h\")==-1:\n print('NO')\n\n\n\n", "chkt = \"hello\"\r\nnum = 0\r\ninp = input()\r\nfor i in range(len(inp)):\r\n if inp[i] == chkt[num]:\r\n num += 1\r\n if num == 5:\r\n print(\"YES\")\r\n break\r\nif num != 5:\r\n print(\"NO\")\r\n", "stek = input()\r\nword = 'hello'\r\nfor j in stek:\r\n if len(word) != 0:\r\n if j == word[0]:\r\n word=word[1:]\r\n else:\r\n continue\r\nif len(word)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nt = \"hello\"\r\nk=0\r\nfor i in s:\r\n if(i == t[k]):\r\n k+=1\r\n if(k==5):\r\n break\r\nif(k==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n", "lst=[]\r\nlst=input()\r\nfor i in range(0,len(lst)):\r\n\tif lst[i]=='h':\r\n\t\ti=i+1\r\n\t\tbreak\r\n\telse:\r\n\t\ti=i+1\t\t\r\nfor i in range(i,len(lst)):\r\n\tif lst[i]=='e':\r\n\t\ti=i+1\r\n\t\tbreak\r\n\telse:\r\n\t\ti=i+1\r\nfor i in range(i,len(lst)):\r\n\tif lst[i]=='l':\r\n\t\ti=i+1\r\n\t\tbreak\r\n\telse:\r\n\t\ti=i+1\t\t\r\nfor i in range(i,len(lst)):\r\n\tif lst[i]=='l':\r\n\t\ti=i+1\r\n\t\tbreak\r\n\telse:\r\n\t\ti=i+1\t\t\r\nfor i in range(i,len(lst)):\r\n\tif lst[i]=='o':\r\n\t\tprint(\"YES\")\r\n\t\tbreak\t\r\n\telse:\r\n\t\ti=i+1\r\nif i==len(lst):\r\n\tprint(\"NO\")\t \t", "string = input()\r\n\r\nhello = \"hello\"\r\nfoundIndex = -1\r\n\r\nfor c in hello:\r\n foundIndex = string.find(c, foundIndex + 1)\r\n \r\n if foundIndex == -1:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")", "s=[x for x in input()]\r\n\r\nj=0\r\nw=['h','e','l','l','o']\r\n# print(s[0],w[0])\r\n\r\n\r\n\r\nfor i in range(len(s)):\r\n\tif j>4:\r\n\t\tbreak\r\n\tif s[i]==w[j]:\r\n\t\t# print(s[i])\r\n\t\tj+=1\r\n\r\n\t\t\r\nif j==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\t\r\n\r\n\r\n", "s=input()\r\nl=len(s)\r\nx=\"hello\"\r\nj=0\r\nfor i in range(l):\r\n if j!=5:\r\n if s[i]==x[j]:\r\n j+=1\r\n else:\r\n break\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=0\r\nb=0\r\nc=0\r\nd=0\r\ne=0\r\nfor i in input():\r\n if i=='h' and a==0:\r\n a+=1\r\n elif i=='e' and b==0 and a==1:\r\n b+=1\r\n elif i=='l' and c==0 and b==1:\r\n c+=1\r\n elif i=='l' and d==0 and c==1:\r\n d+=1\r\n elif i=='o' and e==0 and d==1:\r\n e+=1\r\n \r\nif a==1 and b==1 and c==1 and d==1 and e==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "s = input()\r\nhasLetter = [False] * 5\r\ncheck_pos = 0\r\nfor i in s:\r\n if not hasLetter[check_pos]:\r\n if not hasLetter[0] and i == \"h\":\r\n hasLetter[check_pos] = True\r\n check_pos += 1\r\n elif not hasLetter[1] and hasLetter[0] and i == \"e\":\r\n hasLetter[check_pos] = True\r\n check_pos += 1\r\n elif not hasLetter[2] and hasLetter[1] and i == \"l\":\r\n hasLetter[check_pos] = True\r\n check_pos += 1\r\n elif not hasLetter[3] and hasLetter[2] and i == \"l\":\r\n hasLetter[check_pos] = True\r\n check_pos += 1\r\n elif hasLetter[3] and i == \"o\":\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "w=input()\r\nh='hello'\r\ni=j=0\r\nwhile i<5:\r\n if w[j]==h[i]:\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\n if j>=len(w) and i<5:\r\n print('NO')\r\n break\r\nif i>=5:\r\n print('YES')", "s = input()\r\n\r\nword = \"hello\"\r\nj = 0\r\n\r\nanswer = \"NO\"\r\nfor i in s:\r\n if i == word[j]:\r\n j += 1\r\n if j > 4:\r\n answer = \"YES\"\r\n break\r\n\r\nprint(answer)", "s=input()\r\nhello_list=['h','e','l','l','o','*']\r\nfor i in s:\r\n if i==hello_list[0]:\r\n hello_list.pop(0)\r\n \r\nif len(hello_list)==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nm = ['h', 'e', 'l', 'l', 'o']\r\nx = 0\r\nfor i in s:\r\n if x < 5 and i == m[x]:\r\n m[x] = '1'\r\n x += 1\r\n else:\r\n continue\r\nflag = True\r\nfor j in m:\r\n if j != '1':\r\n flag = False\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "# author: brownBuck\r\n\r\nstring = input()\r\ns = 'hello'\r\ntemp = 0\r\n\r\nfor item in string:\r\n #print (item, s[temp])\r\n if s[temp] == item:\r\n temp += 1\r\n if temp == 5:\r\n print ('YES')\r\n break\r\nelse:\r\n print ('NO')\r\n", "s=input()\r\nfind=\"hello\"\r\n\r\nj=0\r\nfor i in range(len(s)):\r\n if s[i]==find[j]:\r\n j+=1 \r\n if j==len(find):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "x= input()\r\ny=\"hello\"\r\nj=0\r\np=0\r\nfor i in range(len(x)):\r\n if x[i]==y[j]:\r\n j=j+1 \r\n if j==5:\r\n p=1 \r\n break\r\nif p==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = set(a)\r\nc = set('hello')\r\nd = b & c\r\nif c==d:\r\n if a.count('l')<2:\r\n print('NO')\r\n else:\r\n q1=a.find('h')\r\n a1=a[q1:]\r\n q2=a1.find('e')\r\n a2=a1[q2:]\r\n q3=a2.find('l')\r\n a3=a2[q3:]\r\n h=a3.replace('l','f',1)\r\n\r\n q4=h.find('l')\r\n a4=h[q4:]\r\n q5=a4.find('o')\r\n if -1 not in (q1,q2,q3,q4,q5):\r\n\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nelse:\r\n print('NO')", "s=input()\r\nx=s.find('h')\r\nif x!=-1:\r\n if s.find('e',x)!=-1:\r\n x1=s.find('e',x)\r\n if s.find('l',x1)!=-1:\r\n x2=s.find('l',x1)\r\n if s.find('l',x2+1)!=-1:\r\n x3=s.find('l',x2+1)\r\n if s.find('o',x3)!=-1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO') ", "n=input()\r\nlis=list(\"hello\")\r\nfor letter in n:\r\n\tif len(lis)!=0:\r\n\t\tif lis[0]==letter:\r\n\t\t\tlis.remove(lis[0])\r\nif len(lis)==0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "s = input();\r\nwanted = \"hello\";\r\n\r\nwhile (s and wanted):\r\n if (s[0] == wanted[0]):\r\n wanted = wanted[1:len(wanted)]\r\n \r\n s = s[1:len(s)];\r\n \r\nif (wanted):\r\n print(\"NO\");\r\nelse:\r\n print(\"YES\");", "# chat room : check whether the input string can make up the word \"hello\" \n# eg. ashheellllooug can maje up hello but ahheeellluiiio cannot \n\ndef chatRoom(string):\n\tst = \"hello\"\n\tj=0 \n\tfor i in range(len(string)):\n\t\tif j<len(st) and string[i]==st[j] :\n\t\t\tj+=1\n\t\telse:\n\t\t\tcontinue\n\tif j==len(st):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\nstring = input()\nchatRoom(string)", "s=input().lower()\r\ndp=[0]*5\r\ndata='hello'\r\ncnt=0\r\nfor c in s:\r\n if c==data[cnt]:\r\n dp[cnt]+=1\r\n cnt+=1\r\n if cnt==5:\r\n break\r\nif sum(dp)==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\nflag=0\narr=[\"h\",\"e\",\"l\",\"l\",\"o\"]\n\nfor i in a:\n if arr==[]:\n break\n var=arr[0]\n if i == var:\n arr.pop(0)\nif arr==[]:\n print(\"YES\")\nelse:\n print(\"NO\")", "s = input().lower()\r\nlst = ['h', 'e', 'l', 'l', 'o']\r\ncount, ind1 = 0, 0\r\n\r\nwhile count < 5 and ind1 < len(s):\r\n if s[ind1] == lst[count]:\r\n count += 1\r\n ind1 += 1\r\n\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\n\r\ns = input()\r\ns = s.lower()\r\n\r\ntarget = \"hello\"\r\ntarget_i = 0\r\n\r\nfor s_i in s:\r\n if s_i == target[target_i]:\r\n target_i += 1\r\n if target_i == 5: \r\n break \r\n\r\n\r\n\r\nif target_i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ns = list(s)\r\na = ['h', 'e', 'l', 'l', 'o']\r\nb = []\r\nimin = -1\r\nfor k in range(len(a)):\r\n for i in range(len(s)):\r\n if s[i] == a[k] and i > imin:\r\n b.append(s[i])\r\n imin = i\r\n break\r\nif ''.join(b) == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "s = list(input())\r\ntest = 0\r\nfor i in s:\r\n if test == 0:\r\n if i == \"h\":\r\n test = 1\r\n continue\r\n if test == 1:\r\n if i ==\"e\":\r\n test = 2\r\n continue\r\n if test == 2:\r\n if i == \"l\":\r\n test = 3\r\n continue\r\n if test == 3:\r\n if i == \"l\":\r\n test = 4\r\n continue\r\n if test == 4:\r\n if i == \"o\":\r\n test = 5\r\n continue\r\nif test==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "s = input()\r\nresult = [s.find('h', 0, len(s))]\r\nfor i in range(4): result.append(-1) if result[i] == -1 else result.append(s.find('hello'[i+1], result[i]+1, len(s)))\r\nprint('NO') if result[4] == -1 else print('YES')", "a=\"hello\"\r\ndef chatroom():\r\n b=0\r\n c=input()\r\n for i in range(len(c)):\r\n if c[i]==a[b]:\r\n b+=1\r\n if b==5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chatroom()) \r\n \r\n", "s=input()\r\nt=\"hello\"\r\nc=0\r\nj=0\r\nfor i in range(len(t)):\r\n while(j<len(s)):\r\n if(t[i]==s[j]):\r\n c+=1\r\n j+=1\r\n break\r\n j+=1\r\n if(c<=i):\r\n break\r\nif(c==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def func(a, l):\r\n for i1 in range(0, l-4):\r\n if (a[i1] == 'h'):\r\n for i2 in range(i1+1, l-3):\r\n if (a[i2] == 'e'):\r\n for i3 in range(i2+1, l-2):\r\n if (a[i3] == 'l'):\r\n for i4 in range(i3+1, l-1):\r\n if (a[i4] == 'l'):\r\n for i5 in range(i4+1, l):\r\n if (a[i5] == 'o'):\r\n return True\r\n return False\r\n\r\na = input()\r\nl = len(a)\r\nans = func(a, l)\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "# 01234\r\nkeyword = \"hello\"\r\nn_keyword = len(keyword)\r\n#keyword[0] == word[0] no\r\n#keyword[0] == word[1] yes\r\n#keyword[1] == word[2] no\r\n#keyword[1] == word[3] yes\r\n#keyword[2] == word[4] yes\r\n#keyword[3] == word[5] yes\r\n#keyword[4] == word[6] no\r\n#keyword[4] == word[7] no\r\n#keyword[4] == word[8] no\r\n#keyword[4] == word[9] yes\r\n#......\r\n#until there is 5 yes\r\n#or until all words have been checked\r\n#if there is no 5 yes then print(\"NO\")\r\n\r\n# 012345678901\r\n#word = \"ahhellllloou\"\r\nword=input()\r\nn_word = len(word)\r\n\r\n#How to do WHILE you need to:\r\n#1. initial counter\r\n#2. ending condition\r\n#3. counter increase/decrease\r\nyes=0\r\ncounter = 0\r\ncounter2 = 0\r\nwhile counter < n_keyword:\r\n while counter2<n_word and yes<n_keyword:\r\n #print(keyword[counter],\"==\",word[counter2], \"?\", end=\" \")\r\n if keyword[counter] == word[counter2]:\r\n yes = yes + 1\r\n counter = counter + 1\r\n #print(\"Yes\")\r\n #else:\r\n #print(\"No\")\r\n counter2 = counter2 + 1\r\n counter = n_keyword\r\n\r\nif yes == n_keyword:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s=input()\r\nl=[]\r\ntop=-1\r\ns=s.lower()\r\n# c=0\r\nfor i in range (len(s)):\r\n if s[i]=='h' and top==-1:\r\n l.append(s[i])\r\n \r\n top+=1\r\n \r\n elif s[i]=='e' and top==0:\r\n l.append(s[i])\r\n \r\n top+=1\r\n\r\n elif s[i]=='l' and top==1:\r\n l.append(s[i])\r\n \r\n top+=1\r\n elif s[i]=='l' and top==2:\r\n l.append(s[i])\r\n \r\n top+=1\r\n elif s[i]=='o' and top==3:\r\n l.append(s[i])\r\n \r\n top+=1\r\n else:\r\n continue\r\n\r\n# print(l)\\\r\n\r\nif (len(l))==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "texto = input()\r\nvariable = \"hello\"\r\nj = 0\r\nfor i in range(len(texto)):\r\n if j < len(variable) and texto[i] == variable[j]:\r\n j += 1\r\n\r\nif j == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\nstring = \"hello\"\r\nlt= []\r\nm = 0\r\nfor i in n :\r\n if i == string[m]:\r\n m+=1\r\n if m == 5:\r\n print(\"YES\")\r\n break\r\nif m != 5:\r\n print(\"NO\")\r\n\r\n \r\n \r\n", "word = input()\r\ntarget = 'hello'\r\ni = 0\r\nj = 0\r\n \r\nwhile(i < len(target) and j < len(word)):\r\n if(word[j] == target[i]):\r\n i += 1\r\n j += 1\r\n \r\nif(i == len(target)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "str=input()\r\nimport re\r\npatern=re.compile(r'h.*e.*l.*l.*o')\r\nmatch=patern.search(str)\r\nif match:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nl = 'hello'\r\nm = -1\r\nn = 0\r\nfor i in range(len(l)):\r\n for j in range(m+1, len(s)):\r\n if l[i] == s[j]:\r\n m = j\r\n n += 1\r\n break\r\nif n == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\npos_h=a.find(\"h\")\r\npos_e=a.find(\"e\",pos_h)\r\npos_l1=a.find(\"l\",pos_e)\r\npos_l2=a.find(\"l\",pos_l1+1)\r\npos_o=a.find(\"o\",pos_l2)\r\nif pos_h!=-1 and pos_e!=-1 and pos_l1!=-1 and pos_l2!=-1 and pos_o!=-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s= input()\r\n\r\n\r\np=0\r\nref = \"hello\"\r\n\r\nfor i in range(len(s)):\r\n\r\n if s[i]==ref[0]:\r\n if ref[0]==\"o\":\r\n p+=1\r\n break\r\n else:\r\n ref=ref[1:]\r\nif p==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "s = input()\n\ntry:\n\ts = s[s.index('h'):]\n\th = s.index('h')\n\te = s.index('e')\n\to = s.rfind('o')\n\t#print(h,e,o, s[e:o].count('l'))\n\tprint(\"YES\" if(h<e and h<o and e<o and (s[e:o]).count('l')>=2) else \"NO\")\n\nexcept:\n\tprint('NO')\n", "s = input()\r\nt = 'hello'\r\nlcs = [[0 for j in range(len(s)+1)] for i in range(len(t)+1)]\r\n\r\nfor i in range(len(t)+1):\r\n\tfor j in range(len(s)+1):\r\n\t\tif(i==0 or j==0):\r\n\t\t\tlcs[i][j] = 0\r\n\t\telse:\r\n\t\t\tif(t[i-1]==s[j-1]):\r\n\t\t\t\tlcs[i][j] = lcs[i-1][j-1] + 1\r\n\t\t\telse:\r\n\t\t\t\tlcs[i][j] = max(lcs[i-1][j],lcs[i][j-1])\r\n\r\nif(lcs[i][j] >= 5):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\r\n", "s = input()\r\nword = \"hello\"\r\nj=0\r\nc=0\r\nx=1\r\nfor i in range(5):\r\n while j<len(s):\r\n if word[i] == s[j]:\r\n c+=1\r\n j+=1\r\n break\r\n elif j==len(s)-1 and c!=5:\r\n x=0\r\n print(\"NO\")\r\n j+=1\r\n \r\nif c==5:\r\n print(\"YES\")\r\nelif j==len(s) and x==1:\r\n print(\"NO\")", "s= input()\nt= ['h','e','l','l','o']\no=1\nfor i in t:\n\tp=s.find(i)\n\ts=s[(p+1):(len(s))]\n\tif(p==-1):\n\t\to=0\n\t\tprint('NO')\n\t\tbreak;\nif(o!=0):\n\tprint('YES')", "word = 'hello'\r\nword_sent_user = input()\r\ndef checker(word_to_check,word_sent):\r\n i = 0\r\n for letter in word_sent:\r\n if letter == word_to_check[i]:\r\n i+=1\r\n if i==len(word_to_check):\r\n return 'YES'\r\n return 'NO'\r\n \r\nprint(checker(word,word_sent_user))", "word = input()\r\nans = True\r\nfor c in \"hello\":\r\n idx = word.find(c)\r\n if idx == -1:\r\n ans = False\r\n break\r\n word = word[idx+1:]\r\n\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nword = 'hello'\r\nz = 0\r\n\r\nfor i in range(0, len(s)):\r\n\t\r\n\tif s[i]==word[z]:\r\n\t\tz+=1\r\n\r\n\tif z==5:\r\n\t\tprint('YES')\r\n\t\tbreak\r\n\r\nif z<5:\r\n\tprint('NO')\r\n\t", "word = input()\r\ns = 'hello'\r\ncurrent_index = 0\r\nfor i in word:\r\n if current_index < len(s) and i == s[current_index]:\r\n current_index +=1\r\nif current_index == len(s):\r\n print('YES')\r\nelse:\r\n print('NO')", "entrada = input()\r\n\r\nentrada = list(entrada)\r\n\r\nh = 0\r\ne = 0\r\nl = 0\r\no = 0\r\n\r\nhello = ''\r\n\r\nfor letra in entrada:\r\n if letra=='h' and h==0 and e==0 and l==0 and o==0:\r\n h = h+1\r\n hello = hello + letra\r\n elif letra=='e' and e==0 and h==1 and l==0 and o==0:\r\n e = e+1\r\n hello = hello + letra\r\n elif letra=='l' and l<=1 and h==1 and e==1 and o==0:\r\n l = l+1\r\n hello = hello + letra\r\n elif letra=='o' and o==0 and h==1 and e==1 and l==2:\r\n o = o+1\r\n hello = hello + letra\r\n\r\nif hello=='hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "m=list(input())\r\nif 'h'in m:\r\n m=m[m.index('h'):len(m)]\r\n if 'e' in m:\r\n m=m[m.index('e'):len(m)]\r\n if 'l' in m:\r\n m=m[m.index('l')+1:len(m)]\r\n if 'l' in m:\r\n m=m[m.index('l'):len(m)]\r\n if 'o' in m:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "s=input()\r\na=[0,0,0,0,0]\r\nfor c in s:\r\n if(c=='h'):\r\n a[0]=1\r\n continue\r\n if(a[0]==1 and c=='e'):\r\n a[1]=1\r\n continue\r\n if(a[1]==1 and a[2]!=1 and c=='l'):\r\n a[2]=1\r\n continue\r\n if(a[2]==1 and c=='l'):\r\n a[3]=1\r\n continue\r\n if(a[3]==1 and c=='o'):\r\n a[4]=1\r\n break\r\nif(sum(a)==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re, sys\r\n\r\ns = sys.stdin.readline()\r\nprint('YES' if re.match(r'.*?h.*?e.*?l.*?l.*?o', s) else 'NO')", "stringOriginal = \"hello\"\r\nstringTest = input()\r\n\r\nindexOriginal = 0\r\n\r\nfor i in range(len(stringTest)):\r\n if stringTest[i] == stringOriginal[indexOriginal]:\r\n indexOriginal+=1\r\n if indexOriginal >= len(stringOriginal):\r\n break\r\n\r\nif indexOriginal == len(stringOriginal):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "line=input()\r\nh=\"hello\"\r\nx=0\r\nst=\"\"\r\nfor i in line:\r\n #print(i)\r\n #print(x)\r\n if i==h[x]:\r\n st=st+i\r\n x=x+1\r\n if x>4:break\r\nif st==h:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "word = input()\r\nhello, counter = 'hello', 0\r\n\r\nfor char in word:\r\n if char == hello[counter]:\r\n counter += 1\r\n\r\n if counter == 5:\r\n print('YES')\r\n break\r\n\r\nif counter < 5:\r\n print('NO')\r\n", "s=input()\r\nind_h=s.find('h')\r\ns=s[(ind_h+1):]\r\nind_e=s.find('e')\r\ns=s[(ind_e+1):]\r\nind_l=s.find('l')\r\ns=s[(ind_l+1):]\r\nind_l=s.find('l')\r\ns=s[(ind_l+1):]\r\nind_o=s.find('o')\r\ns=s[(ind_o+1):]\r\nno_attempt = ind_h==-1 or ind_e==-1 or ind_l==-1 or ind_o==-1\r\nno_attempt=str(no_attempt)\r\nno_attempt=no_attempt.replace('True','NO')\r\nno_attempt=no_attempt.replace('False','YES')\r\nprint(no_attempt)\r\n", "s = input()\r\n\r\nsh = 'hello'\r\nc = 0\r\n\r\nfor i in range(len(s)):\r\n if c<5:\r\n if s[i]==sh[c]:\r\n c+=1\r\n\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n# import re\r\n# print(\"YES\"if re.search(\"h.*e.*l.*l.*o\",input())else\"NO\")", "str = input()\r\n#str = list(input())\r\n\r\n#print(str)\r\n\r\nif \"h\" in str:\r\n hlocay = str.index(\"h\")\r\n str = str[hlocay:]\r\n\r\n if \"e\" in str:\r\n elocay = str.index(\"e\")\r\n str = str[elocay:]\r\n\r\n if \"l\" in str:\r\n l1locay = str.index(\"l\")\r\n str = str[l1locay+1:]\r\n\r\n if \"l\" in str:\r\n l2locay = str.index(\"l\")\r\n str = str[l2locay:]\r\n\r\n if \"o\" in str:\r\n olocay = str.index(\"o\")\r\n str = str[olocay:]\r\n print(\"YES\")\r\n \r\n else:\r\n print(\"NO\")\r\n\r\n else:\r\n print(\"NO\")\r\n \r\n else:\r\n print(\"NO\")\r\n\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n\r\n#print (str)", "s=list(input())\r\nn=0\r\nindex=0\r\ndef check_letter(index,s,l):\r\n for i in range(index,len(s)):\r\n if s[i]==l:\r\n return i\r\n return -1\r\nif check_letter(index,s,'h')==-1:\r\n print(\"NO\")\r\nelse:\r\n index=check_letter(index,s,'h')\r\n if check_letter(index,s,'e')==-1:\r\n print(\"NO\")\r\n else:\r\n index=check_letter(index,s,'e')\r\n if check_letter(index,s,'l')==-1:\r\n print(\"NO\")\r\n else:\r\n index=check_letter(index,s,'l')\r\n if check_letter(index+1,s,'l')==-1:\r\n print(\"NO\")\r\n else:\r\n index=check_letter(index+1,s,'l')\r\n if check_letter(index,s,'o')==-1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "import re\r\n\r\n\r\ndef main():\r\n print(\"YES\" if re.search(r\".*\".join(\"hello\"), input()) else \"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "string = input()\r\n\r\nhello = 'hello'\r\nx = 0\r\nprinted = False\r\n\r\nfor i in range(0 , len(string)):\r\n if string[i] == hello[x]:\r\n x += 1\r\n if x == 5:\r\n print('YES')\r\n printed = True\r\n break\r\n\r\nif printed == False:\r\n print('NO')", "# Competitive Programming Template --> Ankit Josh\n\nimport os\nfrom math import factorial,sqrt,ceil,floor,log\nfrom itertools import groupby\nimport sys\nfrom io import BytesIO, IOBase\n\ndef inp(): return sys.stdin.readline().strip()\ndef IIX(): return (int(x) for x in sys.stdin.readline().split())\ndef II(): return (int(inp()))\ndef LI(): return list(map(int, inp().split()))\ndef LS(): return list(map(str, inp().split()))\ndef L(x):return list(x)\ndef out(var): return sys.stdout.write(str(var))\n\n#Graph using Ajdacency List\n\nclass GraphAL:\n def __init__(self,Nodes,isDirected=False):\n self.nodes=[x for x in range(1,Nodes+1) ]\n self.adj_list={}\n self.isDirected=isDirected\n for node in self.nodes:\n self.adj_list[node]=[]\n \n def add_edge(self,x,y):\n self.adj_list[x].append(y)\n if self.isDirected==False:\n self.adj_list[y].append(x)\n \n def return_graph(self):\n return(self.adj_list)\n\n#Graph using Ajdacency Matrix\n\nclass GraphAM:\n def __init__(self,Nodes,isDirected=False):\n self.adj_matrix=[ [0]*(Nodes+1) for x in range(Nodes+2)]\n self.isDirected=isDirected\n\n def add_edge(self,x,y):\n if self.isDirected:\n self.adj_matrix[x][y]=1\n elif self.isDirected==False:\n self.adj_matrix[x][y]=1\n self.adj_matrix[y][x]=1\n \n def delete_edge(self,x,y):\n if self.isDirected:\n self.adj_matrix[x][y]=0\n if self.isDirected==False:\n self.adj_matrix[x][y]=0\n self.adj_matrix[y][x]=0\n \n def degree(self,x):\n l=self.adj_matrix[x]\n return l.count(1)\n\n def return_graph(self):\n return self.adj_matrix\n\n\n\n'''\nnodes=II() \nedges=II() \ngraph=GraphAL(nodes) #Add 'True' to the Graph method, for directed graph\nconnections=[]\nfor i in range(edges):\n l=LI()\n connections.append(l)\n\nfor connect in connections:\n graph.add_edge(connect[0],connect[1])\n\ngrp=graph.return_graph()\n'''\ndef primeFact(n):\n hashMap={}\n for i in range(2,int(sqrt(n))+1):\n if n % i==0:\n hashMap[i]=0\n while n % i==0:\n hashMap[i]+=1\n n/=i\n if n>1:\n hashMap[n]=1\n return hashMap\n\n#Code goes here\n\n\ndef solve():\n #Start coding\n \n s=inp()\n flag=False\n for i in range(len(s)):\n if s[i]=='h':\n for j in range(i+1,len(s)):\n if s[j]=='e':\n for k in range(j+1,len(s)):\n if s[k]=='l':\n for l in range(k+1,len(s)):\n if s[l]=='l':\n for m in range(l+1,len(s)):\n if s[m]=='o':\n print(\"YES\")\n return\n print(\"NO\")\n\n\n return\n\n# region fastio\n\nBUFSIZE = 8192\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\n# endregion\n\nif __name__ == \"__main__\":\n try:\n t=1\n for _ in range(t): \n solve()\n except EOFError as e:\n out('')\n except RuntimeError as r:\n out('')\n\n", "s = input()\nhello = \"hello\"\ncounter = 0 \nj = 0\nfor i in range(len(hello)):\n while j < len(s):\n \n if hello[i] == s[j]:\n counter += 1\n j += 1\n break\n j += 1\nif counter == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n ", "def isManaged(s):\r\n for i in \"hello\":\r\n if i not in s:\r\n return False\r\n ind = s.index(i)\r\n s = s[ind + 1:]\r\n return True\r\n\r\ns = input()\r\nif (isManaged(s)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\nsi = 0\nh = \"hello\"\nhi = 0\n\nwhile si < len(s) and hi < len(h):\n if s[si] == h[hi]:\n hi+=1\n si+=1\n\nif len(h) == hi:\n print(\"YES\")\nelse:\n print(\"NO\")", "s = input() \r\nans = \"\"\r\nt = ['h', 'e', 'l', 'l', 'o']\r\nplace = t[0]\r\nj = 0\r\nwhile j < len(s) and t:\r\n if place == s[j]:\r\n ans += place\r\n t.remove(place)\r\n if t:\r\n place = t[0]\r\n j += 1\r\n \r\nif ans == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "FLAG = 0\r\nstring = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\ns = [ x for x in input() ]\r\nfor x in s:\r\n if x == string[FLAG]:\r\n FLAG += 1\r\n if FLAG == 5:\r\n break\r\nprint([\"NO\", \"YES\"][FLAG == 5])", "s = input()\r\nhello = \"hello\"\r\ni = 0\r\nfor letter in s:\r\n if i > 4:\r\n break\r\n elif letter == hello[i]:\r\n i += 1\r\nif i > 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nw = \"hello\"\r\ncnt = 0\r\nfor i in range(len(s)):\r\n if s[i]==w[0] and cnt==0:\r\n cnt+=1\r\n continue\r\n if s[i]==w[1] and cnt==1:\r\n cnt+=1\r\n continue\r\n if s[i]==w[2] and cnt==2:\r\n cnt+=1\r\n continue\r\n if s[i]==w[3] and cnt==3:\r\n cnt+=1\r\n continue\r\n if s[i]==w[4] and cnt==4:\r\n cnt+=1\r\n continue\r\n \r\n \r\n \r\n \r\nif(cnt==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_say_hello(s):\r\n hello = \"hello\"\r\n j = 0\r\n for letter in s:\r\n if letter == hello[j]:\r\n j += 1\r\n if j == len(hello):\r\n return \"YES\"\r\n return \"NO\"\r\ns = input()\r\nprint(can_say_hello(s))\r\n", "import re\r\npat = '.*'.join(\"^hello$\")\r\ns = input()\r\nprint(\"YES\" if re.match(pat,s) else \"NO\")\r\n", "s = str(input())\r\nkey = 'hello'\r\nfor c in s:\r\n\tif c not in key:\r\n\t\ts = s.replace(c, \"\")\r\nr = 0\r\nfor c in s:\r\n\tif c == key[r]:\r\n\t\tr += 1\r\n\tif r == 5: break\r\nprint(\"YES\") if r == 5 else print(\"NO\")\r\n", "s = input()\r\ncur = \"\"\r\nfor ch in s:\r\n\tif ch == 'h' and cur == \"\": cur=\"h\"\r\n\telif ch == 'e' and cur == \"h\": cur=\"he\"\r\n\telif ch == 'l': \r\n\t\tif cur == \"he\":cur=\"hel\"\r\n\t\telif cur == \"hel\": cur=\"hell\"\r\n\telif ch == 'o':\r\n\t\tif cur == \"hell\":\r\n\t\t\tprint(\"YES\")\r\n\t\t\tbreak\r\nelse:\r\n print(\"NO\")", "s=input()\r\ncount=0\r\nk=\"\"\r\nfor i in range(len(s)):\r\n if(count==0):\r\n if(s[i]=='h'):\r\n k=k+s[i]\r\n count=count+1\r\n elif(count==1):\r\n if(s[i]=='e'):\r\n k=k+s[i]\r\n count=count+1\r\n elif(count==2):\r\n if(s[i]=='l'):\r\n k=k+s[i]\r\n count=count+1\r\n elif(count==3):\r\n if(s[i]=='l'):\r\n k=k+s[i]\r\n count=count+1\r\n elif(count==4):\r\n if(s[i]=='o'):\r\n k=k+s[i]\r\n count=count+1\r\n break\r\nif(k==\"hello\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Aug 30 20:53:03 2023\r\n\r\n@author: 程卓 2300011733\r\n\"\"\"\r\n\r\nword=input()\r\ncontrol_=0\r\ncontrol=[False,False,False,False,False]\r\nn=0\r\nfor i in range(len(word)):\r\n if word[i]=='h':\r\n control[0]=True\r\n n=i+1\r\n break\r\nfor i in range(n,len(word)):\r\n if word[i]=='e':\r\n control[1]=True\r\n n=i+1\r\n break\r\nfor i in range(n,len(word)):\r\n if word[i]=='l':\r\n control[2]=True\r\n n=i+1\r\n break\r\nfor i in range(n,len(word)):\r\n if word[i]=='l':\r\n control[3]=True\r\n n=i+1\r\n break\r\nfor i in range(n,len(word)):\r\n if word[i]=='o':\r\n control[4]=True\r\n n=i+1\r\n break \r\nfor i in range(5):\r\n if control[i]:\r\n control_+=1\r\nif control_==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "msg = input()\r\nhello = 'hello'\r\n\r\nind=0\r\nfor i in msg:\r\n if i == hello[ind]:\r\n ind+=1\r\n if ind == 5:\r\n break\r\n\r\nprint('YES' if ind == 5 else 'NO')", "s=input()\r\ntar=\"hello\"\r\nnums=numt=0\r\n#len(tar)=5\r\nwhile nums<len(s) and numt<5 :\r\n if s[nums]==tar[numt] :\r\n nums+=1;numt+=1\r\n else:\r\n nums+=1\r\n\r\nif numt==5 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\r\ns = input()\r\n\r\nif re.search(r'h+[a-z]*e+[a-z]*l[a-z]*l+[a-z]*o+',s) == None:\r\n print( \"NO\")\r\nelse: print(\"YES\")", "a=\"hello\"\r\ns=input()\r\nj=0\r\nfor i in s:\r\n if i==a[j]:\r\n j+=1\r\n if(j==5):\r\n print('YES')\r\n exit()\r\nprint('NO')", "a=input()\r\n\r\ncount1=0\r\ncount2=0\r\ncount3=0\r\ncount4=0\r\nb=[]\r\nc=['h','e','l','l','o']\r\nfor i in range(len(a)):\r\n if a[i]=='h' and count1<1:\r\n count1+=1\r\n b.append(a[i])\r\n if count1==1 and a[i] == 'e' and count2 < 1:\r\n count2 += 1\r\n b.append(a[i])\r\n\r\n if count2==1 and a[i] == 'l' and count3 < 2:\r\n count3 += 1\r\n b.append(a[i])\r\n\r\n if count3==2 and a[i] == 'o' and count4 < 1:\r\n count4 += 1\r\n b.append(a[i])\r\n\r\nif b==c:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nword = \"hello\"\r\ncoint = 0 \r\nfor i in s:\r\n if i==word[coint]:\r\n coint+=1 \r\n if coint>=5:\r\n break\r\nprint(\"YES\" if coint>=5 else \"NO\")", "n = input()\r\nhello = 'hello'\r\nk = 0\r\nfor i in range(len(n)):\r\n if k == 5:\r\n print(\"YES\")\r\n exit()\r\n if n[i] == hello[k]:\r\n k += 1\r\n \r\nprint(\"YES\" if k >= 5 else \"NO\")\r\n", "\r\n\r\ndef count(a, b, m, n): \r\n \r\n\r\n if ((m == 0 and n == 0) or n == 0): \r\n return 1\r\n\r\n if (m == 0): \r\n return 0\r\n \r\n\r\n if (a[m - 1] == b[n - 1]): \r\n return (count(a, b, m - 1, n - 1) + \r\n count(a, b, m - 1, n)) \r\n else: \r\n \r\n\r\n return count(a, b, m - 1, n) \r\n\r\na=input()\r\n\r\nb = \"hello\"\r\n \r\nh=count(a, b, len(a),len(b))\r\nif(h==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n", "s = input()\r\nhello = ['h', 'e', 'l', 'l', 'o']\r\nindex = []\r\nh = s.find('h')\r\nif h != -1:\r\n s = s[h+1:]\r\n e = s.find('e')\r\n if e != -1:\r\n s = s[e+1:]\r\n l1 = s.find('l')\r\n if l1!= -1:\r\n s = s[l1+1:]\r\n l2 = s.find('l')\r\n if l2 != -1:\r\n s = s[l2+1:]\r\n o = s.find('o')\r\n if o != -1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n ", "string = input()\n#N, M, A = [int(x) for x in string.split(\" \")]\n\ndef verify(n):\n if n == -1:\n print(\"NO\")\n quit()\n\nhIndex = string.find(\"h\")\nverify(hIndex)\neIndex = string.find(\"e\",hIndex)\nverify(eIndex)\nlIndex = string.find(\"l\",eIndex)\nverify(lIndex)\nlIndex = string.find(\"l\",lIndex + 1)\nverify(lIndex)\noIndex = string.find(\"o\",lIndex)\nverify(oIndex)\n\nchecker = 0\nprint(\"YES\")", "from sys import stdin\r\ndef main():\r\n s=list(stdin.readline().strip().lower())\r\n c=0\r\n if \"h\" in s:\r\n c+=1\r\n s=s[s.index(\"h\")+1:]\r\n if \"e\" in s:\r\n c+=1\r\n s=s[s.index(\"e\")+1:]\r\n if \"l\" in s:\r\n c+=1\r\n s=s[s.index(\"l\")+1:]\r\n if \"l\" in s:\r\n c+=1\r\n s=s[s.index(\"l\")+1:]\r\n if \"o\" in s:\r\n c+=1\r\n s=s[s.index(\"o\")+1:]\r\n if c == 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nmain()\r\n", "s = list(input())\ntarget = list(\"hello\")\nnum = 0\n\nfor i in s:\n if i == target[num]:\n num += 1\n if num == 5:\n break\n\nif num == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n# flg = 1\n# while flg:\n# print(flg)\n# for j in s:\n# if target[0] == j:\n# target.pop()\n# flg = 0\n", "word = 'hello'\nx = input()\nj = 0 ; cont = 0\nfor i in range(len(x)):\n if x[i] == word[j]:\n j += 1\n if j == 5:\n cont +=1\n break\n\nprint('YES') if cont == 1 else print('NO')\n", "def findChat(string):\r\n arr = ['h','e','l','l','o']\r\n output = ''\r\n count = 0\r\n \r\n for char in string:\r\n if char in arr[0+count:1+count]:\r\n count += 1\r\n output += char\r\n \r\n if output == 'hello':\r\n return 'YES'\r\n \r\n return 'NO'\r\n\r\nprint(findChat(input()))", "str = input()\r\nh = str.find('h')\r\nstr = str[h+1:]\r\ne = str.find('e')\r\nstr = str[e+1:]\r\nl1 = str.find('l')\r\nstr = str[l1+1:]\r\nl2 = str.find('l')\r\nstr = str[l2+1:]\r\no = str.find('o')\r\nif h > -1 and e > -1 and l1 > -1 and l2 >-1 and o > -1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = str(input()).lower()\r\nsay = \"o l l e h\".split()\r\nfor i in s:\r\n\r\n if i == say[-1]:\r\n say.pop()\r\n if not say:\r\n print(\"YES\")\r\n break\r\nif say:\r\n print(\"NO\")\r\n", "s = list(input())\nl = [s[0]]\ncheck = ['h', 'e', 'l', 'l', 'o']\ni = 0\nisHello = False\nfor j in range(len(s)):\n if s[j] == check[i]:\n if i == 4:\n isHello = True\n break\n else:\n i += 1\n # elif(s[j] == check[i-1]):\n # continue\n # else:\n # i = 0\nif(isHello):\n print(\"YES\")\nelse:\n print(\"NO\")", "s = input()\r\np = \"hello\"\r\nj = 0\r\nfound = False\r\nfor i in range(len(s)):\r\n if j >= len(p):\r\n found = True\r\n break\r\n if p[j] == s[i]:\r\n j += 1\r\n\r\nprint(\"YES\" if found or j >= len(p) else \"NO\")", "#!/usr/bin/env python3\nimport sys\n\ntext = input()\n\nstart_index = -1\n\nfor letter in 'hello':\n index = text.find(letter, start_index + 1)\n if index == -1:\n print('NO')\n sys.exit(0)\n start_index = index\nprint('YES')\n", "def canHello():\n\tlooking_for = next(hello_iter)\n\tfor char in input():\n\t\tif char == looking_for:\n\t\t\ttry:\n\t\t\t\tlooking_for = next(hello_iter)\n\t\t\texcept Exception as e:\n\t\t\t\treturn True\t\t\n\treturn False\n\nhello_iter = iter(\"hello\")\n\nprint(\"YES\") if canHello() else print(\"NO\")", "s=input()\r\na='hello'\r\nk=0\r\nfor i in s:\r\n if k==5:\r\n break\r\n if i==a[k]:\r\n k+=1\r\nif k==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "l=\"hello\"\r\ns=input()\r\ni,k=0,0\r\nwhile i<len(s):\r\n if k==5:\r\n break\r\n if s[i]==l[k]:\r\n k+=1\r\n# print(k,i,s[i],curr)\r\n i+=1\r\nprint(\"YES\"if k==5 else \"NO\")", "s=input()\r\n \r\nfound=False\r\nindex=0\r\n \r\nfor i in range(len(s)):\r\n if s[i]=='h':\r\n found=True\r\n index=i+1\r\n break\r\n \r\nif not found:\r\n print(\"NO\")\r\n \r\nelse:\r\n found=False\r\n for i in range(index, len(s)):\r\n if s[i]=='e':\r\n found=True\r\n index=i+1\r\n break\r\n \r\n if not found:\r\n print(\"NO\")\r\n else:\r\n found=False\r\n for i in range(index, len(s)):\r\n if s[i]=='l':\r\n found=True\r\n index=i+1\r\n break\r\n \r\n if not found:\r\n print(\"NO\")\r\n else:\r\n found=False\r\n for i in range(index, len(s)):\r\n if s[i]=='l':\r\n index=i+1\r\n found=True\r\n break\r\n \r\n if not found:\r\n print(\"NO\")\r\n else:\r\n found=False\r\n for i in range(index, len(s)):\r\n if s[i]=='o':\r\n found=True\r\n index=i+1\r\n break\r\n if found:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "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\na=list(input())\r\nl=[]\r\nfor i in range(len(a)):\r\n if(a[i]=='h'or a[i]=='e'or a[i]=='l'or a[i]=='o'):\r\n l.append(a[i])\r\n\r\nans = False\r\n\r\nle = len(l)\r\nfor i in range(le):\r\n if ans:\r\n break\r\n if l[i]=='h':\r\n for j in range(i+1, le):\r\n if l[j]=='e':\r\n for k in range(j+1, le):\r\n if l[k]=='l':\r\n for x in range(k+1, le):\r\n if l[x]=='l':\r\n for y in range(x+1, le):\r\n if l[y]=='o':\r\n ans = True\r\n\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\nhello = 'hello'\ni, j = 0, 0\nwhile i<len(s) and j<len(hello):\n if s[i] == hello[j]:\n j+=1\n i+=1\nif j==len(hello):\n print('YES')\nelse:\n print(\"NO\")", "word=input()\ntest=\"hello\"\ni=0\nj=0\ntrue=0\nfor x in range(0,len(word)):\n\tif word[x]==test[j]:\n\t\tj+=1\n\t\ttrue+=1\n\tif j==5:\n\t\tbreak\n\t\t\nif true==5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t\n \t\t\t\t\t\t\t \t \t \t \t\t \t\t", "import sys\r\n\r\ndef is_string_Contains(base,target):\r\n base_index = 0\r\n base_length = len(base)\r\n for char in target:\r\n if char == base[base_index]:\r\n base_index +=1\r\n if base_index == base_length:\r\n return True\r\n \r\n return False\r\n\r\ndef ishelloWord(pattern):\r\n base_string = \"hello\"\r\n return is_string_Contains(base_string,pattern)\r\n\r\nhello_word = input().strip()\r\n\r\nis_hello = ishelloWord(hello_word)\r\nprint(\"YES\" if is_hello else \"NO\")", "s=input()\r\ntemp=count=Z=0\r\nfor i in range(len(s)):\r\n if s[i]=='h':\r\n temp=i\r\n count+=1\r\n break\r\nfor j in range(temp+1,len(s)):\r\n if s[j]=='e':\r\n temp=j\r\n count+=1\r\n break\r\nfor k in range(temp+1,len(s)):\r\n if s[k]=='l':\r\n temp=k\r\n count+=1\r\n break\r\nfor l in range(temp+1,len(s)):\r\n if s[l]=='l':\r\n temp=l\r\n count+=1\r\n break\r\nfor m in range(temp+1,len(s)):\r\n if s[m]=='o':\r\n Z=1\r\n count+=1\r\n break\r\nif Z==1 and count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "s = input()\r\nd = \"\"\r\n\r\nif len(s) < 5:\r\n\tprint(\"NO\")\r\nelse:\r\n\tchars = [\"h\", \"e\", \"l\", \"l\", \"o\",1]\r\n\r\n\tc = 0\r\n\r\n\tfor i in s:\r\n\t\tif i == chars[c]:\r\n\t\t\td += i\r\n\t\t\tc += 1\r\n\r\n\tif d == \"hello\":\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "s = input()\r\nh = s.find('h')\r\ne = s.find('e', h + 1)\r\nl = s.find('l', e + 1)\r\nl2 = s.find('l', l + 1)\r\no = s.find('o', l2 + 1)\r\na = (h + 1) * e * l * l2 * o\r\nif a > 0 and e > 0 and l > 0 and l2 > 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "string=input()\r\nhello=\"hello \"\r\ni=0\r\nfor letter in string:\r\n if letter==hello[i]:\r\n i=i+1\r\nif i==5:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "s=input()\r\nk=0\r\nfor i in range(len(s)):\r\n if s[i]=='h':\r\n for r in range(i+1,len(s)):\r\n if s[r]=='e':\r\n for e in range(r+1, len(s)):\r\n if s[e]=='l':\r\n for w in range(e+1, len(s)):\r\n if s[w]=='l':\r\n for q in range(w+1, len(s)):\r\n if s[q]=='o':\r\n k+=1\r\nif k>0:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nd=0\r\nfor i in range(len(s)):\r\n if(s[i]=='h' and d==0):\r\n d=1\r\n elif(s[i]=='e' and d==1):\r\n d=2\r\n elif(s[i]=='l' and d==2):\r\n d=3\r\n elif(s[i]=='l' and d==3):\r\n d=4\r\n elif(s[i]=='o' and d==4):\r\n d=5\r\nif(d==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "line = input();\r\nh = \"hello\";\r\ny = 0;\r\na = - 1;\r\nfor i in range(0,len(h),1):\r\n for j in range(a + 1,len(line),1):\r\n if line[j] == h[i]:\r\n a = j;\r\n y += 1;\r\n break;\r\n\r\n\r\n\r\n\r\n\r\n\r\nif y == 5:\r\n print(\"YES\");\r\nelse:\r\n print(\"NO\");\r\n \r\n\r\n", "word = input()\nflagLetters = 1\nfor x in word:\n if flagLetters == 1:\n if x == 'h':\n flagLetters += 1\n elif flagLetters == 2:\n if x == 'e':\n flagLetters += 1\n elif flagLetters == 3:\n if x == 'l':\n flagLetters += 1\n elif flagLetters == 4:\n if x == 'l':\n flagLetters += 1\n elif flagLetters == 5:\n if x == 'o':\n flagLetters += 1\n\nif flagLetters == 6:\n print('YES')\nelse:\n print('NO')\n", "s=input()\r\n\r\n\r\ndef solve(c):\r\n\tindex=0\r\n\tstr=\"hello\"\r\n\tfor i in range(0, len(c)):\r\n\t\tif index==5:\r\n\t\t\treturn \"YES\"\r\n\t\telif c[i]==str[index]:\r\n\t\t\tindex+=1\r\n\tif index==5:\r\n\t\treturn \"YES\"\r\n\telse :\r\n\t\treturn \"NO\"\r\n\t\t\r\nprint(solve(s))", "import sys \r\n\r\ndef chatroom(s):\r\n sIndex = 0\r\n sub = 'hello'\r\n subIndex = 0\r\n\r\n while sIndex < len(s):\r\n if s[sIndex] == sub[subIndex]:\r\n subIndex += 1\r\n if subIndex == len(sub):\r\n break\r\n sIndex += 1\r\n \r\n if subIndex == len(sub):\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n\r\ndef main():\r\n s = sys.stdin.readline().strip()\r\n result = chatroom(s)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s=input()\r\nm='hello'\r\nx=0\r\ni=0\r\nfor i in range(len(s)):\r\n if x>=5:\r\n break\r\n elif s[i]==m[x]:\r\n x += 1\r\nif x==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "hello = \"hello\"\ni = 0\nfor c in input():\n if c == hello[i]:\n i += 1\n if i >= len(hello):\n print(\"YES\")\n break\nelse:\n print(\"NO\")", "n = 1\r\nfor test in range(n):\r\n a = input()\r\n\r\n if 'h' in a:\r\n ind_h = a.index('h')\r\n a = a[ind_h+1:]\r\n else:\r\n print('NO')\r\n continue\r\n #a = a[ind_h+1:]\r\n\r\n\r\n if 'e' in a:\r\n ind_h = a.index('e')\r\n a = a[ind_h+1:]\r\n else:\r\n print('NO')\r\n continue\r\n \r\n if 'l' in a:\r\n ind_h = a.index('l')\r\n a = a[ind_h+1:]\r\n else:\r\n print('NO')\r\n continue\r\n\r\n if 'l' in a:\r\n ind_h = a.index('l')\r\n a = a[ind_h+1:]\r\n else:\r\n print('NO')\r\n continue\r\n\r\n\r\n if 'o' in a:\r\n ind_h = a.index('o')\r\n a = a[ind_h+1:]\r\n else:\r\n print('NO')\r\n continue\r\n\r\n print('YES')", "def search(letter,lst,num):\r\n for _ in lst:\r\n if letter==_:\r\n lst=lst[lst.index(_)+1:]\r\n num+=1\r\n break\r\n return lst,num\r\n\r\ns=list(input())\r\nnum=0\r\nfor _ in ['h','e','l','l','o']:\r\n s,num=search(_,s,num)\r\nif num==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "word = input()\r\nhello = \"hello\"\r\nans = []\r\ncounter = 0\r\nfor i in word:\r\n if counter >= 5:\r\n break\r\n if i == hello[counter]:\r\n ans.append(i)\r\n counter += 1\r\nif(''.join(ans) == hello):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=iter(input())\r\nst=''\r\nfor i in 'hello':\r\n if i in s:\r\n st+=i\r\nif st=='hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "string=\"hello\"\nword=input()\n\nj=0\nx=5\nfor i in range(len(word)):\n if word[i]==string[j]:\n x-=1\n if (j!=4):\n j+=1\n if (x==0) :\n break\nif x==0:\n print(\"YES\") \nelse:\n print(\"NO\")", "s=input('')\r\na=\"hello\"\r\ncount=0\r\nj=0\r\nfor i in range(0,len(s),1):\r\n if s[i]== a[j]:\r\n count+=1\r\n j+=1\r\n if (count==5):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "import re\r\nn = input()\r\nif re.search('h.*e.*l.*l.*o',n):\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nk=0\r\nfor i in range(len(a)):\r\n if k==0:\r\n if a[i]=='h':\r\n k+=1\r\n elif k==1:\r\n if a[i]=='e':\r\n k+=1\r\n elif k==2:\r\n if a[i]=='l':\r\n k+=1\r\n elif k==3:\r\n if a[i]=='l':\r\n k+=1\r\n elif k==4:\r\n if a[i]=='o':\r\n k+=1\r\n break\r\nif k==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\n\r\nword = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nindex = 0\r\n\r\nfor i in s:\r\n if i == word[index]:\r\n index += 1\r\n if index == 5:\r\n break\r\n\r\nif index == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nl=[]\r\nfor i in a:\r\n\tif len(l)==0 and i==\"h\":\r\n\t\tl.append(i)\r\n\telif len(l)==1 and i==\"e\":\r\n\t\tl.append(i)\r\n\telif len(l)==2 and i==\"l\":\r\n\t\tl.append(i)\r\n\telif len(l)==3 and i==\"l\":\r\n\t\tl.append(i)\r\n\telif len(l)==4 and i==\"o\":\r\n\t\tl.append(i)\r\nif len(l)==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "if __name__ == '__main__':\r\n s = input()\r\n t = 'hello'\r\n i = 0\r\n ans = False\r\n for c in s:\r\n if c == t[i]:\r\n i += 1\r\n if i == len(t):\r\n ans = True\r\n break\r\n print('YES' if ans else 'NO')", "str=input()\r\nstr2='hello'\r\nl=0\r\nj=0\r\nfor i in range(len(str)):\r\n if str[i]==str2[j]:\r\n l+=1\r\n j+=1\r\n if l==5:\r\n break\r\n else:\r\n pass\r\nif l==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nn=len(s)\r\na=['h','e','l','l','o','fsdbhbdsjhcdbjhbjfsbhjfb']\r\nc,d=0,False\r\nfor i in range(0,n):\r\n\tif s[i]==a[c]:\r\n\t\tc+=1\r\n\tif c==5:\r\n\t\td=True\r\n\t\tbreak\r\nif d:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "from sys import stdin\r\nimport re\r\n\r\ndef main():\r\n word = stdin.readline().strip()\r\n pattern = re.compile(\"[h](.*)[e](.*)[l](.*)[l](.*)[o]\")\r\n while word != \"\":\r\n match = re.search(pattern, word)\r\n if match:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n word = stdin.readline().strip()\r\n \r\n \r\nmain()\r\n", "s = input()\r\nl = ['h','e','l','l','o']\r\ni = j = 0\r\nwhile i < 5 and j < len(s):\r\n\tif s[j] == l[i]:\r\n\t\ti += 1\r\n\tj += 1\r\nif(i<5):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n", "list=input()\r\nres=[]\r\nq=len(list)\r\n\r\nfor i in range(len(list)):\r\n\tif list[i]==\"h\":\r\n\t\tfor j in range(i+1,q):\r\n\t\t\tif list[j]==\"e\":\r\n\t\t\t\tfor k in range(j+1,q):\r\n\t\t\t\t\tif list[k]==\"l\":\r\n\t\t\t\t\t\tfor l in range(k+1,q):\r\n\t\t\t\t\t\t\tif list[l]==\"l\":\r\n\t\t\t\t\t\t\t\tfor m in range(l+1,q):\r\n\t\t\t\t\t\t\t\t\tif list[m]==\"o\":\r\n\t\t\t\t\t\t\t\t\t\tres.append(\"YES\")\r\n\r\nres.append(\"NO\")\r\nif len(res)==1 or len(list)<5:\r\n\tprint(\"NO\")\r\nif len(res)>1:\r\n\tprint(\"YES\")\r\n", "l = input()\r\nh=\"hello\"\r\nj=0\r\nfor i in l:\r\n if i == h[j]:\r\n j+=1\r\n if j == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s = input()\r\nword = 'hello'\r\nc = 0\r\nfor i in s:\r\n if i == word[c]:\r\n c+=1\r\n if c == 5:\r\n print('YES')\r\n exit()\r\nprint('NO')", "s = input()\r\ntarget = \"hello\"\r\n\r\ncount = 0\r\nwhile target and count < len(s):\r\n if s[count] == target[0]:\r\n target = target[1:]\r\n count += 1\r\n\r\nif target:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "a=input()\r\nf=0\r\ns=\"hello\"\r\nx=0\r\nfor i in a:\r\n if (i==s[x]):\r\n x+=1\r\n if(x==len(s)):\r\n print('YES')\r\n f=1\r\n break\r\nif(f==0): \r\n print('NO')", "s = input().strip()\r\n\r\ni = 0 \r\nhello = \"hello\"\r\n\r\nfor h in s:\r\n if h == hello[i]:\r\n i+=1 \r\n \r\n if i == len(hello):\r\n print('YES')\r\n break \r\n \r\nif i < len(hello):\r\n print(\"NO\")\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n ", "import re\r\nprint([\"NO\",\"YES\"][re.match(\".*h+.*e+.*l+.*l+.*o+\",input())!=None])", "import re\ns = input()\nif re.search('h.*e.*l.*l.*o', s):\n\tprint('YES')\nelse:\n\tprint('NO')\n", "s = [i for i in input()]\r\nh = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nfor i in h:\r\n if i in s:\r\n idx = s.index(i) + 1\r\n s = s[idx:]\r\n if i == 'o':\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break", "import sys\r\nimport math\r\ns = input()\r\nflag = True\r\n\r\nif \"h\" in s:\r\n h = s.index(\"h\")\r\n q = s[h+1:]\r\n if \"e\" in q:\r\n e = q.index(\"e\")\r\n q = q[e+1:]\r\n if \"l\" in q:\r\n l1 = q.index(\"l\")\r\n q = q[l1+1:]\r\n if \"l\" in q:\r\n l2 = q.index(\"l\")\r\n q = q[l2+1:]\r\n if \"o\" in q:\r\n print(\"YES\")\r\n sys.exit()\r\n\r\nelse:\r\n print(\"NO\")\r\n sys.exit()\r\n\r\nprint(\"NO\")", "a=input()\r\nh=0\r\nfor i in range(len(a)):\r\n if(a[i]=='h' and h==0):\r\n h=1\r\n elif(a[i]=='e' and h==1):\r\n h=2\r\n elif(a[i]=='l' and h==2):\r\n h=3\r\n elif(a[i]=='l' and h==3):\r\n h=4\r\n elif(a[i]=='o' and h==4):\r\n print(\"YES\")\r\n break\r\n else:\r\n continue\r\nelse:\r\n print(\"NO\")", "def solve(s, msg):\r\n i = 0\r\n for c in s:\r\n if msg[i] == c:\r\n i += 1\r\n if i == len(msg): return 'YES'\r\n return 'NO'\r\n \r\n \r\n\r\nif __name__ == \"__main__\":\r\n s = input()\r\n msg = 'hello'\r\n res = solve(s, msg)\r\n print(res)", "a=input()\nb=\"\"\nfor i in range(len(a)):\n if a[i]=='h':\n b=b+a[i]\n a=a.replace('h','')\n a=a[i:]\n break\n#print(a)\nfor i in range(len(a)):\n if a[i]=='e':\n b=b+a[i]\n a=a.replace('e','')\n a=a[i:]\n break\n#print(a)\nfor i in range(len(a)):\n if a[i]=='l':\n b=b+a[i]\n a=a[i+1:]\n break\n#print(a)\nfor i in range(len(a)):\n if a[i]=='l':\n b=b+a[i]\n a=a.replace('l','')\n a=a[i:]\n break\nfor i in range(len(a)):\n if a[i]=='o':\n b=b+a[i]\n a=a.replace('o','')\n break\nif b=='hello':\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t \t \t", "\r\na = 'hello'\r\nb = [False]*5\r\nk = 0\r\n\r\ns = input()\r\n\r\nfor i in s:\r\n if i == a[k]:\r\n b[k] = True\r\n k += 1\r\n if k == 5:\r\n break\r\nif False not in b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ntop = 0\r\nfor i in s:\r\n if top > 4:\r\n break\r\n if 'hello'[top] == i:\r\n top += 1\r\n\r\nif top > 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\ncount=0\r\nfor i in a:\r\n if i=='h' and count==0:\r\n count=1\r\n elif i=='e' and count==1:\r\n count=2\r\n elif i=='l' and count==2:\r\n count=3\r\n elif i=='l' and count==3:\r\n count=4\r\n elif i=='o' and count==4:\r\n print(\"YES\")\r\n count=5\r\n break\r\nif count!=5:\r\n print(\"NO\")\r\n", "letras = 0\r\npalabra=str(input())\r\nfor i in range(len(palabra)):\r\n if( palabra[i] == \"h\" and letras == 0):\r\n letras +=1\r\n elif( palabra[i] == \"e\" and letras == 1):\r\n letras +=1\r\n elif( palabra[i] == \"l\" and letras == 2):\r\n letras +=1\r\n elif( palabra[i] == \"l\" and letras == 3):\r\n letras +=1\r\n elif( palabra[i] == \"o\" and letras == 4):\r\n letras +=1\r\nif(letras == 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\nx=''\nfor t in s:\n\tif x=='hello':\n\t\tbreak\n\telif x=='hell' and t=='o':\n\t\tx+='o'\n\telif x=='hel' and t=='l':\n\t\tx+='l'\n\telif x=='he' and t=='l':\n\t\tx+='l'\n\telif x=='h' and t=='e':\n\t\tx+='e'\n\telif x=='' and t=='h':\n\t\tx+='h'\nif x=='hello':\n\tprint('YES')\nelse:\n\tprint('NO')\n", "n = input()\nls2=[]\ncount=0\n\nfor i in range(len(n)):\n if n[i] == \"h\":\n ls2.append(n[i])\n count = i\n break\nfor i in range(count+1,len(n)):\n if n[i] == \"e\":\n ls2.append(n[i])\n count = i\n break\nfor i in range(count+1,len(n)):\n if n[i] == \"l\":\n ls2.append(n[i])\n count = i\n break\nfor i in range(count+1,len(n)):\n if n[i] == \"l\":\n ls2.append(n[i])\n count = i\n break\nfor i in range(count+1,len(n)):\n if n[i] == \"o\":\n ls2.append(n[i])\n count = i\n break\nif 'hello' in ''.join(ls2):\n print('YES')\nelse:\n print('NO')", "s=input()\r\nidx=0\r\nfor ch in s:\r\n if ch=='h' and idx==0:\r\n idx+=1\r\n elif ch=='e' and idx==1:\r\n idx+=1\r\n elif ch=='l' and idx==2:\r\n idx+=1\r\n elif ch=='l' and idx==3:\r\n idx+=1\r\n elif ch=='o' and idx==4:\r\n idx+=1\r\nif idx==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "s=input()\r\nx=\"\"\r\nc=0\r\np=0\r\nfor i in s :\r\n if i==\"h\" and p==0:\r\n x+=i\r\n p+=1\r\n elif i==\"e\" and p==1:\r\n x+=i\r\n p+=1\r\n elif i==\"l\" and p==2 or p==3:\r\n x+=i\r\n p+=1\r\n elif i==\"o\" and p==4:\r\n x+=i\r\n p+=1\r\nif p==5:\r\n print(\"YES\")\r\nelse:print(\"NO\")", "import re\r\nmsg = input()\r\nif(re.search(\"h.*e.*l.*l.*o\",msg)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ntarget = 'hello'\r\nindex = 0\r\nfor i in s:\r\n if i == target[index]:\r\n index+=1\r\n if index == 5:\r\n print('YES')\r\n quit()\r\nprint('NO')\r\n", "s = input()\r\nindices = [0, 0, 0, 0, 0]\r\nfor char in s:\r\n if char == \"h\" and indices[0] == 0:\r\n indices[0] = 1\r\n elif char == \"e\" and indices[0] == 1 and indices[1] == 0:\r\n indices[1] = 1\r\n elif char == \"l\" and indices[1] == 1 and indices[2] == 0:\r\n indices[2] = 1\r\n elif char == \"l\" and indices[2] == 1 and indices[3] == 0:\r\n indices[3] = 1\r\n elif char == \"o\" and indices[3] == 1 and indices[4] == 0:\r\n indices[4] = 1\r\nif indices == [1, 1, 1, 1, 1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "'''程文奇 2100015898'''\r\nimport re\r\nif re.findall(r'h.*e.*l.*l.*o',input()):\r\n print('YES')\r\nelse:\r\n print('NO')", "ref_string = \"hello\"\ninp = input()\n\np1 = 0\nfor p2 in range(len(inp)):\n if ref_string[p1] == inp[p2]:\n p1 += 1\n if p1 == len(ref_string):\n break\nif p1 == len(ref_string):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s = input()\r\nindex = 0\r\nb = 0\r\nif \"h\" in s:\r\n index += s.index(\"h\") + 1\r\n if \"e\" in s[index:]:\r\n index += s[index:].index(\"e\") + 1\r\n if \"l\" in s[index:]:\r\n index += s[index:].index(\"l\") + 1\r\n if \"l\" in s[index:]:\r\n index += s[index:].index(\"l\") + 1\r\n if \"o\" in s[index:]:\r\n b = 1\r\nif b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\ns = list(s)\r\n\r\nl = ['h','e','l','l','o']\r\nstat = 0\r\nfor x in l :\r\n for y in range(len(s)) :\r\n if x == s[y] :\r\n del s[:y+1]\r\n break\r\n else :\r\n stat = 1\r\n break\r\n\r\nif stat == 1 :\r\n print('NO')\r\nelse :\r\n print('YES')", "s = input()\r\ni = 0\r\nj = 0\r\nk = \"hello\"\r\nwhile j < 5 and len(s) != i:\r\n if s[i] == k[j]:\r\n j += 1\r\n i += 1\r\nif j == 5 :\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "s= input()\r\nn = len(s)\r\nf =0\r\nc = \"hello\"\r\ncount = 0\r\nfor i in range(n):\r\n\tif s[i] == c[count]:\r\n\t\tcount+=1\r\n\tif count == 5:\r\n\t\tf = 1\r\n\t\tbreak\r\nif f:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a=list(input())\r\nl=[]\r\nYE=0\r\nfor i in range(0,len(a)):\r\n if a[i]==\"h\" :\r\n l.append(a[i])\r\n if a[i]==\"e\" :\r\n l.append(a[i])\r\n if a[i]==\"l\" :\r\n l.append(a[i])\r\n if a[i]==\"o\" :\r\n l.append(a[i])\r\nfor x in range(0,len(l)):\r\n if l[x]==\"h\":\r\n s=x\r\n for x in range(s+1,len(l)):\r\n if l[x]==\"e\":\r\n s=x\r\n for x in range(s+1,len(l)):\r\n if l[x]==\"l\":\r\n s=x\r\n for x in range(s+1,len(l)):\r\n if l[x]==\"l\":\r\n s=x\r\n for x in range(s+1,len(l)):\r\n if l[x]==\"o\":\r\n YE=1\r\n break\r\n else:\r\n continue\r\n break\r\n else:\r\n continue\r\n break\r\n else:\r\n continue\r\n break\r\n else:\r\n continue\r\n break\r\n else:\r\n continue\r\nif YE==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nhello='hello'\r\nj=0\r\nans=0\r\nfor i in s:\r\n try:\r\n if i==hello[j]:\r\n ans+=1\r\n j+=1\r\n except:\r\n break\r\nif ans==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=\"hello\"\r\nx=input()\r\ny=0\r\nfor i in x:\r\n if y==5:\r\n break\r\n elif i==a[y]:\r\n y+=1\r\n\r\nif y!=5:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s=input()\r\nword='hello'\r\nindex=0\r\nmatch=True\r\nfor c in word:\r\n index=s.find(c,index)+1\r\n if not index:\r\n match=False\r\n break\r\nif match:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\ntry:\r\n a = s.index('h')\r\n a = s[a+1:len(s)]\r\n b = a.index('e')\r\n a = a[b+1:len(a)]\r\n c = a.index('l')\r\n a = a[c+1:len(a)]\r\n d = a.index('l')\r\n a = a[d+1:len(a)]\r\n e = a.index('o')\r\nexcept:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def isHello(string1, string2, m, n):\r\n if m == 0: return True\r\n if n == 0: return False\r\n if string1[m-1] == string2[n-1]:\r\n return isHello(string1, string2, m-1, n-1)\r\n return isHello(string1, string2, m, n-1)\r\n\r\ns = input()\r\nword = \"hello\"\r\nprint(\"YES\" if isHello(word,s,len(word),len(s)) else \"NO\")", "s = input()\r\n\r\nif len(s) > 0 and len(s) < 101:\r\n if s.find('h') != -1:\r\n h1 = s.find('h')\r\n if s.find('e',h1) != -1:\r\n e1 = s.find('e',h1)\r\n if s.find('l', e1) != -1:\r\n l1 = s.find('l',e1)\r\n if s.find('l', l1+1) != -1:\r\n l2 = s.find('l',l1)\r\n if s.find('o', l2) != -1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n", "a=str(input())\r\nhelo=['h', 'e', 'l', 'l', 'o']\r\ni=-1\r\nfor t in helo:\r\n i=a.find(t, i+1)\r\n if i==-1:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "str = input()\r\nstr = list(str)\r\nlength = len(str)\r\nstr2 = 'hello'\r\nj = 0\r\ncount = 0\r\n\r\nfor i in range(length):\r\n if str[i] == str2[j]:\r\n j += 1\r\n count += 1\r\n if count == 5:\r\n break\r\n\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\nn=list(n)\na=['h','e','l','l','o']\n# a=input()\n# a=list(a)\ni=j=0\nwhile i!=len(n) and j!=len(a):\n if n[i]==a[j]:\n i+=1\n j+=1\n else:\n i+=1\nif j==len(a):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t\t\t \t\t\t\t\t\t \t\t \t \t", "s = str(input())\nm = 'hello'\ny = 0\nfor i in s:\n\tif y!=5 and m[y] == i:\n\t\ty+=1\n\tif y==5:\n\t\tbreak\nif y>=5:\n\tprint('YES')\nelse:\n\tprint('NO')", "s = input()\r\nflag = 0\r\nfor c in s:\r\n if c == 'h' and flag == 0:\r\n flag += 1\r\n if c == 'e' and flag == 1:\r\n flag += 1\r\n if c == 'l' and flag > 1 and flag < 4:\r\n flag += 1\r\n if c == 'o' and flag == 4:\r\n flag += 1\r\nif flag == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\n\r\ns=sys.stdin.readline().strip()\r\nt=[]\r\nx=0\r\nj=0\r\ncount=0\r\nl=len(s)\r\nfor i in range(l):\r\n if s[i]=='h':\r\n x=i\r\n t.append(i)\r\n j+=1\r\n break\r\nfor i in range(x+1,l):\r\n if s[i]=='e':\r\n x=i\r\n t.append(i)\r\n j+=1\r\n break\r\nfor i in range(x+1,l):\r\n if s[i]=='l':\r\n x=i\r\n t.append(i)\r\n j+=1\r\n break\r\nfor i in range(x+1,l):\r\n if s[i]=='l':\r\n x=i\r\n t.append(i)\r\n j+=1\r\n break\r\nfor i in range(x+1,l):\r\n if s[i]=='o':\r\n x=i\r\n t.append(i)\r\n j+=1\r\n break\r\n\r\nfor i in range(j-1):\r\n if t[i]<t[i+1]:\r\n count+=1\r\nif count==4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\nword = 'hello'\r\n\r\nfor i in s:\r\n if not word:\r\n break\r\n if i == word[0]:\r\n word = word[1:]\r\n\r\n\r\nprint('NO' if word else 'YES')", "def check_hello(word):\r\n hello = \"hello\"\r\n i = 0\r\n j = 0\r\n for i in range(len(word)):\r\n if j < len(hello) and word[i] == hello[j]:\r\n j += 1\r\n return j == len(hello)\r\n\r\nword = input()\r\n\r\nif check_hello(word):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nx=\"hello\"\r\ns=\"\"\r\nc=0\r\nfor i in n:\r\n if i==x[c]:\r\n c+=1\r\n s+=i\r\n if c==5:\r\n break\r\nif s==x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=str(input())\r\nstring=\"hello\"\r\nc=0\r\nj=0\r\nfor i in range(len(s)):\r\n if s[i]==string[j]:\r\n j+=1\r\n c+=1\r\n if c==5:\r\n break\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "hello=['h','e','l','l','o']\r\ns = input()\r\ns = list(s)\r\np = 0\r\nt = False\r\nfor i in range(0,len(s)):\r\n if s[i] == hello[p]:\r\n p=p+1\r\n if p == 5 :\r\n print(\"YES\")\r\n t = True\r\n break\r\n \r\nif t == False:\r\n print(\"NO\")\r\n", "a = list(input().lower())\ns = list('hello')\ni = 0\nskip = 0\nwhile i < len(a)-1:\n if a[i] == a[i+1]:\n if a[i] == 'l' and skip == 0:\n i += 1\n skip = 1\n continue\n del a[i+1]\n else:\n i += 1\nj = 0\nwhile j < len(a) and len(s) > 0:\n if s[0] == a[j]:\n del s[0]\n j += 1\n continue\n j += 1\nif len(s) > 0:\n print('NO')\nelse:\n print('YES')\n", "hello = \"hello\"\r\ns = str(input())\r\n\r\n\r\ndef chat_room (data):\r\n x = 0\r\n for i in range(len(s)):\r\n if x == 5:\r\n return \"YES\"\r\n if s[i] == hello[x]:\r\n x += 1\r\n if x >= 5:\r\n return \"YES\"\r\n else: return \"NO\"\r\n\r\n\r\nprint(chat_room(s))", "s=input().lower()\r\nc=0\r\nfor i in s:\r\n if i=='h' and c==0:\r\n c+=1\r\n elif i=='e' and c==1:\r\n c+=1\r\n elif i=='l' and (c==2 or c==3):\r\n c+=1\r\n elif i=='o' and c==4:\r\n c+=1\r\nif c==5: print(\"YES\")\r\nelse: print(\"NO\") ", "l=\"hello\"\r\ns=input()\r\nj=0\r\nfor i in range(len(s)):\r\n if s[i]==l[j]:\r\n j+=1\r\n \r\n if j==5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nv=\"hello\"\r\nk,c=0,0\r\nfor i in range(len(s)):\r\n if s[i]==v[k]:\r\n c=c+1\r\n k=k+1\r\n if c==5:\r\n break\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "strin=input()\r\nstrHello=\"hello\"\r\nindex=0\r\nh=False\r\ne=False\r\nl1=False\r\nl2=False\r\no=False\r\n\r\nfor index in range(0,len(strin)):\r\n\tif(not h and strin[index]=='h'):\r\n\t\th=True\r\n\t\tcontinue\r\n\tif(h and not e and strin[index]=='e'):\r\n\t\te=True\r\n\t\tcontinue\r\n\tif(h and e and not l1 and strin[index]=='l'):\r\n\t\tl1=True\r\n\t\tcontinue\r\n\tif(h and e and l1 and not l2 and strin[index]=='l'):\r\n\t\tl2=True;\r\n\t\tcontinue\r\n\tif(h and e and l1 and l2 and strin[index]=='o'):\r\n\t\to=True\r\n\t\tbreak;\r\n\t\t\r\nif(h and e and l1 and l2 and o):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "#P58A\n\nimport re\ns = input()\nprint('YES' if re.match(r'^.*h.*e.*l.*l.*o.*$', s) else 'NO')\n", "s=input()\r\nli=['h','e','l','l','o']\r\nfor i in range(len(s)):\r\n if(li[0]==s[i]):\r\n del li[0]\r\n if(li==[]):\r\n print(\"YES\")\r\n exit()\r\nprint('NO')", "w = input().strip()\r\n\r\ne_l = ['h', 'e', 'l', 'l', 'o']\r\nc_l = 0\r\n\r\nfor c in w:\r\n if c == e_l[c_l]:\r\n c_l += 1\r\n if c_l == len(e_l):\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n", "s = input()\r\nvar = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'h':\r\n for j in range(i+1, len(s)):\r\n if s[j] == 'e':\r\n for k in range(j+1, len(s)):\r\n if s[k] == 'l':\r\n for l in range(k+1, len(s)):\r\n if s[l] == 'l':\r\n for m in range(l+1, len(s)):\r\n if s[m] == 'o':\r\n var = 1\r\n break \r\nif var == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "a=\"hello\"\ns=str(input())\ncur=0\nfor i in s:\n if i==a[cur]:cur+=1\n if cur==5:break\nif cur>=5:print(\"YES\")\nelse:print(\"NO\")", "word = input()\r\n\r\ncnt = 0\r\nfor x in word:\r\n if x =='h' and cnt ==0 :\r\n cnt+=1\r\n else:\r\n if x=='e' and cnt==1:\r\n cnt+=1\r\n else:\r\n if x == 'l' and (cnt ==2 or cnt ==3):\r\n cnt+=1\r\n else:\r\n if x=='o' and cnt==4:\r\n cnt+=1\r\nif cnt == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\ns = input()\r\nif re.search(r'h.*?e.*?l.*?l.*?o',s):\r\n print('YES')\r\nelse:\r\n print('NO')", "import math\r\nst=''\r\ndef func(s):\r\n i=0\r\n p='hello'\r\n j=0\r\n n=len(s)\r\n while i<n and j<5:\r\n if s[i]==p[j]:\r\n j+=1\r\n i+=1\r\n if j==5:\r\n return ('YES')\r\n return 'NO'\r\n\r\n\r\n\r\n\r\n\r\nfor _ in range(1):#int(input())):\r\n #x,y,z=map(int,input().split())\r\n #n = int(input())\r\n #l1=[]\r\n #inp=input().split()\r\n s=input()\r\n #l1=list(map(int,input().split()))\r\n #l2 = list(map(int, input().split()))\r\n #l1=input().split()\r\n #l2=input().split()\r\n st+=str(func(s))+'\\n'\r\n\r\nprint(st)\r\n\r\n", "s=input()\r\nishello=False\r\nish=False\r\nise=False\r\nisl1=False\r\nisl2=False\r\niso=False\r\nfor i in range(len(s)):\r\n if s[i]=='h':\r\n ish=True\r\n s=s[i+1:]\r\n break\r\nfor i in range(len(s)):\r\n if s[i]=='e':\r\n ise=True\r\n s=s[i+1:]\r\n break\r\nfor i in range(len(s)):\r\n if s[i]=='l':\r\n isl1=True\r\n s=s[i+1:]\r\n break\r\nfor i in range(len(s)):\r\n if s[i]=='l':\r\n isl2=True\r\n s=s[i+1:]\r\n break\r\nfor i in range(len(s)):\r\n if s[i]=='o':\r\n iso=True\r\n s=s[i+1:]\r\n break\r\nishello=ish and ise and isl1 and isl2 and iso\r\nif ishello :\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# n=int(input())\r\n# n,k=map(int,input().split())\r\n# arr=list(map(int,input().split()))\r\n#ls=list(map(int,input().split()))\r\n#for i in range(m):\r\n# for _ in range(int(input())):\r\n#from collections import Counter\r\n#from fractions import Fraction\r\ns=iter(input())\r\nt=\"hello\"\r\nprint(\"YES\" if all(c in s for c in t) else \"NO\")", "s1 = input()\r\ns2 = \"hello\"\r\nj = 0\r\ncount = 0 \r\nfor i in range(len(s1)):\r\n if s1[i] == s2[j]:\r\n j+=1\r\n count+=1\r\n if count == len(s2): print(\"YES\"); exit()\r\nprint(\"NO\")", "s=input()\r\ns1=len(s)\r\nl=['h','e','l','l','o']\r\ni,j,r=0,0,0\r\n\r\nwhile(i<s1 and r!=5):\r\n if(s[i]==l[j]):\r\n j+=1\r\n r+=1\r\n i+=1\r\n\r\nif(r==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=input()\nh=\"hello\"\nc=0\nfor i in x:\n if i==h[c]:\n c+=1\n if c==5:\n break\nif c==5:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t\t \t \t\t\t \t\t \t \t\t \t\t\t\t", "s=input()\r\nl=['h','e','l','l','o']\r\nj=0\r\nc=0\r\nfor i in range(len(s)):\r\n if(s[i]==l[j]):\r\n j=j+1\r\n c+=1\r\n if(j==5):\r\n break\r\n else:\r\n continue\r\nif(c==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ns1='hello'\r\ni=0\r\nj=0\r\nwhile(i<len(s1) and j<len(s)):\r\n if s1[i]==s[j]:\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\nif i==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m=str(input())\nh='hello'\n\nj=0\nn=0\nfor i in range(len(m)):\n if(m[i]==h[j]):\n j+=1\n if(j==5):\n break\nif(j==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \n", "s1=input()\r\n\r\ns2=\"hello\"\r\ni=0\r\nj=0\r\nflag=0\r\nwhile(i<len(s1)):\r\n if(s1[i]==s2[j]):\r\n i+=1\r\n j+=1\r\n if(j==len(s2)):\r\n flag=1\r\n break\r\n else:\r\n i+=1\r\nif(flag==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nif 'h' in n and 'e' in n and 'l' in n and 'o' in n:\r\n h_index=n.index('h')\r\n while(1):\r\n if 'e' in n[h_index+1:]:\r\n e_index=n.index('e',h_index+1)\r\n else:\r\n print(\"NO\")\r\n break\r\n if 'l' in n[e_index+1:]:\r\n l1_index=n.index('l',e_index+1)\r\n else:\r\n print(\"NO\")\r\n break\r\n if 'l' in n[l1_index+1:]:\r\n l2_index=n.index('l',l1_index+1)\r\n else:\r\n print(\"NO\")\r\n break\r\n if 'o' in n[l2_index+1:]:\r\n o_index=n.index('o',l2_index+1)\r\n else:\r\n print(\"NO\")\r\n break\r\n if h_index<e_index<l1_index<l2_index<o_index:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\r\nh,e,l,l2,o = 0,0,0,0,0\r\nif n.find(\"h\") >= 0:\r\n h = n[n.find(\"h\")+1:]\r\n if h.find(\"e\") >= 0:\r\n e = h[h.find(\"e\")+1:]\r\n if e.find(\"l\") >= 0:\r\n l = e[e.find(\"l\")+1:]\r\n if l.find(\"l\") >= 0:\r\n li = l[l.find(\"l\")+1:]\r\n if li.find(\"o\") >= 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s = input()\r\nt = \"hello\"\r\nx = 0\r\ny = 0\r\nwhile x<len(t):\r\n if y>=len(s):\r\n print(\"NO\")\r\n break\r\n elif s[y]==t[x]:\r\n x+=1\r\n y+=1\r\nelse:\r\n print(\"YES\")\r\n ", "def subSequence(s1, s2):\n n, m = len(s1), len(s2)\n i, j = 0, 0\n while(i<n and j<m):\n if (s1[i] == s2[j]):\n i+=1\n j+=1\n return i == n\ns1 = 'hello'\ns2 = input()\nif subSequence(s1, s2):\n print('YES')\nelse:\n print('NO')\n \t\t \t \t \t \t\t\t\t \t \t\t\t\t\t", "p = [*input()]\r\na = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\ncount = 0;\r\nfor i in range(len(p)):\r\n if (p[i] == a[count]):\r\n count+=1;\r\n if (count >4):\r\n break\r\nif (count>4):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "pattern = 'hello'\nwords = []\ni = 0\nfor c in input():\n if c == 'h':\n words.append(c)\n for i in range(len(words)):\n if words[i] + c in pattern:\n words[i] += c\nif 'hello' in words:\n print('YES')\nelse:\n print('NO')\n", "s = input()\r\nfindh , finde , findl , findl1 , findo = False , False , False,False , False\r\nfor i in range(len(s)):\r\n if s[i] == 'h' and not findh:\r\n findh = True\r\n elif s[i] == 'e' and not finde and findh:\r\n finde = True\r\n elif s[i] == 'l' and not findl and finde and findh:\r\n findl = True\r\n elif s[i] == 'l' and not findl1 and findl and finde and findh:\r\n findl1 = True\r\n elif s[i] == 'o' and not findo and findl1 and findl and finde and findh:\r\n findo = True\r\n if (findo and findl1 and findl and finde and findh):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "string = input()\r\n\r\nfind = \"hello\"\r\nindex = 0\r\n\r\nfor i in find:\r\n # print(i,index, string[index:])\r\n if i in string[index:]:\r\n index += string[index:].find(i)+1\r\n else:\r\n index = -1\r\n break\r\n\r\nif index == -1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a = input()\r\nl = \"hello\"\r\nindex = 0\r\nfor i in a:\r\n if index == 5:\r\n print(\"YES\")\r\n exit(0)\r\n elif i == l[index]:\r\n index += 1\r\nif index == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "criteria=list(\"hello\")\r\nchat=list(input())\r\n\r\ndef findletter(letter,list):\r\n for x in range(len(list)):\r\n if list[x] == letter:\r\n return list[x+1:]\r\n\r\n return False\r\n\r\nfor letter in criteria:\r\n returned=findletter(letter,chat)\r\n if type(returned)== list:\r\n chat = returned\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "w=input()\r\nn=len(w)\r\nv='hello'\r\ns=0\r\nfor i in range(n):\r\n if v in w:\r\n s=1\r\n elif w[i] == 'h':\r\n for j in range(i + 1, n):\r\n if w[j] == \"e\":\r\n for k in range(j + 1, n):\r\n if w[k] == \"l\":\r\n for l in range(k + 1, n):\r\n if w[l] == \"l\":\r\n for m in range(l + 1, n):\r\n if w[m] == \"o\":\r\n s=1\r\nif s==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nl=\"hello\"\r\nj=0\r\npas=0\r\nfor i in s:\r\n if (i==l[j]):\r\n j+=1\r\n pas+=1\r\n if pas==5:\r\n break\r\nif pas==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nh=\"hello\"\r\nindex=0\r\nfor char in s:\r\n if char == h[index]:\r\n index+=1\r\n if index==len(h):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n \r\n ", "\r\ns = input()\r\n\r\nhello = \"hello\"\r\n\r\nindex = 0\r\ncount = 0\r\n\r\nfor char in hello:\r\n for i in range(index, len(s)):\r\n if char == s[i]:\r\n if i + 1 < len(s):\r\n index = i+1\r\n count += 1\r\n break\r\n\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n# print(\"string\", s)\r\n# print(s[2:])\r\nflag = 0\r\nfor i in range(0, len(s)):\r\n if s[i] == 'h':\r\n for j in range(i+1, len(s)):\r\n if s[j] == 'e':\r\n for k in range(j+1, len(s)):\r\n if s[k] == 'l':\r\n for m in range(k+1, len(s)):\r\n if s[m] == 'l':\r\n for n in range(m+1, len(s)):\r\n if s[n] == 'o':\r\n flag = 1\r\nif(flag == 1): print(\"YES\") \r\nelse : print(\"NO\")\r\n", "import sys\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(input()))\r\n\r\nt = inlt()\r\nind1 = 0\r\nind2 = 0\r\ncheck = \"hello\"\r\nwhile ind1 < len(t) and ind2 < 5:\r\n if t[ind1] == check[ind2]:\r\n ind2 += 1\r\n ind1 += 1\r\nif ind2 == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "n=input()\r\nl=\"hello\"\r\ns=\"\"\r\nj=0\r\nl2=[]\r\nfor i in n:\r\n if i== l[j]:\r\n j+=1\r\n if j==5:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "\"\"\"\r\nhttps://codeforces.com/problemset/problem/58/A\r\n\"\"\"\r\n\r\na = \"h e l l o\".split(\" \")\r\ni = 0\r\n\r\ns = input()\r\n\r\nfor c in s:\r\n if c == a[i]:\r\n i += 1\r\n if i == 5:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n\r\n\r\n", "import re\r\na=input()\r\nif re.match(r'.*h.*e.*l.*l.*o',a):\r\n print('YES')\r\nelse:\r\n print('NO')", "from sys import stdin\r\n\r\n\r\nline = stdin.readline()\r\nflage = 0\r\nfor x in line:\r\n if flage == 0 and x == 'h' : flage = 1\r\n elif flage == 1 and x == 'e' : flage = 2\r\n elif flage == 2 and x == 'l' : flage = 3\r\n elif flage == 3 and x == 'l' : flage = 4\r\n elif flage == 4 and x == 'o' : flage = 5\r\n \r\nif flage == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def oho(s,x):\n l=s.find(x)\n if l<0:\n return ''\n else:\n s=s[l+1:]\n return s\n\nst=input()\nst=st+'A'\nt='hello'\nflag=0\nfor i in t:\n if oho(st,i)=='':\n print('NO')\n flag=1\n break\n else:\n st=oho(st,i)\nif flag==0:\n print('YES')", "x=input()\r\ncount=0\r\nanswer=False\r\nfor a in x:\r\n if answer==True:\r\n break\r\n elif a==\"h\":\r\n for b in range(count,len(x)):\r\n if x[b]==\"e\":\r\n for c in range(count,len(x)):\r\n if x[c]==\"l\":\r\n for d in range(count+1,len(x)):\r\n if x[d]==\"l\":\r\n for e in range(count,len(x)):\r\n if x[e]==\"o\":\r\n answer=True\r\n count+=1\r\n count+=1\r\n count+=1\r\n count+=1 \r\n count+=1\r\nif answer==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "s=list(input())\r\nhello=['h','e','l','l','o']\r\ni=0\r\nfor j in s:\r\n if j not in hello:\r\n s.remove(j)\r\nfor j in range(len(s)):\r\n if i<=4 and hello[i]==s[j] :\r\n i+=1 \r\nif i==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def sol():\n word = input()\n hello = ['h', 'e', 'l', 'l', 'o']\n\n for letter in word:\n if not hello:\n return 'YES'\n if letter == hello[0]:\n hello.pop(0)\n\n if hello:\n return 'NO'\n return 'YES'\n\n#n = int(input())\n#problems = [int(x) for x in input().split(' ')]\nprint(sol())\n", "string = input()\r\ngoal = 'hello'\r\ncurrent_letter = 0\r\nfor letter in string:\r\n if current_letter < 5:\r\n if letter == goal[current_letter]:\r\n current_letter += 1\r\nif current_letter == 5:\r\n print(\"YES\")\r\nelse: print('NO')", "import re\r\n\r\nstring = input()\r\nregex = r'.*h.*e.*l.*l.*o.*'\r\nm = re.search(regex, string)\r\nif m!=None: print('YES')\r\nelse: print('NO')", "s = input()\r\nc = 0\r\ns1 = 'hello'\r\nfor i in s:\r\n if i == s1[c]:\r\n c += 1\r\n if c == len(s1):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n = input()\r\ns=\"hello\"\r\nj=0\r\nfor i in range (len(n)):\r\n if n[i]==s[j]:\r\n j+=1\r\n if j==5:\r\n break\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=input()\r\ng=x[x.find(\"h\"):]\r\nif x.find(\"h\")==-1 or len(x)<5:\r\n print(\"NO\")\r\nelse:\r\n for i in \"helo\":\r\n try:\r\n f=True\r\n x=x[x.index(i):]\r\n except:\r\n f=False\r\n print(\"NO\")\r\n break\r\n d= g[g.find(\"e\"):]\r\n if f and d.count(\"l\")>=2:\r\n print(\"YES\")\r\n elif f:\r\n print(\"NO\")", "s=input()\r\nreq=\"hello\"\r\nx=0\r\nbool=False\r\nfor j in s:\r\n if x==4 and j==req[x]:\r\n bool=True\r\n break \r\n elif j==req[x]:\r\n x+=1\r\nprint(\"YES\" if bool==True else \"NO\") ", "from sys import maxsize, stdout, stdin, stderr\r\n# mod = 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\nstpr = lambda x : stdout.write(f'{x}' + '\\n')\r\nstar = lambda x : print(' '.join(map(str , x)))\r\nfrom math import *\r\ns= S()\r\np = ['h','e','l','l','o']\r\nfor i in s:\r\n try:\r\n if i==p[0]:\r\n p.pop(0)\r\n except IndexError:print(\"YES\"); exit()\r\nprint(\"YES\") if len(p)==0 else print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s = input()\r\nh = list('hello')\r\nfor i in s:\r\n if i == h[0]:\r\n h.pop(0)\r\n if len(h) == 0:\r\n break\r\nprint('YES' if len(h) == 0 else 'NO')", "target = \"h,e,l,l,o\".split(\",\")\r\n \r\ndef chatRoom(s):\r\n targetNum = 0\r\n for c in s:\r\n if c == target[targetNum]:\r\n if targetNum == 4:\r\n return \"YES\"\r\n else:\r\n targetNum += 1\r\n return \"NO\"\r\n \r\ns = input()\r\nprint(chatRoom(s))\r\n", "def string(s):\r\n x='hello'\r\n idx=0\r\n for i in range(len(s)):\r\n if idx==5:\r\n return('YES')\r\n if s[i]==x[idx]:\r\n idx+=1 \r\n if idx<5:\r\n return('NO')\r\n else:\r\n return('YES')\r\ns=input()\r\nprint(string(s))", "s = input().lower()\r\nf = \"hello \"\r\nc = 0\r\nfor i in range(len(s)):\r\n if s[i] == f[c]:\r\n c += 1\r\nif c >= 5:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "s = input()\r\na=s.find('h')\r\nb=s.find('e',a+1)\r\nc=s.find('l',b+1)\r\nd=s.find('l',c+1)\r\ne=s.find('o',d+1)\r\nif a!=-1 and b!=-1 and c!=-1 and d!=-1 and e!=-1 :\r\n print (\"YES\")\r\nelse:\r\n print(\"NO\")", "def hello(str0):\r\n ls=list(str0)\r\n fs=list('hello')\r\n c=-1\r\n d=0\r\n if len(ls)<len(fs):\r\n return False\r\n else:\r\n for i in fs:\r\n for j in range(0,len(ls)):\r\n if i==ls[j] and j>c:\r\n c=j\r\n \r\n d+=1\r\n break\r\n return d==5\r\ni=hello(str(input()))\r\nif i:\r\n print('YES')\r\nelse:\r\n print('NO')", "inp = input()\nn = len(inp)\nans = str()\nwords = \"helo\"\ntop = 0\nl = 0\n\nfor x in inp:\n if x in words and x == words[top]:\n ans += x\n if x == \"l\" and l<1:\n l += 1\n else:\n top += 1\n if top == 4:\n break\n# print(ans)\nif ans == \"hello\":\n print(\"YES\")\nelse:\n print(\"NO\")", "\r\ndef rec(s, word):\r\n\r\n if len(word) == 0:\r\n return True\r\n if len(s) == 0:\r\n return False\r\n \r\n if s[0] == word[0]:\r\n return rec(s[1:], word[1:])\r\n else:\r\n return rec(s[1:], word)\r\n\r\n\r\n\r\ns = input()\r\nprint(\"YES\" if rec(s, 'hello') else \"NO\")", "s = input()\r\ndef chat(s):\r\n ori = list(\"hello\")\r\n pos=[-1]\r\n for i in range(5):\r\n x = s.find(ori[i],pos[-1]+1)\r\n if x==-1:\r\n return \"NO\"\r\n pos.append(x)\r\n return \"YES\"\r\n\r\nprint(chat(s))", "hello = \"hello\" \r\nword = input()\r\nj = 0 \r\nlen_ = 0 \r\nfor i in range(len(word)): \r\n if j < 5 and word[i] == hello[j]: \r\n len_ += 1 \r\n j += 1 \r\nif len_ == 5: \r\n print(\"YES\") \r\nelse:\r\n print(\"NO\") \r\n", "st=input()\r\nword = \"hello\"\r\nindex = 0;flag=0\r\nfor i in range(0,len(st)):\r\n if(index==5):\r\n print(\"YES\");flag=1\r\n break\r\n if(st[i]==word[index]):\r\n index+=1\r\n\r\nif(index<5):\r\n print(\"NO\")\r\nelif flag==0 and index==5:\r\n print(\"YES\")", "word = input()\r\npointer = 0\r\nhello = \"hello\"\r\nfor char in word:\r\n if char == hello[pointer]:\r\n pointer += 1\r\n if pointer == len(hello):\r\n print(\"YES\")\r\n break\r\nif pointer < len(hello):\r\n print(\"NO\")", "s = input() # 输入单词\r\n\r\nhello = \"hello\" # 目标单词\r\ni = 0 # 指针\r\ncount = 0 # 计数器\r\n\r\n# 遍历每个字母\r\nfor letter in s:\r\n if letter == hello[i]:\r\n i += 1\r\n count += 1\r\n if count == 5:\r\n break\r\n\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t = input()\r\npattern = \"hello\"\r\ncurrent = 0\r\nfor i in t:\r\n if i == pattern[current]:\r\n current += 1\r\n if current == len(pattern):\r\n print(\"YES\")\r\n break\r\nif current != len(pattern): print(\"NO\")", "w = input().lower()\r\nl = 'hello'\r\nflag = True\r\nfor c in w:\r\n if c == l[0]:\r\n l = l[1:]\r\n if len(l) == 0:\r\n print('YES')\r\n flag = False\r\n break\r\nif flag:\r\n print('NO')", "compareStr ='hello'\r\nstr = input()\r\npointer = 0\r\n\r\nfor letter in str:\r\n if letter == compareStr[pointer]:\r\n pointer += 1\r\n if pointer == len(\"hello\"):\r\n break\r\n\r\nif pointer == len(compareStr):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "y=input()\r\nnum=0\r\nfor i in range(len(y)):\r\n if y[i]=='h':\r\n t = i\r\n for t in range(t,len(y)):\r\n if y[t]=='e':\r\n w=t\r\n for w in range(w,len(y)):\r\n if y[w]=='l':\r\n j=w\r\n for j in range(j,len(y)):\r\n if y[j]=='l' and j!=w:\r\n k=j\r\n for k in range(k,len(y)):\r\n if y[k]=='o':\r\n print('YES')\r\n break\r\n else:\r\n num +=1\r\n break\r\n else:\r\n num +=1\r\n break\r\n else:\r\n num +=1\r\n break\r\n else:\r\n num +=1\r\n break\r\n else:\r\n num +=1\r\nif num ==len(y):\r\n print('NO')", "s=input()\r\nc=0\r\nfor i in s:\r\n if c==0 and i=='h':\r\n c=c+1\r\n elif c==1 and i=='e':\r\n c=c+1\r\n elif c==2 and i=='l':\r\n c=c+1\r\n elif c==3 and i=='l':\r\n c=c+1\r\n elif c==4 and i=='o':\r\n c=c+1\r\nif c>=5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nt = \"hello\"\r\nc = 0\r\nfor i in s:\r\n if i == t[c]:\r\n c += 1\r\n if c == len(t):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "s=\"hello\"\nk=0\nA=input()\nn=len(A)\ni=0\nwhile(i<n and k<5):\n if(A[i]==s[k]):\n k+=1\n i+=1\nif(k==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a=\"hello\"\r\ndef chatRoom():\r\n o=0\r\n k=input()\r\n for i in range(len(k)):\r\n if(k[i]==a[o]):\r\n o+=1\r\n if(o==5):\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chatRoom())", "x = input()\na = list()\nflag=0\nfor i in range(0,len(x)):\n\ta.append(x[i])\nfor i in range(0,len(a)):\n\tif flag==0 and a[i]=='h':\n\t\tflag=1\n\telif flag==1 and a[i]=='e':\n\t\tflag=2\n\telif flag==2 and a[i]=='l':\n\t\tflag=3\n\telif flag==3 and a[i]=='l':\n\t\tflag=4\n\telif flag==4 and a[i]=='o':\n\t\tflag=5\n\telif flag==5:\n\t\tbreak\nif flag==5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "s=iter(input());print('NYOE S'[all(c in s for c in'hello')::2])", "s = input()\r\nidk = 0\r\nfor i in range(len(s)):\r\n if idk == 0:\r\n if s[i] == 'h':\r\n idk += 1\r\n continue\r\n if idk == 1:\r\n if s[i] == 'e':\r\n idk += 1\r\n continue\r\n if idk == 2:\r\n if s[i] == 'l':\r\n idk += 1\r\n continue\r\n if s[i] == 'l' and idk == 3:\r\n if s[i] == 'l':\r\n idk += 1\r\n continue\r\n if idk == 4:\r\n if s[i] == 'o':\r\n idk += 1\r\n break\r\n\r\nif idk == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Mar 18 10:26:35 2018\r\n\r\n@author: Rachit\r\n\"\"\"\r\n\r\ns = list(input())\r\n\r\nd = ['h','e','l','l','o']\r\n\r\nj = 0\r\ncount = 0\r\n\r\nfor i in range(len(s)):\r\n if j<5:\r\n if s[i]==d[j]:\r\n j += 1\r\n count += 1\r\n \r\nif (count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\ns=input()\r\nif re.match('.*h+.*e+.*l+.*l+.*o+.*',s)!=None:\r\n print('YES')\r\nelse:\r\n print('NO')", "def chat(s):\r\n\tm='hello'\r\n\tx=0\r\n\tfor i in range(len(s)):\r\n\t\tif(s[i]==m[x]):\r\n\t\t\tx+=1\r\n\t\tif(x==5):\r\n\t\t\treturn 'YES'\r\n\treturn 'NO'\r\n\r\nif __name__ == '__main__':\r\n\ts=input()\r\n\tres=chat(s)\r\n\tprint(res)", "string = input()\r\nword = \"hello\"\r\nn = len(string)\r\nw = \"\"\r\nj = 0\r\nfor i in range(n):\r\n \r\n if string[i] ==word[j]:\r\n w = w + string[i]\r\n j = j + 1\r\n if(j==5):\r\n break\r\nif(w==\"hello\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=\"hello\"\ndef chat():\n s=input()\n w=0\n for i in range(len(s)):\n if s[i]==x[w]:\n w+=1 \n if w==5:\n return \"YES\"\n return \"NO\"\nprint(chat())\n \n\t \t \t \t \t \t \t\t\t", "n=input()\r\nl=list(n)\r\nwhile (len(l)>0):\r\n if \"h\" in l:\r\n l=l[l.index(\"h\")+1:]\r\n if \"e\" in l:\r\n l=l[l.index(\"e\")+1:]\r\n if \"l\" in l:\r\n l=l[l.index(\"l\")+1:]\r\n if \"l\" in l:\r\n l=l[l.index(\"l\")+1:]\r\n if \"o\" in l:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n ", "s=input()\r\nd=\"hello\"\r\nn=0\r\nfor i in range(len(s)):\r\n if s[i]==d[n]: n+=1\r\n if n==5 : break\r\nprint(\"YES\" if n==5 else \"NO\")", "ans= ''\r\ns = input()\r\nref = \"hello\"\r\nj=0\r\nfor i in s:\r\n if j<5 and i == ref[j] :\r\n ans += i\r\n j += 1\r\nif ans == ref:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\ntest=\"hello\"\r\ni=0\r\nfor j in range (0,len(s)):\r\n if s[j]==test[i] : \r\n i=i+1\r\n if i==5 :break\r\nif i==5 :\r\n print(\"YES\")\r\n #print(i)\r\nelse: \r\n print(\"NO\") ", "s=list(input())\r\nhello=list(\"hello\")\r\nh=0\r\nfor b in range(len(s)):\r\n if s[b]==hello[h]:\r\n h+=1\r\n if h==5:\r\n break\r\nif h==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = \"hello\"\r\nb = input()\r\ni = 0\r\nfor x in b:\r\n if i == 5:\r\n break\r\n if x == a[i]:\r\n i +=1\r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\ns=input()\r\nh=\"hello\"\r\ni,j=0,0\r\nl=[]\r\nwhile i!=len(s) and j!=5:\r\n if(s[i]==h[j]):\r\n l.append(i)\r\n i+=1\r\n j+=1\r\n else:\r\n i+=1\r\nif(l==sorted(l) and len(l)==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\npat = 'hello'\r\nit = 0\r\nfor j in s:\r\n if it < 5 and j == pat[it]:\r\n it += 1\r\nif it==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "word_input = input()\r\nword_match = \"hello\"\r\nmatch_index = 0\r\nletter =0\r\nwhile letter < len(word_input) and match_index < len(word_match):\r\n if word_match[match_index] == word_input[letter]:\r\n match_index += 1\r\n letter += 1\r\n\r\nretorno = \"\"\r\nif match_index == len(word_match):\r\n retorno = \"YES\"\r\nelse:\r\n retorno = \"NO\"\r\n\r\nprint (retorno)\r\n ", "hello_list = list('hello')\r\ns = list(input())\r\n\r\ni = 0\r\nt = 0\r\nwhile t < len(hello_list) and i < len(s):\r\n if s[i] == hello_list[t]:\r\n t += 1\r\n i += 1\r\n\r\nif t == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "import sys\r\n\r\ninf = sys.stdin\r\n\r\nstring = str(inf.readline()).strip()\r\n\r\nlst = ''\r\n\r\nfor i in range(len(string)):\r\n if lst == '' and string[i] == 'h':\r\n lst += 'h'\r\n elif lst == 'h' and string[i] == 'e':\r\n lst += 'e'\r\n elif lst == 'he' and string[i] == 'l':\r\n lst += 'l'\r\n elif lst == 'hel' and string[i] == 'l':\r\n lst += 'l'\r\n elif lst == 'hell' and string[i] == 'o':\r\n lst += 'o'\r\n break\r\n\r\nprint('YES' if lst == 'hello' else 'NO')", "import re\r\ns=input()\r\nregex=re.compile(\".*h+.*e+.*l+.*l+.*o+.*\")\r\nif regex.match(s) ==None:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "word = str(input())\r\nif 'h' not in word:\r\n print('NO')\r\nelif 'h' in word:\r\n l1 = word.find('h')\r\n word1 = word[l1+1: len(word)]\r\n if 'e' not in word1:\r\n print('NO')\r\n elif 'e' in word1:\r\n l2 = word1.find('e')\r\n word2 = word1[l2+1: len(word1)]\r\n if 'l' not in word2:\r\n print('NO')\r\n elif 'l' in word2:\r\n l3 = word2.find('l')\r\n word3 = word2[l3+1: len(word2)]\r\n if 'l' not in word3:\r\n print('NO')\r\n elif 'l' in word3:\r\n l4 = word3.find('l')\r\n word4 = word3[l4+1: len(word3)]\r\n if 'o' not in word4:\r\n print('NO')\r\n elif 'o' in word4:\r\n print('YES')\r\n", "entrada = str(input())\nentrada = entrada.lower()\n\nnome = \"hello\"\nsaida = \"\"\ncontador = 0\n\nfor i in entrada:\n \n if i == \"h\" and contador == 0:\n \n saida += i\n contador += 1\n \n elif i == \"e\" and contador == 1:\n \n saida += i\n contador += 1\n \n elif i == \"l\" and contador > 1 and contador < 4:\n \n saida += i\n contador += 1\n \n elif i == \"o\" and contador == 4:\n \n saida += i\n break\n \nif saida == nome:\n \n print(\"YES\")\n \nelse:\n \n print(\"NO\")", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[2]:\n\n\ns = input()\nb = \"\"\nc = 0\nfor i in range(len(s)) :\n if s[i] == \"h\":\n b += s[i]\n c = i\n break\nfor i in range(c+1,len(s)):\n if s[i] == \"e\" :\n b += s[i]\n c = i\n break\nfor i in range(c+1,len(s)):\n if s[i] == \"l\" :\n b += s[i]\n c = i\n break\nfor i in range(c+1,len(s)):\n if s[i] == \"l\" :\n b += s[i]\n c = i\n break\nfor i in range(c+1,len(s)):\n if s[i] == \"o\" :\n b += s[i]\n c = i\n break\nif b.lower() == \"hello\" :\n print(\"YES\")\nelse :\n print(\"NO\")\n\n# first attempt\n# for j in s :\n# if j in \"helo\":\n# b += j\n# print(b)\n# a = b[0]\n\n# for i in range(1,len(b)):\n# if b[i] != b[i-1] :\n# a += b[i]\n# print(a)\n# if \"helo\" in a.lower() or \"hello\" in a.lower() :\n# print(\"YES\")\n# else :\n# print(\"NO\")\n\n", "sx = input()\r\ns = \"0\"\r\nt = \"hello\"\r\nfor i in sx:\r\n if (i == 'h' and s[len(s)-1] not in t) or (i == 'e' and s[len(s)-1] == 'h') or (i == 'l' and s[len(s)-1] == 'e') or (i == 'l' and s[len(s)-1] == 'l' and s[len(s)-2] != 'l') or (i == 'o' and s[len(s)-1] == 'l' and s[len(s)-2] == 'l'):\r\n s += i\r\n\r\nif \"hello\" in s:print('YES')\r\nelse:print('NO')\r\n", "s = input()\r\nhello = [x for x in 'hello']\r\ns_list = [x for x in s]\r\ni,j = 0,0\r\n\r\nwhile j != len(hello):\r\n\tif i == len(s_list):\r\n\t\tbreak\r\n\tif s_list[i] == hello[j]:\r\n\t\tj+=1\r\n\t\ti+=1\r\n\telse:\r\n\t\ti+=1\r\n\r\nif j == len(hello):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "s = input()\r\n# s = 'hlelo'\r\n\r\ncount = 0\r\nletter = ''\r\ntest = ''\r\nfor i in s:\r\n if (i == 'h' and count == 0):\r\n letter = 'e'\r\n count += 1 \r\n test += i\r\n\r\n elif (i == letter and count == 1):\r\n letter = 'l'\r\n count += 1 \r\n test += i\r\n\r\n elif (i == letter and count == 2):\r\n letter = 'l'\r\n count += 1\r\n test += i\r\n\r\n elif (i == letter and count == 3):\r\n letter = 'o'\r\n count += 1\r\n test += i\r\n\r\n elif (i == letter and count == 4):\r\n count += 1\r\n test += i\r\n\r\n# print(test)\r\n\r\nif count == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "import re\n\ni=input()\npattern = re.compile(\"^.*h+.*e+.*l+.*l+.*o+.*$\")\nprint(\"YES\" if pattern.match(i) else \"NO\")", "import sys\r\n\r\ns = input()\r\n\r\ncount = 0\r\nl = []\r\n\r\nfor i in s:\r\n if (i == 'h' and count == 0):\r\n l.append('h')\r\n count = count + 1\r\n elif (i == 'e' and count == 1) :\r\n l.append('e')\r\n count = count + 1\r\n elif (i == 'l' and count == 2) :\r\n l.append('l')\r\n count = count + 1\r\n elif (i == 'l' and count == 3) :\r\n l.append('l')\r\n count = count + 1\r\n elif (i == 'o' and count == 4) :\r\n l.append('o')\r\n count = count + 1\r\nif count == 5 and ''.join(l) == 'hello' :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "s = input()\r\ns2 = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\ni = -1\r\nfor x in s2:\r\n i = s.find(x, i+1)\r\n if i == -1:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "hello=['h','e','l','l','o']\r\ns=input()\r\ns=list(s)\r\nn=-1\r\nfor i in hello:\r\n if i in s:\r\n n=s.index(i)\r\n s=s[n+1::]\r\n else:\r\n print(\"NO\")\r\n exit()\r\n \r\nprint(\"YES\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 20 15:26:53 2023\r\n\r\n@author: gzk16\r\n\"\"\"\r\n\r\ns = input()\r\nword = \"hello\"\r\nindex = 0\r\n\r\nfor letter in s:\r\n if letter == word[index]:\r\n index += 1\r\n if index == 5:\r\n print(\"YES\")\r\n break\r\nif index != 5:\r\n print('NO')\r\n", "word = list(input())\r\nword2 = ['h','e','l','l','o']\r\ni,j = 0,0\r\nwhile i< len(word) and j < len(word2):\r\n if word[i] == word2[j]:\r\n j += 1\r\n i += 1\r\nprint(\"YES\" if j == len(word2) else \"NO\")", "a=input()\r\nx=0\r\nb='hello'\r\nfor i in range(len(a)):\r\n if a[i]==b[0]:b=b[1:]\r\n if len(b)==0:print(\"YES\");x=1;break\r\nif x==0:print(\"NO\")", "word=input()\r\nstring='hello'\r\nindex=0\r\nfor i in range(0,len(word)):\r\n if(word[i]==string[index]):\r\n index+=1\r\n if(index==5):\r\n break;\r\n \r\n\r\nif(index<5):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n = input()\r\nl = ['h','e','l','l','o']\r\nh = 0\r\nfor x in n:\r\n if x == l[h]:\r\n h+=1\r\n if h == 5:\r\n break\r\n\r\nif h == 5 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check_hello(s):\r\n hello = \"hello\"\r\n i = 0\r\n\r\n for char in s:\r\n if char == hello[i]:\r\n i += 1\r\n if i == len(hello):\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\n# Read input\r\ns = input()\r\n\r\n# Call the function to check if Vasya said hello\r\nresult = check_hello(s)\r\n\r\n# Print the result\r\nprint(result)\r\n", "if __name__ == '__main__':\r\n s = input()\r\n position, flag = 0, 0\r\n for i, a in enumerate(s):\r\n if a == 'hello'[position]:\r\n position += 1\r\n flag += 1\r\n \r\n if flag == 5:\r\n print('YES')\r\n exit()\r\n else:\r\n continue\r\n \r\n print('NO')", "def can_say_hello(word):\r\n hello = \"hello\"\r\n index = 0\r\n for letter in word:\r\n if letter == hello[index]:\r\n index += 1\r\n if index == len(hello):\r\n return True\r\n return False \r\ns = input()\r\nif can_say_hello(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\"\"\"\nOh, Grantors of Dark Disgrace, \nDo Not Wake Me Again.\n\"\"\"\n\nw = input()\nb = 0\n\nfor i in w:\n if b == 0 and i == 'h': b = 1\n elif b == 1 and i == 'e': b = 2\n elif b == 2 and i == 'l': b = 3\n elif b == 3 and i == 'l': b = 4\n elif b == 4 and i == 'o': b = 5\n\nprint(\"YES\" if b == 5 else \"NO\")\n", "# Hello World program in Python\r\nimport re\r\n\r\npattern = \"h.*e.*l.*l.*o\"\r\n\r\ns = input()\r\nrs = re.search(pattern, s)\r\n\r\nprint(\"YES\" if rs is not None else \"NO\")", "a = input()\r\nA = 'hello'\r\n\r\nk = 0\r\nb = False\r\nfor i in range(len(a)):\r\n if a[i] == A[k]:\r\n k+=1\r\n if k==5:\r\n b = True\r\n if k>=5:\r\n break\r\n\r\nprint('YES') if b else print('NO')\r\n \r\n", "s = input()\r\nx = []\r\nt = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'h':\r\n t = i + 1\r\n x.append(\"h\")\r\n break\r\nfor i in range(t, len(s)):\r\n if s[i] == 'e':\r\n t = i + 1\r\n x.append(\"e\")\r\n break\r\nfor i in range(t, len(s)):\r\n if s[i] == 'l':\r\n t = i + 1\r\n x.append(\"l\")\r\n break\r\nfor i in range(t, len(s)):\r\n if s[i] == 'l':\r\n t = i + 1\r\n x.append(\"l\")\r\n break\r\nfor i in range(t, len(s)):\r\n if s[i] == 'o':\r\n t = i + 1\r\n x.append(\"o\")\r\n break\r\nif ''.join(x) == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\na=\"hello\"\r\nk=0\r\nw=0\r\nfor i in a:\r\n if s.find(i,k)>=0:\r\n k=s.find(i,k)+1\r\n if k>len(s):\r\n break\r\n w+=1\r\nif w==5:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n\r\n\r\n", "hahahahah=input()\r\nholl='hello'\r\nabus=0\r\nfor i in range(len(hahahahah)):\r\n if hahahahah[i] == holl[abus]:\r\n abus+=1\r\n if abus==5:\r\n break\r\nif abus==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\ntarget = \"hello\"\r\nidx = 0\r\nfor c in s:\r\n if c == target[idx]:\r\n idx += 1\r\n if idx == len(target):\r\n break\r\n\r\nprint(\"YES\" if idx == len(target) else \"NO\")\r\n", "word = input()\n\ntarget = \"hello\"\n\nprogress = 0\n\nfor x in word:\n if x == target[progress]:\n progress += 1\n\n if progress == len(target):\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n", "str1=input()\nn=len(str1)\nvalid=True\nj=0\nstr2=''\nfor i in range(n):\n if str1[i]=='h' and str2=='':\n str2+='h'\n elif str1[i]=='e' and str2=='h':\n str2+='e'\n elif str1[i]=='l' and str2=='he':\n str2+='l'\n elif str1[i]=='l' and str2=='hel':\n str2+='l'\n elif str1[i]=='o' and str2=='hell':\n str2+='o'\nif str2=='hello':\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \n\n \n\n\n\n ", "import sys\r\n\r\nn = input()\r\ncount = 0\r\nword = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nfor i in n:\r\n if i == word[count]:\r\n count += 1\r\n if count == 5:\r\n break\r\nprint(\"YES\" if count == 5 else \"NO\")", "x=input()\r\ni=0\r\nf='hello'\r\ns=0\r\nwhile(i<len(x) and s<5):\r\n if(x[i]==f[s]):\r\n s+=1\r\n i+=1\r\nif(s==5):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# 58A: Chat room\r\n\r\ns = input()\r\nword = \"hello\"\r\nind = 0\r\n\r\nfor c in s:\r\n\tif c==word[ind]:\r\n\t\tind += 1\r\n\tif ind==len(word):\r\n\t\tbreak\r\n\r\nif ind==len(word):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "n=input()\r\nm=int(len(n))\r\no=[]\r\nif m<5:\r\n print(\"NO\")\r\nelse:\r\n e1=0\r\n e2=0\r\n e3=0\r\n k1=0\r\n k2=0\r\n k3=0\r\n k4=0 \r\n for i in range(m):\r\n if n[i]==\"h\":\r\n k1=1\r\n break\r\n e1=i\r\n for j in range(e1,m):\r\n if n[j]==\"e\":\r\n k2=1\r\n break\r\n e2=j\r\n for k in range(e2,m):\r\n if n[k]==\"l\":\r\n k3=1\r\n break\r\n e3=k\r\n for a in range(e3+1,m):\r\n if n[a]==\"l\"and\"o\"in n[a:]:\r\n k4=1\r\n break\r\n if k1==1 and k2==1 and k3==1 and k4==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "st = \"hello\"\nind = int(0)\nfor x in input().strip():\n if (x == st[ind]):\n ind += 1\n if (ind == 5):\n break\nprint(\"YES\" if ind == 5 else \"NO\")\n", "s = input()\r\nline = 'hello'\r\ncounter = 0\r\nh = 0\r\ne = 0\r\nl1 =0\r\nl2 = 0\r\no = 0\r\nfor i in s:\r\n h+=1\r\n if i == 'h':\r\n counter +=1\r\n break\r\n\r\nfor j in s:\r\n e +=1\r\n if j == 'e' and e>h:\r\n counter +=1\r\n break\r\n#l1 = l1 + e\r\nfor k in s:\r\n l1 +=1\r\n if k == 'l' and l1 > e:\r\n counter +=1\r\n break\r\n#l2 = l2 + l1\r\nfor q in s:\r\n l2 +=1\r\n if q == 'l' and l2>l1:\r\n counter +=1\r\n break\r\n#o = o + l2\r\nfor w in s:\r\n o +=1\r\n if w == 'o'and o > l2:\r\n counter +=1\r\n break\r\nif counter == 5:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "#https://codeforces.com/problemset/problem/58/A\r\ns=input()\r\na=\"hello\"\r\ni=0\r\nflag=True\r\nindex = 0\r\nm = \"\"\r\nwhile(flag and i<len(s)):\r\n\tif(s[i]==a[index]):\r\n\t\tindex=index+1\r\n\t\tm=m+s[i]\r\n\tif(m==\"hello\"):\r\n\t\tflag=False\r\n\ti=i+1\r\n\r\nif(m==\"hello\"):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\r\n\r\n\r\ndef isHello(s):\r\n word = [ii for ii in \"hello\"]\r\n word = word[::-1]\r\n\r\n for ii in s:\r\n if ii == word[-1]:\r\n word.pop()\r\n \r\n if len(word) == 0:\r\n print(\"YES\")\r\n return\r\n\r\n print(\"NO\")\r\n\r\n\r\nisHello(s)\r\n", "entery = input()\r\nletters = []\r\nindicator = 0\r\n\r\nfor letter in entery:\r\n if letter == \"h\" and indicator == 0:\r\n letters.append(letter)\r\n indicator = 1\r\n elif letter == \"e\" and indicator == 1:\r\n letters.append(letter)\r\n indicator = 2\r\n elif letter == \"l\" and indicator == 2:\r\n letters.append(letter)\r\n indicator = 3\r\n elif letter == \"l\" and indicator == 3:\r\n letters.append(letter)\r\n indicator = 4\r\n elif letter == \"o\" and indicator == 4:\r\n letters.append(letter)\r\n indicator = 5\r\nif letters == [\"h\", \"e\", \"l\", \"l\", \"o\"]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "word = input()\n\nHELLO = \"hello\"\nhello_index = 0\n\nfor i in range(len(word)):\n\n if(word[i] == HELLO[hello_index]):\n hello_index += 1\n\n if(hello_index == 5):\n break\n\nif(hello_index == 5):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def d(a,h):\r\n p1=0\r\n p2=0\r\n c=0\r\n if len(a)>len(h):\r\n return 'NO'\r\n while p1<5 and p2<len(h):\r\n \r\n if a[p1]==h[p2]:\r\n p1+=1\r\n p2+=1\r\n c+=1\r\n else:\r\n p2+=1\r\n if c==5:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n \r\n \r\n \r\nif __name__==\"__main__\":\r\n \r\n k=input()\r\n h=list(k)\r\n a=['h','e','l','l','o']\r\n print(d(a,h))\r\n \r\n", "hello = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nword = input()\r\nend = False\r\nls = 0\r\n\r\nfor i in word:\r\n if i == \"l\":\r\n ls += 1\r\n\r\nif len(word) >= 5 and \"h\" in word and \"e\" in word and ls >= 2 and \"o\" in word:\r\n word = word[word.index(\"h\"):word.rindex(\"o\")+1]\r\n h = word.find(\"h\")\r\n e = word.find(\"e\")\r\n l1 = word.find(\"l\")\r\n l2 = word.find(\"l\",l1+1)\r\n o = word.find(\"o\")\r\n\r\n if h != -1 and e != -1 and l1 != -1 and l2 != -1 and o != -1:\r\n if e > l1 or e > l2 or e > o:\r\n word = \"h\" + word[e:]\r\n l1 = word.find(\"l\")\r\n l2 = word.find(\"l\",l1+1)\r\n o = word.find(\"o\")\r\n else:\r\n end = True\r\n\r\n if h != -1 and e != -1 and l1 != -1 and l2 != -1 and o != -1:\r\n if l1 > l2 or l1 > o:\r\n word = \"he\" + word[l1:]\r\n l1 = word.find(\"l\")\r\n l2 = word.find(\"l\",l1+1)\r\n o = word.find(\"o\")\r\n else:\r\n end = True\r\n\r\n if h != -1 and e != -1 and l1 != -1 and l2 != -1 and o != -1:\r\n if l2 > o:\r\n word = \"hell\" + word[l2:]\r\n o = word.find(\"o\")\r\n else:\r\n end = True\r\n\r\n if h != -1 and e != -1 and l1 != -1 and l2 != -1 and o != -1:\r\n word = \"hello\"\r\n else:\r\n end = True\r\n\r\nelse:\r\n end = True\r\n\r\nif end == False:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(input())\r\nx = ['h','e','l','l','o']\r\nn = len(x)\r\nk = 0\r\nfor j in a :\r\n if k != n and str(j) == x[k]:\r\n k += 1\r\n if k == n:\r\n break\r\nif k < n:\r\n print('NO')\r\nelse :\r\n print('YES')\r\n", "s = input()\np = ['h','e','l','l','o']\n\nfor e in s:\n if len(p)>0: \n if e==p[0]:\n p.pop(0)\n else:\n break\n\nprint(\"YES\" if len(p)==0 else \"NO\")\n", "w=input()\r\nh=\"hello\"\r\nj=0\r\nfor i in range(len(w)):\r\n if j<=4:\r\n if w[i]==h[j]:\r\n j+=1\r\n else:\r\n break\r\n\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "teks=input()\npos1=teks.find('h')\npos2=teks.find('e',pos1,len(teks))\npos3=teks.find('l',pos2,len(teks))\npos4=teks.find('l',pos3+1,len(teks))\npos5=teks.find('o',pos4,len(teks))\n\nif (pos1<pos2<pos3<pos4<pos5):\n print('YES')\nelse:\n print('NO')", "w = input()\r\n\r\na = 'hello'\r\nc = 0\r\n\r\nfor i in range(len(w)):\r\n if w[i] == a[c]:\r\n c += 1\r\n if c == 5:\r\n exit(print('YES'))\r\n\r\nprint('NO')\r\n", "s = input()\r\n\r\npattern = \"hello\"\r\nj = 0\r\n\r\nfor char in s:\r\n if j < len(pattern) and char == pattern[j]:\r\n j += 1\r\n\r\nif j == len(pattern):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\na = s.find('h')\r\nif len(s) > a+1:\r\n s = s[a+1:]\r\nelse:\r\n a = -1\r\nb = s.find('e')\r\nif len(s) > b+1:\r\n s = s[b+1:]\r\nelse:\r\n b = -1\r\nc = s.find('l')\r\nif len(s) > c+1:\r\n s = s[c+1:]\r\nelse:\r\n c = -1\r\nd = s.find('l')\r\nif len(s) > d+1:\r\n s = s[d+1:]\r\nelse:\r\n d = -1\r\ne = s.find('o')\r\n \r\nif a != -1 and b != -1 and c != -1 and d != -1 and e != -1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = str(input())\r\nans = \"\"\r\na = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\n\r\nh = 0\r\ne = 0\r\nl = 0\r\no = 0\r\nfor i in s:\r\n if i in a:\r\n if i == \"h\" and h == 0:\r\n ans+=\"h\"\r\n h+=1\r\n continue\r\n if i == \"e\" and e == 0 and h == 1:\r\n ans+=\"e\"\r\n e+=1\r\n continue\r\n if i == \"l\" and l <= 1 and e == 1 and h == 1:\r\n ans+=\"l\"\r\n l+=1\r\n continue\r\n if i == \"o\" and o == 0 and l == 2 and e == 1 and h == 1:\r\n ans+=\"o\"\r\n o += 1\r\n continue\r\nif ans == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin\n\ndef he_managed(line) -> bool:\n word = \"hello\"\n for l in line:\n if l != word[0]: continue\n word = word[1:]\n if len(word) == 0: return True\n return False\n\ndef main():\n line = stdin.readline().strip()\n SALIDA = []\n while len(line) != 0:\n SALIDA.append(\"YES\" if he_managed(line) else \"NO\")\n line = stdin.readline().strip()\n print(\"\\n\".join(SALIDA))\nmain()", "s = input()\r\ntarget = \"hello\"\r\na = 0\r\nfor c in s:\r\n if c == target[a]:\r\n a += 1\r\n if a >= len(target):\r\n break\r\nif a == len(target):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def findall(str1,t):\r\n i=0\r\n listt=[]\r\n n=len(str1)\r\n while 0<=i<n:\r\n x=str1.find(t,i)\r\n if x !=-1:\r\n listt.append(x)\r\n i=x+1\r\n else:\r\n break\r\n return listt\r\n\r\ndef pop(list1,n):\r\n i=0\r\n while i<len(list1):\r\n if int(list1[i])<n:\r\n list1.pop(i)\r\n else:\r\n i=i+1\r\n return list1\r\nstr1=input()\r\nlist1=findall(str1,\"h\")\r\nlist2=findall(str1,\"e\")\r\nlist3=findall(str1,\"l\")\r\nlist4=findall(str1,\"o\")\r\nif list1==[]:\r\n print(\"NO\")\r\nelif list2==[]:\r\n print(\"NO\")\r\nelif len(list3)<2:\r\n print(\"NO\")\r\nelif list4==[]:\r\n print(\"NO\")\r\nelse: \r\n list2=pop(list2,int(list1[0]))\r\n if list2==[]:\r\n print(\"NO\")\r\n else:\r\n list3=pop(list3,int(list2[0]))\r\n if len(list3)<2:\r\n print(\"NO\")\r\n else:\r\n list4=pop(list4,int(list3[1]))\r\n if list4==[]:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "s=input()\r\nk=100\r\ncounter=0\r\nfor item in \"hello\":\r\n if item in s:\r\n counter+=1\r\n k=s.find(item)\r\n s=s[k+1:]\r\nif counter == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve(st):\r\n word = \"hello\"\r\n index = 0\r\n for i in range(0,len(st)):\r\n if(index==5):\r\n return \"YES\"\r\n if(st[i]==word[index]):\r\n\r\n index+=1\r\n\r\n if(index<5):\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\nletter = input()\r\nletters = [i for i in letter if i in \"hello\"]\r\nhword = letters[\"\".join(letters).find('h'):]\r\nword = hword[:\"\".join(hword).rfind('o') + 1]\r\nprint(solve(word))", "s = input()\r\nx = 'hello'\r\ncount = 0\r\nfor i in range(len(s)) :\r\n if s[i] == x[count]:\r\n count += 1\r\n if count == 5:\r\n break\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nq=w=e=h=0\r\nb=\"hello\"\r\nfor i in range(len(a)):\r\n if a[i]==b[e]:\r\n e=e+1\r\n h=h+1\r\n if h==5:\r\n break\r\nif h==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n", "s=list(input())\r\nz=''\r\nf=['h','e','l','l','o']\r\nj=0\r\nfor i in s:\r\n #print(z)\r\n if j<len(f) and i==f[j]:\r\n j+=1\r\n z+=i\r\n if z=='hello':\r\n break\r\nif z=='hello':\r\n print('YES')\r\nelse:print('NO')", "import re\r\ndef main():\r\n s = input()\r\n if re.search(r'h\\w*e\\w*l\\w*l\\w*o\\w*', s) == None:\r\n print('NO')\r\n else:\r\n print('YES')\r\n\r\nmain()", "s=\"hello\"\r\ndef chatroom(s1):\r\n count=0\r\n for i in range(len(s1)):\r\n if(s1[i]==s[count]):\r\n count=count+1\r\n if(count==5):\r\n return True\r\n return False\r\n\r\n\r\ns1=input()\r\n\r\nif(chatroom(s1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s= input()\r\ni,j=0,0\r\nch=\"hello\"\r\nch1=\"\"\r\nwhile ( i<5) and j < len(s):\r\n if s[j]==ch[i]:\r\n ch1+=s[j]\r\n i+=1\r\n j+=1\r\nif(ch1==ch):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n", "def main():\r\n\ts=input()\r\n\ts=list(s)\r\n\tposH=-1\r\n\tposE=-1\r\n\tposL1=-1\r\n\tposL2=-1\r\n\tposO=-1\r\n\tans=True\r\n\tfor i in range(len(s)):\r\n\t\tif s[i]==\"h\":\r\n\t\t\tposH=i\r\n\t\t\tbreak\r\n\tif posH==-1:\r\n\t\tans=False\r\n\tfor i in range(posH+1,len(s)):\r\n\t\tif s[i]==\"e\":\r\n\t\t\tposE=i\r\n\t\t\tbreak\r\n\tif posE==-1:\r\n\t\tans=False\r\n\tfor i in range(posE+1,len(s)):\r\n\t\tif s[i]==\"l\":\r\n\t\t\tposL1=i\r\n\t\t\tbreak\r\n\tif posL1==-1:\r\n\t\tans=False\r\n\tfor i in range(posL1+1,len(s)):\r\n\t\tif s[i]==\"l\":\r\n\t\t\tposL2=i\r\n\t\t\tbreak\r\n\tif posL2==-1:\r\n\t\tans=False\r\n\tfor i in range(posL2+1,len(s)):\r\n\t\tif s[i]==\"o\":\r\n\t\t\tposO=i\r\n\t\t\tbreak\r\n\tif posO==-1:\r\n\t\tans=False\r\n\tif ans==True:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\nmain()\r\n", "from re import search\r\nL=\"h+.*e+.*l+.*l+.*o+\"\r\nS=input()\r\nif(search(L,S)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys \r\ns=list(input())\r\nflag=True\r\nLcounter=0\r\n\r\n\r\nfor a in range(len(s)):\r\n if s[a]=='h':\r\n while s[a]!='e':\r\n a+=1\r\n if a==len(s):\r\n print(\"NO\")\r\n sys.exit()\r\n \r\n while flag:\r\n a+=1\r\n if a==len(s):\r\n print(\"NO\")\r\n sys.exit()\r\n \r\n if s[a]==\"l\":\r\n Lcounter+=1\r\n\r\n if Lcounter==2:\r\n flag=False\r\n \r\n while s[a] !='o':\r\n a+=1\r\n if a==len(s):\r\n print(\"NO\")\r\n sys.exit()\r\n \r\n \r\n if s[a]=='o':\r\n print(\"YES\")\r\n sys.exit()\r\n\r\nprint(\"NO\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "def can_say_hello(s):\n target_word = \"hello\"\n index = 0\n\n for letter in s:\n if letter == target_word[index]:\n index += 1\n\n if index == len(target_word):\n return \"YES\"\n\n return \"NO\"\n\n# Example usage:\ns = input()\nresult = can_say_hello(s)\nprint(result)\n\n\t\t\t\t\t \t \t\t \t \t\t \t\t\t\t\t\t\t\t\t\t", "s=str(input())\r\n\r\ncounter=0\r\nfor i in s:\r\n if counter==0 and i=='h':\r\n counter=counter+1\r\n elif counter==1 and i=='e':\r\n counter=counter+1\r\n elif counter==2 and i=='l':\r\n counter=counter+1\r\n elif counter==3 and i=='l':\r\n counter=counter+1\r\n elif counter==4 and i=='o':\r\n counter=counter+1\r\nif(counter==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t=input()\r\nn=len(t)\r\na=0\r\ncnt=0\r\nw='hello'\r\nfor i in range(n):\r\n if t[i]==w[a]:\r\n a+=1\r\n cnt+=1\r\n if cnt==5:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "s = input()\r\n\r\nfind = ['h', 'e', 'l', 'l', 'o']\r\nans = \"NO\"\r\n\r\nfor i in s:\r\n to_find = find[0]\r\n if i == to_find:\r\n find.pop(0)\r\n \r\n if len(find) == 0:\r\n ans = \"YES\"\r\n break\r\n\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 2 09:53:58 2017\r\n\r\n@author: svpopo18\r\n\"\"\"\r\n\r\ns = input()\r\nif s.count('l') < 2:\r\n print('NO')\r\nelif s.count('h') < 1:\r\n print('NO')\r\nelif s.count('o') < 1:\r\n print('NO')\r\nelif s.count('e') < 1:\r\n print('NO')\r\nelse:\r\n h = s.find('h')\r\n e = s[h:].find('e') + h\r\n l = s[e:].find('l') + e\r\n l1 = s[l + 1:].find('l') + l + 1\r\n o = s[l1:].find('o') + l1\r\n hello = h < e < l < l1 < o\r\n if hello:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "s = input()\r\narray = s.split()\r\nstatus1=False\r\nstatus2=False\r\nstatus3=False\r\nstatus4=False\r\nstatus5=False\r\nznach=0\r\nfor i in s:\r\n if i == \"h\":\r\n status1=True\r\n if status1 and i == \"e\":\r\n status2=True\r\n if status2 and i == \"l\":\r\n status3=True\r\n znach+=1\r\n if status3 and i == \"l\":\r\n status4=True\r\n if status4 and znach>=2 and i == \"o\":\r\n status5=True\r\n\r\nif status5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nc = 0\r\nfor i in range(len(a)):\r\n if a[i] == b[c]:\r\n c = c + 1\r\n if c == 5:\r\n break\r\nif c == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nz = 0\r\nif (s.find('h') != -1 and s.rfind('o') != -1 and s.find('h') < s.rfind('o')) :\r\n x1 = s.find('h')\r\n x2 = s.rfind('o')\r\n if (s.find('e' , x1 , x2 ) != -1 and s.rfind('l',x1 , x2 ) != -1 and s.find('e' , x1 , x2 ) < s.rfind('l' , x1 , x2 )) :\r\n x3 = s.find('e' , x1 , x2 )\r\n x4 = s.rfind('l' , x1 , x2)\r\n if (s.count('l' , x3 , x4) >= 1) :\r\n z = 1\r\nif (z == 0) :\r\n print('NO')\r\nelse :\r\n print('YES')\r\n", "a=\"hello\"\ndef chat():\n b=input()\n K=0\n for i in range(len(b)):\n if b[i]==a[K]:\n K+=1 \n if K==5:\n return \"YES\"\n return \"NO\"\nprint(chat())\n\t \t\t\t\t\t \t \t \t \t \t \t\t\t \t", "# https://codeforces.com/problemset/problem/58/A\r\n\r\ndef main():\r\n word = input()\r\n expect = 'hello'\r\n for i in expect:\r\n f = word.find(i)\r\n if f < 0:\r\n print('NO')\r\n return\r\n else:\r\n word = word[f + 1:]\r\n print('YES')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s = input()\r\na = True\r\nif \"h\" in s and \"e\" in s:\r\n o = s.find(\"h\")\r\n i = s.find(\"e\",o+1,len(s))\r\n if i>-1:\r\n j = s.find(\"l\",i+1,len(s))\r\n if j>-1:\r\n m = s.find(\"l\",j+1,len(s))\r\n if m>-1:\r\n n = s.find(\"o\",m+1,len(s))\r\n if n>-1:\r\n print(\"YES\")\r\n a = False\r\nif a:\r\n print(\"NO\")", "s = input()\r\n\r\nhello = list(\"hello\")\r\n\r\nh_i = 0\r\nfor i in range(len(s)):\r\n #print(f\"\\ns[i]: {s[i]}\")\r\n #print(f\"hello[h_i]: {hello[h_i]}\")\r\n #print(f\"i: {i}\")\r\n #print(f\"h_i: {h_i}\")\r\n \r\n if s[i] == hello[h_i]:\r\n h_i += 1\r\n \r\n if h_i == 5:\r\n break\r\nif h_i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 13 00:42:00 2018\r\n\r\n@author: drogbatony\r\n\"\"\"\r\n\r\n\"\"\"\r\nword=input()\r\nn=len(word)\r\nfor i in range(n):\r\n if n[i]==\"h\":\r\n word=word[(i+1):]\r\n n=len(word)\r\n for i in range(n):\r\n if n[i]==\"e\":\r\n word=word[(i+1):]\r\n n=len(word)\r\n for i in range(n):\r\n if n[i]==\"l\":\r\n word=word[(i+1):]\r\n n=len(word)\r\n for i in range(n):\r\n if n[i]==\"l\":\r\n word=word[(i+1):]\r\n n=len(word)\r\n for i in range(n):\r\n if n[i]==\"o\":\r\n print(\"YES\")\r\n else: print(\"NO\")\r\n else: print(\"NO\")\r\n else: print(\"NO\")\r\n else: print(\"NO\")\r\n else: print(\"NO\")\r\n \"\"\"\r\nword = input() \r\nll = word.count('l') \r\nif ll >= 2 and 'h' in word and 'e' in word and 'o' in word: \r\n h = word.index('h') \r\n word = word[(h+1):] \r\n if 'e' in word: \r\n e = word.index('e') \r\n word = word[(e+1):] \r\n if 'l' in word: \r\n l = word.index('l') \r\n word= word[(l+1):] \r\n if 'l' in word: \r\n l = word.index('l') \r\n word = word[(l+1):] \r\n if 'o' in word: \r\n print('YES') \r\n else: \r\n print('NO') \r\n else: \r\n print('NO') \r\n else: \r\n print('NO') \r\n else: \r\n print('NO') \r\nelse: \r\n print('NO')", "a = input()\r\nb = 0\r\nc = 'hello'\r\nfor i in a:\r\n if i == c[b]:\r\n b += 1\r\n if b >= 5:\r\n break\r\nif b >= 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "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\n\r\n\r\ndef main():\r\n try:\r\n l=list(input())\r\n ans=['h','e','l','l','o']\r\n flag=0\r\n i=0\r\n for x in l:\r\n if x==ans[i]:\r\n i+=1\r\n if i>=5:\r\n flag=1\r\n break\r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print('NO')\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()", "s = input()\r\n\r\nhello = \"hello\"\r\npointer = 0 # Pointer to the next expected letter in \"hello\"\r\n\r\nfor char in s:\r\n if char == hello[pointer]:\r\n pointer += 1\r\n if pointer == len(hello):\r\n break # All letters in \"hello\" are found\r\n\r\nif pointer == len(hello):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# solving 58A\r\n\r\n# main input\r\nstring = input()\r\n\r\n# iterating through the string\r\nH=0\r\nE=0;\r\nL=0\r\nO=0\r\nstringOK=0\r\nfor i in string:\r\n if H!=1:\r\n if i==\"h\":\r\n H=1\r\n elif E!=1:\r\n if i==\"e\":\r\n E=1\r\n elif L!=2:\r\n if i==\"l\":\r\n L+=1\r\n elif O!=1:\r\n if i==\"o\":\r\n O=1\r\n stringOK=1\r\n break\r\n\r\n# checking if valid string\r\nif stringOK==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "c = 0\r\ns = 'hello'\r\nfor i in input():\r\n if i == s[c]: \r\n c+=1\r\n if c == 5: \r\n print('YES')\r\n break\r\nelse: \r\n print('NO')", "strr = input()\r\nk = 0\r\nwhile k < len(strr) and strr[k] != 'h':\r\n k += 1\r\nk += 1\r\nwhile k < len(strr) and strr[k] != 'e':\r\n k += 1\r\nk += 1\r\nwhile k < len(strr) and strr[k] != 'l':\r\n k += 1\r\nk += 1\r\nwhile k < len(strr) and strr[k] != 'l':\r\n k += 1\r\nk += 1\r\nwhile k < len(strr) and strr[k] != 'o':\r\n k += 1\r\nif k < len(strr):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = input()\r\nhelloStr = \"hello\"\r\nhelloList = list(helloStr)\r\nmyBool = False\r\nfor h in range(len(word)):\r\n if word[h] == \"h\":\r\n for e in range(h+1, len(word)):\r\n if word[e] == \"e\":\r\n for l in range(e+1, len(word)):\r\n if word[l] == \"l\":\r\n for l2 in range(l+1, len(word)):\r\n if word[l2] == \"l\":\r\n for o in range(l2+1, len(word)):\r\n if word[o] == \"o\":\r\n myBool = True\r\n break\r\nif myBool:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\nh = s.find('h')\r\ne = s.find('e', h)\r\nl1 = s.find('l', e)\r\nl2 = s.find('l', l1+1)\r\no = s.find('o', l2)\r\nif h != -1 and e!= -1 and l1!=-1 and l2!=-1 and o!= -1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb='hello'\r\nfor i in range(5):\r\n if b[i] in a:\r\n n=a.index(b[i])\r\n a=a[n+1:]\r\n if i==4:\r\n print('YES')\r\n else:\r\n print('NO')\r\n break", "import re\n\ns = input()\nf = re.findall(r\"[a-z]*h[a-z]*e[a-z]*l[a-z]*l[a-z]*o[a-z]*\", s)\nif (f):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s=input()\r\nref=\"hello\"\r\nk=\"\"\r\ni=0\r\nfor j in s:\r\n if i>4:break\r\n if j==ref[i]:\r\n k+=j\r\n i+=1\r\nif k==ref:print(\"YES\")\r\nelse:print(\"NO\")", "#######<786>#######\r\n#######[_PUTIN Still Alive_]######\r\n######Let's start rock and Roolllll#####\r\nfrom re import search as Vikings_Putin\r\n'''\r\nsudo upgrade && update\r\npip install PUTIN\r\nLoading PUTIN...################### 99% done\r\nDownload Successfully...\r\nfrom PUTIN import Putin_er_Khel as Conquer\r\n'''\r\nrussia=input()\r\nif Vikings_Putin(\"h.*e.*l.*l.*o\",russia):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve(typed_word):\r\n word = \"hello\"\r\n index = 0\r\n for i in range(0,len(typed_word)):\r\n if(index==5):\r\n return \"YES\"\r\n if(typed_word[i]==word[index]):\r\n index+=1\r\n\r\n if(index<5):\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\n\r\n\r\ntyped_word = input()\r\nprint(solve(typed_word))\r\n# if_present_list = []\r\n# h = typed_word.find(\"h\",0)\r\n# if_present_list.append(h)\r\n# e = typed_word.find(\"e\",h+1)\r\n# if_present_list.append(e)\r\n# l1 = typed_word.find(\"l\",e+1)\r\n# if_present_list.append(l1)\r\n# l2 = typed_word.find(\"l\",l1+1)\r\n# if_present_list.append(l2)\r\n# o = typed_word.find(\"o\",l2+1)\r\n# if_present_list.append(o)\r\n\r\n# for i in if_present_list:\r\n# if i == -1:\r\n# print('NO')\r\n# break\r\n# elif i==(len(if_present_list)):\r\n# print('YES')\r\n\r\n", "#-------------------------------------------------------------------------------\r\n# Name: module1\r\n# Purpose:\r\n#\r\n# Author: vayun\r\n#\r\n# Created: 05/06/2022\r\n# Copyright: (c) vayun 2022\r\n# Licence: <your licence>\r\n#-------------------------------------------------------------------------------\r\n\r\nimport sys\r\n\r\ndef test(did_pass):\r\n \"\"\" Print the result of a test. \"\"\"\r\n linenum = sys._getframe(1).f_lineno # Get the caller's line number.\r\n if did_pass:\r\n msg = \"Test at line {0} ok.\".format(linenum)\r\n else:\r\n msg = (\"Test at line {0} FAILED.\".format(linenum))\r\n print(msg)\r\ndef hello(m):\r\n x = m.find('h')\r\n if x != -1:\r\n m = m[x+1:]\r\n x = m.find('e')\r\n if x != -1:\r\n m = m[x+1:]\r\n x = m.find('l')\r\n if x != -1:\r\n m = m[x+1:]\r\n x = m.find('l')\r\n if x != -1:\r\n m = m[x+1:]\r\n x = m.find('o')\r\n if x != -1:\r\n return True\r\n return False\r\n\r\nm = input()\r\nif hello(m) == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\nletter=['h','e','l','l','o']\nlow=0\nsum=0\nfor i in letter:\n if s.find(i,low)==-1:\n print('NO')\n break\n else:\n low=s.find(i,low)+1\n sum+=1\nif sum==5:\n print('YES')", "s = input()\n\nA = list(\"hello\")\ni = 0\nfor c in s:\n if c == A[i]:\n i += 1\n if i == 5:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n", "def solve(s):\r\n if s=='hello':\r\n return 'YES'\r\n else:\r\n confirm=''\r\n flag=0\r\n for i in s:\r\n if i=='h' and flag==0:\r\n confirm+=i\r\n flag=1\r\n elif i=='e' and flag==1:\r\n confirm+=i\r\n flag=2\r\n elif i=='l' and flag==2:\r\n confirm+=i\r\n flag=3\r\n elif i=='l' and flag==3:\r\n confirm+=i\r\n flag=4\r\n elif i=='o' and flag==4:\r\n confirm+=i\r\n flag=5\r\n \r\n if confirm=='hello' and flag==5:\r\n return 'YES'\r\n else:\r\n return'NO'\r\ns=input()\r\n\r\nprint(solve(s))", "s = input()\r\n\r\nflag_h = False\r\nflag_e = False\r\nflag_l = False\r\nflag_ll = False\r\nflag_o = False\r\n\r\nfor c in s:\r\n if c == 'h':\r\n flag_h = True\r\n\r\n elif c == 'e' and flag_h:\r\n flag_e = True\r\n\r\n elif c == 'l' and flag_e:\r\n if flag_l:\r\n flag_ll = True\r\n else:\r\n flag_l = True\r\n\r\n elif c == 'o' and flag_ll:\r\n flag_o = True\r\n break\r\n\r\nif flag_o:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "string = input()\nref_string = ['h', 'e', 'l', 'l', 'o']\nj = 0\nfor i in range(len(string)):\n if string[i] in ref_string[j]:\n j += 1\n if j ==5:\n break\nprint('YES' if j == 5 else 'NO')\n", "a = input()\r\nhello = ['h', 'e', 'l', 'l', 'o']\r\ni = 0\r\nfor j in a:\r\n if j == hello[i] and i <= 4:\r\n i += 1\r\n if i == 5:\r\n break\r\nif i == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = str(input())\r\nstate = 1\r\nfor character in s:\r\n if state == 1 and character == 'h':\r\n state += 1\r\n elif state == 2 and character == 'e':\r\n state += 1\r\n elif state == 3 and character == 'l':\r\n state += 1\r\n elif state == 4 and character == 'l':\r\n state += 1\r\n elif state == 5 and character == 'o':\r\n state += 1\r\n\r\nif state == 6:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "def solve():\r\n s = list(input())\r\n targ = list(\"hello\")\r\n while len(s) > 0:\r\n if len(targ) <= 0:\r\n break\r\n if s[-1] == targ[-1]:\r\n s.pop()\r\n targ.pop()\r\n else:\r\n s.pop()\r\n if len(targ) <= 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nsolve()", "s=list(input())\r\nh_c=0\r\ne_c=0\r\nl_c=0\r\no_c=0\r\nfor items in s:\r\n if items=='h' and h_c==0:\r\n h_c=1\r\n if items=='e' and h_c==1 and e_c==0:\r\n e_c=1\r\n if items=='l' and h_c==1 and e_c==1 and l_c<2:\r\n l_c+=1\r\n if items=='o' and h_c==1 and e_c==1 and l_c==2 and o_c==0:\r\n o_c=1\r\nif h_c==1 and e_c==1 and l_c==2 and o_c==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "y = input()\r\nn = 0\r\nr = 0\r\ndef useless():\r\n global n, r\r\n while n < len(y):\r\n if y[n] == \"h\":\r\n r+=1\r\n if r == 1:\r\n \r\n while n < len(y):\r\n if y[n] == \"e\":\r\n r+=1\r\n if r == 2:\r\n \r\n while n < len(y):\r\n if y[n] == \"l\":\r\n r+=1\r\n if r == 3:\r\n \r\n n+=1\r\n while n < len(y):\r\n if y[n] == \"l\":\r\n r+=1\r\n if r == 4:\r\n \r\n while n < len(y):\r\n if y[n] == \"o\":\r\n r+=1\r\n if r == 5:\r\n \r\n print(\"YES\")\r\n return\r\n else:\r\n n+=1\r\n print(\"NO\") \r\n return \r\n else:\r\n n+=1\r\n print(\"NO\")\r\n return \r\n else:\r\n n+=1\r\n print(\"NO\") \r\n return\r\n else:\r\n n+=1 \r\n print(\"NO\") \r\n return\r\n else:\r\n n+=1\r\n print(\"NO\")\r\n return \r\nif 1 <= len(y) <= 100:\r\n useless()", "letters = [[\"h\", False], [\"e\", False], [\"l\", False], [\"l\", False], [\"o\", False]]\r\ncur = 0\r\ns = input()\r\n\r\nfound = False\r\n\r\nfor c in s:\r\n if letters[cur][0] == c:\r\n letters[cur][1] = True\r\n cur += 1\r\n if cur >= len(letters):\r\n found = True\r\n break\r\n\r\nif found:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#2300012302 张惠雯\r\na = input()\r\nb = \"hello\"\r\ni = 0\r\nfor x in range(len(a)):\r\n if a[x] == b[i]:\r\n i = i + 1\r\n if i == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "str = input()\r\n\r\nfind = ['h', 'e', 'l', 'l', 'o']\r\nlength = len(str)\r\nfound = True\r\n\r\nfor i in find:\r\n ind = str.find(i)\r\n if (ind==-1):\r\n found = False\r\n break\r\n else:\r\n str = str[ind+1:length]\r\n\r\nif (found):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "thor = str(input())\nfor x in range(len(thor)):\n if thor[0]!=\"h\":\n thor = thor[1:]\nvalkyrie = 0\nfor x in range(len(thor)):\n if thor[x]==\"e\":\n valkyrie = valkyrie+1\n thor = thor[x+1:]\n break\nfor x in range(len(thor)):\n if thor[x]==\"l\":\n valkyrie = valkyrie+1 \n thor = thor[x+1:]\n break\nfor x in range(len(thor)):\n if thor[x]==\"l\":\n valkyrie = valkyrie+1 \n thor = thor[x+1:]\n break\nfor x in range(len(thor)):\n if thor[x]==\"o\":\n valkyrie = valkyrie+1 \n thor = thor[x+1:]\n break\nif valkyrie==4:\n print(\"YES\")\nelse:\n print(\"NO\")", "### s = [int(x) for x in input().split(\" \")]\r\n\r\ndef func(s: str):\r\n r = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\n for i in s:\r\n if i == r[0]:\r\n r = r[1:]\r\n if not r:\r\n return True\r\n return False\r\ns = input()\r\nprint(\"YES\" if func(s) else \"NO\")", "t=input()\nn=len(t)\nst=''\nlt='hello'\nj=0\nfor i in range(n):\n if t[i]==lt[j]:\n st=st+lt[j]\n j=j+1\n if j>4:\n break\nif st==lt:\n print('YES')\nelse:\n print('NO')\n \n\t\t \t\t\t \t\t \t \t \t\t\t\t\t\t\t \t \t", "g=[c for c in input()]\ni=0\no='NO'\nj=0\ncg=['h','e','l','l','o']\nwhile i<len(g):\n\tif g[i] == cg[j]:\n\t\tj+=1\n\tif j==len(cg):\n\t\to='YES'\n\t\tbreak\n\ti+=1\nprint(o)\n", "a=\"hello\"\r\ns=str(input())\r\ncur=0\r\nfor i in s:\r\n if i==a[cur]:cur+=1\r\n if cur==5:break\r\nif cur>=5:print(\"YES\")\r\nelse:print(\"NO\")", "s=input()\r\nh=s.find('h')\r\ne=s.find('e',h)\r\nl1=s.find('l',e)\r\nl2=s.find('l',l1+1)\r\no=s.find('o',l2)\r\n#print(h,e,l1,l2,o,end=' ')\r\nif h>=0 and e>0 and l1>0 and l2>0 and o >0 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\") \r\n\r\n", "word=input()\nhello=\"hello\"\nout=0\nfor i in range(len(hello)):\n\tif hello[i] in word:\n\t\tindex=word.index(hello[i])\n\t\tword=word[index+1:]\n\t\tout+=1\n\nif out==5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\n", "s = input()\r\na = s.find(\"h\")\r\nif (a<0): print(\"NO\")\r\nelse:\r\n s = s[a+1:]\r\n a = s.find(\"e\")\r\n if (a<0): print(\"NO\")\r\n else:\r\n s = s[a+1:]\r\n a = s.find(\"l\")\r\n if (a<0): print(\"NO\")\r\n else:\r\n s = s[a+1:]\r\n a = s.find(\"l\")\r\n if (a<0): print(\"NO\")\r\n else:\r\n s = s[a+1:]\r\n a = s.find(\"o\")\r\n if (a<0): print(\"NO\")\r\n else: print(\"YES\")\r\n ", "n=input()\r\nif n.find('h')!=-1:\r\n if n[n.find('h'):].find('e')!=-1:\r\n n=n[n.find('h'):]\r\n if n[n.find('e'):].find('l')!=-1:\r\n n=n[n.find('e'):]\r\n if n[n.find('l')+1:].find('l')!=-1:\r\n m=n[n.find('l')+1:]\r\n k=m[m.find('l'):]\r\n if k.find('o')!=-1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "s = input()\r\ncheck = \"hello\"\r\nchecker = \"\"\r\npos = 0\r\n \r\nfor i in s:\r\n if checker == \"hello\" or pos > 4:\r\n break\r\n \r\n if i == check[pos]:\r\n checker += i\r\n pos += 1\r\n \r\nif checker == \"hello\":\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")\r\n", "x = input()\ny = len(x)\nt = -1\ns = ''\nfor i in range(y):\n if x[i] == 'h':\n s += 'h'\n for j in range(i+1, y):\n if x[j] == 'e':\n s += 'e'\n for k in range(j+1, y):\n if x[k] == 'l':\n s += 'l'\n for h in range(k+1, y):\n if x[h] == 'l':\n s += 'l'\n for o in range(h+1, y):\n if x[o] == 'o':\n s += 'o'\n break\n break\n break\n break\n break\nif s == 'hello':\n print('YES')\nelse:\n print('NO')", "n=input()\r\ni=0\r\ns='hello'\r\nalp=0\r\nwhile i<len(n) and alp<=4:\r\n if n[i]==s[alp]:\r\n alp=alp+1\r\n i=i+1\r\n else:\r\n i=i+1\r\nif alp>=5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "d=list(input(\"\"))\r\nk=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nl=0\r\nfor i in d:\r\n if l<5:\r\n if i == k[l]:\r\n l+=1\r\n else:\r\n pass\r\nif l==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "strs = input()\r\nflag = 0\r\nhello = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nfor _ in strs:\r\n if _ == hello[flag]:\r\n flag += 1\r\n if flag == 5:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "import re\r\n\r\n\r\ndef solve() -> None:\r\n s: str = input()\r\n if re.match(r'\\w*h\\w*e\\w*l\\w*l\\w*o\\w*', s):\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\nsolve()", "hello = 'hello'\nhello_n = 5\ns = input()\ns_n = len(s)\ni = 0\nj = 0\nwhile i<s_n and j<hello_n:\n\tif s[i]!=hello[j]:\n\t\ti+=1\n\telse:\n\t\tj += 1\n\t\ti += 1\nif j==hello_n:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "a=input()\r\nb=len(a)\r\nc=[]\r\nd=a.find('h')\r\ne=a.find('e',d,b)\r\nf=a.find('l',e,b)\r\ng=a.find('l',f+1,b)\r\nh=a.find('o',g,b)\r\nif d<e<f<g<h:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def solve(word):\r\n\ti = 0\r\n\tfor n in word:\r\n\t\tif n == 'h' and i == 0:\r\n\t\t\ti = 1\r\n\t\tif n == 'e' and i == 1:\r\n\t\t\ti = 2\r\n\t\tif (n == 'l' and i == 2) or (n == 'l' and i == 3):\r\n\t\t\ti += 1\r\n\t\tif n == 'o' and i == 4:\r\n\t\t\treturn True\r\n\treturn 0\r\n\r\nif __name__ == '__main__':\r\n\tx = str(input())\r\n\tif solve(x) == True:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "s=input()\r\nl=len(s)\r\na=0\r\nfor i in range(l):\r\n if s[i]=='h':\r\n break\r\nfor i in range(i+1,l):\r\n if s[i]=='e':\r\n break\r\nfor i in range(i+1,l):\r\n if s[i]=='l':\r\n break\r\nfor i in range(i+1,l):\r\n if s[i]=='l':\r\n break\r\nfor i in range(i+1,l):\r\n if s[i]=='o':\r\n a=a+1\r\n else:\r\n a=a\r\nif a!=0:\r\n print('YES')\r\nelse:\r\n print('NO')", "compare = list(\"hello\")\r\n\r\ntest = list(input())\r\nind = 0\r\nwhile len(compare) > 0:\r\n if test[ind] == compare[0]:\r\n compare.pop(0)\r\n # print(compare)\r\n ind += 1 \r\n if ind >= len(test):\r\n break \r\nif len(compare) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "s = input()\r\nsref = \"hello\"\r\ni = 0\r\ntrovata = False\r\nfor c in s:\r\n if c == sref[i]:\r\n i+=1\r\n if i==len(sref):\r\n trovata = True\r\n break\r\nprint(\"YES\" if trovata else \"NO\")", "# coding: utf-8\r\ns=input()\r\nl = len(s)\r\nt = True\r\nfor i in range(l):\r\n if s[i]=='h':\r\n for i2 in range(i+1,l):\r\n if s[i2]=='e':\r\n for i3 in range(i2+1,l):\r\n if s[i3]=='l':\r\n for i4 in range(i3+1,l):\r\n if s[i4]=='l':\r\n for i5 in range(i4+1, l):\r\n if s[i5] == 'o':\r\n t = False\r\n break\r\nif t:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "a='hello'\r\ns=input()\r\nc=0\r\nw=''\r\nfor i in s:\r\n if w!='hello':\r\n if i==a[c]:\r\n w+=i\r\n c+=1\r\n elif len(w)!=0:\r\n if i==w[-1]:\r\n continue\r\n else:\r\n c=0\r\n else:\r\n break\r\nif w=='hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "m=[\"h\",\"e\",\"l\",\"l\",\"o\"]\na=str(input())\ni =0\nfor j in range(len(a)):\n\tif(i<len(m) and m[i]==a[j]):\n\t\ti+=1\nif(i==5):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\t\t", "n = input()\r\nmy_list = []\r\nfor i in n:\r\n if len(my_list) < 1 and i == \"h\":\r\n my_list.append(i)\r\n if len(my_list) == 1 and i == \"e\":\r\n my_list.append(i)\r\n if len(my_list) > 1 and len(my_list) < 4 and i == \"l\":\r\n my_list.append(i)\r\n if len(my_list) == 4 and i == \"o\":\r\n my_list.append(i)\r\nif my_list == [\"h\", \"e\", \"l\", \"l\", \"o\"]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nc=0\r\nfor i in range(len(s)):\r\n if c==0 and s[i]=='h':\r\n c+=1\r\n elif c==1 and s[i]=='e':\r\n c+=1\r\n elif c==2 and s[i]=='l':\r\n c+=1\r\n elif c==3 and s[i]=='l':\r\n c+=1\r\n elif c==4 and s[i]=='o':\r\n c+=1\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "b = input()\r\na = 'hello'\r\nq = 0\r\nfor j in range(len(b)):\r\n\r\n try:\r\n if a[j] not in b:\r\n print('NO')\r\n q = 1\r\n break\r\n c = b.find(a[j])\r\n b = b[c + 1:]\r\n if a[j + 1] in b:\r\n continue\r\n else:\r\n print('NO')\r\n q = 1\r\n break\r\n except IndexError:\r\n pass\r\nif q == 0:\r\n print('YES')", "n=input()\r\ns=\"hello\"\r\nb=0\r\nm=0\r\nfor i in range(len(n)):\r\n if(n[i]==s[b]):\r\n b+=1\r\n if b==5:\r\n print(\"YES\")\r\n m=1\r\n break\r\nif(m!=1):\r\n print(\"NO\")", "\r\ns=iter(input())\r\nres = \"\"\r\nfor c in \"hello\":\r\n if c in s:\r\n res += c\r\n\r\nif res == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\ns2 = 'hello'\r\nj = 0\r\nfor char in s:\r\n if j == len(s2):\r\n break \r\n elif char == s2[j]:\r\n j += 1\r\n\r\nif j == len(s2):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "s = input()\r\nl = \"hello\"\r\nans = False\r\nn = 0\r\nfor i in s:\r\n if i == l[n]:\r\n n+=1\r\n if n == 5:\r\n ans = True\r\n break\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python\r\n# coding=utf-8\r\n\r\ns = input()\r\nt = 'hello'\r\nt_i = 0\r\nfor i in range(len(s)):\r\n if t_i >= 5:\r\n break\r\n if s[i] == t[t_i]:\r\n t_i += 1\r\nif t_i >= 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\na='hello'\r\nb=0\r\nfor i in n:\r\n\tif i==a[b]:\r\n\t\tb+=1\r\n\tif b==5:\r\n\t\tbreak\t\t\t\r\nif b>=5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s=input()\r\nt='hello'\r\nl=[]\r\ni=0\r\nj=0\r\nwhile i<len(s) and j<5:\r\n if s[i]==t[j]:\r\n l.append(t[j])\r\n j=j+1\r\n i+=1\r\nif t==''.join(l):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=iter(input());print('NYOE S'[all(c in s for c in 'hello')::2])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 26 15:27:33 2019\r\n\r\n@author: lfy\r\n\"\"\"\r\n\r\n#chatroom\r\ndef fac(s,ch):\r\n l=list(s)\r\n i=s.find(ch)\r\n l=l[i+1:]\r\n \r\n s=\"\".join(l)\r\n return s\r\ndef yon(s,ch):\r\n if ch in s:\r\n return True\r\n return False\r\ndef helloo(s,ch):\r\n if yon(s,ch) is True:\r\n return fac(s,ch)\r\n return \"NO\" \r\ndef hello(s):\r\n for i in \"hello\":\r\n s=helloo(s,i)\r\n if s==\"NO\":\r\n return s\r\n return \"YES\"\r\ndef main():\r\n s=input()\r\n print(hello(s))\r\n \r\nif __name__=='__main__':\r\n main()\r\n ", "a=input()\r\nb='hello'\r\ns=0\r\nfor i in a:\r\n if i==b[s]:\r\n s=s+1\r\n if s>4:\r\n break\r\nif s>4:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def order(str_1, str_2):\r\n l = len(str_1);mark = -1\r\n for i in range(l):\r\n mark = str_2.find(str_1[i], mark + 1)\r\n if mark == -1:\r\n return False\r\n return True\r\n\r\nstr_1 = \"hello\";str_2 = input()\r\nif order(str_1, str_2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = input()\r\nb = \"hello\"\r\nfor c in word:\r\n if b == \"\":\r\n break\r\n elif c == b[0]:\r\n b = list(b)\r\n b.remove(b[0])\r\n b = ''.join(b)\r\nif b == \"\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = input()\n\nhello = 'hello'\ni = 0\n\nfor c in word:\n if c == hello[i]:\n i += 1\n if i == 5:\n print('YES')\n break\n\nif i != 5:\n print('NO')\n\n \t \t\t \t \t \t \t\t \t\t \t\t\t\t\t\t\t", "word = input()\r\ntarget ='hello'\r\ni = 0\r\n\r\nfor char in word:\r\n \r\n if char == target[i]: \r\n i+=1\r\n if i ==5 :\r\n break\r\n\r\nprint(\"YES\" if i==5 else \"NO\")\r\n", "s = input(); o = ''; j = 0\r\nfor i in s:\r\n if i == 'hello'[j%5]:\r\n o += i\r\n j += 1\r\nprint('YNEOS'[not 'hello' in o::2])", "s = input()\r\nword = 'hello'\r\nword = [c for c in word]\r\nans = 'NO'\r\nfor c in s:\r\n if (c == word[0]):\r\n word.pop(0)\r\n if (not word):\r\n ans = 'YES'\r\n break\r\nprint (ans)", "# n, k = map(int, input().split())\r\n# arr = [int(i) for i in input().split()]\r\n# arr.sort()\r\n# c = 0\r\n# if n < 3:\r\n# print(0)\r\n# else:\r\n# for i in range(n // 3):\r\n# m = max(arr[i*3:i*3 + 3])\r\n# if m*k <= 5:\r\n# c += 1\r\n# else:\r\n# break\r\n# print(c)\r\n\r\n# n = int(input())\r\n# arr = [int(i) for i in input().split()]\r\n# p, m, pe = arr.count(1), arr.count(2), arr.count(3)\r\n# teams = min(p, m, pe)\r\n# print(teams)\r\n# indexarr = list(range(n))\r\n# for i in range(1, n):\r\n# j = i - 1\r\n# key = arr[i]\r\n# key2 = indexarr[i]\r\n# while arr[j] > key and j >= 0:\r\n# arr[j+1] = arr[j]\r\n# indexarr[j+1] = indexarr[j]\r\n# arr[j] = key\r\n# indexarr[j] = key2\r\n# j -= 1\r\n# print(arr)\r\n# print(indexarr)\r\n# for _ in range(teams):\r\n# x = arr.index(1)\r\n# y = arr.index(2)\r\n# z = arr.index(3)\r\n# print(x, y, z)\r\n# # print(indexarr[x], indexarr[z], indexarr[z])\r\n# arr.remove(1)\r\n# arr.remove(2)\r\n# arr.remove(3)\r\n# k = 0\r\n# for i in sorted([x, y, z]):\r\n# indexarr.pop(i - k)\r\n\r\n\r\n\r\n# def fun(n):\r\n# s = 0\r\n# arr =set()\r\n# while n:\r\n# s += (n % 10)**2\r\n# n //= 10\r\n# if n == 0:\r\n# if s == 1:\r\n# return True\r\n# elif s in arr:\r\n# return False\r\n# arr.add(s)\r\n# n = s\r\n# s = 0\r\ns = input()\r\nr = 'hello'\r\nfor i in r:\r\n index = s.find(i)\r\n s = s[index+1:]\r\n if index == -1:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n\r\n", "s = input()\r\n\r\nst = 'hello'\r\n\r\na = 0\r\nfor i in range(len(s)):\r\n\tif a < 5:\r\n\t\tif s[i] == st[a]:\r\n\t\t\ta += 1\r\n\r\nif a == 5:\r\n \tprint('YES')\r\nelse:\r\n \tprint(\"NO\")", "def has_consecutive_hello(word):\r\n word = word.lower()\r\n hello = \"hello\"\r\n \r\n i = 0 # Index in 'word'\r\n j = 0 # Index in 'hello'\r\n \r\n while i < len(word) and j < len(hello):\r\n if word[i] == hello[j]:\r\n j += 1\r\n i += 1\r\n \r\n return j == len(hello)\r\n\r\nword = input()\r\n\r\nif (has_consecutive_hello(word)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = input().lower()\r\nhello = list(\"hello\")\r\nfor letter in word:\r\n if hello:\r\n if letter == hello[0]:\r\n hello.pop(0)\r\nif hello:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s = input()\r\ntest = 'hello'\r\nj = 0\r\nfor i in range(len(s)):\r\n if s[i] == test[j]:\r\n j+=1\r\n if j == 5:\r\n print('YES')\r\n break\r\nif j!=5:\r\n print('NO')\r\n \r\n", "t = 'hello'\r\ns = input()\r\n\r\ntemp = 0\r\nans = \"NO\"\r\nfor i in range(len(s)):\r\n if s[i]==t[temp]:\r\n temp+=1\r\n if temp>=len(t):\r\n ans = 'YES'\r\n break\r\n\r\nprint(ans) \r\n\r\n\r\n\r\n\r\n\r\n", "def can_say_hello(s):\r\n hello_index = 0\r\n for char in s:\r\n if char == \"hello\"[hello_index]:\r\n hello_index += 1\r\n if hello_index == 5:\r\n return \"YES\"\r\n return \"NO\"\r\ns = input().strip()\r\nprint(can_say_hello(s))\r\n", "a = input()\r\ns = \"hello\"\r\nc = 0\r\nres = \"NO\"\r\nfor i in a:\r\n if(i == s[c]):\r\n c += 1\r\n if(c == 5):\r\n res = \"YES\"\r\n break\r\nprint(res)\r\n", "a=input()\r\nb=['h','e','l','l','o']\r\ni=-1\r\nfor j in b:\r\n i=a.find(j,i+1)\r\n if i==-1:\r\n print('NO')\r\n exit()\r\nprint('YES')", "chatroom=iter(input());\r\n\r\nprint('NYOE S'[all(o in chatroom for o in 'hello')::2])", "def check_hello(word):\r\n hello = \"hello\"\r\n i = 0\r\n for letter in word:\r\n if letter == hello[i]:\r\n i += 1\r\n if i == len(hello):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n# Read the input word\r\nword = input()\r\n\r\n# Check if Vasya managed to say hello\r\nresult = check_hello(word)\r\nprint(result)\r\n", "tere = input()\r\nluger = 0\r\n\r\nfor i in range(len(tere)):\r\n if luger == 0:\r\n if tere[i] == \"h\":\r\n luger += 1\r\n \r\n else:\r\n continue\r\n \r\n elif luger == 1:\r\n if tere[i] == \"e\":\r\n luger += 1\r\n \r\n else:\r\n continue\r\n \r\n elif luger == 2 or luger == 3:\r\n if tere[i] == \"l\":\r\n luger += 1\r\n \r\n else:\r\n continue\r\n \r\n elif luger == 4:\r\n if tere[i] == \"o\":\r\n luger += 1\r\n \r\n else:\r\n continue\r\n\r\n\r\nif luger >= 5:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb='hello'\r\nk=0\r\ns=''\r\nfor i in a:\r\n if k<5:\r\n if i==b[k]:\r\n s=s+i\r\n k=k+1\r\n else:\r\n break\r\nprint('YNEOS'[s!=b::2])", "word = input()\n\nh = \"hello\"\n\n\ndef solve():\n i = 0\n for c in word:\n if c == h[i]:\n i += 1\n if i == len(h):\n return \"YES\"\n return \"NO\"\nprint(solve())\n", "s = input()\r\n\r\nhello = None\r\nfor i in s:\r\n if i == \"h\" and hello == None:\r\n hello = \"h\"\r\n elif i == \"e\" and hello == \"h\":\r\n hello = hello + i\r\n elif i == \"l\" and hello == \"he\":\r\n hello = hello + i\r\n elif i == \"l\" and hello == \"hel\":\r\n hello = hello + i\r\n elif i == \"o\" and hello == \"hell\":\r\n hello = hello + i\r\n print(\"YES\")\r\n break\r\nelse: \r\n print(\"NO\")", "s = input()\r\ns = s.lower()\r\n\r\ndp = [0]*5\r\ndata = 'hello'\r\ncnt = 0\r\n\r\nfor c in s:\r\n if c == data[cnt]:\r\n dp[cnt] += 1\r\n cnt += 1\r\n \r\n if cnt == 5:\r\n break\r\n\r\nif sum(dp) == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input().lower()\r\nmylist=['h', 'e', 'l', 'l', 'o']\r\nans=\"\"\r\nplace=mylist[0]\r\ni=0\r\nwhile i<len(s) and mylist:\r\n if place==s[i]:\r\n ans+=place\r\n mylist.remove(place)\r\n if mylist:\r\n place=mylist[0]\r\n i+=1\r\nif ans=='hello':print('YES')\r\nelse:print('NO')\r\n#############################\r\n# s=iter(input())\r\n# x = all(c in s for c in 'hello')\r\n# if x:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n ", "n = input()\r\nans = ''\r\nfor i in range (0,len(n)):\r\n #print(ans)\r\n if n[i] == 'h':\r\n if len(ans) == 0:\r\n ans = ans + n[i]\r\n elif n[i] == 'e':\r\n if len(ans) == 1:\r\n ans = ans + n[i]\r\n elif n[i] == 'l' :\r\n if len(ans) == 2 or len(ans) == 3:\r\n if ans.count('l') < 2:\r\n ans = ans + n[i]\r\n elif n[i] == 'o':\r\n if len(ans) == 4:\r\n ans = ans + n[i]\r\nif ans == 'hello':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n \r\n ", "string = input()\r\nto_match = ['h', 'e', 'l', 'l', 'o']\r\ndef find_sol(string, to_match, match_index):\r\n i = 0\r\n if(len(string) == 0 or match_index > 4):\r\n return match_index\r\n for val in string:\r\n i += 1\r\n if(match_index < 5 and val == to_match[match_index]):\r\n match_index += 1\r\n break\r\n return find_sol(string[i:], to_match, match_index)\r\nval = find_sol(string, to_match, 0)\r\nif(val == len(to_match)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word=input().lower()\r\njo=\"\"\r\nhell=\"hello\"\r\nc=0\r\nfor i in word:\r\n if i == hell[c]:\r\n jo+=i\r\n if c==4:\r\n break\r\n c+=1\r\nif hell == jo:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import random\ns=input()\nflag=0\nfor i in s:\n if flag == 0 and i == 'h':\n flag = flag + 1\n elif flag == 1 and i == 'e':\n flag = flag +1\n elif flag ==2 and i == 'l':\n flag = flag +1\n elif flag == 3 and i =='l':\n flag = flag + 1\n elif flag == 4 and i =='o':\n flag = flag + 1\nif flag == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t\t \t\t \t \t \t\t \t\t\t \t\t\t\t \t\t \t", "s = input()\r\nx = list(s)\r\nsample = list(\"he\")\r\n\r\nif \"h\" in x:\r\n x = x[x.index(\"h\") + 1:]\r\n if \"o\" in x:\r\n x = x[::-1][x[::-1].index(\"o\") + 1:][::-1]\r\n if \"e\" in x:\r\n x = x[x.index(\"e\") + 1:]\r\n if \"l\" in x:\r\n x = x[::-1][x[::-1].index(\"l\") + 1:][::-1]\r\n if \"l\" in x:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nj=0\r\na=['h','e','l','l','o']\r\nfor i in range(len(s)):\r\n if(s[i]==a[j]):\r\n j+=1\r\n if(j==5):\r\n print('YES')\r\n break\r\nif(j!=5):\r\n print('NO')", "str1 = 'hello'\r\nstr2 = input()\r\nnum = 0\r\nj = 0\r\nfor i in str2:\r\n if i == str1[j]:\r\n num = num+1\r\n j = j+1\r\n if j >= 5:\r\n break\r\nif j>=5:\r\n print('YES')\r\nelse:\r\n print('NO')", "x=input()\r\ny=\"hello\"\r\nz=0\r\nfor i in x:\r\n if(z<len(y) and i==y[z]):\r\n z+=1\r\n if(z==len(y)):\r\n break\r\nif(z>=len(y)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\nsl='hello'\nsh=0\nfor i in range(len(s)):\n if sh<5 and s[i]==sl[sh]:\n sh+=1\nif sh==len(sl):\n print('YES')\nelse:\n print('NO')", "a = \"hello\"\r\ndef chatroom() :\r\n x = 0\r\n b = input()\r\n for i in range(len(b)):\r\n if (b[i]==a[x]):\r\n x += 1\r\n if(x==5):\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chatroom())", "import re\r\npattern=\".*h.*e.*l.*l.*o.*\"\r\nif(re.match(pattern,input())):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nh = s.find('h')\r\ns = s[h:]\r\ne = s.find('e')\r\ns = s[e:]\r\nl1 = s.find('l')\r\ns = s[l1+1:]\r\nl2 = s.find('l')\r\ns = s[l2:]\r\no = s.find('o')\r\na = min(h, e, l1, l2, o)\r\nprint('NYOE S'[a >= 0::2])\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 17 19:35:44 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nw = list(input())\r\nadd = 0\r\nls = ['h','e','l','l','o']\r\nfor le in ls :\r\n for i in range(len(w)) :\r\n if w[i] == le :\r\n w = w[i+1:]\r\n add += 1\r\n break\r\nif add == 5 :\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nind_h = s.find('h')\r\nind_e = s.find('e', ind_h + 1)\r\nind_L1 = s.find('l', ind_e + 1)\r\nind_L2 = s.find('l', ind_L1 + 1)\r\nind_o = s.find('o', ind_L2 + 1)\r\nif ind_h >= 0 and ind_e >= 0 and ind_L1 >= 0 and ind_L2 >= 0 and ind_o >= 0:\r\n print(\"YES\")\r\nelse:\r\n print('NO')\r\n", "s = input().lower()\nh = s.find('h')\ne = s.find('e', h + 1)\nl1 = s.find('l', e + 1)\nl2 = s.find('l', l1 +1)\no = s.find('o', l2 + 1)\nif h < 0 or e < 0 or l1 < 0 or l2 < 0 or o < 0:\n print('NO')\nelse:\n print('YES')", "x=input()\r\ntest=\"hello\"\r\nit=0\r\n\r\nfor i in range(len(x)):\r\n if it<len(test) and x[i]==test[it]:\r\n it+=1\r\n \r\nif len(test)==it:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s = input().lower()\r\nind1 = s.find(\"h\")\r\nind2 = s.find(\"e\", ind1+1)\r\nind3 = s.find(\"l\", ind2+1)\r\nind4 = s.find(\"l\", ind3+1)\r\nind5 = s.find(\"o\", ind4+1)\r\nif ind5>ind4>ind3>ind2>ind1>-1:\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nhel = 'hello'\r\nexp = 0\r\nfor i in s:\r\n if i == hel[exp]:\r\n exp+=1\r\n if exp == len(hel):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "def order(list_1, list_2):#判断序列1能否在序列2中找到的函数\r\n l = len(list_1); mark = -1\r\n for i in range(l):\r\n try:\r\n mark = list_2.index(list_1[i], mark+1)\r\n except:\r\n return False\r\n return True\r\n\r\nmessage = input();l = len(message)\r\nlist_1 = ['h','e','l','l','o']; list_2 = []\r\nfor i in range(l):\r\n list_2.append(message[i])#将字符串信息存贮在可变序列list_2中\r\nif order(list_1, list_2):#输出答案\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from re import search\r\n\r\nprint(\"YES\" if search(r'h+.*e+.*l+.*l+.*o+', input()) is not None else \"NO\")\r\n\r\n", "s = input().lower()\r\nd = \"hello\"\r\nfor i in s:\r\n if i==d[0]:\r\n d = d[1::]\r\n if d==\"\":\r\n break\r\nif d==\"\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=str(input())\r\nx=\"\"\r\nfor i in range(len(s)):\r\n if s[i]==\"h\" or s[i]==\"e\" or s[i]==\"l\" or s[i]==\"o\":\r\n x=x+s[i]\r\ns=x.lower()\r\nfor i in range(len(s)):\r\n if(s.find(\"hh\")!=-1):\r\n s=s.replace(\"hh\", \"h\")\r\n if(s.find(\"ee\")!=-1):\r\n s=s.replace(\"ee\", \"e\")\r\n if (s.find(\"lll\")!=-1):\r\n s=s.replace(\"lll\", \"ll\")\r\n if (s.find(\"oo\")!=-1):\r\n s=s.replace(\"oo\", \"o\")\r\nif (s.find(\"h\")!=-1):\r\n s=s.replace(s[0:s.index(\"h\")+1],\"1\",1)\r\nif(s.find(\"1\")!=-1) and (s.find(\"e\")!=-1):\r\n if (s.find(\"1e\")==-1):\r\n s=s.replace(s[int(s.index(\"1\")+1):s.index(\"e\")+1],\"2\",1)\r\n else:\r\n s = s.replace(\"e\", \"2\", 1)\r\nif(s.find(\"12\")!=-1) and (s.find(\"l\")!=-1):\r\n if (s.find(\"12l\") == -1):\r\n s=s.replace(s[int(s.index(\"2\")+1):s.index(\"l\")+1],\"3\",1)\r\n else:\r\n s = s.replace(\"l\", \"3\", 1)\r\nif(s.find(\"123\")!=-1) and (s.find(\"l\")!=-1):\r\n if (s.find(\"123l\") == -1):\r\n s=s.replace(s[int(s.index(\"3\")+1):s.index(\"l\")+1],\"4\",1)\r\n else:\r\n s = s.replace(\"l\", \"4\", 1)\r\nif(s.find(\"1234\")!=-1) and (s.find(\"o\")!=-1):\r\n if (s.find(\"1234o\") == -1):\r\n s=s.replace(s[int(s.index(\"4\")+1):s.index(\"o\")+1],\"5\",1)\r\n else:\r\n s = s.replace(\"o\", \"5\", 1)\r\n# print(s)\r\nif(s.find(\"12345\")!=-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n# if s.find('h(.*?)e(.*?)l(.*?)l(.*?)o')!=-1:\r\n# print(\"NO\")\r\n# else:print(\"YES\")", "import re\r\n \r\nstring = input()\r\nmatch = re.match('\\w*[h]+\\w*[e]+\\w*[l]+\\w*[l]+\\w*[o]+', string)\r\n \r\nif match:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = str(input())\r\ns = s.lower()\r\nslist = list(s)\r\nfound = 0\r\nlen = len(slist)\r\nfor i in range(0, len):\r\n if found == 0: # bndwr 3la H\r\n if slist[i] == 'h':\r\n found += 1\r\n elif found == 1: # bndwr 3la E\r\n if slist[i] == 'e':\r\n found += 1\r\n elif found == 2: # bndwr 3la L\r\n if slist[i] == 'l':\r\n found += 1\r\n elif found == 3: # bndwr 3la L\r\n if slist[i] == 'l':\r\n found += 1\r\n elif found == 4: # bndwr 3la O\r\n if slist[i] == 'o':\r\n found += 1\r\nif found == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nx = len(s)\r\ni = 0\r\nwhile(i<x and s[i]!='h'):\r\n i = i+1\r\ni = i+1\r\nwhile(i<x and s[i]!='e'):\r\n i = i+1\r\ni = i+1\r\nwhile(i<x and s[i]!='l'):\r\n i = i+1\r\ni = i+1\r\nwhile(i<x and s[i]!='l'):\r\n i = i+1\r\ni = i+1\r\nwhile(i<x and s[i]!='o'):\r\n i = i+1\r\nif(i<x):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "x = [i for i in input()]\r\n\r\nif len(x) < 5:\r\n print(\"NO\")\r\n exit()\r\n \r\nwhile x[0] != \"h\" and len(x) > 5:\r\n x.pop(0)\r\n \r\nwhile x[1] != \"e\" and len(x) > 5:\r\n x.pop(1)\r\n\r\nwhile x[2] != \"l\" and len(x) > 5:\r\n x.pop(2)\r\n \r\nwhile x[3] != \"l\" and len(x) > 5:\r\n x.pop(3)\r\n \r\nwhile x[4] != \"o\" and len(x) > 5:\r\n x.pop(4)\r\n \r\na = ''.join(x)\r\n\r\nif a[:5] == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# A. Chat Room /problem/58/A\r\n\r\ns = \"hello\"\r\na = input()\r\nctr = 1\r\nfor i in s:\r\n if a.find(i) == -1:\r\n ctr = 0\r\n break\r\n a = a[a.find(i)+1:]\r\nprint([\"NO\",\"YES\"][ctr])\r\n \r\n", "a=input()\r\nb=len(a)\r\nd=0\r\nfor i in range (b):\r\n if a[i]=='h' and d==0:\r\n d+=1\r\n elif a[i]=='e' and d==1:\r\n d+=1\r\n elif a[i]=='l' and d==2:\r\n d+=1\r\n elif a[i]=='l' and d==3:\r\n d+=1\r\n elif a[i]=='o' and d==4:\r\n d+=1\r\nif d==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\na=len(s)\r\nm=\"hello\"\r\nx=0\r\nflag=0\r\nfor i in range(a):\r\n if s[i] == m[x]:\r\n x += 1\r\n if x == 5:\r\n flag+=1\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nh=0\r\ne=0\r\nl1=0\r\nl2=0\r\no=0\r\nfor i in range(len(s)):\r\n if s[i]=='h':\r\n h=1\r\n elif s[i]=='e' and h==1:\r\n e=1\r\n elif s[i]=='l' and e==1:\r\n l1=1\r\n e=0\r\n elif s[i]=='l' and l1==1:\r\n l2=1\r\n elif s[i]=='o' and l2==1:\r\n o=1\r\n \r\nif o==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\nword = \"\"\r\ncount = 0\r\nfor i in s:\r\n if i == \"h\":\r\n if count == 0:\r\n count = 1\r\n elif i == \"e\":\r\n if count == 1:\r\n count = 2\r\n elif i == \"l\":\r\n if count == 2 or count == 3:\r\n count +=1\r\n elif i == \"o\":\r\n if count == 4:\r\n count = 5\r\n print (\"YES\")\r\n\r\nif count != 5:\r\n print (\"NO\")\r\n \r\n", "m = input()\nl=['h','e','l','l','o']\nk=0\nfor i in range(len(m)):\n\tif m[i] == l[k]:\n\t\tk= k+1\n\tif k==5:\n\t\tprint('YES')\n\t\tbreak\nif k<5:\n\tprint('NO')", "def chatroom(s):\r\n a = ['h', 'e', 'l', 'l', 'o']\r\n j = 0\r\n i = 0\r\n while(i<len(s) and j<len(a)):\r\n if(s[i]==a[j]):\r\n j+=1\r\n i+=1\r\n if(j==len(a)):\r\n return \"YES\"\r\n return 'NO'\r\n \r\n\r\ns = input()\r\nprint(chatroom(s))", "s = input()\r\na = \"hello\"\r\nj = 0\r\nfor i in s:\r\n if i == a[j]:\r\n j += 1\r\n if j > 4:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def check(s):\r\n n=len(s)\r\n re='hello'\r\n index=0\r\n s0=re[index]\r\n s3=''\r\n for i in range(n):\r\n if(s[i]==s0):\r\n s3+=s[i]\r\n if(i!=n-1):\r\n if(s[i+1]==s0):\r\n i+=1\r\n index+=1\r\n if(index>=5):break\r\n s0=re[index]\r\n return s3==re\r\n \r\ns=input()\r\nif(check(s)):print('YES')\r\nelse:print('NO')\r\n", "x=input()\r\n\r\na=x.find(\"h\")\r\nx=x[a+1:]\r\nb=x.find(\"e\")\r\nx=x[b+1:]\r\nc=x.find(\"l\")\r\nx=x[c+1:]\r\nd=x.find(\"l\")\r\nx=x[d+1:]\r\ne=x.find(\"o\")\r\nif(a==-1 or b==-1 or c==-1 or d==-1 or e==-1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "import sys\r\n\r\ns = sys.stdin.readline().strip()\r\nseek = \"hello\"\r\nseek_idx = 0\r\n\r\nfor c in s:\r\n if c == seek[seek_idx]:\r\n seek_idx += 1\r\n if seek_idx == len(seek):\r\n print(\"YES\")\r\n sys.exit(0)\r\n\r\nprint(\"NO\")", "import sys\r\n\r\ndef scroll(c, ind):\r\n for i in range(ind, len(s)):\r\n if s[i] == c:\r\n return i\r\n \r\n print(\"NO\")\r\n sys.exit()\r\n \r\ns = input()\r\n\r\nind = scroll('h', 0)\r\nind = scroll('e', ind + 1)\r\nind = scroll('l', ind + 1)\r\nind = scroll('l', ind + 1)\r\nind = scroll('o', ind + 1)\r\nprint(\"YES\")", "x = input()\r\nt = \"hello\"\r\ni =0\r\nfor nums in range(len(x)):\r\n if x[nums] == t[i]:\r\n i+=1\r\n if i == 5:\r\n print(\"YES\")\r\n break\r\nif i!=5:\r\n print(\"NO\")\r\n", "# cook your dish here\ncom='hello'\ny={}\ncount=0\nflag=0\nfor i in input().strip():\n if i=='h':\n y[count]=0\n count+=1\n for j in range(len(y)):\n if y[j]<=4 and i==com[y[j]]:\n y[j]+=1\n if(y[j]==5):\n flag=1\n print('YES')\n break \n if flag==1:\n break \nif(flag==0):\n print('NO')\n \n\n", "str = \"hello\"\r\n\r\ns = input()\r\n\r\nitr = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == str[itr]:\r\n itr += 1\r\n if itr == len(str):\r\n print(\"YES\")\r\n break\r\n\r\nif itr != len(str):\r\n print(\"NO\")\r\n", "string = input()\r\nword = \"hello\"\r\nalp = word[0]\r\nj = 0\r\nfor i in string:\r\n if(j < 4 and i == alp):\r\n alp = word[j+1]\r\n j += 1\r\n elif(j == 4 and i == alp):\r\n j += 1\r\n break\r\nif(j == 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nc=mx=0\r\nnew=0\r\nfor i in s:\r\n if i=='h':\r\n c=1\r\n if c<mx:\r\n c=mx\r\n if i=='e' and c==1:\r\n c=2\r\n if c<mx:\r\n c=mx\r\n if i=='l' and c==2 or c==3:\r\n new+=1\r\n if new>=2:\r\n c=3\r\n if c<mx:\r\n c=mx\r\n if i=='o' and c==3:\r\n c=4\r\n if c<mx:\r\n c=mx\r\n break\r\n mx=c\r\nif c==4:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input().split()\nz=list(s[0])\nw=\"hello\"\nw=list(w)\np=0\nfor i in range (len(z)):\n if p<5:\n if z[i] == w[p]:\n p+=1\n\nif p == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t \t \t \t\t \t \t \t \t \t\t\t \t\t\t", "Line = input()\r\nn = len(Line)\r\nk = 0\r\na = ['h', 'e', 'l', 'l', 'o','']\r\nfor i in range(n):\r\n if Line[i] == a[0]:\r\n k += 1\r\n del a[0]\r\n else:\r\n continue\r\nif k == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "x=input()\r\nn=len(x)\r\ncount = 0\r\nfor i in range (n):\r\n if x[i]=='h':\r\n break\r\nif i==n-1:\r\n count =1 \r\nfor j in range (i,n):\r\n if x[j]=='e':\r\n break\r\nif j==n-1:\r\n count =1 \r\nfor k in range (j,n):\r\n if x[k]=='l':\r\n break\r\nif k==n-1:\r\n count =1 \r\nif count !=1: \r\n for l in range (k+1,n):\r\n if x[l]=='l':\r\n break\r\n if l==n-1:\r\n count =1\r\nif count!=1: \r\n for m in range (l,n):\r\n if x[m]=='o':\r\n count = 0\r\n break\r\n else:\r\n count =1 \r\nif count == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n=list(input())\r\nhola=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nindex=0\r\nflag=0\r\nfor i in range(len(n)):\r\n if n[i]==hola[index]:\r\n index+=1\r\n if index==5:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\ncount = 0\r\nfor i in range(0,len(n)):\r\n if n[i]=='h' and count==0:\r\n count= count +1\r\n if count ==1 and n[i]=='e':\r\n count = count + 1\r\n if count == 2 and n[i]=='l':\r\n count = count +1\r\n continue\r\n if count == 3 and n[i]=='l':\r\n count = count +1 \r\n if count == 4 and n[i]=='o':\r\n count = count +1\r\nif count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nhello = 'hello'\r\nind = 0\r\nfor i in range(len(s)):\r\n if s[i] == hello[ind]:\r\n ind += 1\r\n if ind == 5:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "def solution(user_input):\r\n s = 'hello'\r\n for ch in s:\r\n if user_input.find(ch) == -1:\r\n return 'NO'\r\n else:\r\n user_input = user_input[user_input.find(ch)+1:]\r\n return 'YES'\r\n\r\n\r\nprint(solution(input()))\r\n\r\n \r\n", "s = input()\n\nh = 'hello'\ni = 0\nj = 0\nwhile j < len(s) and i < len(h):\n if h[i] == s[j]:\n i += 1\n j+=1\nif i == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "i = 0\r\nword = 'hello'\r\nfor letter in input():\r\n if len(word) > i and letter == word[i]:\r\n i += 1\r\n \r\nprint('YES' if i == len(word) else 'NO')", "s = input()\nhello = 'hello'\nj = 0\nfor i in range(len(s)):\n if s[i] == hello[j]:\n j += 1\n if j == len(hello):\n break\nif j == len(hello):\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", "a=input()\r\nif 'h' in a:\r\n b=a.index('h')\r\n k=a[b+1:]\r\n if 'e' in k:\r\n c=k.index('e')\r\n m=k[c+1:]\r\n if 'l' in m:\r\n d=m.index('l')\r\n l=m[d+1:]\r\n if 'l' in l:\r\n z=l.index('l')\r\n e=l[z+1:]\r\n if 'o'in e:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "s = input()\nt = 'hello'\ni = 0\nfor x in s:\n if x == t[i]:\n i += 1\n if i == 5:\n break\nif i == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a=input().lower()\r\nlist1=[]\r\nlist1.extend(a)\r\na='hello'\r\nb=\"\"\r\ncount=0\r\nfor x in list1:\r\n if x==a[count]:\r\n b+=a[count]\r\n count += 1\r\n if count==5:\r\n break\r\nif b==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nH = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\ni = 0\r\n\r\nfor l in s:\r\n if l in H and i < 5 and H[i] == l: i+=1\r\n\r\nif i == 5: print(\"YES\")\r\nelse: print(\"NO\")", "n=input()\r\nfor x in 'hello':\r\n if x in n:\r\n n=n[n.index(x)+1:]\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "a=str(input())\r\nb=a.lower()\r\nh=b.find('h')\r\ne=b.find('e',h+1)\r\nl1=b.find('l',e+1)\r\nl2=b.find('l',l1+1)\r\no=b.find('o',l2+1)\r\nif h<e<l1<l2<o:\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/env pypy\r\n\"\"\"\r\nCreated on Tue Nov 2 15:53:12 2021\r\n\r\n@author: mahes\r\n\"\"\"\r\n\r\nx=input()\r\ncount=0\r\nstring = 'hello'\r\n\r\nfor i in x:\r\n if i == string[count]:\r\n count += 1\r\n if count == 5:\r\n break\r\nif count == 5:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "inp = input()\r\nstr1 = \"hello\"\r\nn = 0\r\nfor char in inp:\r\n if n!=5 and char == str1[n]:\r\n n+=1\r\nif n==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\ns1 = \"hello\"\r\ncount = 0\r\na = 0\r\nfor i in range(0,len(s)):\r\n if s[i] == s1[a]:\r\n a = a+1\r\n count = count+1\r\n if count == 5:\r\n break\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ref = list(reversed('hello'))\r\nfor c in input():\r\n if ref and ref[-1] == c:\r\n ref.pop()\r\nprint('YES' if not ref else 'NO')\r\n", "import sys\r\ninp=input()\r\nseq=['h','e','l','l','o']\r\ni=0;idx=0\r\ndef find():\r\n global i,idx\r\n while i<=4:\r\n for j in range(idx,len(inp)):\r\n if inp[j]==seq[i]:\r\n i+=1\r\n idx=j+1\r\n find()\r\n print('NO')\r\n sys.exit()\r\n print(\"YES\") \r\n sys.exit()\r\nfind()", "# your code goes here\r\ns = input()\r\nt = \"hello\"\r\n\r\ni = j = 0;\r\nwhile(i < len(s) and j < len(t)):\r\n\tif(s[i] == t[j]):\r\n\t\tj += 1\r\n\t\ti += 1\r\n\telse:\r\n\t\ti += 1\r\nif(j == len(t)):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "s = input()\r\n\r\na = \"hello\"\r\n\r\nk = 0\r\ncnt=0\r\nfor i in a:\r\n for j in range(k,len(s)):\r\n if i==s[j]:\r\n k = j+1\r\n cnt+=1\r\n break\r\nif cnt==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\r\n s = input()\r\n w = 'hello'\r\n \r\n i=0\r\n for j in range(len(s)):\r\n if w[i] == s[j]:\r\n i += 1\r\n if i == len(w):\r\n return 'YES'\r\n return 'NO'\r\n \r\nprint(main())", "a=\"hello\"\r\nj=0\r\nn=input()\r\nflag=False\r\nfor i in range(len(n)):\r\n if a[j]==n[i]:\r\n j+=1\r\n if j==len(a):\r\n print(\"YES\")\r\n flag=True\r\n break\r\nif not flag:\r\n print(\"NO\")", "s = list(input());h = list('hello')\r\nfor i in s:\r\n if h and h[0]==i: h.pop(0)\r\nprint('NO' if len(h)>0 else 'YES')", "def vasya_said_hello(s):\r\n hello = \"hello\"\r\n hello_ptr = 0\r\n for char in s:\r\n if char == hello[hello_ptr]:\r\n hello_ptr += 1\r\n if hello_ptr == len(hello):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\ns = input()\r\nprint(vasya_said_hello(s))\r\n", "s = input()\r\nn = 0\r\nfor c in s:\r\n if c == 'hello'[n]:\r\n n += 1\r\n if n == 5:\r\n break\r\nprint('YES' if n == 5 else 'NO')", "str1 = str(input())\r\nstrN = \"hello\"\r\npos = 0\r\nisAnswer = False\r\nfor i in range(len(str1)):\r\n if(str1[i]==strN[pos]):\r\n pos+=1\r\n if(pos==len(strN)):\r\n isAnswer=True\r\n break\r\nif(isAnswer==False):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\") \r\n ", "str = input()\r\ncomp = \"hello\"\r\nj = 0\r\nfor i in range (len(str)):\r\n if str[i] == comp[j]:\r\n j += 1\r\n if j == 5:\r\n break \r\n\r\nif j == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s = input()\r\nh1 = s.find('h', 0, len(s))\r\n#print(h1)\r\ne2 = s.find('e', h1+1, len(s))\r\n#print(e2)\r\nl3 = s.find('l', e2+1, len(s))\r\n#print(l3)\r\nl4 = s.find('l', l3+1, len(s))\r\n#print(l4)\r\no5 = s.find('o', l4+1, len(s))\r\n#print(o5)\r\nif (h1 == -1) or (e2 == -1) or (l3 == -1) or (l4 == -1) or (o5 == -1):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "\r\ndef pro():\r\n \r\n s = input()\r\n hello = \"hello\"\r\n\r\n i = 0\r\n h = 0\r\n while i < len(s):\r\n if s[i] == hello[h]:\r\n if hello[h] == \"o\":\r\n print(\"YES\")\r\n return\r\n h += 1\r\n \r\n i +=1\r\n\r\n\r\n print(\"NO\")\r\n\r\n\r\npro()\r\n\r\n", "string = input()\r\nif len(string) < 5:\r\n print('NO')\r\nelse:\r\n value = 'hello#'\r\n count = 0\r\n for i in string:\r\n if i == value[count]:\r\n count += 1\r\n if count >= 5:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "s = input()\r\ng, t, a = \"hello\", \"\", 0\r\nfor i in range(len(s)):\r\n if a > 4:\r\n break\r\n if s[i] == g[a]:\r\n t += s[i]\r\n a += 1\r\nprint(\"YES\" if t == g else \"NO\")\r\n\r\n", "s=input()\r\nb=\"\"\r\nfor i in s:\r\n\tif i==\"hello\"[len(b)]:\r\n\t\tb+=i\r\n\tif \"hello\" in b:\r\n\t\tbreak\r\nif \"hello\" in b:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def fun(st, ch):\r\n x = st.find(ch)\r\n if x == -1:\r\n return \"\"\r\n return st[x+1:]\r\n\r\ns = input() + \"q\"\r\nfor i in list(\"hello\"):\r\n s = fun(s, i)\r\nif s == \"\":\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n", "\"\"\" \r\ns=input()\r\n\r\nclass jdger:\r\n def __init__(self,lttr):\r\n self.lttr=lttr\r\n def jdg(self,start):\r\n if start==-1:\r\n return -1\r\n for self.i in range(len(s)-4-start):\r\n if s[start+self.i+1]==self.lttr:\r\n return start+self.i+1\r\n return -1\r\n\r\nj1=jdger('h')\r\nj2=jdger('e')\r\nj3=jdger('l')\r\nj4=jdger('l')\r\nj5=jdger('o')\r\nfor p in range(len(s)-4):\r\n if j5.jdg(j4.jdg(j3.jdg(j2.jdg(j1.jdg(0))))) != -1:\r\n print('YES')\r\n break\r\nif p==len(s)-5:\r\n print('NO') \"\"\"\r\n\r\ns=input()\r\nb=True\r\nfor i1 in range(len(s)-4):\r\n if s[i1] =='h':\r\n for i2 in range(len(s)-4-i1):\r\n if s[i2+i1+1]=='e':\r\n for i3 in range(len(s)-4-i1-i2):\r\n if s[i2+i1+i3+2]=='l':\r\n for i4 in range(len(s)-4-i1-i2-i3):\r\n if s[i2+i1+i3+i4+3]=='l':\r\n for i5 in range(len(s)-4-i1-i2-i3-i4):\r\n if s[i2+i1+i3+i4+i5+4]=='o':\r\n b=False\r\nif b:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "import re\r\n\r\ndef main() -> None:\r\n input_word: str = input()\r\n\r\n print(\"YES\") if re.match('.*?h.*?e.*?l.*?l.*?o.*?', input_word) else print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "string=input()\r\nword=['h','e','l','l','o']\r\nflag=[0]*5\r\nindex=0\r\nfor i in range(5):\r\n flag[i]=string.find(word[i],index)\r\n if flag[i]==-1:\r\n print('NO')\r\n break\r\n index=flag[i]+1\r\nif flag[4]!=-1 and flag[4]!=0:\r\n print('YES')", "string = input()\r\nh = 0\r\ne = 0\r\nl = 0\r\no = 0\r\nfor char in string:\r\n if char == \"h\":\r\n h += 1\r\n if char == \"e\" and h > 0:\r\n e += 1\r\n if char == \"l\" and h > 0 and e > 0:\r\n l += 1\r\n if char == \"o\" and h > 0 and e > 0 and l > 1:\r\n o += 1\r\nif h > 0 and e > 0 and l > 1 and o > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nl=len(s)\r\nflag=0;temp=-1\r\nhello=['h','e','l','l','o']\r\nfor c in hello:\r\n for j in range (temp+1,l):\r\n if (s[j] == c):\r\n flag+=1;temp=j\r\n break\r\nif(flag==5): print('YES')\r\nelse: print('NO')", "s=str(input())\r\nhi=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nfor i in s:\r\n if i==hi[0]:\r\n hi=hi[1::]\r\n if(len(hi)==0):break\r\nprint([\"YES\",\"NO\"][len(hi)!=0])", "s = input().lower()\r\nt = \"hello\"\r\nloc = 0\r\nfor i in range(0,len(s)):\r\n if(s[i] == t[loc]):\r\n loc = loc + 1\r\n if(loc == 5):\r\n print(\"YES\")\r\n break\r\nif(loc < 5):\r\n print(\"NO\")\r\n \r\n", "t = 'hello'\r\ni = 0\r\ns = str(input()).lower()\r\nif s.count('h') < 1 or s.count('e') < 1 or s.count('l') < 2 or s.count('o') < 1:\r\n print('NO')\r\n exit()\r\nelse:\r\n for letra in s:\r\n if i < 5:\r\n if letra == t[i]:\r\n i += 1\r\nif i == len(t):\r\n print('YES')\r\nelse:\r\n print('NO')", "#赵语涵2300012254\r\nimport re\r\ns = input()\r\nmatch = r'h\\w*e\\w*l\\w*l\\w*o\\w*'\r\nm = re.search(match, s)\r\nif m:\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/python3\n\nimport sys\nhello = list('hello')\ns = list(input())\nj = 0\ncount = 0\n\nfor i in range(len(s)):\n if s[i] == hello[j]:\n count += 1\n j += 1\n if count == len(hello):\n print('YES')\n sys.exit()\nprint('NO')\n", "# your code goes here\r\ndef cr():\r\n\ts=input()\r\n\tm='hello'\r\n\tx=0\r\n\tfor i in range(len(s)):\r\n\t\tif s[i]==m[x]:\r\n\t\t\tx+=1\r\n\t\tif x==5:\r\n\t\t\treturn 'YES'\r\n\treturn 'NO'\t\r\nprint(cr())\t\t", "s=input()\r\ns1='hello'\r\nj=0\r\nfor i in s:\r\n\tif i==s1[j]:\r\n\t\tj=j+1\r\n\tif(j==5):\r\n\t\tbreak\r\nif(j==5):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\r\nok = 'hello'\r\ncur = 0\r\nfor let in s:\r\n if let == ok[cur]:\r\n cur += 1\r\n if cur == 5:\r\n break\r\nif cur == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = str(input())\n\ntarget = \"hello\"\nres = \"\"\ni , j= 0, 0\nwhile res!=target and i<len(s):\n if s[i]==target[j]:\n res += target[j]\n j+=1\n i+=1\nprint(\"YES\" if res==target else \"NO\")\n", "word = input()\r\ni = 0\r\nwhile(i<len(word)-1 and word[i] != 'h'):\r\n\ti += 1\r\nif(word[i] != 'h'):\r\n\tprint(\"NO\")\r\nelse :\r\n\twhile(i<len(word)-1 and word[i] != 'e'):\r\n\t\ti+=1\r\n\tif(word[i] != 'e'):\r\n\t\tprint(\"NO\")\r\n\telse :\r\n\t\twhile(i<len(word)-1 and word[i] != 'l'):\r\n\t\t\ti+=1\r\n\t\tif(word[i] != 'l'):\r\n\t\t\tprint(\"NO\")\r\n\t\telse:\r\n\t\t\tif(i == len(word) - 1):\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\telse:\r\n\t\t\t\ti+=1\r\n\t\t\t\twhile(i<len(word)-1 and word[i] != 'l'):\r\n\t\t\t\t\ti+=1\r\n\t\t\t\tif(word[i] != 'l'):\r\n\t\t\t\t\tprint(\"NO\")\r\n\t\t\t\telse:\r\n\t\t\t\t\twhile(i<len(word)-1 and word[i] != 'o'):\r\n\t\t\t\t\t\ti+=1\r\n\t\t\t\t\tif(word[i] != 'o'):\r\n\t\t\t\t\t\tprint(\"NO\")\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tprint(\"YES\")\r\n", "import re\nprint(\"YES\") if re.search(\"h.*e.*l.*l.*o\",input()) else print(\"NO\")\n\t\t\t \t\t \t \t \t\t \t\t\t\t\t \t\t\t\t\t", "s = input()\r\nhello = \"hello\"\r\nfor symbol in s:\r\n if hello[0] == symbol:\r\n hello = hello[1:]\r\n if len(hello) == 0:\r\n print('YES')\r\n break\r\nif len(hello):\r\n print('NO')\r\n", "def solve():\r\n s=input()\r\n s1='hello'\r\n j=0\r\n for i in s:\r\n if i==s1[j]:\r\n j+=1\r\n if j==5:\r\n print('YES')\r\n return\r\n print('NO')\r\nif __name__ == '__main__':\r\n solve()", "import re;\r\nstring=input();\r\nif re.match(r'.*h.*e.*l.*l.*o.*',string):\r\n print(\"YES\");\r\nelse:\r\n print(\"NO\");", "x = input()\r\nh = 0\r\nfor i in x:\r\n if h == 0 and i == \"h\":\r\n h += 1\r\n elif h == 1 and i == \"e\":\r\n h += 1\r\n elif h == 2 and i == \"l\":\r\n h += 1\r\n elif h == 3 and i == \"l\":\r\n h += 1\r\n elif h == 4 and i == \"o\":\r\n h += 1\r\nif h == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "subsequence = \"hello\"\r\nstring = input()\r\ndef isSubstring(n, m):\r\n if m == 5:\r\n return True\r\n if n == len(string):\r\n return False\r\n if string[n] == subsequence[m]:\r\n return isSubstring(n+1, m+1)\r\n else:\r\n return isSubstring(n+1, m)\r\n\r\nif isSubstring(0,0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\n\r\nword = input()\r\n\r\n#pattern = re.compile(r'h?e?l{2,}o?')\r\npattern = re.compile(r'.*h.*e.*l.*l.*o.*')\r\n\r\nfind = pattern.findall(word)\r\n\r\n#print(find)\r\n\r\nif len(find)>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\nimport random\r\nimport sys\r\nn=input()\r\na='hello'\r\nid = 0\r\nfor i in n:\r\n if i == a[id]:\r\n id += 1\r\n if id == 5:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "i = 0 #检测到hello的第几位\r\nhello = ['h', 'e', 'l', 'l', 'o']\r\nword = input()\r\nans = False\r\nfor n in range(len(word)):\r\n\tif word[n] == hello[i]:\r\n\t\ti += 1\r\n\t\tif i == 5:\r\n\t\t\tans = True\r\n\t\t\tbreak\r\nif ans:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "\r\ns = input()\r\nk = len(s)\r\nchat1 = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nchat2 = []\r\nx = 0\r\nfor i in range(0,k):\r\n if x < len(chat1):\r\n if s[i] == chat1[x]:\r\n chat2 += [s[i]]\r\n x += 1\r\n else:\r\n break\r\nif chat1 == chat2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nk=\"hello\"\r\nj=0\r\no=0\r\nfor i in s:\r\n o=o+1\r\n if(i==k[j]):\r\n j=j+1\r\n if(j==5):\r\n break\r\nif(j==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "import sys\r\na = input()\r\nif a.find('h') != -1 :\r\n b = a.find('h')\r\n if a.find('e', b+1,) != -1 :\r\n c = a.find('e', b+1,)\r\n if a.find('l', c+1,) != -1 :\r\n b = a.find('l', c+1,)\r\n if a.find('l', b+1,) != -1 :\r\n c = a.find('l', b+1,)\r\n if a.find('o', c+1,) != -1 :\r\n print (\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n", "s=input() \r\ns1=[\"h\",\"e\",\"l\",\"l\",\"o\"] \r\nfor i in s : \r\n if len(s1)==0 : \r\n break \r\n if s1[0]==i : \r\n del s1[0] \r\n \r\nif len(s1)==0 : \r\n print(\"YES\") \r\nelse : \r\n print(\"NO\")", "s = input()\r\ns = list(s)\r\nh,e,l1,l2,o = False, False, False, False, False\r\nfor i in range(len(s)):\r\n if s[i] == \"h\":\r\n h = True\r\n elif h == True and s[i] == \"e\":\r\n e = True\r\n elif l1 == True and s[i] == \"l\":\r\n l2 = True\r\n elif e == True and s[i] == \"l\":\r\n l1 = True\r\n elif l2 == True and s[i] == \"o\":\r\n o = True\r\nif h and e and l1 and l2 and o:\r\n print('YES')\r\nelse:\r\n print('NO') \r\n ", "n = list(input().strip())\r\nk = ['h','e','l','l','o']\r\ncount = 0\r\nresult = str()\r\nfor i in n:\r\n if count == len(k):\r\n break\r\n if i == k[count]:\r\n result += i\r\n count += 1\r\nprint(\"YES\" if result == \"\".join(k) else \"NO\")", "s=input()\r\nn=len(s)\r\ndef charfinder(a,b,string,char):\r\n for i in range(a,b):\r\n if string[i]==char:\r\n return(i,True)\r\n return(0,False)\r\n\r\n(p1,b1)=charfinder(0,n,s,'h')\r\n(p2,b2)=charfinder(p1+1,n,s,'e')\r\n(p3,b3)=charfinder(p2+1,n,s,'l')\r\n(p4,b4)=charfinder(p3+1,n,s,'l')\r\n(p5,b5)=charfinder(p4+1,n,s,'o')\r\nif not(b1 and b2 and b3 and b4 and b5):\r\n print('NO')\r\nelse:\r\n print('YES')", "st= str(input())\r\na=st.find(\"h\")\r\nb=st.find(\"e\",a+1)\r\nc=st.find(\"l\",b+1)\r\nd=st.find(\"l\",c+1)\r\ne=st.find(\"o\",d+1)\r\nif a<b<c<d<e:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nS = \"hello\"\r\nindex=0\r\nfor i in s:\r\n if i == S[index]:\r\n index+=1\r\n if index==5:\r\n break\r\nprint([\"NO\",\"YES\"][index==5])", "a=['h','e','l','l','o']\r\nx=input()\r\ni=0\r\nfor j in x:\r\n if i<5:\r\n if j==a[i]:\r\n i+=1\r\n else:\r\n break\r\nif i==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = input()\r\narray = [-1,-1,-1,-1,-1]\r\nfor i in range(len(word)):\r\n if word[i]==\"h\" and array[0]==-1:\r\n array[0] = i\r\n if word[i]==\"e\" and array[0]!=-1 and array[1]==-1:\r\n array[1] = i\r\n if word[i]==\"l\" and array[1]!=-1 and array[2]==-1:\r\n array[2] = i\r\n if word[i]==\"l\" and array[3]==-1 and array[2]!=i and array[2]!=-1:\r\n array[3] = i\r\n if word[i]==\"o\" and array[3]!=-1 and array[4]==-1:\r\n array[4] = i\r\nx = array[:]\r\nx.sort()\r\nif array==x and -1 not in array:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n\r\n", "\r\nx = input()\r\nhello = \"hello\"\r\nj=0\r\ncount=0\r\nfor i in range(len(x)):\r\n if x[i]==hello[j]:\r\n j+=1\r\n count+=1\r\n if count==5:\r\n break\r\nif count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nl=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\n#i=0\r\nx=\"\"\r\n#while x!=\"hello\" and i<len(l):\r\nfor i in range(len(l)):\r\n for j in range(len(s)):\r\n if s[j]==l[i]:\r\n x=x+s[j]\r\n s=s[j+1:]\r\n break\r\n #i+=1\r\nif x==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = \"hello\"\r\n\r\nj = 0\r\n\r\ns1 = input()\r\n\r\nfor i in s1:\r\n if i == s[j]:\r\n j += 1\r\n if j == 5:\r\n break\r\nif j == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\np = 'hello'\r\n\r\nfor i in range(len(p)):\r\n if p[i] in s:\r\n s = s[s.find(p[i]) + 1 :]\r\n else:\r\n print('NO')\r\n break\r\n if i == len(p) - 1:\r\n print('YES')\r\n\r\n", "s=input()\r\n#print(s)\r\ncn=\"hello \"\r\nk=0\r\nc=\"\"\r\nn=0\r\nf=0\r\nfor i in range(0,len(s)):\r\n \r\n if s[i]==cn[k] and s[i] not in c:\r\n c=c+s[i]\r\n k+=1\r\n f=1\r\n \r\n if s[i]=='l':\r\n n+=1\r\n elif s[i]=='l' and n==1 and f!=0 :\r\n n+=1\r\n k+=1\r\n c=c+s[i]\r\n \r\n if k>5:\r\n break;\r\nif(c==\"hello\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "CHARS = {\"h\", \"e\", \"l\", \"o\"}\n\ns = input()\nconfirmed = False\nhello = [\"h\", \"e\", \"l\", \"l\", \"o\"]\nhi, i = 0, 0\n\nwhile i < len(s):\n if s[i] == hello[hi]:\n hi += 1\n if hi == 5:\n confirmed = True\n break\n \n i += 1\n\nif confirmed:\n print(\"YES\")\nelse:\n print(\"NO\")", "if __name__ == \"__main__\":\r\n name = \"hello\"\r\n\r\n s = input()\r\n j = 0\r\n\r\n for i in range(len(s)):\r\n if s[i] == name[j]:\r\n j += 1\r\n if j == 5:\r\n print(\"YES\")\r\n exit()\r\n\r\n print(\"NO\")", "n = input()\r\nnot_done_h = True\r\nnot_done_e = True\r\nnot_done_l = True\r\nnot_done_o = True\r\na = 0\r\nfor i in n:\r\n if i == 'h' and not_done_h == True:\r\n not_done_h = False\r\n elif i == 'e' and not_done_e == True and not_done_h == False:\r\n not_done_e = False\r\n elif i == 'l' and not_done_l == True and not_done_e == False:\r\n if a == 0:\r\n a = 1\r\n else:\r\n not_done_l = False\r\n elif i == 'o' and not_done_o == True and not_done_l == False:\r\n not_done_o = False\r\nif not_done_h == False and not_done_e == False and not_done_l == False and not_done_o == False:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\na='hello'\nb=0\nfor i in range(len(s)):\n if s[i]==a[b]:\n b+=1\n if b==5:\n break\nif b==5:\n print('YES')\nelse:\n print('NO')\n\t\t\t\t \t \t\t \t \t \t \t \t \t", "s = input()\ntry:\n\tif s.index('o', s.index('l', 1 + s.index('l', s.index('e', s.index('h'))))) != -1:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\n\texit()\nexcept ValueError:\n\tprint('NO')\n", "s=input()\r\na=s\r\nc=0\r\nx=0\r\nif(\"h\" in s):\r\n h=s.index(\"h\")\r\n s=s[(h+1):]\r\n if(\"e\" in s):\r\n e=s.index(\"e\")\r\n s=s[(e+1):]\r\n if(\"l\" in s):\r\n l=s.index(\"l\")\r\n s=s[(l+1):]\r\n if(\"l\" in s):\r\n d=s.index(\"l\")\r\n s=s[(d+1):]\r\n if(\"o\" in s):\r\n o=s.index(\"o\")\r\n s=s[(o+1):]\r\n else:\r\n print(\"NO\")\r\n c=c+1\r\n else:\r\n print(\"NO\")\r\n c=c+1\r\n else:\r\n print(\"NO\")\r\n c=c+1\r\n else:\r\n print(\"NO\")\r\n c=c+1\r\nelse:\r\n print(\"NO\")\r\n c=c+1\r\n \r\n \r\nif(c==0):\r\n print(\"YES\")\r\n ", "'''\r\nx = input()\r\nkata = []\r\n\r\nfor i in x:\r\n kata.append(i)\r\n\r\na = []\r\nfor i in range(len(kata)):\r\n if i == 0:\r\n a += kata[i]\r\n else:\r\n if kata[i] != kata[i-1]:\r\n a += kata[i]\r\nprint(a)\r\nb = ['helo']\r\n\r\nif b in a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n'''\r\n'''\r\nx=input()\r\nimport re\r\nif re.search(\".*h.*e.*l.*.*l.*o\",x):print(\"YES\")\r\nelse:print(\"NO\")\r\n'''\r\nword = \"hello\"\r\ni = 0\r\nfor j in input():\r\n if j == word[i]:\r\n i += 1\r\n if i == 5:\r\n break\r\nif i == 5 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "def hello(s):\r\n target = \"hello\"\r\n idx = 0\r\n for char in s:\r\n if idx < len(target) and char == target[idx]:\r\n idx += 1\r\n \r\n if idx == len(target):\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n\r\n\r\ns = input().strip()\r\nres = hello(s)\r\nprint(res)", "s=input()\r\nz=0\r\nfor i in range(len(s)):\r\n if s[i]=='h':\r\n for i in range(i+1,len(s)):\r\n if s[i]=='e':\r\n for i in range(i+1,len(s)):\r\n if s[i]=='l':\r\n for i in range(i+1,len(s)):\r\n if s[i]=='l':\r\n for i in range(i+1,len(s)):\r\n if s[i]=='o':\r\n z=1\r\n break\r\n if z==1:\r\n break\r\n if z==1:\r\n break\r\n if z==1:\r\n break\r\n if z==1:\r\n break\r\nif z==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "def _f(cad: str) -> bool:\r\n idx = 0\r\n a = 'hello'\r\n for c in cad:\r\n if idx < 5 and c == a[idx]:\r\n idx += 1\r\n if idx == 5:\r\n return True\r\n return False\r\ns = input()\r\nprint(\"YES\" if _f(s) else \"NO\")", "s = input()\r\nl = 'hello'\r\nr = 'YES'\r\n\r\nfor i in l:\r\n if i in s:\r\n s = s[s.index(i)+1:]\r\n else:\r\n r = 'NO'\r\n\r\nprint(r)", "#!/usr/bin/python3\ns1=input()\ns2=\"hello\"\n\npos2=0\n\nfor i in range(len(s1)):\n if(s1[i]==s2[pos2]):\n pos2=pos2+1\n if(pos2==5):\n break\nif(pos2==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "x = input()\r\n\r\nfor i in x:\r\n if i != 'h' and i != 'e' and i != 'l' and i != 'o':\r\n x = x.replace(i,\"\") \r\n\r\nh = x.find('h')\r\ne = x.find('e',h + 1,len(x))\r\nl1 = x.find('l',e + 1,len(x))\r\nl2 = x.find('l',l1 + 1,len(x))\r\no = x.find('o',l2 + 1,len(x))\r\n\r\n\r\nif h < e < l1 < l2 < o:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nh = e = l1 = l2 = o = False\r\nfor i in range(len(a)):\r\n if not h:\r\n if a[i] == 'h':\r\n h = True\r\n elif not e:\r\n if a[i] == 'e':\r\n e = True\r\n elif not l1:\r\n if a[i] == 'l':\r\n l1 = True\r\n elif not l2:\r\n if a[i] == 'l':\r\n l2 = True\r\n else:\r\n if a[i] == 'o':\r\n o = True\r\nif h and e and l1 and l2 and o:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a=input()\r\ni=0\r\npar=0\r\nwhile i<len(a):\r\n if a[i]=='h':\r\n par+=1\r\n i+=1\r\n break\r\n else:\r\n i+=1\r\nwhile i<len(a):\r\n if a[i]=='e':\r\n par+=1\r\n i+=1\r\n break\r\n else:\r\n i+=1\r\nwhile i<len(a):\r\n if a[i]=='l':\r\n par+=1\r\n i+=1\r\n break\r\n else:\r\n i+=1\r\nwhile i<len(a):\r\n if a[i]=='l':\r\n par+=1\r\n i+=1\r\n break\r\n else:\r\n i+=1\r\nwhile i<len(a):\r\n if a[i]=='o':\r\n par+=1\r\n i+=1\r\n break\r\n else:\r\n i+=1\r\nif par==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nhello=\"hello\"\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i]==hello[c]:\r\n c+=1\r\n if c==5:\r\n print(\"YES\")\r\n break\r\nif c!=5:\r\n print(\"NO\")", "a = input()\nout = ''\nok = [0,1]\nfor i in a:\n if i == 'h' and i not in out:\n out += 'h'\n if i == 'e' and i not in out and 'h' in out:\n out += 'e'\n if i == 'l' and out.count(i) in ok and 'e' in out:\n out += 'l'\n if i == 'o' and i not in out and out.count('l') == 2:\n out += 'o'\nif out == 'hello':\n print('YES')\nelse:\n print('NO')", "s = input()\r\ni, j = 0, 0\r\nf = \"hello\"\r\nwhile(i < len(s) and j < 5):\r\n if(f[j] == s[i]):\r\n j += 1\r\n i += 1\r\nif(j < 5):\r\n print('NO')\r\nelse:\r\n print('YES')", "s=input()\r\nf='hello'\r\nn=0\r\nfor i in s:\r\n if i==f[n]:\r\n n+=1\r\n if n==5:\r\n break\r\nif n==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "s=input()\r\nk='hello'\r\ntarget=len(k)\r\nx=0\r\nfor i in s:\r\n if i==k[x]:\r\n x+=1\r\n if x==target:\r\n break\r\nif x==target:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nimport re\r\na = re.search(r'(.*)h(.*)e(.*)l(.*)l(.*)o(.*)', a)\r\nif a != None:\r\n print('YES')\r\nelse:\r\n print('NO')", "palavra = \"hello\"\n \ndef solucao():\n contador = 0\n texto = input()\n for i in range(len(texto)):\n if texto[i] == palavra[contador]:\n contador += 1\n if contador == 5:\n return \"YES\"\n return \"NO\"\n\nprint(solucao())", "n = input()\r\nind = 0\r\nl = len(n)\r\nflag = 0\r\nfor i in range(ind,l):\r\n if n[i] == 'h':\r\n ind = i+1\r\n flag+=1\r\n break\r\nfor i in range(ind,l):\r\n if n[i] == 'e':\r\n ind = i+1\r\n flag+=1\r\n break\r\nfor i in range(ind,l):\r\n if n[i] == 'l':\r\n ind = i+1\r\n flag+=1\r\n break\r\nfor i in range(ind,l):\r\n if n[i] == 'l':\r\n ind = i+1\r\n flag+=1\r\n break\r\nfor i in range(ind,l):\r\n if n[i] == 'o':\r\n ind = i+1\r\n flag+=1\r\n break\r\nif flag == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_say_hello(s):\n target = \"hello\"\n j = 0 \n\n for c in s:\n if j < len(target) and c == target[j]:\n j += 1\n\n if j == len(target):\n return \"YES\"\n\n return \"NO\"\n\n\nword = input()\n\n\nresult = can_say_hello(word)\nprint(result)\n \t\t\t\t\t \t\t \t\t \t\t\t \t \t\t \t \t\t\t \t", "x={0:'h',1:'e',2:'l',3:'l',4:'o'}\r\nflag,j=0,0\r\ns=input()\r\nfor i in s:\r\n if i is x[j]:\r\n j=j+1\r\n flag=flag+1\r\n if j is 5:\r\n break \r\nif flag is 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\na=list(a)\r\nc=0\r\nfor i in range(len(a)):\r\n if a[i]=='h':\r\n for j in range(i,len(a)):\r\n if a[j]=='e':\r\n for m in range(j,len(a)):\r\n if a[m]=='l':\r\n for z in range(m+1,len(a)):\r\n if a[z]=='l':\r\n for b in range(z,len(a)):\r\n if a[b]=='o':\r\n c=1\r\nif c==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\r\nstring = input()\r\n\r\nfind = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nindex = 0\r\n\r\nbool = False\r\n\r\nfor i in string:\r\n if i == find[index]:\r\n index += 1\r\n if index == 5:\r\n bool = True\r\n break\r\n\r\nif bool:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s = input()\r\nslovo = 'hello'\r\nslovoVasi = ''\r\nfor i in range(len(s)):\r\n if len(slovo) == 0:\r\n break\r\n elif s[i] == slovo[0] and len(slovo) != 0:\r\n slovoVasi += s[i]\r\n if len(slovo) >= 2:\r\n slovo = slovo[1:]\r\n else:\r\n slovo = ''\r\nif slovoVasi == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n", "t,q='hello',0\r\nfor i in input():\r\n if t[q]==i:q+=1\r\n if q>4:break\r\nprint(['NO','YES'][q==5])\r\n", "from math import *\r\n#from bisect import *\r\n#from collections import *\r\n#from random import *\r\n#from decimal import *\"\"\"\r\n#from heapq import *\r\n#from random import *\r\nimport sys\r\ninput=sys.stdin.readline\r\n#sys.setrecursionlimit(3*(10**5))\r\nglobal flag\r\ndef inp():\r\n return int(input())\r\ndef st():\r\n return input().rstrip('\\n')\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\nt=1\r\nwhile(t):\r\n t-=1\r\n s=st()\r\n r='hello'\r\n r=list(r[::-1])\r\n for i in s:\r\n if(r and i==r[-1]):\r\n r.pop()\r\n if(r):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "def chatRoom():\r\n s = input()\r\n word = \"hello\"\r\n count = 0\r\n for i in range(len(s)):\r\n if s[i] == word[count]:\r\n count += 1\r\n if count == 5:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nprint(chatRoom())\r\n", "s = list(input())\r\na = ['h', 'e', 'l', 'l', 'o']\r\nb = list()\r\nimin = -1\r\nfor k in range(len(a)):\r\n for i in range(len(s)):\r\n if s[i] == a[k] and i > imin:\r\n b.append(s[i])\r\n imin = i\r\n break\r\nif ''.join(b) == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "str = input()\r\nS =\"hello\"\r\ni = 0\r\nfor j in str:\r\n\tif(i < 5 and j == S[i]):\r\n\t\ti+= 1\r\nif(i == 5):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "import sys\n\ns = input ()\nn = len (s)\nfor i in range (n):\n if (s[i] == 'h'):\n for j in range (i + 1, n):\n if (s[j] == 'e'):\n for k in range (j + 1, n):\n if (s[k] == 'l'):\n for l in range (k + 1, n):\n if (s[l] == 'l'):\n for t in range (l + 1, n):\n if (s[t] == 'o'):\n print (\"YES\")\n sys.exit ()\n\nprint (\"NO\") \n", "string = input()\r\nhList = []\r\neList = []\r\nlList = []\r\noList = []\r\n\r\nif ( string.isalpha() and string.__len__() <= 100):\r\n if (string.__contains__(\"hello\")):\r\n print(\"YES\")\r\n exit(0)\r\n for index in range(string.__len__()):\r\n if (string[index].__eq__(\"h\")):\r\n hList.append(index)\r\n elif (string[index].__eq__(\"e\")):\r\n eList.append(index)\r\n elif (string[index].__eq__(\"l\")):\r\n lList.append(index)\r\n elif (string[index].__eq__(\"o\")):\r\n oList.append(index)\r\n\r\n if (\r\n hList.__len__() == 0 or eList.__len__()== 0 or\r\n lList.__len__()== 0 or oList.__len__()== 0 \r\n ):\r\n print(\"NO\")\r\n \r\n else:\r\n hIndex = min(hList)\r\n eIndex = 0\r\n l1Index = 0 \r\n l2Index = 0\r\n oIndex = 0\r\n for item in eList:\r\n if item > hIndex:\r\n eIndex = item\r\n break\r\n for item in lList:\r\n if item > eIndex:\r\n l1Index = item\r\n break\r\n for item in lList:\r\n if item > l1Index:\r\n l2Index = item\r\n break\r\n for item in oList:\r\n if item > l2Index:\r\n oIndex = item\r\n break\r\n\r\n if ( hIndex < eIndex < l1Index and l1Index < l2Index < oIndex ):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n \r\n\r\n\r\n# if ( string.isalpha() and string.__len__() <= 100):\r\n# if (string.__contains__(\"hello\")):\r\n# print(\"YES\")\r\n# exit(0)\r\n# helloString += (string[0])\r\n# for item in string[1:string.__len__()]:\r\n# if (helloString.__contains__(item) and helloString.count(\"l\") >= 2):\r\n# continue\r\n# else:\r\n# helloString += item\r\n# if (helloString.__contains__(\"hello\")):\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")", "a=input()\r\nword = \"hello\"\r\nindex = 0\r\nfor i in range(0,len(a)):\r\n if(index==5):\r\n break\r\n if(a[i]==word[index]):\r\n index+=1\r\n\r\nif(index<5):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s=input()\nt='hello'\ni,j=0,0\nwhile i <len(s) and j<5:\n if s[i]==t[j]:\n i+=1\n j+=1\n else:\n i+=1\nif j==5:\n print('YES')\nelse:\n print('NO')", "s = input().lower()\r\nl = [0]*5\r\nref = dict(zip(list(range(5)), list('hello')))\r\n\r\npointer = 0\r\n\r\nfor c in s:\r\n if c in 'hello' and ref[pointer] == c:\r\n pointer += 1\r\n\r\n if pointer == 5:\r\n break\r\n\r\nif pointer == 5:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')", "\r\ns = input().upper()\r\n \r\n \r\nhasFoundH = False\r\nhasFoundE = False\r\nhasFoundL1 = False\r\nhasFoundL2 = False\r\nhasFoundO = False\r\n \r\nfor i in range(len(s)):\r\n if hasFoundH == False:\r\n if s[i] == 'H': hasFoundH = True\r\n elif hasFoundE == False:\r\n if s[i] == 'E': hasFoundE = True\r\n elif hasFoundL1 == False:\r\n if s[i] == 'L': hasFoundL1 = True\r\n elif hasFoundL2 == False:\r\n if s[i] == 'L': hasFoundL2 = True \r\n elif hasFoundO == False:\r\n if s[i] == 'O': hasFoundO = True\r\n \r\nif hasFoundH and hasFoundE and hasFoundL1 and hasFoundL2 and hasFoundO: print(\"YES\") \r\nelse: print(\"NO\")\r\n", "in_s = input()\r\nstrHello = ('hello')\r\nind = 0\r\nsBuff = ''\r\nfor x in in_s:\r\n if x == strHello[ind]:\r\n ind += 1\r\n sBuff += x\r\n if ind > len(strHello) - 1:\r\n break\r\nprint('YES') if ind == len(strHello) else print('NO')", "s=input()\nc=0\na='hello'\nfor i in range( len(s)):\n if s[i]==a[c]:\n c+=1\n if c==5:\n break\nif c==5:\n print(\"YES\")\nelse:\n print(\"NO\")", "chat = input()\r\n\r\nletterOrder = ['h','e','l','l','o']\r\nfor letter in chat:\r\n if letter == letterOrder[0]:\r\n letterOrder.pop(0)\r\n if len(letterOrder) == 0:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')", "def check(s, string):\r\n index = 0\r\n start = 0\r\n while index < len(string):\r\n start = s.find(string[index],start)\r\n if start == -1:\r\n return False\r\n start += 1\r\n index += 1\r\n return True\r\n\r\n\r\ndef main():\r\n s = input()\r\n string = \"hello\"\r\n print ( \"YES\" if check(s, string) else \"NO\" )\r\n\r\nmain()", "n = input()\r\ndef check(n):\r\n s = 'hello'\r\n for i in s:\r\n if i in n:\r\n temp = n.index(i)\r\n else:\r\n return 'NO'\r\n n = n[temp+1:]\r\n return 'YES'\r\nprint(check(n))", "x=input()\r\nsum=0\r\nfor i in range(len(x)):\r\n if sum==0 and x[i]==\"h\":\r\n sum+=1\r\n elif sum==1 and x[i]==\"e\":\r\n sum+=1\r\n elif sum==2 and x[i]==\"l\":\r\n sum+=1\r\n elif sum==3 and x[i]==\"l\":\r\n sum+=1\r\n elif sum==4 and x[i]==\"o\":\r\n sum+=1\r\nif sum==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "rm=str(input())\r\njin='hello'\r\njk=0\r\nfor v in range(len(rm)):\r\n if rm[v] == jin[jk]:\r\n jk+=1\r\n if jk == 5:\r\n break\r\nif jk == 5:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "import re\n\ns = input()\nisThereTheWordHello = re.search(r'h+.*e+.*l+.*l+.*o+', s)\nif isThereTheWordHello:\n print('YES')\nelse:\n print('NO')\n", "s=input()\r\nhello=\"hello\"\r\ni=0\r\nh=0\r\nwhile i<len(s) and h<len(hello):\r\n if s[i]==hello[h]:\r\n h+=1\r\n i+=1\r\nif h==len(hello):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "m = 'hello'\r\ndef chatRoom(x):\r\n s = 0\r\n for i in range(len(x)):\r\n if x[i] == m[s]:\r\n s += 1\r\n if s == 5:\r\n return 'YES'\r\n return 'NO'\r\nprint(chatRoom(x = input()))", "s=input()\ncnt=0\nif len(s)<5:\n\tprint(\"NO\")\nelse:\n\ttry:\n\t\tl=s.find(\"h\")\n\t\tif l!=-1:\n\t\t\tm=s.find(\"e\",l+1)\n\t\t\tif m!=-1:\n\t\t\t\tn=s.find(\"l\",m+1)\n\t\t\t\tif n!=-1:\n\t\t\t\t\to=s.find(\"l\",n+1)\n\t\t\t\t\tif o!=-1:\n\t\t\t\t\t\tp=s.find(\"o\",o+1)\n\t\t\t\t\t\tif p!=-1:\n\t\t\t\t\t\t\tcnt+=1\n\texcept:\n\t\tcnt=0\n\tif cnt==0:\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")", "a = input()\r\ni1 = a.find('h') + 1\r\ni2 = a.find('e',i1) + 1\r\ni3 = a.find('l',i2) + 1\r\ni4 = a.find('l',i3) + 1\r\ni5 = a.find('o',i4) + 1\r\ni = i1*i2*i3*i4*i5\r\nprint('NO' if i == 0 else 'YES')", "def validateSubString(string):\r\n subString = \"hello\"\r\n ssIndex = 0\r\n stringInd = 0 \r\n while(stringInd < len(string)):\r\n if(subString[ssIndex] == string[stringInd]):\r\n ssIndex += 1\r\n stringInd += 1\r\n if(ssIndex == len(subString)):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(validateSubString(input()))", "s=input()\r\nl1=[0,0,0,0,0]\r\nl2=['h','e','l','l','o']\r\nj=0\r\nfor i in s:\r\n if(j<5 and l2[j]==i):\r\n l1[j]=1;\r\n j+=1;\r\n if(j>=5):\r\n break;\r\nsm=sum(l1)\r\nif(sm==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word=input()\r\nflag=False\r\nplace_h=word.find('h')\r\nif place_h!=-1:\r\n place_e=word.find('e',place_h+1)\r\n if place_e!=-1:\r\n place_l = word.find('l', place_e + 1)\r\n if place_l!=-1:\r\n place_l = word.find('l', place_l + 1)\r\n if place_l!=-1:\r\n place_o= word.find('o', place_l + 1)\r\n if place_o!=-1:\r\n flag=True\r\nif flag==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "string = str(input())\r\n\r\nindexes = {\r\n 'h': False,\r\n 'e': False,\r\n 'l': [],\r\n 'o': False\r\n}\r\n\r\nfor i in range(len(string)):\r\n if string[i] == 'h' and not indexes['h']:\r\n indexes['h'] = True\r\n elif string[i] == 'e' and indexes['h'] and not indexes['e']:\r\n indexes['e'] = True\r\n elif string[i] == 'l' and indexes['e'] and len(indexes['l']) < 2:\r\n indexes['l'].append(i)\r\n elif string[i] == 'o' and len(indexes['l']) == 2 and not indexes['o']:\r\n indexes['o'] = True\r\n\r\nresult = 'NO'\r\nif indexes['h'] and indexes['e'] and len(indexes['l']) == 2 and indexes['o']:\r\n result = 'YES'\r\n\r\nprint(result)", "s=\"hello\"\r\ndef chat():\r\n y=0\r\n s1=input()\r\n for i in range(len(s1)):\r\n if(s1[i] ==s[y]):\r\n y += 1\r\n if(y == 5):\r\n return(\"YES\")\r\n return(\"NO\")\r\nprint(chat())", "a=input()\r\nh=\"hello\"\r\nj=0\r\nc=0\r\nfor i in a:\r\n if i==h[j]:\r\n j=j+1\r\n c=c+1\r\n if c==5:\r\n break\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def hello(t):\r\n s=\"hello\"\r\n i=0\r\n for c in t:\r\n if c==s[i]:\r\n i+=1\r\n if i==len(s):\r\n return True\r\n return False\r\nt=input()\r\nif hello(t):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_say_hello(s):\r\n hello = \"hello\"\r\n hello_index = 0\r\n for ch in s:\r\n if ch == hello[hello_index]:\r\n hello_index += 1\r\n if hello_index == len(hello):\r\n return True\r\n return False\r\n\r\ns = input()\r\n\r\nif can_say_hello(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=input()\r\ns=\"hello\"\r\nn=i=0\r\nm=\"\"\r\nwhile i<len (x) and n<len (s):\r\n if x[i]==s[n]:\r\n m=m+s[n]\r\n n+=1\r\n i+=1\r\n else:\r\n i+=1\r\nif m==s:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n\r\n\r\n\r\n", "s = input()\r\n\r\nword = \"hello\"\r\ni = 0\r\nfor ch in s:\r\n if ch == word[i]: i += 1\r\n if i == 5: break\r\nprint(\"YES\" if i == 5 else \"NO\")\r\n", "def f(st):\r\n for s in \"hello\":\r\n if st.find(s) == -1:\r\n return \"NO\"\r\n st = st[st.find(s)+1:]\r\n return \"YES\"\r\nprint(f(input()))\r\n", "s=input()\r\na=['h','e','l','l','o']\r\nt=0\r\nfor i in range(len(s)):\r\n\tif s[i] == a[t] : t+=1\r\n\tif t == 5 : break\r\nif t == 5 : print('YES')\r\nelse : print('NO')", "s=input()\r\na=0\r\nb=['h','e','l','l','o']\r\nfor i in s:\r\n if i==b[0]:\r\n b.remove(i)\r\n if len(b)==0:\r\n a=1\r\n break\r\nif a==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s=input()\r\nb='hello'\r\nc=0\r\nd=0\r\nfor i in range (len(s)):\r\n if b[c]==s[i]:\r\n c+=1\r\n d+=1\r\n if d==5:\r\n break\r\n else:\r\n pass\r\nif d==5:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "a=input()\r\na=a.lower()\r\nw=0\r\nfor i in range(0,len(a)):\r\n if a[i]==\"h\":\r\n for j in range(i+1,len(a)):\r\n if a[j]==\"e\":\r\n for k in range(j+1,len(a)):\r\n if a[k]==\"l\":\r\n for l in range(k+1,len(a)):\r\n if a[l]==\"l\":\r\n for m in range(l+1,len(a)):\r\n if a[m]==\"o\":\r\n w=1\r\n break\r\nprint(\"YES\") if w==1 else print(\"NO\")", "s = input()\r\nh = 'hello'\r\nfor ch in s:\r\n if h[0] == ch:\r\n h = h[1:]\r\n if len(h) == 0:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "s=input()\r\nh=s.find('h')\r\ne=s.find('e',h+1)\r\nl1=s.find('l',e+1)\r\nl2=s.find('l',l1+1)\r\no=s.find('o',l2+1)\r\nif h<e<l1<l2<o:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "s = str(input())\r\n\r\npjg = len(s)\r\nh1 = 0\r\ne1 = 0\r\nl1 = 0\r\nl2 = 0\r\no1 = 0\r\n\r\nmanage = False\r\n\r\nfor i in range(pjg-1):\r\n if s[i] == 'h':\r\n h1 = i\r\n for i in range(pjg-h1-1):\r\n if s[h1+i+1] != 'e':\r\n continue\r\n elif s[h1+i+1] == 'e':\r\n e1 = h1+i+1\r\n for i in range(pjg-e1-1):\r\n if s[e1+i+1] != 'l':\r\n continue\r\n elif s[e1+i+1] == 'l':\r\n l1 = e1+i+1\r\n for i in range(pjg-l1-1):\r\n if s[l1+i+1] != 'l':\r\n continue\r\n elif s[l1+i+1] == 'l':\r\n l2 = e1+i+1\r\n for i in range(pjg-l2-1):\r\n if s[l2+i+1] != 'o':\r\n continue\r\n elif s[l2+i+1] == 'o':\r\n manage = True\r\n break\r\n\r\nif manage:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\ninput_word = input()\nexists = True\n\nfor i, c in enumerate(\"hello\"):\n if input_word.find(c) >= 0:\n input_word = input_word[input_word.index(c) + 1:]\n else:\n exists = False\n break\n\nprint(exists and \"YES\" or \"NO\")\n", "n = list(input())\ni = 0\na = ['h','e','l','l','o']\nj = 0\nk=0\nwhile i < len(n) and j<5:\n if n[i] == a[j]:\n j+=1\n i+=1\n\n\n\n\nif j==5:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s=input()\r\na=[]\r\nr=\"\"\r\np=\"hello\"\r\nj=0\r\nfor i in s:\r\n if i not in a:\r\n if j<5:\r\n if i==p[j]:\r\n r+=i\r\n j+=1\r\n a.append(i)\r\n elif i=='l':\r\n if j<4:\r\n if(p[j]=='l'):\r\n r+=i\r\n j+=1\r\nif(r==p):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word = input()\nto_get = [\"h\", \"e\", \"l\", \"l\", \"o\"]\ncurr = 0\n\nfor l in word:\n if curr == len(to_get):\n break\n if l == to_get[curr]:\n curr += 1\n\nprint(\"YES\" if curr == len(to_get) else \"NO\")", "def findNextInd(char, str):\n for i in range(len(str)):\n if str[i] is char:\n yield i\n\n\ndef main():\n inp = input()\n for h_lett in findNextInd('h', inp):\n for e_lett in findNextInd('e', inp):\n for l_lett in findNextInd('l', inp):\n for l1_lett in findNextInd('l', inp):\n for o_lett in findNextInd('o', inp):\n if h_lett < e_lett < l_lett < l1_lett < o_lett:\n print('YES')\n return\n print('NO')\n\nmain()", "n = \"hello\"\r\n\r\ndef t():\r\n x = 0\r\n s = input()\r\n for i in range(len(s)):\r\n if s[i] == n[x]:\r\n x += 1\r\n if x == 5:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nprint(t())", "s=input()\r\nj=0\r\nf=0\r\nstr=\"hello\"\r\nfor i in s:\r\n if(i==str[j]):\r\n j+=1\r\n if(j>4):\r\n f=1\r\n break\r\nif(f==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=\"hello\"\r\ns=0\r\nfor lol in range(len(a)):\r\n if a[lol]==b[s]:\r\n s+=1\r\n if s==5:\r\n break\r\nif s==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "word = input()\r\n\r\ntarget = \"hello\"\r\nword_pointer = 0\r\ntarget_pointer = 0\r\n\r\n# Iterate through the word and check if it matches the target\r\nwhile word_pointer < len(word) and target_pointer < len(target):\r\n if word[word_pointer] == target[target_pointer]:\r\n # If the characters match, move the target pointer forward\r\n target_pointer += 1\r\n # Move the word pointer forward regardless of the match\r\n word_pointer += 1\r\n\r\n# Check if all the characters in the target word were found\r\nif target_pointer == len(target):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nm = \"hello\" + \"?\"*(len(s)-5)\r\n\r\nx = 0\r\nfor i in range(0,len(s)):\r\n if s[i] == m[x]:\r\n x+=1\r\nif x==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "st = input()\nl1 = ['h', 'e', 'l', 'l', 'o']\ni = -1\nfor ch in l1:\n i = st.find(ch, i + 1)\n if i == -1:\n print('NO')\n exit()\nprint('YES')\n\t \t\t \t\t\t\t\t\t \t \t\t \t \t\t\t\t", "t = input()\r\n\r\nhello = \"hello\"\r\n\r\ncount = 0\r\n\r\ni = 0\r\n\r\nfor j in range(len(t)):\r\n if t[j] == hello[i]:\r\n i+=1\r\n count+=1\r\n\r\n if i== len(hello):\r\n break\r\n\r\nif count==len(hello):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s=\"hello\"\r\ni=input()\r\nind=0\r\n\r\nfor x in range(len(i)):\r\n if ind<len(s) and s[ind]==i[x]:\r\n ind+=1\r\nif ind==len(s):\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "import re \r\ns = input ()\r\nx = re.search (r\"h+.*e+.*l+.*l+.*o+\", s)\r\nif x is None : \r\n print (\"NO\")\r\nelse : \r\n print ('YES')", "# Iterative Python program to check if a string is subsequence of another string \r\n\r\n# Returns true if str1 is a subsequence of str2 \r\ndef isSubSequence(str1,str2): \r\n\tm = len(str1) \r\n\tn = len(str2) \r\n\t\r\n\tj = 0 # Index of str1 \r\n\ti = 0 # Index of str2 \r\n\t\r\n\t# Traverse both str1 and str2 \r\n\t# Compare current character of str2 with \r\n\t# first unmatched character of str1 \r\n\t# If matched, then move ahead in str1 \r\n\t\r\n\twhile j<m and i<n: \r\n\t\tif str1[j] == str2[i]:\t \r\n\t\t\tj = j+1\t\r\n\t\ti = i + 1\r\n\t\t\r\n\t# If all characters of str1 matched, then j is equal to m \r\n\treturn j==m \r\n\t\r\nstr2 = input()\r\nstr1 = \"hello\"\r\nif isSubSequence(str1,str2): print(\"YES\") \r\nelse: print(\"NO\")\r\n\r\n", "msg = input()\nfind = list('hello')\nx = 0\nfor i in msg:\n\tif i == find[x]:\n\t\tx += 1\n\t\tif x == 5:\n\t\t\tbreak \nif x < 5:\n\tprint('NO')\nelse:\n\tprint('YES')\n", "x = input()\r\ntry:\r\n for i in \"hello\":\r\n j = x.index(i)\r\n x = x[j+1:]\r\n print(\"YES\")\r\nexcept:\r\n print(\"NO\")", "import re\r\nprint(\"YES\" if re.match(r\".*h.*e.*l.*l.*o.*\", str(input())) else \"NO\")", "m=\"hello\"\r\ndef ans():\r\n\tc=0\r\n\ts=input()\r\n\tfor i in range(len(s)):\r\n\t\tif(s[i]==m[c]):\r\n\t\t\tc+=1\r\n\t\tif(c==5):\r\n\t\t\treturn \"YES\"\r\n\treturn \"NO\"\r\nprint(ans())", "s = \"hello\"\r\n\r\np = input()\r\n\r\nx = 0\r\n\r\nfor i in range(len(p)) :\r\n\r\n if p[i] == s[x] :\r\n\r\n x = x + 1\r\n\r\n if x == 5 :\r\n\r\n print(\"YES\")\r\n\r\n break\r\n\r\nif x < 5 :\r\n\r\n print(\"NO\")", "s = input() # read the input string\r\n\r\n# initialize variables for the letters of \"hello\"\r\nh_index = e_index = l1_index = l2_index = o_index = -1\r\n\r\n# find the indices of the letters of \"hello\" in the string s\r\nfor i in range(len(s)):\r\n if s[i] == 'h':\r\n h_index = i\r\n break\r\nfor i in range(h_index+1, len(s)):\r\n if s[i] == 'e':\r\n e_index = i\r\n break\r\nfor i in range(e_index+1, len(s)):\r\n if s[i] == 'l':\r\n l1_index = i\r\n break\r\nfor i in range(l1_index+1, len(s)):\r\n if s[i] == 'l':\r\n l2_index = i\r\n break\r\nfor i in range(l2_index+1, len(s)):\r\n if s[i] == 'o':\r\n o_index = i\r\n break\r\n\r\n# check if all the letters of \"hello\" were found in the correct order\r\nif h_index != -1 and e_index != -1 and l1_index != -1 and l2_index != -1 and o_index != -1:\r\n print(\"YES\") # if yes, print \"YES\"\r\nelse:\r\n print(\"NO\") # otherwise, print \"NO\"", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[51]:\n\n\nx=input()\nx='!'+x\n\na=x.find('h')\nb=x.find('e', (a+1))\nc=x.find('l', (b+1))\nd=x.find('l', (c+1))\ne=x.find('o', (d+1))\n\ns=(a/abs(a)+b/abs(b)+c/abs(c)+d/abs(d)+e/abs(e)+5)//9\ns=int(s)\nprint(('YES'*s)+('NO'*abs(s-1)))\n\n\n# In[ ]:\n\n\n\n\n", "i = 0\r\ndef find(i, c):\r\n while i < len(s):\r\n if s[i] == c:\r\n i += 1\r\n return i\r\n i += 1\r\n return False\r\n\r\nans = True\r\ns = input()\r\nfor c in 'hello':\r\n i = find(i, c)\r\n if not i:\r\n ans = False\r\n break\r\nprint(\"YES\" if ans else \"NO\")", "a=input()\r\nr='hello'\r\nindex=0\r\ns=''\r\nfor i in range(len(a)):\r\n\tif a[i]==r[index]:\r\n\t\ts+=a[i]\r\n\t\tindex+=1\r\n\tif s=='hello':\r\n\t\tprint('YES')\r\n\t\tbreak\r\nelse:\r\n\tprint('NO')", "x = input()\r\n\r\ntarget = ['h','e','l','l','o']\r\nstr_l = list(x)\r\n\r\n\r\nfor i in str_l:\r\n N = len(target)\r\n if N >0 and target[0] == i:\r\n del target[0]\r\n \r\n\r\nif len(target) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\narr=\"hello\"\r\ni=0\r\nj=0\r\nwhile(i<len(s) and j<len(arr)):\r\n if(s[i]==arr[j]):\r\n j+=1\r\n\r\n\r\n i+=1\r\n\r\nif(j==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "str1=\"hello\"\r\n\r\ndef chat():\r\n x1=0\r\n s=input()\r\n \r\n for i in range(len(s)):\r\n if s[i] == str1[x1]:\r\n x1+=1\r\n \r\n if x1==5:\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n \r\nprint(chat())", "import re;\r\nx=input()\r\nx.lower()\r\nif re.search(\"h.*e.*l.*l.*o\",x):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# A. Chat room\r\n# time limit per test2 seconds\r\n# memory limit per test256 megabytes\r\n# inputstandard input\r\n# outputstandard output\r\n# Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word s.\r\n#\r\n# Input\r\n# The first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters.\r\n#\r\n# Output\r\n# If Vasya managed to say hello, print \"YES\", otherwise print \"NO\".\r\n\r\nFINAL_RESULT = ['h', 'e', 'l', 'l', 'o']\r\n\r\n\r\ndef calculate_freq(letter, word):\r\n frequency = 0\r\n for i in word:\r\n if i == letter:\r\n frequency += 1\r\n return frequency\r\n\r\n\r\ndef solve_the_problem():\r\n word = input()\r\n result = []\r\n for i in word:\r\n if i == 'h':\r\n if len(result) == 0:\r\n result.append(i)\r\n elif i == 'e':\r\n if len(result) == 1 and result[0] == 'h':\r\n result.append(i)\r\n elif i == 'l':\r\n if len(result) == 2 and result[1] == 'e' or len(result) == 3 and result[2] == 'l':\r\n result.append(i)\r\n elif i == 'o':\r\n if len(result) == 4 and result[3] == 'l':\r\n result.append(i)\r\n if result == FINAL_RESULT:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve_the_problem()\r\n", "def hello(s):\r\n A = list(\"hello\")\r\n i = 0\r\n for c in s:\r\n if c == A[i]:\r\n i += 1\r\n if i == 5:\r\n return \"YES\"\r\n break\r\n return \"NO\"\r\n\r\ns = input()\r\nprint(hello(s))\r\n", "## using greedy solution to find hello char by char in the whole string \n\ndef main():\n\tm=\"hello\"\n\tx=0\n\ts=input()\n\tfor i in range(len(s)):\n\t\tif(s[i]==m[x]):\n\t\t\tx+=1\n\t\tif x==5:\n\t\t\treturn \"YES\"\n\treturn \"NO\"\n\n\nprint(main())", "import re\r\ninp = input()\r\na = re.compile('h.*e.*l.*l.*o.*')\r\nans = re.findall(a,inp)\r\n\r\nif len(ans) > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#游敬恩 2300012555\r\ns = list(input())\r\nstandard = ['h','e','l','l','o']\r\ni, j = 0, 0\r\nwhile i in range(len(s)) and j in range(len(standard)):\r\n if s[i] == standard[j]:\r\n j += 1\r\n else:\r\n pass\r\n i += 1\r\nif j == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def chat(s):\r\n j=0\r\n string='hello'\r\n for i in range(len(s)):\r\n if(s[i]==string[j]):\r\n j+=1\r\n if(j==5):\r\n return 'YES'\r\n return 'NO'\r\ns=input()\r\nprint(chat(s))\r\n", "from re import search\r\nprint((\"YES\", \"NO\")[search(r'h.*e.*l.*l.*o', input()) == None])", "#!/usr/bin/python\nimport re\n\ns = input()\nreg = re.compile(r\"(h)+.*(e)+.*(l)+.*(l)+.*(o)+\")\nmo = reg.search(s)\nif mo == None:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n\t \t \t\t \t \t \t \t \t \t\t \t\t", "import re\n\nprint(\"YES\" if re.findall('\\w*h\\w*e\\w*l\\w*l\\w*o\\w*', input()) else \"NO\")\n", "s=input()\r\ns=list(s)\r\nl=len(s)\r\nh=he=hel=hell=hello=0\r\nfor i in range(l):\r\n if s[i]=='h':\r\n h+=1\r\n elif s[i]=='e':\r\n if h:\r\n h-=1\r\n he+=1\r\n elif s[i]=='l':\r\n if hel:\r\n hel-=1\r\n hell+=1\r\n else:\r\n if he:\r\n he-=1\r\n hel+=1\r\n elif s[i]=='o':\r\n if hell:\r\n hell-=1\r\n hello+=1\r\n else:\r\n pass\r\nif hello:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "text = input()\r\nf = 1\r\nfor i in text:\r\n #h\r\n if f == 1:\r\n if i == 'h':\r\n f += 1\r\n #e \r\n elif f == 2:\r\n if i == 'e':\r\n f += 1\r\n #l\r\n elif f == 3:\r\n if i == 'l':\r\n f += 1\r\n #l\r\n elif f == 4:\r\n if i == 'l':\r\n f += 1\r\n #o\r\n elif f == 5:\r\n if i == 'o':\r\n f += 1\r\n break\r\nif f == 6:\r\n print('YES')\r\nelse:\r\n print('NO')", "#x, y, z = map(int,input().split())\r\n\r\na = input()\r\nword = \"hello\"\r\nb = 0\r\nc = 0\r\nfor i in range(len(word)):\r\n\tb = 0\r\n\tfor j in range(len(a)):\r\n\t\tif word[i] == a[j]:\r\n\t\t\ta = a[j+1:]\r\n\t\t\tb += 1\r\n\t\t\tbreak\r\n\tif b == 0:\r\n\t\tprint(\"NO\")\r\n\t\tc += 1\r\n\t\tbreak\r\n\r\nif c == 0:\r\n\tprint(\"YES\")\r\n", "word = input()\r\nhello = ['h', 'e', 'l', 'l', 'o']\r\nj=0\r\n\r\nfor i in range(len(word)):\r\n if word[i]==hello[j]:\r\n j+=1\r\n if j==len(hello):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n = iter(input())\r\nif all(i in n for i in \"hello\") == True:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\narr=list('hello')\r\nidx=0\r\nfor l in s:\r\n if(arr[idx]==l):\r\n idx+=1\r\n if(idx>4):\r\n print('YES')\r\n break\r\nelse:\r\n print(\"NO\")", "str1=input()\r\nflag=1\r\nfor i in \"hello\":\r\n if i not in str1:\r\n flag=0\r\n break\r\n str1=str1[str1.index(i)+1::1]\r\nif (flag==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nl=len(n)\r\ns=0\r\nfor i in range(l):\r\n if n[i]=='h' and s==0:\r\n s+=1\r\n elif n[i]=='e' and s==1:\r\n s+=1\r\n elif n[i]=='l' and s==2:\r\n s+=1\r\n elif n[i]=='l' and s==3:\r\n s+=1\r\n elif n[i]=='o' and s==4:\r\n s+=1\r\nif s==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = iter(input())\r\nprint('YES' if all(c in s for c in 'hello') else 'NO')", "t = 'hello' \r\ns = input() \r\nc = ''\r\nfor j in range(len(t)):\r\n for i in range(len(s)):\r\n if s[i] != t[j]:\r\n continue\r\n else:\r\n j += 1\r\n c += s[i]\r\n if j == len(t):\r\n break\r\n break \r\n\r\nif c == t:\r\n print('YES')\r\nelse:\r\n print('NO')", "def can_say_hello(s):\r\n target = \"hello\"\r\n target_ptr = 0\r\n for char in s:\r\n if char == target[target_ptr]:\r\n target_ptr += 1\r\n if target_ptr == len(target):\r\n return \"YES\"\r\n return \"NO\"\r\ns = input()\r\nresult = can_say_hello(s)\r\nprint(result)", "f=iter(input());print('NYOE S'[all(g in f for g in 'hello')::2])", "s = input()\nh = 'hello'\nj = 0\nfor i in range(len(s)):\n if s[i] == h[j]:\n j+=1\n if j == 5:\n break\nif j == 5:\n print(\"YES\")\nelse:\n print(\"NO\")", "palavra = str(input())\r\nresposta = []\r\nanalise = ['h','e','l','l','o']\r\ni = 0\r\nh = 0\r\ne = 0\r\nl = 0\r\no = 0\r\nwhile i < len(palavra):\r\n if palavra[i] == 'h':\r\n if h == 0:\r\n resposta.append(palavra[i])\r\n h += 1\r\n if palavra[i] == 'e' and h > 0:\r\n if e == 0:\r\n resposta.append(palavra[i])\r\n e += 1\r\n if palavra[i] == 'l' and h > 0 and e > 0:\r\n if l < 2:\r\n resposta.append(palavra[i])\r\n l += 1\r\n if palavra[i] == 'o' and h > 0 and e > 0 and l >= 2:\r\n resposta.append(palavra[i])\r\n break\r\n i += 1\r\nif resposta == analise:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=str(input())\r\nw=\"hello\"\r\nk=0\r\nfor i in range(len(s)):\r\n if k==5:\r\n break\r\n if s[i]==w[k]:\r\n k+=1\r\nif k<5:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "s=input()\r\nlst=['h','e','l','l','o']\r\nnd=0\r\nfor i in s:\r\n if nd==5:\r\n break\r\n if i==lst[nd]:\r\n nd+=1\r\n \r\nif nd==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "\ns = input()\no = \" \"\no = \"hello\"\ni = 0\ncount = 0\nj = 0\nwhile(j < len(s) and i < 5):\n if(s[j] == o[i]):\n count += 1\n i+=1\n j+=1\nif(count == 5):\n print(\"YES\")\nelse:\n print(\"NO\")", "n = input().lower()\r\ncount_e, count_l1, count_o, count_l2 = 0, 0, 0, 0\r\nif (('h' in n) and ('e' in n) and ('o' in n) and ('l' in n)):\r\n\r\n for i in range(len(n)):\r\n if n[i] == 'h':\r\n count_h = i\r\n break\r\n for i in range(count_h+1, len(n)):\r\n if n[i] == 'e':\r\n count_e = i\r\n break\r\n for i in range(count_e+1, len(n)):\r\n if n[i] == 'l':\r\n count_l1 = i\r\n break\r\n for i in range(count_l1+1, len(n)):\r\n if n[i] == 'l':\r\n count_l2 = i\r\n break\r\n for i in range(count_l2, len(n)):\r\n if n[i] == 'o':\r\n count_o = i\r\n if count_o != 0 and count_e != 0 and count_l2 != 0 and count_l1 != 0:\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print('NO')\r\n", "word=input()\r\nll=word.count('l')\r\nif ll>=2 and 'h'in word and 'e'in word and 'o'in word:\r\n h=word.index('h')\r\n word=word[h+1:]\r\n if 'e'in word:\r\n e=word.index('e')\r\n word=word[e+1:]\r\n if 'l'in word:\r\n l1=word.index('l')\r\n word=word[l1+1:]\r\n if 'l'in word:\r\n l2=word.index('l')\r\n word=word[l2+1:]\r\n if 'o'in word:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "s = input().strip()\r\n\r\nh = e = l1 = l2 = o = False\r\ncurrent_char = 'h'\r\nfor c in s:\r\n if h == False and c == current_char:\r\n h = True\r\n current_char = 'e'\r\n elif e == False and c == current_char:\r\n e = True\r\n current_char = 'l'\r\n elif l1 == False and c == current_char:\r\n l1 = True\r\n current_char = 'l'\r\n elif l2 == False and c == current_char:\r\n l2 = True\r\n current_char = 'o'\r\n elif o == False and c == current_char:\r\n o = True\r\n break\r\nif o == True:\r\n print('YES')\r\nelse:\r\n print('NO')", "def solve(s):\r\n a='hello'\r\n b=0\r\n for i in range(0,len(s)):\r\n if(b==5):\r\n return(\"YES\")\r\n if (s[i]==a[b]):\r\n b=b+1\r\n if(b<5):\r\n return\"NO\"\r\n else:\r\n return\"YES\"\r\ns=input()\r\nprint(solve(s))\r\n", "x = str(input())\r\nout = []\r\nll = 0\r\nfor i in x:\r\n if i == \"h\":\r\n if len(out) == 0:\r\n out.append(i)\r\n elif i == \"e\":\r\n if len(out) == 1:\r\n out.append(i)\r\n elif i == 'l':\r\n if len(out) == 2 or len(out) == 3:\r\n out.append(i)\r\n elif i == \"o\":\r\n if len(out) == 4:\r\n out.append(i)\r\nif len(out) == 5:\r\n if out[0] == \"h\" and out[1] == \"e\" and out[2] == \"l\" and out[3] == \"l\" and out[4] == \"o\":\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nt=\"hello\"\r\nk=0\r\nc=0\r\nfor i in range(len(t)):\r\n for j in range(k,len(s)):\r\n if(s[j]==t[i]):\r\n k=j+1;\r\n c+=1;\r\n break;\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nl = list(s)\r\n#print(l)\r\ntemp = []\r\nflag = 0\r\nh = -1\r\ne = 0\r\nL = 0\r\ncountl = 0\r\no = 0\r\nfor i in range(len(l)):\r\n if l[i]==\"h\" and h == -1:\r\n temp.append(l[i])\r\n h = i\r\n break\r\n#print(h)\r\nif h != -1:\r\n for i in range(h, len(l)):\r\n if l[i]==\"e\" and e == 0:\r\n temp.append(l[i])\r\n e = i\r\n break\r\nelse:\r\n flag = 1\r\n#print(e)\r\nif e!=0:\r\n for i in range(e, len(l)):\r\n if l[i]==\"l\" and countl!=2:\r\n temp.append(l[i])\r\n countl+=1\r\n L = i\r\nelse:\r\n flag = 1\r\n#print(countl)\r\n#print(L)\r\nif countl==2:\r\n for i in range(L, len(l)):\r\n if l[i]==\"o\":\r\n temp.append(l[i])\r\n o = i\r\n break\r\nelse:\r\n flag = 1\r\n\r\nif o == 0:\r\n flag = 1\r\n#print(temp)\r\nif flag == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Read the input word\r\nword = input()\r\n\r\n# Define the expected letters \"h\", \"e\", \"l\", \"l\", and \"o\"\r\nexpected_letters = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\n\r\n# Initialize the index of the expected letter\r\nexpected_index = 0\r\n\r\n# Iterate through the characters of the word\r\nfor char in word:\r\n if char == expected_letters[expected_index]:\r\n expected_index += 1\r\n if expected_index == 5:\r\n break\r\n\r\n# Print the result\r\nif expected_index == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# coding=utf-8\na=input()\r\nz='hello'\r\ns=0\r\nh=''\r\nfor i in range(len(a)):\r\n if s<=4:\r\n if a[i]==z[s]:\r\n h+=a[i]\r\n s+=1\r\nif h==z:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\n \t\t \t \t\t \t \t \t \t \t \t\t", "\r\n\r\n\r\ntexto = input()\r\npalabra = \"hello\"\r\n\r\ni = 0\r\nj = 0\r\nwhile i < len(texto):\r\n if texto[i] == palabra[j]:\r\n j += 1\r\n i += 1\r\n\r\n if j == len(palabra):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "s = input()\r\nword=\"hello\"\r\ni=0\r\nfor char in s:\r\n if char == word[i]:\r\n i+=1\r\n if i==5:\r\n print(\"YES\")\r\n break\r\nif i !=5:\r\n print(\"NO\")", "def check(s):\r\n hello = 'hello'\r\n i = 0\r\n j = 0\r\n\r\n\r\n while i<len(s) and j <len(hello):\r\n if s[i] == hello[j]:\r\n j += 1\r\n \r\n i += 1\r\n\r\n\r\n if j == len(hello):\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n \r\n\r\n\r\ns = input()\r\nprint(check(s))\r\n \r\n ", "s=input()\r\nx=[]\r\nfor i in s:\r\n x.append(i)\r\nj=0;count=0\r\nfor i in ['h','e','l','l','o']:\r\n if i in x:\r\n j=x.index(i)\r\n x=x[j+1:]\r\n count+=1\r\n else:\r\n print(\"NO\")\r\n break\r\nif count==5:\r\n print(\"YES\")\r\n", "s = str(input())\r\na = \"hello\"\r\np = 0\r\nj = 0\r\nfor i in range(len(s)):\r\n if (s[i] == a[j]):\r\n j += 1\r\n p += 1\r\n if(p == 5):\r\n break\r\nif p == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\nh = n.find('h')\r\ne = n.find('e', h)\r\nl1 = n.find('l', e)\r\nl2 = n.find('l', l1 + 1)\r\no = n.find('o', l2)\r\nif h < e < l1 < l2 < o:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\ns1 = 'hello'\r\nk = 0\r\nword = False\r\nfor i in range(len(s)):\r\n if s[i] == s1[k]:\r\n k += 1\r\n if k == len(s1):\r\n word = True\r\n break\r\nif word:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\nc = ['h','e','l','l','o']\r\nf = len(n)\r\nfor i in range(f):\r\n if n[i] == c[0]:\r\n del c[0]\r\n if c == []:\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "word = input()\r\ngreeting = \"hello\"\r\nfor letter in word:\r\n if greeting == \"\":\r\n break\r\n if letter == greeting[0]:\r\n greeting = greeting[1:]\r\nif greeting != \"\":\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s=\"hello\"\r\ndef cr():\r\n x=0\r\n t=input()\r\n for i in range(len(t)):\r\n if t[i]==s[x]:\r\n x+=1\r\n if x==5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(cr())\r\n", "def count(string):\r\n h, i = 'hello', 0\r\n for char in string:\r\n if i<5 and char == h[i]:\r\n i += 1\r\n if i==5:\r\n return \"YES\"\r\n return \"NO\"\r\n \r\n\r\nif __name__ == '__main__':\r\n string = input()\r\n print(count(string))", "s=iter(input())\r\nfor i in \"hello\":\r\n if i not in s:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "def check_hello(word):\r\n hello = \"hello\"\r\n i = 0\r\n for char in word:\r\n if i < 5 and char == hello[i]:\r\n i += 1\r\n if i == 5:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nword = input()\r\n\r\nresult = check_hello(word)\r\nprint(result) ", "s = input()\r\ncount = 0\r\nsingle = ''\r\nfor i in s:\r\n if count == 0 and i=='h' :\r\n single+=i\r\n count+=1\r\n elif count == 1 and i == 'e':\r\n single+=i\r\n count+=1\r\n elif count == 2 and i == 'l':\r\n single+=i\r\n count+=1\r\n elif count == 3 and i == 'l':\r\n single+=i\r\n count+=1\r\n elif count == 4 and i == 'o':\r\n single+= i\r\n count+=1\r\n# print(single)\r\nif single!='hello':print('NO')\r\nelse:print('YES')\r\n'''\r\nCount use karna pada to find single instance of alphabet\r\nBekar code lekin, no creativity\r\n'''", "a = [*input()]\r\nb = ['h','e','l','l','o']\r\nindex = 0\r\nfor i in a:\r\n if i == b[index]:\r\n index+=1\r\n if index>4:\r\n print('YES')\r\n break\r\n\r\nelse:\r\n print('NO')\r\n", "s=input()\r\na=s.find('h')\r\ns=s[a+1:]\r\nb=s.find('e')\r\ns=s[b+1:]\r\nc=s.find('l')\r\ns=s[c+1:]\r\nd=s.find('l')\r\ns=s[d+1:]\r\ne=s.find('o')\r\nif a==-1 or b==-1 or c==-1 or d==-1 or e==-1:\r\n print('NO')\r\n\r\nelse:\r\n print('YES')\r\n", "a=input()\r\ns=0\r\nans=['h', 'e', 'l', 'l', 'o']\r\nfor i in a:\r\n if i==ans[s]:\r\n s+=1\r\n if s==5:\r\n break\r\nif s==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# coding: utf-8\r\n\r\ns = input()\r\ni = 0\r\n\r\nfor j in range(len(s)):\r\n if 'hello'[i] == s[j]:\r\n i += 1\r\n \r\n if i == 5:\r\n break\r\n \r\nprint('YES') if i == 5 else print('NO')", "s = input()\r\nindex = -1\r\ncnt = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'h':\r\n index = i \r\n cnt = cnt + 1\r\n break\r\n \r\nfor i in range(index, len(s)):\r\n if s[i] == 'e':\r\n index = i \r\n cnt = cnt + 1\r\n break\r\n \r\nfor i in range(index, len(s)):\r\n if s[i] == 'l':\r\n index = i \r\n cnt = cnt + 1\r\n break\r\n \r\nfor i in range(index + 1, len(s)):\r\n if s[i] == 'l':\r\n index = i \r\n cnt = cnt + 1\r\n break\r\n \r\nfor i in range(index, len(s)):\r\n if s[i] == 'o':\r\n index = i \r\n cnt = cnt + 1\r\n break\r\n \r\nprint('YES' if cnt == 5 else 'NO')", "str_li = list(input())\nhello = ['h','e','l','l','o']\nj = 0\nfor i in range(len(str_li)):\n if j < len(hello) and str_li[i] == hello[j] :\n j += 1\nif j == len(hello) :\n print(\"YES\")\nelse :\n print(\"NO\")\n \t \t\t \t \t \t\t \t\t \t\t\t \t\t", "s = input()\ntest = \"hello\"\npoint = 0\ni = 0\nwhile i < len(s):\n if point < len(test) and s[i] == test[point] :\n point += 1\n i += 1 \n \nif point == len(test):\n print('YES')\nelse:\n print('NO')\n \t \t \t \t \t \t \t\t \t \t", "import sys\r\ns=input()\r\n\r\nn=len(s)\r\nfor i in range(n):\r\n if s[i]=='h':\r\n for j in range(i+1,n):\r\n if s[j]=='e':\r\n for k in range(j+1,n):\r\n if s[k]=='l':\r\n for l in range(k+1,n):\r\n if s[l]=='l':\r\n for m in range(l+1,n):\r\n if s[m]=='o':\r\n print(\"YES\")\r\n sys.exit() \r\nprint(\"NO\")", "s=input()\r\nres=''\r\nfor i in range(len(s)):\r\n if 'h' not in res and s[i]=='h':\r\n res+=s[i]\r\n if 'h' in res and 'e' not in res and s[i]=='e':\r\n res+=s[i]\r\n if 'he' in res and s[i]=='l' and res.count('l')<2:\r\n res+=s[i]\r\n if 'hell' in res and 'o' not in res and s[i]=='o':\r\n res+=s[i]\r\nif res=='hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nindex = 0\r\nfor char in ['h', 'e', 'l', 'l', 'o']:\r\n found = False\r\n for j in range(index, len(s)):\r\n if s[j] == char:\r\n index = j+1\r\n found = True\r\n break\r\n if not found:\r\n print(\"NO\")\r\n break\r\n \r\nif found:\r\n print(\"YES\")", "chat=input()\nhello = 'hello'\nj = 0\nfor i in range(len(chat)):\n if chat[i]== hello[j]:\n j+=1\n if j == 5:\n break\nif j == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n\n\n", "word = input()\r\nhello_array = list(\"hello\")\r\n\r\nidx = 0\r\nfor c in word:\r\n\tif c == hello_array[idx]:\r\n\t\tidx += 1\r\n\tif idx == len(hello_array):\r\n\t\tbreak\r\n\r\nif idx == len(hello_array):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\r\nx = 0\r\ny = 0\r\nfor i in 'hello':\r\n if i in s:\r\n s = s[s.find(i) + 1:]\r\n x += 1\r\nif x == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n", "chat = list(input())\ntry:\n h = chat.index('h')\n e = chat.index('e', h, len(chat))\n l = chat.index('l', e, len(chat))\n chat.pop(l)\n L = chat.index('l', l, len(chat)) + 1\n o = chat.index('o', L, len(chat)) + 1\n if h<e<l<L<o:\n print(\"YES\")\nexcept ValueError or NameError:\n print(\"NO\")", "s=input()\r\npalabra_buscada=\"hello\"\r\ncont=0\r\nband=0\r\nfor i in range (0,len(s)):\r\n if s[i]==palabra_buscada[cont]:\r\n cont=cont+1 #una letra igual a la de palabra buscada, y se actualiza cont para comparar con la siguiente\r\n if cont==5:\r\n print(\"YES\")\r\n band=1\r\n break\r\nif band==0:\r\n print(\"NO\")", "s = input()\r\n\r\nstack = ['o', 'l', 'l', 'e', 'h']\r\n\r\nfor ch in s:\r\n if len(stack) == 0:\r\n break;\r\n if ch == stack[-1]:\r\n stack.pop()\r\n\r\nif len(stack) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=\"hello\"\r\ni=0\r\nfor n in input():\r\n if n==s[i]: i+=1\r\n if i==5: break\r\nif i==5: print(\"YES\")\r\nelse: print(\"NO\")", "import sys\r\ns = list(input())\r\nword = \"hello\"\r\ni = 0\r\nfor j in range(len(s)):\r\n if s[j] == word[i]:\r\n i += 1\r\n if i == 5:\r\n print(\"YES\")\r\n break\r\nif i < 5:\r\n print(\"NO\")\r\n\r\n", "s = input()\r\nboolean = True\r\nposition = s.find(\"h\")\r\nif position + 1:\r\n position = s.find(\"e\", position + 1)\r\n if position + 1:\r\n position = s.find(\"l\", position + 1)\r\n if position + 1:\r\n position = s.find(\"l\", position + 1)\r\n if position + 1:\r\n position = s.find(\"o\", position + 1)\r\n if position + 1:\r\n print(\"YES\")\r\n boolean = False\r\nif boolean:\r\n print(\"NO\")", "s=input()\r\nnum1=s.find(\"h\")\r\nnum2=s[num1+1:].find(\"e\")\r\nnum3=s[num1+num2+2:].find(\"l\")\r\nnum4=s[num1+num2+num3+3:].find(\"l\")\r\nnum5=s[num1+num2+num3+num4+4:].find(\"o\")\r\nif num1>-1 and num2>-1 and num3>-1 and num4>-1 and num5>-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def check(s):\r\n find = \"hello\"\r\n ind = 0\r\n for i in range(len(s)):\r\n if s[i] == find[ind]:\r\n ind += 1\r\n if ind == len(find):\r\n return True\r\n return False\r\ns = input()\r\nif check(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\na=['h','e','l','l','o']\r\nk=0\r\nfor i in range(0,len(s)):\r\n if k<len(a) and s[i]==a[k]:\r\n k=k+1\r\nif k==len(a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\nstatus = 0 \r\n\r\nfor i in range(len(s)):\r\n if status == 0 and s[i] == 'h':\r\n status += 1\r\n elif status == 1 and s[i] == 'e':\r\n status += 1\r\n elif status == 2 and s[i] == 'l':\r\n status += 1\r\n elif status == 3 and s[i] == 'l':\r\n status += 1 \r\n elif status == 4 and s[i] == 'o':\r\n status += 1\r\n \r\n if status == 5:\r\n break\r\n \r\nif status == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "def decide(word):\n hello = {0: \"h\", 1: \"e\", 2: \"l\", 3: \"l\", 4: \"o\"}\n\n char_matched = 0\n\n for item in hello.values():\n for idx, char in enumerate(word):\n if item == char:\n word = word[idx + 1 : len(word)]\n char_matched += 1\n break\n\n return \"YES\" if char_matched == 5 else \"NO\"\n\n\nif __name__ == \"__main__\":\n word = input()\n\n result = decide(word)\n print(result)\n", "try:\r\n s=input()\r\n s1=\"hello\"\r\n \r\n i=0\r\n j=0\r\n c=0\r\n for i in s:\r\n if i==s1[j]:\r\n c+=1\r\n j+=1\r\n if j>4:\r\n break\r\n \r\n if c==5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\nexcept EOFError:\r\n pass", "a = input()\r\np = \"NO\"\r\nb=c=d=e=f=\"\"\r\n \r\nfor i in range (len(a)):\r\n if a[i] == \"h\":\r\n b=a[i+1:]\r\n break\r\nfor i in range(len(b)):\r\n if b[i]==\"e\":\r\n c = b[i+1:]\r\n break\r\nfor i in range(len(c)):\r\n if c[i]==\"l\":\r\n d = c[i+1:]\r\n break\r\nfor i in range(len(d)):\r\n if d[i]==\"l\":\r\n e = d[i+1:]\r\n break\r\nfor i in range(len(e)):\r\n if e[i]==\"o\":\r\n p=\"YES\"\r\n break\r\nprint(p) \r\n", "x = input()\r\ntemp = ''\r\n\r\nhello_list = ['h', 'e', 'l', 'l', 'o']\r\n\r\nif len(x) < 5:\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(x)):\r\n if len(temp) == 5:\r\n print('YES')\r\n break\r\n elif hello_list[len(temp)] == x[i: i + 1]:\r\n temp = temp + x[i: i+1]\r\n else:\r\n print('YES' if temp == 'hello' else 'NO')\r\n", "s=input()\nif \"h\" in s:\n\td=s.index(\"h\")\n\ts1=s[d:len(s)]\nelse:\n\ts1=()\nif \"e\" in s1:\n\tk=s1.index(\"e\")\n\ts2=s1[k:len(s1)]\nelse:\n\ts2=()\n\t\nif \"l\" in s2:\n\tj=s2.index(\"l\")\n\ts3=s2[j+1:len(s2)]\nelse:\n\ts3=()\nif \"l\" in s3:\n\ta=s3.index(\"l\")\n\ts4=s3[a:len(s3)]\nelse:\n\ts4=()\nif \"o\" in s4:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t \t\t \t\t \t\t\t \t \t\t \t\t \t\t \t", "s = input()\r\nfor i in \"hello\":\r\n if i in s:\r\n s = s[s.index(i)+1:]\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "word=\"hello\"\r\nstr1=input()\r\ncount=0\r\ni=0\r\nfor j in range(len(str1)):\r\n if str1[j]==word[i]:\r\n i+=1\r\n count+=1\r\n if i==5:\r\n break\r\nif count==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "st = input()\r\nst = list(st)\r\nsample = \"hello\"\r\n#stt = set(st)\r\n#print(stt)\r\n\r\ni = 0\r\nj = 0\r\ncount = 0\r\nfirst = ''\r\nwhile i < len(st):\r\n if st[i] == sample[j]:\r\n first = sample[j]\r\n count = count + 1\r\n i = i + 1\r\n j = j + 1\r\n elif st[i] == first:\r\n i = i + 1\r\n else: \r\n #count = 0\r\n #j = 0\r\n i = i + 1\r\n if count == len(sample):\r\n break\r\n\r\nif count == len(sample):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def can_say_hello(s):\r\n target_word = \"hello\"\r\n target_index = 0\r\n \r\n # Iterate through the characters of the input word\r\n for char in s:\r\n if target_index < len(target_word) and char == target_word[target_index]:\r\n target_index += 1\r\n \r\n # If all characters of \"hello\" are matched, Vasya can say hello\r\n if target_index == len(target_word):\r\n return True\r\n \r\n return False\r\n \r\ndef main():\r\n s = input()\r\n if can_say_hello(s):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\nif __name__ == \"__main__\":\r\n main()", "x=iter(input());print('NYOE S'[all(k in x for k in 'hello')::2])", "x = input()\r\ny = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\n\r\ndef hello_check(x, y):\r\n if len(y) == 0 or (len(y) == 0 and len(x) == 0):\r\n return \"YES\"\r\n if len(x) == 0:\r\n return \"NO\"\r\n if x[0] == y[0]:\r\n return hello_check(x[1:], y[1:])\r\n if x[0] != y[0]:\r\n return hello_check(x[1:], y)\r\n\r\nprint(hello_check(x, y))", "word = input()\r\nletters = [letter for letter in word]\r\ntarget = {1: 'h', 2:'e',3:'l',4:'l',5:'o'}\r\ntarget_list = []\r\n\r\nfor letter in letters:\r\n\tif len(target_list)!=5:\r\n\t\tif letter==target[len(target_list)+1]:\r\n\t\t\ttarget_list.append(letter)\r\n\telse:\r\n\t\tbreak\r\n\r\nrejoin = ''.join(target_list)\r\nif rejoin=='hello':\r\n\tprint(\"YES\")\r\n\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "import re\r\nword = input()\r\npattren = r\".*h.*e.*l.*l.*o.*\"\r\njudge = re.match(pattren,word)\r\nif judge:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ni=0\r\nf=0\r\nwhile i<len(s):\r\n if s[i]=='h' and f==0:\r\n f=1\r\n elif s[i]=='e' and f==1:\r\n f=2\r\n elif s[i]=='l' and (f==2 or f==3):\r\n f+=1\r\n elif s[i]=='o' and f==4:\r\n f+=1\r\n i+=1\r\nif f>=5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Chat Room\ndef hello(s):\n st = ['h', 'e', 'l', 'l', 'o']\n for i in s:\n if i == st[0]:\n st.pop(0)\n if not st:\n return 'YES'\n if st:\n return 'NO'\n return 'YES'\n\n\ns = input()\nprint(hello(s))", "# cook your dish here\r\n#siz_arr=list(map(int,input().rstrip().split()))\r\nstr1=input()\r\nprev='1'\r\n#print(str1)\r\n#print(len(str1))\r\ncount=0\r\nflag=0\r\nfor i in range (len(str1)):\r\n if str1[i]=='h' and prev=='1' :\r\n prev='h'\r\n \r\n elif str1[i]=='e' and prev=='h':\r\n prev='e'\r\n elif str1[i]=='l' and prev=='e':\r\n prev='lone'\r\n elif str1[i]=='l' and prev=='lone':\r\n prev='lto'\r\n elif str1[i]=='o' and prev=='lto':\r\n prev='o'\r\n flag=1\r\n #print(prev)\r\n \r\n \r\nif flag==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n \r\n \r\n\r\n ", "def chat_room(msg):\r\n if len(msg) < 5:\r\n return False\r\n else:\r\n if \"h\" in msg:\r\n msg = msg[msg.index(\"h\") + 1:]\r\n if \"e\" in msg:\r\n msg = msg[msg.index(\"e\") + 1:]\r\n if \"l\" in msg:\r\n msg = msg[msg.index(\"l\") + 1:]\r\n if \"l\" in msg:\r\n msg = msg[msg.index(\"l\") + 1:]\r\n if \"o\" in msg:\r\n return True\r\n return False\r\n\r\n\r\nif chat_room(input()):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\nl=[\"h\",\"e\",\"l\",\"l\",\"o\"]\ncurrent=0\nfor i in s:\n if current<=4 and i==l[current]:\n current+=1\nif current==5:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import re\r\n\r\ns = input()\r\nx = re.search(\".*h+.*e+.*l+.*l+.*o+.*\",s)\r\nif x: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "s=input()\r\nl=\"hello\"\r\nc=0\r\nfor i in s:\r\n\tif i==l[c]:\r\n\t\tc+=1\r\n\tif c==5:\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")", "a=\"hello\"\r\no=0\r\nk=input()\r\nf=0\r\nfor i in range(len(k)):\r\n if(k[i]==a[o]):\r\n o+=1\r\n if(o==5):\r\n f=1\r\n break\r\nif(f==0):\r\n print(\"NO\")\r\nelse:\r\n print('YES')\r\n", "\r\ns=input()\r\nn=len(s)\r\nh=[]\r\ne=[]\r\nl=[]\r\no=[]\r\nx=s.count('l')\r\nif 'h' in s and 'e' in s and x>=2 and 'o' in s:\r\n \r\n for i in range(n):\r\n if s[i]=='h':\r\n h.append(i) \r\n elif s[i]=='e':\r\n e.append(i)\r\n elif s[i]=='l':\r\n l.append(i)\r\n elif s[i]=='o':\r\n o.append(i)\r\n h_index=h[0]\r\n e_index=0\r\n try:\r\n for i in e:\r\n if i>h_index:\r\n e_index=i\r\n f=1\r\n break\r\n for i in l:\r\n if i>e_index:\r\n l_index=i\r\n ll=1\r\n break\r\n for i in l:\r\n if i>l_index:\r\n l_index2=i\r\n a=1\r\n break\r\n for i in o:\r\n if i>l_index2:\r\n o_index=i\r\n g=1\r\n break\r\n except:\r\n f=0\r\n try:\r\n if f==1 and ll==1 and a==1 and g==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n except:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ndef qia(a,b):\r\n if b in a:\r\n c=a.index(b)\r\n a=a[c+1:]\r\n else:\r\n a=0\r\nM=['h','e','l','l','o',]\r\nfor x in M:\r\n if x in s:\r\n c=s.index(x)\r\n s=s[c+1:]\r\n else:\r\n print(\"NO\")\r\n s=2\r\n break\r\nif s!=2:\r\n print(\"YES\")\r\n", "x = input()\r\nh = 'hello'\r\ny = 0\r\nfor j in range(y, len(x)):\r\n if h[y] == x[j]:\r\n y += 1\r\n if y >= len(h):\r\n break\r\nif y == len(h):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def search(x,y,a,b):\r\n c = -1\r\n for i in range(a,b):\r\n if x[i] == y:\r\n c = i\r\n break\r\n return c\r\n\r\nx = input()\r\nd = \"hello\"\r\ncheck = \"YES\"\r\nz = len(x)\r\ne=0\r\nfor i in d:\r\n temp = search(x,i,e,z)\r\n if temp>=0:\r\n e = temp+1\r\n else:\r\n check = \"NO\"\r\n break\r\nprint(check)", "s = input()\r\nn = len(s)\r\ni, j = 0, 0\r\ns1 = \"hello\"\r\ncount = 0\r\nwhile i < n and j < 5:\r\n if s[i] == s1[j]:\r\n count += 1\r\n j += 1\r\n i += 1\r\n\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w='hello'\r\ns=input()\r\nl=len(s)\r\na=0\r\nc=0\r\nfor i in range(l):\r\n if s[i]==w[a]:\r\n a=a+1\r\n c=c+1\r\n if c==5:\r\n break\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = str(input())\r\nhello = ['h', 'e', 'l', 'l', 'o']\r\nchecker = -1\r\nfor charecter in hello:\r\n checker = a.find(charecter, checker + 1)\r\n if checker == -1:\r\n print('NO')\r\n exit()\r\nprint('YES')", "s=input()\r\nx='hello'\r\ncount=0\r\nfor i in s:\r\n if(count<5):\r\n if i==x[count]:\r\n count+=1\r\nif(count==5):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a = list(input())\r\nn = len(a)\r\ni=0\r\nj=0\r\ncount =0\r\nb = list('hello')\r\nflag =0\r\nwhile i<n:\r\n if a[i]==b[j]:\r\n j +=1\r\n if j==5:\r\n break\r\n i+=1\r\nif j == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "def main():\r\n\ts = input()\r\n\th = s.find('h')\r\n\te = s.find('e', h + 1)\r\n\tla = s.find('l', e + 1)\r\n\tlb = s.find('l', la + 1)\r\n\to = s .find('o', lb + 1)\r\n\r\n\treturn 'NO' if h == -1 or e == -1 or la == -1 or lb == -1 or o == -1 else 'YES' \r\nprint(main())", "s = list(input())\r\na = list('hello ')\r\nj = 0\r\nfor i in s:\r\n if i != a[j]:\r\n pass\r\n else:\r\n j += 1\r\nif j == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "\r\nx=input()\r\nb=''\r\nif 'h' in x and 'e' in x and 'l' in x and 'l' in x and 'o' in x:\r\n for i in x:\r\n if i=='h':\r\n b+='h'\r\n x=x[x.index('h')+1:len(x)]\r\n break\r\n for i in x:\r\n if i=='e':\r\n b+='e'\r\n x=x[x.index('e')+1:len(x)]\r\n break\r\n \r\n for i in x:\r\n if i=='l':\r\n b+='l'\r\n x=x[x.index('l')+1:len(x)]\r\n break\r\n for i in x:\r\n if i =='l':\r\n b+='l'\r\n x=x[x.index('l')+1:len(x)]\r\n break\r\n for i in x:\r\n if i=='o':\r\n b+='o'\r\n \r\n break\r\n if b=='hello':\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "s = iter(input())\r\nflagList = []\r\n\r\nfor c in 'hello':\r\n if c in s:\r\n flagList.append(1)\r\n continue\r\n else:\r\n flagList.append(0)\r\n continue\r\n\r\nprint(\"NYOE S\"[all(flagList)::2])\r\n", "n = input()\r\na = [0, 0, 0, 0, 0]\r\ni = [0, 0, 0, 0, 0]\r\nfor index, char in enumerate(n):\r\n if char == 'h' and a[0] == 0:\r\n i[0] = index\r\n a[0] = 1\r\n continue\r\n if char == 'e' and a[1] == 0 and a[0] == 1:\r\n i[1] = index\r\n a[1] = 1\r\n continue\r\n if char == 'l' and a[2] == 0 and a[1] == 1 and a[0] == 1:\r\n i[2] = index\r\n a[2] = 1\r\n continue\r\n if char == 'l' and a[3] == 0 and a[1] == 1 and a[0] == 1 and a[2] == 1:\r\n i[3] = index\r\n a[3] = 1\r\n continue\r\n if char == 'o' and a[4] == 0 and a[1] == 1 and a[0] == 1 and a[2] == 1 and a[3] == 1:\r\n i[4] = index\r\n a[4] = 1\r\n continue\r\n\r\nif i[0] < i[1] and i[1] < i[2] and i[2] < i[3] and i[3] < i[4]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\n\r\n\r\ndef comparison(word,sentence):\r\n\tif word == \"\":\r\n\t\treturn \"YES\"\r\n\tif sentence == \"\":\r\n\t\treturn \"NO\"\r\n\tif word[0] == sentence[0]:\r\n\t\treturn comparison(word[1:],sentence[1:])\r\n\telif word[0] != sentence[0]:\r\n\t\treturn comparison(word,sentence[1:])\r\n\r\n# i am 100% certain this will not work\r\n# :)\r\n\r\ndef main():\r\n\tsentence = input()\r\n\tword = \"hello\"\r\n\tprint(comparison(word,sentence))\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\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()", "import sys\r\nm = input()\r\nh = 'hello'\r\nif len(m)>len(h) or m== h:\r\n j = 0\r\n for i in h:\r\n \r\n if i in m:\r\n j = m.index(i)\r\n m = m.replace(m[0:j+1],'',1)\r\n else:\r\n print('NO')\r\n sys.exit()\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nx = ['e','l','l','o']\r\nl = []\r\nif s.find('h')!=-1:\r\n l.append(s.find('h'))\r\n for i in range(4):\r\n if s.find(x[i],l[-1]+1)!=-1:\r\n l.append(s.find(x[i],l[-1]+1))\r\n else:\r\n break \r\nif len(l)==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "s = input()\r\na = ['h', 'e', 'l', 'l', 'o']\r\nj = 0\r\nfor i in s:\r\n\tif i == a[j]:\r\n\t\tj += 1\r\n\tif j == 5:\r\n\t\tbreak\r\nres = \"YES\" if j == 5 else \"NO\"\r\nprint(res)", "y = input().lower()\r\na = y.find('h')\r\nb = y.find('e', a + 1)\r\nc = y.find('l', b + 1)\r\nd = y.find('l', c + 1)\r\ne = y.find('o', d + 1)\r\nif e > d > c > b > a:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=''\r\nfor i in range(len(a)):\r\n if a[i]=='h' and b=='':\r\n b+='h'\r\n elif a[i]=='e' and b=='h':\r\n b+='e'\r\n elif a[i]=='l' and b=='he':\r\n b+='l'\r\n elif a[i]=='l' and b=='hel':\r\n b+='l'\r\n elif a[i]=='o' and b=='hell':\r\n b+='o'\r\nif b=='hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#Author : Zahin uddin\r\n#Github : https://github.com/Zahin52\r\n\r\n\r\nfrom sys import *\r\n#import math\r\n#import queue\r\nimport re\r\ninput=stdin.readline\r\nlistInput=lambda:list(map(int,input().strip().split()))\r\nlineInput= lambda:map(int,input().strip().split())\r\nsJoin=lambda a,sep : f'{sep}'.join(a)\r\narrJoin=lambda a,sep : f'{sep}'.join(map(str,a))\r\n#print=stdout.write\r\ndef main():\r\n s=input()\r\n l=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\n s=re.sub(\"[^helo]\",\"\",s)\r\n c=0\r\n for i in s:\r\n if c>4:\r\n break\r\n if i==l[c]:\r\n c+=1\r\n print(\"YES\" if c==5 else \"NO\")\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "x=\"hello\"\r\nz=input()\r\nb=0\r\nc=1\r\nv=\"\"\r\nfor i in z:\r\n if i in x:\r\n if x[b:c]==i:\r\n v=v+i\r\n b=c\r\n c=c+1\r\n\r\n \r\nif v==x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python3\r\nfrom sys import stdin\r\n\r\n\r\ndef solve(tc):\r\n s = stdin.readline().strip()\r\n toCheck = list(\"hello\")\r\n\r\n n = len(s)\r\n p = 0\r\n k = 0\r\n while p < n:\r\n if s[p] == toCheck[k]:\r\n k += 1\r\n if k == len(toCheck):\r\n print(\"YES\")\r\n return\r\n p += 1\r\n print(\"NO\")\r\n\r\n\r\ntcs = 1\r\nfor tc in range(tcs):\r\n solve(tc)\r\n", "s=input()\r\nst='hello'\r\nm=0\r\nc=0\r\n\r\nfor i in range(len(s)):\r\n if s[i]==st[m] :\r\n m+=1\r\n if m==5:\r\n c=1\r\n break\r\nif c==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=str(input())\r\nn=list(s)\r\nhello=''\r\nfor i in range(len(n)):\r\n if n[i]=='h' and hello=='':\r\n hello+=n[i]\r\n elif n[i]=='e' and hello=='h':\r\n hello+=n[i]\r\n elif n[i]=='l' and (hello=='he' or hello=='hel'):\r\n hello+=n[i]\r\n elif n[i]=='o' and hello=='hell':\r\n hello+=n[i]\r\n break\r\nif hello=='hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import re\n\ns = input()\n\np = re.compile(\"[a-z]*h[a-z]*e[a-z]*l[a-z]*l[a-z]*o[a-z]*\")\n\nif p.match(s):\n\n print(\"YES\")\n\nelse:\n\n print(\"NO\")\n", "text = input()\r\n\r\nhello = 'hello'\r\ncount = 0\r\n\r\nfor ch in text:\r\n if ch == hello[count]:\r\n count += 1\r\n if count == 5:\r\n break\r\n\r\nprint('YES' if count == 5 else 'NO')", "word=input()\r\nh=word.find('h')\r\ne=word.find('e',h+1)\r\nl1=word.find('l',e+1)\r\nl2=word.find('l',l1+1)\r\no=word.find('o',l2+1)\r\nif 0<=h<e<l1<l2<o:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\r\n\r\n", "s = input()\r\ncount = 0\r\ny = 0\r\nx = 'hello'\r\nfor i in s:\r\n if (i == x[y]):\r\n count+=1\r\n y+=1\r\n if(count==5):\r\n break\r\nif(count == 5 ):\r\n print('YES')\r\nelse:\r\n print('NO')", "word = \"hello\"\nword_len = len(word)\n\ndata_input = input()\n\nletter_pointer = 0\nfor c in data_input:\n if c == word[letter_pointer]:\n letter_pointer += 1\n if letter_pointer == word_len:\n print(\"YES\")\n exit(0)\n\nprint(\"NO\")\nexit(0)\n", "a=input()\nfor i in range(len(a)):\n if'h'==a[i]:\n for j in range(i+1,len(a)):\n if'e'==a[j]:\n for k in range(j+1,len(a)):\n if'l'==a[k]:\n for l in range(k+1,len(a)):\n if'l'==a[l]:\n for o in range(l+1,len(a)):\n if'o'==a[o]:\n print('YES');exit()\nprint('NO')", "#!/usr/bin/python\r\n# -*- coding: UTF-8 -*-\r\n# import math\r\n\r\nexpected = ('h', 'e', 'l', 'l', 'o')\r\nline = input()\r\nline = line.lower()\r\nindex = 0\r\nfor ch in line:\r\n if ch == expected[index]:\r\n index = index + 1\r\n if index == 5:\r\n break\r\n\r\nif index == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\ns=\"hello\"\r\nj=0\r\nfor i in range(len(a)):\r\n if a[i]==s[j]:\r\n j+=1\r\n if j==5:\r\n break\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve(st):\r\n word = \"hello\"\r\n index = 0\r\n for i in range(0,len(st)):\r\n if(index==5):\r\n return \"YES\"\r\n if(st[i]==word[index]):\r\n index+=1\r\n\r\n if(index<5):\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n st = input()\r\n print(solve(st))", "s = input()\r\nhello = list('hello')\r\nfor c in s:\r\n if hello and c == hello[0]:\r\n hello.pop(0)\r\nprint(\"YES\" if not hello else \"NO\")\r\n", "s=input()\r\na=0\r\nb=0\r\nc=0\r\nd=0\r\ne=0\r\nfor i in range(len(s)):\r\n if s[i]=='h' or a==1:\r\n a=1\r\n if s[i]==\"e\" or b==1:\r\n b=1\r\n if s[i]==\"l\" or c==1:\r\n if c!=1:\r\n i+=1\r\n if i==len(s):\r\n break;\r\n c=1\r\n if s[i]==\"l\" or d==1:\r\n d=1\r\n if s[i]==\"o\" :\r\n e=1\r\n break;\r\nif e==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "lis=[0,0,0,0,0]\r\ns:str=input()\r\nfor x in s:\r\n if( x=='h'):\r\n lis[0]=1;\r\n continue\r\n elif (x=='e' and lis[0]==1 ):\r\n lis[1]=1\r\n continue\r\n elif(x=='l'and lis[2]==1):\r\n lis[3]=1\r\n elif (x == 'l' and lis[1] == 1):\r\n lis[2] = 1\r\n elif (x == 'o' and lis[3] == 1):\r\n lis[4]=1\r\n else:\r\n continue\r\nf=0\r\nfor y in lis:\r\n if(y==1):\r\n f+=1\r\n\r\nif(f==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "st = list(input())\nans = 'hello'\nj = 0\nfor i in st:\n if i == ans[j]:\n j += 1\n if j == 5:\n break\n\nprint('YES' if j == 5 else 'NO')", "s = input()\r\nwrong = 0\r\nif len(s) < 5:\r\n print('NO')\r\nelse:\r\n for i in range(len(s)):\r\n if s[i] == 'h':\r\n break\r\n else:\r\n wrong +=1\r\n\r\n for j in range(i+1,len(s)):\r\n if s[j] == 'e':\r\n break\r\n else:\r\n wrong +=1\r\n\r\n for i in range(j+1,len(s)):\r\n if s[i] == 'l':\r\n break\r\n else:\r\n wrong +=1\r\n\r\n for j in range(i+1,len(s)):\r\n if s[j] == 'l':\r\n break\r\n else:\r\n wrong +=1\r\n\r\n for i in range(j+1,len(s)):\r\n if s[i] == 'o':\r\n break\r\n else:\r\n wrong +=1\r\n\r\n if wrong == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "s1 = input()\r\ns2 = \"hello\"\r\nj = 0\r\ncount = 0\r\nfor i in range(len(s1)):\r\n if s1[i] == s2[j]:\r\n j += 1\r\n count += 1\r\n if count == 5:\r\n print(\"YES\")\r\n break\r\nif count != 5:\r\n print(\"NO\")", "import re\r\n\r\npattern = r\"h(\\w)*e(\\w)*l(\\w)*l(\\w)*o(\\w)*\"\r\ns = input()\r\nif re.search(pattern,s):\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint (\"NO\")", "msg = input()\r\n\r\nletters = []\r\nres = \"NO\"\r\ntwo = False\r\nfor n in msg:\r\n if n == \"h\":\r\n letters.append(\"h\")\r\n if n == \"e\" and \"h\" in letters:\r\n letters.append(\"e\")\r\n if n == \"l\" and \"h\" in letters and \"e\" in letters:\r\n letters.append(\"l1\")\r\n if n == \"l\" and \"h\" in letters and \"e\" in letters and \"l1\" in letters and two == True:\r\n letters.append(\"l2\")\r\n if n == \"o\" and \"h\" in letters and \"e\" in letters and \"l1\" in letters and \"l2\" in letters:\r\n letters.append(\"o\")\r\n res = \"YES\"\r\n if \"l1\" in letters:\r\n two = True\r\n\r\nprint(res)", "cnt=0\r\nfor i in input():cnt+=i=='hello#'[cnt]\r\nprint(['NO','YES'][cnt>4])", "def main():\r\n str1 = input()\r\n arr1 = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\n curr = 0\r\n stat = \"NO\"\r\n\r\n for i in range(len(str1)):\r\n if(str1[i] == arr1[curr]):\r\n curr += 1\r\n if (curr == 5):\r\n stat = \"YES\"\r\n break\r\n\r\n print(stat)\r\n\r\nmain()\r\n\r\n", "s=input()\r\na=0\r\nc=0\r\nif(c!=-1):\r\n c=s.find('h')\r\n#print(c)\r\nif(c!=-1):\r\n c=s.find('e',c+1)\r\n#print(c)\r\nif(c!=-1):\r\n c=s.find('l',c+1)\r\n#print(c)\r\nif(c!=-1):\r\n c=s.find('l',c+1)\r\n#print(c)\r\nif(c!=-1):\r\n c=s.find('o',c+1)\r\n \r\n#print(c)\r\nif(c!=-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "a=list(input())\r\nl=[]\r\nYES=0\r\nfor i in range(0,len(a)):\r\n if a[i]==\"h\" :\r\n l.append(a[i])\r\n if a[i]==\"e\" :\r\n l.append(a[i])\r\n if a[i]==\"l\" :\r\n l.append(a[i])\r\n if a[i]==\"o\" :\r\n l.append(a[i])\r\nfor x in range(0,len(l)):\r\n if l[x]==\"h\":\r\n s=x\r\n for x in range(s+1,len(l)):\r\n if l[x]==\"e\":\r\n s=x\r\n for x in range(s+1,len(l)):\r\n if l[x]==\"l\":\r\n s=x\r\n for x in range(s+1,len(l)):\r\n if l[x]==\"l\":\r\n s=x\r\n for x in range(s+1,len(l)):\r\n if l[x]==\"o\":\r\n YES=1\r\n break\r\n else:\r\n continue\r\n break\r\n else:\r\n continue\r\n break\r\n else:\r\n continue\r\n break\r\n else:\r\n continue\r\n break\r\n else:\r\n continue\r\nif YES==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "w = input()\r\nc = 0\r\nr = \"hello\"\r\n\r\nfor l in w:\r\n if c == len(r):\r\n break\r\n if r[c] == l:\r\n c += 1\r\nif c == len(r):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nn=len(s)\r\nh=0\r\ne=0\r\nl1=0\r\nl2=0\r\no=0\r\nfor i in range(n):\r\n if(s[i]==\"h\"):\r\n h=i+1\r\n break\r\nfor i in range(h,n):\r\n if(s[i]==\"e\"):\r\n e=i+1\r\n break\r\nfor i in range(e,n):\r\n if(s[i]==\"l\"):\r\n l1=i+1\r\n break\r\nfor i in range(l1,n):\r\n if(s[i]==\"l\"):\r\n l2=i+1\r\n break\r\nfor i in range(l2,n):\r\n if(s[i]==\"o\"):\r\n o=i+1\r\n break\r\nif(min(h,e,l1,l2,o)==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n\r\n ", "s = input()\r\nb = 'hello'\r\nans = 0; j = 0;\r\nfor i in s :\r\n if i == b[j] :\r\n j += 1\r\n ans += 1\r\n if ans == 5 :\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n\r\n", "# str = input()\r\n# li=[]\r\n# str2 = \"\"\r\n# lcount = 0\r\n# for i in str:\r\n# if i not in li and (i=='h' or i=='e' or i=='l' or i=='o'):\r\n# li.append(i)\r\n# elif i=='l' and lcount<1:\r\n# li.append(i)\r\n# lcount+=1\r\n# for i in li:\r\n# str2+= i\r\n# if str2==\"hello\":\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\nstr = input()\r\npresetStr = ['h','e','l','l','o']\r\ncount = 0\r\nfor i in str:\r\n if count<len(presetStr):\r\n if i == presetStr[count]:\r\n count+=1\r\n else:\r\n break\r\nif count==len(presetStr):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# Night Vision\r\nss = input().lower()\r\ns = \"\"\r\np = \"NO\"\r\nfor i in ss:\r\n if i == \"h\" and s.count(\"h\") < 1:\r\n s += i\r\n elif i == \"e\" and \"h\" in s and s.count(\"e\") < 1:\r\n s += i\r\n elif i == \"l\" and \"he\" in s and s.count(\"l\") < 2:\r\n s += i\r\n elif i == \"o\" and \"hell\" in s:\r\n s += i\r\n p = \"YES\"\r\n break\r\nprint(p)\r\n", "s=input()\r\nx='hello'\r\nif len(s)<5:\r\n print('NO')\r\n exit()\r\nj=0\r\nfor i in s:\r\n if x[j]==i:\r\n j+=1\r\n if j==5:\r\n print('YES')\r\n break\r\nif j!=5:\r\n print('NO')\r\n ", "def ChatRoom(text):\r\n\trequiredText = \"hello\"\r\n\ti = 0\r\n\tfor c in text:\r\n\t\tif(requiredText[i]==c):\r\n\t\t\ti+=1\r\n\t\tif(i==len(requiredText)):\r\n\t\t\treturn \"YES\"\r\n\r\n\treturn \"NO\"\r\n\r\ninputText = input()\r\nprint(ChatRoom(inputText)) \r\n", "try:\r\n s=str(input())\r\n r=\"hello\"\r\n c=0\r\n f=0\r\n for i in range(len(s)):\r\n if(s[i]==r[c]):\r\n c+=1\r\n if(c==5):\r\n f=1\r\n break\r\n if(f==1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nexcept:\r\n pass", "w=input()\nh=\"hello\"\nj=0\nfor i in range(len(w)):\n if j<=4:\n if w[i]==h[j]:\n j+=1\n else:\n break\n\nif j==5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t\t \t\t\t\t\t\t\t \t \t \t\t\t \t\t\t\t\t\t", "s = input()\r\na = \"hello\"\r\nif \"h\" in s and \"e\" in s and \"l\" in s and \"o\" in s:\r\n indices = [i for i, x in enumerate(s) if x == \"h\"]\r\n k = min(indices)\r\n for j in range(1,len(a)):\r\n indices = [i for i, x in enumerate(s) if x == a[j]]\r\n l = [i for i in indices if i > k]\r\n if len(l) > 0:\r\n k = min(l)\r\n flag = True\r\n else:\r\n flag = False\r\n break\r\n \r\n if flag == True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "y=input()\r\nflag=1\r\nfor i in range(len(y)):\r\n if flag==1 and y[i]==\"h\":\r\n flag=2\r\n continue\r\n if flag==2 and y[i]==\"e\":\r\n flag=3\r\n continue\r\n if flag==3 and y[i]==\"l\":\r\n flag=4\r\n continue\r\n if flag==4 and y[i]==\"l\":\r\n flag=5\r\n continue\r\n if flag==5 and y[i]==\"o\":\r\n flag=6\r\n continue\r\nif flag==6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#! python3\n# chat_room.py\n\ninput_str = input()\n\nindex = 0\nhello = list('hello')\nfor c in input_str:\n if hello[index] == c:\n index += 1\n if index == len(hello):\n break\n\nif index == len(hello):\n print('YES')\nelse:\n print('NO')\n", "s=input()\r\nword='hello'\r\nb=''\r\nfor i in word:\r\n for j in range(len(s)):\r\n if i==s[j]:\r\n b+=s[j]\r\n s=s[j+1:]\r\n break\r\nif b=='hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "# http://codeforces.com/problemset/problem/58/A\r\n\r\n\r\n# Vasya has recently learned to type and log on to the Internet.\r\n# He immediately entered a chat room and decided to say hello to everybody.\r\n# Vasya typed the word s.\r\n# It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\".\r\n# For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello,\r\n# and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello.\r\n# Determine whether Vasya managed to say hello by the given word s.\r\n\r\n# Input\r\n# The first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters.\r\ns = input()\r\n\r\nhello_string = 'hello'\r\nhello_iterator = 0\r\ns_iterator = 0\r\n\r\nwhile (s_iterator < len(s) and hello_iterator < len(hello_string)):\r\n if hello_string[hello_iterator] == s[s_iterator]:\r\n # if a letter is found, step to the next letter of the word hello\r\n hello_iterator += 1\r\n\r\n # continue iterating through s\r\n s_iterator += 1\r\n\r\n\r\n\r\n# Output\r\n# If Vasya managed to say hello, print \"YES\", otherwise print \"NO\".\r\nif hello_iterator == len(hello_string):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "if __name__ == '__main__':\n p = 'hello'\n s = input()\n\n g = False\n\n pp = 0\n for l in s:\n if l == p[pp]:\n pp += 1\n if pp == len(p):\n g = True\n break\n\n print('YES' if g else 'NO')\n", "a=iter(input());print(['NO', 'YES'][all(c in a for c in 'hello')])", "s=str(input())\r\nd=\"hello\"\r\nj=0\r\nfor i in range(0,len(s)):\r\n if j < 5:\r\n if s[i] == d[j]:\r\n j+=1\r\nif j == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "f=0\r\nv=0\r\nt=0\r\nch=['h','e','l','l','o']\r\ns=input()\r\nfor v in range(0,len(s)):\r\n if(s[v]==ch[t]):\r\n t=t+1\r\n if(t==5):\r\n f=1\r\n break\r\nif(f):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nn=0\r\ng='hello'\r\n\r\nfor i in a:\r\n if(i==g[n]):\r\n n=n+1\r\n \r\n if(n==len(g)):\r\n break\r\nif(n==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "s = input()\nlen = len(s)\nk = 0\nfor i in range(len):\n if s[i]=='h' and k==0:\n k+=1\n continue\n if s[i]=='e' and k==1:\n k+=1\n continue\n if s[i]=='l' and (k==2 or k==3):\n k+=1\n continue\n if s[i]=='o' and k==4:\n k+=1\n continue\n\n\nif k==5:\n print(\"YES\",end=\"\")\nelse:\n print(\"NO\",end=\"\")\n", "if __name__ == \"__main__\":\n s = input()\n word = \"hello\"\n ptr = 0\n for char in s:\n if char == word[ptr]:\n ptr+= 1\n if ptr == len(word):\n break\n if ptr == len(word):\n print(\"YES\")\n else:\n print(\"NO\")\n\t \t\t\t \t \t\t\t\t\t \t\t \t\t \t \t \t\t", "s=str(input())\r\nl=len(s)\r\na=0\r\nfor i in range(0,l):\r\n if s[i]=='h'and a==0:\r\n a=1\r\n i+=1\r\n elif s[i]=='e'and a==1:\r\n a=2\r\n i+=1\r\n elif s[i]=='l' and a==2:\r\n a=3\r\n i+=1\r\n elif s[i]=='l' and a==3:\r\n a=4\r\n i+=1\r\n elif s[i]=='o' and a==4:\r\n a=5\r\n i+=1\r\nif a==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "strn=\"\"\r\na=input().lower()\r\nstart=0\r\nflag=False\r\nfor i in \"hello\":\r\n checker=start\r\n for k in range (start,len(a)):\r\n if i==a[k]:\r\n start=k+1\r\n break\r\n if checker ==start:\r\n flag=True\r\n break\r\n\r\nif flag: print(\"NO\")\r\nelse: print(\"YES\")", "s=input()\r\na=\"hello\"\r\nc=0\r\nj=0\r\nfor i in range(len(s)):\r\n if j<5:\r\n if s[i]==a[j]:\r\n j=j+1\r\n c=c+1\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "s=input()\nhello=[\"h\",\"e\",\"l\",\"l\",\"o\"]\nfor l in s:\n if l==hello[0]:\n hello.pop(0)\n if len(hello)==0:\n print(\"YES\")\n exit()\nprint(\"NO\")", "palavra = input()\r\np = [letra for letra in palavra]\r\n\r\ntemplate = \"hello-\"\r\nanswer = \"YES\"\r\n\r\ni = 0\r\nindex = 0\r\naux = ''\r\nwhile(i < len(p) and index < len(template)):\r\n if(p[i] == template[index]):\r\n aux += template[index]\r\n index += 1\r\n i += 1\r\n else:\r\n p[i] = \"-1\"\r\n i += 1\r\n\r\nif(aux != 'hello'):\r\n answer = \"NO\"\r\n \r\nprint(answer)\r\n\r\n'''\r\ninput\r\nahhellllloou\r\noutput\r\nYES\r\ninput\r\nhlelo\r\noutput\r\nNO\r\n'''", "word = input()\r\nif word.find(\"h\") == -1:\r\n print(\"NO\")\r\nelse:\r\n firstH = word.index(\"h\")\r\n word = word[firstH:]\r\n finalString = \"\"\r\n found = False\r\n \r\n for x in range(len(word)):\r\n if word[x] == \"h\":\r\n finalString += \"h\"\r\n for y in range(x+1, len(word)):\r\n if word[y] == \"e\":\r\n finalString += \"e\"\r\n for z in range(y+1, len(word)):\r\n if word[z] == \"l\":\r\n finalString += \"l\"\r\n for k in range(z+1, len(word)):\r\n if word[k] == \"l\":\r\n finalString += \"l\"\r\n for g in range(k+1, len(word)):\r\n if word[g] == \"o\":\r\n finalString += \"o\"\r\n found = True\r\n break\r\n if found == True:\r\n break\r\n if found == True:\r\n break\r\n if found == True:\r\n break\r\n if found == True:\r\n break\r\n \r\n \r\n if \"hello\" in finalString:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a = input()\r\nh = 0\r\ne = 0\r\nl = 0\r\no = 0\r\nfor i in a:\r\n if i == 'h':\r\n h+=1\r\n if i == 'e' and h>0:\r\n e+=1\r\n if i == 'l' and e>0:\r\n l+=1\r\n if i == 'o' and l>1:\r\n o+=1\r\nif h!=0 and e!=0 and l>1 and o!=0:\r\n print('YES')\r\nelse:\r\n print('NO')", "t = input()\r\ntry:\r\n t1 = t[t.index('h') + 1:]\r\n t2 = t1[t1.index('e') + 1:]\r\n t3 = t2[t2.index('l') + 1:]\r\n t4 = t3[t3.index('l') + 1:]\r\n t5 = t4[t4.index('o') + 1:]\r\nexcept ValueError:\r\n print('NO')\r\nexcept IndexError:\r\n print('NO')\r\nelse:\r\n print('YES')", "import math\r\n######################################################\r\n# ps template\r\ndef mi(): return map(int, input().split())\r\ndef ii(): return int(input())\r\ndef li(): return list(map(int, input().split()))\r\ndef si(): return input().split()\r\n\r\n#######################################################\r\n\r\ns = input()\r\nk = \"hello\"\r\ncnt = 0\r\nfor i in s:\r\n if k[cnt]==i:\r\n cnt +=1\r\n if cnt==5:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n", "def word_hello(s):\r\n word = 'hello'\r\n word_index = 0\r\n \r\n for char in s:\r\n if char == word[word_index]:\r\n word_index += 1\r\n if word_index == len(word):\r\n return 'YES'\r\n return 'NO'\r\ns = input()\r\nresult = word_hello(s)\r\nprint(result)", "s = input()\na = 'hello'\ncount,j = 0,0\n\nfor i in range(len(s)):\n\tif s[i] == a[j]:\n\t\tcount += 1\n\t\tj += 1\n\tif count == 5:\n\t\tbreak\n\nprint('YES' if count == 5 else 'NO')\n\n", "line=input()\r\ns=len(line)\r\na,k,a1,a2,a3,a4,a5=0,0,0,0,0,0,0\r\nfor i in range(k,s):\r\n if line[i]==\"h\":\r\n k=i+1\r\n a1=1\r\n break\r\nif a1==1:\r\n for i in range(k,s):\r\n if line[i]==\"e\":\r\n k=i+1\r\n a2=1\r\n break\r\n if a2==1:\r\n for i in range(k,s):\r\n if line[i]==\"l\":\r\n k=i+1\r\n a3=1\r\n break\r\n if a3==1:\r\n for i in range(k,s):\r\n if line[i]==\"l\":\r\n k=i+1\r\n a4=1\r\n break\r\n if a4==1:\r\n for i in range(k,s):\r\n if line[i]==\"o\":\r\n k=i+1\r\n a5=1\r\n break\r\na=a1+a2+a3+a4+a5\r\nif a==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Mar 8 20:38:47 2021\r\n\r\n@author: Aspire\r\n\"\"\"\r\n\r\ns = input()\r\n\r\nchar = 'hello'\r\nc = 0\r\nfor i in range(0,len(s)):\r\n if s[i] == char[c]:\r\n # print(char[c])\r\n c = c+1\r\n # print(c)\r\n if c==5:\r\n break\r\n \r\nif c==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "s=input()\r\nn=len(s)\r\nl=[]\r\nans=True\r\nif \"h\" in s:\r\n \r\n s=s[s.index(\"h\")+1:]\r\nelse:\r\n ans=False\r\nif \"e\" in s:\r\n \r\n s=s[s.index(\"e\")+1:]\r\nelse:\r\n ans=False\r\nif \"l\" in s:\r\n \r\n s=s[s.index(\"l\")+1:]\r\nelse:\r\n ans=False\r\nif \"l\" in s:\r\n \r\n s=s[s.index(\"l\")+1:]\r\nelse:\r\n ans=False\r\n\r\nif \"o\" in s:\r\n \r\n s=s[s.index(\"o\")+1:]\r\nelse:\r\n ans=False\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "s = input()\r\ncheck = \"hello\"\r\nj = 0\r\nf = False\r\nfor i in range(len(s)):\r\n\tif s[i]==check[j]:\r\n\t\tj+=1\r\n\tif j==5:\r\n\t\tf = True\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nif(f==False):\r\n\tprint(\"NO\")\r\n\t\r\n\r\n", "def main():\n\ts='hello'\n\tn=0\n\tfor i in input():\n\t\tif n<5 and i==s[n]:\n\t\t\tn+=1\n\tif n==5:\n\t\tprint('YES')\n\t\treturn 0\n\tprint('NO')\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\n", "s=input()\r\nm=\"hello\"\r\ni=0\r\nj=0\r\nwhile i<len(s)and j<len(m):\r\n if s[i]==m[j]:\r\n i+=1\r\n j+=1\r\n else:\r\n i+=1\r\nif j==len(m):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "s=input()\r\nl=len(s)\r\ni=0\r\nref=['h','e','l','l','o']\r\nwhile len(ref)>0 and i<l:\r\n if ref[0]==s[i]:\r\n ref.pop(0)\r\n i+=1\r\nprint(\"YES\" if len(ref)==0 else \"NO\")", "s = input()\r\nh = \"hello\"\r\ni = 0\r\nfor ch in s:\r\n if i == len(h):\r\n break\r\n if ch == h[i]:\r\n i += 1\r\nif i == len(h):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n ", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left \r\nfrom bisect import bisect_right\r\nfrom collections import deque\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\nst = 'hello'\r\nj = 0\r\ns = input()\r\nfor i in range(len(s)):\r\n if s[i] == st[j]:\r\n j += 1\r\n if j == 5:\r\n break\r\nif j == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nt = 'hello#'\r\ncnt = 0\r\nfor i in s:\r\n if(i == t[cnt]):\r\n cnt += 1\r\nprint(['NO', 'YES'][cnt == 5])", "s=input()\r\ndef f(s):\r\n a='hello'\r\n k=0\r\n for i in range(0,len(s)):\r\n if(k==5):\r\n return(\"YES\")\r\n if(s[i]==a[k]):\r\n k+=1\r\n if(k<5):\r\n return(\"NO\")\r\n else:\r\n return(\"YES\")\r\nprint(f(s))\r\n\r\n \r\n", "def main():\n s = input().lower()\n s1 = ''\n l_cnt = 0\n i = 0\n for cl in 'hello':\n while i < len(s):\n if s[i] == cl:\n s1 += s[i]\n i += 1\n break\n i += 1 \n print('YES' if 'hello' in s1 else 'NO')\n \n \nif __name__ == '__main__':\n # t = int(input())\n # while t > 0:\n # t -= 1\n # main()\n main()", "s=input()\nnow=0\nans='hello'\nfor i in s:\n if i==ans[now]:\n now+=1\n if now==5:\n print('YES')\n break\nelse:print('NO')\n", "\r\ns = input ()\r\nh , e , l1 , l2 , o = 0 , 0 , 0 , 0 , 0\r\ni = 0\r\nfor i in range (len(s)) :\r\n if (s[i] == 'h'):\r\n h = i\r\n break\r\nk = i\r\nfor i in range (len(s)) :\r\n if (s[i] == 'e' and i > k ):\r\n e = i\r\n break\r\nk = i\r\n\r\nfor i in range (len(s)) :\r\n if (s[i] == 'l' and i > k):\r\n l1 = i\r\n break\r\nk = i\r\n\r\nfor i in range (len(s)) :\r\n if (s[i] == 'l' and i != l1 and i > k ):\r\n l2 = i\r\n break\r\nk = i\r\n\r\nfor i in range (len(s) ) :\r\n if (s[i] == 'o' and i > k ):\r\n o = i\r\n break\r\nif ( h < e < l1 < l2 < o) :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "import re\r\ntxt = input()\r\nx = re.search(\"^.*h.*e.*l.*l.*o.*$\", txt)\r\nif x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\nn = len(s)\r\nx=0\r\nfor i in s:\r\n\tif i == \"h\":\r\n\t\ts=s[s.index(i)+1:]\r\n\t\t\r\n\t\tx +=1\r\n\t\tbreak\t\t\t\t\r\nfor j in s:\r\n\tif j==\"e\":\r\n\t\ts=(s[s.index(j)+1:])\r\n\t\t\r\n\t\tx +=1\r\n\t\tbreak\r\nfor l in s:\r\n\tif l==\"l\":\r\n\t\ts=s[s.index(l)+1:]\r\n\t\t\r\n\t\tx +=1\r\n\t\tbreak\r\nfor e in s:\r\n\tif e==\"l\":\r\n\t\ts=s[s.index(e)+1:]\r\n\t\t\r\n\t\tx +=1\r\n\t\tbreak\r\nfor d in s:\r\n\tif d==\"o\" and x==4:\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n\t\t\t\t\t\t\t\t\t\t\r\n\r\n\r\n\t\r\n", "s = input()\r\nf1 = False\r\nf2 = False\r\nf3 = False\r\nf4 = False\r\nf5 = False\r\ni1 = 101\r\ni2 = 101\r\ni3 = 101\r\ni4 = 101\r\ni5 = 101\r\nfor i in range(len(s)):\r\n if s[i]=='h':\r\n f1 = True\r\n i1 = i\r\n if s[i]=='e' and i>i1:\r\n f2 = True\r\n i2 = i\r\n if s[i]=='l' and i>i2 and f3==False:\r\n f3 = True\r\n i3 = i\r\n if s[i]=='l' and i>i3:\r\n f4 = True\r\n i4 = i\r\n if s[i]=='o' and i>i4:\r\n f5 = True\r\nif f1 and f2 and f3 and f4 and f5: print(\"YES\")\r\nelse: print(\"NO\")", "sum = 0\r\nword = input()\r\nfor i in word:\r\n if sum == 0:\r\n if i == 'h':\r\n sum += 1\r\n elif sum == 1:\r\n if i == 'e':\r\n sum += 1\r\n elif sum == 2:\r\n if i == 'l':\r\n sum += 1\r\n elif sum == 3:\r\n if i == 'l':\r\n sum += 1\r\n elif sum == 4:\r\n if i == 'o':\r\n sum += 1\r\nif sum == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "memory = \"hello\"\r\ndef chatRoom():\r\n x = 0\r\n message = input()\r\n for i in range(len(message)):\r\n if message[i] == memory[x]:\r\n x += 1\r\n if x == 5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chatRoom())", "\r\ns = input().strip()\r\n\r\nh = s.find('h')\r\ne = s.find('e', h + 1)\r\nl1 = s.find('l', e + 1)\r\nl2 = s.find('l', l1+1)\r\no = s.find('o', l2 + 1)\r\n\r\nprint('YES' if h < e < l1 < l2 < o else 'NO')\r\n", "a=input()\r\nh='hello'\r\nv=0\r\nfor i in a:\r\n if i==h[v]:\r\n v+=1\r\n if v==5:\r\n break\r\nprint('YES' if v==5 else 'NO')", "a=input()\r\nb=\"hello\"\r\nj=0\r\nans=0\r\nfor i in range(len(a)):\r\n if a[i]==b[j]:\r\n j+=1\r\n ans+=1\r\n \r\n if(ans==5):\r\n break\r\nif(ans==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nx = 0\r\ny = \"NO\"\r\nfor i in s:\r\n if i == 'h' or x == 1 or x == 2 or x == 3 or x == 4:\r\n if x < 1:\r\n x = 1\r\n \r\n if i == 'e' or x == 2 or x == 3 or x == 4:\r\n if x < 2:\r\n x = 2\r\n \r\n if i == 'l' or x == 3 or x == 4:\r\n if x == 3 or x == 4:\r\n if i == 'l' or x == 4:\r\n if x < 4:\r\n x = 4\r\n \r\n if i == 'o':\r\n y = \"YES\"\r\n break\r\n if x < 3:\r\n x = 3\r\n \r\nprint(y)\r\n", "def main():\n string = str(input())\n try:\n h_, string = string.split(\"h\", 1)[0], string.split(\"h\", 1)[1]\n e_, string = string.split(\"e\", 1)[0], string.split(\"e\", 1)[1]\n l_1, string = string.split(\"l\", 1)[0], string.split(\"l\", 1)[1]\n l_2 = string.split(\"l\", 1)[0], string.split(\"l\", 1)[1]\n o_ = string.split(\"o\", 1)[0], string.split(\"o\", 1)[1]\n except IndexError:\n return \"NO\"\n\n return \"YES\"\n\n\nif __name__ == '__main__':\n print(main())\n", "sa=input()\r\nh=\"hello\"\r\nk=sa.find(h[0])\r\ni=1\r\nwhile k!=-1 and i<5:\r\n\tsa=sa[k+1:]\r\n\t\r\n\tk=sa.find(h[i])\r\n\ti+=1\r\n\t\r\nif k!=-1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\t", "import sys\ninput = sys.stdin.readline\n\n\ndef main():\n s = input().strip()\n hello = 'hello'\n #if len(s) <= len(hell):\n # return \"NO\"\n i = hi = 0 \n while i < len(s) and hi < len(hello):\n if s[i] == hello[hi]:\n hi +=1\n i +=1\n return \"YES\" if hi == len(hello) else \"NO\"\n \n\nprint(main())\n", "x = input()\r\ny = 'hello'\r\n\r\ni = 0\r\nj = 0\r\nm = len(x)\r\nn = 5\r\nwhile i<m and j<n:\r\n\tif x[i] == y[j]:\r\n\t\tj +=1\r\n\ti +=1\r\n\r\nif j==n:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "def Check():\r\n\tif str2==\"B\":\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\n\r\nstr1=input()\r\nstr2=\"A\"\r\nl=len(str1)\r\nfor i in range(l):\r\n\tif str1[i]==\"h\":\r\n\t\tfor j in range(i+1,l):\r\n\t\t\tif str1[j]==\"e\":\r\n\t\t\t\tfor k in range(j+1,l):\r\n\t\t\t\t\tif str1[k]==\"l\":\r\n\t\t\t\t\t\tfor m in range(k+1,l):\r\n\t\t\t\t\t\t\tif str1[m]==\"l\":\r\n\t\t\t\t\t\t\t\tfor n in range(m+1,l):\r\n\t\t\t\t\t\t\t\t\tif str1[n]==\"o\":\r\n\t\t\t\t\t\t\t\t\t\tstr2=\"B\"\r\n\t\t\t\t\t\t\t\t\t\tCheck()\r\n\r\nif str2==\"A\":\r\n\tprint(\"NO\")", "x = input()\r\ny = \"hello\"\r\nm = len(x)\r\nn = len(y)\r\nlis = [[-1 for j in range(n+1)]for i in range(m+1)]\r\ndef sub(x,y,m,n):\r\n if m == 0 or n == 0:\r\n return 0\r\n if lis[m][n]!=-1:\r\n return lis[m][n]\r\n if x[m-1] == y[n-1]:\r\n lis[m][n] = 1+sub(x,y,m-1,n-1)\r\n return lis[m][n]\r\n else:\r\n lis[m][n] = max(sub(x,y,m,n-1),sub(x,y,m-1,n))\r\n return lis[m][n]\r\nlg = sub(x,y,m,n)\r\nif lg == n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=str(input())\r\nt='hello'\r\nj=0\r\nflag=0\r\nfor i in range(len(s)):\r\n if t[j]==s[i]:\r\n j+=1\r\n if j==len(t):\r\n flag=1\r\n \r\n break\r\nif flag==1:\r\n print('YES')\r\n\r\nelse:\r\n print(\"NO\")", "def check_hello(s):\r\n hello = \"hello\"\r\n helloIndex = 0\r\n\r\n for letter in s:\r\n if letter == hello[helloIndex]:\r\n helloIndex += 1\r\n if helloIndex == len(hello):\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\n\r\nword = input()\r\nresult = check_hello(word)\r\nprint(result)\r\n", "target = 'hello'\r\n\r\ninput = input()\r\n\r\nindex = 0\r\n\r\nfor ch in input:\r\n if ch == target[index]:\r\n index+=1\r\n \r\n if (index == len(target)):\r\n break\r\n \r\nprint(\"YES\" if index == len(target) else \"NO\")", "s = input()\r\nss = { 1 : 'h', 2 : 'e', 3 : 'l', 4 : 'l', 5 : 'o'}\r\nj = 1\r\nfor i in range(len(s)):\r\n if s[i] == ss[j]:\r\n j += 1\r\n if j == 6:\r\n break\r\nif j > 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\r\nmsg=input()\r\nprint('YES' if re.search(r'h.*e.*l.*l*.o.*',msg) else 'NO')", "a=input()\r\nb='hello'\r\nna=len(a)\r\nnb=len(b)\r\nj=0\r\nfor i in range(na):\r\n if a[i]==b[j]:\r\n j+=1\r\n if(j==nb):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "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 = list(input())\r\n x = [0]*len(s)\r\n w = list('hello')\r\n if s[0] == w[0]:\r\n x[0] = 1\r\n for i in range(0, len(s)):\r\n if not s[i] in w:\r\n x[i] = 0 if i==0 else x[i-1]\r\n continue\r\n for j in range(0, i):\r\n if x[j] < len(w):\r\n if s[i] == w[x[j]]:\r\n x[i] = max(x[i], x[j]+1)\r\n if (i>0):\r\n x[i] = max(x[i], x[i-1])\r\n # print(x)\r\n # print(\" \" + \", \".join(s))\r\n print(\"YES\" if x[len(s)-1]==len(w) else \"NO\")\r\n\r\ndef test():\r\n run(\"\"\"ahhellllloou\"\"\", \"\"\"YES\"\"\")\r\n run(\"\"\"hlelo\"\"\", \"\"\"NO\"\"\")\r\n run(\"\"\"helhcludoo\"\"\", \"\"\"YES\"\"\")\r\n run(\"\"\"kgyelmchocojsnaqdsyeqgnllytbqietpdlgknwwumqkxrexgdcnwoldicwzwofpmuesjuxzrasscvyuqwspm\"\"\", \"\"\"YES\"\"\")\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", "word=input()\r\nmod='hello'\r\nk=0\r\ncont=0\r\nfor i in range(len(word)):\r\n if mod[k]==word[i]:\r\n cont+=1\r\n k+=1\r\n if cont==5:\r\n break\r\nif cont==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\nf = 0\nc = 0\nwhile c<5:\n for i,v in enumerate(\"hello\"):\n f = s.find(v,f)\n if f == -1:\n print(\"NO\")\n exit()\n f += 1\n c += 1\nprint(\"YES\")\n", "import sys\r\nmsg = str(input())\r\ntarg = 'hello'\r\ns = ''\r\ni = 0\r\nj = 0\r\nwhile i<len(targ) and j<len(msg):\r\n if msg[j] == targ[i]:\r\n s = s + msg[j]\r\n j += 1\r\n i += 1\r\n else:\r\n j += 1\r\nif s == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "string_val=input()\r\nstring_hello=\"hello\"\r\ncount=0\r\ntotal=0\r\nfor element in string_hello:\r\n scomp = element\r\n while count<=len(string_val)-1:\r\n if scomp==string_val[count]:\r\n string_val = string_val[count+1:len(string_val)]\r\n total+=1\r\n break\r\n count+=1\r\n count=0\r\nif(total==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\na=\"hello\"\r\nj=0\r\nfor i in range(len(s)):\r\n if s[i]==a[j]:\r\n j+=1\r\n if j==5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "Word = input()\n\nStrippedWords = []\nFinalWords = []\n\nfor a in Word: #removes letters other than \"helo\"\n if a not in \"helo\":\n continue\n else:\n StrippedWords.append(a)\n\ncount = 0\nfor b in StrippedWords:\n if count == 0 and b == \"h\":\n FinalWords.append(b)\n count +=1 \n elif count == 1 and b == \"e\":\n FinalWords.append(b)\n count +=1\n elif count == 2 and b == \"l\":\n FinalWords.append(b)\n count +=1\n elif count == 3 and b == \"l\":\n FinalWords.append(b)\n count +=1 \n elif count == 4 and b == \"o\":\n FinalWords.append(b)\n count +=1\n else:\n continue\n\n\nif FinalWords == [\"h\", \"e\", \"l\", \"l\",\"o\"]:\n print(\"YES\")\nelse:\n print(\"NO\")", "s=input()\r\ncount=0\r\nfor i in \"hello\":\r\n for j in range(0,len(s)):\r\n if i==s[j]:\r\n count+=1\r\n s=s[j+1:]\r\n break\r\nif count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import deque\r\nfrom collections import OrderedDict\r\nimport math\r\n \r\nimport sys\r\nimport os\r\nfrom io import BytesIO\r\nimport threading\r\nimport bisect\r\n\r\nimport operator\r\n \r\nimport heapq\r\n\r\n#sys.stdin = open(\"F:\\PY\\\\test.txt\", \"r\")\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef getLucky(limit):\r\n ar = [0]*5000\r\n ar[0], ar[1] = 4,7\r\n p2 = 1\r\n idx =0\r\n while(idx<=limit):\r\n if 4*(10**p2)>limit:\r\n break\r\n for idx in range(idx, idx+2**p2):\r\n ar[idx+2**p2]=4*(10**p2)+ar[idx]\r\n ar[idx+(2**p2)*2]=7*(10**p2)+ar[idx]\r\n idx+=1\r\n p2+=1\r\n return ar\r\n\r\ns = input()\r\nsH = \"hello1\"\r\nidx = 0\r\nfor i in range(len(s)):\r\n if s[i]==sH[idx]:\r\n idx+=1\r\nif idx==len(sH)-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n\r\n", "s=input()\r\na=['h','e','l','l','o']\r\nx=0\r\nc=0\r\nfor i in s:\r\n if i in a[x]:\r\n c+=1\r\n x+=1\r\n if x==5:\r\n break\r\nif c==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input() \r\nword='hello'\r\nx=0\r\ny=0 \r\nfor i in range(len(s)):\r\n if word[y] == s[i]:\r\n y+=1\r\n x+=1\r\n if x==5:\r\n break;\r\nif (x == 5) :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s=input()\r\na='hello'\r\nfor i in a:\r\n if i in s:\r\n s=s[s.index(i)+1:]\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "s=input()\r\ns=s.lower()\r\nb=0\r\nc=\"hello\"\r\nfor i in range(len(s)):\r\n if s[i]==c[b]:\r\n b=b+1\r\n if b==5:\r\n break\r\nif b==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\nc = 0\ntmp = 'hello'\nfor i in s:\n if i == tmp[c]:\n c += 1\n if c == 5:\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n", "n = input()\r\n\r\ncur = \"\"\r\nnexts = \"h\"\r\narr = [\"e\",\"l\",\"l\",\"o\"]\r\ncount = -1\r\nfor i in n:\r\n if count == 4:\r\n continue\r\n elif cur == \"\" and nexts == \"h\" and i == nexts :\r\n count = 0 \r\n cur = \"h\"\r\n elif cur != \"\" and i == arr[count]:\r\n count += 1 \r\n\r\nif count == 4:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s = input()\r\nk = ['h','e','l','l','o']\r\nx = 0\r\nfor i in s:\r\n if i==k[x]:\r\n x+=1\r\n if x>4:\r\n break\r\nif x>4:\r\n print('YES')\r\nelse:\r\n print('NO')", "line = input()\r\n\r\nfor c in 'hello':\r\n try:\r\n r = line.index(c)\r\n if r >= 0 and len(line)>=r+1:\r\n line = line[r+1:]\r\n else:\r\n print('NO')\r\n break\r\n except:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n \r\n ", "a=input()\r\nk=\"hello\"\r\ncount=0\r\nfor i in k:\r\n for j in range(0,len(a)):\r\n if a[j]==i:\r\n a=a[j+1:]\r\n count+=1\r\n break\r\n \r\nif count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l=list(input())\r\np=0\r\nx1=100\r\nfor x in range(len(l)):\r\n if l[x]=='h':\r\n p+=1\r\n x1=x\r\n break\r\nfor x in range(x1+1,len(l)):\r\n if l[x]=='e':\r\n p+=1\r\n x1=x\r\n break\r\nfor x in range(x1+1,len(l)):\r\n if l[x]=='l':\r\n p+=1\r\n x1=x\r\n break\r\nfor x in range(x1+1,len(l)):\r\n if l[x]=='l':\r\n p+=1\r\n x1=x\r\n break\r\nfor x in range(x1+1,len(l)):\r\n if l[x]=='o':\r\n p+=1\r\n x1=x\r\n break\r\nif p==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\n\r\nif len(s) < 5:\r\n print(\"NO\")\r\n exit(0)\r\n\r\ny = []\r\n\r\nfor i in s:\r\n if i == \"h\" or i == \"e\" or i == \"l\" or i == \"o\":\r\n y.append(i)\r\n\r\na = False\r\nb = False\r\nc = False\r\nd = False\r\ne = False\r\n\r\nfor i in range(0, len(y)):\r\n if y[i] == \"h\":\r\n a = True\r\n if a == True and y[i] == \"e\":\r\n b = True\r\n if c == True and y[i] == \"l\":\r\n d = True\r\n elif b == True and y[i] == \"l\":\r\n c = True\r\n if d == True and y[i] == \"o\":\r\n e = True\r\n\r\nif a and b and c and d and e:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s=input()\r\nnum=0\r\nq='w'\r\nw='w'\r\ne='w'\r\nt='w'\r\nfor i in range(len(s)):\r\n\tif s[i]=='h':\r\n\t\tq=s[i:]\r\n\t\tbreak\r\nfor i in range(len(q)):\r\n\tif q[i]=='e':\r\n\t\tw=q[i:]\r\n\t\tbreak\r\nfor i in range(len(w)):\r\n\tif w[i]=='l':\r\n\t\te=w[(i+1):]\r\n\t\tbreak\r\nfor i in range(len(e)):\r\n\tif e[i]=='l':\r\n\t\tt=e[i:]\r\n\t\tbreak\t\r\nfor i in range(len(t)):\r\n\tif t[i]=='o':\r\n\t\tnum+=1\t\r\n\t\tbreak\t\t\t\t\t\t\t\t\r\nif num==0:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n", "s=input()\r\nn=len(s)\r\ns=list(s)\r\ni=0\r\na,b,c,d,e=-1,-1,-1,-1,-1\r\nwhile i<n:\r\n if s[i]=='h':\r\n a=i\r\n break\r\n else:\r\n i=i+1\r\nwhile i<n:\r\n if s[i]=='e':\r\n b=i\r\n break\r\n else:\r\n i=i+1\r\nwhile i<n:\r\n if s[i]=='l':\r\n c=i\r\n break\r\n else:\r\n i=i+1\r\nwhile i<n:\r\n if s[i]=='l' and i!=c:\r\n d=i\r\n break\r\n else:\r\n i=i+1\r\nwhile i<n:\r\n if s[i]=='o':\r\n e=i\r\n break\r\n else:\r\n i=i+1\r\nif 0<=a<b<c<d<e:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\ng=\"hello\"\r\nt=0\r\nfor i in range (0,len(s)):\r\n if s[i]==g[t]:\r\n t+=1\r\n if t==5:\r\n print(\"YES\")\r\n exit()\r\nif t!=5:\r\n print(\"NO\")", "s = list(input())\r\na = list(\"hello\")\r\np = 0\r\nans = \"NO\"\r\nfor i in range(len(s)):\r\n if s[i] == a[p]:\r\n p+=1\r\n if p == 5:\r\n ans = \"YES\"\r\n break\r\nprint(ans) \r\n", "s = input()\r\nb = ''\r\na, c, d = 0, 0, 0\r\nfor i in range(len(s)):\r\n if s[i] is 'h':\r\n b = b + s[i]\r\n a = i\r\n break\r\nfor i in range(a, len(s)):\r\n if s[i] is 'e':\r\n b = b + s[i]\r\n c = i\r\n break\r\nfor i in range(c, len(s)):\r\n if s[i] is 'l':\r\n b = b + s[i]\r\n if 'll' in b:\r\n d = i\r\n break\r\nfor i in range(d, len(s)):\r\n if s[i] is 'o':\r\n b = b + s[i]\r\n break\r\nif 'hello' in b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\ncnt=0\r\nx=0\r\nm=\"hello\"\r\nfor i in range(len(s)):\r\n if s[i]==m[cnt]:\r\n cnt+=1\r\n if cnt==5:\r\n print(\"YES\")\r\n x=1\r\n break\r\nif x==0:\r\n print(\"NO\")", "a=input()\r\nb = 0\r\np = 0\r\nq = 0\r\nr = 0\r\ns = 0\r\nt = 0\r\nz=0\r\nfor i in a:\r\n if(i==\"h\" or p==1):\r\n b=1\r\n p=1\r\n if(i==\"e\" or q==1):\r\n b=2\r\n q=1\r\n if( r==1 or i==\"l\"):\r\n b=3\r\n r=1\r\n z+=1\r\n\r\n if((i==\"l\" and z>=2) or s==1):\r\n b=4\r\n s=1\r\n if(i==\"o\"):\r\n b=5\r\n break\r\n\r\nif(b==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = \"hello\"\r\nb = input()\r\nfor i in b:\r\n if len(a)==0:\r\n break\r\n if i==a[0]:\r\n a = a[0+1:]\r\n\r\nif len(a)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nCheck = [i for i in \"hello\"]\r\nfor i in s:\r\n if len(Check) == 0:\r\n break\r\n if i == Check[0]:\r\n Check.pop(0)\r\nif len(Check) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s,p,t=input(),0,'hello'\r\nfor i in range(len(s)):\r\n p+=1 if s[i]==t[p] else 0\r\n if p==5:break\r\nprint(\"YES\" if p==5 else \"NO\")", "s=input()\r\narr=list('olleh')\r\nflag=False\r\nfor i in s:\r\n if i==arr[-1]:\r\n arr.pop()\r\n if len(arr)==0:\r\n flag=True\r\n if flag:\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = list(\"hello\")\ns = input()\nfor i in s:\n\tif n != []:\n\t\tif i == n[0]:\n\t\t\tn.pop(0)\nprint(\"YES\" if n==[] else \"NO\")", "def substring(string, sub):\r\n\tif len(sub) ==0:\r\n\t\treturn True\r\n\tif len(string) == 0:\r\n\t\treturn False\r\n\tif string[0] == sub[0]:\r\n\t\treturn substring(string[1:], sub[1:])\r\n\treturn substring(string[1:], sub)\r\n\r\nstring = input()\r\nsub = \"hello\"\r\nif substring(string, sub):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=list(input())\r\nnum=0\r\np=len(n)\r\nfor i in range(p):\r\n if n[i]==\"h\":\r\n a=i\r\n num+=1\r\n break\r\n else:\r\n a=-1\r\n\r\nfor j in range(a+1,p):\r\n if n[j]==\"e\":\r\n b=j\r\n num+=1\r\n break\r\n else:\r\n b=a\r\n\r\nfor k in range(b+1,p):\r\n if n[k]==\"l\":\r\n c=k\r\n num+=1\r\n break\r\n else:\r\n c=b\r\n\r\nfor l in range(c+1,p):\r\n if n[l]==\"l\":\r\n d=l\r\n num+=1\r\n break\r\n else:\r\n d=c\r\n\r\nfor o in range(d+1,p):\r\n if n[o]==\"o\":\r\n num+=1\r\n break\r\n\r\nif num==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\ns1 = \"hello\"\r\n\r\ns = s.lower()\r\ni = 0\r\nj = 0\r\nwhile i < len(s) and j < 5:\r\n if s1[j] == s[i]:\r\n j += 1\r\n i += 1\r\nif j < 5:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "s=input()\r\nc=0\r\nfor i in range(0,len(s)):\r\n\tif(s[i]=='h'):\r\n\t\tfor j in range(i+1,len(s)):\r\n\t\t\tif(s[j]=='e'):\r\n\t\t\t\tfor k in range(j+1,len(s)):\r\n\t\t\t\t\tif(s[k]=='l'):\r\n\t\t\t\t\t\tfor l in range(k+1,len(s)):\r\n\t\t\t\t\t\t\tif(s[l]=='l'):\r\n\t\t\t\t\t\t\t\tfor m in range(l+1,len(s)):\r\n\t\t\t\t\t\t\t\t\tif(s[m]=='o'):\r\n\t\t\t\t\t\t\t\t\t\tc=1\r\n\t\t\t\t\t\t\t\t\t\tbreak\r\nprint(\"YES\" if c==1 else \"NO\")", "s = input()\r\nletters = list('hello')\r\n\r\nfor i in range(len(s)):\r\n cur = 0\r\n for j in range(i, len(s)):\r\n if s[j] == letters[cur]:\r\n cur += 1\r\n \r\n if cur == 5:\r\n print('YES')\r\n break\r\n \r\n if cur == 5:\r\n break\r\n\r\nelse:\r\n print('NO')\r\n", "n = input().lower()\r\ns = \"\"\r\nc = 0\r\nk = 'hello000'\r\nfor i in range(len(n)):\r\n if n[i] == k[c]:\r\n c+=1\r\n s += n[i]\r\nif s == 'hello':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n\r\n", "c=\"hello\"\r\nc1=c2=0\r\nc3=input()\r\nfor i in range(len(c3)):\r\n if c3[i]==c[c1]:\r\n c1=c1+1\r\n c2=c2+1\r\n if c2==5:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "s = input()\na= [\"h\",\"e\",\"l\",\"l\",\"o\"]\ntim = 0\nj=0\nfor i in range(len(s)):\n if s[i]==a[j]:\n j += 1\n tim +=1\n\n if tim == 5:\n print(\"YES\")\n break\n\nif tim < 5:\n print(\"NO\")\n \t \t \t\t\t \t\t\t\t\t \t \t \t \t", "s = input()\r\ntarget = \"hello\"\r\ni = 0\r\nfor c in s:\r\n if i == len(target):\r\n break\r\n if c == target[i]:\r\n i += 1\r\nif i == len(target):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1='hello'\r\nj=0\r\ns2=input()\r\nfor i in range(len(s2)):\r\n if s2[i]==s1[j]:\r\n j=j+1\r\n if j==len(s1):\r\n break\r\n# print(i)\r\n# break\r\nif j==len(s1):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n#for i in a:\r\n# for n in b:\r\n# if i == n:\r\n# d=d+i\r\n# print(i)\r\n# break\r\n# break\r\n\r\n#for m in range(len(c)):\r\n# if c[m]==d[m]:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n\r\n#for i in a:\r\n# for n in b:\r\n# if i == n:\r\n# d+=i\r\n #print(d)\r\n#for m in d:\r\n# if d.count(m)>1 #and m==len(d)-1:\r\n# d.replace(m,m)\r\n# e.append(d)\r\n# print(e)\r\n \r\n \r\n# e+=m\r\n# print(e)\r\n# if d.count(d[m]) > 1:\r\n# d=d.replace(m,e)\r\n# print(d)\r\n# e+=m\r\n# d=d.replace(m,e)\r\n \r\n \r\n\r\n", "def solve(s):\r\n w=\"hello\"\r\n ind=0\r\n for i in s:\r\n if ind==5:\r\n return \"YES\"\r\n if i==w[ind]:\r\n ind+=1\r\n return \"NO\" if ind<5 else \"YES\"\r\ns=input()\r\nprint(solve(s))", "s = input()\na = \"hello\"\nres = 0\nfor i in s:\n\tif i == a[res]:\n\t\tres += 1\n\t\tif res == 5: break\nif res >= 5: print(\"YES\")\nelse: print(\"NO\")", "a = input()\r\npro = True\r\nfor i in range(len(a)):\r\n if a[i] == \"h\":\r\n for j in range(i + 1, len(a)):\r\n if a[j] == \"e\":\r\n for k in range(j + 1, len(a)):\r\n if a[k] == \"l\":\r\n for h in range(k + 1, len(a)):\r\n if a[h] == \"l\":\r\n for q in range(h + 1, len(a)):\r\n if a[q] == \"o\":\r\n print(\"YES\")\r\n pro = False\r\n break\r\n break\r\n break\r\n break\r\n break\r\nif pro:\r\n print(\"NO\")\r\n", "s = input()\r\nn = len(s)\r\n\r\nif n < 5:\r\n print('NO')\r\n\r\nelse:\r\n count = 0\r\n \r\n if 'h' in s:\r\n count += 1\r\n s = s[s.index('h') + 1:]\r\n \r\n if 'e' in s:\r\n count += 1\r\n s = s[s.index('e') + 1:]\r\n \r\n if 'l' in s:\r\n count += 1\r\n s = s[s.index('l') + 1:]\r\n \r\n if 'l' in s:\r\n count += 1\r\n s = s[s.index('l') + 1:]\r\n \r\n if 'o' in s:\r\n count += 1\r\n s = s[s.index('o') + 1:]\r\n \r\n if count == 5:\r\n print('YES')\r\n \r\n else:\r\n print('NO')\r\n\r\n", "x= input()\r\nstr_1= \"hello\"\r\nstr_2= \"\"\r\n\r\nfor i in x:\r\n if str_2 + i == str_1[:len(str_2) + 1]:\r\n str_2 += i\r\nprint(\"YES\" if str_1==str_2 else \"NO\")", "s = input()\r\n\r\nh = ['h','e', 'l','l','o']\r\n\r\nindex = 0\r\n# h = 'hello'\r\n# s = 'asdasdhelloasdas' # True \r\n# s = 'hseslslso'\r\n# s = exxxlxxxlxxxo\r\nfor c in s:\r\n if c == h[index]:\r\n index = index + 1\r\n if index == 5:\r\n break\r\n\r\nif index == 5:\r\n print ('YES')\r\nelse:\r\n print('NO')", "s=input() \r\ntarget='hello' \r\ntmp=-1 \r\nans=0 \r\nfor i in target: \r\n tmp=s.find(i,tmp+1) \r\n if tmp==-1: \r\n print('NO') \r\n ans+=1 \r\n break \r\nif ans==0: \r\n print('YES') ", "import re\r\nst=input()\r\nif re.match(r'.*h.*e.*l.*l.*o.*',st):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "#2300012105 刘乐天，生命科学学院\r\ns=input()\r\na=\"hello\"\r\ni=0\r\no=0\r\nwhile o< len(s) and i<len(a):\r\n if s[o]==a[i]:\r\n i+=1\r\n o+=1\r\nif i==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nimport math\r\n#sys.stdin = open('input.txt')\r\n\r\n\r\ns = input()\r\nt = 'hello'\r\nr = ''\r\nk = 0\r\nfor i in range(len(t)):\r\n\tfor j in range(len(s)):\r\n\t\tif(t[i] == s[j]):\r\n\t\t\tr = r + (s[j])\r\n\t\t\ts = s[j+1:len(s)]\r\n\t\t\tbreak\r\n\r\nif(r != t):\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n\r\n\r\n\r\n", "s=input()\r\nhello=['h','e','l','l','o']\r\nindex=0\r\nfor i in range(0,len(s)):\r\n if s[i]==hello[index]:\r\n index+=1\r\n if index==5:\r\n break\r\nif index==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = input()\r\nb = ''\r\nfor i in a :\r\n if i == 'h' and b == '' :\r\n b += i\r\n elif i == 'e' and b == 'h' :\r\n b += i\r\n elif i == 'l' and b == 'he' :\r\n b += i\r\n elif i == 'l' and b == 'hel' :\r\n b += i\r\n elif i == 'o' and b == 'hell' :\r\n b += i\r\nif b == 'hello' and len(b) == 5 :\r\n print('YES')\r\nelse :\r\n print('NO') ", "s = input()\r\nh = s.find('h')\r\ne = s.find('e',h+1)\r\nl1 = s.find('l',e+1)\r\nl2 = s.find('l',l1+1)\r\no = s.find('o',l2+1)\r\nif h<e and e < l1 and l1 < l2 and l2<o :\r\n print('YES')\r\nelse:\r\n print('NO')", "\"\"\"A solution to 25A Chat Room.\"\"\"\r\n\r\n\r\ndef solution():\r\n s = input()\r\n h = \"hello\"\r\n\r\n i, j = 0, 0\r\n while i < len(h) and j < len(s):\r\n if h[i] == s[j]:\r\n i += 1\r\n\r\n j += 1\r\n\r\n if i >= len(h):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solution()\r\n", "line = str(input())\r\ninspecting_line = \"hello\"\r\nindex = 0\r\n\r\nfor a in line:\r\n\tif a == inspecting_line[index]:\r\n\t\tif index == 4:\r\n\t\t\tprint(\"YES\")\r\n\t\t\tbreak\r\n\t\tindex += 1\r\nelse:\r\n\tprint(\"NO\")", "str1 = input()\r\nstr2 = \"hello\"\r\ni, j, count = 0, 0, 0\r\n\r\nwhile i < len(str1) and j < len(str2):\r\n if str1[i] == str2[j]:\r\n j += 1\r\n count += 1\r\n i += 1\r\n\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def say_hello(s):\r\n hello = \"hello\"\r\n j = 0\r\n for i in range(len(s)):\r\n if j < len(hello) and s[i] == hello[j]:\r\n j += 1\r\n return \"YES\" if j == len(hello) else \"NO\"\r\n\r\ns = input()\r\nprint(say_hello(s))\r\n", "a=input()\r\n\r\nb=a.find('h')\r\nc=a.find('e',b+1)\r\nd=a.find('l',c+1)\r\ne=a.find('l',d+1)\r\nf=a.find('o',e+1)\r\n\r\nif b<c<d<e<f:\r\n print ('YES')\r\nelse:\r\n print ('NO')\r\n ", "\r\nstr = input('')\r\n\r\n\r\nh = str.find('h')\r\nif h != -1:\r\n str1 = str[h+1:len(str)]\r\n e = str1.find('e')\r\n if e != -1:\r\n str2 = str1[e+1:len(str1)]\r\n l = str2.find('l')\r\n if l != -1:\r\n str3 = str2[l + 1:len(str2)]\r\n l1 = str3.find('l')\r\n if l1 != -1:\r\n str4 = str3[l1 + 1:len(str3)]\r\n o = str4.find('o')\r\n if o != -1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse :\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=input()\r\nl=['h','e','l','l','o']\r\nk=0\r\ns=0\r\nt=[0]*5\r\nfor i in n:\r\n if i==l[k] and t[k]==0:\r\n t[k]=1\r\n k+=1\r\n if k==5:\r\n break\r\n else:\r\n pass\r\nflag=0\r\nfor i in range(5):\r\n if t[i]==0:\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\nstring = input().strip()\nprint(\"YES\" if bool(re.fullmatch(r'.*h.*e.*l.*l.*o.*',string)) else \"NO\")\n\n", "a=input()\r\nb='hello'\r\nj=0\r\nc=0\r\nfor i in range(len(a)):\r\n if(a[i]==b[j]):\r\n j+=1\r\n c+=1\r\n if(c==5):\r\n break\r\n \r\nif(c==5):\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[33]:\n\n\nmasukan = input()\nmasukan.lower()\nmasukanl = []\nfor i in masukan:\n masukanl = masukanl+[i]\nx = 0\nfor i in range(0,len(masukanl)):\n if masukanl[i] != 'h':\n masukanl[i] = ''\n else:\n x = i\n break\ny = x\nif len(masukanl)>y:\n for i in range(y+1,len(masukanl)):\n \n if masukanl[i] != 'e':\n masukanl[i] = ''\n else:\n x = i\n break\ny = x\nif len(masukanl)>y:\n for i in range(y+1,len(masukanl)):\n if masukanl[i] != 'l':\n masukanl[i] = ''\n else:\n x = i\n break\ny = x\nif len(masukanl)>y:\n for i in range(y+1,len(masukanl)):\n if masukanl[i] != 'l':\n masukanl[i] = ''\n else:\n x = i\n break\ny = x\nif len(masukanl)>y:\n for i in range(y+1,len(masukanl)):\n if masukanl[i] != 'o':\n masukanl[i] = ''\n else:\n x = i\n break\ny = x\nif len(masukanl)>y:\n for i in range(y+1,len(masukanl)):\n masukanl[i] = ''\noutput = ''\nfor i in masukanl:\n output = output+i\nif output == 'hello':\n print ('YES')\nelse:\n print ('NO')\n\n\n# In[ ]:\n\n\n\n\n", "s=['h','e','l','l','o']\r\na=[x for x in input()]\r\nj=0\r\nc=0\r\nfor i in range(len(a)):\r\n if a[i]==s[j]:\r\n j=j+1\r\n c=c+1\r\n if c==5:\r\n break\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nn = 5\r\nind = 0\r\n\r\nstring = 'hello'\r\n\r\nfor i in s:\r\n if ind < n and i == string[ind]:\r\n ind += 1\r\n\r\nif ind == n:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "word = \"hello\"\r\n\r\nc = 0\r\n\r\nfor i in input():\r\n if i == word[c]:\r\n c += 1\r\n if(c==5):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "hello = input()\r\nh = hello.find('h')\r\ne = hello.find('e', h + 1)\r\nl = hello.find('l', e + 1)\r\nl2 = hello.find('l', l + 1)\r\no = hello.find('o', l2 + 1)\r\nif h < e and e < l and l < l2 and l2 < o:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "# code force file\r\n\r\n# def calc_res():\r\n\r\ndef main():\r\n word = input()\r\n res = ''\r\n hello = list('hello')\r\n counter = 0\r\n for l in word:\r\n if l == hello[counter] and len(res) < counter + 1:\r\n res += l\r\n counter += 1\r\n if res == 'hello':\r\n print('YES')\r\n break\r\n if res != 'hello':\r\n print('NO')\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Sep 25 20:06:40 2023\r\n\r\n@author: 2300011413\r\n\"\"\"\r\n\r\n# 输入字符串s\r\ns = input()\r\n# 定义目标字符串\r\ntarget = \"hello\"\r\n# 遍历s中的每个字符\r\nfor c in s:\r\n # 如果c和目标字符串的第一个字符相同\r\n if c == target[0]:\r\n # 删除目标字符串的第一个字符\r\n target = target[1:]\r\n # 如果目标字符串为空，说明已经匹配完毕，跳出循环\r\n if target == \"\":\r\n break\r\n# 如果目标字符串为空，输出\"YES\"\r\nif target == \"\":\r\n print(\"YES\")\r\n# 否则输出\"NO\"\r\nelse:\r\n print(\"NO\")", "s=input(\"\")\r\na=\"hello\"\r\ni=0\r\nfor j in range(len(s)):\r\n if(s[j]==a[i]):\r\n i=i+1\r\n if(i==5):\r\n break\r\n else:\r\n continue\r\nif(i==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = str(input())\r\na = \"hello\" ; j= 0\r\nfor i in range(len(s)):\r\n if s[i] == a[j] :\r\n j+=1 ;\r\n if j == 5 :\r\n break\r\n\r\nif j == 5 :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "s = input()\r\nflag = 0\r\nn1 = s.find('h')\r\nn2 = s.find('e',n1+1)\r\nn3 = s.find('l',n2+1)\r\nn4 = s.find('l',n3+1)\r\nn5 = s.find('o',n4+1)\r\nif (n1<0 or n2<0 or n3<0 or n4<0 or n5<0):\r\n\tprint ('NO')\r\nelse:\r\n\tprint ('YES')\r\n", "s=input()\r\nword=\"hello\"\r\npointer=0\r\nfor i in range (len(s)):\r\n if (pointer < 5 and s[i]==word[pointer] ): #hlelo\r\n pointer+=1\r\nif pointer == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s=\"hello\"\r\nn=input()\r\nx=0\r\ncnt=0\r\nfor i in range(len(n)):\r\n if(s[cnt]==n[i]):\r\n cnt=cnt+1\r\n if(cnt==5):\r\n break;\r\nif(cnt==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 14 19:38:18 2020\r\n\r\n@author: zyc\r\n\"\"\"\r\n\r\nimport re\r\nstring=input('')\r\nif re.match('.*h.*e.*l.*l.*o.*',string):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nt = 'hello'\r\ni,j = 0,0\r\n\r\nwhile i<len(s) and j<5:\r\n if s[i]==t[j]:\r\n j+=1\r\n i+=1\r\nif j==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Nov 6 21:40:58 2018\n\n@author: LX\n\"\"\"\n\ns = input()\n\nif 'h' in s:\n s = s[s.index('h')+1:]\n if 'e' in s:\n s = s[s.index('e')+1:]\n if 'l' in s:\n s = s[s.index('l')+1:]\n if 'l' in s:\n s = s[s.index('l')+1:]\n if 'o' in s:\n print('YES')\n else:\n print('NO') \n else:\n print('NO') \n else:\n print('NO')\n else:\n print('NO') \nelse:\n print('NO') \n\n\n", "s=input()\r\nhello='hello'\r\nind=0\r\nfor c in s:\r\n\tif c==hello[ind]:\r\n\t\tind+=1\r\n\t\tif ind==len(hello):\r\n\t\t\tbreak\r\nif ind==len(hello):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "hello = ['h', 'e', 'l', 'l', 'o']\ni = -1\nx = [x for x in input()]\nfor j in hello:\n for i in range(i+1, len(x)):\n if x[i] != j:\n x[i]='0'\n else: \n break\nfor i in range(i+1, len(x)):\n x[i] = '0'\ny = [a for a in x if a != '0']\nif y == hello:\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", "obj = \"hello\" \r\ns = input() \r\nk = 0 \r\nfor i in range(len(s)):\r\n if k < len(obj) and obj[k] == s[i]:\r\n k += 1 \r\nif k != 5:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "def chatRoom():\r\n s=input()\r\n size=len(s)\r\n a='hello'\r\n checker=0\r\n x=0\r\n for i in range(size):\r\n if s[i]==a[x]:\r\n x=x+1\r\n checker=checker+1\r\n if x==5:\r\n break\r\n print(\"YES\" if checker==5 else \"NO\")\r\n\r\nchatRoom()\r\n\r\n\r\n\r\n\r\n\r\n", "def f():\r\n x = 0\r\n s = input()\r\n for i in range(len(s)):\r\n if s[i] == st[x]:\r\n x += 1\r\n if x == 5:\r\n return \"YES\"\r\n return \"NO\"\r\nst=\"hello\"\r\na=f()\r\nprint(a)", "s=input()\r\nh=\"hello\"\r\nj=0;\r\nflag=bool(1)\r\nfor i in range(len(s)):\r\n if(s[i]==h[j]):\r\n j+=1\r\n if(j==5):\r\n print(\"YES\")\r\n flag=0;\r\n break\r\nif(flag):\r\n print(\"NO\")", "l = list(input())\r\ncount = 0\r\nhello = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nfor i in l:\r\n #print(\"checking\",i,\"and\",hello[count])\r\n if(i == hello[count]):\r\n count += 1\r\n if(count==5):\r\n break\r\n\r\n\r\nif(count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "def main():\r\n import re\r\n print([\"NO\",\"YES\"][bool(re.search(\"h.*e.*l.*l.*o\",input()))])\r\nmain()\r\n", "t = \"hello\"\r\np = 0\r\ns = input()\r\nfor i in range(len(s)):\r\n if p > 4:\r\n break\r\n if t[p] == s[i]:\r\n p += 1\r\nif p == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=str(input())\r\na = len(s)-1\r\nfor i in range(len(s)):\r\n if s[i] == \"h\":\r\n a = i\r\n break\r\n\r\nb = len(s) - 1\r\nfor j in range(a+1,len(s)):\r\n if s[j] == \"e\":\r\n b = j\r\n break\r\n\r\nc = len(s)-1\r\nfor k in range(b+1,len(s)):\r\n if s[k] == \"l\":\r\n c = k\r\n break\r\n \r\nd = len(s)-1\r\nfor l in range(c+1,len(s)):\r\n if s[l] == \"l\":\r\n d = l\r\n break\r\n\r\nflag = 0\r\nfor m in range(d+1,len(s)):\r\n if s[m] == \"o\":\r\n print(\"YES\")\r\n flag = 1\r\n break\r\nif flag == 0:\r\n print(\"NO\")\r\n", "s = input()\nword = 'hello'\nhello = 0\n\nfor i in range(len(s)):\n if s[i] == word[hello]:\n hello += 1\n\n if hello == 5:\n break\n\n\nif hello == 5:\n print('YES')\nelse:\n print('NO')", "s = input()\r\nif 'h' in s:\r\n index = s.index('h')\r\n s = s[index:]\r\n if 'e' in s:\r\n index = s.index('e')\r\n s = s[index:]\r\n if 'l' in s:\r\n index = s.index('l')\r\n s = s[index+1:]\r\n if 'l' in s:\r\n index = s.index('l')\r\n s = s[index:]\r\n if 'o' in s:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO') \r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "s = input()\r\nl1 = []\r\nl2 = list(\"hello\")\r\ncount_h = 0\r\ncount_e = 0\r\ncount_l = 0\r\ncount_o = 0\r\nfor i in s:\r\n if i == 'h' and count_h == 0:\r\n l1.append(i)\r\n count_h += 1\r\n elif i == 'e' and (count_e == 0 and count_h == 1):\r\n l1.append(i)\r\n count_e += 1\r\n elif i == 'l' and (count_e == 1 and (count_l == 1 or count_l == 0)):\r\n l1.append(i)\r\n count_l += 1\r\n elif i == 'o' and (count_o == 0 and count_l == 2):\r\n l1.append(i)\r\n count_o += 1\r\n else:\r\n pass\r\n\r\n\r\nif l1 == l2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s = input()\r\nn = 0\r\ntmpn = 0\r\nhave = False\r\nfor i in 'hello':\r\n have = False\r\n for j in s[n:]:\r\n tmpn += 1\r\n if j == i:\r\n have = True\r\n break\r\n n = tmpn\r\n if have == False:\r\n print('NO')\r\n break\r\nif have:\r\n print('YES')\r\n ", "s=input()\r\nk=\"hello\"\r\nm=\"olleh\"\r\nt=\"\"\r\nc=4\r\nfor i in reversed(range(len(s))):\r\n \r\n if s[i]==k[c] and c>=0:\r\n t+=s[i]\r\n c-=1\r\n \r\nprint(\"YES\" if t==m else \"NO\")\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 12 16:27:18 2023\r\n\r\n@author: Zinc\r\n\"\"\"\r\ndata = 'hello'\r\nn = input().lower()\r\ndp = [0]*5\r\ncount = 0\r\nfor k in n:\r\n if k == data[count]:\r\n dp[count] += 1\r\n count += 1\r\n if count == 5:\r\n break\r\nif sum(dp) == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\nh=False\r\ne=False\r\nl1=False\r\nl2=False\r\no=False\r\nfor i in range(len(s)):\r\n if s[i]==\"h\" or s[i]==\"H\" and not h:\r\n h=True\r\n elif (s[i]==\"e\" or s[i]==\"E\") and (not e) and h:\r\n e=True\r\n elif (s[i]==\"L\" or s[i]==\"l\") and h and e and (not l1):\r\n l1=True\r\n elif (s[i]==\"L\" or s[i]==\"l\") and h and e and l1 and (not l2):\r\n l2=True\r\n elif (s[i]==\"O\" or s[i]==\"o\") and h and e and l1 and l2 and (not o):\r\n o=True\r\n if h and e and l1 and l2 and o:\r\n break\r\nif h and e and l1 and l2 and o:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\na=['h','e','l','l','o']\r\ncount,j=0,0\r\nfor i in s:\r\n if i==a[j]:\r\n count+=1\r\n j+=1\r\n if j>4:\r\n break\r\nif count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin \r\n\r\nmot = stdin.readline().strip()\r\n\r\nlongueur = len(mot)\r\nposition = 0\r\ncible = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\ntrouve = \"YES\"\r\n\r\nfor loop in range(5):\r\n try:\r\n place = mot.index(cible[loop], position)\r\n if position < longueur - 1:\r\n position = place + 1\r\n except:\r\n trouve = \"NO\"\r\n\r\nprint(trouve)\r\n", "a = input()\r\nb = \"hello\"\r\ni, j = 0, 0\r\nres = \"NO\"\r\nwhile(i<5 and j<len(a)):\r\n if(b[i]==a[j]):\r\n i=i+1\r\n j=j+1\r\n if i>4:\r\n res=\"YES\"\r\nprint(res)", "a=input()\r\narr=\"hello\"\r\nind=0\r\nflag=0\r\nfor i in range (0,len(a),1):\r\n if(a[i]==arr[ind]):\r\n ind=ind+1\r\n if ind==5:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "hello=list('hello')\r\ns=input()\r\narr=list(s)\r\ni=0\r\nwhile(len(hello)>0 and i!= len(s)):\r\n if(hello[0]==s[i]):\r\n hello.remove(s[i])\r\n i+=1\r\nif len(hello)==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "word = input()\r\nhello = \"hello\"\r\n\r\nhello_ptr = 0\r\nword_ptr = 0\r\nwhile word_ptr < len(word):\r\n if word[word_ptr] == hello[hello_ptr]:\r\n hello_ptr += 1\r\n if hello_ptr == len(hello):\r\n break\r\n \r\n word_ptr += 1\r\n \r\nif hello_ptr == len(hello):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ngreet = 'hello'\r\nnum = 0\r\nfor i in s:\r\n if i == greet[num]:\r\n num += 1\r\n if num == 5:\r\n break\r\nif num == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "A=input()\r\nn=len(A)\r\ni=0\r\ns=\"hello\"\r\nk=0\r\nwhile(i<n and k<5):\r\n if(A[i]==s[k]):\r\n k+=1\r\n i+=1\r\nif(k==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nimport math\r\nfrom collections import Counter\r\nfrom collections import OrderedDict\r\nfrom collections import defaultdict\r\nfrom functools import reduce\r\nsys.setrecursionlimit(10**6)\r\ndef inputt():\r\n return sys.stdin.readline().strip()\r\ndef printt(n):\r\n sys.stdout.write(str(n)+'\\n')\r\ndef listt():\r\n return [int(i) for i in inputt().split()]\r\n \r\ndef gcd(a,b): \r\n return math.gcd(a,b) \r\n \r\ndef lcm(a,b): \r\n return (a*b) // gcd(a,b) \r\n\r\ndef factors(n):\r\n step = 2 if n%2 else 1\r\n return set(reduce(list.__add__,([i, n//i] for i in range(1, int(math.sqrt(n))+1, step) if n % i == 0)))\r\n\r\ndef comb(n,k):\r\n factn=math.factorial(n)\r\n factk=math.factorial(k)\r\n fact=math.factorial(n-k)\r\n ans=factn//(factk*fact)\r\n return ans\r\n\r\ndef is_prime(n): \r\n if n <= 1: \r\n return False\r\n if n == 2: \r\n return True\r\n if n > 2 and n % 2 == 0: \r\n return False\r\n\r\n max_div = math.floor(math.sqrt(n)) \r\n for i in range(3, 1 + max_div, 2): \r\n if n % i == 0: \r\n return False\r\n return True\r\ndef maxpower(n,x):\r\n B_max = int(math.log(n, x)) + 1#tells upto what power of x n is less than it like 1024->5^4\r\n return B_max\r\n\r\n#t=int(inputt())\r\nt=1\r\nfor _ in range(t):\r\n s=inputt()\r\n g=\"hello\"\r\n k=0\r\n for i in s:\r\n if i==g[k]:\r\n k+=1\r\n if k==5:\r\n break \r\n #print(k) \r\n if k==5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") ", "s = input()\r\nt = \"\"\r\nfor i in range(len(s)):\r\n if (s[i] == \"h\") and (t == \"\"):\r\n t += \"h\"\r\n elif (s[i] == \"e\") and (t == \"h\"):\r\n t += \"e\"\r\n elif (s[i] == \"l\") and (t == \"he\"):\r\n t += \"l\"\r\n elif (s[i] == \"l\") and (t == \"hel\"):\r\n t += \"l\"\r\n elif (s[i] == \"o\") and (t == \"hell\"):\r\n t += \"o\"\r\n\r\nif t == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nif 'h' in s:\r\n h=s.index('h')\r\n s=s[h+1:]\r\n if 'e' in s:\r\n e=s.index('e')\r\n s=s[e+1:]\r\n if 'l' in s:\r\n l=s.index('l')\r\n s=s[l+1:]\r\n if 'l' in s:\r\n l=s.index('l')\r\n s=s[l+1:]\r\n if 'o' in s:\r\n print(\"YES\")\r\n else: print(\"NO\")\r\n else: print(\"NO\")\r\n else: print(\"NO\")\r\n else: print(\"NO\")\r\nelse: print(\"NO\")", "s = str(input())\r\nans =-1\r\nx=0\r\nfor i in range(len(s)):\r\n if s[i]==\"h\":\r\n x+=1\r\n ans = i\r\n break\r\n\r\n\r\nfor i in range(len(s)):\r\n if s[i]==\"e\" and i > ans:\r\n ans = i\r\n x+=1\r\n break\r\n\r\nfor i in range(len(s)):\r\n if s[i]==\"l\" and i > ans:\r\n ans = i\r\n x+=1\r\n break\r\n\r\nfor i in range(len(s)):\r\n if s[i]==\"l\" and i > ans:\r\n ans = i\r\n x+=1\r\n break\r\n\r\nfor i in range(len(s)):\r\n if s[i]==\"o\" and i > ans:\r\n ans = i\r\n x+=1\r\n break\r\n \r\nif x>=5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n ", "s=input()\r\nnh=s.find('h')\r\nif nh!=-1: \r\n ne=s.find('e',nh+1)\r\n if ne!=-1:\r\n nl1=s.find('l',ne+1)\r\n if nl1!=-1:\r\n nl2=s.find('l',nl1+1)\r\n if nl2!=-1:\r\n no=s.find('o',nl2+1)\r\n if no!=-1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "s = input()\r\n#arr = [int(x) for x in input().split()]\r\nj = 0\r\nfor i in 'hello':\r\n a = s.find(i,j)\r\n j = a+1\r\n if a == -1:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "d = input()\r\na = 'hello'\r\nb = []\r\n \r\nc = 0\r\nfor w in d:\r\n if c == len(a):\r\n break\r\n if w == a[c]:\r\n b.append(w)\r\n c = c + 1\r\n else:\r\n c = c + 0\r\n \r\nlist = list(a)\r\nif list == b:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\ns = s.lower()\r\nb = 0\r\nfor i in s:\r\n if i=='h':\r\n if b==0:\r\n b=1\r\n if i=='e':\r\n if b==1 or b==2:\r\n b=2\r\n if i=='l':\r\n if b==2:\r\n b=3\r\n elif b==3:\r\n b=4\r\n elif b==4:\r\n b=4\r\n if i=='o':\r\n if b==4:\r\n b=6\r\n print('YES')\r\n break\r\nif b!=6:\r\n print('NO')", "st= input()\nword= 'hello'\nj=0\nfor i in range(len(st)):\n\tif(st[i]==word[j]):\n\t\tj+=1\n\t\tif(j==5):\n\t\t\tprint('YES')\n\t\t\tbreak\nif(j<5):\n\tprint('NO')", "string = str(input())\r\ntext = 'hello'\r\npointer = 0\r\nfor j in range(len(string)):\r\n if string[j] == text[pointer]:\r\n pointer += 1\r\n if pointer == len(text):\r\n break\r\nif pointer == len(text):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nhello = list(\"hello\")\r\nfor i in s:\r\n if hello[0] == i:\r\n hello.pop(0)\r\n if not hello:\r\n print(\"YES\")\r\n break\r\nif hello:\r\n print(\"NO\")\r\n", "s = input()\r\nstring, flag = \"hello\", 0\r\nfor i in s: \r\n if i == string[flag]: flag += 1\r\n if flag == 5: break\r\nprint(\"YES\" if flag == 5 else \"NO\")\r\n ", "import re\n\ns = input()\nprint('YES' if re.search(r'h.*e.*l.*l.*o', s) else 'NO')\n\n\t\t \t\t\t\t \t\t \t \t\t \t\t\t\t\t \t\t \t\t\t\t", "n=(input())\r\nl=len(n)\r\ni=n.find('h')\r\nj=n[i+1:].find('e')\r\nj+=i+1\r\nk=n[j+1:].find('l')\r\nk+=j+1\r\nm=n[k+1:].find('l')\r\nm+=k+1\r\ns=n[m+1:].find('o')\r\ns+=m+1\r\nif(i<j and j<k and k<m and m<s and i>-1 and j>-1 and k>-1 and m>-1 and s>-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n \r\n \r\n ", "d=input()\r\ni=0\r\nj=0 \r\ns=\"hello\"\r\nwhile i<len(s) and j<len(d):\r\n if s[i]==d[j]:\r\n i+=1\r\n j+=1\r\nif i==len(s):\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\") ", "s = input()\r\n\r\nn = len(s)\r\ncomp = \"hello\"\r\nk = 0\r\nsucc = False\r\nfor i in range(n):\r\n\tif (s[i] == comp[k]):\r\n\t\tif (comp[k] == 'o'):\r\n\t\t\tsucc = True\r\n\t\t\tbreak\r\n\t\tk += 1\r\nif succ:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "word = iter(\"hello\")\r\ns = str(input())\r\nx = []\r\nind = 0\r\ny = 0\r\nfor i in range(5):\r\n next_letter = next(word)\r\n ind = s.find(next_letter, ind + y, len(s))\r\n y = 1\r\n x.append(s[ind])\r\nif \"\".join(x) == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "string=input()\r\nstring1=string.lower()\r\nlist1=list(string1)\r\nlist2=[]\r\nl_count=0\r\nc=[]\r\nflag=False\r\nindex=0\r\nfor i in range(len(list1)):\r\n if list1[i]=='h':\r\n flag=True\r\n if flag==True:\r\n list2.append(list1[i])\r\nfor j in range(len(list2)):\r\n if list2[j]=='h' and ('h' not in c and index==0) :\r\n c.append(list2[j])\r\n index+=1\r\n\r\n\r\n elif list2[j]=='e' and ('e' not in c and index==1):\r\n c.append(list2[j])\r\n index+=1\r\n\r\n elif list2[j]=='l' and (('l' not in c or l_count==1) and(index==2 or index==3)) :\r\n c.append(list2[j])\r\n index+=1\r\n l_count+=1\r\n elif list2[j]=='o' and ('o' not in c and index==4):\r\n c.append(list2[j])\r\n index+=1\r\nst1=''.join(c)\r\nif st1=='hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\n\r\nconsider_string = 'hello'\r\nisReach = False\r\nindex = 0\r\nfor i, letter in enumerate(s):\r\n \r\n if letter == consider_string[index]:\r\n index += 1\r\n\r\n if index == len(consider_string):\r\n isReach = True\r\n break\r\n\r\n\r\nif isReach:\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\r\nn = input()\r\nif re.search(r\".*\".join(\"hello\"), n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\ns = input()\nl = ['h','e','l','l','o']\nif(re.search(\"h{1,}[a-z]*e{1,}[a-z]*l{1,}[a-z]*l{1,}[a-z]*o{1,}[a-z]*\",s)):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "mask = \"hello\"\r\npos = 0\r\nfor x in input():\r\n if mask[pos] == x:\r\n pos += 1\r\n if pos == 5:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "import re\r\n\r\na=input()\r\n\r\npattern=re.compile(r'.*h.*e.*l.*l.*o.*')\r\nb=re.search(pattern, a)\r\nif b!=None:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nhello=['h','e','l','l','o']\r\nfor car in hello:\r\n try:\r\n idx_car=s.index(car)\r\n except ValueError:\r\n print('NO')\r\n exit(0)\r\n s=s[idx_car+1:]\r\nprint('YES')", "word = input()\r\npatt = 'hello'\r\n\r\nlimit = len(word)\r\nsize = len(patt)\r\n\r\ni=j=0\r\nwhile i<size and j<limit:\r\n\twhile j<limit:\r\n\t\tif word[j]!=patt[i]:\r\n\t\t\tj+=1\r\n\t\telse:\r\n\t\t\tj+=1\r\n\t\t\ti+=1\r\n\t\t\tbreak\r\n\r\nprint('YES' if i==size else 'NO')\r\n", "s = input()\r\nH = s.find('h')\r\nE = s.find('e',H+1)\r\nL1 = s.find('l',E+1)\r\nL2 = s.find('l',L1 + 1)\r\nO = s.find('o',L2 + 1)\r\nif int((H+1)*(E+1)*(L1+1)*(L2+1)*(O+1)) != 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n#compiled by cry_QAQ 陈睿阳 物理学院", "s = input()\r\nstring = \"hello\"\r\ncur = 0\r\nfor i in s:\r\n if i == string[cur]:\r\n cur += 1\r\n if cur > 4:\r\n print(\"YES\")\r\n break\r\nif cur <= 4:\r\n print(\"NO\")", "\r\nIn = input()\r\nTestWords = list(In)\r\nWord = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\nTest = \"\"\r\ni = 0\r\nj = 0\r\nwhile j < len(Word) and i < len(TestWords):\r\n if TestWords[i] == Word[j] and i >= j:\r\n Test += TestWords[i]\r\n i += 1\r\n j += 1\r\n continue\r\n else:\r\n i += 1\r\nif Test == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nb=['h','e','l','l','o']\r\nb2=\"hello\"\r\nc=b[0] \r\nl=1\r\na=[]\r\nz2=\"\"\r\nfor i in range(1,len(s)+1):\r\n if(s[i-1]==c):\r\n a.append(c) \r\n if(l<=4):\r\n c=b[l]\r\n if(l<=3):\r\n l=l+1\r\n if(len(a)==5):\r\n break\r\nfor j in range(len(a)):\r\n z2+=\"\".join(str(a[j]))\r\nif(z2==b2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n", "s=input()\r\ncount=0\r\nfor a in range(len(s)):\r\n if s[a]==\"h\":\r\n for b in range(a+1,len(s)):\r\n if s[b]==\"e\":\r\n for c in range(b+1,len(s)):\r\n if s[c]==\"l\":\r\n for d in range(c+1,len(s)):\r\n if s[d]==\"l\":\r\n for e in range(d+1,len(s)):\r\n if s[e]==\"o\":\r\n count+=1\r\nif count>0:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "x = input().lower()\r\nl = ['h','e','l','l','o']\r\npos = 0\r\nfor a in x:\r\n if pos<5 and a==l[pos]:\r\n pos=pos+1\r\nif pos == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\t", "w= input().lower()\r\nimport re\r\nfor i in w :\r\n if i not in \"hello\" :\r\n w= w.replace(i,\"\")\r\nif re.search(\"h+\\S*e+\\S*l\\S*l+\\S*o+\\S*\",w):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def hello(s):\r\n hello = list(\"olleh\")\r\n\r\n for i in string:\r\n if len(hello) == 0:\r\n return True\r\n\r\n if i == hello[-1]:\r\n hello.pop()\r\n\r\n return len(hello) == 0 \r\n\r\nstring = input()\r\n\r\nprint(\"YES\" if hello(string) else \"NO\")\r\n\r\n", "s=input()\r\ns1=''\r\ncount=0\r\nhello='hello'\r\nif 'h' in s :\r\n s1,s2,s3=s.partition('h')\r\n count+=1\r\n #print(s3)\r\n if s3!=' ' :\r\n if 'e' in s3 :\r\n s1,s2,s3=s3.partition('e')\r\n count+=1\r\n # print(s3)\r\n if 'l' in s3 and s3 != ' ':\r\n s1,s2,s3=s3.partition('l')\r\n count+=1\r\n #print(s3)\r\n if 'l' in s3 and s3!=' ':\r\n s1,s2,s3=s3.partition('l')\r\n count+=1\r\n # print(s3)\r\n if 'o' in s3 and s3!= ' ':\r\n s1,s2,s3=s3.partition('o')\r\n count+=1\r\n # print(s3)\r\nif count == 5 :\r\n print('YES')\r\nelse :\r\n print('NO')\r\n\r\n", "s = input()\r\na = s.find('h')\r\nb = s.find('e', a)\r\nc = s.find('l', b)\r\nd = s.find('l', c + 1)\r\ne = s.find('o', d)\r\nif a < b < c < d < e and a != -1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import re\r\nprint(\"YES\") if re.search(\"h.*e.*l.*l.*o\",input()) else print(\"NO\")", "s = input()\r\n\r\nrequired_letters = \"hello\"\r\ncurrent_index = 0\r\n\r\nfor letter in s:\r\n if current_index < len(required_letters) and letter == required_letters[current_index]:\r\n current_index += 1\r\n\r\nif current_index == len(required_letters):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\na = \"hello\"\r\nj = 0\r\nfor i in s:\r\n if i == a[j]:\r\n j+=1\r\n if j == 5:\r\n break\r\nif j == 5: print(\"YES\")\r\nelse: print(\"NO\")", "inp = input()\nhello = 'hello'\ni = 0\nfor _ in inp:\n if i==5:\n break\n if _==hello[i]:\n i+=1\nif i==5:\n print('YES')\nelse:\n print('NO')", "s=input()\r\na=\"hello\"\r\nk=0\r\nflag=0\r\nfor i in s:\r\n # if(k>4):\r\n # flag=1\r\n # break\r\n if(i==a[k]):\r\n k=k+1\r\n if(k>4):\r\n \tflag=1\r\n \tbreak\r\nif(flag==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/python3\r\n\r\nword = input()\r\nnew_word = \"\"\r\nfor char in word:\r\n if char in \"hello\":\r\n new_word += char\r\n\r\n# print(new_word)\r\nhello = \"hello\"\r\ni = 0\r\nj = 0\r\nwhile i != len(hello) and j != len(new_word):\r\n if hello[i] == new_word[j]:\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\n\r\nif i == len(hello):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\n\r\ntyped = sys.stdin.read().strip()\r\n\r\nhelloIndex = 0\r\n\r\nfor letter in typed:\r\n if letter == \"hello\"[helloIndex]:\r\n helloIndex += 1\r\n if helloIndex == 5:\r\n break\r\n\r\nif helloIndex == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nif (len(s) < 1) or (len(s) > 100):\r\n print(\"Error_1\")\r\n\r\nsaved = 'hello'\r\nsvd_pntr = 0\r\ndon = False\r\n\r\nfor ch in s:\r\n if ch == saved.__getitem__(svd_pntr):\r\n svd_pntr+=1\r\n if svd_pntr == 5:\r\n svd_pntr = 0\r\n don = True\r\n\r\nif don == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "palabra = input()\r\n\r\ntarget = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\n\r\nresultado = \"\"\r\nposiciones = []\r\nfor clue in target:\r\n for count, letra in enumerate(palabra):\r\n if clue == letra:\r\n resultado+=letra\r\n posiciones.append(count)\r\n palabra = palabra[count+1:]\r\n break\r\n\r\nif resultado == \"hello\":\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")\r\n\r\n", "s = input()\r\nh = s.find('h')\r\ne = s[h + 1:].find('e') + h + 1\r\nl = s[e + 1:].find('l') + e + 1\r\nl2 = s[l + 1:].find('l') + l + 1\r\no = s[l2 + 1:].find('o') + l2 + 1\r\nif h < e < l < l2 < o:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "S=input()\r\nK1=S.find('h')\r\nS=S[K1+1:]\r\nK2=S.find('e')\r\nS=S[K2+1:]\r\nK3=S.find('l')\r\nS=S[K3+1:]\r\nK4=S.find('l')\r\nS=S[K4+1:]\r\nK5=S.find('o')\r\nif K1<0 or K2<0 or K3<0 or K4<0 or K5<0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "a = input()\r\n\r\nc = 0\r\nfor i in a:\r\n if i == 'h' and c == 0:\r\n c += 1\r\n elif i == 'e' and c == 1:\r\n c += 1\r\n elif i == 'l' and c == 2 or c == 3:\r\n c += 1\r\n elif i == 'o' and c == 4:\r\n c += 1\r\n\r\nif c == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "x=input()\r\nans=\"YES\"\r\nfor c in \"hello\" :\r\n p=x.find(c)\r\n if p==-1:\r\n ans=\"NO\"\r\n break\r\n else :\r\n x=x[p+1:]\r\nprint(ans) \r\n ", "import sys\r\n\r\nrd = sys.stdin.readline\r\n\r\ns = rd().strip()\r\n\r\nl = ['h', 'e', 'l', 'l', 'o']\r\n\r\nfor i in s:\r\n\r\n if len(l) == 0:\r\n print('YES')\r\n break\r\n\r\n if i == l[0]:\r\n\r\n del l[0]\r\n\r\nelse:\r\n if len(l) == 0:\r\n print(\"YES\")\r\n\r\n else:\r\n print(\"NO\")\r\n", "t=input()\r\nres=False\r\nl=['h','e','l','l','o']\r\ni=0\r\nfor s in t:\r\n if (s==l[i]):\r\n i=i+1\r\n if i==5:\r\n print(\"YES\")\r\n res=True\r\n break\r\nif res== False:\r\n print(\"NO\")", "#! -*- coding=utf-8 -*-\r\n# he ll ou\r\n\r\nhello = \"helo\"\r\n\r\nif __name__ == \"__main__\":\r\n N = input()\r\n new_n = \"\"\r\n \r\n for n in N:\r\n if n in hello:\r\n new_n += n\r\n \r\n \r\n targets = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\n count = 0\r\n for n in new_n:\r\n if n in targets:\r\n if n == \"h\" and count == 0:\r\n count += 1\r\n if n == \"e\" and count == 1:\r\n count += 1\r\n if n == \"l\" and (count == 2 or count == 3):\r\n count += 1\r\n if n == \"o\" and count == 4:\r\n count += 1\r\n \r\n if count >= 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "h = 'hello'\r\ns = input()\r\nx = 0\r\nflag=True\r\n\r\nfor i in range(len(s)):\r\n if s[i]==h[x]:\r\n x+=1\r\n if x==5:\r\n print(\"YES\")\r\n flag=False\r\n break\r\nif flag==True:\r\n print(\"NO\")\r\n\r\n\r\n", "s = input()\nh = 'hello'\n\nfor char in s:\n if not len(h):\n break\n if char == h[0]:\n h = h[1:]\nif not len(h):\n print('YES')\nelse:\n print('NO')\n", "s = input()\r\nn = len(s)\r\nmaxList = [0]*n\r\nmaxnum = 0\r\nstat = 0\r\nfor i in range(n):\r\n if (s[i]=='h' and maxnum==0) or (s[i]=='e' and maxnum==1) or (s[i]=='l' and maxnum==2) or (s[i]=='l' and maxnum==3) \\\r\n or (s[i]=='o' and maxnum==4):\r\n maxnum += 1\r\n maxList[i] = maxnum\r\n if maxnum==5:\r\n stat = 1\r\n print(\"YES\")\r\n break\r\n elif s[i] == 'h':\r\n maxList[i] = 1\r\n if maxnum == 0:\r\n maxnum = 1\r\n else:\r\n maxList[i] = 0\r\nif stat == 0:\r\n print(\"NO\")", "st = input()\r\ng = 0\r\nlis = ''\r\nstroc = 'hello'\r\ncount = len(st)\r\nfor i in range(count):\r\n if st[i] == stroc[g]:\r\n lis += st[i]\r\n g +=1\r\n if g > 4:\r\n break\r\nif stroc == lis:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = input()\r\n\r\nb = 0\r\nif n[0] == \"h\":\r\n b += 1\r\n\r\nl_flag = True\r\nfor a in range(1, len(n)):\r\n if n[a] == n[a-1] and l_flag:\r\n continue\r\n\r\n if n[a] == \"hello\"[b]:\r\n if b == 4: \r\n b += 1\r\n break\r\n b += 1\r\n if b == 3: l_flag = False\r\n else: l_flag = True\r\n continue\r\n\r\nif b == 5: \r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "s = input().lower()\r\nsi = 'hello'\r\nk = 0\r\nfor i in s:\r\n\tif k==5: break\r\n\tif i==si[k]: k = k + 1\r\nif k==5: print('YES')\r\nelse: print('NO')\r\n", "hell = list(input())\r\nhello = [False, False, False, False, False]\r\nfor letter in hell:\r\n if letter == 'h':\r\n hello[0] = True\r\n if letter == 'e':\r\n if hello[0] == True:\r\n hello[1] = True\r\n if letter == 'l':\r\n if hello[0] == True:\r\n if hello[1] == True:\r\n if hello[2] == True:\r\n hello[3] = True\r\n else:\r\n hello[2] = True\r\n if letter == 'o':\r\n if hello[0] == True:\r\n if hello[1] == True:\r\n if hello[2] == True:\r\n if hello[3] == True:\r\n hello[4] = True\r\n#print(hello)\r\nif hello == [True, True, True, True, True]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\na=\"hello\"\r\nc=0\r\nx=a[c]\r\nfor i in s:\r\n if i==x:\r\n c+=1\r\n \r\n if c==5:\r\n print(\"YES\")\r\n break;\r\n x=a[c]\r\nelse:\r\n print(\"NO\")\r\n ", "s= input()\r\nls=['h','e','l','l','o']\r\n#ls = [s[i:i+1] for i in range(len(s))]\r\n#se = list(dict.fromkeys(ls)) to make uniuqe values\r\n\r\nfor ch in s:\r\n if len(ls)==0:\r\n break\r\n \r\n elif ch==ls[0]:\r\n del ls[0]\r\n\r\nif len(ls)==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "s = input()\r\nb1 = s.find('h')\r\nb2 = s.find('e',b1+1)\r\nb3 = s.find('l',b2+1)\r\nb4 = s.find('l',b3+1)\r\nb5 = s.find('o',b4+1)\r\nif b1>=0 and b2>0 and b3>0 and b4>0 and b5>0:\r\n print('YES')\r\nelse:\r\n print('NO')", "from sys import stdin\r\ninput=lambda:stdin.readline().strip()\r\ns=input()\r\na='hello'\r\nj=0\r\nfor i in s:\r\n if j==5:\r\n break\r\n if i==a[j]:\r\n j+=1\r\nif j==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "def solve():\r\n st = input()\r\n targets = tuple(\"hello\")\r\n cur = 0\r\n points = 0\r\n \r\n \r\n for s in st:\r\n if s == targets[cur]:\r\n if cur+1 < 5:\r\n cur += 1\r\n points += 1\r\n \r\n return \"YES\" if points > 4 else \"NO\"\r\n \r\n \r\nprint(solve())", "mystring = input()\r\nmylist = []\r\nword = \"hello\"\r\n\r\nfor letter in mystring:\r\n if letter.lower() == word[len(mylist)]:\r\n mylist.append(letter)\r\n if len(word) == len(mylist):\r\n break\r\n\r\n\r\nif \"\".join(mylist) == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "string = input()\r\n\r\nhello = \"hello\"\r\nj = 0\r\nlength = len(string)\r\n\r\nfor i in range(length):\r\n \r\n if string[i] == hello[j]:\r\n \r\n j += 1\r\n \r\n if j == 5:\r\n \r\n break\r\n\r\nif j == 5:\r\n \r\n print(\"YES\")\r\n \r\nelse:\r\n \r\n print(\"NO\")\r\n", "a=input().lower()\r\nt=\"hello\"\r\nindex=0\r\nfor i in a:\r\n if i ==t[index]:\r\n index+=1\r\n if index==5:\r\n break\r\nif index==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=iter(input())\r\nprint('NYOE S'[all(a in s for a in 'hello')::2])", "s=input()\r\nans=[]\r\narr=['o','l','l','e','h']\r\nval=arr[len(arr)-1]\r\nfor i in s:\r\n if i == val:\r\n arr.pop()\r\n if len(arr)==0:\r\n print('YES')\r\n break\r\n val = arr[len(arr)-1]\r\n else:\r\n continue\r\nif len(arr) !=0:\r\n print('NO')", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[31]:\n\n\nlits=list()\nst=input()\ntem1,tem2,tem3,tem4,tem5=0,0,0,0,0\nfor i in range(0,len(st)):\n if st[i]=='h':\n tem1=i\n break\n else:\n tem1=len(st)\nfor j in range(tem1,len(st)):\n if st[j]=='e':\n tem2=j\n break\n else:\n tem2=len(st)\nfor k in range(tem2,len(st)):\n if st[k]=='l':\n tem3=k\n break\n else:\n tem3=len(st)\nfor l in range(tem3+1,len(st)):\n if st[l]=='l':\n tem4=l\n break\n else:\n tem4=len(st)\nfor m in range(tem4,len(st)):\n if st[m]=='o':\n tem5=m\n break\n else:\n tem5=0\nif tem1<tem2 and tem2<tem3 and tem3<tem4 and tem4<tem5:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n\n\n# In[ ]:\n\n\n\n\n", "word = str(input())\r\na=0\r\nb=0\r\nc=0\r\nd=0\r\ncount=[a,b,c,d]\r\nfor i in range(len(word)):\r\n\tif word[i]== \"h\":\r\n\t\ta+=1\r\n\tif word[i]== \"e\" and a!=0:\r\n\t\tb+=1\r\n\tif word[i]== \"l\" and a!=0 and b!=0:\r\n\t\tc+=1\r\n\tif word[i]== \"o\" and a!=0 and b!=0 and c>=2:\r\n\t\td+=1\r\nif a!=0 and b!=0 and c>=2 and d!=0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "s=input()\r\na=['h','e','l','l','o']\r\nc=0\r\ncount=0\r\nfor i in range (len(a)):\r\n for j in range (c,len(s)):\r\n if a[i]==s[j]:\r\n c=j+1\r\n count+=1\r\n break\r\nif count==5:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")\r\n ", "s = input()\r\nword = ''\r\n\r\nfor letter in s:\r\n if len(word) == 0 and letter == 'h':\r\n word += 'h'\r\n elif len(word) == 1 and letter == 'e':\r\n word += 'e'\r\n elif (len(word) == 2 or len(word) == 3) and letter == 'l':\r\n word += 'l'\r\n elif len(word) == 4 and letter == 'o':\r\n word += 'o'\r\n\r\nif word == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "word = input()\r\nqueue = ['h', 'e', 'l', 'l', 'o']\r\nthe_word = \"\"\r\nfor letter in word:\r\n if queue:\r\n if letter == queue[0]:\r\n the_word += letter\r\n queue.pop(0) \r\n\r\nif the_word == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input().strip()\r\nres = 'hello'\r\ni, j = 0, 0\r\nwhile j < len(s):\r\n if s[j] == res[i]:\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\n if i == 5:\r\n break\r\n\r\nprint('YES' if i == 5 else 'NO')\r\n", "\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\n\r\n#for _ in range(int(input())):\r\n\r\ns=input()\r\n\r\nflag=False\r\n\r\nif 'h' in s and 'e' in s and 'l' in s and 'o' in s and s.count('l')>=2:\r\n flag = True\r\n\r\nif not flag:\r\n print(\"NO\")\r\nelse:\r\n s1=''\r\n ind = 0\r\n for j in ['h','e','l','l','o']:\r\n for i in range(ind,len(s),1):\r\n if s[i]==j:\r\n s1+=j\r\n ind=i+1\r\n break\r\n \r\n if s1=='hello':\r\n print(\"YES\")\r\n \r\n else:\r\n print(\"NO\")\r\n\r\n#carpe diem \r\n\r\n", "a='hello'\r\nb=input()\r\nc=0\r\nfor i in b:\r\n if i==a[c]:\r\n c=c+1\r\n if c==5:\r\n print('YES')\r\n break\r\nif c!=5:\r\n print('NO')", "def test(x):\r\n query=\"hello.\"\r\n i=0\r\n j=0\r\n while(i<len(x) and j<len(query)):\r\n if x[i]==query[j]:\r\n j+=1\r\n if query[j]==\".\":\r\n return \"YES\"\r\n i+=1\r\n return \"NO\"\r\nx=input()\r\nprint(test(x))", "s=input()\r\nt=\"hello\"\r\nj=0\r\nk=0\r\nfor i in range(len(s)):\r\n if(s[i]==t[j]):\r\n j+=1\r\n k+=1\r\n if(k==5):\r\n break\r\nif(k==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nx=input()\r\na=False\r\nfor i in range(len(x)):\r\n if x[i]=='h':\r\n for j in range(i+1,len(x)):\r\n if x[j]==\"e\":\r\n for k in range(j+1,len(x)):\r\n if x[k]==\"l\":\r\n for l in range(k+1,len(x)):\r\n if x[l]==\"l\":\r\n for m in range(l+1,len(x)):\r\n if x[m]==\"o\":\r\n a=True\r\nif a==True:\r\n print('YES')\r\nelse:\r\n print('NO') \r\n \r\n ", "s=input()\r\nl=len(s)\r\na=\"hello\"\r\nj=0\r\nflag=0\r\nfor i in range(0,l):\r\n if(s[i]==a[j]):\r\n flag=flag+1\r\n if(flag<5):\r\n j=j+1\r\n elif(flag==5):\r\n break\r\nif(flag==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# this is the function use to solve \ndef solve(s):\n word = \"hello\"\n index = 0\n for i in range(0, len(s)):\n if index==5:\n return \"YES\"\n if s[i] == word[index]:\n index+=1\n \n \n if index<5:\n return \"NO\"\n else:\n return \"YES\"\n# this is the main function \nif __name__ == \"__main__\":\n s = input()\n print(solve(s))", "message = list(input().lower())\r\naim_string = ['h', 'e', 'l', 'l', 'o']\r\nres_string = []\r\n\r\nrun = True\r\ni, j = 0, 0\r\n\r\nfor i in range(len(message)):\r\n if message[i] == aim_string[j]:\r\n res_string.append(message[i])\r\n j += 1\r\n if j == 5:\r\n break\r\n\r\nif ''.join(res_string) == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def sol(str):\r\n index = 0\r\n word = \"hello\"\r\n for i in range(0,len(str)):\r\n if index == 5:\r\n return \"YES\"\r\n if str[i] == word[index]:\r\n index += 1\r\n if index < 5:\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\n\r\nprint(sol(input()))", "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\n######################## TEMPLATE ENDS HERE ########################\n\ns = input()\nkey = list(\"hello\")\nh = False\ne = False\nl = False\nl2 = False\nstate = False\n\nans = \"\"\n\nfor i in range(len(s)):\n for j in key:\n if s[i] == j:\n ans += s[i]\n\nfor i in s:\n if h == False and i == \"h\":\n h = True\n elif h == True and e == False and i == \"e\":\n e = True\n elif h == True and e == True and l == False and i == \"l\":\n l = True\n elif h == True and e == True and l == True and l2 == False and i == \"l\":\n l2 = True\n elif h == True and e == True and l == True and l2 == True and i == \"o\":\n state = True\n\nif state == True:\n print(\"YES\")\nelse:\n print(\"NO\")", "string = input()\r\ndef helper(ind, inputString, pattern):\r\n if len(pattern) == 0:\r\n return True\r\n if ind == len(inputString):\r\n return False\r\n if inputString[ind] == pattern[0]:\r\n pattern = pattern[1:]\r\n return helper(ind+1, inputString, pattern)\r\n else:\r\n return helper(ind+1, inputString, pattern)\r\nif helper(0, string, \"hello\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t, s = 'hello', input() + ' '\r\nfor x in t:\r\n if x not in s:\r\n print('NO')\r\n break\r\n else:\r\n s = s[s.index(x) + 1:]\r\nelse: print('YES')", "temp = input()\r\nn1 = temp.find('h')\r\nn2 = temp.find('e', n1+1)\r\nn3 = temp.find('l', n2+1)\r\nn4 = temp.find('l', n3+1)\r\nn5 = temp.find('o', n4+1)\r\nif n1 < n2 < n3 < n4 < n5:\r\n print('YES')\r\nelse:\r\n print('NO')", "w=input()\r\nh=\"hello\"\r\nj=0\r\nfor i in range(len(w)):\r\n if(j<5):\r\n if(h[j]==w[i]):\r\n j=j+1\r\nif(j==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache\r\nfrom math import floor, ceil, sqrt, gcd\r\nfrom string import ascii_lowercase\r\nfrom math import gcd\r\nfrom bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef read():\r\n return input().strip()\r\n\r\n\r\ndef read_int():\r\n return int(read())\r\n\r\n\r\ndef read_str_list():\r\n return read().split()\r\n\r\n\r\ndef read_numeric_list():\r\n return list(map(int, read_str_list()))\r\n\r\n\r\ndef solve(s):\r\n act = \"hello\"\r\n i = 0\r\n for ch in s:\r\n if ch == act[i]:\r\n i += 1\r\n\r\n if i >= len(act):\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\n\r\ns = read()\r\nprint(solve(s))\r\n", "x = input()\r\nhello = 'hello'\r\n\r\nj = 0\r\n\r\nfor i in x:\r\n yes = False\r\n if i == hello[j]:\r\n j += 1\r\n if j == 5:\r\n yes = True\r\n break\r\n\r\nif yes:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a=input()\r\ns=\"hello\"\r\nc=0\r\nfor i in range (0,len(a)):\r\n if c==len(s):\r\n break\r\n if s[c]==a[i]:\r\n c=c+1\r\nif c==len(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nhello = \"hello\"\r\ni=0\r\nj=0\r\nwhile j <=4 and i < len(s):\r\n if s[i] == hello[j]:\r\n j += 1\r\n i += 1\r\nif j == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nl=['h','e','l','l','o']\r\nj=0\r\nfor i in n:\r\n if(i==l[j]):\r\n j=j+1\r\n if(j>4):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "st = input()\r\ns = \"hello\"\r\nj, count = 0 , 0 \r\n\r\nfor i in range(len(st)):\r\n if s[j] == st[i]:\r\n j += 1\r\n if j == 5:\r\n break\r\n \r\nprint(\"NO\" if j != 5 else \"YES\")", "stringg = input()\nhello = \"hello\"\nstringg = stringg.lower()\nfor i in range(len(stringg)):\n if stringg[i] == hello[0]:\n hello = hello[1:]\n if len(hello) == 0:\n break\n\nif len(hello) == 0:\n print(\"YES\")\nelse:\n print(\"NO\")", "s = input()\nx = 'hello'\nfor i in s:\n if len(x) == 0:\n break\n if i == x[0]:\n x = x[1:]\nif len(x) == 0:\n print('YES')\nelse:\n print('NO')\n", "import itertools\r\ndef chat_room(t):\r\n ans = 'NO'\r\n s = list(filter(lambda a: a in 'hello', t))\r\n for c in itertools.combinations(s, 5):\r\n if ''.join(c) == 'hello':\r\n ans = 'YES'\r\n break\r\n return ans\r\n# --------------------------------------------------------------\r\nif __name__ == '__main__':\r\n print(chat_room(input()))", "s = input()\r\nc = 'h'\r\nfor cc in s:\r\n if c == 'h' and cc == 'h':\r\n c = 'e'\r\n elif c == 'e' and cc == 'e':\r\n c = 'l1'\r\n elif c == 'l1' and cc == 'l':\r\n c = 'l2'\r\n elif c == 'l2' and cc == 'l':\r\n c = 'o'\r\n elif c == 'o' and cc == 'o':\r\n c = '.'\r\nprint(\"YES\" if c == '.' else \"NO\")", "s= input()\r\nw = \"hello\"\r\ni = j = 0\r\nwhile i < len(w) and j < len(s):\r\n if w[i]==s[j]:\r\n i += 1\r\n j+=1\r\nprint(\"YES\" if len(w)==i else \"NO\")", "def hello(s):\r\n h = \"hello\"\r\n i = 0\r\n j = 0\r\n while i < len(s):\r\n if s[i] == h[j]:\r\n j += 1\r\n i += 1\r\n if j == len(h):\r\n return True\r\n\r\n return False\r\n\r\n\r\nprint(\"YES\" if hello(input()) else \"NO\")\r\n", "s = input()\r\nnew = []\r\nfor i in range(len(s)):\r\n if len(new) == 0 and s[i] == 'h':\r\n new.append(s[i])\r\n else:\r\n if len(new) == 1 and s[i] == 'e':\r\n new.append(s[i])\r\n elif len(new) == 2 and s[i] == 'l':\r\n new.append(s[i])\r\n elif s[i] == 'l' and new.count('l') == 1:\r\n new.append(s[i])\r\n elif len(new) == 4 and s[i] == 'o':\r\n new.append(s[i])\r\n\r\nif ''.join(new) == 'hello':\r\n print(\"YES\")\r\nelse:\r\n print('NO')\r\n", "## prendo tale che la somma dei valori delle mie monete sia > di quelle rimanenti \r\n##prendo però il numero minimo di monete\r\nimport math\r\nfrom re import * \r\nn = input()\r\n#a = list(map(int, input().split()))\r\n\r\nprint(\"YES\") if search('h.*e.*l.*l.*o.*',n) else print(\"NO\")", "word = input()\r\n\r\nwhile word != \"hello\" and len(word) > 5:\r\n if word[0] != 'h':\r\n word = word[1:]\r\n elif word[1] != 'e':\r\n word = word[0] + word[2:]\r\n elif word[2] != 'l':\r\n word = word[:2] + word[3:]\r\n elif word[3] != 'l':\r\n word = word[:3] + word[4:]\r\n elif word[4] != 'o':\r\n word = word[:4] + word[5:]\r\n elif word[5] != '':\r\n word = word[:5] + ''\r\n\r\n\r\nif word == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n\r\n", "a = list(input())\r\nm = \"hello\"\r\nx = 0\r\ncount = 0\r\nfor i in range(len(a)):\r\n\tif a[i] == m[x]:\r\n\t\tx += 1\r\n\t\tcount += 1\r\n\tif count == 5:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\nprint(\"NO\")\r\n\t\t\r\n\t\r\n", "s = input()\r\ni = 0\r\nfor c in s:\r\n if i == 5:\r\n break\r\n if c == \"hello\"[i:i + 1]:\r\n i += 1\r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\n\r\na=list(a)\r\n\r\n\r\nk=0\r\nfor x in a:\r\n if k==0 and x==\"h\":\r\n k=k+1\r\n \r\n elif k==1 and x==\"e\":\r\n k=k+1\r\n \r\n elif k==2 and x==\"l\":\r\n k=k+1\r\n \r\n elif k==3 and x==\"l\":\r\n k=k+1\r\n \r\n elif k==4 and x==\"o\":\r\n k=k+1\r\n \r\n \r\n\r\nif k==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "i = 0\r\nfor j in input() : \r\n if j == \"hello\"[i]: \r\n i+=1\r\n if i == 5:\r\n break\r\nprint([\"NO\",\"YES\"][i==5])", "k = 0\r\nstr1 = 'hello'\r\nstr2 = input()\r\nfor i in range(len(str2)):\r\n if (str2[i] == str1[k] and k < 5):\r\n k = k + 1\r\n if (k == 5):\r\n print('YES')\r\n break\r\nif (k < 5):\r\n print('NO')\r\n", "s = input()\r\n\r\ndef LCS(s):\r\n word = 'hello'\r\n m = len(s)\r\n n = len(word)\r\n\r\n t = [[0]*(m+1) for i in range(n+1)]\r\n\r\n for i in range(1, n+1):\r\n for j in range(1, m+1):\r\n if word[i-1] == s[j-1]:\r\n t[i][j] = 1+t[i-1][j-1]\r\n else:\r\n t[i][j] = max(t[i-1][j], t[i][j-1])\r\n if t[n][m] == len(word):\r\n return 'YES'\r\n return 'NO'\r\n\r\nprint(LCS(s))", "phrase = \"hello\"\n\ns = input()\nplace = 0\nfor x in s:\n\tif x == phrase[place]:\n\t\tplace +=1\n\t\tif place == len(phrase):\n\t\t\tbreak\n\nif place == len(phrase):\n\tprint(\"YES\")\nelse:\n\tprint (\"NO\")\n", "s1=input()\r\nj=0\r\nflag=True\r\nfor sub in 'hello':\r\n while j<len(s1) and sub!=s1[j]:\r\n j=j+1\r\n \r\n if j==len(s1):\r\n flag=False\r\n break\r\n j=j+1\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\nl=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nm=l[0]\r\nj=0\r\nans=\"\"\r\nwhile j<len(n) and l:\r\n if m==n[j]:\r\n ans=ans+m\r\n l.remove(m)\r\n if l:\r\n m=l[0]\r\n \r\n j+=1\r\n\r\nif ans==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "import re\r\ns=input()\r\nmob=re.match(r'.*h+.*e+.*l+.*l+.*o+.*',s,re.I)\r\nif mob:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n \r\n", "a = input()\r\nb=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nz=[]\r\nx=0\r\nfor i in a:\r\n\tif i ==b[x]:\r\n\t\tz.append(b[x])\r\n\t\tx+=1\r\n\tif x == 5:break\r\nif b == z:print(\"YES\")\r\nelse:print(\"NO\")\r\n", "str_1 = input()\r\nstr_2 = 'hello'\r\nflag = 0\r\nlen_1 = len(str_1)\r\nfor i in range(len_1):\r\n if (flag < 5 and str_1[i] == str_2[flag]):\r\n flag = flag + 1\r\nif (flag >= 5):\r\n print('YES')\r\nelse:\r\n print('NO')", "word = list(input())\r\nhello = ['h', 'e', 'l', 'l', 'o']\r\n\r\nfor i in range(len(word)):\r\n if len(hello) == 0:\r\n print(\"YES\")\r\n exit(0)\r\n if word[i] == hello[0]:\r\n hello.remove(hello[0])\r\n \r\n \r\nif len(hello) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input();\r\na=[];\r\nfor letter in s:\r\n a.append(letter);\r\ntry: \r\n h=a.index('h');\r\n e=a.index('e',h)\r\n l1=a.index('l',e)\r\n l2=a.index('l',l1+1)\r\n o=a.index('o',l2)\r\n print('YES')\r\nexcept:\r\n print('NO')", "z = \"hello\"\r\ny = input()\r\nflag = \"NO\"\r\nfor i in y:\r\n\tif i == z[0]:\r\n\t\tz = z.replace(i, \"\", 1)\r\n\t\tif z == \"\":\r\n\t\t\tflag = \"YES\"\r\n\t\t\tbreak\r\nprint(flag)", "message = input()\r\nhello = \"hello\"\r\nfound = False\r\nn = 0\r\nfor i in range(len(message)):\r\n if(message[i]==hello[n]):\r\n n+=1\r\n if(n==len(hello)):\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "k=0\r\ns=list(input())\r\nhe=['h','e','l','l','o']\r\ni=0\r\nj=0\r\nwhile(j<(len(s))):\r\n if(s[j]==he[i]):\r\n i+=1\r\n j+=1\r\n k+=1\r\n if(k==5):\r\n break \r\n else:\r\n j+=1\r\nif(k==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "l=input()\r\ni=0\r\ns=''\r\nans=0\r\nwhile i < len(l):\r\n if s=='' and l[i]=='h':\r\n s+='h'\r\n elif s=='h' and l[i]=='e':\r\n s+='e'\r\n elif s=='he' and l[i]=='l':\r\n s+='l'\r\n elif s=='hel' and l[i]=='l':\r\n s+='l'\r\n elif s=='hell' and l[i]=='o':\r\n s+='o'\r\n if s=='hello':\r\n ans=1\r\n break\r\n i+=1\r\nif ans==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=str(input())\r\na=\"hello\"\r\nc=0\r\nfor _ in range(5):\r\n if a[_] in s:\r\n c+=1\r\n s=s[s.index(a[_])+1:]\r\n else:\r\n break\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ncnt = 0\r\nstd = 'hello'\r\nfor i in s:\r\n if cnt >= 5:\r\n break\r\n if i == std[cnt]:\r\n cnt += 1\r\nif cnt == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=input()\r\ny=\"hello\"\r\ncontar=0\r\nj=0\r\nn=len(x)\t\r\nfor i in range(n):\r\n\tif (x[i]==y[j]):\r\n\t\tcontar=contar+1\r\n\t\tj=j+1\r\n\r\n\t\tif (contar==5):\r\n\t\t\tbreak\r\n\r\nif (contar==5):\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "# ------------------- fast io --------------------\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\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# ------------------- fast io --------------------\r\nfrom math import *\r\nfrom itertools import * # chain,groupby,permutations,combinations\r\nfrom collections import Counter\r\n\r\n\"\"\"\r\ndef prod(a, mod=10**9+7):\r\n ans = 1\r\n for each in a:\r\n ans = (ans * each) % mod\r\n return ans\r\n\r\ndef lcm(a, b): return a * b // gcd(a, b)\r\n\r\ndef binary(x, length=16):\r\n y = bin(x)[2:]\r\n return y if len(y) >= length else \"0\" * (length - len(y)) + y\r\n\r\n\r\ndef powerset(s):\r\n n=len(s)\r\n \r\n return chain.from_iterable(combinations(s,r) for r in range(1,n))\r\n\r\ndef binarySearch(arr,x): \r\n l=0\r\n r=len(arr)-1\r\n while l <= r: \r\n \r\n mid = l + (r - l) // 2; \r\n if arr[mid] == x: \r\n return mid \r\n elif arr[mid] < x: \r\n l = mid + 1\r\n else: \r\n r = mid - 1\r\n return -1\r\n\r\n\"\"\"\r\n\r\n#----#\r\n\r\ndef lcm(a, b): return a * b // gcd(a, b)\r\n\r\ndef aa(): #for int\r\n return(int(input()))\r\ndef bb(): #for int arr\r\n return(list(map(int,input().split())))\r\ndef cc(): #for string\r\n s = input()\r\n return (list(s))\r\ndef dd(): #space seperated intege\r\n return(map(int,input().split()))\r\n#----#\r\n\r\n\r\n\r\n\r\ndef solve():\r\n s=cc()\r\n check = \"hello\"\r\n i=0\r\n j=0\r\n while i<len(s) and j<5:\r\n if s[i]==check[j]:\r\n i+=1\r\n j+=1\r\n else:\r\n i+=1\r\n\r\n if j==5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\nt=1#aa()\r\nwhile(t):\r\n solve()\r\n t-=1\r\n\r\n", "#initializes input word, target word, and tick for the target word's letters\r\ns = input()\r\nword = ['h', 'e', 'l', 'l', 'o']\r\nmessage = []\r\ntick = 0\r\n\r\n#checks each letter in input if it matches the current letter of 'hello' if yes, goes to next letter\r\n#if the full word is already given (represented by tick = 5), moves to printing result\r\nfor letter in s:\r\n if tick == 5:\r\n continue\r\n elif letter == word[tick]:\r\n message.append(letter)\r\n tick += 1\r\n\r\n#prints result based on if the message input contains 'hello'\r\nif message == word:\r\n print('YES')\r\nelse:\r\n print('NO')", "# coding=utf-8\r\na = input()\r\nif a.find('h') != -1:\r\n h = a.find('h')\r\n a = a[h+1:]\r\n if a.find('e') != -1:\r\n h = a.find('e')\r\n a = a[h+1:]\r\n if a.find('l') != -1:\r\n h = a.find('l')\r\n a = a[h+1:]\r\n if a.find('l') != -1:\r\n h = a.find('l')\r\n a = a[h+1:]\r\n if a.find('o') != -1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n\r\n \t\t \t\t \t \t\t\t\t \t\t\t\t\t\t\t\t \t", "from math import *\r\nfrom collections import *\r\nimport queue\r\ns = input()\r\nn = len(s)\r\nch = \"hello\"\r\nind = 0\r\nfor i in range(n):\r\n if(ind < 5 and s[i] == ch[ind]):\r\n ind += 1\r\nif(ind == 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Read the input word\r\ns = input()\r\n\r\n# The word \"hello\" that we want to match\r\ntarget = \"hello\"\r\n\r\n# Initialize variables for matching\r\nindex = 0\r\nfor char in s:\r\n if char == target[index]:\r\n index += 1\r\n \r\n # If we have matched all characters in \"hello\", print \"YES\" and exit\r\n if index == len(target):\r\n print(\"YES\")\r\n break\r\n\r\n# If we haven't matched all characters in \"hello\", print \"NO\"\r\nif index < len(target):\r\n print(\"NO\")\r\n", "s = input()\r\nhello = \"hello\"\r\ni = 0\r\n\r\nfor letter in s:\r\n if letter == hello[i]:\r\n i += 1\r\n if i == 5: # We found all letters of \"hello\"\r\n break\r\n\r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\ntryb = 0 \r\n\r\nfor i in s:\r\n if tryb == 0 and i == 'h':\r\n tryb += 1\r\n elif tryb == 1 and i == 'e':\r\n tryb += 1\r\n elif tryb == 2 and i == 'l':\r\n tryb += 1\r\n elif tryb == 3 and i == 'l':\r\n tryb += 1\r\n elif tryb == 4 and i == 'o':\r\n tryb += 1\r\n \r\nif tryb == 5:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')\r\n\r\n\r\n \r\n", "s = input()\r\nans = 'NO'\r\nh = False\r\ne = False\r\nl1 = False\r\nl2 = False\r\nfor i in range(len(s)):\r\n if s[i] == 'h':\r\n h = True\r\n elif s[i] == 'e' and h == True:\r\n e = True\r\n h = False\r\n elif s[i] == 'l' and e == True:\r\n l1 = True\r\n e = False\r\n elif s[i] == 'l' and l1 == True:\r\n l2 = True\r\n l1 = False\r\n elif s[i] == 'o' and l2 == True:\r\n ans = 'YES'\r\n \r\nprint(ans)\r\n", "s = input()\r\nw = 'hello'\r\nind = 0\r\nfor i in s:\r\n if i == w[ind]:\r\n ind += 1\r\n if ind == len(w):\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "import sys\r\ns = sys.stdin.readline().rstrip()\r\nalpha = ('h', 'e', 'l', 'l', 'o', 'END')\r\np = 0\r\nfor i in s:\r\n if i == alpha[p]:\r\n p += 1\r\nprint(\"YES\") if p == 5 else print(\"NO\")\r\n", "import re\r\n\r\nword = input()\r\npattern = r'.*h.*e.*l.*l.*o'\r\n\r\nif re.match(pattern, word):\r\n print('YES')\r\nelse:\r\n print('NO')", "t=input()\r\nb=\"hello\"\r\nj=0\r\nc=0\r\nfor i in range(len(t)):\r\n if t[i]==b[j]:\r\n j=j+1\r\n c=c+1\r\n if(c==5):\r\n break\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "s1 = \"hello\"\r\ns2 = input()\r\ncount=0\r\nfor i in s2:\r\n if(count<=4 and i==s1[count]):\r\n count+=1\r\nif(count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\r\ns='hello '\r\nc=0\r\nfor i in n:\r\n if i==s[c]:\r\n c+=1\r\nprint(\"YES\" if c==5 else 'NO')", "s=input()\r\nb='hello'\r\nc=0\r\nf=0\r\nfor i in range(len(s)):\r\n if(c<=4):\r\n if (s[i]==b[c]):\r\n c=c+1\r\n f=f+1\r\nif(f==5):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = str(input())\r\nword = \"hello\"\r\ncount, a = 0, 0\r\nn = len(s)\r\nfor i in range(n):\r\n if count != 5:\r\n if s[i] == word[a]:\r\n count += 1\r\n a += 1\r\n if count == 5:\r\n print(\"YES\")\r\n\r\n\r\nif count != 5:\r\n print(\"NO\")\r\n", "x = \"hello\"\r\ns = input()\r\nj = 0\r\nf = 0\r\ni = 0\r\nwhile i < len(s) and j < 5:\r\n if x[j] == s[i]:\r\n j += 1\r\n i += 1\r\n f += 1\r\n else:\r\n i += 1\r\nif f == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nsum=count=0\r\nfor i in a:\r\n sum=sum+1\r\nfor i in range(sum-4):\r\n if a[i]=='h':\r\n for j in range(i+1,sum-3):\r\n if a[j]==\"e\":\r\n for m in range(j+1,sum-2):\r\n if a[m]=='l':\r\n for n in range(m+1,sum-1):\r\n if a[n]==\"l\":\r\n for o in range(n+1,sum):\r\n if a[o]==\"o\":\r\n count=1\r\nif count==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\nst = list(input())\r\nli = ['h', 'e', 'l', 'l', 'o']\r\nfor i in st:\r\n if len(li) == 0:\r\n print('YES')\r\n break\r\n if i == li[0]:\r\n li.pop(0)\r\nelse:\r\n if len(li) == 0: print('YES')\r\n else: print('NO')", "a = list(input())\r\nn = 0\r\nh = \"hello\"\r\nfor i in range(len(a)):\r\n if a[i] == h[n]:\r\n n+=1\r\n if n==5:\r\n break\r\nprint(\"YES\"if n==5 else \"NO\")", "string=input()\r\nn=len(string)\r\nnewstring=[]\r\nx=0\r\nfor i in range(n):\r\n if string[i]=='h'and len(newstring)==0:\r\n newstring.append('h')\r\n if string[i]=='e'and len(newstring)==1:\r\n newstring.append('e')\r\n if string[i]=='l'and len(newstring)==2:\r\n newstring.append('l')\r\n x=i\r\n if string[i]=='l'and len(newstring)==3 and i!=x:\r\n newstring.append('l')\r\n if string[i]=='o'and len(newstring)==4:\r\n newstring.append('o')\r\n\r\nif newstring==['h','e','l','l','o']:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "m=input()\r\nc=\"hello\"\r\nj=0\r\nfor i in m:\r\n if i==c[j]:\r\n j=j+1 \r\n if(j==5):\r\n break\r\n \r\nif j==5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n ", "inp=input()\r\nj=0\r\nmsg=\"hello\"\r\nfor i in range(len(inp)):\r\n if inp[i] is msg[j]:\r\n j+=1\r\n if j is 5:\r\n print(\"YES\")\r\n break\r\nif j is not 5:\r\n print(\"NO\")", "def hello(s):\r\n x=0\r\n p=\"hello\"\r\n for i in range(len(s)):\r\n if s[i]==p[x]:\r\n x+=1\r\n if x==5:\r\n return \"YES\"\r\n return \"NO\" \r\ns=input()\r\nprint(hello(s))\r\n", "s=input()\r\nl=s.find('h')\r\ns=s[l+1:]\r\nif l==-1:\r\n print('NO')\r\nelse:\r\n l = s.find('e')\r\n s = s[l + 1:]\r\n if l == -1:\r\n print('NO')\r\n else:\r\n l = s.find('l')\r\n s = s[l + 1:]\r\n if l == -1:\r\n print('NO')\r\n else:\r\n l = s.find('l')\r\n s = s[l + 1:]\r\n if l == -1:\r\n print('NO')\r\n else:\r\n l = s.find('o')\r\n s = s[l + 1:]\r\n if l == -1:\r\n print('NO')\r\n else:\r\n print('YES')\r\n#print(' '.join([str(i) for i in s]))", "s1 = 'hello'\r\ns2 = input()\r\nx = 0\r\nfor c in s2:\r\n if c == s1[x]:\r\n x += 1\r\n if x == 5:\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jun 4 17:34:09 2021\r\n\r\n@author: Bruger\r\n\"\"\"\r\n\r\n\r\n\r\n\r\nS = input()\r\n\r\n\r\nanwser = \"NO\"\r\n\r\nit = iter(\"hello\")\r\n\r\nbog = next(it)\r\n\r\nfor i in S:\r\n if i == bog:\r\n try:\r\n bog = next(it)\r\n except Exception:\r\n anwser = \"YES\"\r\n break\r\n\r\nprint(anwser)\r\n\r\n\r\n", "s = input()\r\nw = \"hello\"\r\nf = \"\"\r\nj = 0\r\nfor i in s:\r\n if i == w[j]:\r\n f += i\r\n j += 1\r\n if j == 5:\r\n break\r\nif f == w:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "'''Chat Room Solution\r\n'''\r\n\r\nstring = input()\r\nhello = 'hello'\r\nln = len(string)\r\n\r\nindex = 0\r\nwhile len(hello) > 0 and index < ln:\r\n if string[index] == hello[0]:\r\n hello = hello[1:]\r\n index += 1\r\n if len(hello) == 0:\r\n break\r\n\r\nif len(hello) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "def chatroom(s):\r\n t=\"hello\"\r\n p=0\r\n for i in s:\r\n if i==t[p]:\r\n p+=1\r\n if p==len(t):\r\n return \"YES\"\r\n return \"NO\"\r\ns=input()\r\nprint(chatroom(s))\r\n \r\n ", "if __name__ == '__main__':\r\n line = input().strip('\\n\\r\\t ')\r\n l = ['h', 'e', 'l', 'l', 'o']\r\n i = 0\r\n for c in line:\r\n if c == l[i]:\r\n i += 1\r\n if i == len(l):\r\n break\r\n if i == len(l):\r\n print('YES')\r\n else:\r\n print('NO')\r\n ", "str = input()\r\nhindex = str.find('h')\r\neindex = str.find('e',hindex+1)\r\nl1index = str.find('l',eindex+1)\r\nl2index = str.find('l',l1index+1)\r\noindex = str.find('o',l2index+1)\r\nif hindex == -1 or eindex == -1 or l1index == -1 or l2index == -1 or oindex == -1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s=input()\r\nh='hello'\r\nj=s.find('h')\r\nif j==-1:\r\n print(\"NO\")\r\n exit()\r\nj=s.find('e',j)\r\nif j==-1:\r\n print(\"NO\")\r\n exit()\r\nj=s.find('l',j)\r\nif j==-1:\r\n print(\"NO\")\r\n exit()\r\nj=s.find('l',j+1)\r\nif j==-1:\r\n print(\"NO\")\r\n exit()\r\nj=s.find('o',j)\r\nif j==-1:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "\r\ndef answer(s):\r\n hello = ['h', 'e', 'l', 'l', 'o']\r\n ind = 0\r\n for e in s:\r\n active_letter = hello[ind]\r\n if e == active_letter:\r\n ind += 1\r\n if ind == 5:\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\ndef main():\r\n s = input()\r\n \r\n print(answer(s))\r\n\r\n\r\nmain()", "import re\r\nprint( \"YES\" if re.search( \"h.*e.*l.*l.*o\" , input( ) ) else \"NO\" )", "a = input()\r\nb = a.find('h')\r\na = a[b+1:]\r\nc = a.find('e')\r\na = a[c+1:]\r\nd = a.find('l')\r\na = a[d+1:]\r\ne = a.find('l')\r\na = a[e+1:]\r\nf = a.find('o')\r\nif b >= 0 and c >= 0 and d >= 0 and e >= 0 and f >= 0 :\r\n\tprint ('YES')\r\nelse :\r\n\tprint ('NO')", "m = \"hello\"\nx = 0\nflag = False\nstring = input()\nfor s in string:\n if s == m[x]:\n x += 1\n if(x == 5):\n flag = True\n break\nif(flag):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import re\r\np = re.compile(\".*[h]+.*[e]+.*[l]+.*[l]+.*[o]+.*\")\r\ns = input()\r\nm = p.search(s)\r\nif(m==None):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\r\n\t\t\r\n", "n=input()\r\ni=0\r\nif 'h' in n:\r\n i=n.index('h')\r\nelse:\r\n print(\"NO\")\r\n exit()\r\nif 'e' in n[i+1:]:\r\n i=n[i+1:].index('e')+i+1\r\nelse:\r\n print(\"NO\")\r\n exit()\r\nif 'l' in n[i+1:]:\r\n i=n[i+1:].index('l')+i+1\r\nelse:\r\n print(\"NO\")\r\n exit()\r\nif 'l' in n[i+1:]:\r\n i=n[i+1:].index('l')+i+1\r\nelse:\r\n print(\"NO\")\r\n exit()\r\nif 'o' in n[i+1:]:\r\n i=n[i+1:].index('o')+i+1\r\nelse:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "\r\ndef is_hello(string):\r\n\thello = 'hello'\r\n\thello_idx = 0\r\n\r\n\tfor char in string:\r\n\t\tif(char == hello[hello_idx]):\r\n\t\t\thello_idx += 1\r\n\t\t\tif(hello_idx >= len(hello)):\r\n\t\t\t\treturn True\r\n\treturn False\r\n\r\n\r\ndef main():\r\n\ts = input()\r\n\r\n\tif(is_hello(s)):\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "a=input()\r\nb=len(a)\r\nc=['h','e','l','l','o','']\r\nk=0\r\nfor i in range(b):\r\n if a[i] == c[0]:\r\n k=k+1\r\n del c[0]\r\n else:\r\n continue\r\nif k == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a = \"hello\"\r\ns = input()\r\nfor x in s:\r\n if x == a[0]:\r\n a = a[1:]\r\n if len(a) == 0: break\r\nif len(a) == 0: print(\"YES\")\r\nelse: print(\"NO\")\r\n\r\n \r\n\r\n\r\n", "def is_possible(s):\r\n target = \"hello\"\r\n j = 0\r\n for i in range(len(s)):\r\n if s[i] == target[j]:\r\n j += 1\r\n if j == len(target):\r\n return True\r\n return False\r\n\r\ns = input()\r\nif is_possible(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "characters = ['h','e','l','l','o']\r\nword = input()\r\nfor i in word:\r\n if characters[0] == i:\r\n characters.remove(characters[0])\r\n if(len(characters) == 0):\r\n break\r\nif len(characters) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\ndata=['h','e','l','l','o']\r\ndata.reverse()\r\nfor q in s:\r\n if(not len(data)):\r\n break\r\n if(q==data[-1]):\r\n data.pop()\r\n continue\r\nif(not len(data)):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nword = \"hello\"\r\ndef chatroom(s):\r\n k = 0\r\n for i in range(len(s)):\r\n if s[i] == word[k]:\r\n k += 1\r\n if k == 5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chatroom(s))", "s = input()\r\nl = \"hello\"\r\nj = 0\r\nfor i in s:\r\n if j == 5:\r\n break\r\n if(i == l[j]):\r\n j = j + 1\r\nif j < 5 :\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "str1 = input()\r\nm1 = str1.find(\"h\")\r\n#print(m1)\r\nif m1 >= 0:\r\n m2 = str1.find(\"e\",m1+1)\r\n #print(m2)\r\n if m2 >= 0:\r\n m3 = str1.find(\"l\",m2+1)\r\n #print(m3)\r\n if m3 >= 0:\r\n m4 = str1.find(\"l\",m3+1)\r\n #print(m4)\r\n if m4 >= 0:\r\n m5 = str1.find(\"o\",m4+1)\r\n #print(m5)\r\n if m5 >= 0:\r\n print(\"YES\")\r\n else: print(\"NO\")\r\n else: print(\"NO\")\r\n else: print(\"NO\")\r\n else: print(\"NO\")\r\nelse: print(\"NO\")", "TestCase = input()\r\nHello = ('h', 'e', 'l', 'l', 'o')\r\nMyItrator = 0\r\nANS = \"NO\"\r\nfor i in TestCase:\r\n if i == Hello[MyItrator]:\r\n MyItrator += 1\r\n if MyItrator == 5:\r\n ANS = \"YES\"\r\n break\r\nprint(ANS)", "word = input()\r\nword = word.lower()\r\ngreet = ['h','e','l','l','o']\r\nmatch = 0;\r\nj=0\r\nfor i in range(len(word)):\r\n if word[i]==greet[j]:\r\n match+=1\r\n j+=1\r\n if j==len(greet):\r\n break\r\nif match==len(greet):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def exe():\r\n j=0\r\n st=\"hello\"\r\n for i in s:\r\n if(i==st[j]):\r\n j+=1\r\n if(j==len(st)):\r\n return \"YES\"\r\n return \"NO\"\r\n \r\ns=input()\r\nprint(exe())", "s=input()\r\nf=1\r\ni=0\r\nif(len(s)<5):\r\n print(\"NO\")\r\n\r\nelse:\r\n while(f==1 and i<len(s)):\r\n if(s[i]==\"h\"):\r\n f=2\r\n i=i+1\r\n break\r\n i=i+1\r\n while(f==2 and i<len(s)):\r\n if(s[i]==\"e\"):\r\n f=3\r\n i=i+1\r\n break\r\n i=i+1\r\n while(f==3 and i<len(s)):\r\n if(s[i]==\"l\"):\r\n f=4\r\n i=i+1\r\n break\r\n i=i+1\r\n while(f==4 and i<len(s)):\r\n if(s[i]==\"l\"):\r\n f=5\r\n i=i+1\r\n break\r\n i=i+1\r\n while(f==5 and i<len(s)):\r\n if(s[i]==\"o\"):\r\n f=6\r\n i=i+1\r\n break\r\n i=i+1\r\n if(f==6):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "inp = input()\r\n\r\nlook = 'hello'\r\n\r\nfor c in inp:\r\n if c == look[0]:\r\n look = look[1:]\r\n if len(look) == 0:\r\n break\r\n\r\nprint('YES' if len(look) == 0 else 'NO')", "# https://codeforces.com/problemset/problem/58/A\r\n\r\ns = input()\r\nh = []\r\ne = []\r\nl = []\r\no = []\r\n\r\nfor i in range(len(s)):\r\n if s[i] == 'h':\r\n h.append(i)\r\n elif s[i]=='e':\r\n e.append(i)\r\n elif s[i]=='l':\r\n l.append(i)\r\n elif s[i]=='o':\r\n o.append(i)\r\n\r\nif len(l) < 2:\r\n print(\"NO\")\r\nelse:\r\n h_index = h[0]\r\n e_index = -1\r\n for ind in e:\r\n if ind > h_index:\r\n e_index = ind\r\n break\r\n if e_index == -1:\r\n print(\"NO\")\r\n else:\r\n l1_index = -1\r\n for ind in l:\r\n if ind > e_index:\r\n l1_index = ind\r\n break\r\n if l1_index == -1:\r\n print(\"NO\")\r\n else:\r\n l2_index = -1\r\n for ind in l:\r\n if ind > l1_index:\r\n l2_index = ind\r\n break\r\n if l2_index == -1:\r\n print(\"NO\")\r\n else:\r\n o_index = -1\r\n for ind in o:\r\n if ind > l2_index:\r\n o_index = ind\r\n break\r\n if o_index == -1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "j=0\r\ncount=0\r\nb='hello'\r\ns=input()\r\nfor i in range(len(s)):\r\n if(s[i]==b[j]):\r\n j+=1\r\n count+=1\r\n if(count==5):\r\n break\r\nif(count==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nletters = []\r\nfor n in s:\r\n letters.append(n)\r\nyay = True\r\nif 'h' in letters:\r\n letters = letters[letters.index('h')+1:]\r\nelse:\r\n yay = False\r\nif 'e' in letters:\r\n letters = letters[letters.index('e')+1:]\r\nelse:\r\n yay = False\r\nif 'l' in letters:\r\n letters = letters[letters.index('l')+1:]\r\nelse:\r\n yay = False\r\nif 'l' in letters:\r\n letters = letters[letters.index('l')+1:]\r\nelse:\r\n yay = False\r\nif 'o' in letters:\r\n letters = letters[letters.index('o')+1:]\r\nelse:\r\n yay = False\r\nif yay == True:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "string = input()\r\nhello = \"hello\"\r\ntyped = []\r\n\r\nfor alphabet in string:\r\n\tif alphabet in hello:\r\n\t\ttyped.append(alphabet)\r\n\r\nfinal = []\r\ncount = 0\r\n\r\nfor alphabet in typed:\r\n\tif alphabet in hello[count]:\r\n\t\tcount += 1\r\n\t\tfinal.append(alphabet)\r\n\r\n\t\tif count > 4:\r\n\t\t\tbreak\r\n\r\nfinal = \"\".join(final)\r\n\r\nif final == \"hello\":\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "string = input()\r\norder = [\"o\", \"l\", \"l\", \"e\", \"h\"]\r\n\r\nfor value in string:\r\n if order and value == order[-1]:\r\n order.pop()\r\n\r\nif order:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s = input()\nword = 'hello'\na = 0\ncount = 0\nfor i in range(len(s)):\n if s[i] == word[a]:\n a += 1\n count += 1\n if count == 5:\n break\n\nif count == 5:\n print('YES')\nelse:\n print('NO')\n", "w='hello'\r\nj=0\r\ncount=0\r\nstring=list(input())\r\nfor i in range(len(string)):\r\n if string[i]==w[j]:\r\n j+=1\r\n count+=1\r\n if count==5:\r\n print('YES')\r\n break\r\nif count!=5:\r\n print('NO')", "import re\r\n\r\ns = input()\r\nrex = re.compile(r'.*h.*e.*l.*l.*o.*')\r\nif(len(rex.findall(s))):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = str(input())\r\nlis = [char for char in s]\r\ncounts = [[],[],[],[]]\r\nFlag =''\r\nfor i in range(len(lis)):\r\n if(lis[i] =='h') :\r\n counts[0].append(i)\r\n elif(lis[i] =='e'):\r\n counts[1].append(i)\r\n elif(lis[i] =='l'):\r\n counts[2].append(i)\r\n elif(lis[i] =='o'):\r\n counts[3].append(i)\r\nfor i in range(4):\r\n if counts[i] == []:\r\n Flag ='NO'\r\n break\r\nif len(counts[2]) <= 1:\r\n Flag ='NO'\r\nif Flag !='NO':\r\n counts[0] = min(counts[0])\r\n counts[1] = min([ele if (ele > counts[0] ) else 101 for ele in counts[1] ])\r\n counts[2] = sorted([ele if (ele > counts[1] ) else 101 for ele in counts[2] ])[:2]\r\n counts[2] = max(counts[2])\r\n counts[3] = min([ele if (ele > counts[2] ) else 101 for ele in counts[3] ])\r\n for i in counts:\r\n if i == 101:\r\n Flag ='NO'\r\n break\r\nif Flag == '':\r\n print('YES') \r\nelse:\r\n print(Flag)", "import re\r\nprint('YES' if re.search(r'h\\w*?e\\w*?l\\w*?l\\w*?o', input()) else 'NO')", "str=input()\nkey=\"hello\"\nindex=0\nfor c in str:\n if index>=5:\n break\n if c==key[index]:\n index=index+1\nif index==5:\n print(\"YES\")\nelse :\n print(\"NO\")\n ", "x = input(\"\")\r\n\r\nz='hello'\r\nt=0\r\nn=0\r\nfor i in z:\r\n for j in range(t,len(x)):\r\n if x[j]==i:\r\n t=j+1\r\n n+=1\r\n break\r\nif n==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "a=list(input())\r\nj=0\r\nh='hello'\r\nfor i in range(len(a)):\r\n if a[i]==h[j]:\r\n j+=1\r\n if j>=5:\r\n break\r\nif j>=5:print(\"YES\")\r\nelse:print(\"NO\")\r\n", "s = input() # Input word\r\n\r\n# Initialize pointers for \"hello\"\r\nhello = \"hello\"\r\nindex = 0\r\n\r\n# Iterate through the input word\r\nfor char in s:\r\n if char == hello[index]:\r\n index += 1\r\n if index == 5:\r\n # All letters of \"hello\" have been found\r\n break\r\n\r\n# Check if \"hello\" has been found completely\r\nif index == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x = input()\r\nf = 0\r\nl = \"hello\"\r\nc = 0\r\nfor i in range(len(x)):\r\n if x[i] == l[c]:\r\n c += 1 \r\n if c >= 5:\r\n f = 1\r\n break\r\nif(f == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "import sys\r\n\r\nword = sys.stdin.readline().strip()\r\na = word.find('h')\r\nb = word.find('e', a)\r\nc = word.find('l', b)\r\nd = word.find('l', c + 1)\r\ne = word.find('o', d)\r\n\r\nprint(['NO', 'YES'][-1 not in [a, b, c, d, e]])", "letterH = 0\nletterE = 0\nletterL = 0\nletterO = 0\n\nword = input()\n\nfor i in range(len(word)):\n if letterH == 0:\n if word[i] == 'h':\n letterH += 1\n \n if letterH == 1 and letterE == 0:\n if word[i] == 'e':\n letterE += 1\n \n if letterE == 1 and letterL <= 1:\n if word[i] == 'l':\n letterL += 1\n \n if letterL == 2 and letterO == 0:\n if word[i] == 'o':\n letterO += 1\n\n \nif letterH == 1 and letterE == 1 and letterL == 2 and letterO == 1:\n print('YES')\nelse:\n print('NO')\n \t \t\t\t\t\t \t\t \t \t \t \t", "from fnmatch import *\r\ns = input()\r\nrez = ' '\r\nfor i in range(len(s)):\r\n if rez == ' ' and s[i] == 'h':\r\n rez += s[i]\r\n elif rez[-1] == 'h' and s[i] == 'e':\r\n rez += s[i]\r\n elif rez[-1] == 'e' and s[i] == 'l':\r\n rez += s[i]\r\n elif rez[-1] == 'l' and s[i] == 'l' and rez.count('l') == 1:\r\n rez += s[i]\r\n elif rez[-1] == 'l' and s[i] == 'o' and rez.count('l') == 2:\r\n rez += s[i]\r\nif rez == ' hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n\r\n", "s = list(input())\r\nh = 0\r\ne = 0\r\nl1 = 0\r\nl2 = 0\r\no = 0\r\nfor elem in s:\r\n if elem == 'h':\r\n h += 1\r\n elif elem == 'e' and h > 0 and l1 == 0 and l2 == 0 and o == 0:\r\n e += 1\r\n elif elem == 'l' and h > 0 and e > 0 and l1 == l2 == o == 0:\r\n l1 += 1\r\n elif elem == 'l' and h > 0 and e > 0 and l1 > 0 and l2 == o == 0:\r\n l2 += 1\r\n elif elem == 'o' and h>0 and e>0 and l1 >0 and l2> 0:\r\n o += 1\r\n\r\nif h> 0 and e>0 and l1>0 and l2>0 and o>0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 12 23:35:37 2018\r\n\r\n@author: Quaint Sun\r\n\"\"\"\r\n\r\n\r\n\r\nimport re\r\n\r\nword=input()\r\nif re.search('h.*e.*l.*l.*o',word):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "greetings = 'hello'\n \ns = [x for x in input() if x in greetings]\nj = 0\ntemp = ''\n \nfor x in greetings:\n\t\n\tif x in s:\n\t\ts = s[s.index(x):]\n\telse:\n\t\tprint('NO')\n\t\tbreak\n\t\n\tif x == s[0]:\n\t\ttemp += x\n\t\ts = s[1:]\n \n\tif temp == greetings:\n\t\tprint('YES')\n\t\tbreak\n \t\t\t\t \t\t \t\t\t \t \t \t\t \t\t\t \t\t\t", "g = ['h','e','l','l','o']\r\ns = list(input())\r\ni, j = 0, 0\r\nwhile i < len(s) and j < len(g):\r\n if s[i] == g[j]:\r\n j += 1\r\n i += 1\r\nif (j == len(g)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\n\r\nt = \"hello\"\r\nidx = 0\r\n\r\nfor i in n:\r\n\tif i == t[idx]:\r\n\t\tidx += 1\r\n\tif idx == 5:\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\n\r\nif idx != 5:\r\n\tprint(\"NO\")\r\n\r\n", "string = input()\r\nhello_1 = string.find('h')\r\nout = 'NO'\r\nif hello_1 != -1:\r\n string = string[hello_1 + 1: len(string)]\r\n hello_2 = string.find('e')\r\n if hello_2 != -1:\r\n string = string[hello_2 + 1: len(string)]\r\n hello_3 = string.find('l')\r\n if hello_3 != -1:\r\n string = string[hello_3 + 1: len(string)]\r\n hello_4 = string.find('l')\r\n if hello_4 != -1:\r\n string = string[hello_4 + 1: len(string)]\r\n hello_5 = string.find('o')\r\n if hello_5 != -1:\r\n out = 'YES'\r\nprint(out)\r\n", "n=input()\r\nm=[]\r\nk=0\r\nfor a in \"hello\":\r\n for j in range(len(n)):\r\n if a==n[j]:\r\n n=n[j+1:]\r\n k+=1\r\n \r\n break\r\nif k==5:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n\r\n \r\n \r\n", "string=input().lower()\r\n\r\nif len(string)<5:\r\n print(\"NO\")\r\nelse:\r\n l=['h','e','l','l','o']\r\n k=list(string)\r\n i=0\r\n \r\n while i<len(k):\r\n if k[i]==l[0]:\r\n l.pop(0)\r\n i+=1\r\n\r\n else:\r\n i+=1\r\n\r\n if len(l)==0:\r\n break\r\n\r\n if len(l)==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=input()\r\nn=n.lower()\r\nn=list(n)\r\nt=list('hello')\r\nj=0\r\nfor i in n:\r\n if i==t[j]:\r\n j=j+1\r\n if j==5:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "s = input()\r\n\r\nh = \"hello\"\r\n\r\np = 0\r\n\r\nfor i in s:\r\n if h[p] == i:\r\n p+=1\r\n if p == 5:\r\n break\r\n\r\nif p == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "inp=input()\r\nexp=\"hello\"\r\ncount=0\r\nfor i in range(len(inp)):\r\n j=0\r\n ans=False\r\n if(inp[i]==exp[count]):\r\n count = count + 1\r\n j = j + 1\r\n if(count==5):\r\n ans=True\r\n break\r\nif(ans==True):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nT = \"hello\"\r\nT_ = 0\r\nct=0\r\nfor char in n:\r\n if char == T[T_]:\r\n T_ += 1\r\n if T_ == len(T):\r\n print(\"YES\")\r\n ct=1\r\n break\r\nif ct==0:\r\n print(\"NO\")", "s = input()\r\ncheck = ['h','e','l','l','o']\r\nfor i in s:\r\n if check:\r\n if i==check[0]:\r\n check.pop(0)\r\n else:\r\n break\r\nprint('NO' if check else 'YES')", "\ndef solve():\n s = input()\n t = 'hello'\n j = 0\n for i in s:\n if i == t[j]:\n j += 1\n if j == 5:\n break\n if j == 5:\n print('YES')\n else:\n print('NO')\n\n\nt = 1\nfor i in range(t):\n solve()", "string = input()\nquery = \"hello\"\n\nindex = 0\nletra_query = query[index]\n\nfor l in string:\n\tif l == letra_query:\n\t\tindex += 1\n\t\tif index >= len(query):\n\t\t\tbreak\n\t\telse:\n\t\t\tletra_query = query[index]\n\nif index == len(query):\n\tprint('YES')\nelse:\n\tprint('NO')\n", "s=input()\r\nm='hello'\r\ncount=0\r\nj=0\r\nfor i in range(len(s)):\r\n if s[i]==m[j]:\r\n j=j+1\r\n count=count+1\r\n if count==5:\r\n break\r\nif count==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\ns=\"hello\"\r\ni=0\r\nj=0\r\nwhile(i<len(n) and j<len(s)):\r\n if s[j]==n[i]:\r\n j+=1\r\n i+=1\r\nif j!=len(s):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s = input().strip()\r\nt = \"hello\"\r\ni = 0\r\nj = 0\r\nf = False\r\nwhile i<len(s):\r\n if s[i]==t[j]:\r\n j += 1\r\n if j==len(t):\r\n print(\"YES\")\r\n f = True\r\n break\r\n i += 1\r\nif not f:\r\n print(\"NO\")", "import sys\r\ninputStr = input()\r\n\r\nword = 'hello'\r\nindex = 0\r\n\r\nfor i in inputStr:\r\n\r\n if i == word[index]:\r\n index += 1\r\n\r\n if index == 5:\r\n print(\"YES\")\r\n sys.exit()\r\n\r\nprint(\"NO\")\r\n \r\n", "# cook your dish here\r\n\"\"\"\r\ncheck if given substring contain substring \"hello\"\r\n\"\"\"\r\n\r\ndef doesItContainHello(s):\r\n\tsubstring=\"hello\"\r\n\tif len(s)<5:\r\n\t\treturn \"NO\"\r\n\ti=0\r\n\tfor ch in s:\r\n\t\tif ch==substring[i]:\r\n\t\t\ti+=1\r\n\t\tif i==5:\r\n\t\t\treturn \"YES\"\r\n\treturn \"NO\"\r\n\t\r\ns=input()\r\nprint(doesItContainHello(s))", "a=input()\r\nif a.find('h')==-1:\r\n print('NO')\r\nelse:\r\n if a.find('e',(a.find('h')+1))!=-1 and a.find('l',a.find('e',(a.find('h')+1))+1)!=-1 and a.find('l',a.find('l',a.find('e',(a.find('h')+1))+1)+1)!=-1 and a.find('o',a.find('l',a.find('l',a.find('e',(a.find('h')+1))+1)+1)+1)!=-1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "s = input()\nhello = [\"h\", \"e\", \"l\", \"l\", \"o\"]\nindex = 0\n\nfor l in s:\n if l == hello[index]:\n index += 1\n if index == 5:\n print(\"YES\")\n break\n\nif index != 5:\n print(\"NO\")", "char = input()#ahheelloo\nlistchar = \"hello\"\nj = 0\nfor i in range(len(char)):\n if char[i] == listchar[j]:\n j+=1 \n if j == len(\"hello\"):\n print(\"YES\")\n break\nelse :\n print('NO')\n\t\t \t\t \t\t \t \t \t\t\t\t \t \t\t\t", "s=input()\r\na=\"hello\"\r\nk=0\r\nif len(s)>=5:\r\n for i in range(len(a)):\r\n for j in range(k,len(s)):\r\n if s[j]==a[i]:\r\n t=j+1\r\n break\r\n if k==t:\r\n print(\"NO\")\r\n break\r\n k=t \r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/bin/env python3\n\nimport re\n\ndef main():\n\tstr = input()\n\n\tif re.match(r\".*h.*e.*l.*l.*o.*\", str):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\nif __name__ == \"__main__\":\n\tmain()\n", "n=input()\r\nl=['h','e','l','l','o']\r\nj=0\r\ns=''\r\nfor i in n:\r\n\tif j==5:\r\n\t\tbreak;\r\n\tif i==l[j]:\r\n\t\ts=s+i\r\n\t\tj=j+1\r\nif s=='hello':\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "str1=input()\r\nchk=\"hello\"\r\nflag=0\r\nfor i in range(len(chk)):\r\n if chk[i] in str1:\r\n flag=0\r\n str1=str1[str1.index(chk[i])+1:]\r\n else:\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\nif re.match(\".*h.*e.*l.*l.*o.*\",input()): print(\"YES\")\r\nelse: print(\"NO\")", "t = \"hello\"\r\ndef chatRoom():\r\n s = input()\r\n k = 0\r\n for i in range(len(s)):\r\n if s[i]==t[k]:\r\n k += 1\r\n if k==5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chatRoom())", "s = input()\r\ncnt = 1\r\nfor i in s:\r\n if i == 'h' and cnt == 1:\r\n cnt+=1\r\n elif i == 'e' and cnt == 2:\r\n cnt+=1\r\n elif i == 'l' and cnt == 3:\r\n cnt+=1\r\n elif i == 'l' and cnt == 4:\r\n cnt+=1\r\n elif i == 'o' and cnt == 5:\r\n cnt+=1\r\nif cnt == 6:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def solve(str):\r\n\tword=\"hello\"\r\n\tindex=0\r\n\tfor i in range(0,len(str)):\r\n\t\tif(index==5):\r\n\t\t\treturn 'YES'\r\n\t\tif(str[i]==word[index]):\r\n\t\t\tindex+=1\r\n\tif(index<5):\r\n\t\treturn 'NO'\r\n\telse:\r\n\t\treturn 'YES'\r\nstr=input()\r\nprint(solve(str))", "s = list(input())\r\nn = len(s)\r\norder = [0]\r\n\r\nfor i in range(n):\r\n if s[i] == \"h\":\r\n order.append(int(i))\r\n break\r\n\r\nfor i in range(n):\r\n if s[i] == \"e\" and i >= order[-1]:\r\n order.append(int(i))\r\n break\r\n\r\na = len(order)\r\n\r\nfor i in range(n):\r\n if s[i] == \"l\" and i >= order[-1]:\r\n order.append(int(i))\r\n if len(order) == a + 2:\r\n break\r\n\r\nfor i in range(n):\r\n if s[i] == \"o\" and i >= order[-1]:\r\n order.append(int(i))\r\n break\r\n\r\nb = len(order)\r\nif b == 6:\r\n if sorted(order) == order:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "given = input()\r\ns = 'hello'\r\narr = [1, 2, 3, 4, 5]\r\nj = 0\r\nfor i in range(len(given)):\r\n\tif(given[i] == s[j]):\r\n\t\tarr[j] = 0\r\n\t\tj += 1\r\n\t\tif(j == 5): break\r\n\r\nprint(\"YES\" if(sum(arr) == 0) else \"NO\" )", "a=input()\r\nb='hello'#直接把b写进去\r\ns=0\r\nfor i in range(len(a)):#一次遍历\r\n if a[i]==b[s]:\r\n s=s+1#一位相同比下一位b\r\n if s>4:\r\n print('YES')\r\n break\r\nif s<=4:\r\n print('NO')\r\n \r\n", "import re\n\nmessage = input()\n\nprint(\"YES\") if re.search(r\"h+.*e+.*l.*l+.*o+\", message) else print(\"NO\")\n \n\n", "s=input()\r\nre=\"hello\"\r\nk=0\r\nfor i in range(len(s)):\r\n if(re[k]==s[i]):\r\n k+=1\r\n if(k==5):\r\n break\r\nif(k==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\n\r\nhello = \"hello\"\r\n\r\nfor i in range(0, len(s)):\r\n if hello == '':\r\n break\r\n else:\r\n if s[i] == hello[0]:\r\n hello = hello.replace(hello[0], '', 1)\r\n\r\nif hello == '':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 20 08:45:41 2023\r\n\r\n@author: Pomfret Du\r\n\"\"\"\r\n\r\nword = [*input()]\r\naim = ['h','e','l','l','o']\r\nfor i in word[::-1]:\r\n try:\r\n if i == aim[-1]:\r\n aim.pop(-1)\r\n except:\r\n continue\r\nif aim == []:\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\ns = input()\r\npointer = 0\r\nfor char in s:\r\n if char == \"hello\"[pointer]:\r\n pointer += 1\r\n if pointer == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\ns1=\"hello\"\npos=0\nans=\"NO\"\nfor i in range(0, len(s)):\n if s[i]==s1[pos]:\n pos=pos+1\n if pos==5:\n ans=\"YES\"\n break\nprint(ans)\n\t\t \t\t \t \t\t\t \t \t\t \t \t\t\t\t\t\t \t", "letters = [x for x in input()]\r\nhel =''\r\n\r\nfor i in range(len(letters)):\r\n if letters[i] == 'h' and hel == '':\r\n hel += letters[i]\r\n elif letters[i] == 'e' and hel == 'h':\r\n hel += letters[i]\r\n elif letters[i] == 'l' and hel == 'he':\r\n hel += letters[i]\r\n elif letters[i] == 'l' and hel == 'hel':\r\n hel += letters[i]\r\n elif letters[i] == 'o' and hel == 'hell':\r\n hel += letters[i]\r\n if hel == 'hello':\r\n break\r\n \r\nif hel == 'hello':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\n\r\ns = input().strip()\r\n\r\npattern = re.compile(\"[a-z]*h[a-z]*e[a-z]*l[a-z]*l[a-z]*o[a-z]*\")\r\n\r\nif pattern.match(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s = input()\nn = len(s)\nword = 'hello'\nk = 0\nfor i in range(n):\n if s[i] == word[k]:\n k += 1\n if k == 5:\n print('YES')\n break\nelse:\n print('NO')\n", "s = input()\r\nresult = 0\r\nsay = ''\r\nif len(s) < 5 :\r\n print('NO')\r\nelif len(s) == 5 and s == \"hello\" :\r\n print('YES')\r\nelif len(s) == 5 and s != \"hello\" :\r\n print('NO')\r\nelse :\r\n for i in s :\r\n if i == \"h\" and result == 0 :\r\n say += i\r\n result += 1\r\n elif i == 'e' and result == 1 :\r\n say +=i\r\n result += 1\r\n elif i == 'l' and result == 2 :\r\n say +=i\r\n result += 1\r\n elif i == 'l' and result == 3 :\r\n say +=i\r\n result += 1 \r\n elif i == 'o' and result == 4 :\r\n say +=i\r\n result += 1 \r\n if say == \"hello\" :\r\n print('YES')\r\n else : print('NO')", "s = input()\r\nlst = ['h','e','l','l','o']\r\n\r\nn = 0\r\nm = 0\r\na = 1\r\n\r\nwhile a == 1 and n < len(lst):\r\n for i in range(m,len(s)):\r\n if s[i] == lst[n]:\r\n m = i+1\r\n n += 1\r\n break\r\n else:\r\n a = 0\r\n\r\nif a == 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n", "a = input()\r\na = list(a)\r\nc = ['h', 'e', 'l', 'l', 'o']\r\nk = 0\r\nfor i in range(len(a)):\r\n if k < len(c):\r\n if a[i] == c[k]:\r\n k += 1\r\n\r\nif k == len(c):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def main():\r\n word=input().strip()\r\n hello=\"hello\"\r\n i,j=0,0\r\n while i<len(word) and j<len(hello):\r\n if word[i]==hello[j]:\r\n j=j+1\r\n i=i+1\r\n if j==5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nif __name__=='__main__':\r\n main()", "n=input()\r\nl=['h','e','l','l','o']\r\np=[]\r\ntry:\r\n h=n.index('h')\r\n n=n[h:]\r\n e=n.index('e')\r\n n=n[e:]\r\n l=n.index('l')\r\n n=n[l:]\r\n l2=n.index('l',n.index('l')+1)\r\n l2=n[l2:]\r\n o=n.index('o')\r\n print(\"YES\")\r\nexcept:\r\n print(\"NO\")\r\n\r\n", "s = input()\narr =['h','e','l','l','o']\nidx = 0\nfor i in s:\n\tif(idx<5 and arr[idx]==i):\n\t\tidx+=1\nif idx==5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\t\t\t", "s = input()\r\nr=\"\"\r\nfor l in s:\r\n if r==\"hello\":\r\n break\r\n elif l==\"h\" and r==\"\":\r\n r=\"h\"\r\n elif l==\"e\" and r==\"h\":\r\n r=\"he\"\r\n elif l==\"l\" and r==\"he\" or r==\"hel\":\r\n r+=\"l\"\r\n elif l==\"o\" and r==\"hell\":\r\n r=\"hello\"\r\n\r\nif r==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "s=input()\r\ndef fun(s,s1):\r\n i=0\r\n j=0\r\n while i<len(s) and j<len(s1):\r\n if s[i]==s1[j]:\r\n i+=1\r\n j+=1\r\n else:\r\n i+=1\r\n return j==len(s1)\r\nif fun(s,\"hello\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "word=str(input())#heelllow\r\nflag=False\r\ntmp = \"hello\"\r\nj=0\r\nfor i in range (len(word)):\r\n if word[i]== tmp[j]:\r\n j+=1\r\n if j==5 : \r\n flag=True\r\n break\r\nif flag : \r\n print (\"YES\")\r\nelse : \r\n print(\"NO\")", "# Vasya has recently learned to type and log on to the Internet. He immediately entered a chat room and decided to say hello to everybody. Vasya typed the word s. It is considered that Vasya managed to say hello if several letters can be deleted from the typed word so that it resulted in the word \"hello\". For example, if Vasya types the word \"ahhellllloou\", it will be considered that he said hello, and if he types \"hlelo\", it will be considered that Vasya got misunderstood and he didn't manage to say hello. Determine whether Vasya managed to say hello by the given word s.\r\n#\r\n# Input\r\n# The first and only line contains the word s, which Vasya typed. This word consisits of small Latin letters, its length is no less that 1 and no more than 100 letters.\r\n#\r\n# Output\r\n# If Vasya managed to say hello, print \"YES\", otherwise print \"NO\".\r\n#\r\n# Examples\r\n# inputCopy\r\n# ahhellllloou\r\n# outputCopy\r\n# YES\r\n# inputCopy\r\n# hlelo\r\n# outputCopy\r\n# NO\r\nstrg = input()\r\nn = len(strg)\r\nindex = 0\r\nfound = True\r\nfor i in \"hello\":\r\n while index<n and strg[index]!=i:\r\n index+=1\r\n if index==n:\r\n found = False\r\n break\r\n index+=1\r\n\r\nif found:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\n\"\"\"chatroom\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1NJcTrxz9nf9Dqtymxxw4IG3baIqyjtF_\n\"\"\"\n\nimport re\ns=input()\nif re.match(r'.*h.*e.*l.*l.*o.*',s):\n print('YES')\nelse:\n print('NO')", "a = list(input())\r\nb = 'hello'\r\nb1 = len(b)\r\nc = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i] == b[c]:\r\n c+=1\r\n \r\n if c >= b1:\r\n break\r\n \r\nif c >= b1:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')", "w = input()\ntarget = list('hello')\nc = 0\n\nfor i in w:\n if target and i == target[0]:\n target.pop(0)\n\nprint('YES' if len(target) == 0 else 'NO')\n \t \t \t \t\t \t\t \t \t \t \t \t", "a = input()\r\nfl = 0\r\nfor i in a:\r\n if i == 'h' and fl < 1:\r\n fl = 1\r\n elif i == 'e' and fl == 1:\r\n fl = 2\r\n elif i == 'l' and fl == 2:\r\n fl = 3\r\n elif i == 'l' and fl == 3:\r\n fl = 4\r\n elif i == 'o' and fl == 4:\r\n fl = 5\r\nif fl == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s1=input()\r\nn=len(s1)\r\nfl=0\r\nc1=\"hello\"\r\ncount=0\r\nfor i in range(n):\r\n\tif s1[i]==c1[count]:\r\n\t\tcount+=1\r\n\tif count==5:\r\n\t\tfl=1\r\n\t\tbreak\r\nif fl:\r\n\tprint (\"YES\")\r\nelse:\r\n\tprint (\"NO\") ", "s = input()\r\nx = y = 0\r\nh = ['h','e','l','l','o']\r\nwhile x < len(s) and y < 5:\r\n if s[0] == h[y]:\r\n y += 1\r\n s = s[1:]\r\nif y == 5:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "s = input()\r\na = [\"h\", \"e\", \"l\", \"l\", \"o\", \"#\"]\r\nind = 0\r\nfor i in s:\r\n if i == a[ind]:\r\n ind += 1\r\nif ind == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "# Chat room Difficulty:1000\r\ns_list = list(input())\r\nhello_list = ['h', 'e', 'l', 'l', 'o']\r\nk = 0\r\nfor i in range(len(s_list)):\r\n if s_list[i] == hello_list[k]:\r\n k += 1\r\n if k == 5:\r\n break\r\nif k == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\ns=\"hello\"\r\nk=0\r\nfor i in range(len(a)):\r\n if k<5 and a[i]==s[k]:\r\n k+=1\r\nif k==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\nh= \"hello\"\nsum=0\nj=0\nfor i in range (0,len(s)):\n if s[i] == h[j]:\n j+=1\n sum+=1\n if sum==5 :\n break\nif sum==5 :\n print (\"YES\")\nelse:\n print (\"NO\")", "s = input()\r\n\r\ndef hello(s):\r\n j = 0\r\n word = \"hello\"\r\n ns = \"\"\r\n for i in range(len(s)):\r\n if s[i] == word[j]:\r\n ns += s[i]\r\n j += 1\r\n if ns == \"hello\":\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(hello(s))", "import re;\r\n\r\nprint(\"YES\"if re.search('h.*e.*l.*l.*o', input())else \"NO\")\r\n", "from sys import stdin\ninput = stdin.readline\n\n\nif __name__ == \"__main__\":\n s = input().strip()\n aux = \"hello_\"\n i = 0\n for c in s:\n if i == 5:\n break\n elif c == aux[i]:\n i += 1\n\n print([\"NO\", \"YES\"][i==5])\n\n\t \t\t \t\t\t \t\t\t \t \t \t \t \t", "def lcs(m, str1, n=6, str2='\\nhello'):\r\n tbl = [[0 for _ in range(n)] for _ in range(m)]\r\n for i in range(1, m):\r\n for j in range(1, n):\r\n tbl[i][j] = tbl[i-1][j-1]+1 if str1[i]==str2[j] else max(tbl[i-1][j], tbl[i][j-1])\r\n return tbl[-1][-1]\r\n\r\nval = input()\r\nif lcs(len(val)+1, '\\n'+val)==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = list(input())\nm = list('hello')\n\nfor c in s:\n if c == m[0]:\n if len(m) == 1:\n m = []\n break\n m = m[1:]\n\nif len(m) == 0:\n print('YES')\nelse:\n print('NO')\n", "from sys import stdin\n\nlines, line_index = stdin.readlines(), -1\n\ndef get_line():\n global lines, line_index\n\n line_index += 1\n\n return lines[line_index]\n\ndef main():\n s = get_line().strip()\n pattern = 'hello'\n i, c = 0, 0\n\n while i < len(s) and c < len(pattern):\n if s[i] == pattern[c]:\n c += 1\n i += 1\n\n if c == len(pattern):\n print('YES')\n else:\n print('NO')\n\nmain()", "n=input()\r\ns='hello'\r\nj=0\r\nc=0\r\nfor i in n:\r\n if s[j]==i:\r\n j+=1\r\n c+=1\r\n if j==len(s):\r\n break\r\nif len(s)==c:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = input()\r\nif 'h' in n:\r\n p = n.find('h')\r\n n = n[p+1::]\r\n if 'e' in n:\r\n p = n.find(\"e\")\r\n n = n[p + 1::]\r\n if 'l' in n:\r\n p = n.find(\"l\")\r\n n = n[p + 1::]\r\n if 'l' in n:\r\n p = n.find(\"l\")\r\n n = n[p + 1::]\r\n if 'o' in n:\r\n p = n.find(\"o\")\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\nh = \"hello\"\n\nfor char in h:\n\tpos = s.find(char)\n\tif pos != -1:\n\t\ts = s[pos+1:]\n\telse:\n\t\tprint(\"NO\")\n\t\texit()\nprint(\"YES\")\n", "s = input()\r\nx = \"hello\"\r\nj = 0\r\nr = \"\"\r\ni=0\r\nwhile(i<len(s) and j<len(x)):\r\n if s[i]==x[j]:\r\n r+=s[i]\r\n j+=1\r\n i+=1\r\n \r\n \r\nif r==x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "class Code:\r\n def __init__(self):\r\n self.s = input()\r\n\r\n def process(self):\r\n res = ''\r\n for item in self.s:\r\n if item == 'h' and res == '':\r\n res = 'h'\r\n elif item == 'e' and res == 'h':\r\n res = 'he'\r\n elif item == 'l' and res == 'he':\r\n res = 'hel'\r\n elif item == 'l' and res == 'hel':\r\n res = 'hell'\r\n elif item == 'o' and res == 'hell':\r\n res = 'hello'\r\n print('YES' if res == 'hello' else 'NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n code = Code()\r\n code.process()\r\n", "class state1():\n def check(self, character):\n if (character == 'h') or (character == 'H'):\n \t return state2()\n else:\n return state1()\nclass state2():\n def check(self,character):\n if (character == 'e') or (character == 'E'):\n return state3()\n else:\n return state2()\nclass state3():\n def check(self,character):\n if (character == 'l') or (character == 'L'):\n return state4()\n else:\n return state3()\nclass state4():\n def check(self,character):\n if (character == 'l') or (character == 'L'):\n return state5()\n else:\n return state4()\nclass state5():\n def check(self,character):\n if (character == 'o') or (character == 'O'):\n return True\n else:\n return state5()\n\n\nclass dfa():\n def __init__(self):\n self.state = state1()\n\n def scan(self, string):\n iter = 0\n\n # super messy loop, dont try to make sense of how i iterated, focus on the self.state stuff\n\n while not self.state == True:\n if iter == len(string):\n return False\n chara = string[iter]\n iter+=1\n self.state = self.state.check(chara)\n\n return self.state\n \n\na = input()\n\nchecker = dfa()\n\nif checker.scan(a):\n print('YES')\nelse:\n print('NO')\n\n", "seq = input()\r\ntarget = 'hello'\r\npointer = 0\r\nfor i in range(len(seq)):\r\n if seq[i] == target[pointer]:\r\n pointer += 1\r\n\r\n if pointer == len(target):\r\n break\r\n\r\nif pointer == len(target):\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\na=\"hello\"\r\np=0\r\nz=0\r\nfor i in s:\r\n if(i==a[p]):\r\n p+=1\r\n if(p==len(a)):\r\n z=1\r\n print(\"YES\")\r\n break\r\nif(z==0):\r\n print(\"NO\")\r\n", "s = input()\r\nslist = list(s)\r\nchkr = []\r\nlcounter = 0\r\nfor i in range(0,len(slist)):\r\n if(slist[i] == \"h\"):\r\n if(not(chkr)):\r\n chkr.append(slist[i])\r\n elif(slist[i] == \"e\"):\r\n if(len(chkr) == 1):\r\n chkr.append(slist[i])\r\n elif(slist[i] == \"l\"):\r\n if((len(chkr) == 2 or len(chkr) == 3) and lcounter<2):\r\n lcounter += 1\r\n chkr.append(slist[i])\r\n elif(slist[i] == \"o\"):\r\n if(len(chkr) == 4):\r\n chkr.append(slist[i])\r\nfinalchkr = ''.join(chkr)\r\nif(finalchkr == \"hello\"):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def hello(w):\r\n s = \"hello\"\r\n index = 0\r\n for i in range(0,len(w)):\r\n if(index == 5):\r\n return \"YES\"\r\n if(w[i] == s[index]):\r\n index += 1\r\n if(index < 5):\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\ns = input()\r\nprint (hello(s))", "w = 'hello'\r\ns = input()\r\nr = 0\r\ncount = 0\r\nfor i in s:\r\n if i == w[r]:\r\n r+=1\r\n count+=1\r\n if r == 5:\r\n break\r\n\r\nif(count == 5):\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\ns=input()\r\ni=0\r\nhello=\"hello\"\r\nfor l in s:\r\n if l==hello[i]:\r\n i=i+1\r\n if(i==5):\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")", "s=input()\r\nref='hello'\r\nini=0\r\n \r\nflag=0\r\nfor i in s:\r\n \r\n if i=='h' and ini==0:\r\n rp=1\r\n ini=1\r\n if ini==1 and i==ref[rp]:\r\n if rp+1<=4:rp+=1 \r\n if ini==1 and (rp==4 and ref[rp]==i): \r\n print('YES')\r\n flag=1 \r\n break\r\n \r\n \r\n \r\n \r\nif flag==0:\r\n print('NO')", "a=input()\r\nb=['h','e','l','l','o','!']\r\nc=len(a)\r\nx=0\r\nfor i in range(c):\r\n if a[i]==b[x]:\r\n x+=1\r\nif x==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "ss = input()\r\nn = len(ss)\r\nhh = [i for i in 'hello']\r\nj = 0\r\nfor i in range(n):\r\n if j == 5:\r\n break\r\n if ss[i] == hh[j]:\r\n j += 1\r\nif j >= 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=str(input())\r\nl=\"\"\r\nfor i in range(len(s)):\r\n if s[i]==\"h\":\r\n s=s[(i+1):]\r\n l=l+\"h\"\r\n break\r\nelse:\r\n print(\"NO\")\r\n exit()\r\nfor i in range(len(s)):\r\n if s[i]==\"e\":\r\n s=s[(i+1):]\r\n l=l+\"e\"\r\n break\r\nelse:\r\n print(\"NO\")\r\n exit()\r\nfor i in range(len(s)):\r\n if s[i]==\"l\":\r\n s=s[(i+1):]\r\n l=l+\"l\"\r\n break\r\nelse:\r\n print(\"NO\")\r\n exit() \r\nfor i in range(len(s)):\r\n if s[i]==\"l\":\r\n s=s[(i+1):]\r\n l=l+\"l\"\r\n break\r\nelse:\r\n print(\"NO\")\r\n exit()\r\nfor i in range(len(s)):\r\n if s[i]==\"o\":\r\n s=s[(i+1):]\r\n l=l+\"o\"\r\n break\r\nelse:\r\n print(\"NO\")\r\n exit()\r\nif l==\"hello\":\r\n print(\"YES\")\r\n \r\n \r\n \r\n", "s = input()\nn = len(s)\na = \"hello\"\nm = len(a)\nfirst = 0\nfor i in range(n):\n if(s[i] == a[first]):\n first += 1\n if(first >= m): break;\n\n\nif first >= m:\n print(\"YES\")\nelse:\n print(\"NO\")", "s = ''.join(list(input()))\r\nhello = 'hello'\r\npos=0\r\n\r\n\r\nfor i in s:\r\n if (i==hello[pos]):\r\n pos+=1\r\n if(pos>=len('hello')):\r\n break\r\n\r\nif(pos==len(hello)):\r\n print('YES')\r\nelse:\r\n print('NO')", "def solution(s):\r\n comp = 'hello'\r\n j = 0\r\n i = 0\r\n l = ''\r\n while j < len(s):\r\n if s[j] == comp[i]:\r\n l += s[j]\r\n j += 1\r\n i += 1\r\n if i == len(comp) or j == len(s):\r\n break\r\n else:\r\n j += 1\r\n\r\n if l == comp:\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n\r\n\r\ns = input()\r\nprint(solution(s))\r\n", "n=input(\"\")\nduplicate=[]\nsub=[\"h\",\"e\",\"l\",\"l\",\"o\"]\ncount=0\ncheckval=0\nfor i in range(len(sub)):\n for j in range(checkval,len(n)):\n if(sub[i]==n[j]):\n checkval=j+1\n count=count+1\n break\nif(count==5):\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \n ", "n=input()\r\nl=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\ns=\"\"\r\nc=0\r\nfor i in n.lower():\r\n if i in l:\r\n s=s+i\r\nfor i in s:\r\n if i==l[c]:\r\n c+=1\r\n if c>4:\r\n print(\"YES\")\r\n c=-1\r\n break\r\nif c!=-1:\r\n print(\"NO\")\r\n", "word = input()\r\nk = 0\r\ns = 'hello'\r\n\r\nfor i in word:\r\n if k < len(s) and i == s[k]:\r\n k += 1\r\nif k == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "x = input()\r\nword = 'hello'\r\nc = ''\r\nwhile True:\r\n if word[0] in x:\r\n c += word[0]\r\n if len(word) == 1 or len(x) ==1:\r\n break\r\n x = x[x.find(word[0])+1:]\r\n word = word[1:]\r\n continue\r\n break\r\n\r\nif c == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys,math\r\ndef li(): return list(map(int,sys.stdin.readline().split()))\r\ndef ls(): return list(map(int,list(input())))\r\ndef la(): return list(input())\r\ndef ii(): return int(input())\t\r\n\r\nt = la()\r\na = \"hello\"\r\ni = 0\r\nfor x in t:\r\n if x==a[i]:\r\n i+=1\r\n if i == 5:\r\n break\r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t='hello'\r\ns=input()\r\ni=0\r\nn=5\r\nfor j in s:\r\n if j==t[i]:\r\n i+=1\r\n if i==n:\r\n break\r\nif i==n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nw=\"hello\"\r\nj=0\r\nfor i in range(len(s)):\r\n if w[j]==s[i]:\r\n j+=1\r\n if (j==5):\r\n break\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\na=\"hello\"\r\ncount=0\r\nfor i in s:\r\n if(a[count]==i):\r\n count+=1\r\n if (count == 5):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "target = \"hello\"\ndef check():\n i = 0\n kata = input()\n\n for j in range(len(kata)):\n if kata[j] == target[i]:\n i += 1\n\n if i == 5:\n return('YES')\n return('NO')\nprint(check())\n \t\t \t \t\t \t\t\t \t \t\t \t\t \t\t \t\t", "s=input()\r\nr='hello'\r\na=count=0\r\nfor i in s:\r\n if i==r[a]:\r\n a=a+1 \r\n count+=1\r\n if count==5:\r\n break\r\nif count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "str = input()\r\nb = 'hello'\r\ni = int(0)\r\n\r\n\r\nfor x in str:\r\n\tif x == b[i]:\r\n\t\ti+=1;\r\n\t\tif i ==5:\r\n\t\t\tbreak\r\n\t\t\r\n\r\n\r\n\r\nif i == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "n=list(map(str,input()))\r\nx=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nk=0\r\nl=False\r\nfor i in n:\r\n if i==x[k]:\r\n k+=1\r\n if k==5:\r\n l=True\r\n break\r\nprint(\"YES\" if l else \"NO\")\r\n \r\n", "a = str(input())\r\n\r\nflag=0\r\n\r\nb=a.find('h')\r\n\r\nif(b==-1):\r\n\r\n\tprint (\"NO\")\r\n\r\n\tflag=1\r\n\r\nif(flag==0):\r\n\r\n\ta = a[b+1:]\r\n\r\n\tc = a.find('e')\r\n\r\n\tprint \r\n\r\n\tif(c==-1):\r\n\r\n\t\tprint (\"NO\")\r\n\r\n\t\tflag=1\r\n\r\nif(flag==0):\r\n\r\n\ta = a[c+1:]\r\n\r\n\td = a.find('l')\r\n\r\n\tif(d==-1):\r\n\r\n\t\tprint (\"NO\")\r\n\r\n\t\tflag=1\r\n\r\nif(flag==0):\r\n\r\n\ta = a[d+1:]\r\n\r\n\te = a.find('l')\r\n\r\n\tif(e==-1):\r\n\r\n\t\tprint (\"NO\")\r\n\r\n\t\tflag=1\r\n\r\nif(flag==0):\r\n\r\n\tf=a[e+1:].find('o')\r\n\r\n\tif(f==-1):\r\n\r\n\t\tprint (\"NO\")\r\n\r\n\t\tflag=1\r\n\r\nif(flag==0):\r\n\r\n\tprint (\"YES\")\r\n \r\n \r\n", "a = input()\r\nx= \"NO\"\r\n\r\nif \"h\" in a:\r\n b=a[a.find(\"h\")+1:]\r\n if \"e\" in b:\r\n c= b[b.find(\"e\")+1:]\r\n if \"l\" in c:\r\n d =c[c.find(\"l\")+1:]\r\n if \"l\" in d:\r\n e =d[d.find(\"l\")+1:]\r\n if \"o\" in e:\r\n x = \"YES\"\r\n\r\n\r\nprint(x)\r\n", "\r\n\r\ns=input()\r\nx=\"hello\"\r\nk=0\r\ny=0\r\nfor i in range(0,len(s)):\r\n if s[i]==x[k]:\r\n k+=1\r\n y+=1\r\n if y==5:\r\n break\r\n else:\r\n continue\r\n else:\r\n continue\r\nif y==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main() -> str:\r\n my_str = input() # первой и единственной строке записано слово\r\n start_pos = 0\r\n my_str_len = len(my_str)\r\n for cur_l in \"hello\":\r\n for ind in range(start_pos, my_str_len):\r\n if cur_l == my_str[ind]:\r\n if cur_l == \"o\":\r\n return \"YES\"\r\n start_pos = ind + 1\r\n break\r\n if ind == my_str_len - 1:\r\n return \"NO\"\r\n return \"NO\"\r\n\r\nprint(main())", "def func(s):\r\n a = [i for i in s]\r\n wanted = 'hello'\r\n j = 0\r\n for let in wanted:\r\n while j < len(s):\r\n if let == 'o' and let == s[j]:\r\n return \"YES\"\r\n if let == s[j]:\r\n j += 1\r\n break\r\n else:\r\n j += 1\r\n \r\n return \"NO\"\r\n \r\n \r\n\r\n\r\ns = input()\r\n \r\nprint(func(s))\r\n", "import sys\ns = sys.stdin.readline().strip()\nidx = -1\nfor i in \"hello\":\n idx = s.find(str(i),idx+1)\n if idx == -1:\n print('NO')\n break\nelse:\n print('YES')\n", "s=input()\r\nletter=['h','e','l','l','o']\r\nj=0\r\nfor i in s:\r\n if j!=5:\r\n if i==letter[j]:\r\n j+=1\r\n elif j==5:\r\n break\r\n else:\r\n continue\r\nif j==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "#23n2300011853 zhuangchuyue ccme\r\ntarg=\"hello\"\r\nk=0\r\nflag=1\r\ns=input()\r\nfor i in range(len(s)):\r\n if(s[i]==targ[k]):\r\n k+=1\r\n if(k==5):\r\n print(\"YES\")\r\n flag=0\r\n break\r\nif(flag):\r\n print(\"NO\")", "p=input()\r\nr=0\r\na=0\r\na=p.find('h')\r\nif a==-1:\r\n a=a+1\r\nelse:\r\n r=10\r\ns=p.rfind('o')+1\r\nif s==0:\r\n a = a + 1\r\nelse:\r\n r=r+10\r\np=p[a:s]\r\n\r\nw=p.find('e')\r\nif w!=-1:\r\n r=r+10\r\nelse:\r\n a = a + 1\r\np=p[w:s]\r\n\r\ne=p.find('l')\r\nif e==-1:\r\n a = a + 1\r\nelse:\r\n r=r+10\r\no=e+1\r\np=p[o:s]\r\n\r\nl=p.find('l')\r\nif l==-1:\r\n a = a + 1\r\nelse:\r\n p = r + 10\r\nif p==50:\r\n print(\"YES\")\r\nelse:\r\n print('NO')\r\n", "import re\r\npattern = re.compile(\"^.*h.*e.*l.*l.*o.*$\")\r\nprint(\"YES\" if pattern.match(input().strip()) else \"NO\")\r\n", "\r\n\r\n\r\nb = \"hello\"\r\nj = 0\r\npas = 0\r\na = input()\r\n\r\nfor i in range(len(a)):\r\n if a[i] == b [j]:\r\n j += 1\r\n pas += 1\r\n\r\n if pas == 5:\r\n break\r\n\r\nif pas == 5 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = ['h', 'e', 'l', 'l', 'o']\r\nj = 4\r\ns = input()\r\ni = len(s)-1\r\nwhile(i >= 0 and j >= 0):\r\n if(a[j] == s[i]):\r\n j -= 1\r\n i -= 1\r\n else:\r\n i -= 1\r\n \r\nprint(\"YES\" if(j == -1) else \"NO\")", "def can_say_hello(s):\n target = \"hello\"\n i = 0\n for letter in s:\n if letter == target[i]:\n i += 1\n if i == len(target):\n return \"YES\"\n return \"NO\"\n\ns = str(input())\nresult = can_say_hello(s)\nprint(result)\n\n\t\t\t\t \t\t \t \t\t \t \t \t \t \t \t\t", "s = input()\r\nb = 'hello'\r\nk = 0\r\nfor i in s:\r\n if i == b[k]:\r\n k += 1\r\n if k == 5:\r\n break\r\nif k == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "w = 'hello'\r\na = input()\r\nidx = 0\r\nfor i in range(len(a)):\r\n if a[i] == w[idx]:\r\n idx += 1\r\n if idx == len(w):\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "s=input()\r\nh=\"hello\"\r\nb=0\r\nx=0\r\nfor i in range(len(s)):\r\n if (s[i]==h[b]):\r\n b+=1\r\n x+=1\r\n if (x == 5 ):\r\n break\r\nif (x == 5):\r\n print(\"YES\")\r\nelse:print(\"NO\")", "s = input()\r\ns1 = 'hello'\r\nj=0\r\n\r\nfor i in range (len(s)):\r\n if s[i]==s1[j]:\r\n j+=1\r\n if j==5:\r\n print('YES')\r\n break\r\n elif j<5 and i== len(s)-1:\r\n print('NO')", "def f(j, a):\r\n first_symbol = 0\r\n symbol_found = False\r\n for i in range(j, len(s)):\r\n if s[i] == a:\r\n first_symbol = i\r\n symbol_found = True\r\n return first_symbol\r\n \r\n print(\"NO\")\r\n exit(0)\r\n\r\n\r\n\r\ns=input()\r\n\r\nh = f(0, 'h')\r\ne = f(h + 1, 'e')\r\nl = f(e + 1, 'l')\r\nsecondl = f(l + 1, 'l')\r\no = f(secondl + 1, 'o')\r\n\r\nprint(\"YES\")", "# line = input()\r\n# lCounter = 0\r\n# pattern = 'hello'\r\n# ind1 = 0\r\n# indOfH = line.find('h')\r\n# indOfO = line.find('o')\r\n# if indOfH == -1 or indOfO == -1: print('NO')\r\n#\r\n#\r\n# else:\r\n# ans = 'YES'\r\n# helloline = line[int(indOfH):int(indOfO) + 1]\r\n# #print(helloline)\r\n# if helloline.find('e') == -1 or helloline.find('l') == -1: ans = ('NO')\r\n\r\n\r\n# for i in range(helloline):\r\n# if helloline[i] == 'h' and helloline[i + 1] == 'e':\r\n# continue\r\n# if helloline[i] == 'e' and helloline[i + 1] == 'l':\r\n# continue\r\n# if helloline[i] == 'l' and helloline[i + 1] == 'e':\r\n# continue\r\n# else:\r\n# ans = 'NO'\r\n\r\n# print(ans)\r\n#\r\n\r\nline, pattern = input(), 'hello'\r\ni, counter, lineLen = 0, 0, len(line)\r\n\r\nfor item in pattern:\r\n while i < lineLen:\r\n if line[i] == item:\r\n counter += 1\r\n i += 1\r\n break\r\n i += 1\r\n\r\n\r\nprint('YES' if counter == 5 else 'NO')\r\n\r\n''' \r\nline = \"helllooo\" \r\n 0123456789..\r\nline = \"abchhhhhhhhelllowww\"\r\n\r\n 01234\r\npatt = \"hello\"\r\n\r\n\r\nhelhcludoo\r\n\r\n\r\n'''\r\n", "st = list(input())\r\n\r\nw = \"hello\"\r\ni = 0\r\nfor char in w: \r\n while i < len(st):\r\n if st[i] != char:\r\n del st[i]\r\n else:\r\n i += 1 \r\n break\r\n \r\n \r\ns = ''.join(st)\r\nif s[:5] == 'hello':\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n \r\n", "s = input()\nh , e , l1 , l2 , o = False , False , False , False , False\nfor c in s:\n\tif c == 'h':\n\t\th = True\n\telif h and c == 'e':\n\t\te = True\n\telif (not l1) and e and c == 'l':\n\t\tl1 = True\n\telif l1 and c == 'l':\n\t\tl2 = True;\n\telif l2 and c == 'o':\n\t\to = True\n\nif h and e and l1 and l2 and o:\n\tprint('YES')\nelse:\n\tprint('NO')", "s=input()\r\ncount=0\r\nfor i in s:\r\n if count==0 and i=='h':\r\n count+=1\r\n elif count==1 and i=='e':\r\n count+=1\r\n elif count==2 and i=='l':\r\n count+=1\r\n elif count==3 and i=='l':\r\n count+=1\r\n elif count==4 and i=='o':\r\n count+=1\r\nif count==5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "str=input()\r\nfound,found1,found2,found3,found4=False,False,False,False,False\r\nfor i in range(len(str)):\r\n if found==True:\r\n break\r\n if found4==True:\r\n if str[i]=='o':\r\n found=True\r\n if found3== True:\r\n if str[i]=='l':\r\n found4=True\r\n if found2==True:\r\n if str[i]=='l':\r\n found3=True\r\n if found1==True:\r\n if str[i]=='e':\r\n found2=True\r\n if str[i]=='h':\r\n found1=True\r\n \r\n \r\nif found==True:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n \r\n \r\n", "a=[]\r\na=input()\r\nc=0\r\nl=len(a)\r\nif(l>=5):\r\n for i in range(l):\r\n if(a[i]=='h'):\r\n if(c==0):\r\n c=c+1\r\n elif(a[i]=='e'):\r\n if(c==1):\r\n c=c+1\r\n elif(a[i]=='l'):\r\n if(c==2):\r\n c=c+1\r\n elif(c==3):\r\n c=c+1\r\n elif(a[i]=='o'):\r\n if(c==4):\r\n c=c+1\r\n if(c==5):\r\n print(\"YES\")\r\n exit(0)\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\nelse:\r\n print(\"NO\")", "s = input()\r\nsearchChar = ['h','e','l','l','o']\r\nsearchChar = searchChar[::-1]\r\n\r\nstartIndex = len(s) - 1\r\ncharIndex = 0\r\nans = \"YES\"\r\n\r\n\r\ndef search(item, startIndex):\r\n i = startIndex\r\n while i >= 0:\r\n if s[i] == item:\r\n return i\r\n i -= 1\r\n \r\n return -1\r\n\r\nfor item in searchChar:\r\n index = search(item, startIndex)\r\n if index == -1:\r\n ans = \"NO\"\r\n break\r\n startIndex = index - 1\r\n\r\nprint(ans)\r\n", "def issorted(l):\n\tmin = l[0]\n\tfor i in range(1,len(l)):\n\t\tif(l[i] > min):\n\t\t\tf = 1\n\t\t\tmin = l[i]\n\t\telse:\n\t\t\treturn 0\n\treturn 1\n\ns = input()\nih, ie, il1, il2, io = -1 ,-1, -1, -1, -1\nif 'h' in s:\n\tih = s.index('h')\nif ih is not -1 and 'e' in s[ih+1:]:\n\tie = s.index('e', ih+1)\nif ie is not -1 and 'l' in s[ie+1:]:\n\til1 = s.index('l', ie+1)\nif il1 is not -1 and 'l' in s[il1+1:]:\n\til2 = s.index('l',il1+1)\nif il2 is not -1 and 'o' in s[il2+1:]:\n\tio = s.index('o',il2+1)\n\nl = [ih, ie, il1, il2, io]\n\nif issorted(l) == 1:\n\tprint('YES')\nelse:\n\tprint('NO')", "s=input()\r\nlength=len(s)\r\nq='hello'\r\nk=0\r\n\r\n\r\nfor i in range(0,length):\r\n if s[i]==q[k]:\r\n k += 1\r\n # print(k)\r\n # print(s[i])\r\n if(k==5):\r\n break\r\nif k==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nf = []\r\nfor i in range(len(s)):\r\n if s[i] == \"h\" and \"h\" not in f: f.append(s[i])\r\n if s[i] == \"e\" and \"e\" not in f and \"h\" in f: f.append(s[i]) \r\n if s[i] == \"l\" and f.count(\"l\") < 2 and \"h\" in f and \"e\" in f: f.append(s[i])\r\n if s[i] == \"o\" and \"o\" not in f and \"h\" in f and \"e\" in f and f.count(\"l\") == 2: f.append(s[i])\r\n\r\nres = \"\".join(f)\r\nif res == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\ncompare=\"hello\"\ni, j = 0, 0\nwhile i < len(s) and j < 5:\n if s[i] != compare[j]:\n i+=1\n else:\n i, j = i+1, j+1\ncheck=j==5\nif check:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s=input()\r\nj=[]\r\no=0\r\nwhile o<len (s):\r\n if s[o] == 'h' and len(j)==0:\r\n j.append('h')\r\n elif s[o] == 'e' and len(j)==1:\r\n j.append('e')\r\n elif s[o] == 'l' and (len(j)==2 or len(j)==3):\r\n j.append('l')\r\n elif s[o] == 'o' and len(j)==4:\r\n j.append('l')\r\n o+=1\r\nif len(j)==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 1 10:20:34 2022\r\n\r\n@author: thinkpad\r\n\"\"\"\r\nline = input()\r\nword = 'hello'\r\nc = 0\r\nfor i in range(len(line)):\r\n if c<5 and line[i] == word[c]:\r\n c+=1\r\n if c==5:\r\n break\r\nif c == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "def solve():\r\n s = input()\r\n prev = -1\r\n for i in 'hello':\r\n if i in s[prev + 1:]:\r\n prev = s[prev + 1:].find(i) + prev + 1\r\n else:\r\n return 'NO'\r\n return 'YES'\r\n\r\nprint(solve())\r\n", "import re\r\nprint(['NO','YES'][re.search(r'h(.*)e(.*)l(.*)l(.*)o',input())!=None])\r\n", "b=input()\r\na='hello'\r\nk=0\r\nfor j in range(len(b)):\r\n \r\n try:\r\n if a[j] not in b:\r\n print('NO')\r\n k=1\r\n break\r\n c=b.find(a[j])\r\n b=b[c+1:]\r\n if a[j+1] in b:\r\n continue\r\n else:\r\n print('NO')\r\n k=1\r\n break\r\n except IndexError:\r\n pass\r\nif k==0 :\r\n print('YES')\r\n \r\n \r\n ", "s = input()\r\ntemp = 'hello'\r\nind = 0\r\nfor i in s:\r\n if i == temp[ind]:\r\n ind += 1\r\n if ind == len(temp):\r\n break\r\nif ind == len(temp):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "str_ = input()\r\ncheck = ''\r\nindex = -1\r\nfor i in range(index + 1, len(str_)):\r\n if str_[i] == 'h':\r\n index = i\r\n check += 'h'\r\n break\r\nfor i in range(index + 1, len(str_)):\r\n if str_[i] == 'e':\r\n index = i\r\n check += 'e'\r\n break\r\nfor i in range(index + 1, len(str_)):\r\n if str_[i] == 'l':\r\n index = i\r\n check += 'l'\r\n break\r\nfor i in range(index + 1, len(str_)):\r\n if str_[i] == 'l':\r\n index = i\r\n check += 'l'\r\n break\r\nfor i in range(index + 1, len(str_)):\r\n if str_[i] == 'o':\r\n index = i\r\n check += 'o'\r\n break\r\n\r\nif check == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "x = input()\r\nh = 'hello'\r\nz, count = 0, 0\r\nfor i in range(len(h)):\r\n for j in range(z, len(x)):\r\n if h[i] == x[j]:\r\n count += 1\r\n z = j + 1\r\n break\r\nif count == len(h):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "hello = [\"h\", \"e\", \"l\", \"l\", \"o\"]\r\n\r\ntest = input()\r\nindex = -1\r\n\r\nfor letter in hello:\r\n try:\r\n index = test.index(letter, index + 1)\r\n except ValueError:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")", "s = input()\nword = \"hello\"\nit = 0\nfor item in s:\n if item == word[it]:\n it += 1\n if it == 5:\n break\nif it == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s=input()\r\nflag=0\r\nfor i in range(len(s)):\r\n if s[i]==\"h\":\r\n for j in range(i+1,len(s)):\r\n if s[j]==\"e\":\r\n for k in range(j+1,len(s)):\r\n if s[k]==\"l\":\r\n for l in range(k+1,len(s)):\r\n if s[l]==\"l\":\r\n for m in range(l+1,len(s)):\r\n if s[m]==\"o\":\r\n flag=1\r\n break\r\n break\r\n break\r\n break\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ntry:\r\n s = s[s.index('h'):len(s)-s[::-1].index('o')]\r\nexcept ValueError:\r\n print(\"NO\")\r\n exit(0)\r\ntry:\r\n if s[s.index(\"e\"):].count('l') >= 2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nexcept ValueError:\r\n print(\"NO\")\r\n\r\n", "word, hello, i = input(), 'hello', 0\r\nfor letter in word:\r\n if i < len(hello) and letter == hello[i]:\r\n i += 1\r\nprint('YES' if i == 5 else 'NO')\r\n", "a='hello'\r\ns='NO'\r\nj,c=0,0\r\nb=input()\r\nfor i in range(len(b)):\r\n if(b[i]==a[j]):\r\n j+=1\r\n c+=1\r\n if(c==5):\r\n s='YES'\r\n break\r\nprint(s)\r\n", "s=input()\r\nsearch=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nc=0\r\nfor i in s:\r\n if i==search[c]:\r\n c+=1\r\n if c==5:\r\n print(\"YES\")\r\n break;\r\nif c<5:\r\n print(\"NO\") ", "#https://codeforces.com/problemset/problem/58/A\n\n\n\ns = input()\n\nj = 0\nif s[0] == \"h\":\n j += 1\n\nl_flag = True\nfor i in range(1, len(s)):\n if s[i] == s[i-1] and l_flag:\n continue\n\n if s[i] == \"hello\"[j]:\n if j == 4: \n j += 1\n break\n j += 1\n if j == 3: l_flag = False\n else: l_flag = True\n continue\n\nif j == 5: \n print(\"YES\")\nelse: \n print(\"NO\")\n", "from collections import deque, Counter, OrderedDict\r\nfrom heapq import nsmallest, nlargest\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\n# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n#code\r\nif __name__ == \"__main__\":\r\n s = str(input())\r\n h = 'h'\r\n e='e'\r\n l1='l'\r\n l2='l'\r\n o='o'\r\n if h not in s or e not in s or l1 not in s or o not in s:\r\n print(\"NO\")\r\n else:\r\n for i in range(len(s)):\r\n if s[i] == 'h':\r\n h = i\r\n break\r\n for i in range(h,len(s)):\r\n if s[i] == 'e' and i>h:\r\n e = i\r\n break\r\n if e=='e':\r\n print(\"NO\")\r\n quit()\r\n for i in range(e,len(s)):\r\n if s[i] == 'l' and i>e:\r\n l1 = i\r\n break\r\n if l1=='l':\r\n print(\"NO\")\r\n quit()\r\n for i in range(l1,len(s)):\r\n if s[i] == 'l' and i>l1:\r\n l2 = i\r\n break\r\n if l2=='l':\r\n print(\"NO\")\r\n quit()\r\n for i in range(l2,len(s)):\r\n if s[i] == 'o' and i>l2:\r\n o = i\r\n break\r\n if o=='o':\r\n print(\"NO\")\r\n quit()\r\n print(\"YES\")\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "string='hello'\r\ni=0\r\nwords=input()\r\nfor j in range(len(words)):\r\n if words[j]==string[i]:\r\n i+=1\r\n if i==5:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "t=input()\r\ns='hello'\r\nj=0\r\nfor i in range(len(t)):\r\n if t[i]==s[j]:\r\n j+=1\r\n if j==5:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "str=input()\r\ni,j=0,0\r\ns=\"hello\"\r\nwhile(i<len(str) and j<5):\r\n if(str[i]==s[j] ):\r\n i=i+1 \r\n j=j+1 \r\n else:\r\n i=i+1 \r\n \r\nif(j==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n i=i+1 # -*- coding: latin-1 -*-j=j+1\r\n ", "\r\ns = input()\r\nh = ['h', 'e', 'l', 'l', 'o']\r\ncnt = 0\r\nfor i in s:\r\n if i == h[cnt]:\r\n cnt += 1\r\n if cnt == 5:\r\n print('YES')\r\n break\r\nelse:\r\n if cnt == 5:\r\n print('YES')\r\n print('NO')", "s = input()\r\npos = s.find('h')\r\nif pos != -1:\r\n pos = s.find('e',pos + 1)\r\n if pos != -1:\r\n pos = s.find('l',pos + 1)\r\n if pos != -1:\r\n pos = s.find('l',pos + 1)\r\n if pos != -1:\r\n pos = s.find('o',pos + 1)\r\nif pos != -1:\r\n print('YES')\r\nelse :\r\n print('NO')", "s=input()\r\nk = 0\r\nfor _ in s:\r\n if k == 5:\r\n break\r\n if 'hello'[k]==_:\r\n k+=1\r\nif k == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nb = 'hello'\r\nj = 0\r\nk = 0\r\nfor i in range(len(s)):\r\n if s[i]==b[j]:\r\n j+=1\r\n k+=1\r\n if k==5:\r\n break\r\nif k==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "from sys import stdin,stdout\r\ndef hi(s,n):\r\n for i in range(n):\r\n if s[i]=='h':\r\n for j in range(i,n):\r\n if s[j]=='e':\r\n for k in range(j+1,n):\r\n if s[k]=='l':\r\n for h in range(k+1,n):\r\n if s[h]=='l':\r\n for g in range(h+1,n):\r\n if s[g]=='o':\r\n return True\r\n return False\r\nif __name__==\"__main__\":\r\n s=input()\r\n n=len(s)\r\n f=0\r\n # for i in range(1,len(s)):\r\n # if s[i] not in l:l.append(s[i])\r\n # if s[i]!=r[-1]:r+=s[i]\r\n # if s[i]=='l' and s[i+1]=='o':r+=s[i]\r\n # # if s[i]==r[-1] and s[i]=='l':r+=s[i]\r\n # print(r)\r\n # print(l)\r\n # if 'hello' in r:print(\"YES\")\r\n # else:print(\"NO\")\r\n ok=hi(s,n)\r\n if(ok):print(\"YES\")\r\n else:print(\"NO\")", "s = input()\r\ncount = 0\r\nfor i in s:\r\n if i == 'h':\r\n s = s[s.index(i)+1:]\r\n count+=1\r\n break\r\nfor i in s:\r\n if i == 'e':\r\n s = s[s.index(i)+1:]\r\n count+=1\r\n break\r\nfor i in s:\r\n if i == 'l':\r\n s = s[s.index(i)+1:]\r\n count+=1\r\n break\r\nfor i in s:\r\n if i == 'l':\r\n count+=1\r\n s = s[s.index(i)+1:]\r\n break\r\nfor i in s:\r\n if i == 'o':\r\n count+=1\r\n break\r\n\r\nif count==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "i=0\r\ns=input()\r\nif s.find('h')!=-1:\r\n s=s[s.find('h')+1:]\r\n if s.find('e')!=-1:\r\n s=s[s.find('e')+1:]\r\n if s.find('l')!=-1:\r\n s=s[s.find('l')+1:]\r\n if s.find('l')!=-1:\r\n s=s[s.find('l')+1:]\r\n if s.find('o')!=-1:\r\n print('YES')\r\n raise SystemExit\r\nprint('NO')\r\n \r\n\r\n\r\n", "def judge(s):\r\n hello = 'hello'\r\n pointer = 0\r\n for char in s:\r\n if char == hello[pointer]:\r\n pointer += 1\r\n if pointer == 5:\r\n return 'YES'\r\n return 'NO'\r\n\r\nstring = input()\r\nprint(judge(string))\r\n", "s=input()\r\nm=\"hello\"\r\ni=0\r\nj=0\r\nc=0\r\nwhile(i<5 and j<len(s)):\r\n if (m[i]==s[j]):\r\n i+=1\r\n j+=1\r\n c+=1\r\n else:\r\n j+=1\r\nif (c==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nhello = 'hello'\r\nn = len(s)\r\ni=0\r\nj=0\r\nwhile i<n:\r\n\tif hello[j] == s[i]:\r\n\t\tj+=1\r\n\t\tif j == 5:\r\n\t\t\tbreak\r\n\ti+=1\r\nif j<5:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "s = input('')\r\nh = s.find('h')\r\ne = s.find('e',h)\r\nl = s.find('l',e)\r\nl1 = s.find('l',l+1)\r\no = s.find('o',l1)\r\nif h<e<l<l1<o and h!=-1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "s=input()\r\na=\"hello\"\r\nn=len(s)\r\ni=0\r\nj=0\r\nwhile i<n and j<5:\r\n\tif s[i]==a[j]:\r\n\t\ti+=1\r\n\t\tj+=1\r\n\telse:\r\n\t\ti+=1\r\nif i==n and j!=5:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "s=iter(input());print(\"YES\"if all(c in s for c in 'hello') else \"NO\")\r\n", "s = input()\r\nif len(s) >= 1 or len(s) <= 100:\r\n st = 'hello'\r\n for i in s:\r\n if i == st[0]:\r\n st = st[1:]\r\n if len(st) == 0:\r\n break\r\n\r\n if len(st) == 0:\r\n print('YES')\r\n else:\r\n print('NO')", "s = input().lower()\r\n\r\nx = 0\r\nm = ['h', 'e', 'l', 'l', 'o']\r\n\r\nfor i in s:\r\n if i == m[x]:\r\n x += 1\r\n if x == 5:\r\n print(\"YES\")\r\n break\r\nif x < 5:\r\n print(\"NO\")\r\n", "k=input()\r\n\r\nls=list(k)\r\nj=list(\"hello\")\r\nq=0\r\nfor i in ls:\r\n\r\n if j[q]==i:\r\n q=q+1\r\n if q==len(j):\r\n break\r\n \r\nif q!=len(j):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "s=input()\r\nan='hello'\r\nl=0\r\nfor i in s:\r\n if(l==5):\r\n break\r\n elif(i==an[l]):\r\n l+=1\r\nprint('YES') if(l==5) else print('NO')", "'''\r\nv=input().lower();x=''\r\nf=False\r\nfor i in v:\r\n if i =='h':\r\n f=True\r\n if i not in x and f == True :\r\n x+=i\r\n print(x)\r\nprint('YES' if x.find('helo') !=-1 else 'NO' )\r\n\r\n'''\r\nx=input()\r\nword='hello'\r\ns='';counter=0\r\nfor i in x:\r\n if counter != 5 and word[counter] == i :\r\n s+=word[counter]\r\n counter+=1\r\n if s == word :\r\n print(\"YES\")\r\n break\r\nelse: print(\"NO\")", "n=input().lower()\r\nword='hello';m=0;res=0\r\nfor c in n:\r\n if c ==word[m]:\r\n m+=1\r\n res+=1\r\n if res==5:\r\n print('YES')\r\n break\r\nif res!=5:\r\n print('NO')", "word = input()\r\nllarg = len(word)\r\ntrobat1 = False\r\ntrobat2 = False\r\ntrobat3 = False\r\ntrobat4 = False\r\ntrobat5 = False\r\n\r\nfor i in range(llarg):\r\n if word[i] == \"h\":\r\n index = i\r\n trobat1 = True\r\n for i in range(index+1, llarg):\r\n if word[i] == \"e\":\r\n index = i\r\n trobat2 = True\r\n for i in range(index+1, llarg):\r\n if word[i] == \"l\":\r\n index = i\r\n trobat3 = True\r\n for i in range(index+1, llarg):\r\n if word[i] == \"l\":\r\n index = i\r\n trobat4 = True\r\n for i in range(index+1, llarg):\r\n if word[i] == \"o\":\r\n index = i\r\n trobat5 = True\r\n\r\nif trobat1 and trobat2 and trobat3 and trobat4 and trobat5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nk=['h','e','l','l','o']\r\ni=0\r\nfor word in n:\r\n if i<len(k) and word==k[i]:\r\n i=i+1\r\n\r\nif i==len(k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nword = 'hello'\r\ncount = 0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == word[count]:\r\n count += 1\r\n if count == 5:\r\n break\r\n\r\nif count == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "S = str(input())\r\nh = S.find('h')\r\ne = S.find('e', h+1)\r\nl1 = S.find('l', e+1)\r\nl2 = S.find('l', l1+1)\r\no = S.find('o', l2+1)\r\nif h < e < l1 < l2< o: print('YES')\r\nelse: print('NO')\r\n", "s = 'hello'\r\ns += '1'\r\ncnt = 0\r\nst = input()\r\nfor c in st:\r\n if c == s[cnt]: cnt+=1\r\nprint(['NO','YES'][cnt==5])", "s=input()\r\nl=['h','e','l','l','o']\r\nk=0\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i]==l[k]:\r\n c+=1\r\n k+=1\r\n if c==5:\r\n break\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\nans = []\r\ns = input()\r\nif(s.find('h')==-1 or s.find('e')==-1 or s.find('l')==-1 or s.find('o')==-1):\r\n print(\"NO\")\r\n exit(0)\r\nh = [k.start() for k in re.finditer('h',s)]\r\ne = [k.start() for k in re.finditer('e',s)]\r\nl1 = [k.start() for k in re.finditer('l',s)]\r\nl2 = l1\r\no = [k.start() for k in re.finditer('o',s)]\r\nf1,f2,f3,f4 = 0,0,0,0\r\nans.append(h[0])\r\nfor i in e:\r\n if(i>ans[len(ans)-1]):\r\n ans.append(i)\r\n f1 = 1\r\n break\r\nif(f1==1):\r\n for i in l1:\r\n if(i>ans[len(ans)-1]):\r\n ans.append(i)\r\n f2=1\r\n break\r\nelse:\r\n print(\"NO\")\r\n exit(0)\r\nif(f2==1):\r\n for i in l2:\r\n if(i>ans[len(ans)-1]):\r\n ans.append(i)\r\n f3=1\r\n break\r\nelse:\r\n print(\"NO\")\r\n exit(0)\r\nif(f3==1):\r\n for i in o:\r\n if(i>ans[len(ans)-1]):\r\n ans.append(i)\r\n f4=1\r\n break\r\nelse:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nif(f4):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "greeting=input()\r\na=int(greeting.find('h'))\r\nb=int(greeting.find('e',a+1))\r\nc=int(greeting.find('l',b+1))\r\nd=int(greeting.find('l',c+1))\r\ne=int(greeting.find('o',d+1))\r\nif a==-1 or b==-1 or c==-1 or d==-1 or e==-1:\r\n print('NO')\r\nelse:\r\n print('YES')", "\r\nw = input() ;lst = []\r\n\r\nfor i in w:\r\n a = ''.join(lst)\r\n if i == 'h' and len(lst) == 0:\r\n lst.append(i)\r\n elif i == 'e' and a == 'h':\r\n lst.append(i)\r\n elif i == 'l' and (a == 'he' or a == 'hel'):\r\n lst.append(i)\r\n elif i == 'o' and a == 'hell':\r\n lst.append(i)\r\nif ''.join(lst) == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\nLi=list(input())\r\ni=0\r\nHpos=[]\r\nEpos=[]\r\nLpos=[]\r\nOpos=[]\r\nwhile i<len(Li):\r\n if Li[i]==\"h\":\r\n Hpos.append(i)\r\n elif Li[i]==\"e\":\r\n Epos.append(i)\r\n elif Li[i]==\"l\":\r\n Lpos.append(i)\r\n elif Li[i]==\"o\":\r\n Opos.append(i)\r\n i=i+1\r\nHpos.sort()\r\nEpos.sort()\r\nLpos.sort()\r\nOpos.sort()\r\nif Hpos==[] or Epos==[] or len(Lpos)<=1 or Opos==[]:\r\n print(\"NO\")\r\n sys.exit()\r\nh1=Hpos[0]\r\ni=0\r\nEpos1=[]\r\nwhile i<len(Epos):\r\n if Epos[i]>h1:\r\n Epos1.append(Epos[i])\r\n break\r\n i=i+1\r\nif Epos1==[]:\r\n print(\"NO\")\r\n sys.exit()\r\ne1=Epos1[0]\r\ni=0\r\nLpos12=[]\r\nwhile i<len(Lpos):\r\n if Lpos[i]>e1:\r\n Lpos12.append(Lpos[i])\r\n i=i+1\r\nif len(Lpos12)<2:\r\n print(\"NO\")\r\n sys.exit()\r\nl1=Lpos12[0]\r\nl2=Lpos12[1]\r\ni=0\r\nOpos1=[]\r\nwhile i<len(Opos):\r\n if Opos[i]>l2:\r\n Opos1.append(Opos[i])\r\n break\r\n i=i+1\r\nif Opos1==[]:\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"YES\")", "count=0\r\na = 0\r\nstring = \"hello\"\r\nstring1=input()\r\n\r\nfor i in range(len(string1)):\r\n if string1[i]==string[a]:\r\n a+=1\r\n count+=1\r\n if a>4:\r\n break\r\nif count==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\ntext = 'hello'\nanswer = []\n\nfor k1,c1 in enumerate(list(s)):\n if c1 == 'h':\n answer.append([k1,c1]) # Char details was added 'h'\n for k2,c2 in enumerate(list(s)):\n if c2 == 'e' and k2>k1:\n answer.append([k2,c2]) # Char details was added 'e'\n for k3,c3 in enumerate(list(s)):\n if c3 == 'l' and k3>k2:\n answer.append([k3,c3]) # Char details was added 'l'\n for k4,c4 in enumerate(list(s)):\n if c4 == 'l' and k4>k3:\n answer.append([k4,c4]) # Char details was added 'l' \n for k5,c5 in enumerate(list(s)):\n if c5 == 'o' and k5>k4:\n answer.append([k5,c5])\n print('YES')\n break\n else:\n print('NO') \n break\n else:\n print('NO') \n break\n else:\n print('NO')\n break\n else:\n print('NO') \n break\nelse:\n print('NO')\n#print(answer) \n ", "curr = 0\r\nfor i in input():\r\n if curr == 0 and i == \"h\": curr += 1\r\n elif curr == 1 and i == \"e\": curr += 1\r\n elif curr == 2 and i == \"l\": curr += 1\r\n elif curr == 3 and i == \"l\": curr += 1\r\n elif curr == 4 and i == \"o\": curr += 1\r\nprint(\"YES\" if curr == 5 else \"NO\")", "s = input()\nL = \"hello\"\nflag = 0\nk = 0\nfor i in range(5):\n\ttemp = 0\n\twhile k < len(s):\n\t\tif L[i] == s[k]:\n\t\t\ttemp = 1\n\t\t\tk += 1\n\t\t\tbreak;\n\t\tk += 1\n\tif temp == 0:\n\t\tflag = 1\nif flag:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\n \t\t \t \t\t\t\t\t \t \t\t \t \t \t \t \t", "a=input()\r\nt = \"hello\"\r\nt_ = 0\r\nc=0\r\nfor char in a:\r\n if char == t[t_]:\r\n t_ += 1\r\n if t_ == len(t):\r\n print(\"YES\")\r\n c=1\r\n break\r\nif c==0:\r\n print(\"NO\")", "s=input()\r\ntext=\"hello \"\r\nx=0\r\nc=0\r\nfor i in range(len(s)):\r\n if(s[i]==text[x]):\r\n if(x<5):\r\n x+=1\r\n c+=1\r\nif(c==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\n\r\n\r\ns = input()\r\n\r\ns1 = 'hello'\r\nindex = 0\r\nfor x in s:\r\n if(x == s1[index]):\r\n index += 1\r\n if(index == len(s1)):\r\n break\r\n\r\nif(index == len(s1)) :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def chatRoom(str):\r\n key = ['h', 'e', 'l', 'l', 'o'] \r\n newstr = ''\r\n\r\n for k in key:\r\n for s in range(len(str)):\r\n if(k == str[s]):\r\n str = str[s + 1:]\r\n if(newstr.count('l') <= 2): \r\n newstr += k\r\n break\r\n\r\n if(newstr == \"hello\"):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nif __name__ == \"__main__\":\r\n chatRoom(input())", "word = \"hello\"\r\nn = input()\r\nlength = 0\r\nexist = 0\r\nfor i in range(len(n)):\r\n if n[i] == word[length]:\r\n length += 1\r\n if length == 5:\r\n exist = True\r\n break\r\nif exist :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "bh = False\nbe = False\nbl1 = False\nbl2 = False\nbo = False\nword = input()\nfor i in range(len(word)):\n k = word[i]\n if k == \"h\":\n bh = True\n elif k == \"e\" and bh:\n be = True\n elif k == \"l\" and be and not bl1:\n bl1 = True\n elif k == \"l\" and bl1:\n bl2 = True\n elif k == \"o\" and bl2:\n bo = True\nif bo:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a=input()\r\nl=len(a)\r\nc='hello'\r\nb=''\r\nd=0\r\nfor i in range(l):\r\n if a[i]==c[d]:\r\n b=b+a[i]\r\n d=d+1\r\n if d==5:\r\n break\r\nif b==c:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=str(input())\r\nif a.count(\"h\"):\r\n h=a.index(\"h\")\r\n if a[h:].count(\"e\"):\r\n e=a[h:].index(\"e\")+h\r\n if a[e:].count(\"l\"):\r\n l1=a[e:].index(\"l\")+e\r\n if a[l1+1:].count(\"l\"):\r\n l2=a[l1+1:].index(\"l\")+l1\r\n if a[l2:].count(\"o\"):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "b=input()\r\nb=b.lower()\r\ns=\"hello \"\r\nc=0\r\nx=\"\"\r\nfor i in b:\r\n if i==s[c] and c!=5:\r\n c+=1\r\n x+=i\r\n elif c==5:\r\n break\r\nif x==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nh = s.find(\"h\")\r\ne = s.find(\"e\",h)\r\nl1 = s.find(\"l\",e)\r\nl2 = s.find(\"l\",l1+1)\r\no = s.find(\"o\",l2)\r\nif(h<e<l1<l2<o):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nbool=0\r\nfor i in range(len(s)):\r\n if s[i]==\"h\":\r\n for j in range(i+1, len(s)):\r\n if s[j]==\"e\":\r\n for k in range(j+1, len(s)):\r\n if s[k]==\"l\":\r\n for l in range(k+1, len(s)):\r\n if s[l]==\"l\":\r\n for m in range(l+1, len(s)):\r\n if s[m]==\"o\":\r\n bool =1\r\nif bool==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nhasLetter = [i for i in \"hello\"]\r\ncheck_pos = 0\r\nfor i in s:\r\n if i == hasLetter[check_pos]:\r\n check_pos += 1\r\n if check_pos == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s=input()\r\nl='hello'\r\nj=0\r\n\r\nfor i in s:\r\n if l[j]==i:\r\n j+=1\r\n if j==5:\r\n break\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\"\"\"\r\nt=int(input())\r\nc=0\r\nfor i in range(t):\r\n l=[int(x) for x in input().split()]\r\n if(l.count(1)>1):\r\n c+=1\r\nprint(c)\r\n \r\n\r\nn,k=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nc=0\r\nfor i in l:\r\n if(i>=l[k-1] and i!=0 and i>0):\r\n c+=1\r\nprint(c)\r\n \r\nstring = input()\r\nvowels=('a', 'e', 'i', 'o', 'u','y')\r\nstring=string.lower()\r\nfor x in string:\r\n if x in vowels:\r\n string = string.replace(x, \"\")\r\nprint('.',end='')\r\nprint('.'.join(string)) \r\n \r\n\"\"\"\r\ndef check(s):\r\n h=['h','e','l','l','o']\r\n i=0\r\n for j in range(len(s)):\r\n if i==5:\r\n return 'YES'\r\n if s[j]==h[i]:\r\n i+=1\r\n if(i<5):\r\n return 'NO'\r\n else:\r\n return 'YES' \r\ns=input()\r\nprint(check(s))\r\n", "def chatRoom(word):\n matchWord = 'hello'\n desiredSize = len(matchWord)\n matchedElements = 0\n\n for i in range(len(word)):\n if (word[i] == matchWord[matchedElements]):\n matchedElements += 1\n if(matchedElements == desiredSize):\n return 'YES'\n \n return 'NO'\n\nwordLine = input()\nprint(chatRoom(wordLine))", "a = input()\r\nb = a.find('h')\r\nif b==-1 or b==len(a)-1:\r\n print('NO')\r\n exit()\r\na=a[b+1:]\r\nb = a.find('e')\r\nif b==-1 or b==len(a)-1:\r\n print('NO')\r\n exit()\r\na = a[b+1:]\r\nfor x in range(2):\r\n b = a.find('l')\r\n if b==-1 or b==len(a)-1:\r\n print('NO')\r\n exit()\r\n a = a[b+1:]\r\nb = a.find('o')\r\nif b==-1:\r\n print('NO')\r\n exit()\r\nprint('YES')", "string = input()\r\nstring = string.lower()\r\nresponse = \"\"\r\nhcount = 0\r\necount = 0\r\nlcount = 0\r\nocount = 0\r\ntest = False\r\nif len(string) == 5:\r\n if string == \"hello\":\r\n test = True\r\nelse:\r\n for letter in string:\r\n if(letter == 'h'):\r\n hcount+=1\r\n elif(letter == 'e' and hcount > 0):\r\n ecount+=1\r\n elif(letter == 'l' and ecount > 0):\r\n lcount+=1\r\n elif(letter == 'o' and lcount >= 2):\r\n ocount+=1\r\n test = (hcount >= 1 and ecount >= 1 and lcount >= 2 and ocount >= 1)\r\nresponse = ('YES') if (test) else ('NO')\r\nprint(response)", "# 58A - Chat room\r\n# http://codeforces.com/problemset/problem/58/A\r\n\r\nimport re\r\ns = input()\r\nif re.match(r'.*h.*e.*l.*l.*o.*', s):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\n\r\nh = s.find('h')\r\ne = s.find('e', h+1)\r\nl1 = s.find('l', e+1)\r\nl2 = s.find('l', l1+1)\r\n\r\no= s.find('o', l2+1)\r\n# print(h, e, l1, l2, o)\r\n\r\nif h < e < l1 < l2 < o:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "def check(s):\r\n s1=\"hello\"\r\n j=0\r\n for i in s:\r\n if i==s1[j]:\r\n j+=1\r\n if j==5:\r\n return True\r\n return False\r\n\r\ns=input()\r\na=check(s)\r\nif a==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\"\"\"\r\nCreated on Sep 27 2023\r\n@author: 施广熠 2300012143\r\n\"\"\"\r\ns1=input()\r\ns2=\"hello\"\r\na=0\r\nfor i in range(5):\r\n if s2[i] in s1:\r\n s1=s1[s1.find(s2[i])+1:] #用赋值截取字符串\r\n a+=1\r\nif a==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nres = ''\r\nok1, ok2, ok3 = False, False, False\r\nfor c in s:\r\n if c == 'h' and 'h' not in res:\r\n res += 'h'\r\n ok1 = True\r\n elif c == 'e' and ('e' not in res) and ok1:\r\n res += 'e'\r\n ok2 = True\r\n elif c == 'l' and ('ll' not in res) and ok2:\r\n res += 'l'\r\n if('ll' in res):\r\n ok3 = True\r\n elif c == 'o' and ('o' not in res) and ok3:\r\n res += 'o'\r\n break\r\nif res == 'hello':\r\n print('YES')\r\nelse:\r\n print('NO')", "s=list(input())\r\ns1=[]\r\nfor x in s:\r\n if x in 'helo':\r\n s1.append(x)\r\ns1=''.join(s1)\r\ns2=''\r\nfor i in s1:\r\n if i=='e' or i=='l':\r\n s2=s1.strip(i)\r\n s1=s2\r\n elif i=='o':\r\n s2=s1.lstrip('o')\r\n s1=s2\r\n elif i=='h':\r\n s2=s1.rstrip('h')\r\n s1=s2\r\nif 'e' in s1 and s1.count('l',s1.index('e'))>=2 and 'h' in s1 and 'o' in s1 and s1[-1]=='o':\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nstep=0\r\nk=0\r\nc='hello'\r\nwhile(step<=4 and k<len(a)):\r\n flag=0\r\n for i in range(k,len(a)):\r\n if(a[i]==c[step]):\r\n step+=1\r\n k=i+1\r\n flag=1\r\n break\r\n if(flag==0):\r\n k=len(a)+1\r\n break\r\nif(k>len(a)or step<=4):\r\n print (\"NO\")\r\nelse:\r\n print (\"YES\")\r\n", "s=input()\r\nans=[]\r\nfor i in s:\r\n if(ans==['h','e','l','l','o']):\r\n break\r\n elif(i=='h' and ans==[]):\r\n ans.append(i)\r\n elif(i=='e' and ans==['h']):\r\n ans.append(i)\r\n elif(i=='l' and ans==['h','e']):\r\n ans.append(i)\r\n elif(i=='l' and ans==['h','e','l']):\r\n ans.append(i)\r\n elif(i=='o' and ans==['h','e','l','l']):\r\n ans.append(i)\r\nif(ans==['h','e','l','l','o']):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "a = ['h', 'e', 'l', 'l', 'o']\r\nb = input()\r\nh,e,l,o = 0,0,0,0\r\nc = []\r\nfor i in b:\r\n if i==\"h\" and h!=1:\r\n c.append(i)\r\n h+=1\r\n elif i==\"e\" and e!=1 and h==1:\r\n c.append(i)\r\n e+=1\r\n elif i==\"l\" and l!=2 and h==1 and e==1:\r\n c.append(i)\r\n l+=1\r\n elif i==\"o\" and o!=1 and h==1 and e==1 and l==2:\r\n c.append(i)\r\n o+=1\r\n\r\nif(a==c):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\na = input()\r\nx = 'hello'\r\ni5 = a.rfind('o') + 1\r\ni4 = a.rfind('l',0,i5-1) + 1\r\ni3 = a.rfind('l',0,i4-1) + 1\r\ni2 = a.rfind('e',0,i3-1) + 1\r\ni1 = a.rfind('h',0,i2-1) + 1\r\ni = i1*i2*i3*i4*i5\r\nprint('NO' if i == 0 else 'YES')", "import re\n\nst = input()\npattern = re.compile(r'(\\w+)?[h](\\w+)?[e](\\w+)?[l](\\w+)?[l](\\w+)?[o](\\w+)?')\n\nmatches = pattern.search(st)\n\nif matches==None: print(\"NO\")\nelse: print(\"YES\")\n", "s=str(input())\n\nn=int(0)\n\nwhile (n<len(s) and s[n]!='h'):\n n+=1\nn+=1\nwhile (n<len(s) and s[n]!='e'):\n n+=1\nn+=1\nwhile (n<len(s) and s[n]!='l'):\n n+=1\nn+=1\nwhile (n<len(s) and s[n]!='l'):\n n+=1\nn+=1\nwhile (n<len(s) and s[n]!='o'):\n n+=1\n\nif n<len(s):\n print(\"YES\")\nelse :\n print (\"NO\")", "x=input()\r\ny=\"hello\"\r\nr=0\r\nfor i in x:\r\n if i is y[r]:\r\n r+=1\r\n if r==5:\r\n break\r\nif r==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "hello=['h','e','l','l','o']\r\na=input()\r\nm=0\r\nfor i in range(len(a)):\r\n if m<5:\r\n if a[i]==hello[m]:\r\n m+=1\r\nif m==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "x=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nc=0\r\nz=input()\r\nfor i in z:\r\n if i==x[c]:\r\n c+=1\r\n if c>=5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "# 2EZ4MEGUMIN\n\ns = input()\nh = -1\ne = -1\nl1 = -1\nl2 = -1\no = -1\nfor i in range(len(s)):\n if s[i] == 'h':\n h = i\n break\nfor i in range(h + 1, len(s)):\n if s[i] == 'e':\n e = i\n break\nfor i in range(e + 1, len(s)):\n if s[i] == 'l':\n l1 = i\n break\nfor i in range(l1 + 1, len(s)):\n if s[i] == 'l':\n l2 = i\n break\nfor i in range(l2 + 1, len(s)):\n if s[i] == 'o':\n o = i\n break\nif h != -1 and e != -1 and l1 != -1 and l2 != -1 and o != -1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t \t\t\t \t \t\t\t\t \t\t", "s=input()\r\nn=len(s)\r\n\r\nh,e,l1,l2,o=float('-inf'),float('-inf'),float('-inf'),float('-inf'),float('-inf')\r\nif('h' not in s or 'e' not in s or 'o' not in s or s.count('l')<2):\r\n print(\"NO\")\r\n exit(0)\r\n\r\nh=s.index('h')\r\n\r\nfor i in range(len(s)):\r\n if(s[i]=='e' and i>h):\r\n e=i\r\n break\r\nfor i in range(len(s)):\r\n if(s[i]=='l' and i>e):\r\n l1=i\r\n break\r\n\r\nfor i in range(len(s)):\r\n if(s[i]=='l' and i>l1):\r\n l2=i \r\n break\r\nfor i in range(len(s)):\r\n if(s[i]=='o' and i>l2):\r\n o=i \r\n break\r\n#print(h,e,l1,l2,o)\r\nif((h<e) and (e<l1) and (l1<l2) and (l2<o)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nx=\"hello\"\r\nf=0\r\nl=0\r\nr=len(s)\r\nfor i in x:\r\n for j in range(l,r):\r\n if i==s[j]:\r\n l=j+1\r\n f+=1\r\n break;\r\nif f==len(x):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=iter(input())\r\nif all(c in s for c in 'hello'):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "s = input()\r\nflag_h, flag_e, flag_o = False, False, False\r\ncount_l = 0\r\nfor letter in s:\r\n if letter == 'h':\r\n flag_h = True\r\n elif letter == 'e' and flag_h:\r\n flag_e = True\r\n elif letter == 'l' and flag_h and flag_e:\r\n count_l += 1\r\n elif letter == 'o' and flag_h and flag_e and count_l >= 2:\r\n flag_o = True\r\n break\r\nif flag_o:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nhello = \"hello\"\r\nindex = 0\r\nfor char in s:\r\n if index < len(hello) and char == hello[index]:\r\n index += 1\r\nif index == len(hello):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=\"hello\"\r\ndef pp():\r\n b=0\r\n s=input()\r\n for i in range(len(s)):\r\n if s[i]==a[b]:\r\n b += 1\r\n if b==5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(pp()) ", "word = input()\r\nstring = \"hello\"\r\n\r\na, count = 0, 0\r\n\r\nfor i in range(len(word)):\r\n if string[a] == word[i]:\r\n a += 1\r\n count += 1\r\n if a > 4:\r\n break\r\n\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nl = len(s)\r\nc = 0\r\nfor i in range(0, l):\r\n if(c==0 and s[i]=='h'):c = c+1\r\n elif(c==1 and s[i]=='e'):c = c+1\r\n elif((c==2 or c==3) and s[i]=='l'):c = c+1\r\n elif(c==4 and s[i]=='o'):c = c+1\r\nif(c==5):print('YES')\r\nelse:print('NO')", "def hello(s):\r\n str=\"hello\"\r\n j=0\r\n for i in s:\r\n if j <= 4 and i == str[j]:\r\n j = j + 1\r\n if j > 4:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\ns=input()\r\nhello(s)\r\n", "s=\"hello\"\r\ni,ans=0,\"NO\"\r\nfor u in input():\r\n if u==s[i]:\r\n if i==4:\r\n ans=\"YES\"\r\n break\r\n i+=1\r\nprint(ans)\r\n", "s = input()\r\nw = \"hello\"\r\nj=0\r\nfor i in range(len(s)):\r\n if j == 5:\r\n print(\"YES\")\r\n break\r\n if s[i] == w[j]:\r\n j+=1\r\nelse:\r\n if j == 5:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "s = input()\r\nt = \"hello\"\r\ni = 0\r\nfor j in range(len(s)):\r\n if i==5:\r\n break\r\n if(t[i]==s[j]):\r\n i+=1\r\nprint(\"YES\") if i==5 else print(\"NO\")\r\n", "x = input()\r\nz = \"hello\"\r\ncounter = 0\r\nfor n in x:\r\n if n == z[counter]:\r\n counter += 1\r\n if counter == 5:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "s = input()\r\n\r\na = 0\r\nfor x in s:\r\n if a == 0 and x == 'h':\r\n a += 1\r\n elif a == 1 and x == 'e':\r\n a += 1\r\n elif a == 2 and x == 'l':\r\n a += 1\r\n elif a == 3 and x == 'l':\r\n a += 1\r\n elif a == 4 and x == 'o':\r\n a += 1\r\n break\r\nif a == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input(\"\")\r\ns=\"hello\"\r\nj=0\r\ns1=\"\"\r\nfor i in range(len(n)):\r\n if n[i]==s[j]:\r\n s1+=n[i]\r\n j+=1\r\n if j>len(s)-1:\r\n break\r\nif s1==s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nc='hello'\r\nj=0\r\n\r\nfor i in s:\r\n if i==c[j]:\r\n if j<5:\r\n j+=1\r\n if j==5:\r\n break\r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\ni=0\r\nflag=0\r\nwhile i<len(s):\r\n if s[i]=='h':\r\n flag=flag+1\r\n h=i \r\n break \r\n i=i+1\r\nif i<len(s)-1:\r\n i=h+1\r\n while i<len(s)-1:\r\n if s[i]=='e':\r\n flag=flag+1\r\n e=i\r\n break\r\n i=i+1\r\nif i<len(s)-1:\r\n i=e+1 \r\n while i<len(s):\r\n if s[i]=='l':\r\n flag=flag+1\r\n l1=i\r\n break\r\n i=i+1\r\nif i<len(s)-1:\r\n i=l1+1\r\n while i<len(s):\r\n if s[i]=='l':\r\n flag=flag+1\r\n l2=i\r\n break\r\n i=i+1\r\nif i<len(s)-1:\r\n i=l2+1\r\n while i<len(s):\r\n if s[i]=='o':\r\n flag=flag+1\r\n o=i\r\n break\r\n i=i+1\r\nif flag==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=list(input())\r\ny=\"YES\"\r\na=['h','e','l','l','o']\r\nfor i in a:\r\n\tif i in n:\r\n\t\twhile n[0]!=i:\r\n\t\t\tn.remove(n[0])\r\n\t\tn.remove(n[0])\r\n\telse:\r\n\t\ty=\"NO\"\r\n\t\tbreak\r\nprint(y)", "a = list(input())\r\nn = 0\r\nh = 'hello'\r\nfor i in range(len(a)):\r\n if a[i] == h[n]:\r\n n += 1\r\n if n >= 5:\r\n break\r\nif n >= 5: \r\n\tprint('YES')\r\nelse: \r\n\tprint('NO')", "word = input()\r\n\r\nindices = [0, 0, 0, 0, 0]\r\nhello = 'hello'\r\n\r\nfor char in word:\r\n if char == hello[indices[0]]:\r\n indices[0] += 1\r\n if indices[0] == 5:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 31 12:06:22 2021\r\n\r\n@author: rupert\r\n\"\"\"\r\nsysinput = input\r\ndef readchlist():\r\n s = sysinput()\r\n lst = list(s[:])\r\n try:\r\n lst.remove('\\n')\r\n finally:\r\n return(lst)\r\n \r\ns = readchlist()\r\nstartsearch = 0\r\noutput = 'YES'\r\nfor ch in 'hello':\r\n try:\r\n startsearch = s.index(ch,startsearch) + 1\r\n except:\r\n output = 'NO'\r\nprint(output)", "s = input()\r\na = 'hello'\r\nx = 0\r\nans = True\r\n\r\nfor i in a:\r\n x = s.find(i, x)\r\n if x == -1:\r\n ans = False\r\n break\r\n else:\r\n x += 1\r\n\r\nprint('YES' if ans else 'NO')\r\n", "s = input()\r\ns1=s.find('h')\r\ns2=s.find('e',s1+1)\r\ns3=s.find('l',s2+1)\r\ns4=s.find('l',s3+1)\r\ns5=s.find('o',s4+1)\r\na1= (s1+s2+s3+s4+s5) / (abs(s1)+abs(s2)+abs(s3)+abs(s4)+abs(s5))\r\na2= (s1+s2+s3+s4+s5) / (s1+s2+s3+s4+s5)\r\nr = a1 == a2\r\nprint(str(r).replace('True','YES').replace('False','NO'))\r\n\r\n\r\n \r\n", "from re import search\r\nmessage=str(input())\r\nprint(\"YES\" if search(r'h+.*e+.*l+.*l+.*o+',message) else \"NO\")", "s=\"hello\"\r\ns1=input()\r\ns2=\"\"\r\np1=0\r\nfor i in range(len(s1)):\r\n if p1 > 4:\r\n break\r\n if s1[i] == s[p1]:\r\n s2+=s[p1]\r\n p1+=1\r\nif s2 == s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n", "# https://codeforces.com/problemset/problem/58/A\r\n\r\ns = list(input())\r\n\r\nword = ['h', 'e', 'l', 'l', 'o']\r\ncounter = 0\r\n\r\n# for char in word:\r\n# if char in s:\r\n# counter += 1\r\n# s.remove(char)\r\n\r\n# if counter == 5 and len(s) >= 2:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n\r\n\r\nfor char in word:\r\n for letter in s:\r\n if char != letter:\r\n s = s[1:]\r\n else:\r\n s = s[1:]\r\n counter += 1\r\n break\r\n\r\nif counter == 5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\n\r\nsisend_1 = sys.stdin.readline().strip()\r\n\r\nsona = ['h','e','l','l','o']\r\n\r\nvastus = ''\r\n\r\nk = 0\r\nfor i in sisend_1:\r\n if k >= len(sona):\r\n break\r\n if i == sona[k]:\r\n k+=1\r\n vastus += i\r\n \r\nvaljund = ''.join(map(str,sona))\r\nif valjund == vastus:\r\n sys.stdout.write('YES')\r\nelse:\r\n sys.stdout.write('NO')\r\n#sys.stdout.write(valjund) \r\n#sys.stdout.write(vastus)\r\n", "s=input().strip()\r\nif len(s) > 100 or len(s) < 1 : \r\n raise ValueError('out of range') \r\nhello = ['h','e','l','o']\r\nnum = 0\r\nfor i in hello : \r\n if i in s : \r\n num +=1 \r\nf_h = s.find('h')\r\nf_e = s.find('e',f_h)\r\nf_l = s.find('l',f_e)\r\ns_l = s.find('l',f_l+1)\r\nf_o = s.find('o',s_l)\r\nif num == 4 and s.count('l') >=2 :\r\n if f_h < f_e < f_l < s_l < f_o : \r\n print('YES')\r\n else : \r\n print('NO')\r\nelse : \r\n print('NO')\r\n\r\n\r\n", "# 1) Input and variables\r\nstring = input()\r\ncount = 0\r\nhello = 'hello'\r\nindex = 0\r\n\r\nfor letter in string:\r\n if letter == hello[index]:\r\n index += 1\r\n count += 1\r\n if count == 5:\r\n break\r\n\r\nif count == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "i, w = 0, 'hello '\r\n\r\nfor c in input():\r\n if c == w[i]:\r\n i += 1\r\n \r\nprint('YES' if i == 5 else 'NO')", "inpt1=str(input())\nstring1=\"hello\"\nj=0\nfor i in range(len(inpt1)):\n if inpt1[i]==string1[j]:\n j=j+1\n if j==5:\n print(\"YES\")\n break\nelse:\n\tprint(\"NO\")\n \t \t\t \t\t \t\t\t\t \t \t\t", "y=(input())\r\nc=0;c1=0\r\nx=\"hello\"\r\na=0;b=0;c=0;d=0;e=0\r\nif \"h\"in y and \"e\"in y and \"l\"in y and \"l\"in y and \"e\"in y:\r\n a=y.find(\"h\");b=y.find(\"e\",a+1);c=y.find(\"l\",b+1);d=y.find(\"l\",c+1);e=y.find(\"o\",d+1)\r\n# print(a,b,c,d,e)\r\nif a<b<c<d<e:\r\n \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s=input()\r\nh=s.find('h')\r\ne=s.find('e',h)\r\nl=s.find('l',e)\r\nj=s.find('l',l+1)\r\no=s.find('o',j)\r\n\r\nif (h<e)&(e<l)&(l<j)&(j<o):\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\narray = []\r\n\r\nfor i in s:\r\n if i == \"h\" and array == []:\r\n array += [i]\r\n if i == \"e\" and array == ['h']:\r\n array += [i]\r\n if i == \"l\" and (array == ['h','e'] or array == ['h','e','l']):\r\n array += [i]\r\n if i == \"o\" and array == ['h','e','l','l']:\r\n array += [i]\r\n\r\nif len(array) == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nif 'h' in s:\r\n H = s.index('h')\r\n if 'e' in s[H+1:]:\r\n E = s.index('e',H+1)\r\n if 'l' in s[E+1:]:\r\n L = s.index('l',E+1)\r\n if 'l' in s[L+1:]:\r\n L2 = s.index('l',L+1)\r\n if 'o' in s[L2:]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n else:\r\n print(\"NO\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nt = \"hello\"\r\n\r\ncount = 0\r\npoi = 0\r\nfor i in range(len(s)):\r\n if s[i] == t[poi]:\r\n poi += 1\r\n if poi == 5:\r\n count += 1\r\n break\r\nif count == 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "a=iter(input());print('NYOE S'[all(c in a for c in 'hello')::2])", "Into = str(input())\r\nInto = list(Into)\r\nhello = ['h','e','l','l','o']\r\ncur = 0\r\nlist1 = []\r\nfor i in Into:\r\n if i == hello[cur]:\r\n list1.append(i)\r\n cur+=1\r\n if len(list1) == 5:\r\n break\r\nif list1 == hello:\r\n print('YES')\r\nelse:\r\n print('NO')", "letters = ['h', 'e', 'l', 'l', 'o']\r\n \r\nstring = input()\r\n \r\nfor i in string:\r\n if len(letters) == 0:\r\n break\r\n \r\n if i == letters[0]:\r\n letters.pop(0)\r\n\r\nif (len(letters) == 0):\r\n print('YES')\r\nelse:\r\n print('NO')", "word = input()\r\nws = ['h','e','l','l','o']\r\nfor i in word:\r\n if len(ws)==0:\r\n break\r\n if i == ws[0]:\r\n ws.remove(i)\r\nif len(ws) == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\ndef found(s, nach, char):\r\n\tfor i in range (nach, len(s)):\r\n\t\tif(s[i] == char):\r\n\t\t\treturn i\r\n\treturn -1\r\nstart = 0;\r\nit = 0;\r\nfor i in \"hello\":\r\n\tif(found(s, start, i) == -1):\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\n\tif(found(s, start, i) == len(s) - 1 and it < 4):\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\n\tstart = found(s, start, i) + 1\r\n\tit = it + 1\r\nif(it == 5):\r\n\tprint(\"YES\")", "s = input()\r\nq = \"hello\"\r\nk = 0\r\nfor i in s:\r\n if i == q[k]:\r\n k += 1\r\n if k == 5:\r\n break\r\nprint([\"NO\", \"YES\"][k == 5])", "s =input().lower()\r\nh=s.find('h')\r\ne=s.find('e',h)\r\nl=s.find('l',e)\r\nl2=s.find('l',l+1)\r\no=s.find('o',l2)\r\nif(h<e<l<l2<o):\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\ns=s[::-1]\r\ncounter=0\r\nchar='o'\r\n\r\nfor i in s:\r\n if i==char and counter<3:\r\n counter +=1\r\n char='l'\r\n if counter==3:\r\n char='e'\r\n elif i==char and counter<5:\r\n counter +=1\r\n char='h'\r\n \r\nif counter==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "str=input().strip()\r\nhello=\"hello\"\r\nj=0\r\nfor i in range(len(str)):\r\n if j<= len(hello)-1 and str[i]==hello[j] :\r\n j+=1\r\nif j==len(hello):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "# URL: https://codeforces.com/problemset/problem/58/A\nw = ['h', 'e', 'l', 'l', 'o']\nfor ch in input():\n if w[0] == ch:\n w.pop(0)\n if not w:\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n", "def can_say_hello(word):\r\n target_word = \"hello\"\r\n target_index = 0\r\n for char in word:\r\n if char == target_word[target_index]:\r\n target_index += 1\r\n if target_index == len(target_word):\r\n return True\r\n\r\n return False\r\nword = input()\r\nif can_say_hello(word):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "ss=input()\r\na,c=0,0\r\nfor i in 'hello':\r\n for j in range(a,len(ss)):\r\n a+=1\r\n if ss[j]==i:\r\n c+=1\r\n break\r\n continue\r\n\r\nif c==5:\r\n print('YES')\r\nelse:\r\n print('NO')", "x=input()\r\n\r\ns='hello'\r\n\r\nj=0\r\n\r\nfor i in x:\r\n if i==s[j]:\r\n j+=1\r\n if j==5:\r\n break\r\n \r\nif j==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input()\r\nm = \"hello\"\r\nj = 0\r\nf = 0\r\nfor i in range(len(n)):\r\n if n[i] == m[j]:\r\n j+=1\r\n if j==5:\r\n print(\"YES\")\r\n f = 1\r\n break\r\nif f==0:\r\n print(\"NO\")", "char = input()\ncharReal = \"hello\"\ni,j = 0,0\nwhile i<len(char) and j<len(charReal):\n if char[i] == charReal[j]:\n j+=1\n i+=1 \nif j == len(charReal):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t \t \t\t \t\t \t \t\t \t", "\r\ns= input()\r\nwords = ['h','e','l','l','o']\r\nl = 0 \r\ni = 0 \r\nwhile i < len(s) and l < len(words):\r\n if s[i] == words[l]:\r\n l+=1\r\n i+=1\r\nif l >= len(words):\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input().lower()\r\ns1=\"hello\"\r\nj=0\r\ncount=0\r\nfor t in range (0,int(len(s))):\r\n if s[t]==s1[j]:\r\n j+=1\r\n count+=1\r\n if count==5:\r\n break \r\nif count ==5:\r\n print (\"YES\") \r\nelse:\r\n print (\"NO\") ", "inp = input()\r\n\r\nword = ['h', 'e', 'l', 'l', 'o']\r\n\r\ntesting = 0\r\n\r\nfor al in inp:\r\n if al==word[testing]:\r\n testing+=1\r\n if testing==5:\r\n print('YES')\r\n break\r\n \r\nif testing<5:\r\n print('NO')", "s = input().lower()\r\nh = False\r\ne = False\r\nl = False\r\no = False\r\nfor v in range(len(s)):\r\n if s[v] == 'h':\r\n h = True\r\n for w in range(v+1,len(s)):\r\n if s[w] == 'e':\r\n e = True\r\n for x in range(w+1,len(s)):\r\n if s[x] == 'l':\r\n for y in range(x+1,len(s)):\r\n if s[y] == 'l':\r\n l = True\r\n for z in range(y+1,len(s)):\r\n if s[z] == 'o':\r\n o = True\r\n break\r\n break\r\n break\r\n break\r\n break\r\nif h and e and l and o:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#!/usr/bin/python3\n\nword = input()\n\ntarget = 'hello'\n\nl = 0\n\nfor i in word:\n\tif target[l] == i:\n\t\tl+=1\n\tif l >= len(target):\n\t\tbreak\n\nif l >= len(target):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "mystr=input()\nlength=len(mystr)\n\npos1=mystr.find('h')\npos2=mystr.find('e',pos1+1,length)\npos3=mystr.find('l',pos2+1,length)\npos4=mystr.find('l',pos3+1,length)\npos5=mystr.find('o',pos4+1,length)\n\nif(pos1>=0 and pos2>=0 and pos3>=0 and pos4>=0 and pos5>=0):\n\tprint('YES')\nelse:\n\tprint('NO')\n", "word = input().lower()\nlen_word = len(word)\nword_list = list(word)\ntext = \"NO\"\nfor i in range(0, len_word):\n if word_list[i] == \"h\":\n for e in range(i + 1, len_word):\n if word_list[e] == \"e\":\n for t in range(e + 1, len_word):\n if word_list[t] == \"l\":\n for m in range(t + 1, len_word):\n if word_list[m] == \"l\":\n for n in range(m + 1, len_word):\n if word_list[n] == \"o\":\n text = \"YES\"\nprint(text)\n", "enter = input()\nword = 'hello'\nnext_sym = 'e'\nfirst_iter = False\ncurr_sym_index = 1\n\nfor s in enter:\n if s == 'h' and not first_iter:\n first_iter = True\n if first_iter:\n if s == next_sym:\n if s == 'o':\n print('YES')\n break\n curr_sym_index += 1\n next_sym = word[curr_sym_index]\nelse:\n print('NO')\n", "from bisect import bisect_right, bisect_left\r\nfrom math import inf, gcd, sqrt, ceil, log2\r\nfrom collections import defaultdict, Counter\r\nfrom functools import cache, lru_cache\r\nfrom tkinter import W\r\nrvar = lambda: map(int, input().split())\r\nrarr = lambda: list(map(int, input().split()))\r\nrstr = lambda: input().split()\r\nrint = lambda: int(input())\r\n \r\n'''Speed up'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ns = input().strip()\r\n\r\np = \"hello\"\r\n\r\nj = 0\r\n\r\nfor c in s:\r\n if j < 5 and p[j] == c:\r\n j += 1\r\n\r\nprint(\"YES\" if j == 5 else \"NO\")", "s=input()\r\na=\"\"\r\nb=\"hello\"\r\ncount=0\r\nfor i in s:\r\n if b[count]==i:\r\n a+=i\r\n\r\n count+=1\r\n if count==5:\r\n break\r\nif a==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\r\nl=len(s)\r\nhello='hello'\r\nj=0\r\nx=0\r\nfor i in range(l):\r\n if j==5:\r\n break\r\n if hello[j]==s[i]:\r\n x=1\r\n j+=1\r\n else:\r\n x=0\r\nif j==5 and x:\r\n print('YES')\r\nelse:\r\n print('NO')", "inp = input()\r\ninp2 = \"hello\"\r\n\r\ncount = 0\r\n\r\nfor i in inp:\r\n if i in inp2[count]:\r\n count+=1\r\n if count == 5:\r\n break\r\n\r\nprint(\"YES\" if count == 5 else \"NO\")", "hello = list('hello!')\r\nqus = list(input())\r\ni = 0\r\nfor x in range(len(qus)):\r\n if i == 5:\r\n break\r\n elif qus[x] == hello[i]:\r\n i += 1\r\nprint(\"YES\" if i == 5 else \"NO\")\r\n", "s=input().lower()\r\nnew='hello'\r\nk=0\r\nfor i in s:\r\n if k==5:\r\n break;\r\n if i==new[k]:\r\n k+=1\r\nif k==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nword = 'hello'\r\nl = len(s)\r\ncnt = 0\r\nn = 0\r\nfor i in range (l):\r\n\tif s[i]==word[n]:\r\n\t\tcnt+=1\r\n\t\tn+=1\r\n\tif cnt==5:\r\n\t\tbreak\r\nif cnt==5:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "string=input()\r\nword='hello'\r\nstack=['h', 'e', 'l', 'l', 'o']\r\nfor x in string[-1::-1]:\r\n if len(stack)==0:\r\n break\r\n if x==stack[-1]:\r\n stack.pop()\r\nif len(stack)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s = input()\r\nhello = \"hello\"\r\npointer = 0\r\n\r\nfor c in s:\r\n if c == hello[pointer]:\r\n pointer +=1\r\n if pointer == len(hello):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "st=input()\r\ns=['h','e','l','l','o']\r\nind=0\r\nfor i in range(len(st)):\r\n try:\r\n if(st[i]==s[ind]):\r\n ind+=1\r\n except:\r\n break\r\nif(ind==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_hello(word: str) -> bool:\n hello = \"hello\"\n j = 0\n\n # O(n)\n for i in range(len(word)):\n if word[i] == hello[j]:\n j += 1\n if j == len(hello):\n return True\n \n return False\n\n\nif __name__ == \"__main__\":\n word = input()\n\n answer = \"YES\" if is_hello(word) else \"NO\"\n print(answer)\n \t \t \t \t \t \t \t\t\t \t\t\t\t\t \t\t", "s = input()\r\nc = \"hello\"\r\nn = len(s)\r\ni, j = 0, 0\r\nwhile i < 5 and j < n:\r\n if c[i] == s[j]:\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "st=input()\r\nct1=st.find('h')\r\nst=st[ct1+1:]\r\nct2=st.find('e')\r\nst=st[ct2+1:]\r\nct3=st.find('l')\r\nst=st[ct3+1:]\r\nct4=st.find('l')\r\nst=st[ct4+1:]\r\nct5=st.find('o')\r\nif ct1==-1 or ct2==-1 or ct3==-1 or ct4==-1 or ct5==-1:\r\n print(\"NO\")\r\n \r\nelse:\r\n print(\"YES\")\r\n'''print(ct1)\r\nprint(ct2)\r\nprint(ct3)\r\nprint(ct4)\r\nprint(ct5)'''", "s = list(input())\nhfalse = False\nefalse = False\nlfalse = False\nlfalse2 = False\nofalse = False\nlcount = 0\nfor i in range(len(s)):\n done = False\n if s[i] == \"h\" and hfalse == False:\n hfalse = True\n if hfalse == True and s[i] == \"e\":\n efalse = True\n if efalse == True and s[i] == \"l\":\n lfalse = True\n lcount +=1\n if lfalse == True and s[i] == \"l\" and lcount > 1:\n lfalse2 = True\n if lfalse2 == True and s[i] == \"o\":\n ofalse = True\n\nif ofalse == True:\n print(\"YES\")\nelse:\n print(\"NO\")", "import re\r\nprint('YES' if re.match('.*h.*e.*l.*l.*o.*',input()) else 'NO')\r\n", "s=input()\r\nt='hello'\r\nj=0\r\nc=0\r\nfor i in range(len(s)):\r\n if(s[i]==t[j]):\r\n c+=1\r\n j+=1\r\n if(c>=5):\r\n print('YES')\r\n break\r\nif(c<5):\r\n print('NO')\r\n ", "hello = \"hello\"\r\nj = 0\r\ns = input()\r\n\r\nfor i in range(len(s)):\r\n if(j < 5 and s[i] == hello[j]):\r\n j += 1\r\nif(j == 5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def vasya_says_hello(s):\r\n expected = \"hello\"\r\n idx = 0\r\n\r\n for char in s:\r\n if char == expected[idx]:\r\n idx += 1\r\n if idx == len(expected):\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\ndef main():\r\n s = input().strip()\r\n result = vasya_says_hello(s)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\r\nword = ['h', 'e', 'l', 'l', 'o']\r\na = -1\r\nfor i in word:\r\n a = s.find(i, a+1)\r\n if a == -1:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')", "A = input()\na = 0\nfor i in range(0,len(A)):\n if A[i] =='h' and (len(A) - i-1) >=4:\n for j in range(i+1,len(A)):\n if A[j] == 'e' and (len(A)-j-1)>=3:\n for l in range(j+1,len(A)):\n if A[l] == 'l' and (len(A)-l-1)>=2:\n for k in range(l+1,len(A)):\n if A[k] == 'l' and (len(A)-k-1)>=1:\n for n in range(k+1,len(A)):\n if A[n] == 'o' :\n a = 1\nif a == 1:\n print('YES')\nelse:\n print('NO')\n \n \n ", "s = str(input())\r\nh = 0\r\ne = 0\r\nl1 = 0\r\nl2 = 0\r\no = 0\r\nif 'h' in s:\r\n s = s[s.find('h'):]\r\n h = 1\r\nif 'e' in s:\r\n s = s[s.find('e'):]\r\n e = 1\r\nif 'l' in s:\r\n s = s[s.find('l')+1:]\r\n l1 = 1\r\nif 'l' in s:\r\n s = s[s.find('l'):]\r\n l2 = 1\r\nif 'o' in s:\r\n s = s[s.find('o'):]\r\n o = 1\r\n\r\nif h == 1 and e == 1 and l1 == 1 and l2 == 1 and o == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\r\ns = input()\r\nptt = r\"h[a-z]*e[a-z]*l[a-z]*l[a-z]*o\"\r\nif re.search(ptt, s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "raw=input()\r\nnum=len(raw)\r\ncha=[]\r\nA,B,C,D,E=[],[],[],[],[]\r\nitems=[]\r\ngoods=[]\r\nkeys=[]\r\nfor i in range(num):\r\n cha.append(raw[i])\r\nfor a in range(num):\r\n if cha[a]=='h':\r\n A.append(a)\r\nfor b in range(num):\r\n if cha[b]=='e':\r\n B.append(b)\r\nfor c in range(num):\r\n if cha[c]=='l':\r\n C.append(c)\r\nfor d in range(num):\r\n if cha[d]=='o':\r\n D.append(d)\r\nif len(A)>0 and len(B)>0 and len(D)>0 and len(C)>1:\r\n for item in B:\r\n if item> min(A):\r\n items.append(item)\r\n if len(items)>0:\r\n for one in C:\r\n if one > min(items):\r\n goods.append(one)\r\n if len(goods)>1:\r\n for key in D:\r\n if key>goods[1]:\r\n keys.append(key)\r\n if len(keys)>0:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print(\"NO\")", "def findHello(string):\r\n goal = \"hello\"\r\n pointer = goal[0]\r\n\r\n\r\n j = 0\r\n for i in string:\r\n if i == pointer:\r\n try:\r\n pointer = goal[j+1]\r\n except:\r\n return \"YES\"\r\n j += 1\r\n\r\n return 'NO'\r\n\r\n\r\nstring = input() \r\nprint (findHello(string))\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n", "a = input()\r\nn = len(a)\r\nif (a.count('h') > 0)+(a.count('e') > 0)+(a.count('o') > 0)+(a.count('l') > 1)!=4:\r\n print('NO')\r\nelse:\r\n s = ['h','e','l','l','o']\r\n t = 0\r\n for i in range(n):\r\n if s[t] == a[i]:\r\n t += 1\r\n if t == 5:\r\n print('YES')\r\n break\r\n if t<5:\r\n print('NO')", "s = input()\r\nl = [*'hello']\r\nf = True\r\nfor i in s:\r\n\tif l[0] == i:\r\n\t\tdel(l[0])\r\n\tif len(l) == 0 :\r\n\t\tbreak\r\nelse:\r\n\tprint('NO')\r\n\tf = False \r\nif f:\r\n\tprint('YES')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Nov 16 18:56:55 2022\r\n\r\n@author: SaltLyy\r\n\"\"\"\r\n\r\nimport re;\r\nprint(\"YES\"if re.search(\"h.*e.*l.*l.*o\",input())else\"NO\")\r\n\r\n\r\n\r\n \r\n\r\n", "w = input()\r\nnx = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nfor l in w:\r\n if l==nx[0]:\r\n del nx[0]\r\n if len(nx)==0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "x = input()\r\nq = False\r\nfor i in x:\r\n\tif i==\"h\":\r\n\t\tx = x[x.index(i)+1:]\r\n\t\tif len(x)==0: break\r\n\t\tfor j in x:\r\n\t\t\tif j==\"e\":\r\n\t\t\t\tx = x[x.index(j)+1:]\r\n\t\t\t\tif len(x)==0: break\r\n\t\t\t\tfor k in x:\r\n\t\t\t\t\tif k==\"l\":\r\n\t\t\t\t\t\tx = x[x.index(k)+1:]\r\n\t\t\t\t\t\tif len(x)==0: break\r\n\t\t\t\t\t\tfor l in x:\r\n\t\t\t\t\t\t\tif l==\"l\":\r\n\t\t\t\t\t\t\t\tx = x[x.index(l)+1:]\r\n\t\t\t\t\t\t\t\tif len(x)==0: break\r\n\t\t\t\t\t\t\t\tfor m in x:\r\n\t\t\t\t\t\t\t\t\tif m==\"o\":\r\n\t\t\t\t\t\t\t\t\t\tx = x[x.index(m):]\r\n\t\t\t\t\t\t\t\t\t\tq = True\r\n\t\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tbreak\r\n\t\tbreak\r\nif q: print(\"YES\")\r\nelse: print(\"NO\")", "n = input()\r\ns = []\r\nfor i in n:\r\n s.append(i)\r\nx = 0\r\nif 'h' in s:\r\n s = s[s.index('h'):]\r\n x += 1\r\nif 'e' in s:\r\n s = s[s.index('e'):]\r\n x += 1\r\nif 'l' in s:\r\n s = s[s.index('l'):]\r\n s[s.index('l')] = 'M'\r\n x += 1\r\nif 'l' in s:\r\n s = s[s.index('l'):]\r\n x += 1\r\nif 'o' in s:\r\n s = s[s.index('o'):]\r\n x += 1\r\nif x == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "def is_subsequence(subsequence, string):\r\n n, m, i, j = len(subsequence), len(string), 0, 0\r\n while i < n and j < m:\r\n if subsequence[i] == string[j]:\r\n i += 1\r\n j += 1\r\n \r\n return i == n\r\n\r\nstring = input()\r\nprint(\"YES\" if is_subsequence(\"hello\", string) else \"NO\")", "s=input()\r\nif('h'in s):\r\n\tindex_h=s.index('h')\r\n\ts=s[index_h+1:]\r\n\tif('e'in s):\r\n\t\tindex_e=s.index('e')\r\n\t\ts=s[index_e+1:]\r\n\t\tif('l'in s):\r\n\t\t\tindex_l=s.index('l')\r\n\t\t\ts=s[index_l+1:]\r\n\t\t\tif('l'in s):\r\n\t\t\t\tindex_l=s.index('l')\r\n\t\t\t\ts=s[index_l+1:]\r\n\t\t\t\tif('o'in s):\r\n\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\texit()\r\nprint(\"NO\")", "word= input()\r\ns='hello'\r\nc=0\r\nfor i in range(len(word)):\r\n if word[i]==s[c]:\r\n c=c+1\r\n if c==5:\r\n break\r\nif c==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "typed = input()\r\ncorrect = 'hello'\r\nanswer = 'NO'\r\nfor curletter in typed:\r\n if correct != '' and curletter == correct[0]:\r\n correct = correct[1:]\r\nif len(correct) == 0:\r\n answer = 'YES'\r\nprint(answer)", "import re\r\nprint(['YES','NO'][re.search('h.*e.*l.*l.*o',input())==None])", "s=input()\ni=0\nz=\"\"\nfor n in s:\n if n=='h':\n z+=n\n i+=1\n break\n else:\n i+=1\nfor n in s[i:]:\n if n=='e':\n z+=n\n i+=1\n break\n else:\n i+=1\n\nfor n in s[i:]:\n if n=='l':\n z+=n\n i+=1\n break\n else:\n i+=1\nfor n in s[i:]:\n if n=='l':\n z+=n\n i+=1\n break\n else:\n i+=1\nfor n in s[i:]:\n if n=='o':\n z+=n\n break\nif z==\"hello\":\n print(\"YES\")\nelse:\n print(\"NO\")", "s=input()\r\nl=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\ni=0\r\nfor c in s:\r\n if i==5:\r\n break\r\n if c.lower() == l[i]:\r\n i+=1\r\nif i==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# CP Template 0.2\r\n# Author: Mehrab (@to0th_less)\r\n\r\nimport sys\r\nfrom math import gcd, sqrt\r\nfrom itertools import combinations, permutations\r\n\r\n# Constants\r\nINF = float('inf')\r\nMOD = 1000000007\r\n\r\n# Faster Input Shortcut\r\ndef read_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\ndef read_ints():\r\n return map(int, sys.stdin.readline().split())\r\n\r\ndef read_int_list():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n# Faster Output Shortcut\r\ndef print_yes_no(condition):\r\n print('YES' if condition else 'NO')\r\n\r\ndef print_array(arr, sep=' '):\r\n print(sep.join(map(str, arr)))\r\n\r\n# Main Function\r\ndef solve():\r\n s = input()\r\n\r\n ans = iter(list(\"hello\"))\r\n current = next(ans)\r\n nxt = None\r\n flag = False\r\n\r\n# ahhelllloou\r\n\r\n for i in s:\r\n if nxt != None:\r\n if i == current:\r\n if i == nxt and i=='l':\r\n current = nxt\r\n nxt = next(ans)\r\n else:\r\n continue \r\n elif i == nxt:\r\n current = nxt\r\n if current == 'o':\r\n flag = True \r\n break\r\n else:\r\n nxt = next(ans)\r\n\r\n else:\r\n if i == current:\r\n nxt = next(ans)\r\n \r\n \r\n print_yes_no(flag)\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n\r\n", "s=input()\r\n\r\nh='hello'\r\n\r\na=0\r\nfor i in range(len(s)):\r\n if s[i] == h[a]:\r\n a+=1\r\n if a==5:\r\n break\r\nif a==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nans = 'YES'\r\na = 'hello'\r\nj = 0\r\nfor i in range(len(a)):\r\n if a[i] not in s[j::]:\r\n print('NO')\r\n exit()\r\n else:\r\n s = s[j::]\r\n j = s.index(a[i]) + 1\r\nprint(ans)\r\n", "s=input()\r\ns=s.translate(str.maketrans('','','qwrtyuipasdfgjkzxcvbnm'))\r\na=0\r\nfor i1 in range(len(s)):\r\n if s[i1]=='h':\r\n for i2 in range(i1+1,len(s)):\r\n if s[i2]=='e':\r\n for i3 in range(i2+1,len(s)):\r\n if s[i3]=='l':\r\n for i4 in range(i3+1,len(s)):\r\n if s[i4]=='l':\r\n for i5 in range(i4+1,len(s)):\r\n if s[i5]=='o':\r\n print('YES')\r\n a=1\r\n break\r\n else: pass\r\n break\r\n else: pass\r\n break\r\n else: pass\r\n break\r\n else: pass\r\n break\r\n else: pass\r\nif a!=1:\r\n print('NO')\r\nelse: pass\r\n", "s = iter(input())\ncomp = \"hello\"\nprint(\"YES\" if all([c in s for c in comp]) else \"NO\")\n", "send = str(input())\r\nhello = \"hello\"\r\n\r\nn = 0\r\n\r\nfor i in send:\r\n if i == hello[n]:\r\n n += 1\r\n if n == 5:\r\n print(\"YES\")\r\n break\r\n\r\nif n < 5:\r\n print(\"NO\")\r\n", "x=input()\r\nans=0\r\nfor i in x:\r\n if(ans==0 and i==\"h\"):\r\n ans+=1\r\n continue\r\n if(ans==1 and i==\"e\"):\r\n ans+=1\r\n continue\r\n if(ans==2 and i==\"l\"):\r\n ans+=1\r\n continue\r\n if(ans==3 and i==\"l\"):\r\n ans+=1\r\n continue\r\n if(ans==4 and i==\"o\"):\r\n ans+=1\r\n continue\r\nif(ans==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nword = \"hello\"\r\nfrom collections import OrderedDict\r\nptr = 0\r\nfor letter in s:\r\n if letter == word[ptr]:\r\n ptr+=1\r\n if ptr==5:\r\n break\r\nif ptr == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nif \"h\" in s:\r\n i=s.index(\"h\")\r\n s=s[i+1:]\r\n if \"e\" in s:\r\n j=s.index(\"e\")\r\n s=s[j+1:]\r\n if \"l\" in s:\r\n k=s.index(\"l\")\r\n s=s[k+1:]\r\n if \"l\" in s:\r\n a=s.index(\"l\")\r\n s=s[a+1:]\r\n if \"o\" in s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "text = \"hello\"\r\ns = input().lower()\r\ni = j = 0\r\nwhile j != len(s):\r\n if s[j] == text[i]: \r\n i += 1\r\n if i == len(text): break\r\n j += 1\r\nif i == len(text): print(\"YES\")\r\nelse: print(\"NO\")", "\r\nword = input(\"\")\r\n\r\nhl = []\r\nel = []\r\nll = []\r\nll2 = [] \r\nol = []\r\nlol = 0\r\ndecision = []\r\nfor i in range(len(word)):\r\n if word[i] == \"h\":\r\n hl.append(i)\r\n elif word[i] == \"e\":\r\n el.append(i)\r\n elif word[i] == \"l\" and lol == 0:\r\n ll.append(i)\r\n lol = 1\r\n elif word[i] == \"l\" and lol == 1:\r\n ll2.append(i)\r\n lol = 0\r\n elif word[i] == \"o\":\r\n ol.append(i)\r\n\r\nfor x in range(len(hl)):\r\n for x2 in range(len(el)):\r\n for x3 in range(len(ll)):\r\n for x4 in range(len(ll2)):\r\n for x5 in range(len(ol)):\r\n if hl[x] < el[x2] < ll[x3] < ll2[x4] < ol[x5]:\r\n decision.append(\"y\")\r\n else:\r\n decision.append(\"n\")\r\n\r\n\r\nif decision.count(\"y\") >= 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import re\r\np=input()\r\ns=re.compile(r'.*h.*e.*l.*l.*o.*')\r\nif re.match(s,p):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s = input()\r\n\r\nword = 'hello'\r\nbuilt = \"\"\r\nindex = 0\r\nfor i in s:\r\n\r\n## print(f'{i}: {word[index]}')\r\n if(built == word):\r\n print('YES')\r\n quit()\r\n if(i in word):\r\n if(i == word[index]):\r\n## print(i)\r\n built += i\r\n index += 1\r\n else:\r\n pass\r\n\r\n if(built == word):\r\n print('YES')\r\n quit()\r\n\r\nprint('NO')", "s = input()\r\nh = \"hello\"\r\nn=0\r\n\r\nfor i in range(len(s)):\r\n if s[i] == h[n]:\r\n n+=1\r\n if n==5:\r\n break\r\n\r\nif(n==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "instr=input()\r\nflag=0\r\ns=\"hello\"\r\ncnt=0\r\nfor i in range(len(instr)):\r\n\tif instr[i]==s[cnt]:\r\n\t\tcnt+=1\r\n\tif cnt==5:\r\n\t\tflag=1\r\n\t\tbreak\r\nif flag:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "#Codeforce 58A\r\nx=input().strip(\"\\n\\r\")\r\ny=len(x)\r\nt=0\r\nans=\"\"\r\nfor i in range(y):\r\n if x[i] == \"h\":\r\n ans += \"h\"\r\n t=i\r\n break\r\nfor j in range(t+1,y):\r\n if x[j] == \"e\":\r\n ans += \"e\"\r\n t=j\r\n break\r\nfor k in range(t+1,y):\r\n if x[k] == \"l\":\r\n ans += \"l\"\r\n t=k\r\n break\r\nfor l in range(t+1,y):\r\n if x[l] == \"l\":\r\n ans += \"l\"\r\n t=l\r\n break\r\nfor m in range(t+1,y):\r\n if x[m] == \"o\":\r\n ans += \"o\"\r\n break\r\nif ans == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\nhello = \"hello\"\r\npointer = 0\r\n\r\nfor letter in s:\r\n if letter == hello[pointer]:\r\n pointer += 1\r\n if pointer == 5:\r\n print(\"YES\")\r\n break\r\nif pointer != 5:\r\n print(\"NO\")", "word=str(input())\r\nl=len(word)\r\nalist=[]\r\nfor i in range(l):\r\n alist.append(word[i])\r\nif \"h\" in alist and \"e\" in alist and \"l\" in alist and \"o\" in alist:\r\n m=alist.index(\"h\")\r\n alist.reverse()\r\n \r\n n=alist.index(\"o\")\r\n alist.reverse()\r\n \r\n if l-n-(m+1)>=4:\r\n alist=alist[m:l-n]\r\n \r\n l=len(alist)\r\n if \"e\" in alist and \"l\" in alist:\r\n m=alist.index(\"e\")\r\n alist.reverse()\r\n n=alist.index(\"l\")\r\n alist.reverse()\r\n if l-n-(m+1)>=2:\r\n alist=alist[m:l-n-1]\r\n \r\n if \"l\" in alist:\r\n kk=2\r\n else:\r\n kk=1\r\n else:\r\n kk=1\r\n else:\r\n kk=1\r\n else:\r\n kk=1 \r\nelse:\r\n kk=1\r\nif kk==1:\r\n print(\"NO\")\r\nelif kk==2:\r\n print(\"YES\")", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int,input().split()))\r\nfor _ in range(1):#nmbr()):\r\n s=input()\r\n n=len(s)\r\n s1='hello'\r\n p=p1=0\r\n while p<n and p1<5:\r\n if s[p]==s1[p1]:\r\n p+=1\r\n p1+=1\r\n else:p+=1\r\n print('YES' if p1==5 else 'NO')", "s = input()\r\nind = 0\r\ns1 = 0\r\nl = ['h', 'e', 'l', 'l', 'o']\r\nfor i in s:\r\n if i == l[ind]:\r\n ind += 1\r\n s1 += 1\r\n if s1 == 5:\r\n exit(print('YES'))\r\n\r\nprint('NO')\r\n", "# -*- coding: utf-8 -*-\r\nx=list(input())\r\ntry:\r\n h=x.index(\"h\")\r\n e=x.index(\"e\",h+1)\r\n if e:\r\n l1=x.index(\"l\",e+1)\r\n if l1:\r\n l2=x.index(\"l\",l1+1)\r\n if l2:\r\n o=x.index(\"o\",l2+1)\r\n if o:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n\r\nexcept ValueError:\r\n print(\"NO\")\r\n", "def hello(s):\r\n h = \"hello\"\r\n p = 0\r\n for i in s:\r\n if i == h[p]:\r\n p += 1\r\n if p == 5:\r\n return'YES'\r\n return'NO'\r\ns = input().strip()\r\nresult = hello(s)\r\nprint(result)", "string=input()\r\ntarget='hello'\r\ni=0\r\nout=''\r\nif string.count('h')<1 or string.count('e')<1 or string.count('l')<2 or string.count('o')<1:\r\n print('NO')\r\nelse:\r\n for char in string:\r\n if char==target[i]:\r\n i+=1\r\n if i==len(target):\r\n out+='YES'\r\n break\r\n if out=='YES':\r\n print('YES')\r\n else:\r\n print('NO')", "s=input()\r\nA=list(\"hello\")\r\nloc=-1\r\nflag=0\r\nfor i in A:\r\n loc=s.find(i,loc+1)\r\n if loc>-1:\r\n continue\r\n else:\r\n flag=1\r\n break\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "ans=\"hello\"\r\ntest=0\r\nl=list(input())\r\nfor i in range(len(l)):\r\n if l[i]==ans[test]:\r\n test+=1\r\n if test==5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "\"\"\"\n\n\"\"\"\nimport sys\ns = str(input())\nsa = \"hello\"\nj = 0\nfor i in range(len(s)):\n if(sa[j]==s[i]):\n j += 1\n if(j==len(sa)):\n print(\"YES\")\n sys.exit()\nprint(\"NO\")\n", "s=input()\r\nhello=\"hello\"\r\nindex=0\r\nfor l in s:\r\n if l==hello[index]:\r\n index+=1\r\n if index==len(hello):\r\n print(\"YES\")\r\n break\r\nif index!=len(hello):\r\n print(\"NO\")", "s = input()\r\nvowels = [\"A\",\"E\",\"I\",\"O\",\"U\",\"Y\",'a','e','i','o','u','y']\r\nhello = ['h','e','l','l','o']\r\n\r\npivot = 0\r\nfor i in range(0,len(s)):\r\n\r\n\tif s[i]==hello[pivot]:\r\n\t\tpivot+=1\r\n\tif pivot == 5:\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nif pivot!=5:\r\n\tprint(\"NO\")", "palavra = input()\n\nj = 0\nhello = ['h', 'e', 'l', 'l', 'o']\n\nfor letra in palavra:\n if letra == hello[j]:\n j += 1\n \n if j == 5: \n break\n\nif j == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t \t\t \t\t \t\t\t \t\t\t \t\t", "m = \"hello\"\r\n \r\ndef chatRoom():\r\n x = 0\r\n s = input()\r\n for i in range(len(s)):\r\n if s[i] == m[x]:\r\n x += 1\r\n if x == 5:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(chatRoom())", "import re\r\ntext = input().lower()\r\nresult = re.findall(r'h[\\w]*e[\\w]*l[\\w]*l[\\w]*o',text)\r\nprint(\"YES\") if (len(result) > 0) else print(\"NO\")", "def hello():\r\n x = input()\r\n lst = []\r\n for i in x:\r\n if i == \"h\":\r\n lst.append('1')\r\n elif i == \"e\":\r\n lst.append('2')\r\n elif i == \"l\":\r\n lst.append('3')\r\n elif i == \"o\":\r\n lst.append('5')\r\n\r\n temp = []\r\n temp2 = ['1', '2', '3', '3', '5']\r\n\r\n for i in temp2:\r\n if i not in lst:\r\n return \"NO\"\r\n\r\n y = lst.index('1')\r\n if lst.count('3') >= 2:\r\n for i in range(len(temp2)):\r\n for j in range(y, len(lst)):\r\n if temp2[i] == lst[j]:\r\n temp.append(j)\r\n y = j + 1\r\n break\r\n if len(temp) == 5:\r\n if temp == sorted(temp):\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n else:\r\n return \"NO\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\nprint(hello())\r\n", "s=input()\na=''\n\nfor i in s:\n if a=='' and i == 'h':\n a='h'\n elif a=='h' and i == 'e':\n a='he'\n elif a=='he' and i=='l':\n a='hel'\n elif a=='hel' and i=='l':\n a='hell'\n elif a=='hell' and i=='o':\n a='hello'\n break\nif a!='hello':\n print('NO')\nelse:\n print('YES')\n", "def linearsearch1(mylist,x,i):\n \n for i in range(i,len(mylist)):\n #print(\"in for\")\n if mylist[i]==x:\n \n return i\n \n return -1\n \n \n\ndef checkHello(mylist):\n mylist1=[]\n i=0\n for x in \"hello\":\n #print(x)\n \n idx=linearsearch1(mylist,x,i)\n if idx==-1:\n print(\"NO\")\n return\n \n i=idx+1\n #mylist1.append(idx)\n \n print(\"YES\")\n \n \n \nmystr=input()\nmylist=[]\nfor ch in mystr:\n mylist.append(ch)\n#print(mylist)\ncheckHello(mylist)", "s = input()\r\nhello = \"hello\"\r\ni = 0\r\nfor letter in s:\r\n if i>=len(hello): break\r\n if letter == hello[i]:\r\n i+=1\r\nif i==len(hello): print('YES')\r\nelse: print('NO')\r\n", "a = input()\r\nz = len(a) \r\np = 0\r\nif \"h\" in a:\r\n p = 1\r\n if \"e\" in a[a.find(\"h\")+1:]:\r\n p = 2\r\n if \"l\" in a[a.find(\"e\",a.find(\"h\")+1)+1:]:\r\n p = 3\r\n if \"l\" in a[a.find(\"l\",a.find(\"e\",a.find(\"h\")+1)+1)+1:]:\r\n p = 4\r\n if \"o\" in a[a.find(\"l\",a.find(\"l\",a.find(\"e\",a.find(\"h\")+1)+1)+1)+1:]:\r\n p = 5\r\nif p == 5:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "s=input()\r\nans=\"hello\"\r\nind=0\r\ncnt=0\r\nfor i in range(len(s)):\r\n if(s[i]==ans[ind]):\r\n ind+=1\r\n cnt+=1\r\n if(ind>4):\r\n break\r\nif(cnt==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "'''\n\tDieser Code wurde geschrieben von\n\tLEOAX\n\tam 2023-05-26.11:56:37\n'''\n\ndef Haptprogram():\n inputText = input()\n compareText = \"hello\"\n iterator = 0\n\n #print(\"len(inputText: \", len(inputText))\n #print(type(iterator))\n #print(type(len(compareText)))\n i=0\n while(i<len(inputText) and iterator<5):\n\n \n if(inputText[i] == compareText[iterator]):\n iterator += 1\n \n #print(\"i: \",i,\" iterator: \",iterator)\n\n i += 1\n\n if(iterator == len(compareText)):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\n\n\n\n\nt= 1\nwhile(t>0):\n Haptprogram()\n\n t=t-1\n\n", "a = list(input())\ncount = 0\nfor i in range(len(a)):\n if count==0 and a[i] == 'h':\n count+=1\n elif count==1 and a[i] == 'e':\n count += 1\n elif count ==2 and a[i] == 'l':\n count += 1\n elif count == 3 and a[i]=='l':\n count += 1\n elif count == 4 and a[i]=='o':\n count +=1\n\nif count==5:\n print('YES')\nelse:\n print('NO')", "s = input()\r\nflag = False\r\nif 'h' in s:\r\n a = s.index('h')\r\n if 'e' in s[a+1:]:\r\n b = (s[a+1: ]).index('e')\r\n if 'l' in s[a+b+2:]:\r\n c = (s[a+b+2: ]).index('l')\r\n if 'l' in s[a+b+c+3:]:\r\n d = (s[a+b+c+3: ]).index('l')\r\n if 'o' in s[a+b+c+d+4:]:\r\n flag = True\r\n \r\nif flag == True:\r\n print('YES')\r\nelse:\r\n print('NO') ", "# -*- coding: utf-8 -*-\n\"\"\"Untitled1.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1QYfrJeGAw3cNjFBKdS5uTsHyM2Z6kQR7\n\"\"\"\n\ns = input()\n\nls = []\nc = 0\nfor i in s:\n if i == 'h' and c == 0:\n ls.append('h')\n c+=1\n elif i == 'e' and c== 1:\n ls.append('e')\n c += 1\n elif i == 'l' and (c == 2 or c == 3):\n ls.append('l')\n c += 1\n elif i == 'o' and c == 4:\n ls.append('o')\n c += 1\nst = ''.join(ls)\nif st == 'hello':\n print('YES')\nelse:\n print('NO')", "inp = str(input())\r\nindex = 0\r\nfor i in range(0, len(inp)):\r\n\tif str(inp[i]) == 'h' and index == 0:\r\n\t\tindex += 1\r\n\telif str(inp[i]) == 'e' and index == 1:\r\n\t\tindex += 1\r\n\telif str(inp[i]) == 'l' and index == 2:\r\n\t\tindex += 1\r\n\telif str(inp[i]) == 'l' and index == 3:\r\n\t\tindex += 1\r\n\telif str(inp[i]) == 'o' and index == 4:\r\n\t\tindex += 1\r\n\r\nif index == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\r\nans = \"NO\"\r\nif \"h\" in s:\r\n h_index = s.index(\"h\")\r\n if \"e\" in s[h_index:]:\r\n e_index = s.index(\"e\", h_index)\r\n if \"l\" in s[e_index:]:\r\n l1_index = s.index(\"l\", e_index)\r\n if \"l\" in s[l1_index + 1 :]:\r\n l2_index = s.index(\"l\", l1_index + 1)\r\n if \"o\" in s[l2_index:]:\r\n ans = \"YES\"\r\nprint(ans)", "from sys import stdin, stdout\r\n\r\nstring = stdin.readline()\r\nstring_lst = list(string)\r\nreqs = 'hello'\r\nnew_list = []\r\ni = 0\r\nfor letter in string_lst:\r\n if i <= 4:\r\n if letter == reqs[i]:\r\n new_list.append(letter)\r\n i = i + 1\r\n else:\r\n break\r\nif new_list == list(reqs):\r\n stdout.write('YES')\r\nelse:\r\n stdout.write('NO')", "s = input()\nd = set()\nflag = 0\nfor i in range(len(s)):\n if s[i] == 'h':\n d.add(s[i])\n elif 'h' in d and s[i] == 'e':\n d.add(s[i])\n elif 'h' in d and 'e' in d and s[i] == 'l' and flag == 0:\n if s[i] in d:\n flag = 1\n d.add(s[i])\n elif flag == 1 and s[i] == 'o':\n print('YES')\n break\n if i == len(s) - 1:\n print('NO')\n", "s=input()\r\nl=''\r\nh='hello'\r\nfor i in s:\r\n if i=='h' and l=='':\r\n l+=i\r\n if i=='e'and l=='h':\r\n l+=i\r\n if i=='l' and l=='he' :\r\n l+='l'\r\n continue\r\n if i=='l' and l=='hel' :\r\n l+='l'\r\n \r\n if i=='o' and l=='hell':\r\n l+=i\r\nif l==h:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "s = input()\r\nss = 'hello'\r\nk = 0\r\nfor i in s:\r\n if k < len(ss) and i == ss[k]: \r\n k += 1\r\nprint('YES' if k == len(ss) else 'NO')", "def solve():\r\n S = input()\r\n targ = 'hello'\r\n for t in targ:\r\n if t not in S:\r\n return \"NO\"\r\n ind = S.index(t)\r\n S = S[ind+1:]\r\n return \"YES\"\r\n \r\nans = solve()\r\nprint(ans)\r\n", "import re\r\ns = input().lower()\r\nif re.findall(r\"h.*?e.*?l.*?l.*?o.*?\",s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nb = \"hello\"\r\ncount = 0\r\nnum = 0\r\nwhile(True):\r\n #print(\"Count = \",count)\r\n if(num==5):\r\n print(\"YES\")\r\n break\r\n #print(f\"a[count:] = {a[count:]}\")\r\n if(a[count:]==\"\"):\r\n print(\"NO\")\r\n break\r\n #print(f\"b[num] = {b[num]}\")\r\n c = a.find(b[num])\r\n #print(c)\r\n if(c != -1):\r\n num+=1\r\n a = a[c+1:]\r\n else:\r\n print(\"NO\")\r\n break\r\n\r\n\r\n\r\n\r\n", "hello=\"hello\"\r\ns=input()\r\nflag=False\r\ncnt=0\r\nfor i in range(len(s)):\r\n if s[i]==hello[cnt]:\r\n cnt+=1\r\n if cnt==5:\r\n flag=True\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nins = 0\r\nc = 0\r\nfor a in \"hello\":\r\n for q in range(ins,len(s)):\r\n if s[q] == a:\r\n c+=1\r\n ins = q+1\r\n break\r\nprint(\"YES\" if c == 5 else \"NO\")\r\n\r\n", "# Input\r\ns = input()\r\n\r\n# Check if it is possible to form \"hello\" by deleting some letters from s\r\nhello = \"hello\"\r\ni = 0 # Pointer to track the position in hello\r\nfor letter in s:\r\n if letter == hello[i]:\r\n i += 1\r\n if i == len(hello):\r\n break\r\n\r\n# Output\r\nif i == len(hello):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def can_say_hello(s):\r\n required = \"hello\"\r\n idx = 0\r\n\r\n for char in s:\r\n if char == required[idx]:\r\n idx += 1\r\n if idx == len(required):\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n\r\n\r\ns = input()\r\n\r\n\r\nresult = can_say_hello(s)\r\nprint(result)\r\n", "a=input()\ntotal=0\nfor i in a:\n\tif i=='h' and total==0:\n\t\ttotal=total+1\n\telif i=='e' and total==1:\n\t\ttotal=total+1\n\telif i=='l' and total==2:\n\t\ttotal=total+1\n\telif i=='l' and total==3:\n\t\ttotal=total+1\n\telif i=='o' and total==4:\n\t\ttotal=total+1\nif total==5:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "s = input()\r\nfor char in 'hello':\r\n sh = s.find(char)\r\n if s.find(char) == -1:\r\n print ('NO')\r\n break\r\n else:\r\n s = s[sh+1:]\r\nelse:\r\n print ('YES')", "s = input()\r\n\r\ns = list(s)\r\n\r\nh = ['h','e','l','l','o']\r\n\r\nsoln = []\r\n\r\nj = 0\r\nfor i in range(len(h)):\r\n while(j!=len(s)):\r\n \r\n if(h[i]==s[j]):\r\n soln.append(s[j])\r\n j = j + 1\r\n break\r\n else:\r\n j = j + 1\r\nif(soln == h):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\n\r\n\r\ns = input()\r\n\r\nfor c in \"hello\":\r\n if c not in s:\r\n print(\"NO\")\r\n sys.exit(0)\r\n s = s[s.index(c) + 1:]\r\nprint(\"YES\")\r\n", "l = list(map(str, input()))\r\ng = ['h', 'e', 'l', 'l', 'o']\r\nwhile True:\r\n if len(g) == 0:\r\n print('YES')\r\n exit()\r\n if len(l) == 0:\r\n print('NO')\r\n exit()\r\n else:\r\n if l[0] == g[0]:\r\n l.pop(0)\r\n g.pop(0)\r\n else:\r\n l.pop(0)", "s=input()\r\nan=\"\"\r\nt=0\r\nfor i in s:\r\n if an==\"\" and i==\"h\":\r\n an+=i\r\n elif an==\"h\" and i==\"e\":\r\n an+=i\r\n elif an==\"he\" and i==\"l\":\r\n an+=i\r\n elif an==\"hel\" and i==\"l\":\r\n an+=i\r\n elif an==\"hell\" and i==\"o\":\r\n print(\"YES\")\r\n t=1\r\n break\r\nif not t:\r\n print(\"NO\")\r\n ", "s=input()\r\na=\"hello\"\r\ni=0\r\nfor j in s:\r\n if j==a[i]:\r\n i+=1\r\n if i==5:\r\n break\r\n \r\nif i==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "hi = input()\n\nhello = \"hello\"\ni = 0\nfor x in hi:\n if x == hello[i]:\n i+=1\n if i > 4:\n break\nprint(\"YES\" if i==5 else \"NO\")", "def greeting():\r\n greet=input()\r\n \r\n hello=['h','e','l','l','o']\r\n \r\n for i in hello:\r\n if i in greet:\r\n h=greet.index(i)\r\n greet=greet[h+1:]\r\n else:\r\n return False\r\n return True\r\nif greeting():\r\n print('YES')\r\nelse:\r\n print('NO')", "n=input()\r\nc=i=j=k=l=m=0\r\nfor i in range(0,len(n)):\r\n if(n[i]=='h'):\r\n c+=1\r\n break\r\n \r\n\r\nfor j in range(i+1,len(n)):\r\n if(n[j]=='e'):\r\n c+=1\r\n break\r\n \r\nfor k in range(j+1,len(n)):\r\n if(n[k]=='l'):\r\n c+=1\r\n break\r\n \r\nfor l in range(k+1,len(n)):\r\n if(n[l]=='l'):\r\n c+=1\r\n break\r\n\r\nfor m in range(l+1,len(n)):\r\n if(n[m]=='o'):\r\n c+=1\r\n break\r\n\r\nif(c==5):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def hello(arrgs):\n hello1 = \"hello\"\n pointer = 0\n for i in arrgs:\n if i == hello1[pointer]:\n pointer = pointer + 1\n if pointer == 5:\n return \"YES\"\n return \"NO\"\n\n\ninp = str(input())\nprint(hello(inp))\n\t \t\t\t \t \t \t \t \t\t\t\t \t\t", "word=input()\r\na=word.find(\"h\")\r\nb=word.find(\"e\",a+1)\r\nc=word.find(\"l\",b+1)\r\nd=word.find(\"l\",c+1)\r\ne=word.find(\"o\",d+1)\r\nponil=a<b<c<d<e\r\nif ponil==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "import re\ns = input()\nif(re.search('^.*h.*e.*l.*l.*o.*$', s)):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "s=input()\nl=[0,0,0,0,0]\nl[0]=s.find('h')\nl[1]=s.find('e',l[0]+1)\nl[2]=s.find('l',l[1]+1)\nl[3]=s.find('l',l[2]+1)\nl[4]=s.find('o',l[3]+1)\np=True\nprev=-1\nfor i in l:\n\tif prev>=i:\n\t\tp=False\n\t\tbreak\nans=[\"NO\",\"YES\"]\nprint( ans[p] )\n", "k = 0 \nstring = input()\nstring1 = \"hello\"\nfor i in range(len(string)):\n if k == 5:\n break\n if string[i] == string1[k] and k < 5:\n k += 1\nif k == 5:\n print(\"YES\")\nelse:\n print(\"NO\")", "s = input()\r\nw = \"hello\"\r\ni = 0\r\nfor c in s:\r\n if len(w) <= i:\r\n break\r\n if c == w[i]:\r\n i += 1\r\n\r\nprint(\"YES\" if i == len(w) else \"NO\")\r\n", "v=\"hello\"\ns=[x for x in input() if x in v]\nfor c in s:\n if not v:\n break\n if c==v[0]:\n v=v[1:] \nprint('YES' if not v else 'NO')\n", "s=input()\r\nc=1\r\nfor i in range(len(s)):\r\n if(s[i]=='h' and c==1):\r\n c+=1\r\n elif(s[i]=='e' and c==2):\r\n c+=1\r\n elif(s[i]=='l' and c==3):\r\n c+=1\r\n elif(s[i]=='l' and c==4):\r\n c+=1\r\n elif(s[i]=='o' and c==5):\r\n c+=1\r\n \r\n \r\nif(len(s)<5):\r\n print(\"NO\")\r\nelse:\r\n if(c==6):\r\n print(\"YES\")\r\n else:\r\n print('NO')\r\n \r\n ", "line = input()\r\ncount = 0\r\nvertic = ['h','e','l','l','o']\r\nfor i in range(len(line)):\r\n if line[i] == vertic[count]:\r\n count += 1\r\n if count == 5:\r\n print('YES')\r\n break\r\nif count <=4:\r\n print('NO')", "n = input()\r\nstring = \"hello\"\r\nindex = 0\r\n \r\nfor i in n:\r\n if string[index] == i:\r\n index += 1\r\n if index == 5:\r\n break\r\n \r\nif index == 5:\r\n print(\"YES\");\r\nelse:\r\n print(\"NO\");", "n = input()\r\nk = n.find('h')\r\no = n.rfind('o')\r\nword = n[k:o + 1]\r\na = ''\r\nvowel = 'aieouy'\r\nfor i in word:\r\n if i == 'h' and (a == ''):\r\n a = a + i\r\n\r\n elif i == 'e' and a == 'h':\r\n a = a + i\r\n elif i == 'l' and a == 'he':\r\n a = a + i\r\n elif i == 'l' and a == 'hel':\r\n a = a + i\r\n elif i == 'o' and a == 'hell':\r\n a = a + i\r\n\r\nif a == 'hello':\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=list(input())\r\nif 'h' not in a:\r\n print('NO')\r\nelse:\r\n m=a.index('h')\r\n a[0:m+1]=''\r\n if 'e' not in a:\r\n print('NO')\r\n else:\r\n n=a.index('e')\r\n a[0:n+1]=''\r\n if 'l' not in a:\r\n print('NO')\r\n else:\r\n o=a.index('l')\r\n a[0:o+1]=''\r\n if 'l' not in a:\r\n print('NO')\r\n else:\r\n p=a.index('l')\r\n a[0:p+1]=''\r\n if 'o' not in a:\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "word = input()\r\n\r\nn = 0\r\nfor i in 'hello':\r\n if i in word:\r\n word = word[word.index(i) + 1:]\r\n n += 1\r\nif n == 5:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nhello = list('hello')\r\ns = list(s)\r\nj = 0\r\nfor i in range(len(s)):\r\n if s[i] == hello[j]:\r\n j += 1\r\n if j == 5:\r\n print('YES')\r\n break\r\n\r\nif j != 5:\r\n print('NO')", "import re\ns = input()\nres=re.match('(.)*h(.)*e(.)*l(.)*l(.)*o',s)\nif res:\n print('YES')\nelse:\n print('NO')", "\r\nt = input()\r\ndef f(t):\r\n j = 0\r\n for i in 'hello':\r\n while t[j] != i:\r\n j += 1\r\n if j == len(t):\r\n return 1\r\n j += 1\r\n if j == len(t):\r\n return i != 'o'\r\n return 0\r\nprint(['YES', 'NO'][f(t)])", "s = input()\r\n\r\nfor letter in s:\r\n if letter not in ['h','e','l','o']:\r\n s=s.replace(letter,'')\r\n\r\n#print(s)\r\n\r\ntry:\r\n s = s[s.index('h'):]\r\n s = 'h'+s.replace('h','')\r\nexcept ValueError:\r\n print('NO')\r\n exit()\r\n \r\n#print(s)\r\n\r\ntry:\r\n s = s[s.index('e'):]\r\n s = 'he'+s.replace('e','')\r\nexcept ValueError:\r\n print('NO')\r\n exit()\r\n\r\n#print(s)\r\n\r\ntry:\r\n s = s[s.index('ll'):]\r\n s = 'hell'+s.replace('l','')\r\nexcept ValueError:\r\n print('NO')\r\n exit()\r\n\r\n#print(s)\r\n\r\ntry:\r\n s = s[s.index('o'):]\r\n s = 'hello'\r\nexcept ValueError:\r\n print('NO')\r\n exit()\r\n\r\n#print(s)\r\n\r\nprint('YES')\r\n", "s = input()\r\na = \"hello\"\r\ni = 0\r\nfor c in s:\r\n if c == a[i]:\r\n i += 1\r\n if i == len(a):\r\n break\r\nif i == len(a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "s = str(input())\r\nc = 0\r\nv = \"hello\"\r\nfor i in s:\r\n if i == v[c]:\r\n c += 1\r\n if c == 5:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun May 9 18:04:19 2021\r\n\r\n@author: artur\r\n\"\"\"\r\n\r\nword = input()\r\nh = []\r\ne = []\r\nl = []\r\no = []\r\n\r\nfor i in range(len(word)):\r\n if word[i] == 'h':\r\n h.append(i)\r\n elif word[i] == 'e':\r\n e.append(i)\r\n elif word[i] == 'l':\r\n l.append(i)\r\n elif word[i] == 'o':\r\n o.append(i)\r\n\r\nflag = False\r\nine = None\r\nin1l = None\r\nin2l = None\r\nino = None\r\ninh = None\r\n\r\nif len(h) > 0:\r\n inh = h[0]\r\n\r\nfor i in e:\r\n if inh == None:\r\n break\r\n if i > inh:\r\n ine = i\r\n break\r\n\r\nfor z in l:\r\n if ine == None:\r\n break\r\n if z > ine:\r\n in1l = z\r\n break\r\nfor w in l:\r\n if in1l == None:\r\n break\r\n if w > in1l:\r\n in2l = w\r\n break\r\n\r\nfor n in o:\r\n if in2l == None:\r\n break\r\n if n > in2l:\r\n ino = n\r\n break\r\n \r\n\r\nif type(ine) == int and type(in1l) == int and type(in2l) == int and type(ino) == int:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=list(map(str,input()))\r\nw=\"\"\r\nfor i in s:\r\n if i == \"h\" and len(w)==0:\r\n w=w+i\r\n elif i == \"e\" and len(w)==1:\r\n w=w+i\r\n elif i == \"l\" and (len(w)==2 or len(w) ==3):\r\n w=w+i\r\n elif i == \"o\" and len(w) == 4:\r\n w=w+i\r\n\r\n\r\nif w == \"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import re\r\ns = input()\r\nch = [\"h\",\"e\",\"l\",\"l\",\"o\"]\r\nj = 0\r\nflag = -1\r\nfor i in s:\r\n if i == ch[j]:\r\n j += 1\r\n if j == 5:\r\n flag = 1\r\n break\r\nif flag == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nc=0\r\nb='hello'\r\nfor i in a:\r\n if i==b[c]:\r\n c+=1\r\n if c==5:\r\n exit(print(\"YES\"))\r\nprint(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jan 11 17:52:32 2023\r\n\r\n@author: Tasos\r\n\"\"\"\r\n\r\ns_tring = input()\r\nh_tring = 'hello'\r\nj = 0\r\n\r\nfor i in range(len(s_tring)):\r\n if h_tring[j] == s_tring[i]:\r\n j = j + 1\r\n if j == len(h_tring):\r\n print('YES')\r\n break\r\nif j != len(h_tring):\r\n print('NO')\r\n", "s = input()\r\n\r\n\r\nif ('h' and 'e' and 'l' and 'l' and 'o' not in s) or len(s)<5:\r\n print('NO')\r\n exit()\r\n\r\npos= s.index('h')\r\ns= s[pos:]\r\nif 'e' not in s:\r\n print('NO')\r\n exit()\r\nelse:\r\n pos=s.index('e')\r\n\r\ns= s[pos:]\r\nif 'l' not in s:\r\n print('NO')\r\n exit()\r\nelse:\r\n pos=s.index('l')+1\r\ns = s[pos:]\r\n\r\nif 'l' not in s:\r\n print('NO')\r\n exit()\r\nelse:\r\n pos=s.index('l')\r\ns = s[pos:]\r\n\r\nif 'o' not in s:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "s=input()\r\npattern=\"hello\" \r\nx=0 \r\nfor i in range(len(s)):\r\n if s[i]==pattern[x]:\r\n x+=1 \r\n if x==5:\r\n break\r\nif x==5:\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")\r\n \r\n ", "t = input()\r\nvis = [False for i in range(5)]\r\ncount=0\r\nfor i in range(len(t)):\r\n if t[i]=='h':\r\n vis[0] = True\r\n elif t[i]=='e' and vis[0]==True:\r\n vis[1]=True\r\n elif t[i]=='l' and vis[1]==True:\r\n vis[2]=True\r\n count+=1\r\n if count>1:\r\n vis[3]=True\r\n elif t[i]=='o' and vis[3]==True:\r\n vis[4]=True\r\nif vis[4]==True :\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n \r\n", "import re\r\nn = input()\r\nres = re.findall(r'(\\w*)?(h)(\\w*)?(e)(\\w*)?(l)(\\w*)?(l)(\\w*)?(o)(\\w*)?',n)\r\nprint('YES') if res else print(\"NO\")", "s=str(input())\r\nt=0\r\ni1=0\r\ni2=0\r\ni3=0\r\ni4=0\r\nfor i in range(0,len(s)):\r\n if s[i]=='h':\r\n t+=1\r\n i1=i\r\n break\r\nfor i in range(i1+1,len(s)):\r\n if s[i]=='e':\r\n t+=1\r\n i2=i\r\n break\r\nfor i in range(i2+1,len(s)):\r\n if s[i]=='l':\r\n t+=1\r\n i3=i\r\n break\r\n\r\nfor i in range(i3+1,len(s)):\r\n if s[i]=='l':\r\n t+=1\r\n i4=i\r\n break\r\n\r\nfor i in range(i4+1,len(s)):\r\n if s[i]=='o':\r\n t+=1\r\n break\r\n\r\nif t==5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "s = input()\r\nn = len(s)\r\ni = -1\r\ntruth = 0\r\nfor letter in 'hello':\r\n if i == n-1:\r\n break\r\n while i < n-1:\r\n i += 1\r\n if letter == s[i]:\r\n truth += 1\r\n break\r\nif truth == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=str(input())\r\na=['h','e','l','l','o']\r\nn=len(a)\r\ncount=0\r\nfor i in range(len(s)):\r\n if s[i]==a[0]:\r\n count+=1\r\n a.pop(0)\r\n if s[i]==\"o\":\r\n break\r\nif count==n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = list(input())\r\nhello = ['h', 'e', 'l', 'l', 'o']\r\n\r\nn = 0\r\nfor i in s:\r\n\tif i == hello[n]:\r\n\t\tn += 1\r\n\tif n == 5:\r\n\t\tbreak\r\n\r\nif n == 5:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s=str(input())\r\na=\"hello\"\r\nb=\"\"\r\ni=0\r\nj=0\r\nwhile i<len(s) and j<len(a):\r\n if s[i]==a[j]:\r\n b+=a[j]\r\n i+=1\r\n j+=1\r\n else:\r\n i+=1\r\nif b==a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input().lower())\r\nss = \"hello\"\r\ncount = 0\r\ni = 0\r\nwhile i < len(s):\r\n if ss[count] == s[i]:\r\n count += 1\r\n i += 1\r\n if count == 5:\r\n print(\"YES\")\r\n break\r\n elif i == len(s):\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n", "s = input()\r\nslovo = ''\r\nlistt = ['h' , 'e' , 'l' , 'l' , 'o']\r\nfor i in s: \r\n if i in listt and i == listt[0] :\r\n slovo +=i\r\n del listt[0]\r\n \r\nif slovo == 'hello':\r\n print('YES')\r\nelse :\r\n print('NO')", "import sys\r\nimport math\r\n\r\n\r\n\r\nfirststring = input() #ahhellllloou\r\nto_find = \"hello\"\r\n\r\ndef check_string(firststring, to_find):\r\n c = 0\r\n for i in firststring:\r\n #print(i)\r\n if i == to_find[c]:\r\n c += 1\r\n if c == len(to_find):\r\n\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(check_string(firststring, to_find))", "\r\nstring=input().lower()\r\ncheck=[\"h\",\"e\",\"l\",\"l\",\"o\"]\r\ndata=[]\r\nt=[x for x in string if x in check]\r\ncounter=0\r\ntester=0\r\nfor x in t:\r\n \r\n if x not in data and x==check[tester] and x!=\"l\":\r\n data.append(x)\r\n tester+=1\r\n if x==\"l\" and counter<2 and len(data)>=2:\r\n data.append(x)\r\n counter+=1\r\n tester+=1\r\n\r\nst=\"\".join(data)\r\nif st==\"hello\":\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=input()\r\na=0\r\ns=['h','e','l','l','o']\r\nfor i in n:\r\n if(i=='h' and a==0):\r\n a=1\r\n elif(i=='e' and a==1):\r\n a=2\r\n elif(i=='l' and a==2):\r\n a=3\r\n elif(i=='l' and a==3):\r\n a=4\r\n elif(i=='o' and a==4):\r\n a=5\r\nif(a==5):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# %%\r\nspam_string = input()\r\n\r\nkeyword = \"hello\"\r\n\r\ni = 0\r\nfor letter in spam_string:\r\n if i < 5:\r\n if letter == keyword[i]:\r\n i += 1\r\n\r\nif i == 5:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n# %%\r\n", "s = input()\r\nres = 'hello'\r\nres1 = ''\r\n\r\nj = 0\r\nfor i in s:\r\n if i == res[j]:\r\n res1 += i\r\n j += 1\r\n if j == 5:\r\n break\r\n# print(res , res1)\r\nif res == res1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n ", "s = input()\nletter = ['h','e','l','l','o']\ncount = 0\ncurentnum = 0\nwhile count<len(s) and curentnum<len(letter):\n if s[count] == letter[curentnum]:\n curentnum+=1\n count +=1\n else:\n count += 1\nif curentnum == 5:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def find(a,b):\r\n c =0\r\n for i in a:\r\n if i ==b:\r\n return c\r\n c = c+1\r\n return -1\r\ns = [str(x) for x in input()]\r\nif find(s,'h') != -1:\r\n s = s[find(s,'h')+1:len(s)]\r\n if find(s,'e') !=-1:\r\n s = s[find(s,'e')+1:len(s)]\r\n if find(s,'l') !=-1:\r\n s = s[find(s,'l')+1:len(s)]\r\n if find(s,'l') !=-1:\r\n s = s[find(s,'l')+1:len(s)]\r\n if find(s,'o') !=-1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "a = input()\r\nword = 'hello'\r\ns = ''\r\nfor n in range(len(word)):\r\n if word[n] in a:\r\n if s != 'NO':\r\n a = a[a.find(word[n]):]\r\n a = a[1:]\r\n else:\r\n s = 'NO'\r\n\r\nif s != 'NO':\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nsta=0\r\ndef examine(s,x,sta):\r\n n=len(s)\r\n for i in range(len(s)):\r\n if s[i]==x:\r\n s=s[i+1:]\r\n break\r\n if len(s)==n:\r\n sta+=1\r\n return(s,sta)\r\ns,sta=examine(s,'h',sta)\r\ns,sta=examine(s,'e',sta)\r\ns,sta=examine(s,'l',sta)\r\ns,sta=examine(s,'l',sta)\r\ns,sta=examine(s,'o',sta)\r\nif sta==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=str(input())\r\nl=list(s)\r\ntry:\r\n h=l.index('h')\r\n e=l.index('e', h+1, len(s))\r\n l1=l.index('l', e+1, len(s))\r\n l2=l.index('l', l1+1, len(s))\r\n o=l.index('o', l2+1, len(s))\r\nexcept ValueError:\r\n print('NO')\r\n exit()\r\nif(h<e and e<l1 and l1<l2 and l2<o):\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\r\n\r\nmsg = input().strip()\r\n\r\nregex = \"[a-z|A-Z]*h[a-z|A-Z]*e[a-z|A-Z]*l[a-z|A-Z]*l[a-z|A-Z]*o[a-z|A-Z]*\"\r\n\r\nmatches = re.match(regex, msg)\r\n\r\nif matches:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")" ]

[ "import re\n\n#判别函数类型是否匹配\ndef is_type_match(var_type, arg_type):\n return var_type == \"T\" or var_type == arg_type #当var_type为时T，函数返回True；当var_type不是T时，只有当var_type和arg_type等时，函数才会返回True\n\n#模板过程的变量类型\nn = int(input())\nprocedures = []\nfor i in range(n):\n line = input()\n m = re.match(r'\\s*void\\s+(\\S+)\\s*\\((.*?)\\)\\s*', line) #配对每行以void开头的函数定义 【void function_name(argument_list)】\n name = m.group(1) #随机数\n arg_types = m.group(2).split(',') #参列表（不包选号） #按，分开\n arg_types = [arg_type.strip() for arg_type in arg_types] #去除首尾空白字符 #保存在arg_types列表中\n procedures.append((name, arg_types)) #将函数名和arg_types组合成一个元组，添加到procedures列表中。\n\n#使用到的变量\nm = int(input()) #m表示变量定义的数目\nvariables = {}\nfor i in range(m):\n line = input()\n m = re.match(r'\\s*(\\S+)\\s+(\\S+)\\s*', line) #匹配出变量的类型和名称\n var_type = m.group(1) #类型\n var_name = m.group(2) #名称\n variables[var_name] = var_type #变量名作为关键字，变量作为值\n\n# 过程调用的变量\nk = int(input())\nfor i in range(k):\n line = input()\n m = re.match(r'\\s*(\\S+)\\s*\\((.*?)\\)\\s*', line)\n name = m.group(1)\n arg_names = m.group(2).split(',') #按，分开\n arg_names = [arg_name.strip() for arg_name in arg_names] #去除首尾空白字符 #保存在arg_names列表中\n count = 0\n\n for procedure in procedures:\n if procedure[0] == name and len(procedure[1]) == len(arg_names):\n match = True\n for j in range(len(procedure[1])):\n if not is_type_match(procedure[1][j], variables[arg_names[j]]):\n match = False\n break\n if match:\n count += 1\n print(count)\n\n\n \t \t\t \t\t \t \t \t \t\t", "I=input\r\nR=str.replace\r\nP=range\r\nD=lambda:P(int(I()))\r\nT={}\r\nd={}\r\ndef rf(s):\r\n\tprint(s.split())\r\nfor _ in D():s=R(R(I(),'void',''),' ','');t=s.find('(');k=s[:t];d[k]=d.get(k,[])+[s[t+1:-1].split(',')]\r\nfor _ in D():a,b=I().split();T[b]=a\r\nfor _ in D():\r\n\ts=R(I(),' ','');t=s.find('(');s,v=s[:t],s[t+1:-1].split(',');r=0\r\n\tfor p in d.get(s,[]):\r\n\t\tif len(v)==len(p):\r\n\t\t\tfor i in P(len(v)):\r\n\t\t\t\tif p[i]!='T'and p[i]!=T[v[i]]:break\r\n\t\t\telse:r+=1\r\n\tprint(r)", "def get_func(s):\r\n\r\n s = s.replace( \"(\" , \" \").replace(\",\", \" \").replace(\")\", \" \")\r\n s = s.split()\r\n\r\n fname = s[1]\r\n fvar = list(map( lambda x: var_map[x] , s[2:] )) \r\n\r\n temp = func.get( fname , [] )\r\n temp.append( fvar )\r\n func[fname] = temp\r\n\r\n\r\n# def temp(s):\r\n# arr = list(s)\r\n\r\n# for i in range( len(arr)):\r\n\r\n# if arr[i] in ( \"(\" , \",\" , \")\" ):\r\n# arr[i] = \" \"\r\n\r\n# ttt = \"\".join(arr).split()\r\n# # print(ttt)\r\n\r\n\r\ndef gen_var( s ):\r\n k = s.split()\r\n \r\n var[ k[1] ] = var_map[k[0]]\r\n\r\ndef get_proc( s ):\r\n\r\n s = s.replace( \"(\" , \" \").replace(\",\", \" \").replace(\")\", \" \")\r\n s = s.split()\r\n\r\n fname = s[0]\r\n if fname not in func :\r\n # print(0)\r\n return 0\r\n\r\n fvar = list(map( lambda x: var[x] , s[1:] ))\r\n\r\n count = 0\r\n for tarr in func[fname]:\r\n \r\n if len(tarr) != len(fvar) :\r\n continue\r\n\r\n acc = 1\r\n for i in range(len( tarr )):\r\n if tarr[i] == 0:\r\n continue\r\n if tarr[i] != fvar[i] :\r\n acc = 0\r\n break\r\n \r\n count += acc\r\n # print(count)\r\n return count \r\n\r\n\r\nfunc = {}\r\nvar_map = { \"T\" : 0 , \"int\" : 1 , \"double\" : 2, \"string\" : 3 }\r\nvar = {}\r\n\r\nfor n in range(int(input()) ):\r\n \r\n get_func( input())\r\n \r\nfor n in range(int(input())):\r\n \r\n gen_var( input())\r\n \r\nfor n in range(int(input())):\r\n \r\n t = get_proc( input())\r\n print(t )\r\n\r\n ", "a = input()\nfunc_list = []\nfunc_list_type = []\ni = 0\nwhile i < int(a):\n x = input().split()\n x = ''.join(x)\n # print(x)\n func_name_end = x.find(\"(\")\n # print(func_name_end)\n func_list.append(x[4:func_name_end])\n func_type_end = x.find(\")\")\n func_list_type.append(x[func_name_end + 1:func_type_end].split(\",\"))\n # for b_0 in x:\n # if b_0 == 'void' or b_0 == ' ' or b_0 == '(' or b_0 == ')' or b_0 == ',':\n # continue\n # func_list[i].append(b_0)\n # i += 1\n i += 1\n# print(func_list)\n# print(func_list_type)\n\ntype_list = []\ntype_list_type = []\nb = input()\ni = 0\nwhile i < int(b):\n x = input().split()\n x = ''.join(x)\n if x[0] == 'i':\n type_list_type.append('int')\n type_list.append(x[3:])\n elif x[0] == 's':\n type_list_type.append('string')\n type_list.append(x[6:])\n elif x[0] == 'd':\n type_list_type.append('double')\n type_list.append(x[6:])\n i += 1\n# print(type_list)\n# print(type_list_type)\n\noperate_list = []\noperate_list_type = []\ni = 0\nc = input()\nwhile i < int(c):\n x = input().split()\n x = ''.join(x)\n operate_list_start = x.find('(')\n operate_list.append(x[:operate_list_start])\n operate_list_type.append(x[operate_list_start + 1:-1].split(','))\n i += 1\n# print(operate_list)\n# print(operate_list_type)\n#\n# while i < int(b):\n# while i < int(c):\n# if\n\ni = 0\n\nwhile i < int(c):\n j = 0\n while j in range(len(operate_list_type[i])):\n k = 0\n while k < int(b):\n if operate_list_type[i][j] == type_list[k]:\n operate_list_type[i][j] = type_list_type[k];\n break\n k += 1\n j += 1\n i += 1\n\n# print(func_list)\n# print(func_list_type)\n# print(type_list)\n# print(type_list_type)\n# print(operate_list)\n# print(operate_list_type)\n\nfor i in range(int(c)):\n bool_0 = 0\n sum = 0\n for j in range(int(a)):\n\n if len(operate_list_type[i]) != len(func_list_type[j]): ## 长度不同时，直接跳出\n continue\n if operate_list[i] != func_list[j]: ## 函数名不同时，直接跳出\n continue\n for k in range(len(operate_list_type[i])):\n if operate_list_type[i][k] == func_list_type[j][k] or func_list_type[j][k] == 'T':\n bool_0 = 1\n else:\n bool_0 = 0\n break\n if bool_0 == 1:\n sum += 1\n print(sum)\n \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# 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\nn = int(input())\n\na = [i for i in input().split()]\n\ndef change(l, r):\n global a\n\n if l == r:\n return 0\n\n if a[l] == a[r]:\n for i in range(l+1, r):\n a[i] = a[l]\n return (r-l)//2\n else:\n m = (l+r+1)//2\n\n for i in range(l+1, m):\n a[i] = a[l]\n\n for i in range(m, r):\n a[i] = a[r]\n\n return (r-l-1)//2\n\n\nansw = 0\ncurrent = 0\n\nfor i in range(n):\n if i == n-1 or a[i] == a[i+1]:\n answ = max(answ, change(current, i))\n current = i+1\n\nprint(answ)\nprint(\" \".join(a))\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nr, b, c = 0, [a[0]], 0\r\nfor x, y, z in zip(a, a[1:], a[2:]):\r\n if x != y != z:\r\n c += 1\r\n r = max(r, (c+1) // 2)\r\n continue\r\n if c % 2 == 1:\r\n b.extend([y] * (c+1))\r\n else:\r\n b.extend([1-y] * (c//2) + [y] * (c//2+1))\r\n c = 0\r\ny = a[-1]\r\nif c % 2 == 1: b.extend([y] * (c+1))\r\nelse: b.extend([1-y] * (c//2) + [y] * (c//2+1))\r\nprint(r)\r\nprint(*b)\r\n", "n = int(input())\r\narr = [int(c) for c in input().split()]\r\nalter = [[0, 0]]\r\nprev = arr[0]\r\nfor i, e in enumerate(arr):\r\n\tif e != prev:\r\n\t\talter[-1][1] += 1\r\n\telse:\r\n\t\talter.append([i, i])\r\n\tprev = e\r\nalt = [e for e in alter if e[1] - e[0] + 1 > 2]\r\nsteps = 0\r\nfor a, b in alter:\r\n\tlength = b - a + 1\r\n\tsteps = max(steps, (length + 1) // 2 - 1)\r\n\tif length % 2 == 1:\r\n\t\tfor i in range(a, b + 1):\r\n\t\t\tarr[i] = arr[a]\r\n\telse:\r\n\t\tfor i in range(a, a + length // 2):\r\n\t\t\tarr[i] = arr[a]\r\n\r\n\t\tfor i in range(a + length // 2, b + 1):\r\n\t\t\tarr[i] = arr[b]\r\nprint(steps)\r\nprint(*arr)# 1697816344.2035265", "from sys import stdin\r\n\r\n#stdin = open('input.txt')\r\n\r\nn = int(stdin.readline())\r\n\r\nseq = [int(x) for x in stdin.readline().split()]\r\ncarry = seq[0]\r\nresult = [carry]\r\n\r\nmark = False\r\ncur_len = 0\r\nmax_len = 0\r\n\r\ni = 1\r\nwhile i < len(seq) - 1:\r\n if mark:\r\n if seq[i] != seq[i + 1]:\r\n cur_len += 1\r\n else:\r\n if cur_len > max_len:\r\n max_len = cur_len\r\n\r\n if seq[i] == carry:\r\n result.extend([carry]*cur_len)\r\n else:\r\n result.extend([carry]*(cur_len//2))\r\n result.extend([seq[i]]*(cur_len//2))\r\n\r\n result.append(seq[i])\r\n mark = False\r\n cur_len = 0\r\n elif seq[i] != seq[i - 1] and seq[i] != seq[i + 1]:\r\n mark = True\r\n cur_len = 1\r\n carry = seq[i - 1]\r\n else:\r\n result.append(seq[i])\r\n\r\n i += 1\r\n\r\nif mark:\r\n if cur_len > max_len:\r\n max_len = cur_len\r\n\r\n if seq[i] == carry:\r\n result.extend([carry]*cur_len)\r\n else:\r\n result.extend([carry]*(cur_len//2))\r\n result.extend([seq[i]]*(cur_len//2))\r\n\r\nresult.append(seq[i])\r\n\r\nprint((max_len + 1)//2)\r\nfor x in result:\r\n print(x, end=' ')", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=[]\r\ne=[]\r\nfor i in range(1,n-1):\r\n if a[i]!=a[i-1] and a[i]!=a[i+1]:\r\n e.append([a[i],i])\r\n else:\r\n if e!=[]:\r\n d.append(e)\r\n e=[]\r\nif e!=[]:\r\n d.append(e)\r\nif len(d)==0:\r\n print(0)\r\n print(*a)\r\nelse:\r\n e=[]\r\n for i in range(len(d)):\r\n if d[i][0][0]==0:\r\n if len(d[i])%2==0:\r\n m=len(d[i])\r\n e.append(m//2)\r\n for j in range(m//2):\r\n a[d[i][j][1]]=1\r\n a[d[i][m-j-1][1]]=0\r\n else:\r\n m=len(d[i])\r\n e.append(m//2+1)\r\n for j in range(m):\r\n a[d[i][j][1]]=1\r\n \r\n if d[i][0][0]==1:\r\n if len(d[i])%2==0:\r\n m=len(d[i])\r\n e.append(m//2)\r\n for j in range(m//2):\r\n a[d[i][j][1]]=0\r\n a[d[i][m-j-1][1]]=1\r\n else:\r\n m=len(d[i])\r\n e.append(m//2+1)\r\n for j in range(m):\r\n a[d[i][j][1]]=0\r\n print(max(e))\r\n print(*a)", "from math import ceil\n\nif __name__ == '__main__':\n n = int(input())\n arr = list(map(int, input().split()))\n\n narr = [True]\n\n for i in range(1, n - 1):\n x = arr[i]\n narr.append(x == arr[i - 1] or x == arr[i + 1])\n\n narr.append(True)\n\n cnt = 0\n mc = 0\n\n for x in narr:\n if not x:\n cnt += 1\n if x and cnt:\n mc = max(mc, cnt)\n cnt = 0\n\n if cnt:\n mc = max(mc, cnt)\n\n print(ceil(mc / 2))\n\n ss = None\n\n for i, x in enumerate(arr):\n if not narr[i]:\n if ss is None:\n ss = i\n elif ss is not None:\n if arr[ss - 1] == x:\n for j in range(ss, i):\n arr[j] = x\n else:\n for j in range(ss, i):\n arr[j] = arr[ss - 1] if j < (i + ss) / 2 else x\n ss = None\n\n print(*arr)\n", "import sys\nlines = sys.stdin.readlines()\nn = int(lines[0].strip())\narr = list(map(int, lines[1].strip().split(\" \")))\narr.append(arr[-1])\nres = []\nmaxChange = 0\n\nleft = 0\nfor i in range(1, n+1):\n if arr[i] == arr[i-1]:\n L = i - left\n res += [arr[left]]*(L//2) + [arr[i-1]]*(L-L//2)\n maxChange = max(maxChange, (L-1)//2)\n left = i\n\nprint(maxChange)\nprint(\" \".join(map(str, res)))\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nstable = [True] * n\r\nfor i in range(1, n-1):\r\n if(arr[i] == 0 and (arr[i+1] * arr[i-1] == 1)):\r\n stable[i] = False\r\n elif(arr[i] == 1 and (arr[i+1] == 0 and arr[i-1] == 0)):\r\n stable[i] = False\r\n\r\nval = [0] * n\r\nans = [i for i in arr]\r\ndist = 0\r\nidx = 0\r\nfor i in range(n):\r\n if(stable[i]):\r\n idx = i\r\n else:\r\n val[i]= i - idx\r\n\r\nfor i in range(n-1,-1,-1):\r\n if(stable[i]):\r\n idx = i\r\n else:\r\n if(idx - i <= val[i]):\r\n ans[i] = arr[i + idx - i]\r\n val[i] = idx - i\r\n else:\r\n ans[i] = arr[i - val[i]]\r\nprint(max(val))\r\nprint(*ans)", "# import collections\n# import heapq\n# import sys\n# import math\n# import itertools\n# import bisect\n# from io import BytesIO, IOBase\n# import os\n# ######################################################################################\n# #--------------------------------------func-----------------------------------------#\n# ######################################################################################\n# def valid(i,j,n,m):\n# if i<n and i>=0 and j>=0 and j< m :return True #and l[i][j]==1 and visit[i][j]\n# return False\n# def sumn(i,n):\n# return (n-i)*(i+n)/2\n\n# ######################################################################################\n# #--------------------------------------vars-----------------------------------------#\n# ######################################################################################\n# # index=[[1,0],[0,1],[-1,0],[0,-1]]\n\n# ######################################################################################\n# #--------------------------------------Input-----------------------------------------#\n# ######################################################################################\n\n\n# def value(): return tuple(map(int, input().split()))\n# def values(): return tuple(map(int, sys.stdin.readline().split()))\n# def inlst(): return [int(i) for i in input().split()]\n# def inlsts(): return [int(i) for i in sys.stdin.readline().split()]\n# def inp(): return int(input())\n# def inps(): return int(sys.stdin.readline())\n# def instr(): return input()\n# def stlst(): return [i for i in input().split()]\n\n\n# ######################################################################################\n# #--------------------------------------code here-------------------------------------#\n# ######################################################################################\n\n# def solve():\n# n = inp()\n\n\n# if __name__ == \"__main__\":\n# for i in range(inp()):\n# solve()\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\nn = int(input())\n\na = [i for i in input().split()]\n\ndef change(l, r):\n global a\n\n if l == r:\n return 0\n\n if a[l] == a[r]:\n for i in range(l+1, r):\n a[i] = a[l]\n return (r-l)//2\n else:\n m = (l+r+1)//2\n\n for i in range(l+1, m):\n a[i] = a[l]\n\n for i in range(m, r):\n a[i] = a[r]\n\n return (r-l-1)//2\n\n\nansw = 0\ncurrent = 0\n\nfor i in range(n):\n if i == n-1 or a[i] == a[i+1]:\n answ = max(answ, change(current, i))\n current = i+1\n\nprint(answ)\nprint(\" \".join(a))", "import string\nimport sys\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\nAL = string.ascii_lowercase.encode('ascii')\nOA = ord('a')\n\n\ndef stabilize(n, s):\n l = [s[0]]\n w = 0\n mw = 0\n\n def cw(j):\n nonlocal w, mw\n hw = (w + 1) // 2\n mw = max(mw, hw)\n if w % 2:\n l.extend([s[j]]*w)\n else:\n l.extend([s[j-(w+1)]]*hw)\n l.extend([s[j]]*hw)\n w = 0\n\n for i in range(1, len(s)-1):\n if s[i] == s[i-1] or s[i] == s[i+1]:\n if w:\n cw(i)\n l.append(s[i])\n else:\n w += 1\n if w:\n cw(-1)\n l.append(s[-1])\n return mw, l\n\n\ndef main():\n n = int(input())\n s = input().split()\n assert len(s) == n\n i, si = stabilize(n, s)\n print(i)\n if i != -1:\n print(' '.join(si))\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n main()\n if r.getvalue() == o:\n log(\"OK\\n\")\n else:\n log(f\"Expected:\\n{o}Got:\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n4\n0 0 1 1\n\"\"\", \"\"\"\\\n0\n0 0 1 1\n\"\"\"), (\"\"\"\\\n5\n0 1 0 1 0\n\"\"\", \"\"\"\\\n2\n0 0 0 0 0\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n", "\"\"\"\nCodeforces Round #327 (Div. 2)\n\nProblem 591 C. Median Smoothing\n\n@author yamaton\n@date 2015-11-06\n\"\"\"\n\nimport itertools as it\nimport functools\nimport operator\nimport collections\nimport math\nimport sys\n\n\n\ndef reduce_consec(xs):\n \"\"\"\n [1, 2, 3, 6, 7, 9, 10, 11, 12, 13, 20]\n --> [(1, 3), (6, 2), (9, 5), (20, 1)]\n Detect consecutive part and (starting_value, length) pair\n \"\"\"\n result = []\n stack = []\n for x in xs:\n if stack:\n if stack[-1] + 1 == x:\n stack.append(x)\n else:\n result.append((stack[0], len(stack)))\n stack = [x]\n else:\n stack.append(x)\n\n if stack:\n result.append((stack[0], len(stack)))\n return result\n\n\ndef solve(xs, n):\n zigzag = []\n for i, x in enumerate(xs):\n if i == 0 or i == n - 1:\n continue\n if xs[i-1] != x and xs[i+1] != x:\n zigzag.append(i)\n\n zigzag_start_length_pairs = reduce_consec(zigzag)\n count = 0\n result = xs[:]\n for (i, n) in zigzag_start_length_pairs:\n nHalf = n // 2\n count = max(count, (n + 1) // 2)\n if n % 2 == 0:\n for j in range(i, i + nHalf):\n result[j] = xs[i-1]\n for j in range(i + nHalf, i + n):\n result[j] = 1 - xs[i-1]\n else:\n for j in range(i, i+n):\n result[j] = xs[i-1]\n return count, result\n\n\ndef solve0(xs, n):\n \"Bruteforce\"\n def transform(ps):\n result = []\n for i in range(n):\n if i == 0 or i == n-1:\n result.append(ps[i])\n else:\n median = int(sum(ps[i-1:i+2]) >= 2)\n result.append(median)\n return tuple(result)\n\n xs = tuple(xs)\n seen = set()\n seen.add(xs)\n ys = transform(xs)\n count = 0\n while ys != xs:\n if ys in seen:\n return -1, xs\n xs = ys\n seen.add(xs)\n count += 1\n ys = transform(xs)\n\n return count, xs\n\n\ndef print_stderr(*args, **kwargs):\n print(*args, file=sys.stderr, **kwargs)\n\n\ndef main():\n n = int(input())\n xs = [int(i) for i in input().strip().split()]\n count, seq = solve(xs, n)\n print(count)\n print(' '.join(str(n) for n in seq))\n\nif __name__ == '__main__':\n main()\n", "import sys\r\n\r\n#fin = open('input.txt', 'r')\r\n#fout = open('output.txt', 'w')\r\nfin = sys.stdin\r\nfout = sys.stdout\r\n\r\nn = int(fin.readline())\r\na = fin.readline().split()\r\n\r\nleftStableIdx = [0] * n\r\ncurrLeftStableIdx = 0\r\nfor i in range(1, n - 1):\r\n if (a[i - 1] == a[i] or a[i] == a[i + 1]):\r\n currLeftStableIdx = i\r\n leftStableIdx[i] = currLeftStableIdx\r\nleftStableIdx[n - 1] = n - 1\r\n\r\nresult = [0] * n\r\ncurrRightStableIdx = n - 1\r\nnIterations = 0\r\nfor i in reversed(range(0, n)):\r\n if leftStableIdx[i] == i:\r\n result[i] = a[i]\r\n currRightStableIdx = i\r\n else:\r\n d1 = i - leftStableIdx[i]\r\n d2 = currRightStableIdx - i\r\n result[i] = a[leftStableIdx[i]] if d1 < d2 else a[currRightStableIdx]\r\n nIterations = max(nIterations, min(d1, d2))\r\n\r\nfout.write(str(nIterations) + '\\n')\r\nfout.write(' '.join(map(str, result)) + '\\n')\r\n \r\nfin.close()\r\nfout.close()\r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\n\r\ndef process(A):\r\n n = len(A)\r\n A2 = [A[0]]\r\n for i in range(n):\r\n A2.append(A[i])\r\n A2.append(A[-1])\r\n curr = [[A2[0], 1]]\r\n for i in range(1, n+2):\r\n if A2[i]==curr[-1][0]:\r\n curr[-1][1]+=1\r\n else:\r\n curr.append([A2[i], 1])\r\n m = len(curr)\r\n curr2 = []\r\n curr_run = 0\r\n answer = 0\r\n for i in range(m):\r\n t, count = curr[i]\r\n if count==1:\r\n curr_run+=1\r\n else:\r\n if curr_run > 0:\r\n if curr2[-1][0]==curr[i][0]:\r\n curr2[-1][1]+=curr_run\r\n curr2[-1][1]+=curr[i][1]\r\n else:\r\n curr2[-1][1]+=curr_run//2\r\n curr2.append(curr[i])\r\n curr2[-1][1]+=curr_run//2\r\n answer = max(answer, (curr_run+1)//2)\r\n curr_run = 0\r\n else:\r\n curr2.append(curr[i])\r\n curr2[0][1]-=1\r\n curr2[-1][1]-=1\r\n answer_list = []\r\n for t, count in curr2:\r\n for i in range(count):\r\n answer_list.append(t)\r\n return [answer, answer_list]\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\na1, a2 = process(A)\r\nprint(a1)\r\nif a1 != -1:\r\n sys.stdout.write(' '.join(map(str, a2))+'\\n')\r\n ", "def mp():\n\n return map(int,input().split())\n\ndef lt():\n\n return list(map(int,input().split()))\n\ndef pt(x):\n\n print(x)\n\n\n\nn = int(input())\n\nL = lt()\n\ncount = 0\n\ni = 0\n\nc = [None for i in range(n)]\n\nwhile i < n-1:\n\n j = i\n\n while j < n-1 and L[j] != L[j+1]:\n\n j += 1\n\n span = j-i+1\n\n for k in range(i,i+span//2):\n\n c[k] = L[i]\n\n for k in range(i+span//2,j+1):\n\n c[k] = L[j]\n\n count = max(count,(span-1)//2)\n\n i = j+1\n\n if i == n-1:\n\n c[i] = L[i]\n\nprint(count)\n\nprint(' '.join([str(r) for r in c]))\n\n \n\n\n\n# Made By Mostafa_Khaled", "\"\"\"\nCodeforces Round #327 (Div. 2)\n\nProblem 591 C. Median Smoothing\n\n@author yamaton\n@date 2015-11-06\n\"\"\"\n\n\ndef reduce_consec(iterable):\n \"\"\"\n [1, 2, 3, 6, 7, 9, 10, 11, 12, 13, 20]\n --> [(1, 3), (6, 2), (9, 5), (20, 1)]\n Detect consecutive part and (starting_value, length) pair\n\n :param xs: List of int\n :return: List of pair of int\n \"\"\"\n stack = []\n for x in iterable:\n if stack:\n # check if consective\n if stack[-1] + 1 == x:\n stack.append(x)\n # if not consecutive, flush stack and start with new element\n else:\n yield (stack[0], len(stack))\n stack = [x]\n else:\n # starting element\n stack.append(x)\n\n if stack:\n yield (stack[0], len(stack))\n\n\ndef alternating_indices(xs):\n for i, x in enumerate(xs):\n if i == 0 or i == len(xs) - 1:\n continue\n if xs[i-1] != x and xs[i+1] != x:\n yield i\n\n\ndef solve(xs, n):\n # zigzag = [] # alternating part\n # for i, x in enumerate(xs):\n # if i == 0 or i == n - 1:\n # continue\n # if xs[i-1] != x and xs[i+1] != x:\n # zigzag.append(i)\n\n zigzag = alternating_indices(xs)\n zigzag_start_length_pairs = reduce_consec(zigzag)\n count = 0\n result = xs[:]\n for (i, n) in zigzag_start_length_pairs:\n n_half = n // 2\n count = max(count, (n + 1) // 2)\n if n % 2 == 0:\n for j in range(i, i + n_half):\n result[j] = xs[i-1]\n for j in range(i + n_half, i + n):\n result[j] = 1 - xs[i-1]\n else:\n for j in range(i, i + n):\n result[j] = xs[i-1]\n return count, result\n\n\ndef solve_bruteforce(xs, n):\n def transform(ps):\n result = []\n for i in range(n):\n if i == 0 or i == n-1:\n result.append(ps[i])\n else:\n median = int(sum(ps[i-1:i+2]) >= 2)\n result.append(median)\n return tuple(result)\n\n xs = tuple(xs)\n seen = set()\n seen.add(xs)\n ys = transform(xs)\n count = 0\n while ys != xs:\n # Actually, this system always ends up to a fixed point. No cycle exists.\n if ys in seen:\n return -1, xs\n xs = ys\n seen.add(xs)\n count += 1\n ys = transform(xs)\n\n return count, xs\n\n\ndef main():\n n = int(input())\n xs = [int(i) for i in input().strip().split()]\n count, seq = solve(xs, n)\n print(count)\n print(' '.join(str(n) for n in seq))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\na = list(map(int, input().split()))\ncnt = 0\ncur = a[0]\nind = []\ni = 0\nind.append((0, 0))\nwhile i < len(a):\n left = i\n right = i\n while i + 1 < len(a) and cur != a[i + 1]:\n cur = a[i + 1]\n i += 1\n right += 1\n ind.append((left, right))\n i += 1\nmaxn = 0\nind.append((len(a) - 1, len(a) - 1))\n\nfor i in range(len(ind)):\n if (ind[i][1] - ind[i][0])//2 > maxn:\n maxn = (ind[i][1] - ind[i][0])//2\nprint(maxn)\nfor i in range(1, len(ind) - 1):\n if a[ind[i - 1][1]] == a[ind[i + 1][0]]:\n for j in range(ind[i][0], ind[i][1] + 1):\n print(a[ind[i - 1][1]], end = ' ')\n else:\n for j in range(ind[i][0], (ind[i][0] + ind[i][1] + 1) // 2):\n print(a[ind[i - 1][1]], end = ' ')\n for j in range((ind[i][0] + ind[i][1] + 1) // 2, ind[i][1] + 1):\n print(a[ind[i + 1][0]], end = ' ')\n\n\n\n\n\n \n", "input()\nseq = list(map(int, input().split()))\n\ndef make_ans(seq):\n\tans = 0\n\n\tdef is_fixed(ind):\n\t\t#ind != 0 and ind != len(seq) - 1\n\t\treturn seq[ind - 1] == seq[ind] or seq[ind] == seq[ind + 1]\n\n\tdef set_res(left, right):\n\t\tleft_begin = left\n\t\tif left == right:\n\t\t\treturn 0\n\t\t\n\t\tleft_res = seq[left - 1]\n\t\tright_res = seq[right]\n\t\tright -= 1\n\t\twhile left <= right:\n\t\t\tseq[left] = left_res\n\t\t\tseq[right] = right_res \n\t\t\tleft += 1\n\t\t\tright -= 1\n\n\t\treturn left - left_begin\n\n\tleft = 1\n\tright = 1\n\n\tfor i in range(1, len(seq) - 1):\n\t\tif not is_fixed(i):\n\t\t\tright += 1 \n\t\telse:\n\t\t\tif left == right:\n\t\t\t\tleft += 1\n\t\t\t\tright += 1\n\t\t\telse:\n\t\t\t\tans = max(ans, set_res(left, right))\n\t\t\t\tleft = right = i+1\n\tans = max(ans, set_res(left, right))\n\n\treturn ans, seq\n\ndef calc(seq):\n\t#not used\n\n\tn = 0\n\tdef is_fixed(ind):\n\t\t#ind != 0 and ind != len(seq) - 1\n\t\treturn seq[ind - 1] == seq[ind] or seq[ind] == seq[ind + 1]\n\n\tdef up(seq):\n\t\tseq_copy = seq[:]\n\t\tfor i in range(1, len(seq) - 1):\n\t\t\tif not is_fixed(i):\n\t\t\t\tseq_copy[i] = 1 - seq_copy[i]\n\t\treturn seq_copy\n\n\twhile(up(seq) != seq):\n\t\tseq = up(seq)\n\t\tn += 1\n\treturn n, seq\n\nans, seq = make_ans(seq)\nprint(ans)\nprint(\" \".join(map(str, seq)))\n\n# import random\n# for i in range(1000):\n# \ts = [random.randrange(0,2) for x in range(10)]\n# \tx, seq1 = make_ans(s[:])\n# \ty, seq2 = calc(s[:])\n# \tif seq1 != seq2:\n# \t\tprint(s)\t\n# \t\tprint(seq1)\n# \t\tprint(seq2)\n\n# \tif x != y:\n# \t\tprint(x,y)\n# \t\tprint(s)\t\n# \t\tbreak\n\n\n", "n = int(input())\na = list(map(int, input().split()))\n\nsteps = 0\ni = 0\nb = [None]*n\nwhile i < n-1:\n j = i\n while j < n-1 and a[j] != a[j+1]: j += 1\n span = j - i + 1\n half_span = span//2\n for k in range(i,i+half_span):\n b[k] = a[i]\n for k in range(i+half_span, i+span):\n b[k] = a[j]\n steps = max(steps, (span-1)//2)\n i = j+1\n if (i == n-1):\n b[i] = a[i]\n \nprint(steps)\nprint(\" \".join(map(str,b)))", "import sys\nimport re\nread = lambda: list(map(int, sys.stdin.readline().split()))\n_ = read()\n\ns = sys.stdin.readline().strip().replace(' ','')\ns = s[0] + s + s[-1]\nsegs = re.findall('(.*?)(0{2,}|1{2,})', s)\ntime = 0\nres = [segs[0][1]]\nfor i in range(1, len(segs)):\n length = len(segs[i][0])\n time = max(time, length)\n a, b = segs[i-1][1][0], segs[i][1][0]\n if a == b:\n res.append(a*length)\n else:\n res.append(a*(length//2))\n res.append(b*(length//2))\n res.append(segs[i][1])\n\nprint((time+1)//2)\nprint(' '.join(c for c in ''.join(res)[1:-1]))\n\n" ]

[ "def rotate_90_degree_anticlckwise(matrix):\r\n new_matrix = []\r\n for i in range(len(matrix[0]), 0, -1):\r\n new_matrix.append(list(map(lambda x: x[i-1], matrix)))\r\n return new_matrix\r\nn,m = map(int,input().split())\r\nmat = []\r\nfor i in range(n):\r\n temp = input()\r\n mat.append([i for i in temp])\r\nhoriz, verti = False, False\r\ncheck = True\r\nresH = []\r\nfor i in range(n):\r\n if(mat[i].count(mat[i][0]) == m):\r\n first = mat[i][0]\r\n if(resH):\r\n if(resH[-1][0] == first):\r\n resH[-1][1] += 1\r\n else:\r\n resH.append([first, 1])\r\n else:\r\n resH.append([first, 1])\r\n else:\r\n check = False\r\n break\r\n\r\nif(len(resH) == 3 and check):\r\n if(len(set([i[1] for i in resH])) == 1 and len(set([i[0] for i in resH])) == 3):\r\n horiz = True\r\n\r\nnewMat = rotate_90_degree_anticlckwise(mat)\r\n\r\n\r\ncheck = True\r\nresV = []\r\nfor i in range(m):\r\n if(newMat[i].count(newMat[i][0]) == n):\r\n first = newMat[i][0]\r\n if(resV):\r\n if(resV[-1][0] == first):\r\n resV[-1][1] += 1\r\n else:\r\n resV.append([first, 1])\r\n else:\r\n resV.append([first, 1])\r\n else:\r\n check = False\r\n break\r\n\r\nif(len(resV) == 3 and check):\r\n if(len(set([i[1] for i in resV])) == 1 and len(set([i[0] for i in resV])) == 3):\r\n verti = True\r\n\r\n\r\nif(horiz or verti):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = (int(i) for i in input().split())\nflag = []\nfor i in range(n):\n flag += [input()]\n\n\ncount = {\"R\":0,\"G\":0,\"B\":0}\n\nfor line in flag:\n for let in line:\n count[let] += 1\ncheck1 = True\nchange1 = 0\nfor i in range(n):\n if i < n-1 and flag[i][0] != flag[i+1][0]:\n change1+=1\n for j in range(m):\n if j < m-1 and flag[i][j] != flag[i][j+1]:\n check1 = False\nif change1 != 2 or len({count[\"R\"],count[\"G\"],count[\"B\"]}) > 1:\n check1 = False\n\n\ncheck2 = True\nchange2 = 0\nfor j in range(m):\n if j < m-1 and flag[0][j] != flag[0][j+1]:\n change2+=1\n for i in range(n):\n if i < n-1 and flag[i][j] != flag[i+1][j]:\n check2 = False\nif change2 != 2 or len({count[\"R\"],count[\"G\"],count[\"B\"]}) > 1:\n check2 = False\n\nif check2 or check1:\n print(\"YES\")\nelse:\n print(\"NO\")\n ", "def c(f, n, m):\r\n if n % 3 != 0:return 0\r\n s=n//3;s=f[0],f[s],f[2*s]\r\n if set(s)!=set(map(lambda x:x*m,'RGB')):return 0\r\n for i in range(n):\r\n if f[i] != s[i*3 // n]:return 0\r\n return 1\r\nn,m=map(int, input().split())\r\nf=[input() for _ in range(n)]\r\nprint('Yes'if c(f,n,m) or c([''.join(f[j][i] for j in range(n)) for i in range(m)],m,n)else'No')\r\n", "import sys\r\nn=input()\r\na=[]\r\nn,m=n.split()\r\nn=int(n)\r\nm=int(m)\r\nfor i in range(n):\r\n a.append(input())\r\nif(m%3!=0 and n%3!=0):\r\n print(\"NO\")\r\n sys.exit()\r\n\r\ncount=1\r\nfor i in a:\r\n for j in i:\r\n \r\n if(j!=i[0]):\r\n count=0\r\n break\r\n if(count==0):\r\n break\r\nif(count==1):\r\n if(n%3!=0):\r\n print(\"NO\")\r\n sys.exit()\r\n n=int(n/3)\r\n if(a[0][0]==a[n][0] or a[0][0]==a[2*n][0] or a[n][0]==a[int(2*n)][0]):\r\n print(\"NO\")\r\n sys.exit()\r\n for i in range(n):\r\n if(a[0][0]!=a[i][0] or a[n][0]!=a[n+i][0] or a[2*n][0]!=a[2*n + i][0]):\r\n print(\"NO\")\r\n sys.exit()\r\n print(\"YES\")\r\nelse:\r\n if(m%3!=0):\r\n print(\"NO\")\r\n sys.exit()\r\n for i in range(m):\r\n for j in range(n):\r\n if(a[0][i]!=a[j][i]):\r\n print(\"NO\")\r\n sys.exit()\r\n m=int(m/3)\r\n if(a[0][0]==a[0][m] or a[0][0]==a[0][2*m] or a[0][m]==a[0][int(2*m)]):\r\n print(\"NO\")\r\n sys.exit()\r\n for i in range(m):\r\n if(a[0][0]!=a[0][i] or a[0][m]!=a[0][m+i] or a[0][2*m]!=a[0][2*m + i]):\r\n print(\"NO\")\r\n sys.exit()\r\n print(\"YES\")\r\n ", "n,m = map(int,input().split())\r\nmark = 1\r\ns = []\r\nfor i in range(n):\r\n tmp = input()\r\n s.append(tmp)\r\n for c in range(m):\r\n if c + 1 < m and tmp[c] != tmp[c + 1]:\r\n mark = 0\r\nr = 0\r\ng = 0\r\nb = 0\r\nfor a in s:\r\n for c in a:\r\n if c =='R':\r\n r = r + 1\r\n if c == 'G':\r\n g = g + 1\r\n if c == 'B':\r\n b = b + 1\r\nif mark == 1:\r\n num = 1\r\n w = []\r\n for i in range(n):\r\n if i + 1 < n and s[i][0] == s[i + 1][0]:\r\n num = num + 1\r\n else:\r\n w.append(int(num))\r\n num = 1\r\n for i in range(len(w)):\r\n if i + 1 < len(w) and w[i] != w[i + 1]:\r\n mark = 2\r\n if mark == 1 and len(w) == 3 and r == g and g == b:\r\n print (\"YES\")\r\n else:\r\n print (\"NO\")\r\nelse:\r\n for y in range(m):\r\n for x in range(n):\r\n if x + 1 < n and s[x][y] != s[x + 1][y]:\r\n mark = 2\r\n break\r\n if mark == 2:\r\n print (\"NO\")\r\n else:\r\n num = 1\r\n w = []\r\n for i in range(m):\r\n if i + 1 < m and s[0][i] == s[0][i + 1]:\r\n num = num + 1\r\n else:\r\n w.append(int(num))\r\n num = 1\r\n for i in range(len(w)):\r\n if i + 1 < len(w) and w[i] != w[i + 1]:\r\n mark = 2\r\n if mark == 0 and len(w) == 3 and r == g and g ==b:\r\n print (\"YES\")\r\n else:\r\n print (\"NO\")", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\nn, m = map(int, input().split())\r\nf = []\r\nfor i in range(n): f.append(input())\r\nif n%3 == 0:\r\n R = []\r\n for i in range(n//3): R.append('R'*m)\r\n B = []\r\n for i in range(n//3): B.append('B'*m)\r\n G = []\r\n for i in range(n//3): G.append('G'*m)\r\n if f == R+B+G or f == R+G+B:\r\n print(\"YES\")\r\n exit()\r\n if f == B+R+G or f == B+G+R:\r\n print(\"YES\")\r\n exit()\r\n if f == G+B+R or f == G+R+B:\r\n print(\"YES\")\r\n exit()\r\nif m%3 == 0:\r\n R = 'R'*(m//3)\r\n B = 'B'*(m//3)\r\n G = 'G'*(m//3)\r\n if f == [R+B+G]*n or f == [R+G+B]*n:\r\n print(\"YES\")\r\n exit()\r\n if f == [B+G+R]*n or f == [B+R+G]*n:\r\n print(\"YES\")\r\n exit()\r\n if f == [G+B+R]*n or f == [G+R+B]*n:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "#! /usr/bin/python3\nimport sys\n\ndef verifyFlag(flagList, row, column):\n if row%3 != 0:\n return False\n\n q = row // 3 #since there are 3 equal parts\n u = [flagList[(0 * q)], flagList[(1 * q)], flagList[(2 * q)]]\n us = set(u) #removes duplicates\n\n patternToMatch = set()\n for color in ['R', 'G', 'B']:\n patternToMatch.add(color*column)\n\n if us != patternToMatch:\n return False\n\n for i,row in enumerate(flagList):\n if row != u[i//q]:\n return False\n return True\n\ndef main():\n n, m = map(int,sys.stdin.readline().split())\n\n #get the horizontal columns\n a = []\n for i in range(n):\n a.append(sys.stdin.readline().rstrip())\n\n #get the vertical columns\n b = []\n for i in range(m):\n temp = ''\n for j in range(n):\n temp += a[j][i]\n b.append(temp)\n\n rv1 = verifyFlag(a,n,m)\n rv2 = verifyFlag(b,m,n)\n\n if rv1 or rv2:\n print('YES')\n else:\n print('NO')\n\nmain()", "def f(n, m, g):\r\n if n % 3:\r\n return False\r\n c = g[0][0] + g[n // 3][0] + g[n // 3 * 2][0]\r\n if len(set(c)) < 3:\r\n return False\r\n f = [c[i // (n // 3)] * m for i in range(n)]\r\n return f == g\r\nn, m = map(int, input().split())\r\ng = [input() for i in range(n)]\r\nprint('YES' if f(n, m, g) or f(m, n, [''.join(g[i][j] for i in range(n)) for j in range(m)]) else 'NO')", "height, width = map(int, input().split())\na = [input() for i in range(height)]\nc = {'r': 0, 'g': 0, 'b': 0}\np = {'r': 0, 'g': 0, 'b': 0}\ncolor = {'r': False, 'g': False, 'b': False}\nhorizontal, vertical = True, False\n\nfor i in range(height):\n for j in range(width):\n color[a[i][j].lower()] = True\n\nfor i in range(height):\n for j in range(1, width):\n if a[i][j] != a[i][j - 1]:\n horizontal = False\n break\n c[a[i][j].lower()] += 1\n\nif not horizontal:\n vertical = True\n for key in c.keys():\n c[key] = 0\n for i in range(width):\n for j in range(1, height):\n if a[j][i] != a[j - 1][i]:\n vertical = False\n break\n c[a[j][i].lower()] += 1\n\nprev = None\nif horizontal:\n for i in range(height):\n if prev is None:\n prev = a[i][0].lower()\n c[a[i][0].lower()] += 1\n p[a[i][0].lower()] += 1\n else:\n if prev != a[i][0].lower():\n p[a[i][0].lower()] += 1\n if p[a[i][0].lower()] >= 2:\n print('NO')\n exit()\n prev = a[i][0].lower()\n c[a[i][0].lower()] += 1\nelif vertical:\n for i in range(width):\n if prev is None:\n prev = a[0][i].lower()\n c[a[0][i].lower()] += 1\n else:\n if prev != a[0][i].lower():\n p[a[0][i].lower()] += 1\n if p[a[0][i].lower()] >= 2:\n print('NO')\n exit()\n prev = a[0][i].lower()\n c[a[0][i].lower()] += 1\nelse:\n print('NO')\n exit()\n\nif c['r'] == c['g'] == c['b'] and color['r'] and color['g'] and color['b']:\n print('YES')\nelse:\n print('NO')\n", "from typing import List\n\ndef flag_of_Berland(n: int, m: int, f: List[str]) -> str:\n # check horizontal strip\n def horizontal_flag():\n if n%3 != 0:\n return 'NO'\n k = n // 3\n first = f[0][0]\n second = f[k][0]\n third = f[2*k][0]\n if first == second or first == third or second == third:\n return 'NO'\n for i in range(k):\n for j in range(m):\n if f[i][j] != first:\n return 'NO'\n\n for i in range(k, 2*k):\n for j in range(m):\n if f[i][j] != second:\n return 'NO'\n\n for i in range(2*k, n):\n for j in range(m):\n if f[i][j] != third:\n return 'NO'\n \n return 'YES'\n \n def vertical_flag():\n if m%3 != 0:\n return 'NO'\n k = m // 3\n first = f[0][0]\n second = f[0][k]\n third = f[0][2*k]\n if first == second or first == third or second == third:\n return 'NO'\n for i in range(n):\n for j in range(k):\n if f[i][j] != first:\n return 'NO'\n\n for i in range(n):\n for j in range(k, 2*k):\n if f[i][j] != second:\n return 'NO'\n\n for i in range(n):\n for j in range(2*k, m):\n if f[i][j] != third:\n return 'NO'\n\n return 'YES'\n \n if horizontal_flag() == 'YES':\n return 'YES'\n return vertical_flag()\n\nn, m = map(int, input().split())\na = []\nfor i in range(n):\n a.append(input())\nprint(flag_of_Berland(n, m, a))\n", "# https://codeforces.com/contest/837/problem/B\n# B. Флаг Берляндии\n\n\ndef is_horizontal():\n if n % 3 == 0:\n colors = {}\n diff_colors = set()\n stripe_hight = n // 3\n for k in range(3):\n colors[k] = flag[k * stripe_hight][0]\n diff_colors.add(colors[k])\n for i in range(k * stripe_hight, k * stripe_hight + stripe_hight):\n for j in range(m):\n if flag[i][j] != colors[k]:\n return False\n if len(diff_colors) != 3:\n return False\n return True\n\n\ndef is_vertical():\n if m % 3 == 0:\n colors = {}\n diff_colors = set()\n width = m // 3\n for k in range(3):\n colors[k] = flag[0][k * width]\n diff_colors.add(colors[k])\n for j in range(k * width, k * width + width):\n for i in range(n):\n if flag[i][j] != colors[k]:\n return False\n if len(diff_colors) != 3:\n return False\n return True\n\n\ndef is_flag():\n if n % 3 == 0 or m % 3 == 0:\n if is_horizontal() or is_vertical():\n return \"YES\"\n return \"NO\"\n\n\nn, m = map(int, input().split())\nflag = []\nfor i in range(n):\n flag.append(input())\n\n\nprint(is_flag())\n", "def check(a):\n cur = a[0][0]\n d = {}\n for p in a:\n if p[0] != cur and p[0] in d:\n return 0\n cur = p[0]\n if not all([x == cur for x in p]):\n return 0\n d[cur] = d.get(cur, 0) + 1\n if len(d) != 3:\n return 0\n if not 'R' in d or not 'G' in d or not 'B' in d:\n return 0\n cnt = d['R']\n if d['G'] != cnt or d['B'] != cnt:\n return 0\n return 1\n\n\nn, m = map(int, input().split())\na = [list(input()) for i in range(n)]\nif check(a):\n print(\"YES\")\nelse:\n a = list(map(list, zip(*a)))\n if check(a):\n print(\"YES\")\n else:\n print(\"NO\")", "import sys\r\nn, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nif n % 3 and m % 3:\r\n print('NO')\r\n sys.exit()\r\nb = []\r\nc = []\r\nf1 = True\r\nf2 = True\r\nst = ''\r\nif n % 3 == 0:\r\n i = 0\r\n s = set()\r\n while i < n:\r\n if a[i][0] in s:\r\n f1 = False\r\n break\r\n s.add(a[i][0])\r\n for j in range(n//3):\r\n b.append(a[i][0]*m)\r\n i += n//3\r\nif m % 3 == 0:\r\n i = 0\r\n s = set()\r\n while i < m:\r\n if a[0][i] in s:\r\n f2 = False\r\n break\r\n s.add(a[0][i])\r\n st += a[0][i]*(m//3)\r\n i += m//3\r\nfor i in range(n):\r\n c.append(st)\r\nif not(f1) and not(f2):\r\n print('NO')\r\nelif f1 and a==b or f2 and a==c:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#Функция exit() модуля sys - выход из Python. Она реализуется путем вызова исключения SystemExit, поэтому выполняются действия по очистке, указанные в предложениях finally операторов try и можно перехватить попытку выхода на внешнем уровне.\r\nn, m = map(int, input().split())\r\nflag = [list() for x in range(n)]\r\nh1 = True\r\nfor i in range(n):\r\n li= input()\r\n flag[i] = li\r\nc0 = flag[0][0]\r\nline = flag[0]\r\nfor j in range(1,m):\r\n if line[j] != c0:\r\n h1 = False\r\nif not h1:\r\n\tcc = m / 3\r\n\tif m % 3 != 0:\r\n\t\tprint('NO')\r\n\t\texit()\r\n\tch = ''\r\n\tcolor_ver = []\r\n\tfor i in range(n):\r\n\t\tline = flag[i]\r\n\t\tkol = 0\r\n\t\tfor j in range(m):\r\n\t\t\tif j % cc == 0:\r\n\t\t\t\tif j != 0:\r\n\t\t\t\t\tkol +=1\r\n\t\t\t\tnew_color = line[j]\r\n\t\t\t\tif new_color in color_ver and i == 0:\r\n\t\t\t\t\tprint('NO')\r\n\t\t\t\t\texit()\r\n\t\t\t\telse:\r\n\t\t\t\t\tcolor_ver.append(new_color)\r\n\t\t\t\tif new_color == ch:\r\n\t\t\t\t\tprint('NO')\r\n\t\t\t\t\texit()\r\n\t\t\t\telse:\r\n\t\t\t\t\tch = new_color\r\n\t\t\t\tif ch != color_ver[kol]:\r\n\t\t\t\t\tprint('NO')\r\n\t\t\t\t\texit()\r\n\t\t\tif line[j] != ch:\r\n\t\t\t\tprint('NO')\r\n\t\t\t\texit()\r\nelse:\r\n\tcc = n / 3\r\n\tif n % 3 != 0:\r\n\t\tprint('NO')\r\n\t\texit()\r\n\tco = ''\r\n\tch = list()\r\n\tkol = 0\r\n\tfor i in range(n):\r\n\t\tline = flag[i]\r\n\t\tif i % cc == 0:\r\n\t\t\tif i != 0:\r\n\t\t\t\tkol +=1\r\n\t\t\tnew_color = line[0]\r\n\t\t\tif new_color in ch:\r\n\t\t\t\tprint('NO')\r\n\t\t\t\texit()\r\n\t\t\telse:\r\n\t\t\t\tch.append(new_color)\r\n\t\t\tif new_color != co:\r\n\t\t\t\tco = new_color\r\n\t\t\telse:\r\n\t\t\t\tprint('NO')\r\n\t\t\t\texit()\r\n\t\tfor j in range(m):\r\n\t\t\tif line[j] != co:\r\n\t\t\t\tprint('NO')\r\n\t\t\t\texit()\r\nprint('YES')", "n, m = map(int, input().split())\nfl = [input() for i in range(n)]\nc1 = fl[0][0]\nBOOL = False\nfor i in range(n):\n if fl[i][0] != c1:\n BOOL = True\n break\nif BOOL:\n BOOL = False \n if n % 3 == 0:\n for i in range(n // 3)[:n//3]:\n for j in range(m):\n if fl[i][j] != c1:\n BOOL = True\n c2 = fl[n//3][0]\n if not BOOL:\n for i in range(n)[n//3:-(n//3)]:\n for j in range(m):\n if fl[i][j] != c2:\n BOOL = True\n c3 = fl[-(n//3)][0]\n if not BOOL:\n for i in range(n)[-(n//3):]:\n for j in range(m):\n if fl[i][j] != c3:\n BOOL = True\n if c1 == c2 or c2 == c3 or c1 == c3:\n print('NO')\n else:\n if BOOL:\n print('NO')\n else:\n print('YES')\n else:\n print('NO')\nelse:\n if m % 3 == 0:\n for i in range(m)[:m//3]:\n for j in range(n):\n if fl[j][i] != c1:\n BOOL = True\n c2 = fl[0][m//3]\n if not BOOL:\n for i in range(m)[m//3:-(m//3)]:\n for j in range(n):\n if fl[j][i] != c2:\n BOOL = True\n c3 = fl[0][-(m//3)]\n if not BOOL:\n for i in range(m)[-(m//3):]:\n for j in range(n):\n if fl[j][i] != c3:\n BOOL = True\n if c1 == c2 or c2 == c3 or c1 == c3:\n print('NO')\n else:\n if BOOL:\n print('NO')\n else:\n print('YES')\n else:\n print('NO')\n", "import sys\n\n\nr, c = [int(x) for x in input().split()]\nV = []\nfor i in range(r):\n V.append(input())\n\nd = {'R':0, 'G':0, 'B':0}\nnapa = True\nzeta = []\nfor i in range(r):\n alpha = V[i][0]\n if len(zeta) != 0:\n if alpha != zeta[-1] and alpha in zeta:\n napa = False\n break\n else:\n zeta.append(alpha)\n else:\n zeta.append(alpha)\n for j in range(c):\n if V[i][j] == alpha:\n continue\n else:\n napa = False\n if not napa:\n break\n else:\n d[alpha] += 1\nif napa == True:\n if d['R'] == d['G'] == d['B']:\n print('YES')\n sys.exit(0)\n else:\n print('NO')\n sys.exit(0)\n\nd = {'R':0, 'G':0, 'B':0}\nnapa = True\nzeta = []\nfor i in range(c):\n alpha = V[0][i]\n if len(zeta) != 0:\n if alpha != zeta[-1] and alpha in zeta:\n napa = False\n break\n else:\n zeta.append(alpha)\n else:\n zeta.append(alpha)\n for j in range(r):\n if V[j][i] == alpha:\n continue\n else:\n napa = False\n if not napa:\n break\n else:\n d[alpha] += 1\nif napa == True:\n if d['R'] == d['G'] == d['B']:\n print('YES')\n sys.exit(0)\n else:\n print('NO')\n sys.exit(0)\nelse:\n print('NO')\n", "def fn(s):\r\n ans=True\r\n for i in range(len(s)-1):\r\n if s[i]!=s[i+1]:\r\n ans=False\r\n return ans \r\ndef chk(n,m,l):\r\n if n%3!=0:\r\n return False\r\n w=n//3\r\n #print(w)\r\n ls=[]\r\n ans=True\r\n for i in range(0,3):\r\n s=\"\"\r\n for j in range(i*w,i*w+w):\r\n #print(i,j)\r\n s+=l[j]\r\n ls.append(s)\r\n for i in range(3):\r\n ans=ans and fn(ls[i])\r\n return ans and ls[0]!=ls[1] and ls[1]!=ls[2] and ls[0]!=ls[2]\r\nn,m=map(int,input().strip().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(str(input()))\r\nif n%3!=0:\r\n x='v'\r\nelif m%3!=0:\r\n x='h'\r\nelse:\r\n x='h'\r\n for i in range(m-1):\r\n if l[0][i]!=l[0][i+1]:\r\n x='v'\r\nif x=='h':\r\n flag=chk(n,m,l)\r\nelif x=='v':\r\n ls=[]\r\n for i in range(m):\r\n s=\"\"\r\n for j in range(n):\r\n s+=l[j][i]\r\n ls.append(s)\r\n flag=chk(m,n,ls)\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left,bisect\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nn,m=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(input()[:-1])\r\nc1,c2=0,0\r\nv=dc(int)\r\nh=dc(int)\r\nfor i in range(n):\r\n v[l[i][0]]+=1\r\nfor i in range(m):\r\n h[l[0][i]]+=1\r\nif v['R']==v['G'] and v['G']==v['B']:\r\n f=0\r\n p=l[0][0]\r\n for i in range(v['R']):\r\n for j in range(m):\r\n if l[i][j]!=p:\r\n f=1\r\n break\r\n if f==0:\r\n p=l[v['R']][0]\r\n for i in range(v['R'],2*v['R']):\r\n for j in range(m):\r\n if l[i][j]!=p:\r\n f=1\r\n break\r\n if f==0:\r\n p=l[2*v['R']][0]\r\n for i in range(2*v['R'],n):\r\n for j in range(m):\r\n if l[i][j]!=p:\r\n f=1\r\n break\r\n if f==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif h['R']==h['G'] and h['G']==h['B']:\r\n f=0\r\n p=l[0][0]\r\n for i in range(n):\r\n for j in range(h['R']):\r\n if l[i][j]!=p:\r\n f=1\r\n break\r\n if f==0:\r\n p=l[0][h['R']]\r\n for i in range(n):\r\n for j in range(h['R'],2*h['R']):\r\n if l[i][j]!=p:\r\n f=1\r\n break\r\n if f==0:\r\n p=l[0][2*h['R']]\r\n for i in range(n):\r\n for j in range(2*h['R'],m):\r\n if l[i][j]!=p:\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 \r\n ", "def by_col(n,m,lines):\r\n\torders=[None]*3\r\n\tn_div_3=n//3\r\n\tfor i in range(3):\r\n\t\tcur_char=None\r\n\t\tfor j in range(n_div_3):\r\n\t\t\tline=lines[i*n_div_3+j]\r\n\t\t\tchar=line[0]\r\n\t\t\tif cur_char==None:\r\n\t\t\t\tcur_char=char\r\n\t\t\telse:\r\n\t\t\t\tif char!=cur_char:\r\n\t\t\t\t\treturn 'NO'\r\n\t\t\tif line.count(char)!=m or (char in orders):\r\n\t\t\t\treturn 'NO'\r\n\t\torders[i]=cur_char\r\n\treturn 'YES'\r\n\r\ndef by_row(n,m,lines):\r\n\tm_div_3=m//3\r\n\tcompare_line=None\r\n\tfor i in range(n):\r\n\t\tline=lines[i]\r\n\t\tif compare_line==None:\r\n\t\t\tsub_1=line[:m_div_3]\r\n\t\t\tif sub_1.count(sub_1[0])!=m_div_3:\r\n\t\t\t\treturn 'NO'\r\n\t\t\tsub_2=line[m_div_3:m_div_3*2]\r\n\t\t\tif sub_2.count(sub_2[0])!=m_div_3:\r\n\t\t\t\treturn 'NO'\r\n\t\t\tsub_3=line[m_div_3*2:]\r\n\t\t\tif sub_3.count(sub_3[0])!=m_div_3:\r\n\t\t\t\treturn 'NO'\r\n\t\t\tif sub_1!=sub_2 and sub_1!=sub_3 and sub_2!=sub_3:\r\n\t\t\t\tcompare_line=line\r\n\t\t\telse:\r\n\t\t\t\treturn 'NO'\r\n\t\telse:\r\n\t\t\tif line!=compare_line:\r\n\t\t\t\treturn 'NO'\r\n\treturn 'YES'\r\n\r\nn,m=map(int,input().split())\r\nn_mod_3=n%3\r\nm_mod_3=m%3\r\nif (n_mod_3!=0 and m_mod_3!=0) or (n<3 and m<3):\r\n\tprint('NO')\r\n\texit()\r\nlines=[None]*n\r\nfor i in range(n):\r\n\tlines[i]=input()\r\n\r\nif n_mod_3==0 and m_mod_3!=0:\r\n\tprint(by_col(n,m,lines))\r\nelif n_mod_3!=0 and m_mod_3==0:\r\n\tprint(by_row(n,m,lines))\r\nelse:\r\n\tif by_col(n,m,lines)=='YES' or by_row(n,m,lines)=='YES':\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "n, m = map(int, input().split())\r\na = [input() for q in range(n)]\r\nnaw = a[0][0]\r\nflag = n % 3 == 0 and a[0][0] != a[n//3][0] and a[0][0] != a[n//3*2][0] and a[n//3][0] != a[n//3*2][0]\r\nfor q in range(n//3):\r\n for q1 in range(len(a[q])):\r\n if a[q][q1] != naw:\r\n flag = False\r\nnaw = a[n//3][0]\r\nfor q in range(n//3, 2*n//3):\r\n for q1 in range(len(a[q])):\r\n if a[q][q1] != naw:\r\n flag = False\r\nnaw = a[n//3*2][0]\r\nfor q in range(n//3*2, n):\r\n for q1 in range(len(a[q])):\r\n if a[q][q1] != naw:\r\n flag = False\r\nif flag:\r\n print('YES')\r\nelse:\r\n s = [[a[q][q1] for q in range(n)] for q1 in range(m)]\r\n n, m, a = m, n, s\r\n naw = a[0][0]\r\n flag = n % 3 == 0 and a[0][0] != a[n // 3][0] and a[0][0] != a[n // 3 * 2][0] and a[n // 3][0] != a[n // 3 * 2][0]\r\n for q in range(n // 3):\r\n for q1 in range(len(a[q])):\r\n if a[q][q1] != naw:\r\n flag = False\r\n naw = a[n // 3][0]\r\n for q in range(n // 3, 2 * n // 3):\r\n for q1 in range(len(a[q])):\r\n if a[q][q1] != naw:\r\n flag = False\r\n naw = a[n // 3 * 2][0]\r\n for q in range(n // 3 * 2, n):\r\n for q1 in range(len(a[q])):\r\n if a[q][q1] != naw:\r\n flag = False\r\n if flag:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "n, m = map(int, input().split())\r\nA = [input() for _ in range(n)]\r\nif n % 3 == 0:\r\n k = n // 3\r\n s1 = set()\r\n s2 = set()\r\n s3 = set()\r\n for i in range(k):\r\n for j in range(m):\r\n s1.add(A[i][j])\r\n for i in range(k, 2 * k):\r\n for j in range(m):\r\n s2.add(A[i][j])\r\n for i in range(2 * k, 3 * k):\r\n for j in range(m):\r\n s3.add(A[i][j])\r\n if len(s1) == len(s2) == len(s3) == 1 and len(s1 | s2 | s3) == 3:\r\n print('YES')\r\n exit(0)\r\nB = [['0'] * n for _ in range(m)]\r\nfor i in range(n):\r\n for j in range(m):\r\n B[j][i] = A[i][j]\r\nA = B\r\nn, m =m ,n\r\nif n % 3 == 0:\r\n k = n // 3\r\n s1 = set()\r\n s2 = set()\r\n s3 = set()\r\n for i in range(k):\r\n for j in range(m):\r\n s1.add(A[i][j])\r\n for i in range(k, 2 * k):\r\n for j in range(m):\r\n s2.add(A[i][j])\r\n for i in range(2 * k, 3 * k):\r\n for j in range(m):\r\n s3.add(A[i][j])\r\n if len(s1) == len(s2) == len(s3) == 1 and len(s1 | s2 | s3) == 3:\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "def vertical():\r\n if n % 3 == 0:\r\n num = n // 3\r\n res = [data[0][0], data[num][0], data[num * 2][0]]\r\n if 'R' not in res or 'G' not in res or 'B' not in res:\r\n return False\r\n for i in range(0, n):\r\n if data[i] != res[i // num] * m:\r\n return False\r\n return True\r\n else:\r\n return False\r\ndef horizontal():\r\n if m % 3 == 0:\r\n num = m // 3\r\n res = [data[0][0], data[0][num], data[0][num * 2]]\r\n if 'R' not in res or 'G' not in res or 'B' not in res:\r\n return False\r\n for i in range(0, m):\r\n col = ''\r\n for j in range(0, n):\r\n col += data[j][i]\r\n if col != res[i // num] * n:\r\n return False\r\n return True\r\n else:\r\n return False\r\nn,m = map(int, input().split())\r\ndata = []\r\nfor i in range(n):\r\n s=str(input())\r\n data.append(s)\r\nif n % 3 != 0 and m % 3 != 0:\r\n print(\"No\")\r\n exit(0)\r\nver_rs = vertical()\r\nhor_rs = horizontal()\r\nif hor_rs or ver_rs:\r\n print('YES')\r\nelse:\r\n print('No')", "def f(n,m,a):\r\n # horizontal\r\n d = dict()\r\n if n % 3 == 0:\r\n k = n // 3\r\n else:\r\n return False\r\n c = a[0][0]\r\n d = {}\r\n d[1] = c\r\n for i in range(k):\r\n for j in range(m):\r\n if c == a[i][j]:\r\n pass\r\n else:\r\n return False\r\n c = a[k][0]\r\n d[2] = c\r\n for i in range(k):\r\n for j in range(m):\r\n if c == a[k+i][j]:\r\n pass\r\n else:\r\n return False \r\n c = a[2*k][0]\r\n d[3] = c\r\n for i in range(k):\r\n for j in range(m):\r\n if c == a[2*k+i][j]:\r\n pass\r\n else:\r\n return False \r\n if d[1] != d[2] and d[2] != d[3] and d[3] != d[1]:\r\n return True\r\n else:\r\n return False\r\n\r\nn,m = list(map(int, input().strip().split()))\r\nh, v = [], []\r\nfor i in range(n):\r\n s = str(input())\r\n r = []\r\n for el in s:\r\n r.append(el)\r\n h.append(r)\r\n\r\nfor i in range(m):\r\n r = []\r\n for j in range(n):\r\n r.append(h[j][i])\r\n v.append(r)\r\n\r\nif f(n,m,h) or f(m,n,v):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def tran(lis, b,n,m): \r\n for i in range(m): \r\n for j in range(n): \r\n b[i][j] = lis[j][i] \r\ndef call(n,lis):\r\n ans=[]\r\n cv=1\r\n for i in range(0,n,n//3):\r\n a=[]\r\n for j in range(n//3):\r\n a+=lis[i+j]\r\n a=set(a)\r\n if len(a)>1:\r\n cv=0\r\n break\r\n b=list(a)[0]\r\n ans.append(b)\r\n if len(set(ans))!=3:\r\n cv=0\r\n if cv==1:\r\n print(\"YES\")\r\n exit()\r\nn,m = map(int,input().split())\r\nlis=[]\r\nb = [[0 for x in range(n)] for y in range(m)]\r\nfor i in range(n):\r\n l = list(input())\r\n lis.append(l)\r\nif n%3!=0 and m%3!=0:\r\n print(\"NO\")\r\n exit()\r\nif n%3==0:\r\n call(n,lis)\r\nif m%3==0:\r\n tran(lis,b,n,m)\r\n call(m,b)\r\nprint(\"NO\")", "# First of all, we should validate the input by checking the eligibilities in a function called 'validate_flag'\r\n \r\ndef validate_flag(field: list) -> bool:\r\n # First, we validate the number of colors in the field\r\n total_colors = set()\r\n for row in field:\r\n total_colors.update(row)\r\n # If it is not exactly 3 colors, return false\r\n if len(total_colors) != 3:\r\n return False\r\n \r\n r,g,b=0,0,0\r\n # Now we keep a count of the colors and see whether each color appears (n/3) times.\r\n for i in range(len(field)):\r\n colors = set(field[i])\r\n if len(colors) != 1:\r\n return False\r\n color = colors.pop()\r\n if color == 'R':\r\n r += 1\r\n elif color == 'G':\r\n g += 1\r\n elif color == 'B':\r\n b += 1\r\n \r\n if i != 0 and len(set(field[i])) == 1 and field[i][0] != field[i - 1][0]:\r\n if i % (len(field) // 3) != 0:\r\n return False\r\n \r\n if r==g==b:\r\n return True\r\n \r\n return False \r\n\r\n\r\n \r\ndef solve() -> None:\r\n \r\n # Read Input\r\n n,m = [int(num) for num in input().strip().split()]\r\n field = []\r\n for i in range(n):\r\n field.append(list(input().strip()))\r\n\r\n flag_vertical = validate_flag(field)\r\n\r\n # Transpose the input for horizontal flag comparision\r\n trans_field=list(map(list,zip(*field))) \r\n flag_horizontal = validate_flag(trans_field)\r\n\r\n # If either of the horizontal or vertical flag is True, then the input is a a flag. Else Not.\r\n if flag_vertical or flag_horizontal:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\n\r\n\r\n# Testing the function using assert for the given test Cases\r\nsolve()\r\n", "n, m = map(int, input().split())\r\nfield = [input() for i in range(n)]\r\n\r\nif n % 3 == 0:\r\n size = n // 3\r\n flag = True\r\n block = set()\r\n stripes = set()\r\n for i in range(n):\r\n if i % size == 0:\r\n block = set()\r\n for j in range(m):\r\n block.add(field[i][j])\r\n if (i + 1) % size == 0:\r\n if len(block) > 1:\r\n flag = False\r\n else:\r\n stripes.add(list(block)[0])\r\n if len(stripes) != 3:\r\n flag = False\r\n if flag:\r\n print('YES')\r\n exit(0)\r\n\r\nif m % 3 == 0:\r\n size = m // 3\r\n flag = True\r\n block = set()\r\n stripes = set()\r\n for j in range(m):\r\n if j % size == 0:\r\n block = set()\r\n for i in range(n):\r\n block.add(field[i][j])\r\n if (j + 1) % size == 0:\r\n if len(block) > 1:\r\n flag = False\r\n else:\r\n stripes.add(list(block)[0])\r\n if len(stripes) != 3:\r\n flag = False\r\n if flag:\r\n print('YES')\r\n exit(0)\r\n\r\nprint('NO')\r\n", "from copy import deepcopy\r\nn, m = map(int, input().split())\r\n\r\nl = [0 for i in range(n)]\r\n\r\nfor i in range(n):\r\n l[i] = input()\r\n# print(l)\r\n\r\nf1 = 0\r\nf2 = 0\r\nfor i in range(n):\r\n cnt = [0, 0, 0]\r\n for j in range(m):\r\n if (l[i][j] == 'R'):\r\n cnt[0] += 1\r\n if (l[i][j] == 'G'):\r\n cnt[1] += 1\r\n if (l[i][j] == 'B'):\r\n cnt[2] += 1\r\n if not ((cnt[0] == 0 and cnt[1] == 0) or (cnt[1] == 0 and cnt[2] == 0) or (cnt[2] == 0) and cnt[0] == 0):\r\n f1 = 1\r\n\r\nfor j in range(m):\r\n cnt = [0, 0, 0]\r\n for i in range(n):\r\n if (l[i][j] == 'R'):\r\n cnt[0] += 1\r\n if (l[i][j] == 'G'):\r\n cnt[1] += 1\r\n if (l[i][j] == 'B'):\r\n cnt[2] += 1\r\n if not ((cnt[0] == 0 and cnt[1] == 0) or (cnt[1] == 0 and cnt[2] == 0) or (cnt[2] == 0) and cnt[0] == 0):\r\n f2 = 1\r\n\r\nif (f1 == 1 and f2 == 1):\r\n print('NO')\r\n exit(0)\r\nif (f2 == 0):\r\n l1 = [[0 for i in range(n)] for j in range(m)]\r\n for i in range(n):\r\n for j in range(m):\r\n l1[j][i] = l[i][j]\r\n n, m = m, n\r\n l = deepcopy(l1)\r\n\r\nr = []\r\ng = []\r\nb = []\r\nfor i in range(n):\r\n if (l[i][0] == 'R'):\r\n r.append(i)\r\n if (l[i][0] == 'G'):\r\n g.append(i)\r\n if (l[i][0] == 'B'):\r\n b.append(i)\r\nans = 0\r\nif (len(r) != len(g) or len(r) != len(b) or len(r) != len(g)):\r\n ans = 1\r\nfor i in range(len(r) - 1):\r\n if (r[i+1] - r[i] != 1):\r\n ans = 1\r\nfor i in range(len(g) - 1):\r\n if (g[i+1] - g[i] != 1):\r\n ans = 1\r\nfor i in range(len(b) - 1):\r\n if (b[i+1] - b[i] != 1):\r\n ans = 1\r\nif (ans == 1):\r\n print('NO')\r\n exit(0)\r\nprint('YES')", "import itertools\r\n\r\ndef check(lst):\r\n\tif not all(row.count(row[0]) == len(row) for row in lst): return False\r\n\t_ = [[k, list(g)] for k,g in itertools.groupby([x[0] for x in lst])]\r\n\tkeys, groups = zip(*_)\r\n\tkeys = list(keys)\r\n\treturn len(keys) == len(set(keys)) == 3 \\\r\n\t\tand \\\r\n\t\tlen(set( [len(list(x)) for x in groups] )) == 1\r\n\r\nimport sys\r\nnrow, ncol = map(int, sys.stdin.readline().split(' '))\r\ndata = list( map(list, sys.stdin.read().split('\\n')[:nrow]) )\r\nsys.stdout.write(\"YES\" if check(data) or check(list(zip(*data))) else \"NO\") ", "import sys\r\n#sys.stdin = open(\"input2\",\"r\")\r\n\r\nn,m = map(int,input().split())\r\ns = []\r\nfor i in range(n):\r\n string = input()\r\n s.append(string)\r\nno = 0\r\n# row mix check\r\nr_mix = 0\r\nfor i in range(n):\r\n cnt_r = s[i].count('R')\r\n cnt_b = s[i].count('B')\r\n cnt_g = s[i].count('G')\r\n\r\n if ((cnt_r and cnt_b) or (cnt_b and cnt_g) or (cnt_g and cnt_r) ):\r\n r_mix = 1\r\n# col mix check\r\nc_mix = 0\r\nfor j in range(m):\r\n cnt_r = cnt_b = cnt_g = 0\r\n for i in range(n):\r\n if (s[i][j] == 'R'):\r\n cnt_r += 1\r\n elif (s[i][j] == 'B'):\r\n cnt_b += 1\r\n elif(s[i][j] == 'G'):\r\n cnt_g += 1\r\n if ((cnt_r and cnt_b) or (cnt_b and cnt_g) or (cnt_g and cnt_r) ):\r\n c_mix = 1\r\n\r\nif (r_mix == 1 and c_mix == 1) or ( r_mix == 0 and c_mix == 0):\r\n no = 1\r\n\r\nif(r_mix == 1):\r\n cnt_b = cnt_g = cnt_r = 0\r\n if s[0][0] == 'R':\r\n cnt_r += 1\r\n elif s[0][0] == 'G':\r\n cnt_g += 1\r\n elif s[0][0] == 'B':\r\n cnt_b += 1\r\n f,c = -1,1\r\n for j in range(0,m-1):\r\n if s[0][j] == s[0][j+1]:\r\n c += 1\r\n else:\r\n if s[0][j+1] == 'R':\r\n cnt_r += 1\r\n elif s[0][j + 1] == 'G':\r\n cnt_g += 1\r\n elif s[0][j + 1] == 'B':\r\n cnt_b += 1\r\n\r\n if f == -1:\r\n f = c\r\n if f != c:\r\n no = 1\r\n break\r\n c = 1\r\n if ((f != c) or (cnt_r != 1 or cnt_b != 1 or cnt_g != 1)):\r\n no = 1\r\nif (c_mix):\r\n f = -1\r\n c = 1\r\n cnt_b = 0\r\n cnt_g = 0\r\n cnt_r = 0\r\n if s[0][0] == 'R':\r\n cnt_r += 1\r\n elif s[0][0] == 'G':\r\n cnt_g += 1\r\n elif s[0][0] == 'B':\r\n cnt_b += 1\r\n\r\n for i in range(0, n-1):\r\n if s[i][0] == s[i+1][0]:\r\n c += 1\r\n #print('c',c)\r\n else:\r\n if s[i + 1][0] == 'R':\r\n cnt_r += 1\r\n elif s[i + 1][0] == 'G':\r\n cnt_g += 1\r\n elif s[i + 1][0] == 'B':\r\n cnt_b += 1\r\n\r\n if f == -1:\r\n f = c\r\n #print('f',f)\r\n if f != c:\r\n #print(f,c)\r\n no = 1\r\n break\r\n c = 1\r\n #print(cnt_r,cnt_b,cnt_g)\r\n if ((f != c) or (cnt_r != 1 or cnt_b != 1 or cnt_g != 1)):\r\n no = 1\r\nif no == 1:\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\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\nmp=[]\r\nfor i in range(n):\r\n mp.append(list(input()))\r\nif n%3!=0 and m%3!=0:\r\n print('NO')\r\n exit()\r\nif n%3==0:\r\n z={'R':0,'G':0,'B':0}\r\n z[mp[0][0]]+=1\r\n z[mp[n//3][0]]+=1\r\n z[mp[-1][0]]+=1\r\n ans1=''\r\n for i in range(n//3):\r\n ans1+=(\"\".join(mp[i]))\r\n ans2=''\r\n for i in range(n//3,(2*n)//3):\r\n ans2+=(\"\".join(mp[i]))\r\n ans3=''\r\n for i in range((2*n)//3,n):\r\n ans3+=(\"\".join(mp[i]))\r\n if len(set(list(ans1)))==1 and len(set(list(ans2)))==1 and len(set(list(ans3)))==1 and z['R']==1 and z['G']==1 and z['B']==1:\r\n print('YES')\r\n exit()\r\nif m%3==0:\r\n z = {'R': 0, 'G': 0, 'B': 0}\r\n z[mp[0][0]]+=1\r\n z[mp[0][m//3]]+=1\r\n z[mp[0][-1]]+=1\r\n ans1=''\r\n for g in range(m//3):\r\n for k in range(n):\r\n ans1+=mp[k][g]\r\n ans2 = ''\r\n for g in range(m//3,(2*m)//3):\r\n for k in range(n):\r\n ans2 += mp[k][g]\r\n ans3 = ''\r\n for g in range((2*m)//3,m):\r\n for k in range(n):\r\n ans3 += mp[k][g]\r\n if len(set(list(ans1)))==1 and len(set(list(ans2)))==1 and len(set(list(ans3)))==1 and z['R'] == 1 and z['G'] == 1 and z['B'] == 1:\r\n print('YES')\r\n exit()\r\n else:\r\n print('NO')\r\n exit()\r\nprint('NO')\r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ns = [list(input().rstrip()) for _ in range(n)]\r\ncnt = defaultdict(lambda : 0)\r\nfor s0 in s:\r\n for i in s0:\r\n cnt[i] += 1\r\nif not cnt[\"R\"] == cnt[\"G\"] == cnt[\"B\"]:\r\n ans = \"NO\"\r\nelse:\r\n ans = \"NO\"\r\n if n % 3 == 0:\r\n ans = \"YES\"\r\n cnt = defaultdict(lambda : 0)\r\n for j in range(3):\r\n for i in range(n // 3 * j, n // 3 * (j + 1)):\r\n si = s[i]\r\n for k in si:\r\n cnt[k] += 1\r\n if not cnt[s[n // 3 * j][0]] == n * m // 3:\r\n ans = \"NO\"\r\n break\r\n if m % 3 == 0 and ans == \"NO\":\r\n ans = \"YES\"\r\n cnt = defaultdict(lambda : 0)\r\n for j in range(3):\r\n for i in range(m // 3 * j, m // 3 * (j + 1)):\r\n for k in range(n):\r\n cnt[s[k][i]] += 1\r\n if not cnt[s[0][m // 3 * j]] == n * m // 3:\r\n ans = \"NO\"\r\n break\r\nprint(ans)", "n, m = [int(el) for el in input().split()]\r\nfl = [input().split() for i in range(n)]\r\nfl1 = [['R'* m] for i in range (n //3) ] + [['G' * m ]for i in range (n //3) ] + [['B'* m] for i in range (n //3)]\r\nfl2 = [['R'* m] for i in range (n //3) ] + [['B'* m] for i in range (n //3) ] + [['G'* m] for i in range (n //3)]\r\nfl3 = [['B'* m] for i in range (n //3) ] + [['G' * m] for i in range (n //3) ] + [['R' * m ]for i in range (n //3)]\r\nfl4 = [['B' * m] for i in range (n //3) ] + [['R'* m ]for i in range (n //3) ] + [['G'* m] for i in range (n //3)]\r\nfl5 = [['G'* m] for i in range (n //3) ] + [['R' * m ]for i in range (n //3) ] + [['B'* m] for i in range (n //3)]\r\nfl6 = [['G'* m] for i in range (n //3) ] + [['B' * m ]for i in range (n //3) ] + [['R'* m ]for i in range (n //3)]\r\n\r\nfl7 =[['R' * ( m// 3) + 'G' * ( m// 3) + 'B' * ( m// 3)] for i in range(n)]\r\nfl8 =[['R' * ( m// 3) + 'B' * ( m// 3) + 'G' * ( m// 3) ] for i in range(n)]\r\nfl9 =[['G' * ( m// 3) + 'B' * ( m// 3) + 'R' * ( m// 3) ] for i in range(n)]\r\nfl10 =[['G' * ( m// 3) + 'R' * ( m// 3) + 'B' * ( m// 3)] for i in range(n)]\r\nfl11 =[['B' * ( m// 3) + 'G' * ( m// 3) + 'R' * ( m// 3) ] for i in range(n)]\r\nfl12 =[['B' * ( m// 3) + 'R' * ( m// 3) + 'G' * ( m// 3) ] for i in range(n)]\r\n\r\nif fl == fl1 or fl == fl2 or fl == fl3 or fl == fl4 or fl == fl5 or fl == fl6 or fl == fl7 or fl == fl8 or fl == fl9 or fl == fl10 or fl == fl11 or fl == fl12:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,m = map(int, input().split())\r\nS = [str(input()) for i in range(n)]\r\nif n >= 3:\r\n for i in range(1, n-1):\r\n j = i\r\n k = n-i-j\r\n if k <= 0:\r\n continue\r\n if k != i:\r\n continue\r\n X = [set() for _ in range(3)]\r\n for y in range(n):\r\n for x in range(m):\r\n if 0 <= y <= i-1:\r\n X[0].add(S[y][x])\r\n elif i <= y <= i+j-1:\r\n X[1].add(S[y][x])\r\n else:\r\n X[2].add(S[y][x])\r\n flag = True\r\n for l in range(3):\r\n if len(X[l]) > 1:\r\n flag = False\r\n break\r\n if flag:\r\n c0 = list(X[0])[0]\r\n c1 = list(X[1])[0]\r\n c2 = list(X[2])[0]\r\n if c0 != c1 and c1 != c2 and c2 != c0:\r\n print('YES')\r\n exit()\r\n\r\nif m >= 3:\r\n for i in range(1, m-1):\r\n j = i\r\n k = m-i-j\r\n if k <= 0:\r\n continue\r\n if k != i:\r\n continue\r\n X = [set() for _ in range(3)]\r\n for y in range(n):\r\n for x in range(m):\r\n if 0 <= x <= i-1:\r\n X[0].add(S[y][x])\r\n elif i <= x <= i+j-1:\r\n X[1].add(S[y][x])\r\n else:\r\n X[2].add(S[y][x])\r\n flag = True\r\n for l in range(3):\r\n if len(X[l]) > 1:\r\n flag = False\r\n break\r\n if flag:\r\n c0 = list(X[0])[0]\r\n c1 = list(X[1])[0]\r\n c2 = list(X[2])[0]\r\n if c0 != c1 and c1 != c2 and c2 != c0:\r\n print('YES')\r\n exit()\r\n\r\n\r\nprint('NO')\r\n", "def is_horizontal(flag_):\r\n for i in flag_:\r\n if i.count(i[0]) != len(i):\r\n return False\r\n return True\r\n\r\n\r\ndef is_vertical(flag__):\r\n for i in flag__:\r\n if i != flag__[0]:\r\n return False\r\n return True\r\n\r\n\r\ndef is_correct_horizontal(f, f_n, f_m):\r\n if f_n % 3 != 0:\r\n return False\r\n size_of_line = len(f) // 3\r\n first_line = f[:size_of_line]\r\n second_line = f[size_of_line:size_of_line * 2]\r\n third_line = f[size_of_line * 2:]\r\n for line in [first_line, second_line, third_line]:\r\n if line.count(line[0]) != len(line):\r\n return False\r\n if first_line[0][0] + second_line[0][0] + third_line[0][0] not in ['RGB', 'RBG', 'GBR', 'GRB', 'BRG', 'BGR']:\r\n return False\r\n return True\r\n\r\n\r\n# 4\r\n# 3\r\n# BRG\r\n# BRG\r\n# BRG\r\n# BRG\r\ndef is_correct_vertical(f):\r\n new_flag = []\r\n new_n = len(f[0]) #3 0 1 2\r\n new_m = len(f) #4\r\n for i in range(new_n):\r\n new_flag.append(''.join([k[i] for k in f]))\r\n return is_correct_horizontal(new_flag, new_n, new_n)\r\n\r\n\r\nn, m = map(int, input().split())\r\nflag = [input() for i in range(n)]\r\nif is_horizontal(flag):\r\n if is_correct_horizontal(flag, n, m):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif is_vertical(flag):\r\n if is_correct_vertical(flag):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n# 6 5\r\n# RRRRR\r\n# RRRRR\r\n# BBBBB\r\n# BBBBB\r\n# GGGGG\r\n# GGGGG\r\n", "\r\n\r\ndef solve_h(lines):\r\n '''\r\n >>> solve_h(['R', 'G', 'B'])\r\n True\r\n >>> solve_h(['RRR', 'GGG', 'BBB'])\r\n True\r\n >>> solve_h(['RRR', 'RRR', 'GGG', 'GGG', 'BBB', 'BBB'])\r\n True\r\n >>> solve_h(['RRR', 'RRR', 'RRR', 'GGG', 'BBB', 'BBB'])\r\n False\r\n >>> solve_h(['R', 'G', 'A'])\r\n False\r\n '''\r\n if len(lines) == 0:\r\n return False\r\n if len(lines) % 3 != 0:\r\n return False\r\n strip = len(lines) // 3\r\n colors = []\r\n for i, line in enumerate(lines):\r\n if i % strip == 0:\r\n colors.append(line[0])\r\n if not all(ch == colors[-1] for ch in line):\r\n return False\r\n if set(colors) != set('RGB'):\r\n return False\r\n return True\r\n\r\n\r\ndef transpose(lines):\r\n '''\r\n >>> transpose(['ABC', 'ABC'])\r\n ['AA', 'BB', 'CC']\r\n >>> transpose(['ABCD', 'ABCD'])\r\n ['AA', 'BB', 'CC', 'DD']\r\n '''\r\n return list(''.join(chs) for chs in zip(*lines))\r\n\r\ndef solve_v(lines):\r\n return solve_h(transpose(lines))\r\n\r\ndef solve(lines):\r\n '''\r\n >>> solve(['RGB', 'RGB'])\r\n True\r\n >>> solve(['RR', 'GG'])\r\n False\r\n >>> solve(['RGB', 'RGB', 'RGB', 'RGB'])\r\n True\r\n >>> solve('RRRGGGG RRRGGGG RRRGGGG RRRBBBB RRRBBBB RRRBBBB'.split())\r\n False\r\n >>> solve('RRRR RRRR BBBB GGGG'.split())\r\n False\r\n >>> solve('RRRR BBBB GGGG'.split())\r\n True\r\n >>> solve('BRG BRG BRG BRG'.split())\r\n True\r\n '''\r\n return solve_h(lines) or solve_v(lines)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n h, w = map(int, input().split())\r\n lines = [input() for _ in range(h)]\r\n print('YES' if solve(lines) else 'NO')\r\n\r\n\r\n\r\n\r\n", "import sys, math\r\ninput=sys.stdin.readline\r\nfrom itertools import permutations\r\nINF=int(1e9)+7\r\n\r\ndef rotate_matrix_90degree(a):\r\n n=len(a)\r\n m=len(a[0])\r\n result=[[0]*n for _ in range(m)]\r\n for i in range(n):\r\n for j in range(m):\r\n result[j][n-1-i]=a[i][j]\r\n return result\r\n\r\n\r\ndef solve():\r\n n,m=map(int,input().split())\r\n graph=[list(input().rstrip()) for _ in range(n)]\r\n check=False\r\n data=['R','G','B']\r\n for i in permutations(data):\r\n result=[]\r\n for j in i:\r\n for p in range(n//3):\r\n result.append([j]*m)\r\n if result==graph:\r\n print(\"YES\")\r\n return\r\n graph=rotate_matrix_90degree(graph)\r\n n,m=m,n\r\n for i in permutations(data):\r\n result=[]\r\n for j in i:\r\n for p in range(n//3):\r\n result.append([j]*m)\r\n if result==graph:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n return\r\n \r\n \r\n \r\n \r\n \r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "import sys, math\r\n\r\nn, m = map(int, input().split())\r\n\r\na = [\"\" for i in range(n)]\r\nfor i in range(n):\r\n a[i] = input()\r\n\r\nif (a[0][0] == a[0][m-1]) and (n % 3 == 0):\r\n for i in range(n // 3):\r\n for j in range(m):\r\n if (not a[i][j] == a[0][0]):\r\n print(\"NO\")\r\n sys.exit()\r\n for i in range(n // 3, 2 * n // 3):\r\n for j in range(m):\r\n if (not a[i][j] == a[n // 3][0]):\r\n print(\"NO\")\r\n sys.exit()\r\n for i in range(2 * n // 3, n):\r\n for j in range(m):\r\n if (not a[i][j] == a[2 * n // 3][0]):\r\n print(\"NO\")\r\n sys.exit()\r\n if (a[0][0] == a[n // 3][0]) or (a[0][0] == a[2 * n // 3][0]) or (a[2 * n // 3][0] == a[n // 3][0]):\r\n print(\"NO\")\r\n sys.exit()\r\n else:\r\n print(\"YES\")\r\n sys.exit()\r\nelif (a[0][0] == a[n - 1][0]) and (m % 3 == 0):\r\n for i in range(n):\r\n for j in range(m // 3):\r\n if not ((a[i][j] == a[0][0]) and (a[i][j + m // 3] == a[0][m // 3]) and (\r\n a[i][j + 2 * m // 3] == a[0][2 * m // 3])):\r\n print(\"NO\")\r\n sys.exit()\r\n if (a[0][0] == a[0][m // 3]) or (a[0][0] == a[0][2 * m // 3]) or (a[0][2 * m // 3] == a[0][m // 3]):\r\n print(\"NO\")\r\n sys.exit()\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n" ]

[ "k = int(input().split()[1])\r\nif sum(sorted(list(map(int,input().split())))[:-1]) > k:\r\n print('NO')\r\nelse:\r\n print('YES')", "a,b=input().split()\r\na,b=int(a),int(b)\r\nc=input().split()\r\nfor i in range(a-1):\r\n b-=int(min(c))\r\n c.remove(min(c))\r\nif b<0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,s=map(int,input().split(\" \"))\r\na=list(map(int,input().split(\" \")))\r\na.sort()\r\nsum=0\r\nflag=0\r\nfor i in range(0,n-1):\r\n sum+=a[i]\r\n if(sum>s):\r\n flag=1\r\n break\r\nif(flag==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "import sys\r\nimport itertools\r\nn, s = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nfriends = n - 1\r\n\r\nfor item in itertools.combinations(lst, friends):\r\n if sum(item) <= s:\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")\r\n", "n, s = map(int, input().split())\r\na = [int(s) for s in input().split()]\r\na = sorted(a)\r\nif sum(a) - a[len(a)-1] <= s:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,s=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\nprint(\"YES\" if sum(l[:-1])<=s else \"NO\")\r\n", "# https://codeforces.com/contest/426/problem/A\r\n\r\nn, s = list(map(int, input().split()))\r\nmugs = list(map(int, input().split()))\r\n\r\nmx = -1\r\nsum = 0\r\nfor m in mugs:\r\n mx = max(m, mx)\r\n sum += m\r\nif sum - mx > s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "(n,s) = map(int,input().split())\na = list(map(int,input().split()))\n\ntotal = sum(a)\npossible = False\nfor i in range(0, len(a)):\n if(total - a[i] <= s):\n possible = True\n break\n\nif(possible):\n print(\"YES\")\nelse:\n print(\"NO\")", "n, s = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nsumma = 0\r\nfor i in a:\r\n summa += i\r\nsumma -= max(a)\r\nif s < summa:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,k = list(map(int,input().split()))\r\nl = input().split()\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\n \r\nl.sort()\r\n\r\nfor i in range(0, n-1):\r\n k-=l[i]\r\n \r\nif k>=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "n,k = map(int,input().split())\r\na = sorted(map(int,input().split()))\r\nif sum(a[:-1]) > k: print(\"NO\")\r\nelse: print(\"YES\")", "n,s = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nfor i in range(1,n):\r\n s-=a[i-1]\r\nif s>=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a, b = map(int, input().split())\r\narr = sorted(map(int, input().split()))[:-1]\r\n\r\nif sum(arr)>b:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n, k = map(int , input().split())\r\nl = list(map(int , input().split()))\r\nl = sorted(l)[:n-1]\r\nprint(['NO','YES'][sum(l)<=k])", "\r\nif __name__ == \"__main__\":\r\n numbersString = input().split()\r\n volumeCup = int(numbersString[1])\r\n\r\n volumesMugsString = input().split(' ')\r\n volumesMugs = []\r\n for i in volumesMugsString: volumesMugs.append(int(i))\r\n\r\n volumesMugs.sort()\r\n\r\n print(\"YES\") if (sum(i for i in volumesMugs[:-1]) <= volumeCup) else print(\"NO\")", "n,s=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\n#let max be sreeja \r\n#just verify that others are not going to overflow \r\nalll =sum(l)\r\nsereja=max(l)\r\nfrnds=alll-sereja \r\nif frnds<=s:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "a, b = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\nc = sorted(c)\r\nsum = 0\r\nfor i in range(a-1):\r\n sum += c[i]\r\nif(sum<=b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = int(input().split()[1])\r\ns = input().split()\r\nd = []\r\nfor i in s:\r\n d.append(int(i))\r\nif (sum(d) - max(d)) > a:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,v=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsum=sum(a)\r\nmax=max(a)\r\nif v>=sum-max:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,s = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nts = sum(arr)\r\nms = max(arr)\r\nif ts-ms <= s:\r\n print(\"YES\")\r\nelse:print(\"NO\")", "i=lambda:map(int,input().split())\r\n_,b=i();a=[*i()]\r\nprint('YNEOS'[b<sum(a)-max(a)::2])\r\n", "n, s = map(int, input().split())\na = list(map(int, input().split()))\n\nS = sum(a)\nif S-max(a) <= s:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "n,s=[int(i) for i in input().split()]\r\na=[int(i1) for i1 in input().split()]\r\ns1=0\r\nm=0\r\nfor z in a:\r\n s1+=z\r\n m=max(m,z)\r\nif s1-m<=s:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif(sum(l[0:n-1])<=k):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,s=map(int,input().split())\r\na=list(map(int,input().split()))\r\nm=max(a)\r\na.remove(m)\r\nc=0\r\nfor i in a:\r\n\tc+=i\t\r\nif c<=s:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "# @Author: Justin Hershberger\r\n# @Date: 21-03-2017\r\n# @Filename: 426A.py\r\n# @Last modified by: Justin Hershberger\r\n# @Last modified time: 21-03-2017\r\n\r\n\r\n\r\n#Justin Hershberger\r\n#Py3.5\r\n\r\nimport fileinput\r\n\r\ndef test():\r\n\tpass\r\nif __name__ == '__main__':\r\n\tnum_args = 2\r\n\ttotal_volume = 0\r\n\tfor arg in range(num_args):\r\n\t\tif arg == 0:\r\n\t\t\tn,s = map(int, input().split())\r\n\t\telse:\r\n\t\t\ta = input().split()\r\n\r\n\t# print(n,s,a)\r\n\ta.remove(max(a))\r\n\r\n\tfor i in range(len(a)):\r\n\t\ttotal_volume += int(a[i])\r\n\t\tif total_volume > s:\r\n\t\t\tprint(\"NO\")\r\n\t\t\tbreak\r\n\tif total_volume <= s:\r\n\t\tprint(\"YES\")\r\n", "o=0\r\nn,s=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\na=sorted(a)\r\nfor i in range(0,n-1):\r\n o+=a[i]\r\nif o>s:\r\n print('NO')\r\nelse:\r\n print('YES')", "n, s = map(int, input().split())\nprint([\"NO\", \"YES\"][sum(sorted(map(int, input().split()))[:-1]) <= s])\n", "R = lambda: list(map(int, input().split()))\r\n\r\nn, s = R()\r\na = R()\r\nans = sum(a) - max(a)\r\nprint('YES' if ans <= s else 'NO')", "import sys\r\nimport math\r\n \r\nn, s = [int(x) for x in (sys.stdin.readline()).split()]\r\nan = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nvmax = 0\r\nvsum = 0\r\nfor i in an:\r\n if(i > vmax):\r\n vmax = i\r\n vsum += i\r\n \r\nif(vsum - vmax <= s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n, m = map(int, input().split(' '))\r\nli = list(map(int, input().split()))\r\ns = sum(li)\r\na = max(li)\r\nif s-a <= m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif sum(l)-max(l)>k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "def circles(lst, m):\r\n del lst[lst.index(max(lst))]\r\n if sum(lst) <= m:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nN, M = [int(i) for i in input().split()]\r\na = [int(j) for j in input().split()]\r\nprint(circles(a, M))\r\n", "n,s=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nif s>=sum(a)-max(a):\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nk=max(lis)\r\ns=sum(lis)\r\ns=s-k\r\nif s<=m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,s=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\n#print(l)\r\nfor i in range(n-1):\r\n s-=l[i]\r\n ##print(s)\r\nif(s>=0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input().split()\r\nn = int(a[0])\r\ns = int(a[1])\r\na = input().split()\r\nmax = 0\r\nsum = 0\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n sum += a[i]\r\n if a[i] > max:\r\n max = a[i]\r\nsum = sum - max\r\nif sum > s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "line = input()\nmug_count, volume = line.split()\nmug_count, volume = int(mug_count), int(volume)\n\nline = input()\n\na = [int(i) for i in line.split()]\na.sort()\ntotal = sum(a) - a[-1]\n\n\nif total <= volume:\n print('YES')\nelse:\n print('NO')\n", "import itertools\r\n \r\ndef findsubsets(l, n):\r\n return list(itertools.combinations(l, n))\r\n \r\nn, vol = input().split()\r\nn, vol = int(n), int(vol)\r\nflag = 0\r\n\r\nl = list(map(int, input().split()))\r\n#print(findsubsets(l, n - 1))\r\n\r\nsub = findsubsets(l, n - 1)\r\n\r\nfor i in sub:\r\n if (sum(i) <= vol):\r\n flag = 1\r\n\r\nif flag == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "(n,a)=map(int, input().split())\ns=list(map(int, input().split()))\ns.pop(s.index(max(s)))\nk=0\nfor i in range(n-1):\n k+=s[i]\nif k<=a:\n print('YES')\nelse:\n print('NO')", "n, k = map(int, input().split())\r\n\r\nA = list(map(int, input().split()))\r\n\r\nif sum(A) - max(A) <= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "n, s = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nprint(\"YNEOS\"[sum(a)-a[n-1]>s::2])\r\n", "n,s=map(int,input().split())\r\nkru=list(map(int,input().split()))\r\n\r\n\r\n\r\nmax=0\r\nsum=0\r\nfor i in range(n):\r\n sum+=kru[i]\r\n if kru[i]>=max:\r\n max=kru[i]\r\nanswer=\"YES\"\r\nif sum-max>s:\r\n answer=\"NO\"\r\nprint(answer)\r\n", "n,s = map(int, input().split())\r\na_list = list(map(int,input().split()))\r\na_list.sort()\r\nif sum(a_list[:-1])>s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\na,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\nl.remove(m)\r\nx=0\r\nfor i in l:\r\n\tx+=i\t\r\nif x<=b:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n,s=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nfor i in range(n-1):\r\n c=c+l[i]\r\nif(c<=s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, s = map(int, input().split())\r\nmx, lst, ss = 0, list(map(int, input().split())), 0\r\nfor x in lst: mx, ss = max(mx, x), ss + x\r\nif ss - mx <= s: print(\"YES\")\r\nelse: print(\"NO\")", "n, s = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nm = 0\r\nc = 0\r\nfor i in range(n):\r\n c += l[i]\r\n if l[i] > m:\r\n m = l[i]\r\nif c - m <= s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\"\"\"\ninstagram : essipoortahmasb2018\ntelegram channel : essi_python\n\n\"\"\"\n\nn,s=map(int,input().split())\nl=[*map(int,input().split())]\nif sum(l)-max(l)<=s:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n\n\n\n\n\n\n\n", "n, s = map(int, input().split())\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\narr.sort()\r\n\r\n#print(n, s, arr)\r\n\r\n#print(sum(arr[:-1]))\r\n\r\nif sum(arr[:-1]) <= s:\r\n print(\"YES\")\r\nelse: print(\"NO\")", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.remove(max(l))\r\nif sum(l)>m:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\t", "n, s = map(int, input().split())\r\n\r\nsumm = 0\r\nmaxi = 0\r\n\r\nnumList = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n k = numList[i]\r\n summ += k\r\n\r\n if(maxi < k):\r\n maxi = k\r\n\r\nif(summ - maxi <= s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "string = input()\r\nnumbers = string.split()\r\na, b = int(numbers[0]), int(numbers[1])\r\nstring = input()\r\nnumbers = list(map(int, string.split()))\r\nif sum(numbers) - max(numbers) <= b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, v = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint('YES' if sum(a) - max(a) <= v else 'NO')\r\n", "n, s = list(map(int, input().split()))\na = list(map(int, input().split()))\na.remove(max(a))\nans = 'NO' if sum(a) > s else 'YES'\nprint(ans)", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn,m=q()\r\nprint(\"YES\" if sum(sorted([*q()])[:-1])<=m else \"NO\")", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output1.out\",'w')\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.remove(max(a))\r\nif sum(a)>m:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "a,b=input().split()\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif sum(l[:-1])>int(b):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "n,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\ncount=0\r\nfor i in l:\r\n if i<=k:\r\n count+=1\r\n k-=i\r\nif count>=n-1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin, stdout\r\nn, s = map(int,stdin.readline().split())\r\narr = list(map(int,stdin.readline().split()))\r\narr.sort()\r\narr = arr[:len(arr)-1]\r\nif(sum(arr)<=s):\r\n stdout.write('YES\\n')\r\nelse:\r\n stdout.write('NO\\n')\r\n", "x = input()\ny = input()\nl = list(map(int,x.split()))\nv = list(map(int,y.split()))\nv.sort()\nif sum(v)- v[-1]<= l[1]:\n print(\"YES\")\nelse:\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,s = map(int, wtf[0].split())\r\n A = sorted(list(map(int, wtf[1].split())))\r\n print('YES' if sum(A[:n-1]) <= s else 'NO')\r\n", "import sys\r\nArrGet = lambda : [int(i) for i in input().split()] \r\nAlineGet = lambda : map(int, input().split())\r\n\r\nn, m = AlineGet()\r\nk = ArrGet()\r\nif sum(k)-max(k)>m:\r\n print(\"NO\\n\")\r\nelse:\r\n print(\"YES\\n\")\r\n", "n,c=map(int,input().split())\r\narr=[int(i) for i in input().split()]\r\narr.sort()\r\nfor i in range(n-1):\r\n c=c-arr[i]\r\nif c>=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n ", "i, v, f, cups = 0, 0, 0, []\n\ncups = input().split(' ')\nv = int(cups[1])\ncups = input().split(' ')\n\nf = len(cups)-1\n\ni = 0\nwhile i <= f:\n cups[i] = int(cups[i])\n i += 1\n\ncups.sort()\n\ni,s = 0,0\nwhile i < f:\n s += cups[i]\n if s > v:\n break\n i += 1\n\nif i==f:\n print ('YES')\nelse:\n print('NO')", "def readToInt():\n return [int(n) for n in input().split()]\n\nline = readToInt()\nn, s = line[0], line[1]\nnums = readToInt()\nif sum(nums) - max(nums) <= s:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t \t \t \t \t\t\t \t\t \t\t \t \t", "n, s = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nresult = \"NO\"\r\n\r\nm = max(a)\r\nif sum(a) - m <= s:\r\n result = \"YES\"\r\n\r\nprint(result)\r\n", "n, s = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.remove(max(a))\r\nprint(\"YES\" if sum(a) <= s else \"NO\")\r\n", "n, s = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.remove(max(a))\r\nans = sum(a) > s\r\nprint(\"NO\" if ans else \"YES\")\r\n", "from sys import stdin\r\n\r\nn, s = list(map(int, stdin.readline().split()))\r\narr = list(map(int, stdin.readline().split()))\r\nif(sum(arr) - max(arr) > s):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,s=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.remove(max(a))\r\ns1=sum(a)\r\nif(s1<=s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n\r\n", "n, s = tuple(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nif sum(a) > s + max(a):\r\n print('NO')\r\nelse: print('YES')", "n,s=map(int,input().split())\r\na=[int(a) for a in input().split()]\r\nt=sum(a)\r\nm=max(a)\r\nif t-m>s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n, s = map(int,input().split())\na = list(map(int,input().split()))\na.sort()\nsums = 0\nfor i in range(n - 1):\n sums += a[i]\nif(sums <= s):\n print('YES')\nelse:\n print('NO')\n", "def main():\n [n, s] = [int(_) for _ in input().split()]\n volumn_mugs = [int(_) for _ in input().split()]\n max_mug = max(volumn_mugs)\n sum_mug = sum(volumn_mugs)\n\n print('YES' if sum_mug - max_mug <= s else 'NO')\n\n\nif __name__ == '__main__':\n main()", "n,s = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\ncount = 0\r\nfor i in range(n-1):\r\n count+=a[i]\r\n if(count>s):\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "n,s=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nif sum(a[:-1])<=s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n, m = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nl.sort()\r\n\r\nfor i in range(n-1):\r\n m -= l[i]\r\n\r\nif m >= 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,s=map(int,input().split())\r\nif sum(sorted(list(map(int,input().split())))[:n-1])>s:\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\ns=sum(a)\r\nm=max(a)\r\nif k>=s-m:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint([\"NO\",\"YES\"][sum(l)-max(l)<=m])", "n , m = map(int , input().split())\r\nl = sorted(list(map(int ,input().split())))\r\nif sum(l[ : -1]) > m :\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = 0\r\n\r\ns = 0\r\n\r\nfirst_input = input()\r\n\r\nsecond_input = input()\r\n\r\nvolume_list = []\r\n\r\naux_number = \"\"\r\n\r\nanswer = \"NO\"\r\n\r\nfor i in range(0, len(first_input)):\r\n\r\n\tif first_input[i] != \" \":\r\n\r\n\t\taux_number = aux_number + first_input[i]\r\n\r\n\t\tif i == len(first_input) - 1:\r\n\r\n\t\t\ts = int(aux_number)\r\n\r\n\t\t\taux_number = \"\"\r\n\r\n\telse:\r\n\r\n\t\tn = int(aux_number)\r\n\r\n\t\taux_number = \"\"\r\n\r\n\r\nfor i in range(0, len(second_input)):\r\n\r\n\tif second_input[i] != \" \":\r\n\r\n\t\taux_number = aux_number + second_input[i]\r\n\r\n\t\tif i == len(second_input) - 1:\r\n\r\n\t\t\tvolume_list.append(int(aux_number))\r\n\r\n\telse:\r\n\r\n\t\tvolume_list.append(int(aux_number))\r\n\r\n\t\taux_number = \"\"\r\n\r\nfor i in volume_list:\r\n\r\n\tif sum(volume_list) - i <= s:\r\n\r\n\t\tanswer = \"YES\"\r\n\r\n\t\tbreak\r\n\r\nprint(answer)", "n, s = map(int, input().split(\" \"))\r\narr = list(map(int, input().split(\" \")))\r\narr.sort()\r\nif sum(arr[:n-1])<=s:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n,m=map(int,input().split())\r\nparsa=list(map(int,input().split()))\r\np=1\r\nparsa.sort()\r\nfor i in range(0,n-1,1):\r\n m-=parsa[i]\r\n if m<0:\r\n p=0\r\nif p==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def solve():\r\n n,v=map(int,input().split());a=sorted(list(map(int,input().split())));n-=1;sm=0\r\n for i in range(n):sm+=a[i]\r\n print (\"YES\") if sm<=v else print(\"NO\")\r\nsolve()", "lis1=[int(x) for x in input().split(\" \")]\r\nlis=[int(x) for x in input().split(\" \")]\r\nsum1=0\r\nlis.sort()\r\nfor i in range(len(lis)-1):\r\n sum1+=lis[i]\r\nif (sum1<=lis1[1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "X = list(map(int , input().split()))\r\nMugs = list(map(int , input().split()))\r\nMugs = sorted(Mugs)\r\nprint(\"YES\" if sum(Mugs) - Mugs[X[0]-1] <= X[1] else \"NO\")", "class CodeforcesTask426ASolution:\n def __init__(self):\n self.result = ''\n self.n_s = []\n self.mugs = []\n\n def read_input(self):\n self.n_s = [int(x) for x in input().split(\" \")]\n self.mugs = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n self.mugs.sort()\n self.result = \"YES\" if sum(self.mugs[:-1]) <= self.n_s[1] else \"NO\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask426ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "(n, s) = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nx = sum(a[:-1])\r\nif x > s:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "import sys\r\n\r\ndef main():\r\n n, s, *l = map(int, sys.stdin.read().strip().split())\r\n return ('NO', 'YES')[sum(l) - max(l) <= s]\r\n\r\nprint(main())\r\n", "n,k=map(int,input().split());a=list(map(int,input().split()));print(\"YES\" if sum(a)-max(a)<=k else \"NO\")\r\n#removing max because we have n-1 friends so we ar etrying to put as minimum as possible...", "n, s = map(int,input().split())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\np = sum(arr[:n-1])\r\nif p > s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n, s = [eval(s) for s in input().split()]\narray = [eval(s) for s in input().split()]\narray.sort()\nprint('YES' if sum(array[:-1]) <= s else 'NO')\n\n \t \t\t \t\t\t\t\t \t\t \t \t\t", "a,b = map(int,input().split())\r\nn = list(map(int,input().split()))\r\nn.sort()\r\nn.pop()\r\nif b>= sum(n):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na=sorted(a)\r\nif(sum(a[:n-1])>m):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "# LUOGU_RID: 101568410\nn, s, *a = map(int, open(0).read().split())\r\nprint(sum(a) - max(a) <= s and 'YES' or 'NO')", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.remove(max(a))\r\nif sum(a)>m:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "n,s = map(int, input().split())\r\nlis = [int(i) for i in input().split()]\r\nsums = sum(lis)\r\nma = max(lis)\r\nif(sums-ma <= s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, s = [int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nsu=0\r\nm=a[0]\r\nfor i in a:\r\n if i>m:\r\n m=i\r\n su+=i\r\nif su-m<=s:\r\n print('YES')\r\nelse:\r\n print('NO')", "_, n = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nprint(\"YES\" if sum(l) - max(l) <= n else \"NO\")", "print((lambda x,a:'YES' if sum(sorted(a)[:x[0]-1])<=x[1] else 'NO')(list(list(map(int,input().split()))),list(map(int,input().split()))))\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness\r\n", "n, s = map(int, input().split())\narr = list(map(int, input().split()))\n\narr.sort()\nsum = 0\nfor i in range(len(arr)-1):\n\tsum += arr[i]\n\nif sum <= s:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "R=lambda:list(map(int,input().split()))\r\nn,s=R()\r\na=R()\r\nprint('YES'if sum(a)-max(a)<=s else'NO')", "n,s=[int(x) for x in input().split()]\r\na=list(map(int,input().split()))\r\na.remove(max(a))\r\nif sum(a)>s:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "n ,s = map(int,input().split())\r\na = list(map(int,input().split()))\r\nsts = \"YES\" if sum(a)-max(a) <= s else \"NO\"\r\nprint(sts)", "n,c = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\n\r\nlst.remove( max(lst) )\r\ns = sum(lst)\r\nif s <= c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b = map(int,input().split())\r\narr = sorted(list(map(int,input().split())))\r\narr = arr[:-1]\r\nprint(\"YES\" if sum(arr)<=b else \"NO\")\r\n\r\n", "#n, k = map(int, input().split(\" \"))\r\n#L = [int(x) for x in input().split()]\r\n\r\n\r\nn, s = map(int, input().split(\" \"))\r\nL = sorted([int(x) for x in input().split()])\r\nss = sum(L) - L[n - 1]\r\nif (ss <= s) : print (\"YES\")\r\nelse : print(\"NO\")\r\n\r\n", "n,s = list(map(int, input().split()))\r\nlst = list(map(int, input().split()))\r\n\r\nlst.sort()\r\n\r\nfor i in range(n-1):\r\n s-=lst[i]\r\n \r\nif s>=0:\r\n print('YES')\r\nelse:\r\n print('NO')", "m,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=max(l)\r\nl.remove(s)\r\nfor i in range(len(l)):\r\n\tc=c-l[i]\r\nif c>=0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n,s=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\np=sum(l[:n-1])\r\nif p>s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n_, v = [int(i) for i in input().split()]\r\nn = []\r\n[n.append(int(i)) for i in input().split()]\r\nfor i in range(n_ - 1):\r\n v -= min(n)\r\n del n[n.index(min(n))]\r\nif v >= 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,s=map(int, input().split())\na= sorted(map(int, input().split()))\nif sum(a[:-1])>s:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n", "n, s = map(int, input().split())\r\na = list(map(int, input().split()))\r\nM , S = max(a), sum(a)\r\nans = \"NO\"\r\nif S - M <= s :\r\n ans = \"YES\"\r\nprint(ans)\r\n", "n, s = map(int, input().split())\r\nw = sorted(map(int, input().split()))\r\n\r\nprint(\"YES\" if sum(w[:-1]) <= s else \"NO\")", "n, s = map(int, input().split())\r\nm = list(map(int, input().split()))\r\n\r\nv = sum(m)\r\n\r\npos = False\r\nfor mi in m:\r\n\tif s >= v - mi:\r\n\t\tpos = True\r\n\t\tbreak\r\n\t\r\nif pos:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n,s = map(int, input().split(' '))\nv = list(map(int, input().split(' ')))\nprint('NO') if (sum(v)-max(v))>s else print('YES')\n \t\t\t\t\t \t\t\t \t\t\t\t \t \t \t", "numOfMug,vloumOfCup=input().split(' ')\r\nnumOfMug=int(numOfMug)\r\nvloumOfCup=int(vloumOfCup)\r\n\r\narrayOfvolum=list(map(int,input().split(' ')))\r\n\r\narrayOfvolum.sort()\r\n\r\ni=arrayOfvolum[:numOfMug-1:]\r\nif sum(i)<=vloumOfCup:\r\n print('YES')\r\nelse:\r\n print('NO') ", "a=input()\r\na=a.split()\r\na1=int(a[0])\r\na2=int(a[1])\r\nb=input()\r\nb=b.split()\r\nsuma=0;\r\nfor k in range (a1):\r\n b[k]=int(b[k])\r\nb.sort()\r\nfor y in range (a1-1):\r\n suma=suma+b[y]\r\n if suma>a2:\r\n break\r\nif suma<=a2:\r\n mensaje=\"YES\"\r\nelse:\r\n mensaje=\"NO\"\r\nprint(mensaje)", "n, s = map(int, input().split())\r\nl = [int(i) for i in input().split()]\r\n\r\ns1 = 0\r\nfor i in range(n-1):\r\n\ts1 += min(l)\r\n\tl.remove(min(l))\r\n\r\nif s1 <= s:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO') \r\n", "a, b=map(int, input().split())\r\nL=list(map(int, input().split()))\r\nL=sorted(L)\r\nif sum(L[:a-1])<=b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,s = map(int,input().split())\r\narr = [int(x) for x in input().split()]\r\nif s>=sum(arr)-max(arr):\r\n print('YES')\r\nelse:\r\n print('NO')", "n,s=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\na.sort()\r\n\r\nsum=0\r\nfor i in range(0,n-1):\r\n sum+=a[i]\r\n\r\nif(sum<=s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.pop(a.index(max(a)))\r\nprint(\"YES\" if sum(a) <= m else \"NO\")", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint('YNEOS'[k<sum(l)-max(l)::2])", "n, s = map(int, input().split())\r\nlist_an = list(map(int, input().split()))\r\nif sum(list_an)- max(list_an) <= s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,s=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ncount=0\r\nsummation=sum(arr)\r\nmax1=max(arr)\r\nif summation-max1<=s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,s = map(int,input().split())\r\na = input().split()\r\na = [int(x) for x in a]\r\na.sort()\r\nsum = 0\r\nfor i in range(n-1) :\r\n sum += a[i]\r\nif sum<=s :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "n, v = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ncnt = 0\r\nb = False\r\nfor i in range(1, n):\r\n cnt += min(l)\r\n l.pop(l.index(min(l)))\r\n if cnt > v:\r\n print('NO')\r\n b = True\r\n break\r\nif not b:\r\n print('YES')", "#!/usr/bin/python\nimport re\nimport inspect\nfrom sys import argv, exit\n\ndef rstr():\n return input()\n\ndef rint():\n return int(input())\n\ndef rints(splitchar=' '):\n return [int(i) for i in input().split(splitchar)]\n\ndef varnames(obj, namespace=globals()):\n return [name for name in namespace if namespace[name] is obj]\n\ndef pvar(var, override=False):\n prnt(varnames(var), var)\n\ndef prnt(*args, override=False):\n if '-v' in argv or override:\n print(*args)\n\nif __name__ == '__main__':\n n,cup = rints()\n mugs = rints()\n\n mugs.remove(max(mugs))\n\n #if cup > min(mugs):\n # print(\"YES\")\n #else:\n # print(\"NO\")\n\n if cup >= sum(mugs):\n print(\"YES\")\n else:\n print(\"NO\")\n", "n,s=map(int,input().split())\r\nlisty=list(map(int,input().split()))\r\nlisty.sort()\r\nsum1=0\r\nfor i in range(n-1):\r\n\tsum1+=listy[i]\r\nif s>=sum1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n , m = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\ncount = 0\r\nfor i in l:\r\n\tcount += i\r\na = count-max(l)\r\nif a<=m:\r\n\tprint(\"YES\")\r\nelse:print(\"NO\")\t\t", "n, s = map(int,input().split())\r\narr = sorted([int(c) for c in input().split()])[:n-1]\r\nif sum(arr) > s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "import math\r\n\r\nif __name__ == '__main__':\r\n n, s = str(input()).split()\r\n n = int(n)\r\n s = int(s)\r\n line = str(input()).split()\r\n line = [int(it) for it in line]\r\n line.sort()\r\n if sum(line[:n - 1]) > s:\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif sum(l[:a-1])<=b:print(\"YES\")\r\nelse:print(\"NO\")", "n,m = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\na.sort()\r\n\r\nv = 0\r\nfor i in range(n-1):\r\n\tv += a[i]\r\n\tif v > m:\r\n\t\tprint('NO')\r\n\t\tbreak\r\nelse:\r\n\tprint('YES')", "n,s=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nk=sum(a)-a[n-1]\r\nif k>s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n, s = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nres = \"YES\" if s >= sum(a) - max(a) else \"NO\"\nprint(res)\n", "'''\r\nAmirhossein Alimirzaei\r\nTelegram : @HajLorenzo\r\nInstagram : amirhossein_alimirzaei\r\nUniversity of Bojnourd\r\n'''\r\nn=list(map(int,input().split(' ')))\r\nm=list(map(int,input().split(' ')))\r\nm.sort()\r\nt=sum(m[0:n[0]-1])\r\nprint(\"YES\" if(t<=n[1]) else \"NO\")", "n, s = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nprint(\"NO\" if sum(a[:n - 1]) > s else \"YES\")", "string = input().split(' ')\r\n\r\nn = int(string[0])\r\ns = int(string[1])\r\n\r\nmug = input().split(' ')\r\n\r\nfor i in range(n):\r\n mug[i] = int(mug[i])\r\n \r\nmug = sorted(mug)[:n-1]\r\n\r\n\r\nif sum(mug) > s:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprint(\"NO\" if not sum(arr)-max(arr)<=m else \"YES\")", "n,s=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nm=sum(l[:n-1])\r\nif(m<=s):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n, s = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nsumm = sum(arr)\r\nif summ <= s:\r\n print(\"YES\")\r\nelse:\r\n f=False\r\n for i in arr:\r\n if summ-i <= s:\r\n f = True\r\n if f:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n", "n,h=map(int,input().split())\r\nl=sorted(map(int,input().split()))\r\nif sum(l[:-1])>h: print('NO')\r\nelse: print('YES')", "n, s = map(int, input().split())\r\na = map(int, input().split())\r\nprint('NO' if sum(sorted(a)[:-1]) > s else 'YES')\r\n", "n,s = map(int,input().split(' '))\r\nsu = list(map(int,input().split(' ')))\r\nif sum(su)-max(su)<=s: print('YES')\r\nelse: print('NO')", "n,s=map(int,input().split())\r\nr=[*map(int,input().split())]\r\nprint('YNEOS'[sum(r)-max(r)>s::2])", "k = int(input().split()[1])\r\ns = list(map(int,input().split()))\r\ns.sort()\r\nif sum(s[:-1]) > k:\r\n print('NO')\r\nelse:\r\n print('YES')", "\r\nn, s = map(int, input().split())\r\na = [i for i in map(int, input().split())]\r\n\r\nr = [\"NO\", \"YES\"]\r\nz = sum(a) - max(a) <= s\r\n#print(max(a))\r\nprint(r[z])\r\n\r\n\r\n", "data = input().rstrip().split()\r\nn = int(data[0])\r\ns = int(data[1])\r\n\r\nsu = 0\r\nma = 0\r\ndata = input().rstrip().split()\r\nfor i in range(n):\r\n a = int(data[i])\r\n su += a\r\n if ma < a:\r\n ma = a\r\n\r\nsu -= ma\r\nprint('YES' if su <= s else 'NO')\r\n", "n, s = map(int, input().split())\r\na = sum(sorted(list(map(int, input().split())))[:-1])\r\nif a <= s:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,s=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nc=0\r\nfor i in range(n-1):\r\n\tc=c+a[i]\r\nif(c<=s):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "num_mugs, cup_volume = map(int, input().split(\" \"))\r\nmug_volumes = list(map(int, input().split(\" \")))\r\n\r\nif sum(mug_volumes) - max(mug_volumes) <= cup_volume:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# cf 426 A 800\nn, s = map(int, input().split())\nA = [*map(int, input().split())]\nif sum(A) - max(A) > s:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "n, v = map(int, input().split())\r\ncups = sorted(list(map(int, input().split())))\r\ntot = 0\r\nfor i in range(n-1):\r\n tot += cups[i]\r\nif(0<=v-tot<= v):\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "a, b = map(int, input().split())\r\nc = sorted(list(map(int, input().split())))\r\nprint(\"YES\" if sum(c[:a-1]) <= b else \"NO\")", "n,s = map(int,input().split())\r\na = list(map(int,input().split()))\r\np = 0\r\nfor i in range(n-1):\r\n p += min(a)\r\n a.remove(min(a))\r\nprint(\"YES\" if p <= s else \"NO\")", "'''\r\nAmirhossein Alimirzaei\r\nTelegram : @HajLorenzo\r\nInstagram : amirhossein_alimirzaei\r\nUniversity of Bojnourd\r\n'''\r\nn=list(map(int,input().split(' ')))\r\nm=list(map(int,input().split(' ')))\r\nm.sort()\r\nt=0\r\nfor x in range(n[0]-1):\r\n t+=m[x]\r\nif(t<=n[1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input().split()\r\nn, s = int(a[0]), int(a[1])\r\na = input().split()\r\na.sort()\r\nsum = 0\r\nfor i in range(n-1):\r\n sum += int(a[i])\r\nif sum <= s:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n , s = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nrecent = 0\r\n\r\nfor i in range(n-1) :\r\n recent += a[i]\r\n\r\nif recent <= s :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n, s = input().split()\r\nn, s = int(n), int(s)\r\na = [int(i) for i in input().split()]\r\nb = sum(a) - max(a)\r\nif b > s:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n", "a,b = list(map(int,input().split()))\r\ninput1 = list(map(int,input().split()))\r\ninput1.remove(max(input1))\r\nif sum(input1)>b:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n", "n,gv = map(int,input().split())\rmv = [0]*n\rmv = list(map(int,input().split()))\rmv = sorted(mv)\rfor i in range(n-1):\r gv = gv - mv[i]\rif gv < 0:\r print(\"NO\")\relse:\r print(\"YES\")\r", "n,s=map(int,input().split())\r\nlist=[int(i) for i in input().split()]\r\nlist[list.index(max(list))]=0\r\nfor i in range(n):\r\n if(list[i]>s):\r\n print(\"NO\")\r\n exit()\r\n else:\r\n s-=list[i]\r\nprint(\"YES\")", "n,m=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\nc=0\r\nfor i in range(n-1):\r\n\tc+=l[i]\r\n\tif(c>m):\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"YES\")\r\n", "IL = lambda: list(map(int, input().split()))\r\n\r\nn, s = IL()\r\nA = IL()\r\nprint('YES' if sum(sorted(A)[:-1]) <= s else 'NO')", "n,s=map(int,input().split())\r\nalist=[int(x) for x in input().split()]\r\n\r\nalist.sort()\r\n\r\nif sum(alist[:(n-1)])<=s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif sum(a)-max(a)<=k :\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, s = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\n\r\nprint(\"YES\" if s - (sum(data) - max(data)) >= 0 else \"NO\")", "n,s=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\na.sort()\r\nprint( 'YES' if sum(a[:-1])<=s else 'NO')", "n, s = map(int, input().split())\r\nt = list(map(int, input().split()))\r\nprint('NO' if s + max(t) < sum(t) else 'YES')", "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\n\r\ndef main():\r\n n, s = IA()\r\n a = IA()\r\n a.sort()\r\n a.pop()\r\n return \"YES\" if sum(a) <= s else \"NO\"\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n, m = [int(x) for x in input().split()]\narr = [int(x) for x in input().split()]\nif(sum(arr) - max(arr) <= m):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "# import sys\r\n# sys.stdin=open(\"test.in\")\r\nn,s=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=sum(a)-max(a)\r\nif b>s:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "n, s = tuple(map(int, str.split(input())))\nif sum(sorted(map(int, str.split(input())))[:-1]) <= s:\n\n print(\"YES\")\n\nelse:\n\n print(\"NO\")\n", "import sys\n\n\nif __name__ == '__main__':\n n, s = map(int, sys.stdin.readline().split())\n mugs = list(sorted(map(int, sys.stdin.readline().split())))\n if sum(mugs[:n - 1]) <= s:\n print('YES')\n else:\n print('NO')\n\n", "n, s = map(int, input().split())\r\nvals = list(map(int, input().split()))\r\nprint(('NO', 'YES')[sum(vals) - max(vals) <= s])\r\n\r\n", "n, s = map(int, input().split())\r\ncups = sorted(map(int, input().split()))\r\n\r\nprint(\"YES\" if sum(cups) - cups[-1] <= s else \"NO\")", "t = input().split()\r\nn , c = int(t[0]), int(t[1])\r\nk = input().split()\r\nk = [int(x) for x in k]\r\nif sum(k) - max(k) <= c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,sz = map(int,input().split())\r\na = sorted(list(map(int, input().split())))\r\nsum = 0\r\nfor i in range(0,n-1):\r\n sum += a[i]\r\n if sum > sz :\r\n print(\"NO\")\r\n exit()\r\n\r\nelse :\r\n print(\"YES\")\r\n", "n, s = map(int,input().split())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nans = 'NO'\r\nif len(arr) == 1:\r\n if arr[0] <= s:\r\n ans = 'YES'\r\nelse:\r\n sum1 = 0\r\n for i in range(len(arr)-1):\r\n sum1 += arr[i]\r\n if sum1 <= s:\r\n ans = 'YES'\r\nprint(ans)", "n, s = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprint(\"NO\" if sum(arr) - max(arr) > s else \"YES\")\r\n", "n,s = map(int, input().split())\r\nmat = list(map(int, input().split()))\r\nsums = sum(mat) - max(mat)\r\nprint(\"NO\" if sums>s else \"YES\")\r\n", "mugs_num, cup_volume = map(int, input().split())\r\nmugs_volume = sorted(list(map(int, input().split())))\r\nfor x in range(mugs_num - 1):\r\n cup_volume -= mugs_volume[x]\r\n if cup_volume < 0:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n, s = map(int, input().split())\r\nvolumes = list(map(int, input().split()))\r\nprint('YES' if sum(volumes) - max(volumes) <= s else 'NO')\r\n", "n,s=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ni=0\r\n\r\nwhile i<n-1:\r\n\ts=s-l[i]\r\n\t\r\n\ti=i+1\r\nif s>=0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "def can_win_all(cups, bowl):\n sum_cups = sum(cups)\n max_cup = max(cups)\n if sum_cups - max_cup <= bowl:\n return \"YES\"\n else:\n return \"NO\"\n\ncups_len, bowl = map(int, input().split(' '))\ncups = list(map(int, input().split(' ')))\n\nprint(can_win_all(cups, bowl))", "#!/bin/python\r\nn, s = (list)(map(int, input().split(' ')))\r\na = (list)(map(int, input().split(' ')))\r\nmaxofa = max(a)\r\nsumofa = sum(a)\r\nif sumofa - maxofa <= s:\r\n print(\"YES\")\r\nelse:print(\"NO\")\r\n", "n, s = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nx = n\r\nfor i in a:\r\n s -= i\r\n x -= 1\r\n if s >= 0 and x == 1 or 0:\r\n print('YES')\r\n exit()\r\nprint(\"NO\")\r\n", "n, s = map(int, input().split())\r\nkrush = list(map(int, input().split()))\r\nchasha = 0\r\nres = 'YES'\r\nkrush.sort()\r\nfriend = 0\r\nwhile res == 'YES' and friend < len(krush)-1:\r\n chasha += krush[friend]\r\n if chasha > s:\r\n res = 'NO'\r\n friend += 1\r\nprint(res)\r\n", "[a,b] = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nif sum(l)-max(l) > b: print('NO')\r\nelse: print('YES')", "n, v = map(int, input().split())\r\ncups = list(map(int, input().split()))\r\n\r\nprint('YES' if sum(sorted(cups)[:n-1]) <= v else 'NO')", "def solution(l1,l2):\r\n l2.remove(max(l2))\r\n if sum(l2)>l1[1]:\r\n return \"NO\"\r\n else:return \"YES\"\r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n l2 = [int(x) for x in input().split()]\r\n print(solution(l1,l2))\r\nanswer()", "n,m = map(int,input().split())\r\na=list(map(int,input().split()))\r\nif sum(a) - max(a) <= m :\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def sereja_and_mugs(n,arr):\r\n arr.sort()\r\n sum=0\r\n for i in range(n[0]-1):\r\n sum=sum+arr[i]\r\n \r\n if sum>n[1]:\r\n print('NO')\r\n else:\r\n print('YES')\r\n\r\n\r\n\r\n\r\n\r\nn=list(map(int,input('').split()))\r\narr=list(map(int,input('').split()))\r\nsereja_and_mugs(n,arr)\r\n", "n, k = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\n\r\ntemp = sum(arr)\r\n\r\nif (all(map(lambda x: (temp-x) > k, arr))):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys\r\nimport math\r\nimport os\r\n\r\n\r\nn,s=map(int,input().split())\r\ndata=list(map(int,input().split()))\r\ndata.sort()\r\ntotal=0\r\n\r\nfor i in range (n-1):\r\n total=total+int(data[i])\r\n\r\nif total<=s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, s = [int(c) for c in input().split()]\r\ncups = [int(c) for c in input().split()]\r\n\r\nmax = max(cups)\r\nsum = sum(cups)\r\n\r\nif sum - max <= s:\r\n print('YES')\r\nelse:\r\n print('NO')", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn,s=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nif s>=sum(a)-a[-1]:print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=input()\r\ny=input()\r\nl=x.split()\r\nn=l[0]\r\ns=l[1]\r\nlist=y.split()\r\nlist.sort()\r\noursum=0\r\ni=0\r\nwhile i<len(list)-1:\r\n oursum=oursum+int(list[i])\r\n i+=1\r\nif oursum<=int(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\ndef main():\r\n n,m = [int(v) for v in input().split()]\r\n vals = [int(v) for v in input().split()]\r\n d = sum(vals)-max(vals)\r\n if d<=m:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n , s = map(int,input().split(\" \"))\r\na = list(map(int,input().split(\" \")))\r\na.sort()\r\nif sum(a[:n-1]) <= s :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, s = map(int, input().split())\nx = list(map(int, input().split()))\nif sum(x) - max(x) <= s:\n print('YES')\nelse:\n print('NO')\n", "n,s=input().split()\r\nn=int(n)\r\ns=int(s)\r\nC=0\r\nans='NO'\r\nc=list(map(int,input().split()))\r\nfor a in c:\r\n\tC+=a\r\nfor a in c:\r\n\tif C-a<=s: ans='YES'\r\nprint(ans)", "n,s1 = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nif sum(l)-max(l)<=s1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def selection_sort(n):\n\n for i in range(len(n)-1):\n min = i\n for j in range(i+1,len(n)):\n if n[j]<n[min]:\n min = j\n\n tem = n[min]\n n[min] = n[i]\n n[i] = tem\n\n\n\nnumber_of_mug,volum = input().split()\nnumber_of_mug = int(number_of_mug)\n\nvolum = int(volum)\nls = list(map(int,input().split()))\ncoun = False\nsu = 0\n\nselection_sort(ls)\n\nfor i in range(number_of_mug-1):\n su += ls[i]\n\nif su <= volum:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n\n", "def solve(n, s, a):\n a.sort()\n if sum(a[:-1]) <= s:\n return \"YES\"\n else:\n return \"NO\"\n\n\ndef main():\n n, s = list(map(int, input().split()))\n a = list(map(int, input().split()))\n print(solve(n, s, a))\n\n\nmain()\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\ta=read_ints()\r\n\tif m >= sum(a)-max(a):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\nsolve()\r\n", "n,s = map(int,input().split())\r\narr=list(map(int, input().split(' ')[:n]))\r\narr.sort()\r\ntemp = 0\r\nfor i in range(n-1):\r\n temp+=arr[i];\r\n if(temp>s):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "import itertools\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ny=list(itertools.combinations(l,n-1))\r\nfor i in y :\r\n if sum(i)<=m:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "def canWin(c, arr):\r\n return sum(arr) - max(arr) <= c\r\n\r\nn, c = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\nprint(\"YES\" if canWin(c, nums) else \"NO\")", "__author__ = 'Lipen'\r\n\r\ndef main():\r\n n, s = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n if sum(a)-max(a) <= s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nmain()", "num_mugs, cup_volume = map(int, input().split(\" \"))\r\nmug_volumes = sorted(list(map(int, input().split(\" \"))))\r\n\r\npossible = True\r\n\r\nfor i in range(num_mugs - 1):\r\n cup_volume -= mug_volumes[i]\r\n if cup_volume < 0:\r\n possible = False\r\n break\r\n\r\nif possible:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,s=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nvol=0\r\nfor i in range(n-1):\r\n vol+=lst[i]\r\nif vol<=s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,s = [int(i) for i in input().split()]\nl = [int(i) for i in input().split()]\nl.sort()\nif sum(l[:-1]) <= s:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n,s=map(int,input().split())\na=list(map(int,input().split()))\nupper=max(a)\nsu=sum(a)\nif (su-upper) <= s:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "I = lambda: map(int, input().split())\r\n\r\n_, s = I()\r\nA = list(I())\r\n\r\nprint('NO' if sum(A)-max(A) > s else 'YES')", "n,s=map(int,input().split())\r\na=list(map(int,input().split()))\r\na=sorted(a)\r\nif sum(a[0:n-1])<=s:\r\n print('YES')\r\nelse:\r\n print('NO')", "from collections import defaultdict, deque, Counter, OrderedDict\r\nimport threading,sys\r\n\r\ndef main():\r\n n,m = map(int,input().split())\r\n a = [int(i) for i in input().split()]\r\n v = sum(a) - max(a)\r\n print(\"YES\" if v <= m else \"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n \"\"\"sys.setrecursionlimit(400000)\r\n threading.stack_size(40960000)\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\n \"\"\"\r\n main()", "n,s = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nif(sum(arr) - max(arr) <= s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, s = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nsu = 0\r\nfor i in range(n-1):\r\n\tsu+=arr[i]\r\nif(su > s):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "n,s=map(int,input().split())\r\na=list(map(int,input().split()))\r\nm=sum(a)-max(a)\r\nif m>s:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "n,s=map(int,input().split())\r\na=list(map(int,input().split()))\r\nprint('YES' if sum(a)-max(a)<=s else 'NO')", "n,s = map(int,input().split())\r\na = map(int,input().split())\r\ns_a=sorted(a)\r\nt=0\r\nfor i in range(n-1):\r\n\tt+=s_a[i]\r\nprint('YES' if t<=s else 'NO')\r\n\r\n", "n,s = map(int,input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nif sum(A[:n-1])<=s:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "n,s=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\na=sorted(a)\r\nif(sum(a[:len(a)-1])<=s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, s = list(map(int, input().split()))\r\nm = sorted(list(map(int, input().split())))\r\n\r\nof = 0\r\nfor i in range(n):\r\n of += m[i]\r\n if of > s and i+1 <= n-1:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n\r\n", "n, s = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nmx = max(a)\r\nsm = sum(a) - mx\r\n\r\nprint(\"YES\" if sm <= s else \"NO\")", "n,s=map(int,input().split())\r\na= list(map(int, input().split()))\r\na.sort()\r\nif sum(a[:-1])<=s:print('YES')\r\nelse:print('NO')\r\n", "#Sereja and Mugs\n\na,b=input().split()\n\nmugs=int(a)\nvolume_cup=int(b)\n\nvolume_mugs=input().split()\nvolume_mugs=[int(a) for a in volume_mugs]\n\n#counter sees if any work. if its under the number of mugs, it works.\ncounter=0\n#sees if volume doesn't exceed\nfor mug in volume_mugs:\n if sum(volume_mugs)-mug>volume_cup:\n counter=counter+1\n\nif counter==mugs:\n print('NO')\nelse:\n print('YES')\n", "n,s=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nvmug=sum(a[:(n-1)])\r\nif vmug>s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys\n\nn, s = map(int, sys.stdin.readline().split())\nan = list(map(int, sys.stdin.readline().split()))\n\nansum = sum(an)\nanmax = max(an)\n\nif ansum - anmax <= s:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def main():\n n, s = map(int, input().split())\n aa = list(map(int, input().split()))\n print(('NO', 'YES')[sum(aa) <= s + max(aa)])\n\n\nif __name__ == '__main__':\n main()\n" ]

[ "# LUOGU_RID: 96259783\nn,m=map(int,input().split())\r\nes=[[]for i in range(n)]\r\ndp,inf=[0]*(n+1),10**9\r\nfor i in range(m):\r\n\tr,c=map(int,input().split())\r\n\tes[c-1].append(n-r+1)\r\nfor i in range(n-1,-1,-1):\r\n\tmx=min(n-i,1000)\r\n\tfor j in es[i]:\r\n\t\tfor k in range(min(mx+1,j)):\r\n\t\t\tif j<=mx:\r\n\t\t\t\tdp[j]=min(dp[j],dp[k])\r\n\t\t\tdp[k]+=3\r\n\tfor j in range(mx+(i>0),0,-1):\r\n\t\tdp[0]=min(dp[0],dp[j]+j*(j+1)//2+2)\r\n\t\tdp[j]=dp[j-1]\r\nprint(dp[0])" ]

[ "from heapq import heappush, heappop\r\nclass MinCostFlow:\r\n INF = 10**18\r\n\r\n def __init__(self, N):\r\n self.N = N\r\n self.G = [[] for i in range(N)]\r\n\r\n def add_edge(self, fr, to, cap, cost):\r\n G = self.G\r\n G[fr].append([to, cap, cost, len(G[to])])\r\n G[to].append([fr, 0, -cost, len(G[fr])-1])\r\n\r\n def flow(self, s, t, f):\r\n N = self.N; G = self.G\r\n INF = MinCostFlow.INF\r\n\r\n res = 0\r\n H = [0]*N\r\n prv_v = [0]*N\r\n prv_e = [0]*N\r\n\r\n while f:\r\n dist = [INF]*N\r\n dist[s] = 0\r\n que = [(0, s)]\r\n\r\n while que:\r\n c, v = heappop(que)\r\n if dist[v] < c:\r\n continue\r\n for i, (w, cap, cost, _) in enumerate(G[v]):\r\n if cap > 0 and dist[w] > dist[v] + cost + H[v] - H[w]:\r\n dist[w] = r = dist[v] + cost + H[v] - H[w]\r\n prv_v[w] = v; prv_e[w] = i\r\n heappush(que, (r, w))\r\n if dist[t] == INF:\r\n return -1\r\n\r\n for i in range(N):\r\n H[i] += dist[i]\r\n\r\n d = f; v = t\r\n while v != s:\r\n d = min(d, G[prv_v[v]][prv_e[v]][1])\r\n v = prv_v[v]\r\n f -= d\r\n res += d * H[t]\r\n v = t\r\n while v != s:\r\n e = G[prv_v[v]][prv_e[v]]\r\n e[1] -= d\r\n G[v][e[3]][1] += d\r\n v = prv_v[v]\r\n return res\r\n\r\nT = input()\r\nneed = [0] * 30\r\nfor t in T:\r\n need[ord(t) - ord('a')] += 1\r\nhave = [[0] * 30 for _ in range(110)]\r\nN = int(input())\r\na = [0] * 110\r\n\r\nfor i in range(N):\r\n v = input().split()\r\n S = v[0]\r\n a[i] = int(v[1])\r\n for s in S:\r\n have[i][ord(s)-ord('a')] += 1\r\n\r\nV = 30 + N + 10\r\nflow = MinCostFlow(V)\r\n\r\nstart = 30 + N + 5\r\ntarget = 30 + N + 6\r\nfor c in range(26):\r\n flow.add_edge(start, c, need[c], 0)\r\n for j in range(N):\r\n flow.add_edge(c, 30+j, have[j][c], 0)\r\n\r\nfor i in range(N):\r\n flow.add_edge(30+i, target, a[i], i+1)\r\n\r\nans = flow.flow(start, target, len(T))\r\nprint(ans)", "import sys; input = sys.stdin.readline\r\nfrom math import inf\r\nfrom collections import deque\r\n\r\nclass Edge():\r\n def __init__(self, v, w, c, p):\r\n self.v = v # u - v\r\n self.w = w # capacity\r\n self.c = c # cost\r\n self.p = p # pointer\r\n\r\nclass Zkw():\r\n def __init__(self):\r\n self.source = source\r\n self.sink = sink\r\n self.length = self.sink + 1\r\n self.ei = 0\r\n self.edges = []\r\n self.pointer = [-1] * self.length\r\n self.distance = [inf] * self.length\r\n\r\n def add_edge(self, u, v, w, c):\r\n self.edges.append(Edge(v, w, c, self.pointer[u]))\r\n self.pointer[u] = self.ei\r\n self.edges.append(Edge(u, 0, -c, self.pointer[v]))\r\n self.pointer[v] = self.ei + 1\r\n self.ei += 2\r\n\r\n def _spfa(self):\r\n q = [False] * self.length\r\n queue = deque([self.source])\r\n self.distance[self.source] = 0\r\n q[self.source] = True\r\n while queue:\r\n here = queue.popleft()\r\n q[here] = False\r\n p = self.pointer[here]\r\n while p != -1:\r\n if self.edges[p].w and self.distance[self.edges[p].v] > self.distance[here] + self.edges[p].c:\r\n self.distance[self.edges[p].v] = self.distance[here] + self.edges[p].c\r\n if not q[self.edges[p].v]:\r\n queue.append(self.edges[p].v)\r\n q[self.edges[p].v] = True\r\n p = self.edges[p].p\r\n\r\n def _dfs(self, here, f):\r\n self.visited[here] = True\r\n if here == self.sink:\r\n return f\r\n p = self.work[here]\r\n while p != -1:\r\n if not self.visited[self.edges[p].v] and self.edges[p].w and self.distance[self.edges[p].v] == self.distance[here] + self.edges[p].c:\r\n result = self._dfs(self.edges[p].v, min(f, self.edges[p].w))\r\n if result:\r\n self.edges[p].w -= result\r\n self.edges[p ^ 1].w += result\r\n self.work[here] = p\r\n return result\r\n p = self.work[here] = self.edges[p].p\r\n return 0\r\n\r\n def _update(self):\r\n d = inf\r\n for here in range(self.length):\r\n if self.visited[here]:\r\n p = self.pointer[here]\r\n while p != -1:\r\n if not self.visited[self.edges[p].v] and self.edges[p].w:\r\n d = min(d, self.distance[here] - self.distance[self.edges[p].v] + self.edges[p].c)\r\n p = self.edges[p].p\r\n if d < inf:\r\n for here in range(self.length):\r\n if not self.visited[here]:\r\n self.distance[here] += d\r\n return True\r\n return False\r\n\r\n def run(self):\r\n self._spfa()\r\n F = C = 0\r\n while True:\r\n self.work = [self.pointer[i] for i in range(self.length)]\r\n while True:\r\n self.visited = [False] * self.length\r\n f = self._dfs(self.source, inf)\r\n if not f:\r\n break\r\n F += f\r\n C += self.distance[self.sink] * f\r\n if not self._update():\r\n break\r\n print(C) if F == n else print(-1)\r\n\r\nT = input().strip(); n = len(T)\r\nN = int(input())\r\n\r\nS = []; A = []; M = [0] * (N + 1)\r\nfor i in range(N):\r\n s, a = input().split()\r\n S.append(s)\r\n A.append(int(a))\r\n M[i + 1] = M[i] + len(s) + 1 # s[i]의 각 글자와 s[i]는 [m[i], m[i+1])에 매칭된다.\r\n\r\n# S : [0, M[N]]), T : [M[N], M[N] + n), source : M[N] + n, sink : M[N] + n + 1\r\ns = 0; t = M[N]; source = M[N] + n; sink = source + 1\r\nzkw = Zkw()\r\n\r\n# source -> T -> S의 각 글자 -> S -> sink\r\n\r\n# source -> T\r\nfor i in range(n):\r\n zkw.add_edge(source, i + t, 1, 0)\r\n\r\n# T -> S의 각 글자\r\nfor i in range(n):\r\n for j in range(N):\r\n for k in range(len(S[j])):\r\n if T[i] == S[j][k]:\r\n zkw.add_edge(i + t, M[j] + k + s, 1, j + 1)\r\n\r\n# S의 각 글자 -> S\r\nfor i in range(N):\r\n for j in range(len(S[i])):\r\n zkw.add_edge(M[i] + j + s, M[i + 1] - 1 + s, 1, 0)\r\n\r\n# S -> sink\r\nfor i in range(N):\r\n zkw.add_edge(M[i + 1] - 1 + s, sink, A[i], 0)\r\n\r\nzkw.run()" ]

[ "import bisect\r\n\r\nMAXN = 10**6\r\nN = int(input())\r\nexist = [False for i in range(MAXN + 10)]\r\narr = list(map(int, input().split()))\r\na = []\r\n\r\nfor x in arr:\r\n if exist[x] == False:\r\n exist[x] = True\r\n a.append(x)\r\n\r\na.sort()\r\nN = len(a)\r\n\r\nans = 0\r\nfor i in range(N - 2, -1, -1):\r\n if ans >= a[i] - 1:\r\n break\r\n j = a[i] + a[i]\r\n while j - a[i] <= a[N - 1]:\r\n id = bisect.bisect_left(a, j, 0, N) - 1\r\n ans = max(ans, a[id] % a[i])\r\n j += a[i]\r\n\r\nprint(ans)", "def main():\n input()\n aa = sorted(map(int, input().split()))\n maxa = max(aa)\n m = [False] * (maxa + 1)\n x = []\n b = 0\n for a in aa:\n if b != a:\n m[a] = True\n for i in range(b, a):\n x.append(b)\n b = a\n x.append(b)\n ans = 0\n for i in range(maxa - 1, 1, -1):\n if i < ans:\n break\n if m[i]:\n for j in range(1, maxa // i + 1):\n ans = max(ans, x[min(i * (j + 1) - 1, maxa)] % i)\n print(ans)\n\n\nif __name__ == '__main__':\n main()", "n = int(input())\na = list(set(map(int, input().split())))\nmx = max(a)\n\nb = [0] * (2 * mx)\nfor e in a:\n b[e] = e\nfor i in range(1, len(b)):\n if b[i] == 0:\n b[i] = b[i - 1]\n\nbest = 0\nfor e in a:\n for m in range(2 * e, 2 * mx, e):\n if b[m - 1] >= e:\n best = max(best, b[m - 1] % e)\nprint(best)", "import bisect\r\nn = int(input())\r\narr = set(map(int,input().split()))\r\nls = sorted(arr)\r\nans = 0\r\nmx = max(arr)\r\nfor c in ls[::-1]:\r\n if c-1<ans:\r\n break\r\n kc = c+c\r\n while kc<=2*mx:\r\n ind = bisect.bisect_left(ls,kc)\r\n ans = max(ans,ls[ind-1]%c)\r\n kc+=c\r\nprint(ans)", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na=sorted(list(set(a)))\r\nmx=max(a)\r\nb=[0]*(2*mx)\r\nfor aa in a:\r\n b[aa]=aa\r\nfor i in range(1,len(b)):\r\n if b[i]==0:\r\n b[i]=b[i-1]\r\nans=0\r\nfor aa in a:\r\n for m in range(2*aa,2*mx,aa):\r\n if b[m-1]>=aa:\r\n ans=max(ans,b[m-1]%aa)\r\nprint(ans)", "input()\r\naa = sorted(set(map(int, input().split())))\r\nx = []\r\nb = res = 0\r\nfor a in aa:\r\n x += [b] * (a - b)\r\n b = a\r\nx.append(b)\r\nmaxa = aa.pop()\r\nfor a in reversed(aa):\r\n if a < res:\r\n break\r\n res = max(res, maxa % a, *[b % a for b in x[2 * a - 1::a]])\r\nprint(res)\r\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip('\\n\\r')\n\nfrom collections import Counter, defaultdict, deque\nfrom itertools import accumulate, chain, zip_longest, product, repeat\nfrom bisect import bisect_left, bisect_right\nfrom math import gcd\nfrom string import ascii_lowercase\nfrom functools import cmp_to_key\n\nmod = 10 ** 9 + 7\nmod_2 = 998244353\n\ndef solve():\n n = int(input())\n a = sorted(set(map(int, input().split())))\n m = a[-1]\n c = [0 for i in range(m << 1 | 1)]\n for i in a:\n c[i] += 1\n jl = [0 for i in range(m << 1 | 1)]\n val = -1\n for i in range(len(jl)):\n jl[i] = val\n if c[i] != 0:\n val = i\n ans = 0\n for i in a:\n for j in range(i << 1, min(m + i + 1, m << 1 | 1), i):\n x = jl[j]\n ans = max(ans, x % i)\n return ans\n\nif __name__ == \"__main__\":\n val = solve()\n print(val)\n", "from sys import stdin, stdout\r\nfrom bisect import bisect_left, bisect\r\n\r\ninput, print = stdin.readline, stdout.write\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\na = [False for i in range(int(1e6) + 5)]\r\nfor i in x:\r\n a[i] = True\r\nfor i in range(1, int(1e6) + 5):\r\n if a[i]:\r\n a[i] = i\r\n else:\r\n a[i] = a[i - 1]\r\n\r\nm = 2 * a[-1]\r\nans = 0\r\nfor j in range(1, int(1e6) + 5):\r\n if a[j] < j:\r\n continue\r\n for x in range(2 * j, int(1e6) + 5 * j + 1, j):\r\n y = a[min(x, int(1e6) + 1) - 1]\r\n if y > j:\r\n ans = max(ans, y % j)\r\nprint(str(ans) + \"\\n\")\r\n", "input()\r\ns = sorted(set(map(int, input().split())))\r\nc = m = 0\r\nd = []\r\nfor b in s:\r\n d += [c] * (b - c)\r\n c = b\r\nfor b in s[-1::-1]:\r\n if b < m + 2:\r\n break\r\n m = max(m, c % b, *(a % b for a in d[2 * b - 1::b]))\r\nprint(m)\r\n", "n = int(input())\r\na = sorted(list(set(map(int, input().split()))))\r\nn = len(a)\r\n\r\nlb = [0] + [-1] * 2000000\r\nfor x in a: lb[x] = x\r\nfor i in range(1,2000001):\r\n if (lb[i] == -1): lb[i] = lb[i-1]\r\n\r\nans = 0\r\nfor i in range(n):\r\n for j in range(2,2000000):\r\n if (a[i]*j > 1000000):\r\n ans = max(ans, a[-1] % a[i])\r\n break\r\n else: ans = max(ans, lb[j*a[i]-1] % a[i])\r\nprint(ans)\r\n\r\n" ]

[ "import sys\r\n\r\nt = int(sys.stdin.buffer.readline().decode('utf-8'))\r\nans = ['']*t\r\n\r\nfor _ in range(t):\r\n a = list(map(int, sys.stdin.buffer.readline().decode('utf-8').rstrip()))\r\n n = len(a)\r\n parity = [0]*10\r\n for x in a:\r\n parity[x] ^= 1\r\n psum = sum(parity)\r\n\r\n for i, free in zip(range(n-1, -1, -1), range(n)):\r\n psum += -1 if parity[a[i]] else 1\r\n parity[a[i]] ^= 1\r\n for j in range(a[i]-1, -1, -1):\r\n if psum + (-1 if parity[j] else 1) - free <= 0:\r\n if i == 0 and j == 0:\r\n ans[_] = '9'*(n-2)\r\n break\r\n\r\n parity[j] ^= 1\r\n a[i] = j\r\n for k in range(n-1, i, -1):\r\n for l in range(10):\r\n if parity[l]:\r\n a[k] = l\r\n parity[l] = 0\r\n break\r\n else:\r\n a[k] = 9\r\n\r\n ans[_] = ''.join(map(str, a))\r\n break\r\n else:\r\n continue\r\n break\r\n\r\nsys.stdout.buffer.write('\\n'.join(ans).encode('utf-8'))\r\n", "import sys\r\nfrom array import array\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().rstrip()\r\ninp = lambda dtype: [dtype(x) for x in input().split()]\r\ndebug = lambda *x: print(*x, file=sys.stderr)\r\nsum_n = lambda n: (n * (n + 1)) // 2\r\nget_bit = lambda x, i: (x >> i) & 1\r\nceil_ = lambda a, b: a // b if (a >= 0) ^ (b > 0) else (abs(a) + abs(b) - 1) // abs(b)\r\nMint, Mlong, out = 2 ** 30 - 1, 2 ** 62 - 1, []\r\n\r\n\r\ndef get_solution(mem):\r\n rem = array('b')\r\n for i in range(10):\r\n if mem[i] & 1:\r\n rem.append(i)\r\n\r\n rem.extend([9] * (n - (len(rem) + sum(mem))))\r\n ret = a[:sum(mem)] + array('b', sorted(rem)[::-1])\r\n return ''.join(map(str, ret))\r\n\r\n\r\ndef solve():\r\n for i in range(n): mem[a[i]] += 1\r\n for i in range(n - 1, -1, -1):\r\n mem[a[i]] -= 1\r\n for j in range(a[i] - 1, -1 + (i == 0), -1):\r\n mem[j] += 1\r\n if sum([mem[x] & 1 for x in range(10)]) <= n - i - 1:\r\n a[i] = j\r\n return get_solution(mem)\r\n\r\n mem[j] -= 1\r\n\r\n return '9' * (n - 2)\r\n\r\n\r\nfor _ in range(1, int(input()) + 1):\r\n a = array('b', [int(x) for x in input()])\r\n n, mem = len(a), [0] * 10\r\n out.append(solve())\r\n\r\nprint('\\n'.join(map(str, out)))\r\n" ]

[ "from math import *\r\n\r\nx1, y1, r1 = map(float, input().split())\r\nx2, y2, r2 = map(float, input().split())\r\nx3, y3, r3 = map(float, input().split())\r\nx, y = (x1 + x2 + x3) / 3, (y1 + y2 + y3) / 3\r\n\r\n\r\ndef cost(a, b):\r\n d1, d2, d3 = sqrt((x1 - a) ** 2 + (y1 - b) ** 2), sqrt((x2 - a) ** 2 + (y2 - b) ** 2), \\\r\n sqrt((x3 - a) ** 2 + (y3 - b) ** 2)\r\n angle1, angle2, angle3 = d1 / r1, d2 / r2, d3 / r3\r\n return (angle1 - angle2) ** 2 + (angle2 - angle3) ** 2 + (angle3 - angle1) ** 2\r\n\r\n\r\nt = 1.0\r\nwhile t > 1e-5:\r\n if cost(x + t, y) < cost(x, y):\r\n x += t\r\n elif cost(x - t, y) < cost(x, y):\r\n x -= t\r\n elif cost(x, y + t) < cost(x, y):\r\n y += t\r\n elif cost(x, y - t) < cost(x, y):\r\n y -= t\r\n else:\r\n t /= 2\r\n\r\nif fabs(cost(x, y)) < 1e-5:\r\n print('{:5f} {:5f}'.format(x, y))\r\n", "import math\nimport random\n\np1 = list(map(float, input().split()))\np2 = list(map(float, input().split()))\np3 = list(map(float, input().split()))\n\ndef dist(x1, y1, x2, y2):\n return math.sqrt((x1-x2)**2+(y1-y2)**2)\n\ndef check(x, y):\n ratio1 = dist(p1[0], p1[1], x, y) / p1[2]\n ratio2 = dist(p2[0], p2[1], x, y) / p2[2]\n ratio3 = dist(p3[0], p3[1], x, y) / p3[2]\n\n diff = (ratio2 - ratio1)**2 + (ratio3 - ratio2)**2 + (ratio1 - ratio3)**2\n\n return diff\n\n\nx = (p1[0] + p2[0] + p3[0]) / 3.0\ny = (p1[1] + p2[1] + p3[1]) / 3.0\nthres = 10e-7\nd = 1\nprob = 0.1\nflag = False\n\nwhile d > 10e-7:\n cur = check(x, y)\n # print(cur)\n if cur < thres:\n flag = True\n break\n if check(x - d, y) < cur:\n x = x - d\n elif check(x + d, y) < cur:\n x = x + d\n elif check(x, y - d) < cur:\n y = y - d\n elif check(x, y + d) < cur:\n y = y + d\n else:\n d = d * 0.9\n # print(random.random())\n # if random.random() < prob:\n # x = x - d\n # elif random.random() < prob:\n # x = x + d\n # elif random.random() < prob:\n # y = y - d\n # elif random.random() < prob:\n # y = y + d\n\nif flag:\n print(x, y)\n", "\r\ndef main():\r\n import math\r\n def calCircle(x1, y1, r1, x2, y2, r2):\r\n inner = (x1 + r1/(r1+r2) * (x2-x1), y1 + r1/(r1+r2) * (y2-y1))\r\n outer = ((r2*x1-r1*x2) / (r2-r1), (r2*y1-r1*y2) / (r2-r1))\r\n centre = ((inner[0]+outer[0])/2, (inner[1]+outer[1])/2)\r\n radius = ((inner[0]-centre[0])**2 + (inner[1]-centre[1])**2) ** 0.5\r\n return centre, radius\r\n \r\n x1, y1, r1 = map(float, input().split(\" \"))\r\n x2, y2, r2 = map(float, input().split(\" \"))\r\n x3, y3, r3 = map(float, input().split(\" \"))\r\n \r\n if r1 == r2 and r1 == r3:\r\n a, b, c, d = x1-x2, y1-y2, x1-x3, y1-y3\r\n e = ((x1*x1-x2*x2) + (y1*y1-y2*y2)) / 2\r\n f = ((x1*x1-x3*x3) + (y1*y1-y3*y3)) / 2\r\n x = -(d*e-b*f)/(b*c-a*d)\r\n y = -(a*f-c*e)/(b*c-a*d)\r\n elif r1 == r2:\r\n a, b, c = x1-x2, y1-y2, ((x1*x1-x2*x2) + (y1*y1-y2*y2)) / 2\r\n centre, radius = calCircle(x1, y1, r1, x3, y3, r3)\r\n p = 1+(a*a)/(b*b)\r\n q = 2*(centre[1]-c/b)*a/b-2*centre[0]\r\n r = centre[0]**2+(centre[1]-c/b)**2-radius*radius\r\n delta = q*q - 4*p*r\r\n px1, px2 = (-q+math.sqrt(delta))/(2*p), (-q-math.sqrt(delta))/(2*p)\r\n py1, py2 = (c-a*px1)/b, (c-a*px2)/b\r\n norm1 = ((px1-x1)**2 + (py1-y1)**2) ** 0.5\r\n norm2 = ((px2-x1)**2 + (py2-y1)**2) ** 0.5\r\n if r1 / norm1 > r1 / norm2:\r\n x, y = px1, py1\r\n else:\r\n x, y = px2, py2\r\n elif r1 == r3:\r\n a, b, c = x1-x3, y1-y3, ((x1*x1-x3*x3) + (y1*y1-y3*y3)) / 2\r\n centre, radius = calCircle(x1, y1, r1, x2, y2, r2)\r\n p = 1+(a*a)/(b*b)\r\n q = 2*(centre[1]-c/b)*a/b-2*centre[0]\r\n r = centre[0]**2+(centre[1]-c/b)**2-radius*radius\r\n delta = q*q - 4*p*r\r\n px1, px2 = (-q+math.sqrt(delta))/(2*p), (-q-math.sqrt(delta))/(2*p)\r\n py1, py2 = (c-a*px1)/b, (c-a*px2)/b\r\n norm1 = ((px1-x1)**2 + (py1-y1)**2) ** 0.5\r\n norm2 = ((px2-x1)**2 + (py2-y1)**2) ** 0.5\r\n if r1 / norm1 > r1 / norm2:\r\n x, y = px1, py1\r\n else:\r\n x, y = px2, py2\r\n else:\r\n centre1, radius1 = calCircle(x1, y1, r1, x2, y2, r2)\r\n centre2, radius2 = calCircle(x1, y1, r1, x3, y3, r3)\r\n d = math.sqrt((centre1[0]-centre2[0])**2 + (centre1[1]-centre2[1])**2)\r\n l = (radius1**2-radius2**2+d**2) / (2*d)\r\n if radius1**2-l**2 < 0:\r\n exit()\r\n h = math.sqrt(radius1**2-l**2)\r\n px1 = l/d*(centre2[0]-centre1[0]) + h/d*(centre2[1]-centre1[1]) + centre1[0]\r\n px2 = l/d*(centre2[0]-centre1[0]) - h/d*(centre2[1]-centre1[1]) + centre1[0]\r\n py1 = l/d*(centre2[1]-centre1[1]) - h/d*(centre2[0]-centre1[0]) + centre1[1]\r\n py2 = l/d*(centre2[1]-centre1[1]) + h/d*(centre2[0]-centre1[0]) + centre1[1]\r\n norm1 = ((px1-x1)**2 + (py1-y1)**2) ** 0.5\r\n norm2 = ((px2-x1)**2 + (py2-y1)**2) ** 0.5\r\n if r1 / norm1 > r1 / norm2:\r\n x, y = px1, py1\r\n else:\r\n x, y = px2, py2\r\n print(x, y)\r\n\r\n\r\n\r\n\r\n\r\n\r\n# region M\r\n\r\n# region fastio\r\n\r\nimport sys, io, os\r\nBUFSIZE = 8192\r\nclass FastIO(io.IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = io.BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(io.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\ndef print(*args, **kwargs):\r\n for x in args:\r\n file.write(str(x))\r\n file.write(kwargs.pop(\"end\", \"\\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\n# region import\r\n\r\ninputt = lambda t = 0: range(t) if t else range(int(input()))\r\ninputi = lambda: map(int, input().split())\r\ninputl = lambda: list(inputi())\r\nfrom math import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import reduce, lru_cache\r\nfrom collections import Counter, defaultdict\r\nimport re, copy, operator, cmath\r\nfrom builtins import *\r\n\r\n# endregion\r\n\r\n# region main\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n# endregion\r\n\r\n# endregion", "__author__ = 'Eddie'\nimport sys\n\n\ndef get_filehandler(is_file):\n if is_file:\n return open(file=\"data\")\n else:\n import sys\n\n return sys.stdin\n\n\n# custom starts\n\ndef get_weighted_distance(vertices, pfree):\n return [((p[0] - pfree[0]) ** 2 + (p[1] - pfree[1]) ** 2) ** 0.5 / p[2] for p in vertices]\n\n\n\ndef get_error(distance):\n p1, p2, p3 = distance\n avg_p = (p1 + p2 + p3) / 3\n return (avg_p - p1) ** 2 + (avg_p - p2) ** 2 + (avg_p - p3) ** 2\n\n\nif __name__ == '__main__':\n fh = get_filehandler(is_file=False)\n # fh = get_filehandler(is_file=True)\n vertices = [[float(x) for x in line] for line in map(str.split, fh.readlines())]\n pfree = [sum([v[0] for v in vertices]) / 3, sum(v[1] for v in vertices) / 3]\n error = get_error(get_weighted_distance(vertices, pfree))\n d = 2\n while True:\n error = get_error(get_weighted_distance(vertices, pfree))\n # print(error)\n if error < 1E-8:\n print(\"{:.5f} {:.5f}\".format(pfree[0], pfree[1]))\n break\n if get_error(get_weighted_distance(vertices, (pfree[0] + d, pfree[1]))) < error:\n pfree[0] += d\n continue\n if get_error(get_weighted_distance(vertices, (pfree[0] - d, pfree[1]))) < error:\n pfree[0] -= d\n continue\n if get_error(get_weighted_distance(vertices, (pfree[0], pfree[1] + d))) < error:\n pfree[1] += d\n continue\n if get_error(get_weighted_distance(vertices, (pfree[0], pfree[1] - d))) < error:\n pfree[1] -= d\n continue\n d *= 0.5\n if d < 1E-5:\n break\n\n\n\n\n\n\n# Made By Mostafa_Khaled", "def hill_climbing(circles):\r\n \r\n def diff(x):\r\n d = []\r\n for y, ry in circles:\r\n d.append(abs(x - y) / ry)\r\n ans = 0\r\n for i in range(3):\r\n ans += (d[i] - d[(i+1)%3]) ** 2\r\n return ans\r\n \r\n x = 0\r\n s = 1\r\n for y, _ in circles:\r\n x += y / 3\r\n while s > 1e-6:\r\n x2 = x\r\n d = diff(x2)\r\n for dd in (s, -s, s*1j, -s*1j):\r\n if diff(x + dd) < d:\r\n x2 = x + dd\r\n d = diff(x2)\r\n if x2 == x: s *= 0.7\r\n else: x = x2\r\n return x if diff(x) < 1e-5 else None\r\n \r\n \r\nif __name__ == '__main__' and '__file__' in globals():\r\n circles = []\r\n for _ in range(3):\r\n x, y, r = map(int, input().split())\r\n circles.append((x + y*1j, r))\r\n ans = hill_climbing(circles)\r\n if ans is not None:\r\n print(\"{:.5f} {:.5f}\".format(ans.real, ans.imag))", "x1,y1,r1 = map(int,input().split())\r\nx2,y2,r2 = map(int,input().split())\r\nx3,y3,r3 = map(int,input().split())\r\n\r\nif r1==r2==r3:\r\n d = ((x2-x1)*(y3-y2)-(x3-x2)*(y2-y1))*2\r\n a = x2**2+y2**2-x1**2-y1**2\r\n b = x3**2+y3**2-x2**2-y2**2\r\n print(((y3-y2)*a+(y1-y2)*b)/d,((x2-x3)*a+(x2-x1)*b)/d)\r\nelse:\r\n if r1==r2: x2,y2,r2,x3,y3,r3=x3,y3,r3,x2,y2,r2\r\n if r2==r3: x1,y1,r1,x2,y2,r2=x2,y2,r2,x1,y1,r1\r\n \r\n r1 **= 2; r2 **= 2; r3 **= 2\r\n g1,g2 = r2-r1,r3-r2\r\n x4,y4 = (r2*x1-r1*x2)/g1,(r2*y1-r1*y2)/g1\r\n r4 = x4**2+y4**2-(r2*(x1**2+y1**2)-r1*(x2**2+y2**2))/g1\r\n x5,y5 = (r3*x2-r2*x3)/g2,(r3*y2-r2*y3)/g2\r\n r5 = x5**2+y5**2-(r3*(x2**2+y2**2)-r2*(x3**2+y3**2))/g2\r\n \r\n R = (x5-x4)**2+(y5-y4)**2\r\n if R>(r4**.5+r5**.5)**2 or r4>(R**.5+r5**.5)**2 or r5>(R**.5+r4**.5)**2: exit()\r\n c = (r4-r5)/R\r\n xt,yt = (x4+x5)/2+c*(x5-x4)/2,(y4+y5)/2+c*(y5-y4)/2\r\n dd = (2*(r4+r5)/R-c**2-1)**.5/2\r\n x6,y6 = xt+dd*(y5-y4),yt+dd*(x4-x5)\r\n x7,y7 = xt-dd*(y5-y4),yt-dd*(x4-x5)\r\n \r\n if (x6-x1)**2+(y6-y1)**2<(x7-x1)**2+(y7-y1)**2: print(x6,y6)\r\n else: print(x7,y7)", "\r\ndef hill_climbing(circles):\r\n \r\n def diff(x):\r\n d = []\r\n for y, ry in circles:\r\n d.append(abs(x - y) / ry)\r\n ans = 0\r\n for i in range(3):\r\n ans += (d[i] - d[(i+1)%3]) ** 2\r\n return ans\r\n \r\n x = 0\r\n s = 1\r\n for y, _ in circles:\r\n x += y / 3\r\n while s > 1e-6:\r\n d0 = diff(x)\r\n if d0 > diff(x + s): x += s\r\n elif d0 > diff(x - s): x -= s\r\n elif d0 > diff(x + s*1j): x += s*1j\r\n elif d0 > diff(x - s*1j): x -= s*1j\r\n else: s *= 0.7\r\n return x if diff(x) < 1e-5 else None\r\n \r\n \r\nif __name__ == '__main__' and '__file__' in globals():\r\n circles = []\r\n for _ in range(3):\r\n x, y, r = map(int, input().split())\r\n circles.append((x + y*1j, r))\r\n ans = hill_climbing(circles)\r\n if ans is not None:\r\n print(\"{:.5f} {:.5f}\".format(ans.real, ans.imag))", "# import math\r\n\r\n# p = [[0]*2 for i in range(3)]\r\n# r = [0]*3\r\n\r\n# a = [0]*2\r\n# b = [0]*2\r\n# k = [0]*2\r\n# c = [0]*2\r\n\r\n# # read input\r\n# for i in range(3):\r\n# p[i][0], p[i][1], r[i] = map(int, input().split())\r\n\r\n# # calculate coefficients\r\n# a[0] = 2*(p[0][0]-p[1][0])\r\n# a[1] = 2*(p[1][0]-p[2][0])\r\n# b[0] = 2*(p[0][1]-p[1][1])\r\n# b[1] = 2*(p[1][1]-p[2][1])\r\n# k[0] = r[1]*r[1] - r[0]*r[0]\r\n# k[1] = r[2]*r[2] - r[1]*r[1]\r\n# c[0] = p[1][0]*p[1][0] - p[0][0]*p[0][0] + p[1][1]*p[1][1] - p[0][1]*p[0][1]\r\n# c[1] = p[2][0]*p[2][0] - p[1][0]*p[1][0] + p[2][1]*p[2][1] - p[1][1]*p[1][1]\r\n# c[0] = -c[0]\r\n# c[1] = -c[1]\r\n\r\n# # check if intersection point exists\r\n# if a[1]*b[0]-a[0]*b[1] == 0:\r\n# exit()\r\n\r\n# xr = (k[1]*b[0]-k[0]*b[1])/(a[1]*b[0]-a[0]*b[1])\r\n# xc = (c[1]*b[0]-c[0]*b[1])/(a[1]*b[0]-a[0]*b[1])\r\n# yr = (k[1]*a[0]-k[0]*a[1])/(a[0]*b[1]-a[1]*b[0])\r\n# yc = (c[1]*a[0]-c[0]*a[1])/(a[0]*b[1]-a[1]*b[0])\r\n\r\n# af = xr*xr+yr*yr\r\n# bf = 2*xc*xr-2*p[1][0]*xr+2*yc*yr-2*p[1][1]*yr-r[1]*r[1]\r\n# cf = xc*xc-2*p[1][0]*xc+p[1][0]*p[1][0]+yc*yc-2*p[1][1]*yc+p[1][1]*p[1][1]\r\n# deta = bf*bf-4*af*cf\r\n\r\n# if af==0:\r\n# if bf==0 and cf!=0:\r\n# exit()\r\n# if bf*cf>0:\r\n# exit()\r\n# x = xc\r\n# y = yc\r\n# elif deta<0:\r\n# exit()\r\n# else:\r\n# deta = math.sqrt(deta)\r\n# maxd = deta-bf\r\n# mind = -bf-deta\r\n# if mind<0:\r\n# mind = maxd\r\n# if maxd<0:\r\n# exit()\r\n# else:\r\n# rs = mind/2/af\r\n# x = xr*rs+xc\r\n# rs = mind/2/af\r\n# x = xr*rs+xc\r\n# y = yr*rs+yc\r\n# print(\"{:.5f} {:.5f}\".format(x, y))\r\n\r\nimport math\r\n\r\nEPS = 1e-6\r\ndx = [1, -1, 0, 0]\r\ndy = [0, 0, 1, -1]\r\n\r\nclass Node:\r\n def __init__(self, x, y, r):\r\n self.x = x\r\n self.y = y\r\n self.r = r\r\n\r\ndef dis(a, b):\r\n return math.sqrt((a.x-b.x)**2 + (a.y-b.y)**2)\r\n\r\ndef check(p):\r\n ret = 0\r\n for i in range(1, 4):\r\n ret += ((dis(p, c[i])/c[i].r - dis(p, c[(i+1)%3+1])/c[(i+1)%3+1].r) ** 2)\r\n return ret\r\n\r\nc = [None] * 4\r\np0 = Node(0, 0, 0)\r\n\r\nfor i in range(1, 4):\r\n x, y, r = map(float, input().split())\r\n c[i] = Node(x, y, r)\r\n p0.x += x/3\r\n p0.y += y/3\r\n\r\ns = 1\r\n\r\nwhile s > EPS:\r\n flag = True\r\n for i in range(4):\r\n p = Node(p0.x+dx[i]*s, p0.y+dy[i]*s, 0)\r\n if check(p) < check(p0):\r\n p0.x += dx[i] * s\r\n p0.y += dy[i] * s\r\n flag = False\r\n if flag:\r\n s /= 2\r\n\r\nif check(p0) < EPS:\r\n print(\"{:.5f} {:.5f}\".format(p0.x, p0.y))\r\n", "import math\r\n\r\npt = dict()\r\n\r\ndef dis(a, b):\r\n return math.sqrt((a[0]-b[0])**2 + (a[1]-b[1])**2)\r\n\r\n\r\ndef cost(p, x, y):\r\n ang = list()\r\n for i in range(3): ang.append(dis(p[i], [x, y]) / p[i][2])\r\n\r\n diff = list()\r\n for i in range(3): diff.append(ang[i] - ang[(i+1)%3])\r\n\r\n ret = 0;\r\n for i in range(3): ret += diff[i] * diff[i]\r\n\t\r\n return ret\r\n\r\n\r\ndx = [0, 1, -1, 0]\r\ndy = [1, 0, 0, -1]\r\nerr = 1e-6\r\n\r\nif __name__ == '__main__':\r\n p = list()\r\n for i in range(3): p.append(list(float(x) for x in input().split(' ')))\r\n \r\n ans = list()\r\n ans.append((p[0][0] + p[1][0] + p[2][0]) / 3.0)\r\n ans.append((p[0][1] + p[1][1] + p[2][1]) / 3.0)\r\n ncost = cost(p, ans[0], ans[1])\r\n\t\r\n tmp = [0, 0]\r\n step = 1.0\r\n flag = False;\ti = 0\r\n while i < 300000 and ncost > err: \r\n flag = False\r\n for k in range(4): \r\n tmp[0] = ans[0] + step * dx[k]\r\n tmp[1] = ans[1] + step * dy[k]\r\n if ncost > cost(p, tmp[0], tmp[1]): \r\n ncost = cost(p, tmp[0], tmp[1])\r\n ans = list(tmp)\r\n flag = True\r\n i+=1\r\n if not flag: step *= 0.5\r\n\t\t\r\n\r\n if cost(p, ans[0], ans[1]) <= err: print(\"{0} {1}\".format(round(ans[0], 5), round(ans[1], 5)))\r\n \r\n" ]

[ "n=int(input())\r\nn=n**2\r\nfor i in range (0,n//2):\r\n\tprint(i+1,n-i)", "import math\n\nn = int(input())\nbags = int(math.pow(n,2))\n#candies = math.factorial(bags)\n\nn_bags = []\n\nfor j in range (n):\n\tn_bags.append(\"\")\n\tfor i in range(int(n/2)):\n\t\tn_bags[j] += str((i*n)+j+1)\n\t\tn_bags[j] += \" \"\n\t\tn_bags[j] += str(bags-(j+(i*n)))\n\t\tn_bags[j] += \" \"\n\t\t#n_bags[j].append((i*n)+j+1)\n\t\t#n_bags[j].append(bags-(j+(i*n)))\n\n\tprint (n_bags[j])\n\n\t\n\n\n\n\n", "n=int(input())\r\nmtx=[]\r\nfor i in range(1,n+1):\r\n v=[i for i in range((i-1)*n+1,(i-1)*n+n+1)]\r\n mtx.append(v)\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n print(mtx[j][(j+i)%n],end=' ')\r\n print('')\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(1,n*n//2+1):\r\n\tl.append(i)\r\n\tl.append(n*n-i+1)\t\r\nfor i in range(n):\r\n\tprint(*l[i*n:(i+1)*n])", "n = int(input())\nfor i in range(1, (n**2) // 2 + 1):\n print(i, n**2 + 1 - i)\n", "n=int(input())\r\nj=1\r\nfor i in range(n):\r\n res=[]\r\n for k in range(n//2):\r\n res.append(j)\r\n res.append(n**2-j+1)\r\n j+=1\r\n print(\" \".join([str(k) for k in res]))", "n = int(input())\nn_sqr = n**2\n\nr = range(1, n**2+1)\n\nfor i in range(0, n_sqr//2, n//2):\n for j in range(n//2):\n print(r[i+j], r[n_sqr-1-i-j], end=' ')\n print()\n", "n, m = int(input()), []\nfor i in range(n):\n m.append([0]*n)\n\nif n % 2 == 0:\n for j in range(n):\n for i in range(n):\n m[i][j] = n*j + ((n-i) if j % 2 == 1 else (i+1))\nelse:\n px, py, v = 0, n//2, 1\n while v <= n*n:\n if m[px][py] != 0:\n px = (px + 1)%n\n m[px][py] = v\n v, px, py = v + 1, px - 1, py + 1\n px = px if px >= 0 else n-1\n py = py if py <= n-1 else 0\n\nfor i in range(n):\n print(*m[i])\n", "num = int(input())\r\narr = [x for x in range(1, num ** 2 + 1)]\r\nfor x in range(len(arr) // 2):\r\n print(arr[x], arr[~x])\r\n\r\n\r\n\r\n", "n = int(input())\ny = (n*n)//2\nfor i in range(y):\n print(i+1,n*n-i)\n \t\t \t \t \t\t \t \t \t\t \t \t \t", "n=int(input())\r\nres1=[]\r\nres2=[]\r\nc=0\r\nfor i in range(1,n*n+1,2):\r\n if c&1:\r\n res2.append(i)\r\n res2.append(n*n+1-i)\r\n else:\r\n res1.append(i)\r\n res1.append(n*n+1-i)\r\n c+=1\r\nprint(*res1)\r\nprint(*res2)", "n = int(input())\r\nhead = 1 ; tail = n*n\r\n\r\nfor _ in range (n):\r\n for i in range (n//2):\r\n print(head + i,tail - i,end=' ')\r\n head += n//2 ; tail -= n//2", "n = input()\nn = int(n)\nbags = []\nfor i in range(n**2):\n\tbags.append(i + 1)\n\nstart = 0\nend = -1\nstep = int(n / 2)\n\nfor i in range(n):\n\tfor j in range(start, start + step):\n\t\tprint(bags[j], end=' ')\n\tstart += step\n\tfor j in range(end, end - step, -1):\n\t\tprint(bags[j], end=' ')\n\tend -= step\n\tprint('')\t\n", "N=int(input()) # is always even 2<N<100\r\ncandies=[x+1 for x in range(N**2)]\r\n\r\n\r\nsumof_candies_per_person=sum(candies)/N\r\ncandies=list(reversed(sorted(candies)))\r\n\r\nbags_per_person=[]\r\nfor i in range(N):\r\n bags_per_person.append(candies[0:N//2]+candies[-N//2:])\r\n del candies[0:N//2]\r\n del candies[-N//2:]\r\n\r\nfor bags in bags_per_person:\r\n for bag in bags:\r\n print(bag, end=\" \")\r\n print(\"\")\r\n\r\n\r\n\r\n \r\n\r\n", "n = int(input())\r\nr = [str(i) for i in range(1,n*n+1)]\r\nrr = [r.pop() for i in range(n*n//2)]\r\nfor i in range(n):\r\n s = \"\"\r\n for ii in range(n//2):\r\n s += r.pop() +\" \"+ rr.pop()+\" \"\r\n print(s)", "n = int(input())\r\nleft = 1\r\nright = n ** 2\r\nfor i in range(n):\r\n for j in range(n // 2):\r\n print(left, right, end=' ')\r\n left, right = left + 1, right - 1\r\n print()", "n = int(input())\r\nk = n * n\r\nii = 1\r\nlim = n//2\r\n\r\ndef printrange(i, j):\r\n for x in range(i, j+1):\r\n print(x, end=' ')\r\n\r\nv = n//2\r\ns = 1\r\nkk = k\r\nfor _ in range(n):\r\n printrange(s, v)\r\n printrange(kk-v+1, kk-s+1)\r\n s = s + n//2\r\n v = v + n//2\r\n print()", "n = int(input())\r\ni, j = 1, n * n\r\nfor __ in range(n):\r\n for ___ in range(n // 2):\r\n print(str(i) + \" \" + str(j), end=\" \")\r\n i, j = i + 1, j - 1\r\n print()", "# coding: utf-8\nn = int(input())\nfor i in range(n):\n for j in range(n//2):\n print(i*(n//2)+j+1,1+n*n-i*(n//2)-j-1,end=' ')\n print('')\n", "#!/usr/bin/python3\n\nn = int(input())\nl = 1\nr = n * n\nans = [[] for i in range(n)]\nj = 0\nwhile l < r:\n ans[j % n].append(l)\n ans[j % n].append(r)\n l += 1\n r -= 1\n j += 1\n\nfor i in range(n):\n print(*ans[i])\n", "n=int(input())\r\nm=n*n\r\na=1\r\nwhile m>a:\r\n print(a,m)\r\n a+=1;\r\n m-=1;", "n = int(input())\r\n\r\n\r\n\r\nfor i in range(n):\r\n out=[]\r\n for j in range(n):\r\n out.append(str(n*j+(i+j)%n+1))\r\n print(\" \".join(out))\r\n", "a=int(input())\r\nk=a**2\r\nhalf=int(a/2)\r\nsweets=[x for x in range(1,k+1)]\r\nfor x in range(a):\r\n print(*sweets[:half],*sweets[-half:])\r\n sweets[:half]=[]\r\n sweets[-half:]=[]\r\n", "n = int(input())\r\nfor i in range(1, n*n//2+1):\r\n print(i, n*n-i+1)", "brotherNo = int(input())\r\ncandyPerBro = int((brotherNo**3 + brotherNo)/2)\r\n\r\nfor i in range(1, brotherNo + 1):\r\n sum = 0\r\n j = i\r\n while sum < candyPerBro:\r\n print(str(j) + \" \" + str(brotherNo*brotherNo + 1 - j ) + \" \", end = \"\")\r\n sum += j\r\n sum += brotherNo*brotherNo - j + 1\r\n j += brotherNo\r\n print()", "n = int(input())\r\nlast = n * n\r\ncurr = 1\r\nfor i in range(n):\r\n for j in range(n // 2):\r\n print(curr, end=\" \")\r\n print(last - curr + 1, end=\" \")\r\n curr += 1\r\n print()\r\n", "\r\nn = int(input())\r\nm = n * n\r\nl = [i for i in range(1, m + 1)]\r\nne = sum(l) // n\r\n\r\n\r\nwhile len(l) > 0:\r\n\tprint(l[0], l[len(l) - 1])\r\n\tl.pop()\r\n\tl.pop(0)\r\n\r\n", "def main():\n n = int(input())\n n_2 = n*n\n output = \"\"\n for x in range(n):\n k_list = []\n for j in range(int(n/2)):\n number = int(x*(n/2)+1+j)\n k_list.append(number)\n k_list.append(n_2-number+1)\n k_list.sort()\n k_list = [str(number) for number in k_list]\n print(\" \".join(k_list))\n\nmain()", "n = int(input())\r\nfor i in range(n):\r\n temp = []\r\n for j in range(i * n // 2, (i + 1) * n // 2):\r\n temp.append(j + 1)\r\n temp.append(n ** 2 - j)\r\n print(' '.join(str(temp[k]) for k in range(n)))\r\n \r\n", "def generator(N):\r\n\treturn [i for i in range(1, N + 1)]\r\n\r\n\r\nn = int(input())\r\nN = n * n\r\nmass = generator(N)\r\nn0 = n // 2\r\nst1 = 0\r\nst2 = N - n0 - 1\r\nfor _ in range(n):\r\n\tarray = mass[st1: st1 + n0] + mass[st2 + 1: st2 + n0 + 1]\r\n\tst1 += n0\r\n\tst2 -= n0\r\n\tprint(*array)", "a=int(input());b=['']*a\r\nfor i in range(a*a):\r\n if (i//a)%2:b[i%a]+=str(i+1)+' '\r\n else:b[a-i%a-1]+=str(i+1)+' '\r\nprint('\\n'.join(b))", "n=int(input())\nbags=n*n\narr=[[0]*n for x in range(n)]\ni=1\nr=0\nc=0\ndirection=1\nwhile i<bags:\n\tif direction:\n\t\twhile r<n:\n\t\t\t# print(r,c)\n\t\t\tarr[r][c]=i\n\t\t\tr+=1\n\t\t\ti+=1\n\t\tdirection^=1\n\telse:\n\t\twhile r>0:\n\t\t\t# print(r,c)\n\t\t\tarr[r-1][c]=i\n\t\t\tr-=1\n\t\t\ti+=1\n\t\tdirection^=1\n\tc+=1\nfor row in arr:\n\tfor col in row:\n\t\tprint(col,end=' ')\n\tprint()", "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\n#from math import log10 ,log2,ceil,factorial as fac,gcd\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 n=t()\r\n j=n*n\r\n i=1\r\n fl=0\r\n for h in range(n):\r\n p=[]\r\n for e in range(n):\r\n if fl:\r\n p.append(j)\r\n j-=1\r\n else:\r\n p.append(i)\r\n i+=1\r\n fl=1-fl\r\n print(*p)\r\n \r\n'''\r\n4\r\n\r\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16\r\n\r\n16 1 15 2\r\n14 3 13 4\r\n12 5 11 6\r\n10 7 9 8\r\n\r\n\r\n'''\r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\nf()\r\n", "n = int(input())\r\np1 = 1\r\np2 = n*n\r\nfor i in range(n):\r\n for j in range(int(n//2)):\r\n print(p1,end=\" \")\r\n print(p2,end = \" \")\r\n p1+=1\r\n p2-=1\r\n print()", "import sys\r\n#import math\r\n#from queue import *\r\n#import random\r\n#sys.setrecursionlimit(int(1e6))\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nn=inp()\r\nperHead=(n//2)*(n*n+1)\r\nans=[[0 for i in range(n)] for j in range(n)]\r\ncurr=1\r\nfor j in range(n):\r\n\tif j%2==0:\r\n\t\tfor i in range(n):\r\n\t\t\tans[i][j]=curr\r\n\t\t\tcurr+=1\r\n\telse:\r\n\t\tfor i in range(n-1,-1,-1):\r\n\t\t\tans[i][j]=curr \r\n\t\t\tcurr+=1\r\nfor i in range(n):\r\n\tprint(*ans[i])\r\n", "n=int(input())\r\nli=[i for i in range(1,n**2+1)]\r\nj=[]\r\nans=[]\r\ncount=0\r\nk=[]\r\nfor i in range(0,(n**2)//2):\r\n\tj.append([li[i],li[-i-1]])\r\nfor i in j:\r\n\tk+=i\r\n\tcount+=1\r\n\tif count==n//2:\r\n\t\tans.append(k)\r\n\t\tk=[]\r\n\t\tcount=0\r\n\r\nfor i in ans:\r\n\tprint(*i)", "n=int(input())\r\nx=n*n\r\na=[i for i in range(1,x+1)]\r\n# print(a)\r\nfor i in range(n):\r\n j=1\r\n while(j<=n//2):\r\n print(a[0],a[-1],end=' ')\r\n a.pop(0)\r\n a.pop(-1)\r\n j+=1\r\n print()", "t=int(input())\nlow=1\nhigh=t**2\ni=0\nhigh_index=high\nlow_index=1\nfor _ in range(t):\n for h in range(t//2):\n print(high_index,end=\" \")\n high_index-=1\n for j in range(t//2):\n print(low_index,end=\" \")\n low_index+=1\n print(' ')\n\n \n\n\n", "n = int(input())\n\ncandies = list(range(1, n ** 2 + 1))\n\ni = 0\nwhile i < len(candies) // 2:\n lst = []\n for j in range(n // 2):\n lst.append(candies[i])\n lst.append(candies[len(candies) - 1 - i])\n i += 1\n print(*lst)\n\n", "n = int(input().strip())\r\ni = 1\r\nj = n**2\r\nwhile i < j:\r\n\tarr = [i, j]\r\n\tfor x in range(n//2-1):\r\n\t\ti += 1\r\n\t\tj -= 1\r\n\t\tarr.append(i)\r\n\t\tarr.append(j)\r\n\ti += 1\r\n\tj -= 1\r\n\tprint(*arr)\r\n\r\n", "n = int(input())\nlst = []\nfor i in range((n * n) // 2):\n lst.append(i + 1)\n lst.append(n * n - i)\nprint(*lst)\n \t\t\t \t \t\t \t \t \t \t \t", "# candy bags\r\n# hey stalker\r\nn=int(input())\r\nm=n*n\r\nd=m//n\r\na=1\r\nb=m\r\nl=[]\r\nwhile(a<b):\r\n l.append(a)\r\n l.append(b)\r\n a=a+1\r\n b=b-1\r\n if(len(l)==d):\r\n print(*l)\r\n l.clear()\r\n \r\n \r\n \r\n ", "import sys\r\nn = int(sys.stdin.readline())\r\nresult = [[] for i in range(n)]\r\nflag = False\r\nfor i in range(n**2):\r\n if i%n == 0:\r\n flag = (False if flag else True)\r\n if flag:\r\n result[i%n].append(i+1)\r\n else:\r\n result[n-1-i%n].append(i+1)\r\nfor i in range(n):\r\n print(\" \".join([str(x) for x in result[i]]))", "n=int(input())\nfor i in range(0,n):\n\tfor j in range(0,n,2):\n\t\tprint(j*n+i+1,end=\" \")\n\t\tprint((j+2)*n-i,end=\" \")\n\tprint()\n\t\t\t\t\t \t \t \t \t\t \t\t \t\t\t \t", "n = int(input())\r\na = n**2\r\nb = n//2\r\nfor i in range(0, b*n, b):\r\n for j in range(b):\r\n print(i+j+1, end=\" \")\r\n for j in range(b):\r\n print(a-i-j, end=\" \")\r\n print(\"\")", "n=int(input())\r\nk=(n**2)+1\r\nfor i in range(n*n//2):\r\n if i!=k-i:\r\n print(i+1,k-(i+1))\r\n\r\n\r\n\r\n \r\n", "'''\r\nCreated on ٠٩‏/١٢‏/٢٠١٤\r\n\r\n@author: mohamed265\r\n'''\r\nn = int(input())\r\nnn = n ** 2\r\n#target = (int((nn / 2) * (nn + 1)) // n)\r\n#print(target)\r\n#num = [int(x) for x in range(1,nn+1)] \r\n#lis = []\r\nfor i in range(0 , n * n//2 ):\r\n print(i+1 , nn - i, end = ' ')\r\n if (i+1) % (n//2) == 0:\r\n print()", "n = int(input()) ** 2\r\na = [i for i in range(1, n + 1)]\r\ni, j = 0, n - 1\r\nwhile i < j:\r\n print(a[i], a[j])\r\n i += 1\r\n j -= 1\r\n", "def get_candies(n):\r\n result = []\r\n bags = list(range(1, n**2 +1))\r\n\r\n for i in range(n):\r\n each = []\r\n for times in range(int(n / 2)):\r\n each.append(bags[0])\r\n each.append(bags[-1])\r\n bags = bags[1:len(bags)-1]\r\n each.sort()\r\n result.append(each)\r\n\r\n return result\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n \r\n\r\n\r\n result = get_candies(n)\r\n \r\n for i in range(len(result)):\r\n string = \"\"\r\n for value in result[i]:\r\n string += str(value)\r\n string += \" \"\r\n print(string)\r\n \r\n \r\n \r\n\r\n#import doctest\r\n#doctest.testmod()\r\nmain() \r\n", "brothers = int(input())\r\ncandy_bags = brothers**2\r\nfor i in range(int(candy_bags / 2)):\r\n print(str(i+1) + ' ' + str(candy_bags - i))\r\n", "class CodeforcesTask334ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n\n def read_input(self):\n self.n = int(input())\n\n def process_task(self):\n rr = 1 + self.n ** 2\n for x in range(self.n):\n candies = []\n for y in range(self.n // 2):\n candies.append((self.n // 2) * x + y + 1)\n candies.append(rr - (self.n // 2) * x - 1 - y)\n print(\" \".join([str(z) for z in candies]))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask334ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\nli = [[] for _ in range(n)]\r\nfor i in range(1, n * n // 2 + 1):\r\n li[(i - 1) % n] += [i, n * n - i + 1]\r\nfor line in li:\r\n print(*line)\r\n", "n = int(input())\nbrother = 1\nwhile brother <= n:\n i = brother\n j = n**2-brother+1\n while j>i:\n print(i,j,end=\" \")\n i+=n\n j-=n\n \n\n print()\n brother+=1", "n=int(input())\r\na=[[0]*n for i in range(n)]\r\nfor i in range(n):\r\n p=[]\r\n for j in range(n):\r\n p.append(n*i+j+1)\r\n for j in range(n):\r\n a[j][i]=p[(i+j)%n]\r\nfor i in range(n):\r\n print()\r\n for j in range(n):\r\n print(a[i][j],end=' ')\r\n", "n=int(input())\r\na=[i for i in range(1,n**2+1)]\r\nright=0\r\nleft=n**2-1\r\nfor i in range(1,n**2+1):\r\n\tif i%2==1:\r\n\t\tprint(a[right],end=\" \")\r\n\t\tright+=1\r\n\telse:\r\n\t\tprint(a[left],end=\" \")\r\n\t\tleft-=1\r\n\tif i%n==0:\r\n\t\tprint()\r\n", "# Write Python 3 code in this online editor and run it.\nw=int(input())\nfor i in range(w*w//2): print(i+1,w*w-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\na=n*(n**2+1)//2\r\nl=list(range(1,n**2+1))\r\nfor i in range(n):\r\n ans=[]\r\n for j in range(n//2):\r\n ans.append(l[0]);ans.append(l[-1])\r\n l.pop(0);l.pop(-1)\r\n print(*ans)\r\n\r\n", "n = int(input())\nnums = [i for i in range(1, n**2 + 1)]\nbro1 = []\ni = 0\nj = len(nums) - 1\nwhile i != j and i < j:\n bro1.append(nums[i])\n bro1.append(nums[j])\n i += 2\n j -= 2\nbro2 = []\ni = 1\nj = len(nums) - 2\nwhile i != j and i < j:\n bro2.append(nums[i])\n bro2.append(nums[j])\n i += 2\n j -= 2\nfor num in bro1:\n print(num, end=\" \")\nprint(\"\")\nfor num in bro2:\n print(num, end=\" \")\n", "n = int(input())\noffset = int(n/2)\nlist = []\nfront = 1\nlast = n*n\n\nfor i in range(n):\n for j in range(offset):\n print(front,end=' ')\n front+=1\n for j in range(offset):\n print(last,end=' ')\n last-=1\n print()\n", "#https://codeforces.com/problemset/problem/334/A\nn=int(input())\nl=list(range(1,n**2+1))\ns,e=0,n**2-1\nfor _ in range(n):\n\tprint(*l[s:s+n//2],*l[e-n//2+1:e+1])\n\ts+=(n//2)\n\te-=(n//2)\n\n\t\n\n\n\n\n\n", "n = int(input())\r\nlists=[]\r\nfor i in range(n):\r\n temp=list(range(i*n+1,(i+1)*n+1))\r\n lists.append(temp)\r\n\r\nfor x in range(n):\r\n for z in range(n):\r\n locx = z % n\r\n locy = (x+z) % n\r\n print(lists[locx][locy],end=' ')\r\n print()", "n = int(input())\r\narr = [[i, n**2 - (i-1)] for i in range(1, (n**2)//2 + 1)]\r\nfor i in range(0,(n**2)//2, n//2):\r\n\tans = []\r\n\ttemp = arr[i:i+n//2]\r\n\tfor j in temp:\r\n\t\tans.extend(j)\r\n\tprint(*ans)", "n = int(input())\nsq = n*n\nfor i in range(0,int(sq/2)):\n print(i+1,sq-i)\n# if not sq/2 == int(sq/2):\n# print((int(sq/2) + 1), (int(sq/2) + 1))", "def solution():\r\n\tn=int(input())\r\n\tused=set()\r\n\tarr=[]\r\n\tsol=[]\r\n\tfor i in range(1,n*n+1):\r\n\t\tarr.append(i)\r\n\tfor i in range(n**2//2):\r\n\t\tsol.append([arr[i],arr[n**2-i-1]])\r\n\r\n\t\r\n\r\n\tskip=n//2\r\n\tfor i in range(0,n*n//2,skip):\r\n\t\tcurr=[]\r\n\t\tfor j in range(0,skip):\r\n\t\t\tcurr+=sol[i+j]\r\n\t\tprint(*curr)\r\n\r\n\r\n\r\n\r\n\treturn\r\n\r\n\r\n# t=int(input())\r\n# while t:\r\n# \tt-=1\r\nsolution()\r\n", "n = int(input())\r\nbags = []\r\nfor i in range(1, n*n + 1):\r\n bags.append(i)\r\n\r\nfor i in range(n):\r\n out = \"\"\r\n for j in range(n//2):\r\n out += str(bags.pop()) + \" \" + str(bags.pop(0)) + \" \"\r\n print(out[:-1])\r\n", "n = int(input())\r\na = range(1, n * n + 1)\r\nfor i in range(n):\r\n n1 = n // 2\r\n print(*list(a[i * n1:(i + 1) * n1]), *list(a[n * n - (i + 1) * n1:n * n - i * n1]))", "n = int(input())\r\na=[]\r\nres=[]\r\nfor i in range(1,((n**2)//2)+1):\r\n a.append(i)\r\n a.append((n**2)+1-i)\r\n\r\nfor i in range(0,n**2,n):\r\n s=\"\"\r\n for j in range(i,n+i):\r\n s+=str(a[j])+\" \"\r\n res.append(s)\r\nfor i in res:\r\n print(i[:len(i)-1])", "n=int(input())\r\nk=n**2\r\nfor i in range((n**2)//2):\r\n print(i+1,k)\r\n k-=1", "#!/usr/bin/python3\n# -*- coding: <utf-8> -*-\n\nimport itertools as ittls\nfrom collections import Counter\n\nimport string\n\n\ndef sqr(x):\n return x*x\n\ndef inputarray(func = int):\n return map(func, input().split())\n\n# -------------------------------\n# -------------------------------\n\nN = int(input())\n\ns = [None]*N\nfor i in range(N):\n for j in range(N):\n _, x = divmod(i - j + N, N)\n s[j] = j*N + x + 1\n\n print(' '.join(map(str, s)))\n", "n = int(input())\r\na = 1\r\nb = n*n\r\nfor i in range(0,n):\r\n for j in range(0,n//2):\r\n print(a, end = \" \")\r\n a += 1\r\n for j in range(0,n//2):\r\n print(b, end = \" \")\r\n b -= 1\r\n print(\"\")", "n=int(input())\r\na=*range(1,n*n+1),\r\nk=n//2\r\ni=0\r\nfor _ in[0]*n:\r\n print(*a[i:i+k]+a[-i-k:n*n-i])\r\n i+=k", "n = int(input())\n\nc=1\nd=n**2\n\nfor i in range(0,n):\n\tr=[]\n\tfor j in range(0,n//2):\n\t\tr.append(c)\n\t\tr.append(d)\n\t\tc+= 1\n\t\td-=1\n\tprint(*r)", "n=int(input())\r\nn=n*n\r\nfor i in range (0,(n)//2):\r\n\tprint(i+1,n-i)", "n=int(input())\r\nd=[i for i in range(1,pow(n,2)+1)]\r\ntotal=(pow(n,2)+1)*n//2\r\nfor i in range(n-1):\r\n t=0\r\n ans=[]\r\n while(t<n-1):\r\n if t%2==0 :\r\n ans.append(d.pop(0))\r\n else:\r\n ans.append(d.pop())\r\n t+=1\r\n z=sum(ans)\r\n ans.append(total-z)\r\n d.remove(total-z)\r\n print(*ans)\r\nprint(*d)\r\n\r\n \r\n\r\n\r\n\r\n", "n = int(input())\r\np = [str(i) for i in range(1, n**2+1)]\r\n\r\nres = []\r\nfor i in range(n):\r\n l1, l2 = p[:n//2], p[len(p)-n//2:]\r\n res.append(l1 + l2)\r\n p = p[n//2:len(p)-n//2]\r\n\r\nfor x in res:\r\n print(' '.join(x))", "n = int(input())\nar = [i for i in range(1,(n**2)+1)]\n\nfor i in range(1, int((n**2)/2)+1):\n\tprint(ar[i-1],ar[-i])", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Sep 8 16:24:42 2020\n\n@author: anirudhasarmatumuluri\n\"\"\"\n\n\ndef main():\n n = int(input())\n bags = n*n\n lb = 1\n rb = bags\n while lb<rb:\n print(lb,rb)\n lb+=1\n rb-=1\n return\n\n\n\n\n\n\n\nmain()", "n =int(input());i=1;j=n**2\r\nfor x in range(n):\r\n for y in range(int(n/2)):\r\n if y==int(n/2)-1:\r\n print(i,j)\r\n else:\r\n print(i,j,end =' ')\r\n i+=1;j-=1;\r\n \r\n \r\n i+=1;j-=1;", "from sys import stdout\r\nn = int(input())\r\nf = [1+i*(n+1) for i in range(n)]\r\nprint(*f)\r\nfor i in range(1,n):\r\n for j in range(n):\r\n if f[j]+i>(j+1)*n:\r\n stdout.write(str(f[j-1]+i+1)+' ')\r\n else:\r\n stdout.write(str(f[j]+i)+' ')\r\n stdout.write('\\n')", "n = int(input())\n\nlist = []\n\nfor i in range(n):\n\tlist.append([])\n\nx = 1\nfor i in range(n//2):\n\tfor l in list:\n\t\tl.append(x)\n\t\tx += 1\n\n\tfor l in list[::-1]:\n\t\tl.append(x)\n\t\tx += 1\n\nfor l in list:\n\tfor i in l:\n\t\tprint(str(i)+\" \", end = \"\")\n\tprint()\n\t\t \t \t\t \t\t \t\t\t\t \t \t \t\t\t", "n = int(input())\n\ni, j = 1, n*n\n\nwhile i < j:\n print(i, j)\n i += 1\n j -= 1\n", "n = int(input())\r\n\r\nh = n * n\r\nk = 1\r\nfor i in range(0, n):\r\n for j in range(int(n/2)):\r\n print(k, h - k +1, sep=' ', end=\" \")\r\n k+=1\r\n print()", "n = int(input())\r\n\r\nfor i in range(n**2 // 2):\r\n\tprint(i+1, n**2-i)\r\n\r\n\r\n", "from collections import defaultdict\n\nn = int(input())\ncandies = [x for x in range(1, n ** 2 + 1)]\n\nhash_map = defaultdict(list)\ni = 0\nwhile i != n:\n j = 0\n for x in range(1, n + 1):\n if x % 2 != 0:\n hash_map[i].append(candies[0])\n candies.remove(candies[0])\n else:\n hash_map[i].append(candies[-1])\n candies.remove(candies[-1])\n\n i += 1\n\nfor v in hash_map.values():\n print(*v)\n", "a=int(input())\r\nfor i in range(a):\r\n b=[]\r\n for j in range(a):\r\n b+=[a*j+(j+i)%a+1]\r\n print(' '.join(map(str,b)))\r\n", "n=int(input())\r\nfor i in range(n):\r\n\tl=[]\r\n\tfor j in range(n):\r\n\t\tx=n*j\r\n\t\tif (i+j+1)%n==0:\r\n\t\t\tz=n\r\n\t\telse:\r\n\t\t\tz=(i+j+1)%n\r\n\t\ty=x+z\r\n\t\tl.append(y)\r\n\tprint(*l)", "numberBrother = int(input())\r\n\r\nnumberSet = int(numberBrother/2)\r\n\r\nstart = 1\r\nend = int(numberBrother**2)\r\ncount =0\r\nwhile count != numberBrother:\r\n holder = []\r\n for counter in range(numberSet):\r\n holder.append(start)\r\n holder.append(end)\r\n start += 1\r\n end -= 1\r\n count +=1\r\n print(*holder, sep=' ')\r\n\r\n\r\n", "n = int(input())\r\n\r\nfor i in range(n):\r\n for j in range(n//2):\r\n s = 2*n*j + i + 1\r\n e = 2*n*j + (2*n - i)\r\n print(s, e, end=\" \")\r\n print()", "n = input()\r\nn = int(n)\r\nbags = range(n*n)\r\ncoord = []\r\nfor _ in range(n):\r\n coord.append((_,_))\r\nfor _ in range(n):\r\n for x,y in coord:\r\n if x is 0:\r\n print(bags[x*n+(y+_)%n]+1,end='')\r\n else:\r\n print(' ',bags[x*n+(y+_)%n]+1,sep='',end='')\r\n print()\r\n\r\n", "n=int(input())\r\nx=[]\r\nfor i in range(n*n):\r\n x.append(i+1)\r\ns=sum(x)//n\r\ni=0\r\nj=n-1\r\nfor i in range(n):\r\n for j in range(n*i//2,n*(i+1)//2):\r\n print(x[j],x[n*n-j-1],end=\" \")\r\n print(\"\")", "n=int(input())\nfor i in range(0,n):\n for j in range(1,n+1):\n print((i+j-1)%(n)+1+(j-1)*(n),end=\" \")\n print()", "def testcase():\n x, i = int(input().strip()), 1\n j = x * x\n\n for _ in range(x):\n for _ in range(x//2):\n print(i, j, end=\" \")\n j -= 1\n i += 1\n print()\n\n\n\nif __name__ == '__main__':\n t = 1\n \n for _ in range(t):\n testcase()", "n=int(input())\r\ns=n*n\r\nans=[i for i in range(1,s+1)]\r\na=[]\r\np=0\r\nq=n*n-1\r\nfor i in range(n):\r\n\t\r\n\tc=0\r\n\tl=[]\r\n\twhile(1):\r\n\t\tif(c==n):\r\n\t\t\tc=0\r\n\t\t\tbreak\r\n\t\tl.append(ans[p])\r\n\t\t# l.append(ans[p+1])\r\n\t\tl.append(ans[q])\r\n\t\tq-=1\r\n\t\tp+=1\r\n\t\tc+=2\r\n\ta.append(l)\r\n\tl=[]\r\nfor i in a:\r\n\tprint(*i)", "n = int(input())\na = n//2\ncnt = 1\nfor i in range(n):\n c = list(range(cnt,cnt+a))+list(range(n*n-cnt-a+2,n*n-cnt+1+1))\n print(*c)\n cnt += a\n", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n N = lambda: int(input())\r\n\r\n n = N()\r\n\r\n a = list()\r\n\r\n for i in range(int(n**2 / 2)):\r\n a.extend([i + 1, n**2 - i])\r\n if (i + 1) % (n / 2) == 0:\r\n print(*a)\r\n a.clear()", "n=int(input())\r\ni=1\r\nwhile i<=n**2//2:\r\n for j in range(n//2-1):\r\n print(i+j,n**2-i-j+1,end=' ')\r\n print(i+n//2-1,n**2+1-(i+n//2-1))\r\n i+=n//2\r\n", "n = int(input())\r\nbags = [i for i in range(1, n**2+1)]\r\ni = 0\r\nj = n**2-1\r\nwhile(i < j):\r\n print(bags[i], bags[j])\r\n i += 1\r\n j -= 1\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef transpose(A):\r\n n = len(A)\r\n B = []\r\n for i in range(n):\r\n B.append([0] * n)\r\n for i in range(n):\r\n for j in range(n):\r\n B[i][j] = A[j][i]\r\n return B\r\n\r\ndef solve(n):\r\n A = []\r\n for i in range(n):\r\n A.append([0] * n)\r\n for i in range(n):\r\n for j in range(n):\r\n A[i][j] = i * n + j + 1\r\n for i in range(n):\r\n if i % 2 == 1:\r\n A[i] = A[i][::-1]\r\n return transpose(A)\r\n\r\ndef main():\r\n ans = solve(int(input()))\r\n for i in range(len(ans)):\r\n print(' '.join(list(str(a) for a in ans[i])))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\np = n * n\nfor i in range(1, (p // 2) + 1):\n print(i, (n * n - i + 1))\n\t \t\t\t \t\t \t \t \t \t\t\t\t", "def solve():\r\n n=int(input())\r\n b=n**2\r\n i=1;\r\n j=b\r\n while(i<j):\r\n print(i,j)\r\n i+=1;\r\n j-=1\r\n \r\n \r\n\r\n# t=int(input())\r\n# # print(check(4,2))\r\n# for i in range(t):\r\nsolve()", "n = int(input())\r\nx = n * n\r\ni = 1\r\ncount = 0\r\nwhile i <= x:\r\n if count < n//2:\r\n print(i,end=\" \")\r\n i += 1\r\n count += 1\r\n elif count < n:\r\n print(x,end=\" \")\r\n x -= 1\r\n count += 1\r\n else:\r\n print()\r\n count = 0\r\n\r\n", "# ===============================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===============================\r\nimport math, fractions, collections\r\n# ===============================\r\nn = int(input())\r\neach = pow(n,2)+1\r\nfor i in range(1, n+1):\r\n\tprint(i, each-i, end = \" \")\r\n\tfor j in range(i+n, each//2 + 1, n):\r\n\t\tprint(j, each-j, end = \" \")\r\n\tprint()\r\n", "n = int(input())\nfor i in range(n):\n\ta = [str(x) for x in range(1 + i * n // 2, 1 + (i + 1) * n // 2)]\n\tb = [str(x + n * n // 2) for x in range(1 + (n - i - 1) * n // 2, 1 + (n - i) * n // 2)]\n\tprint(' '.join(a) + ' ' + ' '.join(b))\n", "n = int(input())\n\nbratia = [[] for i in range(n + 1)]\nsmer = 1\nfor sada in range(n):\n for i in range(n):\n i += 1\n cukrikov = sada * n + i\n bratia[smer*i].append(cukrikov)\n smer *= -1\n\nfor brat in bratia[1:]:\n print(' '.join(map(str, brat)))\n", "x = int(input())\r\nfor i in range(x**2 // 2):\r\n print(i+1, x**2 - i)", "n=int(input())\r\nm=n//2\r\nc=0\r\nif n==1:\r\n print(1,1)\r\nfor i in range(n):\r\n for j in range(m):\r\n print(c+1,n*n-c,end=\" \")\r\n c=c+1\r\n print()", "brothers = int(input());\r\n\r\nvals = [];\r\n\r\nfor i in range(0, brothers):\r\n vals.append(\"\");\r\n\r\nsetLength = brothers*2;\r\nsetCount = int(brothers/2);\r\n\r\n\r\nfor i in range(0, brothers):\r\n for j in range(0, setCount):\r\n print(i + setLength * j + 1, (j+1) * setLength-(i), \"\", end='');\r\n print();\r\n ", "number = int(input())\r\nnumber_squared = number * number\r\ninitial = [1]\r\nfor i in range(1, int(number/2)+1):\r\n initial.append(number*2*i)\r\n if i != number/2:\r\n initial.append(number*2*i + 1)\r\n\r\nflag = 'even'\r\nfor i in range(number):\r\n for number in initial:\r\n if flag == 'even':\r\n print(number + i, end=' ')\r\n flag = 'odd'\r\n elif flag == 'odd':\r\n print(number - i, end=' ')\r\n flag = 'even'\r\n\r\n print('')", "\r\nn = int(input())\r\nc = [i+1 for i in range(n*n)]\r\nfor j in range(n):\r\n d = []\r\n dd = []\r\n for i in range(0+j, len(c) // 2 + j, n):\r\n d.append(i)\r\n dd.append(-(i+1))\r\n for k in d:\r\n print(c[k], end=' ')\r\n dd = dd[::-1]\r\n for k in dd:\r\n print(c[k], end=' ')\r\n print()\r\n", "n = int(input()) \nvec = [x + 1 for x in range(n * n)]\nm = n // 2;\nfor i in range(n):\n for j in range(m):\n print(vec[i * m + j], end = \" \")\n print(vec[-(i * m + j + 1)], end = \" \");\n print();\n", "n=int(input())\r\ni=1\r\nf=n**2\r\n\r\n\r\nm=1\r\nM=n**2\r\nfor k in range(n):\r\n i=1\r\n mensaje=\"\"\r\n while i <=n/2:\r\n mensaje=mensaje+str(m)+\" \"+str(M)+\" \"\r\n m+=1\r\n M=M-1\r\n i+=1\r\n \r\n print (mensaje)", "n = int(input())\r\naux = []\r\nfor i in range(n):\r\n aux.append(n * [0])\r\na = 1\r\nfor i in range(n//2):\r\n for j in range(n):\r\n aux[j][i] = a\r\n a += 1\r\nfor i in range(n//2 , n):\r\n for j in range(n-1, -1, -1):\r\n aux[j][i] = a\r\n a += 1\r\nfor i in range(n):\r\n print(\" \".join(map(str, aux[i])))", "# coding=utf-8\r\n\r\n\r\nif __name__ == '__main__':\r\n\tn = int(input())\r\n\tmiss = 0\r\n\tfor i in range(n):\r\n\t\tline = list()\r\n\t\tfor j in range(n):\r\n\t\t\tline.append(str(j * n + (j + miss) % n + 1))\r\n\t\tmiss += 1\r\n\t\tprint(' '.join(line))\r\n", "n=int(input())\r\nx=n**2\r\nfor j in range(n):\r\n for i in range(j+1,(x//2)+1,n):\r\n print(i,end=' ')\r\n for i in range((x//2)+(n-j),x+1,n):\r\n print(i,end=' ')\r\n print()\r\n", "n=int(input())\r\ntotal = n**2\r\nno = 1\r\nfor i in range(1,n+1):\r\n for j in range(n//2):\r\n print(no,total-no+1,end=\" \")\r\n no+=1\r\n print()", "n = int(input())\r\nfor x in range(1, n + 1):\r\n candies = []\r\n for y in range(n // 2):\r\n a = n * y + x\r\n candies.append(str(a))\r\n candies.append(str(n ** 2 + 1 - a))\r\n print(\" \".join(candies))", "import math as mt\r\nfrom collections import defaultdict,deque\r\nimport sys\r\nfrom bisect import bisect_right as b_r\r\nfrom bisect import bisect_left as b_l\r\nfrom os import path\r\nfrom heapq import *\r\n\r\n\r\n\r\nmod=1000000007\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\n\r\n\r\n\r\nif(path.exists('input.txt')):\r\n sys.stdin = open('input.txt','r')\r\n sys.stdout = open('output.txt','w')\r\n\r\n\r\n\r\ndef solve():\r\n n=int(input())\r\n for i in range(1,(n**2)//2+1,n//2):\r\n for j in range(n//2):\r\n print(i+j,end=\" \")\r\n for j in range(n//2):\r\n print(n**2-i+1-j,end=\" \")\r\n print()\r\n \r\n\r\n\r\n# for _ in range(int(input())):\r\nif __name__ == \"__main__\":\r\n solve()", "n=int(input())\r\nn2=n*n\r\ninc=int(n/2)\r\nfor i in range (0,n*inc,inc):\r\n\tfor j in range (1,int((n2/n)/2)+1):\r\n\t\tprint(i+j,end=\" \")\r\n\t\tprint(n2-j-i+1,end=\" \")\r\n\tprint()", "n = int(input())\r\nn= n*n\r\nfor i in range(1, int(n / 2) + 1):\r\n k = n + 1 - i\r\n print(i, k, sep = \" \")", "n=int(input())\r\nz=n\r\nn=n**2\r\nfor i in range (0,n//2,z//2):\r\n for j in range(z//2):\r\n print(i+1+j,n-i-j,end=' ')\r\n print()", "#In the name of Allah\r\n\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\n\r\nres = [[0] * n for _ in range(n)]\r\n\r\nfor i in range(n * n):\r\n if (i // n) % 2 == 0:\r\n res[i % n][i // n] = str(i + 1)\r\n else:\r\n res[n - i % n - 1][i // n] = str(i + 1)\r\n\r\nfor i in res:\r\n stdout.write(\" \".join(i) + \"\\n\")\r\n", "import sys\n\nn_bags = int(sys.stdin.readline())\ncandies = []\ntotal = 0\n \nfor i, value in enumerate(range(n_bags ** 2)):\n total += value + 1\n candies.append(value + 1)\n \nvalues = []\nstart, end = 0, len(candies)-1\nwhile start <= end:\n values.append([])\n values[len(values)-1].append(candies[start])\n values[len(values)-1].append(candies[end])\n start += 1\n end -= 1\n\ntarget = total // n_bags\nn_bags_each = target // (values[0][0] + values[0][1])\n\nfor i in range(0, len(values), n_bags_each):\n for j in range(n_bags_each):\n sys.stdout.write(str(values[i+j][0]) + \" \")\n sys.stdout.write(str(values[i+j][1]) + \" \")\n print(\"\")\n", "n = int(input())\r\nn2 = n * n\r\nans = list()\r\nfor i in range(1, n2 // 2 + 1):\r\n ans.append(str(i))\r\n ans.append(' ')\r\n ans.append(str(n2 - i + 1))\r\n ans.append(' ' if (i // 2) % n else '\\n')\r\nprint(''.join(ans))", "n = int(input())\r\nn2 = n * n + 1\r\nndiv2 = n // 2\r\n\r\nfor i in range(1, n + 1):\r\n first = list(range(ndiv2 * (i - 1) + 1, ndiv2 * i + 1))\r\n last = [n2 - k for k in first]\r\n candies = first + last\r\n print(' '.join(map(str, candies)))", "\n\ndef main():\n n = int(input())\n for k in range(1,n+1):\n stp = []\n for i in range(n):\n if i%2 == 0:\n stp.append(i*n+k)\n else:\n stp.append((i+1)*n-(k-1))\n print(\" \".join(str(x) for x in stp))\n\nmain()", "x = int(input())\r\nn = x*x\r\na = [i for i in range(1,n+1)]\r\nz = {i:[] for i in range(x)}\r\nfor i in range(x):\r\n for j in range(x//2):\r\n z[i].extend([a.pop(),a.pop(0)])\r\nfor i in z:\r\n print(*z[i])\r\n\r\n ", "n = int(input())\nfor i in range(n):\n for j in range(n):\n print(1+j*n+(i+j)%n, end=' ')\n print()\n\n", "n = int(input())\r\nfor (i, j) in zip(range(1, (n * n // 2) + 1), range(n * n, n * n // 2, -1)):\r\n print(i, \" \", j)\r\n", "import sys\r\n\r\nx = int(input())\r\nx2 = int(x**2)\r\n\r\ngroups = []\r\n\r\nfor i in range(int(x2/2)):\r\n groups.append([i+1, x2-i])\r\n\r\ni = 0\r\nfor g in groups:\r\n sys.stdout.write(str(g[0]) + ' ' + str(g[1]) + ' ')\r\n i = i + 2\r\n if i == x:\r\n sys.stdout.write('\\n')\r\n i = 0\r\n ", "def main():\r\n\tn = int(input())\r\n\tfor i in range(1,n+1):\r\n\t\tans = [n * x + i if x % 2 == 0 else n * (x + 1) - i + 1 for x in range(n)]\r\n\t\tprint(' '.join(map(str, ans)))\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "w=int(input())\r\nfor i in range(w*w//2): print(i+1,w*w-i)", "n = int(input())\r\n\r\n\r\nbags = [i for i in range(1,(n*n)+1)]\r\n# print(bags)\r\n\r\ntotalCandy = ((1+n*n)*(n*n))/2\r\nsplitCandy = totalCandy/n\r\n\r\nbagList = [[] for i in range(n)]\r\n# print(bagList)\r\nbagNum = 0\r\n\r\nfor i in range(int((n*n)/2)):\r\n bagList[bagNum].append(bags[i])\r\n bagList[bagNum].append(bags[(n*n)-i-1])\r\n # print(bagList[bagNum])\r\n if sum(bagList[bagNum]) == splitCandy:\r\n print(*bagList[bagNum])\r\n bagNum += 1\r\n", "\r\n\r\nn = int(input())\r\nfor i in range(1, n ** 2 // 2 + 1):\r\n print (i, n ** 2 - (i - 1))", "n = int(input())\r\n\r\nfor i in range(n):\r\n j = 1\r\n ans = []\r\n for k in range(n):\r\n ans.append(j + (i + k) % n)\r\n j += n\r\n print(' '.join(map(str, ans)))\r\n", "n=int(input())\r\nfor i in range(n*n//2):print(i+1,n**2-i,end=\" \")\r\n", "n = int(input())\r\nfor i in range(n):\r\n print (' '.join(str(1 + (i+j)%n + j*n) for j in range(n)))", "n = int(input())\r\nbot, mid, top = 1, n // 2, n * n\r\nfor _ in range(n):\r\n for __ in range(mid): \r\n print(bot, end=\" \")\r\n bot += 1\r\n for __ in range(mid): \r\n print(top, end=\" \")\r\n top -= 1\r\n print()", "x=int(input())\r\nfor i in range(0, x**2//2, x//2):\r\n arr=[]\r\n for j in range(i,i+x//2,1):\r\n arr.append(j+1)\r\n arr.append(x**2-j)\r\n print(\" \".join(map(str,arr)))", "n = int(input())\nfor i in range(n):\n\ta = []\n\tfor j in range(n):\n\t\tif j < n / 2:\n\t\t\ta.append(n * j + i + 1)\n\t\telse:\n\t\t\ta.append(n * (j + 1) - i)\n\tprint(\" \".join([str(x) for x in a]))\n", "n = int(input())\r\narr = [i for i in range(0,n**2+2)]\r\n\r\ni=1\r\nwhile i <= (n**2)//2:\r\n j = 0\r\n while j < n//2:\r\n print(arr[i], arr[-i-1],end=' ')\r\n i += 1\r\n j += 1\r\n print()\r\n", "a = int(input())\r\nx,y = 1,a ** 2\r\nwhile x < y:\r\n for i in range(a - 1):\r\n print(x, y, end=\" \")\r\n x += 1\r\n y -= 1\r\n print(x, y)\r\n x += 1\r\n y -= 1", "n = int(input())\r\n\r\nnums = []\r\n\r\nfor x in range(1, n ** 2 + 1):\r\n nums.append(x)\r\n\r\nval = 1\r\n\r\nfor x in range(n):\r\n output = \"\"\r\n for i in range(n // 2):\r\n output += str(val)+ \" \"\r\n output += str(n ** 2 - val + 1)+\" \"\r\n val += 1\r\n print(output.strip())\r\n", "sa=int(input())\r\na=[]\r\nb=[]\r\nfor x in range(1, sa**2+1):\r\n if x<=(sa**2/2):\r\n a.append(x)\r\n else:\r\n b.append(x)\r\nb.reverse()\r\nmaximum=sa\r\ncount=0\r\nstring=''\r\nwhile len(a)!=0:\r\n string=''\r\n for x in range(int(maximum/2)):\r\n string+=str(a[0])\r\n a.remove(a[0])\r\n string+=' '\r\n string+=str(b[0])\r\n b.remove(b[0])\r\n string+=' '\r\n print(string)\r\n \r\n", "n=int(input()) \n #COMPLEXITY O(N)\nj=n*n\nc=n//2\nfor i in range(1,(n*n)//2+1):\n\tprint(i,end=\" \")\n\tprint(j,end=\" \")\n\tj-=1\n\tc-=1\n\tif c==0:\n\t\tprint()\n\t\tc=n//2\n\n", "n = int(input())\r\nnums = list(range(1, n*n+1))\r\nfor i in range(1, n+1):\r\n new = nums[:n//2]\r\n new.extend(nums[-n//2:])\r\n print(' '.join(map(str, new)))\r\n for j in new:\r\n nums.remove(j)", "n = int(input())\r\nx = [[0 for j in range(n)] for i in range(n)]\r\nt = 1\r\nfor i in range(n):\r\n for j in range(n):\r\n x[i][j] = t\r\n t += 1\r\nfor i in range(n):\r\n o = 0\r\n for j in range(n):\r\n print(x[j][(i + o) % n], end = \" \")\r\n o += 1\r\n ", "n = int(input())\r\ni=1\r\nwhile(True):\r\n if(i > n**2-i+1):\r\n break\r\n print(i, n**2-i+1)\r\n i+=1\r\n", "n = int(input())\nfor i in range(1, n+1):\n for j in range(i, (n*n) // 2 + 1, n):\n print(j, end=' ')\n for j in range(n*n-i+1, (n*n) // 2 , -n):\n print(j, end=' ')\n print()\n", "n = int(input())\r\nb = n**2\r\nl = [int(x) for x in range(1,b+1)]\r\n\r\nar = []\r\n\r\ni = 0\r\nj = -1\r\nwhile i < b//2:\r\n ar.append(l[i])\r\n ar.append(l[j])\r\n i += 1\r\n j -= 1\r\n\r\n\r\nans = []\r\ni = 0\r\nj = n\r\nwhile i <= b-n:\r\n ans.append(ar[i:j])\r\n i = j\r\n j += n\r\n\r\n# [[1, 16, 2, 15], [3, 14, 4, 13], [5, 12, 6, 11], [7, 10, 8, 9]] print(ans)\r\n\r\ni = 0\r\nwhile i < n:\r\n j = 0\r\n while j < n:\r\n print(ans[i][j], end = ' ')\r\n if j == 3:\r\n print()\r\n j += 1\r\n \r\n i += 1\r\n", "'''input\n4\n'''\nn = int(input())\nl = [str(x) + \" \" + str(n**2-x+1) for x in range(1,n**2//2+1)]\nfor i in range(0, n**2//2, n//2):\n\tprint(\" \".join(l[i:i+n//2]))\n\n\n\n", "n = int(input())\r\nmatrix = [list(range(i, i+n)) for i in range(1, n*n, n)]\r\nresult = []\r\nfor i, item in enumerate(matrix[0]):\r\n inner = []\r\n for j in range(n):\r\n inner.append(matrix[j][((i+j)%n)])\r\n\r\n result.append(inner)\r\n\r\nfor row in result:\r\n for item in row:\r\n print(item, end=\" \")\r\n print() \r\n", "def main():\r\n n = int(input())\r\n\r\n total = 0\r\n for i in range(1, n ** 2 + 1):\r\n total += i\r\n\r\n bags = [i for i in range(1, n ** 2 + 1)]\r\n\r\n start = 0\r\n end = n ** 2 - 1\r\n\r\n while start < end:\r\n print(bags[start], bags[end])\r\n start += 1\r\n end -= 1\r\n\r\n\r\n\r\nmain()", "import math\r\nfrom decimal import *\r\ngetcontext().prec = 30\r\nn=int(input())\r\ncurr=1\r\nfor i in range(n):\r\n l=list()\r\n while len(l)<n:\r\n l.append(curr)\r\n l.append(n*n+1-curr)\r\n curr+=1\r\n print(*l)", "whichBro = int(input())\r\ncandyPerBro = int((whichBro ** 3 + whichBro) / 2)\r\n\r\nfor i in range(1, whichBro + 1):\r\n sum = 0\r\n j = i\r\n while sum < candyPerBro:\r\n print(str(j) + \" \" + str(whichBro * whichBro + 1 - j) + \" \", end =\"\")\r\n sum += j\r\n sum += whichBro * whichBro - j + 1\r\n j += whichBro\r\n print()", "n=int(input())\r\na=(n*n)+1\r\nl=[]\r\nfor i in range(1,(a//2)+1):\r\n l.append(i)\r\n l.append(a-i)\r\n \r\nprint(*l) \r\n ", "n=int(input())\r\ndef restar2(L):\r\n for k in range(len(L)):\r\n L[k]=str(int(L[k])-len(L))\r\ndef sumar2(L):\r\n for k in range(len(L)):\r\n L[k]=str(int(L[k])+len(L))\r\ndef string(L):\r\n for k in range(len(L)):\r\n L[k]=str(L[k])\r\n return L\r\nL=[k for k in range(1,n//2+1)]\r\nL1=[n**2-k for k in range(n//2)]\r\nfor j in range(n):\r\n s=string(L1)\r\n r=string(L)\r\n print(\" \".join(r+s))\r\n sumar2(L)\r\n restar2(L1)\r\n\r\n", "n=int(input())\r\nm=n//2\r\nfor i in range(n):\r\n\tfor x in range(1+m*i,1+m*(i+1)):\r\n\t\tprint(x,end=\" \")\r\n\tfor x in range(1+n*n-(m*(i+1)),1+n*n-m*i):\r\n\t\tprint(x,end=\" \")\r\n\tprint()", "n=int(input())\r\nfor i in range(n):\r\n print(*list(range(i*(n//2)+1,i*(n//2)+1+n//2))+list(range(n**2-i*(n//2)-n//2+1,n**2-i*(n//2)+1)))", "n = int(input())\r\ni = 1\r\nj = n ** 2\r\nwhile i < j:\r\n\tans = []\r\n\tfor k in range(n // 2):\r\n\t\tans.append(i)\r\n\t\ti += 1\r\n\t\tans.append(j)\r\n\t\tj -= 1\r\n\tprint(*ans)", "n = int(input())\r\nfor i in range(n**2 //2):\r\n print(i+1, n**2 - i) ", "x=int(input())\r\ny=x**2\r\np=1\r\nfor i in range(x):\r\n for j in range(0,x//2):\r\n print(p,y,end=\" \")\r\n p+=1\r\n y-=1\r\n print(\"\")\r\n", "n = int(input())\r\n\r\na_n = [[0 for j in range(n)] for i in range(n)]\r\n\r\nt = 1\r\nfor i in range(n):\r\n for j in range(n):\r\n a_n[i][j] = t\r\n t += 1\r\n\r\nfor i in range(n):\r\n o = 0\r\n for j in range(n):\r\n print(a_n[j][(i + o) % n], end = \" \")\r\n o += 1\r\n print()", "from email.errors import NonPrintableDefect\r\nimport math\r\n# for i in range(int(input())):\r\nn=int(input())\r\n # n,k=map(int,input().split())\r\n# s=input()\r\n # arr=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(1,n**2+1):\r\n arr.append(i)\r\n# print(arr)\r\nl=0\r\nr=n**2-1\r\n# cnt=0\r\nnas=[]\r\nwhile(l<r):\r\n # print(arr[l],arr[r])\r\n nas.append(arr[l])\r\n nas.append(arr[r])\r\n r-=1\r\n l+=1\r\n# print(nas)\r\ni=0\r\n# print(*arr[i:i+n])\r\nwhile(i<len(nas)):\r\n print(*nas[i:i+n])\r\n i+=n;", "n=int(input())\r\nm=n*n\r\ni=1\r\nj=m\r\nfor k in range(1,n+1):\r\n for p in range(1,n+1):\r\n if p%2==0:\r\n print(j,end=\" \")\r\n j-=1\r\n else:\r\n print(i,end=\" \")\r\n i+=1\r\n print() ", "n = int(input())\n\na = int((n*n)/2)\ni,j = 1, n*n\nwhile i<=a and j>=a:\n print(i,j)\n i,j = i+1, j-1", "n = int(input())\r\ncandy = []\r\nfor i in range((n**2)//2):\r\n candy.append(i+1)\r\n candy.append(n**2-i)\r\nfor i in range(n):\r\n print(*candy[i*n:i*n+n])", "n = int(input())\narr = [i for i in range(1, n**2 + 1)]\n\ntemp = []\nstart, end = 0, len(arr) - 1\nwhile start < end:\n \n temp.append(arr[start])\n temp.append(arr[end])\n\n if sum(temp) == sum(arr) / n:\n print(' '.join(str(i) for i in temp))\n temp = []\n\n start += 1\n end -= 1\n\n\n\n\n \n \n\n\n\n\n \n\n", "\r\na=int(input())\r\nl=[x for x in range(1,a**2+1)]\r\n# print(sum(l)//a)\r\n# print(l)\r\ni,j=0,-1\r\nfor _ in range(a):\r\n for k in range(a//2):\r\n print(*[l[i],l[j]],end=' ')\r\n i+=1\r\n j-=1\r\n print()", "n=int(input())\r\na=[]\r\nk=1\r\nr=n*n\r\nfor i in range(n):\r\n l=[]\r\n cnt=1\r\n while(cnt<=n//2):\r\n l.append(k)\r\n l.append(r)\r\n k=k+1\r\n r=r-1\r\n cnt=cnt+1\r\n a.append(l) \r\nfor i in a:\r\n print(*i)\r\n \r\n \r\n ", "n = int(input())\r\nl = 1\r\nr = n**2\r\nk = 0\r\nwhile k<n:\r\n for i in range(n//2):\r\n print(l,r, end=\" \")\r\n l+=1\r\n r-=1\r\n print()\r\n k+=1", "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 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(N):\r\n idx = 0\r\n ans = [[], []]\r\n\r\n for i in range(1, ceil(N*N/2)+1):\r\n ans[idx].extend([i, N*N-i+1])\r\n idx += 1\r\n idx %= 2\r\n\r\n return \"\\n\".join(\" \".join(map(str, v)) for v in ans)\r\n\r\n\r\nN = read_int()\r\n\r\nprint(solve(N))\r\n", "n=int(input())\r\np=n**2\r\nfor i in range(p//2):\r\n print(i+1,p-i)", "x = int(input())\r\nfor i in range(x):\r\n\tt = i+1\r\n\tprint(i+1,end=\" \")\r\n\tfor j in range(x-1):\r\n\t\tif j%2 == 0:\r\n\t\t\tt = t + 2*x - (2*i+1)\r\n\t\t\tprint(t,end=\" \")\r\n\t\telse:\r\n\t\t\tt = t + 2*i+1\r\n\t\t\tprint(t,end=\" \")\r\n\tprint()", "#!/usr/bin/env python3\n\ndef main():\n n = int(input())\n n_2 = n // 2\n nn = n*n\n print(\"\\n\".join(\" \".join(\" \".join(map(str,[i+j, nn - (i-1) - j])) for j in range(n_2)) for i in range(1, nn//2 + 1, n_2)))\n\nif __name__ == \"__main__\":\n main()\n\n", "n = int(input())\r\n\r\ni,j,k = 1,n*n,0\r\n\r\nwhile k < n:\r\n\r\n for _ in range(n//2):\r\n \r\n print(i,end = \" \")\r\n \r\n i += 1\r\n \r\n for _ in range(n//2):\r\n \r\n print(j,end = \" \")\r\n \r\n j -= 1\r\n \r\n print()\r\n \r\n k += 1", "n = int(input())\r\nfor i in range(1,n**2 // 2 + 1) :\r\n print(i, n**2 - i + 1)\r\n", "n=int(input())\r\n# l=[]\r\nk=n*n\r\nflag=1\r\n# for i in range(1,n+1):\r\n# l=[]\r\n# for j in range(flag,k):\r\nx=k//2\r\nl1=[]\r\nl2=[]\r\nfor i in range(1,x+1):\r\n l1.append(i)\r\nfor i in range(k,x+2,-1):\r\n l2.append(i)\r\nl=[]\r\nfor i in range(1,x+1):\r\n l.append(i)\r\n l.append(k-i+1)\r\n if len(l)==n:\r\n l.sort()\r\n print(*l)\r\n l=[]\r\n \r\n ", "n = int(input())\r\ncandies = list(range(1,(n)**2+1))\r\nj = len(candies)-1\r\nk = 0\r\nfor i in range(0,n):\r\n out = [0]*n\r\n for x in range(n//2):\r\n out[x] = candies[k]\r\n k+=1\r\n for x in range(n-1,n//2-1,-1):\r\n out[x] = candies[j]\r\n j-=1\r\n print(*out)", "n=int(input())\r\nfor j in range(n):\r\n for i in range(n):\r\n if i * n + i + j + 1 > (i + 1) * n:\r\n print(i*n+i+j+1-n,\" \", end=\"\")\r\n else :\r\n print(i*n+i+j+1,\" \", end=\"\")\r\n print()", "import sys\nimport bisect\nimport heapq\nimport math\nfrom functools import lru_cache\nfrom collections import defaultdict,Counter\n\n\n#sys.setrecursionlimit(10**6)\ninput = sys.stdin.readline\nI = lambda: int(input())\nS = lambda: input()\nL = lambda: list(map(int, input().split()))\n###################################################\n\n\n\n\ndef solution(n):\n for i in range(n**2//2):\n print(f\"{i+1} {n**2-i}\")\n return\n\n\nif __name__=='__main__':\n n = I()\n solution(n)", "n=int(input())\r\na=[[] for i in range(n)]\r\n#print(a)\r\nk=[i for i in range(1,(n**2)+1)]\r\nl=n**2-1\r\nfor i in range(0,n**2//2):\r\n a[i%n].append(k[i])\r\n a[i%n].append(k[l-i])\r\nfor i in a:\r\n for j in i[:-1]:\r\n print(j,end=\" \")\r\n print(i[-1])", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\nn=int(input())\r\nfor i in range((n*n)//2): \r\n\tif ((i+1)*2)%n!=0:\r\n\t\tprint(i+1,n*n-i,end=\" \")\r\n\telse:\r\n\t\tprint(i+1,n*n-i)\r\n", "n = int(input())\r\np = 0\r\nfor i in range(n):\r\n for j in range(int(n/2)):\r\n p += 1\r\n print(p,n*n-p+1,end=\" \")\r\n print()\r\n", "t=int(input())\r\na=[]\r\nfor i in range(1,t*t+1):\r\n a.append(i)\r\nc=0\r\nb=[]\r\nfor j in range(len(a)//2):\r\n b.append(int(a[j]))\r\n b.append(int(a[len(a)-1-j]))\r\n c=c+1\r\n if c==t/2:\r\n print(*b)\r\n c=0\r\n b=[]\r\n", "n = int(input())\r\nfor i in range(n):\r\n for j in range(n):\r\n if j < n/2:\r\n ind = (i+1) + j*n\r\n else:\r\n ind = (n-i) + j*n\r\n print(ind, end=' ') \r\n print() ", "#arr = list(map(int, input().split()))\r\nn=int(input())\r\nfor i in range((n**2)//2):\r\n print(i+1, n**2-i)", "x = int(input())\r\ny = x**2\r\nz = y//2\r\nc = [int(i) for i in range(1, y+1)]\r\nfor i in range(1, x+1):\r\n a = []\r\n b = []\r\n for i in range(i, z+1, x):\r\n a.append(i)\r\n b.append(i)\r\n for i in a:\r\n b.append(y-c.index(i))\r\n for i in b:\r\n print(i, end=' ')\r\n\r\n print()\r\n", "n = int(input())\r\nd = n**2\r\nfor i in range(1,d):\r\n print(i,d)\r\n d=d-1\r\n if i==d:\r\n break\r\n", "import sys\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(10**6)\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef in_int():\r\n return (int(input()))\r\n\r\n\r\ndef in_list():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef in_str():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef in_ints():\r\n return (map(int, input().split()))\r\n\r\nmod = 7 + 10**9\r\n\r\nn = in_int()\r\n\r\n\r\nl = 1\r\nh = n**2\r\n\r\nwhile l<h:\r\n for xx in range(n//2):\r\n print(l , h, end = ' ')\r\n l+=1\r\n h-=1\r\n\r\n print()\r\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\tn=read_int()\n\ta=[]\n\tfor i in range(n):\n\t\tl=list(range(i*n+1, (i+1)*n+1))\n\t\tif i%2==1:\n\t\t\tl=l[::-1]\n\t\ta.append(l)\n\tfor i in range(n):\n\t\tprint(\" \".join(str(a[j][i]) for j in range(n)))\n\nsolve()\n", "n=int(input())\r\nfor i in range(n):\r\n print(i+1,end=\" \")\r\n for j in range(1,n):\r\n print(j*n + (i+j)%n +1,end=\" \")\r\n print()", "n = int(input())\n#A = []\nB = []\na = 1\nfor i in range(0,n):\n A = []\n for j in range(0,n):\n A.append(a)\n a = a+1\n B.append(A)\nC = []\n\nfor k in range(0,n):\n D = []\n b = 0\n c = k\n for l in range(0,n):\n D.append(B[b][c])\n #print(D)\n b = b + 1\n c = c + 1\n if c>=n:\n c = 0\n C.append(D)\n\nfor x in range(0,n):\n s = ''\n for y in range(0,n):\n s = s + str(C[x][y])+' '\n print(s)\n \n \n \n \n", "n = int(input())\r\nfor i in range(1,(n**2)//2+1,2):\r\n print(i, n**2+1-i, i+1,n**2+1-i-1)", "n = int(input())\r\np = n*(n**2 +1)//2\r\narr = [k for k in range(1,n**2 +1)]\r\nm = n//2\r\nfor i in range(n):\r\n print(*arr[m * i:m * (i + 1)],*arr[n**2-m*(i+1):n**2-m*i],sep=\" \")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na,b = 1,n*n\r\n\r\nfor i in range(n):\r\n for j in range(int(n/2)):\r\n print(a,b,sep=\" \",end=\" \")\r\n a,b=a+1,b-1\r\n print()\r\n", "n = int(input())\r\nsq = n**2\r\nlist = []\r\nfor i in range(n):\r\n list.append([])\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n list[i].append(n*i+j+1)\r\n \r\nfor i in range(n):\r\n if(i%2!=0):\r\n list[i].reverse() \r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n print(list[j][i], end=\" \")\r\n print()", "n=int(input())\r\nfor i in range(1,(n*n)//2+1):\r\n print(i,(n*n-i+1))", "n=int(input())\r\nn=n*n\r\nh=(n*(n+1))/2\r\nx=0\r\nl=[]\r\nm=[]\r\nfor i in range(1,n,2):\r\n x+=i+(n-i+1)\r\n l.append(str(i))\r\n l.append(str(n-i+1))\r\n m.append(str(i+1))\r\n m.append(str(n-i))\r\n if x==h/2:\r\n break\r\n\r\nprint(\" \".join(l))\r\nprint(\" \".join(m))", "n=int(input())\r\nfor i in range(0, (n*n)//2,n//2):\r\n l=[]\r\n for j in range(i,i+(n//2)):\r\n l+=[j+1,(n*n)-j]\r\n print(*l)", "n = int(input())\nans = [ ]\ns = 0\nfor i in range(1, ((n * n) // 2) + 1):\n ans += [i, (n * n) - i + 1]\n s += 1\n if s == (n // 2):\n print(*ans)\n s = 0\n ans = [ ]\n\t\t\t \t\t\t\t \t\t\t\t \t\t\t\t\t \t \t \t", "n = int(input())\r\nfor i in range(n):\r\n off = i+1\r\n for j in range(n):\r\n print(n*j+off, end=' ')\r\n off += 1\r\n if off == n+1:\r\n off = 1\r\n print()", "n = int(input())\r\nfor i in range(n):\r\n now = (n // 2)* i \r\n for j in range(n // 2):\r\n print(now + j + 1, end = \" \")\r\n now = n ** 2 - (n // 2)* i \r\n for j in range(n // 2):\r\n print(now - j, end =\" \")\r\n print(\"\")", "n = int(input()) \n\nl = range(1, n**2+1)\n\nc = 0\nfor i in range(n):\n z = [] \n for i in range(n//2):\n print(l[c], l[-(c+1)], end=' ')\n c += 1\n print(\"\")\n\n", "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 = int(input())\r\n\t\r\n\ts = (n * (n ** 2 + 1) // 2)\r\n\r\n\tarr = [i for i in range(1, n ** 2 + 1)]\r\n\tpairs = []\r\n\ti = 0\r\n\tj = len(arr) - 1\r\n\twhile i < j:\r\n\t\tpairs.append([arr[i], arr[j]])\r\n\t\ti += 1\r\n\t\tj -= 1\r\n\r\n\ti = 0\r\n\ts = n // 2\r\n\twhile i < len(pairs):\r\n\t\tfor p in (pairs[i: i + s]):\r\n\t\t\tprint(*p, end=' ')\r\n\t\tprint()\r\n\t\ti += s\r\n\r\n\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", "n = int (input ())\nfor i in range (n):\n for j in range (1,n//2+1):\n print (i*n//2 + j, end=' ')\n for j in range (n//2):\n print (n**2 - i*n//2 - j, end=' ')\n print ()\n", "n = int(input())\n\narr = []\n\nj = 1\n\nfor i in range(n):\n arr.append([])\n for _ in range(n):\n arr[i].append(j)\n j += 1\n\nk = 0\ns_set = []\nfor i in range(n):\n s = \"\"\n for j in range(n):\n s += str(arr[j][(j+k)%n]) + \" \"\n\n k += 1\n s_set.append(s)\n\nfor s in s_set:\n print(s)\n", "n=int(input())\r\nm=int((n*n)/2)\r\nfor i in range(1,m+1):\r\n print(i,(n**2)+1-i)", "n = int(input())\n\ntotal = n**2+1\ncursor = 1\n\nfor i in range(n):\n for j in range(n//2):\n print('{} {}'.format(cursor, total-cursor), end=' ')\n cursor += 1\n print()\n\n", "i = int(input())\r\nfor x in range(1, int(i*i/2)+1):\r\n print(x, (i*i)-x+1)", "n=int(input())\r\nl=['']*n\r\nj=0\r\nfor i in range(1,n*n//2+1):\r\n l[j]+=str(i)+' '\r\n j=(j+1)%n\r\nfor i in range(n*n//2+1,n*n+1):\r\n l[n-j-1]+=str(i)+' '\r\n j=(j+1)%n\r\n\r\nfor i in range(n):\r\n print(l[i])\r\n\r\n \r\n \r\n ", "def candy(n):\r\n h=[i for i in range(1,n**2+1)]\r\n j=[i for i in range(n**2,0,-1)]\r\n c=[]\r\n d=[]\r\n lim=sum(h)//n\r\n for i in range(n**2):\r\n d.append(h[i])\r\n d.append(j[i])\r\n if sum(d)==lim:\r\n c.append(\" \".join([str(i) for i in d]))\r\n d=[]\r\n if len(c)==n:\r\n break\r\n return \"\\n\".join(c)\r\nn=int(input())\r\nprint(candy(n))\r\n", "n=int(input())\r\ntotal=(n**2*(n**2 + 1))//2\r\ntarget=total//n\r\narr=[i for i in range(1,n**2+1)]\r\nk=0\r\nl=n**2-1\r\nfor i in range(n):\r\n for j in range(k,k+n//2):\r\n print(arr[j],end=\" \")\r\n k=k+n//2\r\n for j in range(l,l-n//2,-1):\r\n print(arr[j],end=\" \")\r\n l=l-n//2\r\n print()\r\n", "brothers = int(input())\r\nbags = brothers**2\r\n\r\nbros = []\r\nfor n in range(brothers):\r\n bros.append([])\r\n\r\nnum = 0\r\nfor n in range(1, int(bags/2+1)):\r\n bros[num].append(str(n))\r\n num += 1\r\n if num == brothers:\r\n num = 0\r\n\r\nnum = brothers-1\r\nfor n in range(int(bags/2+1), bags+1):\r\n bros[num].append(str(n))\r\n num -= 1\r\n if num == -1:\r\n num = brothers-1\r\n\r\nfor n in bros:\r\n print(\" \".join(n))", "n = int(input())\r\nn2,count=n**2+1,1\r\n\r\nfor i in range(n):\r\n for j in range(n//2):\r\n print(count,n2-count,end=' ')\r\n count+=1\r\n print(end='\\n')\r\n", "n=int(input())\r\nl=[[] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n l[i].append(i*n+j+1)\r\nfor i in range(1,n,2):\r\n l[i].reverse()\r\nfor i in range(n):\r\n for j in range(n):\r\n print(l[j][i],end=\" \")\r\n print()", "n = int(input())\n\nc = [[] for _ in range(n)]\n\nfor i in range(0, n**2//2):\n c[i % n].append(i + 1)\n c[i % n].append(n**2 - i)\n\nfor e in c:\n e.sort()\n print(*e)\n\n", "n = int(input())\r\n\r\na = []\r\n\r\nfor el in range(1 , n** 2 + 1):\r\n a.append(el)\r\n\r\n\r\npart1 = a[0 : len(a) // 2]\r\npart2 = a[len(a) // 2 : len(a)]\r\n\r\npart2 = part2[::-1]\r\n\r\n\r\nr1 = []\r\nr2 = []\r\n\r\n\r\nfor i in range(len(part1)):\r\n if(i % 2 == 0):\r\n r1.append(part1[i])\r\n r1.append(part2[i])\r\n else:\r\n r2.append(part1[i])\r\n r2.append(part2[i])\r\n\r\n\r\nprint(*r1)\r\nprint(*r2)", "n = int(input().strip())\r\nl = [''] * n\r\n\r\nj = 0\r\nk = 0\r\n\r\nfor i in range(1, (n ** 2) // 2 + 1):\r\n j += 1\r\n l[k] = l[k] + str(i) + ' '\r\n if j == n // 2:\r\n j = 0\r\n k += 1\r\n\r\n\r\nj = 0\r\nk = 0\r\n\r\nfor i in range(n ** 2,(n ** 2) // 2, -1):\r\n j += 1\r\n l[k] = l[k] + str(i) + ' '\r\n if j == n // 2:\r\n j = 0\r\n k += 1\r\nfor i in range(n):\r\n print(l[i])\r\n", "n = int(input())\r\nfor i in range(n):\r\n flag = True\r\n now = i + 1\r\n while now <= n * n:\r\n print(now, end=' ')\r\n if flag:\r\n now += (n - (i + 1)) * 2 + 1\r\n else:\r\n now += i * 2 + 1\r\n flag = True if not flag else False\r\n\r\n print()", "N = int(input())\nleft = 1\nright = N * N\nans = []\nfor i in range(N):\n temp = []\n for j in range(N // 2):\n temp.append(left)\n left += 1\n temp.append(right)\n right -= 1\n ans.append(temp)\nfor line in ans:\n print(\" \".join(map(str, line)))\n", "n=int(input())\r\na = 1\r\nb = n*n\r\nfor i in range(n):\r\n\tfor j in range(n//2):\r\n\t\tprint(a,b,end=' ')\r\n\t\ta+=1\r\n\t\tb-=1\r\n\tprint()\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\nR=lambda:map(int,input().split())\r\nn = int(input()) \r\n\r\nfor i in range(n*n//2): print(i+1,n*n-i)", "n = int(input())\r\ne = int(pow(2,n))\r\nlst1=[]\r\nlst2=[]\r\ns=1 \r\ne=n+1\r\nfor i in range(1,n+1):\r\n for j in range(s,e):\r\n lst2 = [int (x) for x in range(s,e)]\r\n s = e \r\n e = e+n\r\n if(i%2==0):\r\n lst2.sort(reverse=True)\r\n lst1.append(lst2)\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n print(lst1[j][i],end=\" \")\r\n print()", "n=int(input())\na=n*n\nl=[]\nfor j in range(1,a+1):\n l.append(j)\nm=l.copy()\nl.reverse()\nk=[]\nfor i in range(int(a/2)):\n k.append(m[i])\n k.append(l[i])\nd=0\nfor x in range(n):\n for y in range(n):\n print(k[d],end=\" \")\n d+=1\n print()\n\n\n \t \t \t \t\t \t \t\t \t\t \t\t \t\t\t\t", "n = int(input())\r\na = n**2\r\nb = int(n/2)\r\nc = 1 \r\n\r\nfor i in range(n):\r\n for j in range(b):\r\n if j + 1 == b:\r\n print(i + c, a)\r\n a -= 1\r\n else:\r\n print(i + c, a, end = ' ')\r\n a -= 1\r\n c += 1", "n = int(input())\r\nfor i in range(1, n ** 2 // 2 + 1):\r\n\tprint(i, n ** 2 - i + 1)", "# your code goes here\r\n\r\nn = int(input())\r\n\r\ni = 0\r\nwhile i+1 < n*n - i:\r\n\tprint(str(i+1) + ' ' + str(n*n - i))\r\n\ti+= 1", "n=int(input())**2\r\nk=0\r\nfor i in range(n//2):\r\n print(i+1,n-i,end=' ')\r\n k+=1\r\n if k%2==0:\r\n print()", "if __name__=='__main__':\n\tn=int(input())\n\tx=1\n\ty=n*n\n\tfor i in range(n):\n\t\tfor j in range(n//2):\n\t\t\tprint(x,end=\" \")\n\t\t\tx+=1\n\t\tfor j in range(n//2,n):\n\t\t\tprint(y,end=\" \")\n\t\t\ty-=1\n\t\tprint()\n\t\t\n\n\n\n\n\t\n\n\n\n\n\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\n10 7 2 1\r\n9 6 1 0\r\n8 5 0 0\r\n\r\nissue with second while loop\r\nnot: while len(a) > 1 and (a[0]-(a[-1]-removed)) >= a[-1]-removed:\r\nshould be while len(a) > 1 and (a[0]-(a[-1]-removed)) >= a[-1]:\r\n\r\n2nd bug: while len(a) > 1 and a[-1]-removed <= 0:\r\n\r\n4 2 0 0 -3 -4\r\n8 6 4 4 1\r\n7 5 3 3\r\n4 2 0\r\n4 2\r\n\r\n0 -1 -100\r\n\r\n1 4 6 7\r\n(4-1) (6-1)\r\n(6-1)-(4-1) = (6-1)-4+1\r\n(7-4)-((6-1)-(4-1)) = (7-1-4)-(6-4)\r\n\r\n0 3 5 6\r\n0 0 2 3\r\n0 0 0 1\r\n\r\n'''\r\n\r\n\r\ndef solve():\r\n n = II()\r\n for i in range(1, n**2//2+1, n//2):\r\n for j in range(n//2):\r\n if j == n//2-1:\r\n print(i+j, n**2-(i+j)+1, end='')\r\n else:\r\n print(i+j, n**2-(i+j)+1, end=' ')\r\n print()\r\n \r\n\r\nsolve()", "n = int(input())\r\nl = [i for i in range(1,((n*n)+1))]\r\ncnds = n//2\r\nres = l[0:cnds] + l[-cnds:]\r\nres = list(map(str,res))\r\nprint(\" \".join(res))\r\nfor brt in range(1,n):\r\n res = l[brt*cnds:((brt*cnds)+cnds)] + l[-(brt*cnds)-cnds:-(brt*cnds)]\r\n res = list(map(str,res))\r\n print(\" \".join(res))", "n = int(input().strip())\r\nfor i in range(n):\r\n a = []\r\n for j in range(n):\r\n a += [j * n + (j + i) % n + 1]\r\n print(*a)\r\n", "n = int(input())\r\n\r\nfor i in range(0,(n**2)//2,n//2):\r\n res = []\r\n for j in range(i,n//2 + i):\r\n res.append(j+1)\r\n res.append(n**2 - j)\r\n\r\n print(*res)", "import sys,math\r\n\r\ndef file():\r\n\tsys.stdin = open('input.py', 'r')\r\n\tsys.stdout = open('output.py', 'w') \r\ndef get_array():\r\n\tl=list(map(int, input().split()))\r\n\treturn l\r\n#file()\t\r\ndef main():\r\n\tn=int(input())\r\n\ta,b=1,n**2\r\n\tfor i in range(n):\r\n\t\tfor j in range(math.floor(n//2)):\r\n\t\t\tprint(a,b,end=\" \")\r\n\t\t\ta+=1\r\n\t\t\tb-=1\r\n\t\tprint()\t\r\n\t\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\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\n\r\nlst = [[0] * n for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n lst[(j + i) % n][i] = i * n + j\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n print(lst[i][j] + 1, end = \" \")\r\n print()", "n = int(input())\r\nmatrix = []\r\nturn = 1\r\nfor i in range(1,n*n+1,n):\r\n if turn == 1:\r\n matrix.append( list(range(i,i+n)) )\r\n turn = 0\r\n else:\r\n matrix.append( list(range(i,i+n))[::-1] )\r\n turn = 1\r\nres = []\r\ncol = len(matrix[0])\r\nrow = len(matrix)\r\nfor i in range( col ):\r\n res.append( [ matrix[j][i] for j in range( row )] )\r\n\r\nfor row in res:\r\n print(*row)", "n=int(input())\r\na=[]\r\nfor i in range(1,(n*n)+1):\r\n a.append(i)\r\nb=len(a)-1\r\nfor j in range(1,(len(a)//2)+1):\r\n print(a[j-1],a[b],end=\" \")\r\n b-=1\r\n if j%(n//2)==0:\r\n print()\r\n", "a=int(input())\r\n\r\nb=a*a\r\nk=0\r\nn=1\r\nm=a**2\r\n\r\nz=0\r\nfor i in range(a):\r\n p=[]\r\n while k<m:\r\n p.append(n)\r\n n=n+1\r\n k=k+1\r\n if k==a//2:\r\n k=0\r\n break\r\n while k<m:\r\n p.append(m-z)\r\n z=z+1\r\n k=k+1\r\n if k==a//2:\r\n k=0\r\n break\r\n s=str(p[0])\r\n for i in range(1,len(p)):\r\n s=s+\" \"+str(p[i])\r\n print(s)", "n = int(input())\r\n\r\nl = []\r\nfor i in range(1, n * n + 1):\r\n l.append(i)\r\n\r\nh = n // 2\r\nbeg = 0\r\nending = len(l) - 1\r\nfor i in range(n):\r\n t = beg + h\r\n while beg < t:\r\n print(l[beg], end=\" \")\r\n beg += 1\r\n\r\n t = ending - h\r\n while ending > t:\r\n print(l[ending], end=\" \")\r\n ending -= 1\r\n print()", "n = int(input())\n\narr1 = [x for x in range(1,n*n+1)]\n\narr2 = [x for x in range(n*n,0,-1)]\n\nk = 0\n\nfor i in range(n):\n s = ''\n for j in range(n//2):\n s += (str(arr1[k*n//2 + j]) + ' ')\n for j in range(n//2):\n s += (str(arr2[k*n//2 + j]) + ' ')\n print(s)\n k += 1\n", "n=int(input())\r\nx=1\r\nfor _ in range(n):\r\n for i in range(x,n//2+x):\r\n print(i,n**2-i+1,end=\" \")\r\n x+=n//2\r\n print()", "def main():\n n = int(input())\n results = [[0 for _ in range(n)] for __ in range(n)]\n number = 1\n\n for col in range(n):\n starting_row = number // n\n\n for row in range(starting_row, n):\n results[row][col] = number\n number += 1\n\n for row in range(starting_row):\n results[row][col] = number\n number += 1\n\n for row in results:\n print(' '.join([str(value) for value in row]))\n\n\nif __name__ == '__main__':\n main()\n", "#!/usr/bin/python\nimport sys\nimport time\nnum_input = int(input())\na = 1\nb = num_input*num_input\nfor i in range(1,num_input+1):\n for j in range(1,num_input+1):\n if(j % 2 == 1):\n print (a, end=' ')\n a += 1\n else:\n print (b,end = ' ')\n b -= 1\n print()\n\n\n", "n=int(input())\r\na=[[]]*n\r\nb=list(range(1,n**2+1))\r\nfor i in range(0,n,2):\r\n\ta[i]=b[:n]\r\n\tb=b[n:]\r\n\ta[i+1]=b[:n][::-1]\r\n\tb=b[n:]\r\nfor i in range(n):\r\n\tprint(*[t[i] for t in a])\r\n\t", "n=int(input())\r\nb=[*range(1,n**2+1)]\r\nl=len(b)\r\nfor i in range(n):\r\n print(*b[i:l//2:n],end=' ')\r\n print(*b[-1-i:-1-(l//2):-n])\r\n", "n = int(input())\r\nnumbers = [x for x in range(1, (n**2 + 1))]\r\nstart = 0\r\nend = n ** 2 - 1\r\nwhile start < end:\r\n print(numbers[start], numbers[end])\r\n start += 1\r\n end -= 1", "n=int(input())\r\ni=1\r\nj=0\r\nwhile(i<n**2 and j<n):\r\n print(\" \".join(map(str,range(i,i+n//2))),\" \".join(map(str,range(n**2-i+2-n//2,n**2-i+2))))\r\n i+=n//2\r\n j+=1\r\n", "n = int(input())\r\n\r\nstart = 1\r\nend = n**2\r\n\r\nfor _ in range(n):\r\n ans = []\r\n for _ in range(n//2):\r\n ans += [str(start), str(end)]\r\n start += 1\r\n end -= 1\r\n \r\n print(\" \".join(ans))", "n=int(input())\r\ni=1\r\nj=n*n\r\nwhile(j-i+1>=n):\r\n lst=[]\r\n while(len(lst)!=n):\r\n lst.append(str(i))\r\n lst.append(str(j))\r\n i=i+1\r\n j=j-1\r\n print(' '.join(lst))\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n", "n = int(input())\nstart = 1\nend = n*n\nfor i in range(1, n+1):\n bro = []\n for j in range(n//2):\n bro.append(start)\n start += 1\n for j in range(n//2):\n bro.append(end)\n end -= 1\n\n print(' '.join(map(str, bro)))", "n=int(input())\r\nfor i in range(n):\r\n for j in range(n):\r\n if j==0:\r\n a=i+1\r\n print(a,end=\" \")\r\n else:\r\n if i==j-1:\r\n a=a+2*n-1\r\n print(a,end=\" \")\r\n else:\r\n a=a+n-1\r\n print(a,end=\" \")\r\n print(\"\\n\") \r\n \r\n ", "import sys\r\nfin = sys.stdin\r\n\r\nclass problem:\r\n def init(self):\r\n pass\r\n def read_input(self):\r\n self.n = int(fin.readline())\r\n def write_output(self):\r\n pass\r\n def solve(self):\r\n res = [[] for i in range(self.n)]\r\n for i in range(self.n ** 2 // 2):\r\n res[i % self.n] += [i + 1, self.n ** 2 - i] \r\n for r in res:\r\n print(\" \".join(map(str, r)))\r\n \r\ndef main():\r\n p = problem()\r\n p.init()\r\n p.read_input()\r\n p.solve()\r\n p.write_output() \r\n\r\nmain()", "n = int(input())\r\nlst = [[0]*n] * n\r\nprev = n\r\ncurr = 1\r\nfor i in range(1,n+1):\r\n lst[i-1] = [j for j in range(curr,prev+1)]\r\n lst[i-1] = lst[i-1][i-1:] + lst[i-1][0:i-1]\r\n prev+=n\r\n curr+=n\r\nfor i in range(n):\r\n for ele in lst:\r\n print(ele.pop(),end = \" \")\r\n print(\"\\n\")\r\n \r\n", "n=int(input())\r\nk=n*n\r\nx=1\r\nfor i in range(n):\r\n for j in range(n//2):\r\n print(x,k-x+1,end=' ')\r\n x+=1\r\n print()\r\n \r\n", "n = int(input())\n\nsq = n ** 2\nsummation = (sq * (sq + 1))//2\ngoal = summation / n\ncandidates = [i for i in range(1, sq + 1)]\n\npairs = []\n\nfor i in range(sq//2):\n pairs.append((candidates[i], candidates[sq - i - 1]))\n\ncounter = 0\nmaximum = n/2\n\nfor el in pairs:\n if counter:\n print(' ', end='')\n print(el[0], el[1], end='')\n counter += 1\n\n if(counter == maximum):\n counter = 0\n print('')\n", "n = int(input())\nans = [x for x in range(1,n*n+1)]\nfor i in range((n*n)//2):\n\tprint(ans[i], ans[n*n-i-1])\n", "def solve(n):\n start = 1\n end = n*n\n halfN = n // 2\n while(n):\n line = \"\"\n i=0\n while(i<halfN):\n line += str(start) + \" \"\n start += 1\n i += 1\n i=0\n while(i<halfN):\n line += str(end) + \" \"\n end -= 1\n i += 1\n n -= 1\n print(line)\n\nn = int(input())\n\nsolve(n)", "user_input=int(input())\r\ncandies=user_input**2\r\n\r\ncandy_pairs=[]\r\n\r\nfor i in range(1,(candies//2)+1):\r\n candy_pairs.append([i,candies-i+1])\r\n\r\nper_person=len(candy_pairs)//user_input\r\n\r\nnumber=0\r\nfor i in range(user_input):\r\n for j in range(per_person):\r\n\r\n print(candy_pairs[number][0],candy_pairs[number][1],'',end='')\r\n number += 1\r\n\r\n print('')\r\n", "#!/usr/bin/python3.4\n\nn = int(input())\nl, r = 1, n * n\nwhile l < r:\n c = 0\n while c < n // 2:\n print(l, r, end=\" \")\n l += 1\n r -= 1\n c += 1\n print()\n", "n = int(input())\r\nlst = []\r\nfor i in range(n * n):\r\n lst.append(i + 1)\r\nfor i in range((n * n) // 2):\r\n print(i + 1, n * n - i)", "\"\"\"\r\n author - Sayan Bose\r\n Brooklyn 99 is love!\r\n\"\"\"\r\n\r\nn = int(input())\r\nli = [i for i in range(1, n * n + 1)]\r\nindex_start, index_end = 0, n * n - 1\r\nfor i in range(n):\r\n for j in range(n//2):\r\n print(li[index_start], end=' ')\r\n print(li[index_end], end=' ')\r\n index_start += 1\r\n index_end -= 1\r\n print('')\r\n", "n = int(input())\narr = [x for x in range(1,(n*n)+1)]\n\ni = 0\nj = len(arr)-1\n\nwhile i<j:\n\n for _ in range(n//2):\n print(arr[i], end = \" \")\n print(arr[j], end=\" \")\n i+=1\n j-=1\n print()", "n = int(input())\r\nfor i in range(1, int((n**2)/2 + 1), int(n/2)):\r\n a = []\r\n b = []\r\n for j in range(int(n/2)):\r\n a.append(i+j)\r\n for j in a:\r\n b.append(n**2+1-j)\r\n print(*(a+b))\r\n ", "def arrayr (n):\r\n l = [[] for x in range(n)]\r\n for i in range(0,n):\r\n for j in range(0,n):\r\n l[i].append(n*i+(j+1))\r\n \r\n for i in range(0,n):\r\n l[i] *=2\r\n return l\r\ndef newar (l):\r\n s = [None]*len(l)\r\n for i in range(0,len(l)):\r\n k = []\r\n for j in range(0,len(l)):\r\n k.append(l[j][j+i])\r\n s[i] = k\r\n return s\r\nn = int(input())\r\nl = arrayr(n)\r\ns = newar(l)\r\nfor x in s:\r\n print(*x)\r\n", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left\r\n\r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n\r\ndef In():\r\n return map(int, stdin.readline().split())\r\n\r\ndef I():\r\n return int(stdin.readline())\r\n\r\nP = 1000000007\r\nn = I()\r\narr = [[] for i in range(n)]\r\ni = 1 \r\nwhile (i <= (n*n)):\r\n for j in range(n):\r\n arr[j].append(i)\r\n i += 1 \r\n for j in range(n-1, -1, -1):\r\n arr[j].append(i)\r\n i += 1 \r\nfor i in range(n):\r\n for j in range(n):\r\n print(arr[i][j], end = \" \")\r\n print()", "num = int(input())\r\nmaxi = num ** 2\r\nl1 = [0] * (maxi // 2)\r\nl2 = [0] * (maxi // 2)\r\n\r\nind1 = 0\r\nind2 = 0\r\n\r\n\r\nfor n in range(1 , (maxi // 2) + 1) :\r\n if n % 2 == 0 : \r\n l1[ind1] = n\r\n l1[ind1 + 1] = maxi - n + 1\r\n ind1 += 2\r\n else :\r\n l2[ind2] = n\r\n l2[ind2 + 1] = maxi - n + 1\r\n ind2 += 2\r\nprint(*l1)\r\nprint(*l2)", "n = int(input())\r\nfor i in range((n ** 2) // 2):\r\n print(i+1 , (n ** 2) - i)\r\n", "import math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n#-----------------------------------\r\n\r\nn=int(input())\r\np=n**2;d=1\r\nfor i in range(n):\r\n for j in range(n//2):\r\n print(d,p-d+1,end=\" \")\r\n d+=1\r\n print()", "import sys\r\nimport os\r\n \r\ncin = [\r\n\tlambda: input(),\r\n\tlambda: int(input()),\r\n\tlambda: input().split(),\r\n\tlambda: [int(a) for a in input().split()],\r\n]\r\n\r\ndef solve():\r\n\tn = cin[1]()\r\n\tl = [*range(1, n*n+1)]\r\n\r\n\tfor i in range(n*n//2):\r\n\t\tprint(l[i], l[-(i+1)], end=' ')\r\n\t\tif not 2*(i+1)%n:\r\n\t\t\tprint()\r\n\r\ndef main():\r\n\tif os.path.exists('input.txt'):\r\n\t\tsys.stdin = open('input.txt', 'r')\r\n\t\tsys.stdout = open('output.txt', 'w')\r\n\r\n\tt = 1\r\n\t# t = cin[1]()\r\n\r\n\twhile t:\r\n\t\tt -= 1\r\n\t\tsolve()\r\n \r\nmain()", "n = int(input())\r\nans = 1\r\nfor j in range(n):\r\n\tfor i in range(n//2):\r\n\t\tprint(ans,n**2-ans+1 , end = \" \")\r\n\t\tans+=1\r\n\tprint()", "\r\nn = int(input())\r\ntmp = n ** 2\r\nj = 1\r\nwhile tmp > j:\r\n print(j, tmp)\r\n j += 1\r\n tmp -= 1\r\n# CodeForcesian\r\n# ♥\r\n# Lifan\r\n", "n=int(input())\n\nl,r=1,n*n\nfor i in range(n):\n for j in range(int(n/2)):\n print(l,end=' ')\n l=l+1\n for j in range(int(n/2)):\n print(r,end=' ')\n r=r-1\n print()\n\t \t \t\t \t\t \t \t\t \t\t\t\t\t \t\t \t", "from sys import stdin\r\nn=int(stdin.readline().rstrip())\r\ns=0\r\nl=[]\r\nfor i in range(1,n*n+1):\r\n l.append(i)\r\nfor i in range((n*n)//2):\r\n print(str(l[i])+\" \"+str(l[n*n-1-i]))", "n=int(input())\r\n\r\nn=n**2\r\nm=1\r\nwhile m<n:\r\n print ('{0} {1}'.format(m,n))\r\n m+=1\r\n n-=1\r\n", "n=int(input())\r\nl=[x for x in range(1,(n**2)+1)]\r\nfor x in range(0,(n**2)//2,(n//2)):\r\n\tk1=l[x:x+(n//2)]\r\n\tk2=l[len(l)-x-(n//2):len(l)-x]\r\n\tprint(*k1,*k2)", "n = int(input())\r\na,v=[],[]\r\nfor i in range(1,(n*n)+1):\r\n\tif i%n==0:\r\n\t\tv.append(i)\r\n\t\tif (i//n)%2 !=0:a.append(v)\r\n\t\telse:v=v[::-1];a.append(v)\r\n\t\tv=[]\r\n\telse:v.append(i)\r\nfor i in range(len(a)):\r\n\tfor j in range(len(a[0])):\r\n\t\tprint(a[j][i],end = \" \")\r\n\tprint()", "n = int(input())\r\nj, k = n*n, 1\r\nfor i in range(n):\r\n for t in range(n//2):\r\n print(k, j, end = ' ')\r\n k += 1\r\n j -= 1\r\n print()\r\n", "n=int(input())\r\na=[int(x) for x in range(1,(n**2)+1)]\r\nb=[]\r\nfor i in range(0,(n**2)//2,n//2):\r\n\t#print(\"i=\",i)\r\n\tc=[]\r\n\tfor h in range(i,i+n//2):\r\n\t#\tprint(\"h=\",h)\r\n\t\tc.append(a[h])\r\n\t\tc.append(a[len(a)-1-h])\r\n\tb.append(c)\r\n#print(b)\r\nfor i in range(len(b)):\r\n\tprint(\" \".join(str(x) for x in b[i]))\r\n", "n = int(input())\r\nfor i in range((n**2)//2):\r\n print(i+1, n**2-i)\r\n###### thanking telegram for solutions ######\r\n'''__________ ____ ___ _____________ __.___ \r\n\\______ \\ | \\/ _____/ |/ _| |\r\n | _/ | /\\_____ \\| < | |\r\n | | \\ | / / \\ | \\| |\r\n |____|_ /______/ /_______ /____|__ \\___|\r\n'''\r\n", "n=int(input())\r\na=[]\r\nfor i in range(1,(n*n)+1):\r\n a.append(i)\r\nfor j in range(0,n):\r\n for k in range(n//2):\r\n print(a[j*(n//2)+k],end=\" \")\r\n for k in range(n // 2):\r\n print(a[n*n-j*(n//2)-k-1],end=\" \")\r\n print(\"\\n\")", "N = int(input()); M = N * N // 2\ncandies = [[] for i in range(N)]\n# print(candies)\nfor i in range(M):\n j = 2 * i // N\n n = M - abs(j - M)\n candies[j].append(i + 1)\n candies[j].append(N * N - i)\n\nfor i in range(N):\n print(*candies[i])\n\n# print(candies)\n", "x = int(input())\r\nbuffer=2\r\n\r\nfor i in range(1, int(x**2/2)+1):\r\n print(\"{:d} {:d} \".format(i, (x**2)+1-i), end=\"\")\r\n if buffer%x == 0:\r\n print()\r\n buffer += 2\r\n", "n = int(input())\nfor i in range(n):\n\tprint(' '.join(map(str, [j // 2 + n * i // 2 + 1 if j % 2 else n * n - i * n // 2 - j // 2 for j in range(n)])))\n", "N = int(input())\r\nif N % 2 == 0:\r\n bags = [[] for i in range(N)]\r\n mid = (N * N) // 2\r\n for i in range(mid):\r\n bags[i % N].append(mid + i + 1)\r\n bags[i % N].append(mid - i)\r\n for bag in bags:\r\n print(*bag)\r\nelse:\r\n count = (N - 1) // 2\r\n mid = (N * N + 1) // 2\r\n LHS = (N + 1) // 2\r\n RHS = N - LHS\r\n S = ((N + 1) * (2*N + 1)) // 6\r\n bags = [[] for i in range(count)]\r\n for i in range(count):\r\n LS = LHS * (((mid - i - 1) + (mid - i - 1 - (N - 1) * (LHS - 1))) // 2)\r\n for j in range(LHS):\r\n bags[i].append(mid - i - 1 - (N - 1) * j)\r\n for j in range(RHS//2):\r\n bags[i].append(N*N - i, S - LS - N * N + i)\r\n print(bags)\r\n \r\n", "n = int(input())\r\na = 1\r\nb = n * n\r\n\r\nfor i in range(n):\r\n x = n\r\n while(x > 0):\r\n print(a, b, end=' ')\r\n a += 1\r\n b -= 1\r\n x -= 2\r\n print()\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(1,n**2+1):\r\n l.append((i,n**2-i+1))\r\nfor j in range(n):\r\n for i in range(n//2):\r\n print(*l[0],end=\" \")\r\n l.remove(l[0])\r\n print()\r\n", "# Codeforces A. Candy Bags\r\n# Created by Abdulrahman Elsayed on 13/01/2021\r\n\r\nn = int(input())\r\n\r\npairs = []\r\nfor i in range(1, int(((n * n) / 2) + 1)):\r\n pairs.append([i, (n * n) - (i - 1)])\r\n\r\nfor i in range(n):\r\n for j in range(int(n / 2)):\r\n print(pairs[int(i * (n / 2) + j)][0], end=' ')\r\n print(pairs[int(i * (n / 2) + j)][1], end=' ')\r\n print()", "n=int(input())\r\na=list(range(1,n**2+1))\r\nfor i in range((n**2)//2):\r\n b=[]\r\n b.append(a[i])\r\n b.append(a[-(i+1)])\r\n c=str(b)\r\n d=c.replace(',','')\r\n print(d[1:-1])", "n = int(input())\nfor i in range(n):\n print(' '.join([str((i + j) % n + n * j + 1) for j in range(n)])) \n\t\t \t\t\t \t\t \t\t\t \t\t \t\t\t \t \t\t\t", "n = int(input())\r\nd = {}\r\nfor i in range(n): \r\n d[i + 1] = []\r\n#print(d)\r\n\r\nfor j in range(n):\r\n left = (j * n) + 1\r\n right = (j + 1) * n\r\n if (j % 2) == 0: \r\n for k in range(left, right + 1): \r\n d[k - (j * n)].append(k)\r\n else:\r\n for k in range(left, right + 1):\r\n d[n + 1 - (k - j *n )].append(k)\r\n \r\nfor key in d:\r\n print(*d[key])", "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\nn = I()\r\nn = n**2\r\na = list(range(1,n+1))\r\n\r\nfor i in range(n//2):\r\n\tprint(a[i], a[n-1-i])\r\n\t\r\n\r\n", "n=int(input())\r\n\r\nfor g in range(pow(n,2)//2):\r\n\tprint(g+1,pow(n,2)-g)", "n = input()\r\nn = int(n)\r\nn2 = n**2\r\nfor i in range(1,int(n2/2)+1,2):\r\n for j in range(i,i+2):\r\n print('{one} {two} '.format(one=j,two= n2-j+1),end='')\r\n print()\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(1,n**2+1):\r\n\tl.append(i)\r\n\r\nwhile(len(l)!=0):\r\n\tfor i in range(n//2):\r\n\t\tprint(l[0],l[-1],end=\" \")\r\n\t\tl.remove(l[0])\r\n\t\tl.remove(l[-1])\r\n\r\n\tprint(\"\")\r\n", "n=int(input())\r\nfor j in range(0,n):\r\n for i in range(j*int(n/2)+1,j*int(n/2)+int(n/2)+1):\r\n print(i,end=\" \")\r\n for i in range(n**2-(j+1)*int(n/2)+1,n**2+int(n/2)-(j+1)*int(n/2)+1):\r\n print(i, end=\" \")\r\n print(\"\")", "n = int(input())\nl = 0\nr = n * n - 1\n\nfor i in range(n):\n for k in range(n // 2):\n print(l + 1, end = ' ')\n print(r + 1, end = ' ')\n l += 1\n r -= 1\n print()\n", "n=int(input())\r\na=list(range(1,n*n+1))\r\nres=[]\r\nfor i in range(n):\r\n r=[]\r\n for j in range(n//2):\r\n r.append(a[0])\r\n a.pop(0)\r\n r.append(a[-1])\r\n a.pop(-1)\r\n res.append(' '.join(map(str,r)))\r\nfor i in range(len(res)):\r\n print(res[i])", "n = int(input())\r\nprint(*[' '.join(map(str, list(range(n // 2 * i + 1, n // 2 * (i + 1) + 1)) + list(range(n * n - n // 2 * (i + 1) + 1, n * n - n // 2 * i + 1)))) for i in range(n)], sep = '\\n')", "'''a=[int(i) for i in input().split()]\r\nx=a[0]\r\ny=a[1]\r\nz=a[2]\r\nif y==x and z==0:\r\n print('0')\r\nelif x>y+z:\r\n print('+')\r\nelif y>x+z:\r\n print('-')\r\nelse:\r\n print('?')\r\nn=int(input())\r\nz=[int(i) for i in input().split()]\r\nx=[]\r\nd=0\r\nv=''\r\nfor i in range(n):\r\n c=0\r\n e=0\r\n for f in range(len(z)):\r\n if z[f]>c and f+1 not in x:\r\n c=z[f]\r\n e=f+1\r\n d+=(i*c)+1\r\n x.append(e)\r\nprint(d)\r\nfor i in x:\r\n v+=str(i)\r\n v+=' '\r\nprint(v)\r\n\r\nf=int(input())\r\ng=[int(i) for i in input().split()]\r\nfor i in range(len(g)-1):\r\n for f in range(len(g)-1-i):\r\n if g[f]>g[f+1]:\r\n g[f],g[f+1]=g[f+1],g[f]\r\nif g[0]*g[1]>g[-2]*g[-3] and g[-1]>0:\r\n print(g[-1]*g[0]*g[1])\r\nelse:\r\n print(g[-1]*g[-2]*g[-3])\r\nfor u in range(int(input())):\r\n z=int(input())\r\n y=[int(f) for f in input().split()]\r\n y.sort()\r\n d=0\r\n for i in y:\r\n d+=i\r\n if d<2048:\r\n print('No')\r\n continue\r\n if 2048 in y:\r\n print('yes')\r\n continue\r\n for x in range(z+1):\r\n if 2048 in y:\r\n print('yes')\r\n break\r\n for i in range(len(y)-1):\r\n if y[i]==y[i+1]:\r\n y[i+1]=y[i]*2\r\n y.pop(i)\r\n if i>len(y)-3:\r\n break\r\n y.sort()\r\n else:\r\n print('no')'''\r\nn=int(input())\r\nx=[]\r\nfor i in range(1,((n**2)//2)+1):\r\n x.append(n**2+1-i)\r\n x.append(i)\r\n \r\n if len(x)==n:\r\n print(*x)\r\n x=[]\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n=int(input())\r\nl=0\r\nh=n*n+1\r\nfor i in range(n):\r\n for j in range(n//2):\r\n l=l+1\r\n h=h-1\r\n print(l,h,end=' ')\r\n print('\\n')", "n=int(input())\r\nA=[]\r\nfor i in range(1,(n**2)+1):\r\n A.append(i)\r\nl=n*n\r\ni=0\r\nfor _ in range(n):\r\n for p in range(n//2):\r\n print(A[i],A[l-i-1],end=' ')\r\n i+=1\r\n print()\r\n", "# Wadea #\r\n\r\nn = int(input())\r\nfor i in range(1,n**2//2+1):\r\n print(i,n**2-i+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n\r\nn = int(input())\r\n\r\nfor i in range(1,int((n*n)/2)+1):\r\n print(i,int(n*n)-i+1)", "n=int(input())\r\na,b=1,n**2\r\nfor i in range(1,n+1):\r\n for j in range(n//2):\r\n print(a,b,end=\" \")\r\n a,b=a+1,b-1\r\n print()", "n = int(input())\nn = n**2\ni = 1\nwhile(i <= n):\n print(i, n)\n i += 1\n n -= 1", "n = int(input())\n\nsquare = [[i for i in range(i, n*n+1, n)] for i in range(1, n+1)]\n\nstart = [0,0]\nfor _ in range(n):\n a, b = start\n for i in range(n):\n print(square[a%(n)][b%(n)], end=\" \")\n a += 1; b+= 1\n print()\n start[0] += 1\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nans = []\r\nfor j in range(1, (n * n) // 2 + 1):\r\n ans.append(j)\r\n ans.append(n * n - j + 1)\r\n if len(ans) == n:\r\n print(*ans)\r\n ans = []\r\n", "n = int(input())\r\nz = [i for i in range(1, n**2+1)]\r\nprint('\\n'.join(f\"{z.pop(0)} {z.pop(-1)}\" for i in range(n**2//2)))\r\n", "n=int(input())\r\nk=1\r\nfor i in range(0,n):\r\n for j in range(0,n//2):\r\n print (k,end=\" \")\r\n print (n*n+1-k,end=\" \")\r\n k+=1\r\n print (\" \")", "brothers = int(input())\r\n\r\ncandy_bags = brothers ** 2\r\ncandies = list(range(1, candy_bags+1))\r\n\r\n\r\nc = brothers // 2\r\n\r\nfor _ in range(brothers):\r\n print(*(candies[:c] + candies[-c:]))\r\n candies = candies[c:-c]", "number_of_brothers=int(input())\r\ntotal_bags=number_of_brothers*number_of_brothers\r\nfor i in range(number_of_brothers):\r\n for j in range(1,number_of_brothers//2+1):\r\n one_bag=number_of_brothers//2*i+j\r\n print(one_bag,total_bags-one_bag+1,end=' ')\r\n print('')", "n=int(input())\r\ni=0\r\na=1\r\nb=n*n\r\nwhile i<n:\r\n\tj=0\r\n\twhile j<n/2:\r\n\t\tprint(a,' ',end='')\r\n\t\tprint(b,' ',end='')\r\n\t\ta+=1\r\n\t\tb-=1\r\n\t\tj+=1\r\n\tprint()\r\n\ti+=1\r\n", "n = int(input())\r\nl, r = 1, n*n\r\nfor i in range(n):\r\n\tfor j in range(n//2):\r\n\t\tprint(l, r, end=' ')\r\n\t\tl += 1\r\n\t\tr -= 1\r\n\tprint()", "t=int(input())\r\nfor i in range(1,t+1):\r\n\tn=t**2-i+1\r\n\tl=[]\r\n\tx=i\r\n\tfor j in range(t//2):\r\n\t\tl.append(n)\r\n\t\tl.append(x)\r\n\t\tn=n-t\r\n\t\tx=x+t\r\n\tprint(*l)", "n=int(input())\r\nx,y,a,b=1,(n//2)+1,n*n,n*n-(n//2)\r\n\r\nfor i in range(n):\r\n\tfor j in range(x,y):\r\n\t\tprint(j,end=' ')\r\n\tx+=n//2\r\n\ty+=n//2\r\n\tfor k in range(a,b,-1):\r\n\t\tprint(k,end=' ')\r\n\tprint()\r\n\ta-=n//2\r\n\tb-=n//2", "n = int(input(''))\r\nl = []\r\ni=1\r\nwhile len(l)!=n:\r\n\tg = []\r\n\ts = i\r\n\tt = i\r\n\tfor i in range(s,s+n):\r\n\t\tg +=[i]\r\n\tfor i in range(t,t+n):\r\n\t\tg +=[i]\r\n\tl+=[g]\r\n\ti+=1\r\n\r\n\r\ng = 0\r\nt=[]\r\nfor i in range(n):\r\n\tfor j in range(g,n+g):\r\n\t\tt += [l[i][j]]\r\n\tg+=1\r\n\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tprint(t[i+n*j],end = ' ')\r\n\r\n\tprint()\r\n", "n = int(input())\r\nsq = n*n\r\nfor i in range(0, sq//2):\r\n\tprint (i+1, sq-i, sep=\" \")\r\n", "n = int(input())\r\ncandy = [i for i in range(1, n*n +1)]\r\ni, j = 0, n*n - 1\r\nbro = []\r\ncnt = 0\r\nwhile cnt < n:\r\n indi = []\r\n while i < (n*n)//2 and j >= (n*n)//2 and len(indi) < n:\r\n indi.append(candy[i])\r\n indi.append(candy[j])\r\n i += 1\r\n j -= 1\r\n bro.append(indi)\r\n cnt += 1\r\nfor indi in bro:\r\n print(*indi)", "#!/usr/bin/python3\nn = int(input())\ni = 1\nfor _ in range(n):\n for _ in range(n//2):\n print(i, end=' ')\n print(n**2 - i + 1, end=' ')\n i += 1\n print()\n \n \n\n", "n = int(input())\r\nfor i in range(n):\r\n for j in range(1, n // 2 + 1):\r\n first = i * n // 2 + j\r\n print(first, n * n + 1 - first, end=' ')\r\n print()", "n = int(input())\r\ni = 1\r\nj = n**2\r\nwhile (i <= n):\r\n k = 0\r\n while (k < n//2):\r\n print(k*n + i,end = ' ')\r\n k = k + 1\r\n k = 0\r\n while (k < n//2):\r\n print(-k*n + j,end = ' ')\r\n k = k + 1\r\n print()\r\n i = i + 1\r\n j = j - 1\r\n", "n=int(input())\r\nls=[0]\r\nfor i in range(1,(n*n+1)):\r\n\tls.append(i)\r\nans=[]\r\nfor i in range(1,int((len(ls)/2)+1)):\r\n\tans.append(ls[i])\r\n\tans.append(ls[len(ls)-i])\t\r\n\tif(len(ans)==n):\r\n\t\tfor e in ans:\r\n\t\t\tprint(e,end=\" \")\r\n\t\tprint()\r\n\t\tans=[]\r\n\r\n\r\n\r\n\r\n", "\r\nif __name__ == \"__main__\":\r\n \r\n n = int(input())\r\n bags = n**2\r\n i = 1\r\n result = str()\r\n for k in range(n):\r\n for l in range(n):\r\n if l < n // 2:\r\n result += str(i) +' '\r\n i += 1\r\n else:\r\n result += str(bags) + ' '\r\n bags -= 1\r\n result = result.rstrip() + '\\n'\r\n print (result)\r\n", "n = int(input())\n\ncount = 1\nfor i in range(n):\n line = []\n for j in range(n//2):\n line.append(\"{0} {1} \".format(count, (n**2) - count + 1))\n count += 1\n print(''.join(line))\n\n", "n = int(input())\r\n\r\ni = 1\r\nj = n**2\r\n\r\nwhile i < j:\r\n print(i, j)\r\n i += 1\r\n j -= 1", "n=int(input())\r\nx=n*(n**2+1)//2\r\nfor i in range(1,n*n//2+1,n//2):\r\n l=[]\r\n for j in range(i,i+n//2):\r\n l.append(j)\r\n l.append(x//(n//2)-j)\r\n print(*l)", "def candy_bags(n,l):\r\n each_get=sum(l)//n\r\n m_1=[]\r\n m_2=[]\r\n ans=[]\r\n ans_1=[]\r\n a=(n*n)//2\r\n for i in range(0,a):\r\n m_1.append(l[i])\r\n #print(m_1)\r\n for j in range((n*n)-1,a-1,-1):\r\n m_2.append(l[j])\r\n #print(m_2)\r\n a1=0\r\n for i in zip(m_1,m_2):\r\n for j in range(len(i)):\r\n a1=a1+(i[j]+i[j+1])\r\n if a1==each_get:\r\n ans.append(i[j])\r\n ans.append(i[j+1])\r\n break\r\n else:\r\n ans.append(i[j])\r\n ans.append(i[j+1])\r\n break\r\n \r\n return(ans)\r\n\r\n \r\nn=int(input())\r\nl=[]\r\nfor i in range(1,n**2+1):\r\n l.append(i)\r\nresult=candy_bags(n,l)\r\na=0\r\nfor i in range(n,(n*n)+1,n):\r\n for j in result[a:i]:\r\n print(j,end=\" \") \r\n a=i\r\n print()\r\n", "m=int(input())\nfor i in range(m*m//2): print(i+1,m*m-i)\n \t \t\t \t\t \t\t \t\t \t\t\t\t\t\t\t\t", "a1 = int(input())\r\na2 = a1 ** 2\r\na3 = a2 / 2 / a1\r\ns1 = [i for i in range(1, a2 + 1)]\r\ns2 = []\r\n\r\nwhile len(s1) > 0:\r\n s3 = [s1[0], s1[-1]]\r\n s2.append(s3)\r\n s1.remove(s1[0])\r\n s1.remove(s1[-1])\r\n\r\nw = 0\r\nq = ''\r\nfor i in range(len(s2)):\r\n w += 1\r\n for j in range(len(s2[i])):\r\n q += str(s2[i][j]) + str(' ')\r\n if w % a3 == 0:\r\n print(q)\r\n q = ''\r\n \r\n", "n = int(input())\r\nfor i in range(1,n+1):\r\n print(i, end= \" \")\r\n for j in range(2,n+1):\r\n if j%2==0:\r\n print(j*n-i+1, end=\" \")\r\n else:\r\n print((j-1)*n+i,end=' ')\r\n print()", "n=int(input())\r\nres=0\r\nfor i in range(n):\r\n for j in range(1,n//2+1):\r\n print(res+j,end=' ')\r\n print(n**2+1-(res+j),end=' ')\r\n print(end='\\n')\r\n res+=n//2 ", "n=int(input())\r\nl=[]\r\nfor i in range(1,(n*n)+1):\r\n l.append(i)\r\nans=n//2\r\nfor i in range(n):\r\n print(*l[:ans],*l[-ans:])\r\n l=l[(ans):(-ans)]", "n = int(input())\r\nseq = []\r\nlimit = n**2 + 1\r\nbags = (n**2) // n\r\n\r\nfor i in range(n):\r\n s = ''\r\n for j in range(bags//2):\r\n n1 = (j+1) + (n*i)\r\n n2 = limit - n1\r\n s += str(n1)+ ' ' + str(n2) + ' '\r\n #print(s)\r\n seq.append(s)\r\nfor i in range(n):\r\n print(seq[i][:-1])", "n=int(input())\r\narr=[i for i in range(1,n**2+1)]\r\narr1=[]\r\nfor i in range(len(arr)//2):\r\n arr1.append(str(arr[i]));arr1.append(str(arr[0-(i+1)]))\r\ns=0;e=n\r\nwhile True:\r\n print(' '.join(arr1[s:e]))\r\n s=e;e=s+n\r\n if e>n**2:\r\n break\r\n \r\n ", "n = int(input())\nfor i in range(n):\n ans = []\n for j in range(n):\n ans += [j * n + (j + i) % n + 1]\n print(' '.join(map(str, ans)))\n", "n=int(input())\nj=n*n\nfor i in range(1,(n*n)//2 +1):\n print(i,j)\n j=j-1\n\t \t\t \t\t\t\t\t\t \t \t\t\t\t \t \t\t\t", "x=int(input())\r\nsq=x**2;c=0;a=1\r\nfor i in range(x):\r\n xx=\"\"\r\n for j in range(x//2):\r\n xx+=str(a)+\" \"\r\n a+=1\r\n for j in range(x//2):\r\n xx+=str(sq-c)+\" \"\r\n c+=1\r\n print(xx)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = n**2+1\r\nfor i in range(n):\r\n d = []\r\n for j in range(n//2*i, n//2*(i+1)):\r\n d.append(j+1)\r\n d.append(a-j-1)\r\n print(*d)\r\n", "n=int(input())\r\nfor i in range(1,int(n**2/2+1)):\r\n print('%d %d'%(i,n**2-i+1))", "n = int(input())\r\nt = n**2\r\nstep = n//2\r\nfor x in range(n):\r\n l = [str(_+1) for _ in range(step*x,step*(x+1))] + [str(_) for _ in range(t-step*x,t-step*(x+1),-1)] \r\n print (' '.join(l))", "n = int(input())\n\nfair = n*n * (n*n+1) / (2*n)\n\nbro = [[] for i in range(n)]\n\nupwards = True\nfor i in range(0, n*n):\n if upwards:\n bro[i % n].append(i + 1)\n else:\n bro[(-i - 1) % n].append(i + 1)\n \n if i % n == n - 1:\n upwards = not upwards\n\nfor b in bro:\n print(\" \".join(map(str, b)))\n", "from collections import defaultdict as dd\r\nhp = dd(lambda:4)\r\n\r\nn = int(input())\r\n# arr = list(map(int, input().split()))\r\n\r\nm=int((n*n)/2)\r\nfor i in range(1,m+1):\r\n print(i,(n**2)+1-i)", "n = int(input())\r\nfor i in range(n*n//2):\r\n print(i+1,n*n-i)", "a=int(input());b=[*range(1,a*a+1)];j,k=0,a*a\r\nfor i in range(a):print(*b[j:j+(a//2)],*b[k-(a//2):k]);j=j+(a//2);k=k-(a//2)\r\n\r\n", "n = int(input())\r\nfor i in range(n):\r\n row = []\r\n for j in range(n):\r\n d = (i+j)%n +1\r\n row.append(j*n+d)\r\n print(*row)\r\n", "import math\r\n\r\nn = int(input())\r\ncandylist = []\r\n\r\nfor i in range(1,n**2+1):\r\n candylist.append(i)\r\n\r\nfor i in range(n):\r\n for k in range(n//2):\r\n print(candylist[0], end = ' ')\r\n if(k != n//2-1):\r\n print(candylist[len(candylist)-1], end =' ')\r\n else:\r\n print(candylist[len(candylist)-1])\r\n candylist.pop(0)\r\n candylist.pop(len(candylist)-1)\r\n \r\n \r\n", "# https://codeforces.com/problemset/problem/334/A\n\nn = int(input())\n\ntotal_candies = [i for i in range(1, (n ** 2) + 1)]\ni = 0\nj = len(total_candies) - 1\n\nwhile i < j:\n print(f\"{i + 1} {j + 1}\")\n i += 1\n j -= 1", "n = int(input())\r\nmax = n*n\r\nmin = 1\r\nfor i in range(n*n//2):\r\n print(min, max)\r\n min = min+1\r\n max = max-1\r\n ", "n = int(input())\r\nfor i in range(1, n ** 2 // 2 + 1):\r\n print(str(i) + ' ' + str(n ** 2 + 1 - i))", "n=int(input())\r\ntotal=n*n+1\r\nj=1\r\nfor i in range(n):\r\n while j<=n*n//2:\r\n for k in range(n//2):\r\n print(j,total-j,sep=\" \",end=\" \")\r\n j+=1\r\n print()\r\n break\r\n", "n = int(input())\r\na = int(n ** 2 + 1)\r\nt = 1\r\n\r\nfor i in range(1, n+1):\r\n for j in range(int(n/2) - 1):\r\n print('%d %d' % (t, a - t), end = ' ')\r\n t += 1\r\n print('%d %d' % (t, a - t))\r\n t += 1", "n = int(input())\r\n\r\na = []\r\nfor j in range(n):\r\n\ta.append(0)\r\n\ta[j] = []\r\n\tfor i in range(n):\r\n\t\ta[j].append((n*j)+i+1)\r\n\r\nfor i in range(len(a)):\r\n\tif(i%2 != 0):\r\n\t\ta[i].reverse()\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tprint(a[j][i], end=\" \")\r\n\tprint()", "n=int(input())\nfor i in range((n*n)//2):\n \tprint(i+1,n*n-i)\n \t\t\t\t \t \t\t\t \t\t \t\t \t\t \t\t\t \t \t", "n=int(input())\nncandies=int((n*n+1)*n/2)\nfor i in range(n):\n for j in range(1,int(n/2)+1):\n print(i*int(n/2)+j,end=' ')\n print(n*n-(i*int(n/2)+j)+1)\n \t\t\t \t\t\t \t \t \t \t\t\t \t", "\r\nn = int(input())\r\n\r\ncandy_bags = n**2\r\n\r\na = list(range(1,candy_bags+1))\r\n\r\n\r\neach_person = candy_bags // (2*n)\r\nfor i in range(n):\r\n astr = ''\r\n for j in range(each_person):\r\n astr += '{} {} '.format(a.pop(0),a.pop())\r\n print (astr)\r\n\r\n", "n = int(input()) \n#n, m = map(int, input().split())\n#s = input()\n#c = list(map(int, input().split()))\nfor i in range(1, n + 1):\n a = [i]\n for j in range(1, n ):\n if a[-1] == n * j:\n a.append(a[-1] + 1)\n else:\n a.append(a[-1] + n + 1)\n print(*a)\n ", "n = int(input())\r\nm = n ** 2\r\nout = ['{} {}'.format(i, m - i + 1) for i in range(1, m // 2 + 1)]\r\nprint('\\n'.join(out))\r\n", "\r\nbros = int(input())\r\ncandies = [[] for _ in range(bros)]\r\n\r\nc = 1\r\nfor i in range(bros):\r\n for j in range(bros):\r\n # print(i,j)\r\n if i % 2:\r\n \r\n candies[j].append(c)\r\n else:\r\n # print('hi', bros-j)\r\n candies[bros-1-j].append(c)\r\n c += 1\r\n# print(candies)\r\nfor b in candies:\r\n for x in b:\r\n print(x, end = ' ')\r\n print()", "n = int(input())\r\n\r\nnum = 1\r\nfor i in range(n):\r\n for j in range(int(n/2)):\r\n print(num, n*n - num + 1, end=\" \")\r\n num += 1\r\n print()\r\n", "n=int(input())\r\na=list(range(1,n**2+1))\r\nm=0\r\nfor i in range(len(a)//2):\r\n print(a[i],a[len(a)-1-i],end=\" \")\r\n m+=1\r\n if m==n//2:\r\n m=0\r\n print(\"\\n\")\r\n", "_=int(input())\r\nb=_**2\r\nle=list(range(1,b+1))\r\nr=0\r\nl=_**2-1\r\nf=[]\r\nfor i in range(1,_**2+1):\r\n if i&2:\r\n print(le[r],end=\" \")\r\n r+=1\r\n else:\r\n print(le[l],end=\" \")\r\n l-=1\r\n if i%_==0:\r\n print()\r\n \r\n \r\n \r\n", "n=int(input())\nfor i in range(0,n):\n\tfor j in range(0,n,2):\n\t\tprint(str(j*n+i+1)+\" \"+str((j+2)*n-i),end=\" \")\n\tprint()\n\t \t\t\t\t \t\t\t\t \t \t\t \t\t\t \t\t\t \t", "n=int(input())\r\ns=n**2\r\nfor i in range(s//2):\r\n print(i+1,s-i)\r\n", "n = int(input())\r\nfor i in range(1, (n*n)//2+1):\r\n print(i, (n*n-i+1))", "n = int(input())\r\narr = list(range(1, n**2 + 1))\r\nl, r = 0, len(arr)-1\r\nnum = n // 2\r\nwhile l < r:\r\n for i in range(l, l + num):\r\n print(arr[i], end=' ')\r\n \r\n for i in range(r, r - num, -1):\r\n print(arr[i], end=' ')\r\n print(end = '\\n')\r\n \r\n l += num\r\n r -= num\r\n \r\n\r\n\r\n\r\n\r\n\r\n", "def read():\r\n inputs = input().strip()\r\n return list(map(int, inputs.split()))\r\ndef read_pair():\r\n return map(int, input().split(' '))\r\nn = int(input())\r\nz = 1\r\nmid = n * n\r\nfor i in range (n):\r\n for j in range (n // 2):\r\n print(z, mid, end = \" \")\r\n z += 1\r\n mid -= 1\r\n print()", "n = int(input())\r\n\r\ns = n*n\r\nx = 1\r\n\r\n\r\nfor i in range(n):\r\n \r\n for j in range(int(n/2)):\r\n print(x , end=\" \")\r\n x = x+1\r\n \r\n for j in range(int(n/2)):\r\n print(s , end=\" \")\r\n s = s-1\r\n \r\n print(\"\",end=\"\\n\")\r\n", "n=int(input())\r\na=1\r\nb=n*n\r\nfor i in range(n):\r\n for j in range(n//2):\r\n print(a,end=' ')\r\n print(b,end=' ')\r\n a+=1\r\n b=b-1\r\n print(end='\\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 Candy_Bags():\r\n n = inp()\r\n\r\n bagsList = [x for x in range(1,(n*n)+1)]\r\n #print(bagsList)\r\n index_from_front = 0\r\n index_from_end = len(bagsList)-1\r\n\r\n stop_for_front = (len(bagsList)//2) - 1\r\n #print(stop_for_front)\r\n outputStr = ''\r\n\r\n while index_from_front <= stop_for_front:\r\n for i in range(n//2):\r\n outputStr += str(bagsList[index_from_front]) + ' '\r\n index_from_front += 1\r\n for i in range(n//2):\r\n outputStr += str(bagsList[index_from_end]) + ' '\r\n index_from_end -= 1\r\n outputStr += '\\n'\r\n \r\n outputStr = outputStr.strip()\r\n print(outputStr)\r\n return\r\n\r\n\r\nCandy_Bags()", "n=int(input())\r\na=[]\r\nb=[]\r\nn=n**2\r\nfor i in range(1,n//2+1):\r\n if i%2:\r\n a.append(i)\r\n a.append(n-i+1)\r\n else:\r\n b.append(i)\r\n b.append(n-i+1)\r\nprint(*a)\r\nprint(*b)\r\n#print(sum(a),sum(b))", "n = int(input())\r\nfor i in range(n):\r\n for j in range(n//2):\r\n print(i*n + j + 1, n**2 - (i*n + j), end = ' ')\r\n print()", "n=int(input())\r\nfor i in range(1,n*n//2+1,n//2):\r\n for j in range(i,i+n//2):\r\n print(j,end=\" \")\r\n print(n*n-j+1,end=\" \")\r\n print()", "z=int(input())\r\nlst=[]\r\nfor t in range(z):\r\n lst.append([])\r\n\r\na=0\r\nfor i in range(1,(z**2)+1):\r\n lst[a].append(i)\r\n## print('lst111=',lst)\r\n if i%z==0:\r\n a+=1\r\n if a>(z//2):\r\n lst[a-1].reverse()\r\n \r\n##print('lst=',lst) \r\nfor i in range(z):\r\n for e in lst:\r\n print(e[i],end=' ')\r\n print() \r\n", "n=int(input())\r\n\r\ncandies=list(range(1,n*n +1))\r\nl=len(candies)\r\ncheck=candies.copy()\r\ncheck.reverse()\r\ncandies=candies[:len(candies)//2]\r\ncheck=check[:len(check)//2]\r\n\r\n\r\nl//=2\r\nl//=n\r\n\r\ni=0\r\ncount=0\r\nif n==2:\r\n print(1,4)\r\n print(2, 3)\r\nelse:\r\n\r\n while(i<(n*n)//2):\r\n while(count!=l):\r\n print(candies[i],check[i],end=\" \")\r\n count+=1\r\n i+=1\r\n print() \r\n count=0 ", "import collections\r\nimport functools\r\nimport math\r\nimport random\r\nimport sys\r\nimport bisect\r\n\r\n\r\ndef In():\r\n return map(int, sys.stdin.readline().split())\r\n\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef candybags():\r\n n = int(input())\r\n bags = n\r\n if n % 2:\r\n print(n)\r\n bags -= 1\r\n n -= 1\r\n l, r = 1, n ** 2\r\n while l < r:\r\n li = []\r\n for i in range(bags // 2):\r\n li += [l, r]\r\n l += 1\r\n r -= 1\r\n print(*li)\r\n\r\n\r\ncandybags()\r\n", "n = int(input())\n\na = int((n*n)/2)\ni = 1\nj = n*n\n\nwhile i<=a and j>=a:\n print(i,j)\n i,j = i+1, j-1", "n = int(input())\r\n\r\nl = list(range(1, n+1))\r\nc = 1\r\nfor i in range(n):\r\n l = []\r\n for j in range(n//2):\r\n l.append(\"{0} {1} \".format(c, n**2-c+1))\r\n c += 1\r\n print(\"\".join(l))\r\n", "import sys\r\n\r\n\r\nn = int(sys.stdin.readline())\r\n\r\nn2 = n ** 2\r\n\r\nfor i in range(int(n2 / 2)):\r\n print(str(i + 1) + \" \" + str(n2 - i))", "n=int(input())\nl=1\nr=n*n\nwhile(l<r):\n print(l,r)\n l=l+1\n r=r-1\n\t \t\t\t\t\t\t \t\t \t \t \t \t \t \t \t\t", "n=int(input())\r\nn=n*n\r\na=[str(x)+\" \"+str(n+1-x) for x in range(1,n//2 + 1)]\r\nfor i in a:print(i)", "n = int(input())\nm = n//2\nN = n**2+1\nfor i in range(n):\n for j in range(i*m+1,i*m+m+1):\n print(j,N-j,end=\"\")\n if j == i*m+m:\n print()\n else:\n print(\" \",end=\"\")\n", "n = int(input())\ncandies = [i for i in range(1, n ** 2 + 1)]\nsum_candies = sum(candies)\nsteps = n // 2\n\ni = 0\nj = len(candies) - 1\n\nfor _ in range(n):\n result = []\n for _ in range(n//2):\n result.append(candies[i])\n result.append(candies[j])\n\n j -= 1\n i += 1\n print(*result)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Mar 6 20:45:22 2020\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\n\r\n\r\n#https://codeforces.com/problemset/problem/334/A\r\n\r\n\r\ndef candy_bags():\r\n brothers = int(input())\r\n bags = [i for i in range(1,(brothers**2)+1)]\r\n \r\n all_brothers = [[] for i in range(brothers)]\r\n \r\n for i in range(len(all_brothers)):\r\n for j in range(int(brothers/2)):\r\n all_brothers[i].append(bags[0])\r\n all_brothers[i].append(bags[-1])\r\n bags.pop()\r\n bags.pop(0)\r\n \r\n output = str(all_brothers[i][0])\r\n for x in range(1,len(all_brothers[i])):\r\n output += ' ' + str(all_brothers[i][x])\r\n \r\n print(output)\r\n \r\n \r\ncandy_bags()", "n = int(input())\r\nx = 1\r\ny = n * n\r\ns = \"\"\r\nfor i in range(n):\r\n for j in range(n // 2):\r\n s += str(x) + \" \" + str(y) + \" \"\r\n x += 1\r\n y -= 1\r\n print(s)\r\n s = \"\"", "n = int(input())\r\nc = n**2\r\nfor i in range(1,n**2 // 2 +1):\r\n print(i, c)\r\n c-= 1\r\n ", "#ROUNIAUDI\r\nanswer=int(input())\r\nw=answer*answer\r\nfor o in range(int(((answer/2)*answer))):\r\n print(o+1,w-o)\r\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn=iinput()\r\na = [i for i in range(1, n**2+1)]\r\nb = list(reversed(a))\r\n# print(a, b)\r\n\r\ni = 1\r\nwhile(i<=n**2//2):\r\n ans = []\r\n for j in range(i, i+n//2):\r\n ans.append(a[j-1])\r\n for j in range(i, i+n//2):\r\n ans.append(b[j-1])\r\n ans.sort() \r\n print(*ans)\r\n i+=n//2", "n=int(input())\r\na=[]\r\nfor i in range(1,n**2+1) :\r\n\ta.append(i)\r\nans=[]\r\nfor i in range(0,(n**2)//2,n//2) :\r\n\tput=[]\r\n\tfor j in range(i,i+n//2) :\r\n\t\tput.append(a[j])\r\n\t\tput.append(a[len(a)-1-j])\r\n\tans.append(put)\r\nfor i in range(len(ans)) :\r\n\tfor j in range(0,n) :\r\n\t\tprint(ans[i][j],end=\" \")\r\n\tprint()", "n=int(input())\r\nfirst=1\r\nm=first\r\nlast=n*n\r\nh=last\r\nfor i in range(n):\r\n while(first<last):\r\n print(first,last,end=\" \")\r\n first+=n\r\n last-=n\r\n first=m+1\r\n m=first\r\n last=h-1\r\n h=last\r\n print()\r\n \r\n", "a = int(input())\r\nq = (a - 2) // 2\r\np = a ** 2\r\nt = 0\r\nr = []\r\nh = []\r\na1, a2 = 1, p\r\nfor i in range(a):\r\n for j in range(a // 2):\r\n r.append(a1)\r\n r.append(a2)\r\n a1, a2 = a1 + 1, a2 - 1\r\n print(*r)\r\n r = []", "n=int(input())\r\ns=1\r\nl=n*n\r\nfor i in range(n):\r\n for j in range((n//2)):\r\n print(s,end=' ')\r\n s+=1\r\n for j in range((n//2)):\r\n print(l,end=' ')\r\n l-=1\r\n print('')", "def solve():\r\n\tn = int (input())\r\n\tmx = [[0]*n for _ in range(n)]\r\n\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tmx[i][j] = i*n + j + 1\r\n\r\n\tfor i in range(n):\r\n\t\tans = []\r\n\t\tfor j in range(n):\r\n\t\t\tans.append(mx[j][(i+j)%n])\r\n\t\tprint(*ans)\r\n\r\n\r\nsolve()", "n=int(input())\r\nl=[i for i in range(1,n**2 +1)]\r\nfor i in range(n*n//2):\r\n print(l[i],l[-1-i])\r\n ", "n = int(input())\r\n\r\nfor i in range(int(n**2/2)):\r\n print(i+1, n**2 - i)\r\n", "n=int(input())\r\na=2*n-1;b=1;x=1\r\nfor _ in range(n):\r\n print(*(x+(i+1)//2*a+i//2*b for i in range(n)))\r\n x+=1;a-=2;b+=2", "n=int(input())\r\ns=\"\"\r\nlis=[]\r\nfor i in range(1,n*n+1):\r\n lis.append(i)\r\nif(n%2==0):\r\n t=1\r\n i=0\r\n j=len(lis)\r\n a=int(n/2)\r\n b=int(j-n/2)\r\n while(t<=n):\r\n s1=lis[i:a]\r\n s2=lis[b:j]\r\n i=int(i+n/2)\r\n a=int(a+n/2)\r\n b=int(b-n/2)\r\n j=int(j-n/2)\r\n res=s1+s2;\r\n for p in res:\r\n print(p,end=\" \")\r\n print()\r\n t+=1\r\n \r\n \r\n ", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\nn = int(input())\r\nfor i in range(1,pow(n,2)//2,2):\r\n print(str(i)+\" \"+str(pow(n,2)+1-i)+\" \")\r\nprint(\"\\n\")\r\nfor i in range(2,pow(n,2)//2+1,2):\r\n print(str(i)+\" \"+str(pow(n,2)+1-i)+\" \")\r\nprint(\"\\n\")\r\n", "n = int(input())\r\ns = []\r\nfor i in range(0, n, 2):\r\n s.append([])\r\n for j in range(n):\r\n s[-1].append(i*n+j+1)\r\nfor i in range(1, n, 2):\r\n s.append([])\r\n for j in range(n-1, -1, -1):\r\n s[-1].append(i*n+j+1)\r\nfor i in range(n):\r\n res = ''\r\n for j in range(n):\r\n res += str(s[j][i]) + ' '\r\n print(res)\r\n", "n=int(input())\r\nans=0\r\nres=pow(n,2)//2\r\ni=1\r\nj=n**2\r\nwhile i<=res and j>=res :\r\n print(i,j)\r\n i+=1\r\n j-=1\r\n", "n = int(input())\nl = n * n + 1\nk = 1\nfor i in range(n):\n row = []\n for j in range(n // 2):\n row.append(str(k))\n row.append(str(l - k))\n k += 1\n print(\" \".join(row))\n", "n = int(input())\r\nm = n**2 + 1\r\nt = n//2\r\n\r\nfor i in range(n):\r\n x = i*t + 1\r\n for j in range(x, x + t):\r\n print(j, m - j, end=' ')\r\n print()\r\n ", "n = int(input())\r\na = [[0] * n for i in range(n)]\r\nc, f = 1, 0\r\nfor j in range(n):\r\n if(f % 2):\r\n for i in range(n - 1, -1, -1):\r\n a[i][j] = c \r\n c += 1 \r\n f = 1 - f \r\n else:\r\n for i in range(n):\r\n a[i][j] = c \r\n c += 1 \r\n f = 1 - f\r\nfor i in range(n):\r\n print(*a[i])", "n = int(input())\r\nfor i in range(1, (n * n) // 2 + 1):\r\n print(i, n * n - i + 1)", "n = int(input())\r\nz = 1\r\nk = pow(n,2)\r\np = n\r\nwhile(n!=0):\r\n c = [0 for i in range(p)]\r\n for i in range(len(c)):\r\n if(i%2==0):\r\n c[i] = z\r\n z+=1\r\n else:\r\n c[i] = k\r\n k-=1\r\n print(*c)\r\n n-=1\r\n", "n = int(input())\nx = n ** 2\noutput = []\ncurrent = 0\nfor i in range(x // 2):\n output.append(i + 1)\n output.append(x - i)\n current += 2\n if current == n:\n print(' '.join(str(i) for i in output))\n current = 0\n output = []\n", "n=int(input())\r\nans=[[0]*(n) for i in range(n)]\r\ncnt=1\r\nfor j in range(n):\r\n if j%2==0:\r\n for i in range(n):\r\n ans[i][j]=cnt\r\n cnt+=1\r\n else:\r\n for i in range(n-1,-1,-1):\r\n ans[i][j]=cnt\r\n cnt+=1\r\nfor i in ans:\r\n print(*i)", "if __name__=='__main__':\r\n N = int(input())\r\n st = 1\r\n en = N*N\r\n for i in range(N):\r\n for j in range(N//2):\r\n print (st,end=\" \")\r\n st+=1\r\n print (en,end=\" \")\r\n en-=1\r\n print()\r\n", "n = int(input())**2\r\nfor x in range(1,n//2+1):\r\n print(x,n-x+1)\r\n", "import sys\n\nn = int(sys.stdin.readline())\nbags = [i for i in range(1,n*n+1)]\ni = 0\nj = n*n-1\nfor b in range(n*(n//2)):\n print(bags[i], bags[j])\n i += 1\n j -= 1\n", "n = int(input()) ** 2\nfor i in range(n // 2): print(i + 1, n - i)", "n = int(input())\r\n\r\nrn = n*n\r\n\r\nfor i in range(1, rn//2+1):\r\n print(i, rn-i+1)", "n = int(input())\nfor i in range(1, n + 1):\n for j in range(n // 2):\n print(i + 2 * j * n, 2 * (j + 1) * n - i + 1, end=' ')\n print()\n", "# https://codeforces.com/problemset/problem/334/A\n\nn = int(input())\nfor i in range((n * n) // 2):\n print(i + 1, (n * n) - i)\n", "n=int(input())\r\nlst=[]\r\nmat=[]\r\nans=[]\r\nfor i in range(1,(n*n)+1):\r\n lst.append(i)\r\nd=len(lst)\r\nfor i in range(len(lst)//2):\r\n mat.append(lst[i])\r\nfor i in range(d-1,(len(lst)//2)-1,-1):\r\n ans.append(lst[i])\r\nfor i in range(len(mat)):\r\n print(mat[i],ans[i])\r\n", "n = int(input())\r\nc = 1\r\nfor i in range(0, n):\r\n for j in range(n // 2):\r\n print(f\"{c} {n * n - c + 1} \", end=\"\")\r\n c += 1\r\n print()\r\n", "n=int(input())\r\nend=n*n\r\ntotal=(end*(end+1))/2\r\ndiv=total/n\r\nl1=[]\r\nfor i in range(1,end+1):\r\n l1.append(i)\r\nn=len(l1)\r\nfor i in range(int(n/2)):\r\n print(l1[i] , l1[n-1-i])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\nk = [i for i in range(1, n**2 + 1)]\r\n\r\nfor i in range(n):\r\n for j in range(n//2):\r\n print(k[i*(n//2)+j], k[n**2-(i*n//2+j) - 1], end=\" \")\r\n print()", "# import sys\r\n# sys.stdin=open('Python\\input.txt','r')\r\n# sys.stdout=open('Python\\output.txt','w')\r\n\r\nn=int(input())\r\nl=[i for i in range(1,n*n+1)]\r\nm=n//2\r\nfor i in range(0,(n**2)//2,m):\r\n # print(i)\r\n print(*l[i:i+m],*l[(n**2)-i-m:(n**2)-i])\r\n\r\n # print(sum(l[i:i+m]+l[(n**2)-i-m:(n**2)-i]))", "a = int(input())\r\nb = a ** 2\r\n\r\nfor i in range(1, b//2+1):\r\n print(i, (b-i)+1, \"\", end=\"\")\r\n if i % (a // 2) == 0:\r\n print()", "n=int(input())\r\nl,h=1,n**2\r\nfor i in range(n):\r\n s=\"\"\r\n for j in range(n//2):s+=str(l)+' '+str(h)+' ';l+=1;h-=1\r\n print(s)", "n = int(input())\r\nk, N = n // 2, n ** 2\r\n\r\nfor i in range(n):\r\n for j in range(1, k + 1):\r\n num = k * i + j\r\n print(num, N - num + 1, end=' ')\r\n print()", "n = int(input())\r\nx=1\r\nfor i in range(n):\r\n for j in range(n//2):\r\n print(x, n*n-x+1,end=' ')\r\n x+=1\r\n print()\r\n", "n=int(input())\r\na=(n**2)+1\r\nl=[]\r\nc=0\r\nfor i in range(1,n*n+1):\r\n l.append(i)\r\n l.append(a-i)\r\n#l=l[:a-1]\r\nfor i in range(0,len(l),n):\r\n if c<n:\r\n print(*l[i:i+n])\r\n c+=1\r\n else:\r\n break", "N = int(input())\r\nL = 1\r\nM = N ** 2\r\nfor i in range(N):\r\n for j in range(N // 2):\r\n print(L, end=\" \")\r\n L += 1\r\n for k in range(N // 2):\r\n print(M, end=\" \")\r\n M -= 1\r\n print(\"\")\r\n", "n = int(input())\nn_sqr = n**2\n\nr = range(1, n**2+1)\n\nfor i in range(n_sqr//2):\n print(r[i], r[n_sqr-1-i])\n", "n=int(input())\r\na=[int(i) for i in range(1,n*n+1)]\r\nb=a[:round(n*n/2)]\r\nc=a[round(n*n/2):]\r\nc=c[::-1]\r\nfor i in range(n):\r\n for i in range(round(n/2)):\r\n print(b.pop(0),c.pop(0),end=' ')\r\n print()", "n = int(input())\r\nsps_L = []\r\nsps_R = [] \r\ntemp = []\r\n\r\nfor i in range (1, (n**2)//2 + 1):\r\n if len(temp) != n // 2:\r\n temp.append(str(i))\r\n else:\r\n sps_L.append(temp)\r\n temp = []\r\n temp.append(str(i))\r\nelse:\r\n sps_L.append(temp)\r\n temp = []\r\n \r\nfor i in range (n ** 2, (n**2)//2, -1):\r\n if len(temp) != n // 2:\r\n temp.append(str(i))\r\n else:\r\n sps_R.append(temp)\r\n temp = []\r\n temp.append(str(i))\r\nelse:\r\n sps_R.append(temp)\r\n\r\nfor i in range (n):\r\n temp = sps_L[i] + sps_R[i]\r\n for j in temp:\r\n print (j + ' ', end='')\r\n print ()", "n = int(input())\r\npart = n * (1 + n * n) // 2\r\nbags = [1] * (n * n)\r\n#gifts = []\r\nk = n // 2\r\nfor i in range(0, n * n):\r\n bags[i] += i\r\nrev_bags = bags[::-1]\r\nfor i in range(0, n):\r\n #gifts.append(bags[i * k: (i + 1) * k] + rev_bags[i * k: (i + 1) * k]) \r\n print(\" \".join(str(s) for s in (bags[i * k: (i + 1) * k] + rev_bags[i * k: (i + 1) * k])))", "n = int(input())\r\nbags = []\r\n\r\nfor i in range(1, n**2+1):\r\n\tbags.append(i);\r\nbrothers = []\r\nfor i in range(n):\r\n brothers.append([])\r\ni=0\r\nwhile(i < int(n/2)):\r\n j=0\r\n while(j < n):\r\n brothers[j].append(bags[0])\r\n brothers[j].append(bags[-1])\r\n bags.pop(0)\r\n bags.pop()\r\n j = j+1\r\n i = i+1\r\n\r\n\r\nfor brother in brothers:\r\n s = \"\"\r\n for bag in brother:\r\n s += str(bag)+\" \"\r\n print(s)\r\n", "n = int(input())\r\ncandies = []\r\nfor pair in zip(range(1, n * n // 2 + 1), range(n * n, 0, -1)):\r\n candies.extend(pair)\r\n if len(candies) == n:\r\n print(*candies)\r\n candies.clear()\r\n", "def process():\r\n n = int(input())\r\n \r\n arr = []\r\n temp = []\r\n \r\n for i in range(1, n*n + 1):\r\n temp.append(i)\r\n if len(temp) == n:\r\n if len(arr) % 2 != 0:\r\n temp.sort(reverse=True)\r\n arr.append(temp)\r\n temp = []\r\n \r\n for col in range(n):\r\n temp = []\r\n for row in range(n):\r\n temp.append(str(arr[row][col]))\r\n print(' '.join(temp))\r\n \r\nprocess()", "n=int(input())\r\nk=1\r\nfor i in range(1,n+1):\r\n for j in range(int(n/2)):\r\n print(k,n**2-k+1,end=' ')\r\n k+=1\r\n print()\r\n", "n=int(input())\r\nfor i in range(n):\r\n print (i+1,end= ' ')\r\n for j in range(1,n):\r\n print (n*j+(i+j)%n+1,end=' ')\r\n print()\r\n", "n=int(input())\r\np=1\r\nq=n**2\r\nfor i in range(n):\r\n for j in range(n//2):\r\n print(p,q,end=' ')\r\n p+=1\r\n q-=1\r\n print()", "n = int(input())\r\ncnt1 = 1\r\ncnt2 = n ** 2\r\narr = []\r\nfor i in range(n * n // 2):\r\n arr.append([cnt1, cnt2])\r\n cnt1 += 1\r\n cnt2 -= 1\r\nfor i in range(0, len(arr), n // 2):\r\n for j in range(n // 2):\r\n print(arr[i + j][0], arr[i + j][1], sep=' ', end=' ')\r\n print('')", "def f(n): return (n * (n + 1)) >> 1\r\nn = int(input())\r\nnn = n ** 2\r\nl, r = 1, nn\r\nfor u in range(n):\r\n for i in range(n >> 1):\r\n print(l, r, end = \" \")\r\n l, r = l + 1, r - 1\r\n print()", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n\tfor j in range(n//2):\r\n\t\tprint(c+1, n*n-c)\r\n\t\tc += 1", "n = int(input())\r\nsqN = n**2\r\nfor i in range (n):\r\n for j in range(i * int(n / 2) + 1, (i + 1) * int(n / 2) + 1):\r\n print(j, sqN - j + 1, end = ' ')\r\n print()\r\n", "n=int(input())\r\n\r\nl = 1\r\nr = n ** 2\r\n\r\nfor i in range(n):\r\n for j in range(n // 2):\r\n print(str(l) +' ' + str(r),end= ' ')\r\n l +=1\r\n r -= 1\r\n print()", "n = int(input())\r\nstart , endi = 1 , n*n\r\nfor i in range(n):\r\n for j in range(int(n/2)):\r\n print(start,endi , end = \" \" )\r\n start = start+1\r\n endi = endi - 1\r\n print()", "n = int(input())\r\nx = list(range(1, n**2+1))\r\n\r\nfor i in range(n): # number of groups\r\n row = []\r\n offset = i\r\n for j in range(n): # number of elements in each group\r\n idx = n * j + offset\r\n row.append(x[idx])\r\n offset = (offset + 1) % n\r\n\r\n print(\" \".join(map(str, row)))", "n = int(input())\r\na = 1\r\nb = n*n\r\nfor i in range(n):\r\n for j in range(n//2):\r\n print(a,end=\" \")\r\n a+=1\r\n for j in range(n//2):\r\n print(b,end=\" \")\r\n b-=1\r\n print()", "n=int(input())\r\n\r\nt=[i for i in range(1,n**2+1)]\r\na=t[0:len(t)//2]\r\nb=t[len(t)//2:][::-1]\r\n\r\nl=n//2\r\nm=n**2\r\nfor k in range(0,l*n,l):\r\n print(*(a[k:k+n//2]+b[k:k+n//2]))\r\n", "n = int(input())\r\nk = (n ** 2) \r\n\r\ni = 1\r\nj = k\r\nwhile j > i:\r\n print(i, j)\r\n i += 1\r\n j -= 1", "n = int(input())\r\nfor i in range(n):\r\n for j in range(n//2):\r\n print(n*j*2 + i+1, n*(j+1)*2 - i,end=\" \")\r\n print()", "#!/usr/bin/python3\nn = int(input())\nfor i in range(n):\n print(' '.join(str((i*n)//2+j+1) for j in range(n//2)), end=' ')\n print(' '.join(str(n**2 - ((i*n)//2+j)) for j in range(n//2)))\n\n", "n=int(input());q=n*n\r\nfor i in range(1,q//2+1,n//2):\r\n l=[]\r\n for j in range(i,i+n//2):\r\n l.append(j)\r\n l.append(q-j+1)\r\n print(*l)", "n = int(input())\n\nx = n**2\nfor i in range(n):\n for j in range(n//2):\n print(x, n**2-x+1, end=' ')\n x -= 1\n print()\n\n", "n=int(input())\r\nfor i in range((n**2)//2):\r\n\tprint(i+1,(n**2)-i)", "n = int(input())\r\nm ,strt = n*n,1\r\nfor i in range(n):\r\n for j in range(n//2):\r\n print(m,end=\" \")\r\n m-=1\r\n print(strt,end=\" \")\r\n strt+=1\r\n print()\r\n", "n = int(input())\r\nli = []\r\nfor i in range(n**2//2):\r\n li.append(i+1)\r\n li.append(n**2-i)\r\n\r\nfor i in range(0,n**2,n):\r\n for j in range(n):\r\n print(li[i+j],end=\" \")\r\n\r\n print()\r\n", "brothers = int(input())\r\nAmountInBag= []\r\n\r\nfor i in range(1, brothers**2 + 1):\r\n AmountInBag.append(i)\r\n \r\nlst = []\r\nfor x in range(brothers):\r\n lst.append([])\r\n\r\nx = 0\r\ny = 0\r\nfor j in range(brothers**2//2):\r\n lst[y].append(AmountInBag[x])\r\n lst[y].append(AmountInBag[len(AmountInBag) - 1 - x])\r\n x += 1\r\n y += 1\r\n if y > (brothers//2 + 1):\r\n y = 0\r\nfor l in lst:\r\n print(*l)\r\n", "n=int(input())\r\nsq=n*n\r\ns=0\r\ne=sq+1\r\nfor i in range(n):\r\n for j in range(n//2):\r\n print(s+1,end=\" \")\r\n print(e-1)\r\n s=s+1\r\n e=e-1", "n = int(input())\r\nlst = [[int(i*n+j+1) for j in range(n)] for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i+j >= n:\r\n print(lst[j][i+j-n], end=' ')\r\n else:\r\n print(lst[j][i+j], end=' ')\r\n print()\r\n", "n = int(input()); a = []; b = []; k = 0\r\nfor i in range(1,n**2+1): a.append(i)\r\nfor i in range(len(a)//2):\r\n b.append(a[i]); b.append(a[len(a)-i-1])\r\nfor i in range(len(b)):\r\n print(b[i],end = \" \")\r\n if (k+1) % n == 0 and k != 0:\r\n print()\r\n k += 1", "n=int(input())\r\ns=0\r\na,b=[],[]\r\nfor i in range(1,n**2//2+1):\r\n\tb.append(i)\r\nfor j in range(n**2,n**2//2,-1):\r\n\ta.append(j)\r\nfor i in range(len(a)):\r\n\tprint(a[i],b[i])", "n=int(input())\r\nave=(n*n*n+n)/2\r\na=[i for i in range(1,n*n+1)]\r\n\r\nfor j in range(n):\r\n for k in range(int(n/2)):\r\n print(a.pop(0))\r\n print(a.pop())\r\n\r\n \r\n", "n = int(input())\r\nfor i in range(0, n*n + 1):\r\n print(i + 1, \" \", n*n - i)\r\n if (i + 1 == n*n // 2):\r\n break", "w = int(input())\r\nl = []\r\nfor x in range(1,int(w**2)//2+1):\r\n l.append(str(x))\r\n l.append(str(int(w**2)+1-x))\r\n#print(l)\r\nfor x in range(0,int(w**2),w):\r\n a = ' '.join(l[x:x+w])\r\n print(a)\r\n\r\n\r\n \r\n \r\n\r\n ", "num =int(input())\r\nlist = list(range(1,(num)*(num)+1))\r\na=[]\r\nfor i in range(num):\r\n for j in range(int(num/2)):\r\n a.append(list[j+(int(i*num/2))])\r\n a.append(list[len(list)-1-j-(int(i*num/2))])\r\n print(*a)\r\n a=[]", "n = int(input())\r\nmidpoint = n**2//2\r\nnumbers = []\r\nfor i in range(1, midpoint+1):\r\n numbers.append(i)\r\n numbers.append(n**2+1-i)\r\nchildren = [numbers[i:i+n] for i in range(0, n**2, n)]\r\nfor child in children:\r\n for x in child:\r\n print(x, end=' ')\r\n print()\r\n", "i=int(input())\r\n\r\nl=[x for x in range(1,i*i+1)]\r\n\r\nfor x in range(len(l)//2):\r\n print(l[x],l[i*i-x-1])\r\n \r\n", "n=int(input())\r\nx=n*n\r\narr=list(range(1,x+1))\r\n#print(arr)\r\nl=0\r\nr=x-1\r\nwhile l<=r:\r\n ans=[arr[l],arr[r]]\r\n print(*ans)\r\n l+=1\r\n r-=1\r\n", "n = int(input())\r\nl = [i for i in range(1,n ** 2 + 1)]\r\nfor i in range(n):\r\n res = []\r\n for j in range(n // 2):\r\n res.append(l[0])\r\n l.pop(0)\r\n res.append(l[-1])\r\n l.pop(-1)\r\n print(*res)", "n=int(input())\na=[]\nfor i in range(1,n**2+1):\n a.append(i)\n\nans=[]\n\nfor i in range(n):\n ans.append([])\n\nfor i in range(1,n**2+1,n):\n for j in range(i,i+n):\n ans[j-i].append(j)\n ans=list(ans[n-1:])+list(ans[0:n-1])\n\nfor item in ans:\n print(item[0],end=\"\")\n for i in range(1,n):\n print(\" \"+str(item[i]),end=\"\")\n print(\"\")\n \n \n \n\n" ]

[ "import sys\r\nimport math\r\nc=int(input())\r\n\r\nAns=[]\r\nF=[1]\r\nfor i in range(1,101):\r\n F.append(F[-1]*i)\r\nfor i in range(100):\r\n Ans.append([0]*100)\r\n\r\nprint(100)\r\ncycles=1\r\n\r\nAns[0][1]=1\r\nAns[1][0]=1\r\nAns[1][2]=1\r\nAns[2][1]=1\r\nAns[0][2]=1\r\nAns[2][0]=1\r\n\r\nm=3\r\nwhile(cycles<c):\r\n Ans[0][m]=1\r\n Ans[m][0]=1\r\n inc=1\r\n for j in range(1,m):\r\n Ans[j][m]=1\r\n Ans[m][j]=1\r\n cycles+=inc\r\n inc+=1\r\n if(cycles+inc>c):\r\n break\r\n m+=1\r\n\r\nA=\"\"\r\nfor i in range(100):\r\n for j in range(100):\r\n A+=str(Ans[i][j])\r\n A+=\"\\n\"\r\nsys.stdout.write(A)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import comb\r\nfrom bisect import bisect\r\n\r\nd = []\r\ne = [0]\r\nfor i in range(1, 100):\r\n d.append(comb(i, 3))\r\n e.append(e[-1]+i)\r\n\r\nn = int(input())\r\na = bisect(d, n)\r\nb = n-d[a-1]\r\nq = []\r\nwhile b:\r\n c = bisect(e, b)\r\n b = b-e[c-1]\r\n q.append(c)\r\n\r\n\r\nf = []\r\nfor i in range(a):\r\n f.append('1'*i + '0' + '1'*(a-i-1))\r\nfor i in q:\r\n f.append('1'*i + '0'*(len(f[0])-i))\r\n ii = i\r\n for j in range(len(f)):\r\n if ii > 0:\r\n ii -= 1\r\n f[j] += '1'\r\n else:\r\n f[j] += '0'\r\nprint(len(f[0]))\r\nfor i in f:\r\n print(i)\r\n", "# https://codeforces.com/contest/232/problem/A\r\n# WA \r\n\r\ndef f_3(n):\r\n return n * (n-1) * (n-2) // 6\r\n\r\ndef f_2(n):\r\n return n * (n-1) // 2\r\n\r\na_3 = [f_3(i) for i in range(100)]\r\na_2 = [f_2(i) for i in range(100)]\r\n\r\ndef find_2(x, a):\r\n arr = []\r\n cur = len(a) - 1\r\n \r\n while x > 0:\r\n while x < a[cur]:\r\n cur -= 1\r\n arr.append(cur)\r\n x -= a[cur]\r\n \r\n return arr\r\n\r\ndef find_3(x, a):\r\n cur = len(a) - 1\r\n \r\n while x < a[cur]:\r\n cur -= 1\r\n \r\n x -= a[cur]\r\n\r\n return cur, x \r\n\r\ndef build(x):\r\n base, remain = find_3(x, a_3)\r\n arr = find_2(remain, a_2)\r\n \r\n n = base \r\n #print(base, arr)\r\n \r\n if len(arr) > 0:\r\n n += len(arr)\r\n \r\n m = [[0]*n for _ in range(n)]\r\n\r\n for i in range(base):\r\n for j in range(base):\r\n if i == j:\r\n continue\r\n m[i][j] = 1\r\n m[j][i] = 1\r\n \r\n for i, x in enumerate(arr):\r\n for j in range(x):\r\n m[base+i][j] = 1\r\n m[j][base+i] = 1\r\n \r\n return m \r\n\r\ndef pr(m):\r\n for i in range(len(m)):\r\n print(''.join([str(x) for x in m[i]]))\r\n\r\nk = int(input())\r\nm = build(k)\r\n\r\nprint(len(m))\r\npr(m)", "k = int(input())\r\np = [['0'] * 100 for i in range(100)]\r\nj = n = 0\r\nwhile j < k:\r\n for i in range(n):\r\n if j + i > k: break\r\n p[n][i] = p[i][n] = '1'\r\n j += i\r\n n += 1\r\nprint(n)\r\nfor i in range(n): print(''.join(p[i][:n]))", "n, k = 0, int(input())\r\np = [['0'] * 100 for i in range(100)]\r\nwhile k:\r\n for i in range(n):\r\n if i > k: break\r\n p[n][i] = p[i][n] = '1'\r\n k -= i\r\n n += 1\r\nprint(n)\r\nfor i in range(n): print(''.join(p[i][:n]))", "k,n=int(input()),0\r\na=[['0']*100 for i in range(100)]\r\nwhile k>0:\r\n for i in range(n):\r\n if i>k: break\r\n a[n][i]=a[i][n]='1'\r\n k-=i\r\n n+=1\r\nprint(n)\r\nfor i in range(n): print(''.join(a[i][:n]))\r\n", "k = int(input())\r\nn = 0\r\nmat = [['0'] * 100 for i in range(100)]\r\nwhile k:\r\n for i in range(n):\r\n if i > k:\r\n break\r\n mat[n][i] = mat[i][n] = '1'\r\n k -= i\r\n n += 1\r\nprint(n)\r\nfor i in range(n):\r\n print(''.join(mat[i][:n]))", "n , k = 0 , int(input())\r\np=[['0']*100 for i in range(100)]\r\nwhile k:\r\n\tfor i in range(n):\r\n\t\tif i>k:\r\n\t\t\tbreak\r\n\t\tp[n][i]=p[i][n]='1'\r\n\t\tk=k-i\r\n\tn+=1\r\nprint(n)\r\nfor i in range(n): print(''.join(p[i][:n]))" ]

[ "import sys,math\r\n#sys.stdin=open('input.txt','r')\r\n#sys.stdout=open('output.txt','w')\r\n\r\n\r\ndef solve():\r\n n,a,b=map(int,input().split())\r\n ans=0\r\n for i in range(1,n):\r\n mina=a//i\r\n minb=b//(n-i)\r\n ans1=min(mina,minb)\r\n ans=max(ans,ans1)\r\n print(ans)\r\n\r\n\r\nsolve()\r\n", "R = lambda: map(int, input().split())\r\nn, a, b = R()\r\nprint(max([min(a // x if x else 0, b // (n - x) if x != n else 0) for x in range(0, n + 1)]))", "n,a,b=map(int,input().split())\r\na,b=max(a,b),min(a,b)\r\nres=b\r\nb1=b//res\r\nwhile n>b//res+a//res:\r\n\tres-=1\r\nprint(res)\r\n", "# collaborated with Rudransh and Fatima\n\ninp = input()\nn, a , b = inp.split(\" \")\nn = int(n)\na = int(a)\nb = int(b)\npieces = 0\ntemp = a\nif a > b:\n a = b\n b = temp\nfor i in range(1, a+1):\n if(int(a/i) + (b/i)) >= n:\n pieces = max(pieces, i)\nprint(pieces)\n \t \t \t \t \t \t\t\t\t \t \t\t\t", "#Problem Set D: Collaborated with no one\n\ns = list(map(int, input().split()))\n\n#no. of pieces from cake 1\nif int(s[1]) >= 1 and int(s[1]) <= 100:\n a = int(s[1])\n\n#no. of pieces from cake 2\nif int(s[2]) >= 1 and int(s[2]) <= 100:\n b = int(s[2])\n \n \n#no. of plates\nif int(s[0]) >= 2 and int(s[0]) <= (a+b):\n n = int(s[0])\n \n \ncake_count = 0\n\nif a > b:\n a,b = b,a\n\nfor i in range(1, a+1):\n if a//i + b//i >= n:\n cake_count = max(i, cake_count)\n \nprint(cake_count)\n \t\t \t\t \t\t\t\t \t \t\t \t\t \t\t", "n,a,b=map(int,input().split())\r\ndef check(x):\r\n one=a \r\n two=b \r\n for i in range(n): \r\n if one>=x :\r\n one-=x \r\n elif two>=x:\r\n two-=x \r\n else:\r\n return 0 \r\n return 1 \r\nlo=0 \r\nhi=200 \r\nans=0 \r\nwhile lo<=hi:\r\n mi=(lo+hi)>>1 \r\n if check(mi):\r\n ans=mi \r\n lo=mi +1 \r\n else:\r\n hi=mi-1 \r\n#(ans)\r\nif ans>min(a,b):\r\n ans=min(a,b)\r\nprint(ans)", "#!/usr/bin/env python3\n\nn, a, b = map(int, input().split())\nx = max(min(a // i, b // (n-i)) for i in range(1, n))\nprint(x)", "def main():\r\n n, a, b = map(int, input().split())\r\n\r\n confs = []\r\n for i in range(1, n):\r\n cake1 = a // i\r\n cake2 = b // (n - i)\r\n\r\n confs.append(min(cake1, cake2))\r\n \r\n print(max(confs)) \r\n\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "n,a,b = map(int,input().split())\nans=-1\nfor x in range(1,n):\n ans=max(ans,min(a//x,b//(n-x)))\nprint (ans)\n", "import math\r\nn,a,b = map(int,input().split())\r\n\r\n \r\ni =1\r\nm = -1\r\nwhile (i < n):\r\n x = a//i\r\n y = b//(n-i)\r\n #print(x,y)\r\n if min(x,y) > m :\r\n m = min(x,y)\r\n #print(m)\r\n i+=1 \r\nprint(m)", "n, a, b = [int(i) for i in input().split()]\r\nr = 0\r\n\r\nfor i in range(1, n):\r\n fora = i\r\n forb = n - i\r\n\r\n r = max(r, min(a // fora, b // forb))\r\nprint(r)", "n, a, b = map(int, input().split())\r\nprint(max(map(lambda x: min(a // x, b // (n - x)), range(1, n))))", "n,a,b=list(map(int,input().split()))\r\nans=1\r\nfor i in range(1,n):\r\n m=min(a//i,b//(n-i))\r\n ans=max(ans,m)\r\nprint(ans)", "n,a,b=map(int,input().split())\ndef good(x):\n\treturn x<=a and x<=b and a//x+b//x>=n\ndef solve(n,a,b):\n\tl=1;r=max(a,b)+1\n\twhile r-l>1:\n\t\tm=(l+r)//2\n\t\tif good(m):\n\t\t\tl=m\n\t\telse:\n\t\t\tr=m\n\treturn l\nprint(solve(n,a,b))\n\n", "n, a, b = list(map(int,input().split()))\r\nmax = 0\r\nfor i in range(1, n):\r\n x = a // i\r\n y = b // (n - i)\r\n if x < y:\r\n y = x\r\n if y > max:\r\n max = y\r\nprint(max)", "from math import ceil\r\nn,a,b=map(int,input().split())\r\nm=1\r\nfor i in range(1,n):\r\n\tif i<=a:\r\n\t\tif n-i<=b:\r\n\t\t\tm=max(m,min(a//i,b//(n-i)))\r\nprint(m)\r\n", "# DEFINING SOME GOOD STUFF\nfrom math import *\nimport threading\nimport sys\n\nmod = 10 ** 9\ninf = 10**6\nyes = 'YES'\nno = 'NO'\n\n# _______________________________________________________________#\n\ndef npr(n, r):\n return factorial(n) // factorial(n - r) if n >= r else 0\n\n\ndef lower_bound(li, num):\n answer = -1\n start = 0\n end = len(li) - 1\n\n while (start <= end):\n middle = (end + start) // 2\n if li[middle] >= num:\n answer = middle\n end = middle - 1\n else:\n start = middle + 1\n return answer # min index where x is not less than num\n\n\ndef upper_bound(li, num):\n answer = -1\n start = 0\n end = len(li) - 1\n\n while (start <= end):\n middle = (end + start) // 2\n\n if li[middle] <= num:\n answer = middle\n start = middle + 1\n\n else:\n end = middle - 1\n return answer # max index where x is not greater than num\n\n\ndef abs(x):\n return x if x >= 0 else -x\n\n\ndef binary_search(li, val, lb, ub):\n ans = -1\n while (lb <= ub):\n mid = (lb + ub) // 2\n # print(mid, li[mid])\n if li[mid] > val:\n ub = mid - 1\n elif val > li[mid]:\n lb = mid + 1\n else:\n ans = mid # return index\n break\n return ans\n\n\ndef kadane(x): # maximum sum contiguous subarray\n sum_so_far = 0\n current_sum = 0\n for i in x:\n current_sum += i\n if current_sum < 0:\n current_sum = 0\n else:\n sum_so_far = max(sum_so_far, current_sum)\n return sum_so_far\n\n\ndef pref(li):\n pref_sum = [0]\n for i in li:\n pref_sum.append(pref_sum[-1] + i)\n return pref_sum\n\n\ndef graph(n, m):\n adj = dict()\n for i in range(1, n + 1):\n adj.setdefault(i, 0)\n for i in range(m):\n a, b = map(int, input().split())\n adj[a] += 1\n adj[b] += 1\n return adj\n\n\ndef SieveOfEratosthenes(n):\n prime = [True for i in range(n + 1)]\n p = 2\n li = []\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\n for p in range(2, len(prime)):\n if prime[p]:\n li.append(p)\n return li\n\n\ndef primefactors(n):\n factors = []\n while (n % 2 == 0):\n factors.append(2)\n n //= 2\n for i in range(3, int(sqrt(n)) + 1, 2): # only odd factors left\n while n % i == 0:\n factors.append(i)\n n //= i\n if n > 2: # incase of prime\n factors.append(n)\n return factors\n\n\ndef prod(li):\n ans = 1\n for i in li:\n ans *= i\n return ans\n\n\ndef dist(a,b):\n d = abs(a[1]-b[1]) + abs(a[2]-b[2])\n return d\n\n\ndef power_of_n(x, n):\n cnt = 0\n while(x%n == 0):\n cnt += 1\n x //= n\n return cnt\n\n\n# _______________________________________________________________#\n\nimport itertools\n\nsys.setrecursionlimit(300000)\n# threading.stack_size(10**5) # remember it cause mle\n# def main():\n\nfor _ in range(1):\n#for _ in range(int(input())):\n #n = int(input())\n n, a, b = map(int, input().split())\n #s = list(input())\n #s = [int(x) for x in s]\n #a = list(map(int, input().split()))\n #b = list(map(int,input().split()))\n # s = input()\n # c = list(map(int,input().split()))\n # adj = graph(n,m)\n ans = 0\n #print(n,a,b)\n for i in range(1, n):\n ans = max(min(a//i, b//(n-i)), ans)\n print(ans)\n\n\n\n\n\n\n\n\n\n\n\n\n\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n'''\t\t\nt = threading.Thread(target=main)\nt.start()\nt.join()\n'''", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n, a, b = map(int, input().split(' '))\n \n for x in range(min(a, b), 0, -1):\n if (a // x + b // x >= n):\n print(x)\n return\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n\t\t \t\t \t \t \t\t\t\t \t \t \t\t \t\t \t", "a,b,c=map(int,input().split())\r\nval=0\r\nfor i in range(1,a):\r\n t=min(b//i,c//(a-i))\r\n val=max(val,t)\r\nprint(val)", "import sys\r\n\r\ndef FileIO():\r\n sys.stdin=open(\"input.txt\",'r')\r\n sys.stdout=open(\"output.txt\",'w')\r\n\r\n# FileIO()\r\n\r\nn,a,b=map(int,input().split())\r\nans=0\r\nfor i in range(1,n):\r\n ans=max(ans,min(a//i,b//(n-i)))\r\nprint(ans)", "n, a, b = map(int, input().split())\r\nx = 1 \r\nm = 1 \r\nwhile(x < n):\r\n if((n - x) <= b):\r\n s = a // x * x + b // (n - x) * (n - x)\r\n if(s <= (a + b)):\r\n m = max(m, min(a // x, b // (n - x)))\r\n x += 1 \r\nprint(m)", "for i in range(1):\r\n n,m,k=map(int,input().split())\r\n s=1\r\n x=0\r\n while n-s>0:\r\n z=min(m//s,k//(n-s))\r\n x=max(x,z)\r\n s+=1\r\n print(x)\r\n", "n,a,b=map(int,input().split())\r\nmini=1\r\nwhile(a//mini+b//mini>=n and a//mini>=1 and b//mini>=1):\r\n mini+=1\r\nprint(max(mini-1,1))\r\n", "#!/usr/bin/env python\r\n# coding=utf-8\r\nn,a,b = map(int,input().split())\r\nt = -1\r\nif a<b :\r\n t=a\r\nelse :\r\n t = b\r\nwhile t>0:\r\n if a//t+b//t>=n:\r\n print(t)\r\n break\r\n t=t-1\r\n", "# region smaller_fastio\r\nfrom sys import stdin, stdout\r\nfrom os import path\r\n\r\nif path.exists('input.txt'):\r\n # ------------------Sublime--------------------------------------#\r\n stdin = open('input.txt', 'r')\r\n stdout = open('output.txt', 'w')\r\n\r\n\r\n def I():\r\n return int(input())\r\n\r\n\r\n def In():\r\n return map(int, input().split())\r\nelse:\r\n # ------------------PYPY FAst I/o--------------------------------#\r\n def I():\r\n return int(stdin.readline())\r\n\r\n\r\n def In():\r\n return map(int, stdin.readline().split())\r\n\r\n\r\n def S():\r\n return stdin.readline().rstrip()\r\n\r\n\r\n def Sn():\r\n return stdin.readline().split(' ')\r\n\r\n\r\ndef Out(whatever):\r\n return stdout.write(whatever)\r\n\r\n\r\n# endregion\r\n\r\n\r\nif __name__ == '__main__':\r\n n, a, b = In()\r\n Out(str(max([min((a // x), b // (n - x)) for x in range(1, n)])))\r\n", "n, a, b = list(map(int, input().split()))\r\n\r\nfor i in range(1,101,1):\r\n if a//i >0 and b//i >0 and a//i + b//i >= n:\r\n continue\r\n else:\r\n print(i-1)\r\n break\r\n\r\n\r\n\r\n", "#collaborated with fatima and prasoon \nline=input()\narray=line.split()\nn=int(array[0])\na=int(array[1])\nb=int(array[2])\nanswer=0\ntemp=a\nif a>b:\n a=b\n b=temp\nfor i in range(1,a+1):\n if (a//i + b//i)>=n:\n answer=max(i,answer)\nprint(answer)\n \t \t \t \t \t\t\t\t \t", "n, a, b = [int(x) for x in input().split()]\r\n#print (int((a + b) / n + 1))\r\nfor mi in range(int((a + b) / n), 0, -1):\r\n\t#print (mi)\r\n\tif mi > a or mi > b: \r\n\t\tcontinue\r\n\tc1 = int(a / mi)\r\n\tc2 = int(b / mi)\r\n\tif (c1 + c2 >= n):\r\n\t\tprint (mi)\r\n\t\tbreak\r\n", "# maa chudaaye duniya\r\nn, a, b = map(int, input().split())\r\nj = -10**9\r\nfor _ in range(1, n):\r\n j = max(j, min(a//_, b//(n-_)))\r\nprint(j)", "n,a,b=map(int,input().split())\r\nans=0\r\nfor i in range(1,n):\r\n ans=max(ans,min(a//i,b//(n-i) ) )\r\nprint(ans) \r\n ", "import sys,math,itertools\r\nfrom collections import Counter,deque,defaultdict\r\nfrom bisect import bisect_left,bisect_right \r\nfrom heapq import heappop,heappush,heapify, nlargest\r\nfrom copy import deepcopy\r\nmod = 10**9+7\r\nINF = float('inf')\r\ndef inp(): return int(sys.stdin.readline())\r\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\r\ndef inpl_1(): return list(map(lambda x:int(x)-1, sys.stdin.readline().split()))\r\ndef inps(): return sys.stdin.readline()\r\ndef inpsl(x): tmp = sys.stdin.readline(); return list(tmp[:x])\r\ndef err(x): print(x); exit()\r\n\r\nn,a,b = inpl()\r\nres = 0\r\nfor A in range(1,n):\r\n B = n-A\r\n resa = a//A; resb = b//B\r\n ans = min(resa, resb)\r\n if ans:\r\n res = max(res, ans)\r\nprint(res)", "n,a,b=map(int,input().split())\r\nt=1 \r\nwhile a//t+b//t>=n:\r\n t+=1 \r\nif a//t+b//t==n:\r\n if t>a or t>b:\r\n print(min(a,b))\r\n else:\r\n print(t)\r\nelse:\r\n if t-1>a or t-1>b:\r\n print(min(a,b))\r\n else:\r\n print(t-1)\r\n", "import sys\r\nn, a, b = (int(x) for x in input().split())\r\ni, st = 1, min(a, b)\r\nwhile i <= st and a // i + b // i >= n:\r\n i += 1\r\nprint(i - 1)\r\n\r\n", "n,a,b=map(int,input().split())\r\nans=1\r\nwhile 1:\r\n if ans>a or ans>b:\r\n ans-=1\r\n break\r\n if (a//ans)+(b//ans)>=n:\r\n ans+=1\r\n else:\r\n ans-=1\r\n break\r\nprint(ans)\r\n", "def main_function():\r\n n, a, b = [int(i) for i in input().split(\" \")]\r\n x = 0\r\n for i in range(1, n):\r\n a_s = i\r\n b_s = n - i\r\n #print(a_s, b_s)\r\n inter_x = min(a // a_s, b// b_s)\r\n #print(inter_x)\r\n if inter_x > x:\r\n x = inter_x\r\n print(x)\r\nmain_function()", "n,a,b=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(1,n):\r\n\tarr.append(min((a//(i),b//(n-i))))\r\nprint(max(arr))", "n,a,b = map(int,input().split())\r\nfans = 0\r\nfor i in range(1,min(n,a+1)):\r\n if(b<n-i):\r\n continue\r\n an = min(b//(n-i),a//i)\r\n fans = max(an,fans)\r\nprint(fans)\r\n\r\n\r\n", "n, a, b = map(int, input().split())\r\nmx = -1\r\nfor x in range(1, min(a, b) + 1):\r\n if a // x + b // x >= n:\r\n mx = max(mx, x)\r\nprint(mx)", "# [https://codeforces.com/blog/entry/56771 <- https://codeforces.com/problemset/problem/911/B <- https://algoprog.ru/material/pc911pB]\r\n\r\n(n, a, b) = map(int, input().split())\r\n\r\nans = 0\r\nfor x in range(1, n):\r\n ans = max(ans, min(a // x, b // (n-x)))\r\n\r\nprint(ans)", "n,a,b = map(int,input().split())\r\n\r\nlis = []\r\nfor i in range(1,n):\r\n\r\n\tif (n-i)<=b:\r\n\t\tlis.append(min(a//i,b//(n-i)))\r\n\r\nprint(max(lis))\r\n", "def solve():\r\n n, a, b = [int(x) for x in input().split(' ')]\r\n\r\n def good(z):\r\n return a >= z and b >= z and a // z + b // z >= n\r\n\r\n l = 1\r\n r = max(a, b) + 1\r\n while r - l > 1:\r\n m = (l + r) // 2\r\n if good(m):\r\n l = m\r\n else:\r\n r = m\r\n\r\n return l\r\n\r\nprint(solve())\r\n\r\n", "def solution():\n res = -1\n for i in range(1, _n+1):\n for j in range(1, _n+1):\n if i + j == _n:\n res = max(min(_a // i, _b // j), res)\n return res\n\n\nif __name__ == '__main__':\n _n, _a, _b = map(int, input().rstrip().split())\n print(solution())\n", "n, a, b = list(map(int, input().split()))\r\nans = min(a, b)\r\n\r\n# print(ans, a, b, a/ans, b/ans)\r\nwhile 1:\r\n p = a//ans\r\n q = b//ans\r\n # and p != 0 and q != 0\r\n if(p + q >= n):\r\n print(ans)\r\n break\r\n else:\r\n ans -= 1\r\n", "def main():\r\n\tinputs = input().split()\r\n\r\n\tinputs = [int(x) for x in inputs]\r\n\r\n\r\n\tn = inputs[0]\r\n\ta = inputs[1]\r\n\tb = inputs[2]\r\n\r\n\tfor i in range(1,150):\r\n\t\tif(i*n > a + b):\r\n\t\t\tprint(i - 1)\r\n\t\t\treturn\r\n\t\telse:\r\n\t\t\tfirstSet = a//i\r\n\t\t\tsecondSet = b//i\r\n\t\t\tif(firstSet == 0 or secondSet == 0):\r\n\t\t\t\tprint( i - 1)\r\n\t\t\t\treturn\r\n\t\t\tif(firstSet + secondSet >= n):\r\n\t\t\t\tcontinue\r\n\t\t\telse:\r\n\t\t\t\tprint(i - 1)\r\n\t\t\t\treturn\r\n\t\t\t\t\r\nmain()", "n, a, b = map(int, input().split())\r\ni = a + b\r\nf = 0\r\nwhile 1:\r\n if (a//i) == 0 or (b//i) == 0:\r\n f = 0\r\n elif (a//i) + (b//i) >= n:\r\n print(i)\r\n break\r\n i -= 1", "def check(x):\n return ((pa//x + pb//x) >= n)\n\n\nn, pa, pb = [int(x) for x in input().split()]\n\n\nmx = min(pa, pb)\nmn = 1\nx = (mx + mn)//2\nif(check(mx)):\n print(mx)\nelse:\n while(x > mn):\n if(check(x)): #if x is enough, is new min\n mn = x\n else:\n mx = x\n x = (mx + mn)//2\n\n print(x)\n\t\t\t \t \t \t\t \t \t \t \t\t \t\t \t", "def main():\n N, A, B = map(int, input().split())\n\n if A < N:\n plt_a = A + 1\n else:\n plt_a = N\n\n x = 0\n for i in range(1, plt_a):\n a = A // i\n b = B // (N - i)\n x = max(x, min(a, b))\n\n print(x)\n\nmain()\n", "import bisect\r\n\r\ndef list_output(s): \r\n print(' '.join(map(str, s)))\r\n \r\ndef list_input(s='int'):\r\n if s == 'int':\r\n return list(map(int, input().split())) \r\n elif s == 'float':\r\n return list(map(float, input().split()))\r\n return list(map(str, input().split()))\r\n\r\nn, a, b = map(int, input().split())\r\n\r\nres = 0\r\nfor m in range(1, n):\r\n x = a // m\r\n y = b // (n-m)\r\n res = max(res, min(x, y))\r\nprint(res)\r\n \r\n", "n,a,b=[int(a) for a in input().split()]\r\nmaxi=1\r\nfor i in range(1,n):\r\n e=a//i\r\n f=b//(n-i)\r\n if(min(e,f)>maxi):\r\n maxi=min(e,f)\r\nprint(maxi) \r\n \r\n", "def check(a, b, n, temp):\n\tif a // temp + b // temp >= n:\n\t\treturn True\n\treturn False\n\nm = input().split()\nm1 = [int(i) for i in m]\nn, a, b = m1\n\nans = 1\nlow = 2\nhigh = min(a, b)\nwhile low <= high:\n\tmid = (low + high) // 2\n\tresult = check(a, b, n, mid)\n\tif result == True:\n\t\tans = mid\n\t\tlow = mid + 1\n\telse:\n\t\thigh = mid - 1\n\nprint(ans)\n", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt\r\nfrom collections import deque\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\n')\r\nL=lambda:list(R())\r\nP=lambda x:stdout.write(x)\r\nlcm=lambda x,y:(x*y)//gcd(x,y)\r\nhg=lambda x,y:((y+x-1)//x)*x\r\npw=lambda x:1 if x==1 else 1+pw(x//2)\r\nchk=lambda x:chk(x//2) if not x%2 else True if x==1 else False\r\nsm=lambda x:(x**2+x)//2\r\nN=10**9+7\r\nn,a,b=R()\r\nans=0\r\nfor i in range(1,n):\r\n\tj=n-i\r\n\tans=max(ans,min(a//i,b//j))\r\nprint(ans)", "n,a,b = map(int,input().split())\r\nans = 0\r\nfor i in range(1,n):\r\n if (a//(n-i) and b//i):\r\n ans=max(ans, min(a//(n-i),b//i))\r\nprint(ans)", "n,a,b=list(map(int,input().split()))\r\nk=0\r\nfor i in range(1,n):\r\n v=min(a//i,b//(n-i))\r\n k=max(k,v)\r\nprint(k)\r\n \r\n ", "\r\n\r\nn, a, b = map(int, input().split())\r\nres = 0\r\nfor i in range(1, n):\r\n res = max(res, min(a // i, b // (n - i)))\r\nprint(res)\r\n \r\n", "import sys\r\nn,a,b=map(int,input().split());\r\nmax1=-sys.maxsize;\r\nfor i in range(1,n):\r\n max1=max(max1,min((a//i),b//(n-i)));\r\nprint(max1)\r\n", "n, a, b = [int(x) for x in input().split()]\r\nmins = []\r\nfor i in range(1, n):\r\n tf = i\r\n ts = n - i\r\n mins.append(min(a // tf, b // ts))\r\nprint(max(mins))", "n, a, b = map(int, input().split())\r\nans = max([min(a // k, b // (n - k)) for k in range(1, n)])\r\nprint(ans)\r\n", "n,a,b=map(int,input().split())\r\nx=0\r\nfor i in range(1,n):\r\n if(min(a//i,b//(n-i))>x):\r\n x=min(a//i,b//(n-i))\r\nprint(x)", "n , a , b = map(int , input().split(' '))\r\nmaxx = 0\r\nfor i in range(1 , n):\r\n\tif(i <= a and n - i <= b):\r\n\t\tmaxx = max(maxx , min(a//i , b//(n - i)))\r\nprint(maxx)\r\n", "n,a,b=map(int, input().split())\r\nfr=0\r\nfor i in range(1,n):\r\n fr=max(fr,min(a//i,b//(n-i)))\r\n \r\n \r\nprint(fr)\r\n", "n_a_b = input(\"\")\nn, a, b = list(map(int, n_a_b.split(\" \")))\nmin_distr = list()\n\nif(a + b) == n:\n print(1)\nelse:\n for i in range(1, n):\n c1_split = int(a/i)\n c2_split = int(b/(n-i))\n\n if(c1_split <= c2_split):\n min_distr.append(c1_split)\n else:\n min_distr.append(c2_split)\n\n print(max(min_distr))\n \t \t\t\t \t \t\t \t\t\t\t\t \t\t\t \t", "#n=int(input())\r\n#n,k=map(int,input().split())\r\n#arr=list(map(int,input().split()))\r\n#for _ in range(int(input())):\r\nn,a,b=map(int,input().split())\r\nf=0\r\nfor i in range(1,n):\r\n var=min(a//i,b//(n-i))\r\n f=max(var,f)\r\nprint(f)", "n, a, b = map(int, input().split())\n\nm = 0\nfor ap in range(1, n):\n cm = min(a//ap, b//(n-ap))\n m = max(m, cm)\n \nprint(m)\n", "def fn(Cake,X):\r\n if Cake<X:\r\n return -1\r\n return Cake//X\r\nn,a,b=list(map(int,input().split()))\r\nprint(max([min(fn(a,i),fn(b,n-i)) for i in range(1,n)]))", "from sys import stdin,stdout\r\ninput=stdin.readline\r\nlist1=[int(x) for x in input().split()]\r\n\r\nans=0\r\n\r\nfor i in range(1,list1[0]):\r\n b=min((list1[1]//i),(list1[2]//(list1[0]-i)))\r\n ans=max(ans,b)\r\nprint(ans)\r\n", "def main():\r\n n, a, b = map(int, input().split())\r\n x = find_x(n, a, b)\r\n print(x)\r\n\r\n\r\ndef find_x(plates, a_pieces, b_pieces):\r\n x = min((a_pieces + b_pieces) // plates, a_pieces, b_pieces)\r\n while not x_works(plates, a_pieces, b_pieces, x):\r\n x -= 1\r\n return x\r\n\r\n\r\ndef x_works(plates, a_pieces, b_pieces, x):\r\n return a_pieces // x + b_pieces // x >= plates\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, a, b = [int(s) for s in input().split()]\n\nm = 0\nfor i in range(1, n):\n m = max(m, min(a // i, b // (n - i)))\n\nprint(m)\n", "import math\r\nn,a,b=map(int,input().split())\r\ni=1\r\nm=0\r\nwhile i<n:\r\n p=a//i\r\n q=b//(n-i)\r\n y=min(p,q)\r\n #print(p)\r\n #print(q)\r\n if y>m:\r\n m=y\r\n i=i+1\r\nprint(m)\r\n", "n,a,b=map(int,input().split())\r\nl=[]\r\nfor x in range(1,n):\r\n l.append(min(a//x,b//(n-x)))\r\nprint(max(l))", "n, a, b = input().split()\r\nn, a, b = int(n), int(a), int(b)\r\nans = 0\r\nfor i in range(1,n):\r\n\tans = max(ans,min(int(a/i), int(b/(n-i))))\r\nprint(ans)", "n,a,b=map(int,input().split())\r\nmx=-1\r\nfor i in range(1,n):\r\n mn=min(a//i,b//(n-i))\r\n mx=max(mx,mn)\r\nprint(mx)", "n, a, b = map(int, input().split())\r\nr = 0\r\nfor i in range(1,n):\r\n r = max(r, min(a // i, b // (n-i)))\r\nprint(r)", "n,a1,b1=map(int,input().split())\r\na=min(a1,b1)\r\nb=max(a1,b1)\r\nli=[]\r\nfor i in range(1,n):\r\n if(int(a//i)>0 and int(b//(n-i)>0)):\r\n li.append(min(int(a//i),int(b//(n-i))))\r\nprint(max(li))", "from collections import defaultdict as dd\r\nimport sys\r\ninput=sys.stdin.readline\r\n#n=int(input())\r\nn,a,b=map(int,input().split())\r\nmx=0\r\nfor i in range(1,n):\r\n mx=max(mx,min(a//i,b//(n-i)))\r\nprint(mx)", "n,a,b=map(int,input().split())\r\ny=0\r\nfor x in range(1,n):\r\n u=min(int(a/x),int(b/(n-x)))\r\n if y<u:\r\n y=u\r\n\r\nprint(y)", "n,a,b=list(map(int,input().split()))\r\nk=1\r\nfor i in range(1,min(a,b)+1):\r\n if a//i+b//i>=n: k=i\r\nprint(k)", "def getinput():\n return [int(x) for x in input().strip().split()]\nn,a,b = getinput()\n\nans=0\n\nfor i in range(1,n):\n ans=max(ans, min(a//i, b//(n-i)))\nprint (ans)", "n, a, b = [int(x) for x in input().split()]\r\n\r\n\r\ndef check(x):\r\n if x * n > a + b:\r\n return False\r\n if x > a or x > b:\r\n return False\r\n return a // x + b // x >= n\r\n\r\n\r\nfor i in range(1, a+b+1):\r\n if not check(i):\r\n print(i-1)\r\n break\r\n", "n,a,b = [int(x) for x in input().split()]\r\nminX = 1\r\nfor x in range(1,n):\r\n minX = max(min(a//x, b//(n-x)),minX)\r\nprint(minX)", "n, a, b = map(int, input().split())\r\n\r\nlow = 1\r\nhigh = min(a, b)\r\n\r\nwhile low < high:\r\n mid = (low + high + 1) // 2\r\n total = a // mid + b // mid\r\n if total >= n:\r\n low = mid\r\n else:\r\n high = mid - 1\r\n\r\nprint(low)", "n, a,b = map(int,input().split())\r\nprint(max(min(a//i,b//(n-i)) for i in range(1,n)))", "x,y,c,i,l,s,st,lt=0,0,0,1,[],[],[],[]\r\nn,a,b=map(int,input().split())\r\nif a>=b:\r\n a=a\r\n b=b\r\nelse:\r\n m=a\r\n a=b\r\n b=m\r\nl.append(min((int(a/n)),b))\r\nl.append(min((int(b/n)),a))\r\nn=n-1\r\nwhile True:\r\n r= int(a/n)\r\n l1=int(b/i)\r\n l.append(min(r,l1))\r\n n=n-1\r\n if n==0:\r\n break\r\n i=i+1\r\nprint(max(l))\r\n", "n,a,b = [int(a) for a in input().split()]\r\ni = 1\r\nif a//1 + b//1 < n:\r\n print(i-1)\r\nelse:\r\n while a//i + b//i >= n:\r\n i += 1\r\n if a// i != 0 and b//i != 0:\r\n print(i-1)\r\n elif b // i == 0:\r\n for m in range(1,b+1):\r\n if a//m +b //m < n:\r\n break\r\n i = m\r\n print(i)\r\n elif a // i == 0:\r\n for m in range(1,a+1):\r\n if a//m + b//m < n:\r\n break\r\n i = m \r\n print(i)\r\n ", "if __name__ == \"__main__\":\n n, a, b = [int(a) for a in input().strip().split()]\n max_num = min(a, b)\n while((a //max_num + b // max_num) < n):\n max_num -= 1\n print(str(max_num))\n \t\t \t \t \t\t \t \t \t \t", "\r\ndef find_max_pieces(a, b, n):\r\n if min(a, b)<min(a,b)*2<max(a,b) and n == 2:\r\n print(min(a,b))\r\n quit()\r\n x = min(a//n, b//n)\r\n for i in range(1, n):\r\n x_min = min(a//i, b//(n-i))\r\n x = max(x, x_min)\r\n return x\r\n \r\nn, a, b = map(int, input().split())\r\nmax_pieces = find_max_pieces(a, b, n)\r\nprint(max_pieces)", "n,a,b=(int(i)for i in input().split())\r\nm=0\r\nfor i in range(1,n):\r\n m=max(m,min(a//i,b//(n-i)))\r\nprint(m)\r\n", "import sys\r\nreadline = sys.stdin.readline\r\n\r\nN, A, B = map(int, readline().split())\r\n\r\nans = 0\r\nfor k in range(1, N):\r\n ans = max(ans, min(A//k, B//(N-k)))\r\n\r\nprint(ans)", "n,a,b=map(int, input().split())\r\nans=0\r\nfor i in range(1,n):\r\n ans=max(ans,min(a//i,b//(n-i)))\r\nprint(ans)", "n,a,b = input().split()\r\nn,a,b = int(n),int(a),int(b)\r\nmn = []\r\nfor x in range(1,n):\r\n mn.append(min(a//x,b//(n-x)))\r\nprint(max(mn))", "n,a,b=map(int,input().split())\r\nprint(max([min(a//i,b//(n-i)) for i in range(1,n)]))", "def bs(l, h):\r\n while l < h:\r\n m = (l + h + 1) // 2\r\n if gf(m):\r\n l = m\r\n else:\r\n h = m - 1\r\n return l\r\n\r\ndef gf(x):\r\n return a // x + b // x >= n\r\n\r\nn, a, b = map(int, input().split())\r\nprint(bs(0, min(a, b)))", "n,a,b=map(int,input().split())\r\nl=[]\r\nfor i in range(1,n):\r\n l.append(min(a//i,b//(n-i)))\r\nprint(max(l))", "n,a,b=map(int,input().split())\r\narr=[]\r\nfor i in range(1,n):\r\n arr.append(min(a//i,b//(n-i)))\r\nprint(max(arr))\r\n", "#http://codeforces.com/problemset/problem/911/B\nplate, c1, c2 = [int(i) for i in input().split(\" \")]\nans = 0\nfor x in range(1,plate):\n\tans = max(ans, min(c1//x , c2//(plate-x)))\nprint(ans)", "n, a, b = map(int, input().split())\r\nprint(max([min(a//i, b//(n-i)) for i in range(1, n)]))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n# n=int(input())\r\n n,a,b=list(map(int,input().split()))\r\n maxi=-1\r\n for i in range(1,n):\r\n maxi=max(maxi,min(a//i,b//(n-i)))\r\n print(maxi)\r\n \r\n\r\n\r\n\r\nfor _ in range(1):\r\n main()\r\n", "n,a,b=map(int,input().strip().split())\nla=[]\nlb=[]\nfor i in range(1,n):\n la.append(a//i)\nfor i in range(n-1,0,-1):\n lb.append(b//i)\nans=[]\nfor i in range(len(la)):\n mn=min(la[i],lb[i])\n ans.append(mn)\nprint(max(ans))\n\n\t\t\t \t\t\t \t\t \t \t \t\t\t \t \t \t", "n, a, b = map(int, input().split())\r\nans = 0\r\nfor i in range(1, n):\r\n temp = min(a//i, b//(n-i))\r\n ans = max(temp, ans)\r\nprint(ans)\r\n", "n, a, b = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(1, n):\r\n ans = max(ans, min(a//i, b//(n-i)))\r\nprint(ans)", "n, a, b = map(int, input().split())\r\nmx = 0\r\nfor i in range(1, n):\r\n if a // i > 0 and b // (n - i) > 0:\r\n count = min(a // i, b // (n - i))\r\n if count > mx:\r\n mx = count\r\nprint(mx)", "n,a,b = map(int,input().split())\r\nans = 0\r\nfor i in range(1,n):\r\n if i <= a and n-i <= b:\r\n check = min(a//i,b//(n-i))\r\n if check > ans:\r\n ans = check\r\nprint(ans)", "n, a, b = list(map(int,input().split()))\r\n\r\nx = 0\r\nfor i in range(1, n):\r\n x = max(min(a / i, b / (n - i)), x)\r\n \r\nprint(int(x))", "n, a, b = map(int, input().split())\r\nans = 0\r\nfor i in range(1, n):\r\n ans = max(ans, min(a // i, b // (n - i)))\r\nprint(ans)\r\n", "n,a,b=map(int,input().split())\r\nx=1\r\nwhile x<=a and x<=b:\r\n if a//x + b//x>=n:\r\n x+=1\r\n else:\r\n break\r\n\r\nprint(x-1)", "import math\r\nn,a,b=map(int,input().split())\r\nans=0\r\nfor i in range(1,n):\r\n ans=max(ans,min(math.floor(a/i),math.floor(b/(n-i))))\r\nprint(ans)", "line = input()\nline = line.split(' ')\nn = int(line[0])\nnumPiecesA = int(line[1])\nnumPiecesB = int(line[2])\nminPieces = 0 # min number of pieces on each plate\n# Find the cake with less pieces\nif numPiecesA > numPiecesB:\n numPiecesA, numPiecesB = numPiecesB, numPiecesA\n# Find number for pieces to be on each plate\nfor i in range(1, numPiecesA + 1):\n # Find the number of plates we can fill\n # (the number of plates to fill is n, so the division\n # must divide the cake pieces into n or more plates)\n if ((numPiecesA // i) + (numPiecesB // i)) >= n:\n if i > minPieces:\n minPieces = i\n\nprint(minPieces)\n\t \t\t \t \t\t \t\t \t \t \t \t\t\t\t", "a, b, c = map(int, input().split())\r\nma = 0\r\nfor x in range(min(b, c)):\r\n if c // (x + 1) + b // (x + 1) >= a:\r\n ma = x + 1\r\nprint(ma)\r\n", "(n, a, b) = map(int, input().split())\r\n\r\nk = 0\r\nfor x in range(1, n):\r\n k = max(k, min(a // x, b // (n - x)))\r\n\r\nprint(k)\r\n", "arr=list(map(int,input().split()))\r\nn = arr[0]\r\na = arr[1]\r\nb = arr[2]\r\nx = 1\r\nmaxx = 0\r\nwhile x != n:\r\n maxx = max(maxx,min(a/x,b/(n-x)))\r\n x += 1\r\nprint(int(maxx))", "n, a, b = map(int, input().split())\r\nprint(max([min(a//i,b//(n-i)) for i in range(1,n)]))", "n, a, b = map(int, input().split())\r\nx = min((a + b) // n, a, b)\r\nwhile not a // x + b // x >= n: x-= 1 \r\nprint(x)", "n,a,b=map(int,input().split())\r\nu=[]\r\n'''for i in range(1,n):\r\n print(a//(n-i),b//i)'''\r\nfor i in range(1,n):\r\n u.append(min(a//(n-i),b//i))\r\n#print(u)\r\nprint(max(u))", "n,a,b=map(int,input().split())\r\nt=min(a,b)\r\nf=a+b-t\r\nif t==0:\r\n print(f//n)\r\nelse:\r\n result=1\r\n for x in range(1,t+1):\r\n if (n-(t//x))!=0 and f//(n-(t//x))>=x: #qed#\r\n result=x\r\n print(result)", "s = input().split()\r\nn = int(s[0])\r\na = int(s[1])\r\nb = int(s[2])\r\nmx = a+b\r\nst = False\r\nwhile(mx>=1):\r\n if st:\r\n break\r\n for i in range(1, n):\r\n if st:\r\n break\r\n for j in range(1, n):\r\n if i*mx<=a and j*mx<=b and i+j==n:\r\n print(mx)\r\n st = True\r\n break\r\n mx-=1", "# Сложность по времени O(log(min(a, b))\r\n# Сложность по памяти O(1), если не считать стэк для рекурсии,\r\n# иначе O(log(min(a, b))\r\ndef good(m):\r\n return a // m + b // m >= n\r\n\r\n\r\nn, a, b = map(int, input().split())\r\nl = 1\r\nr = min(a, b) + 1\r\nwhile r - l > 1:\r\n m = (l + r) // 2\r\n if good(m):\r\n l = m\r\n else:\r\n r = m\r\nprint(l)", "# t = int(input())\n# for test in range(t):\n\nn,a,b = map(int, input().split())\n\ncurrMaxMin = -1\n\nfor aGets in range(1,n):\n bGets = n - aGets\n minimum = min(a//aGets, b//bGets)\n currMaxMin = max(currMaxMin, minimum)\n\nprint(currMaxMin)\n\n\n\n\n\n\n", "import math\r\nn,a,b=map(int,input().split())\r\nmx=0\r\nfor i in range(1,n):\r\n t=int(min(a/i,b/(n-i)))\r\n if t>=mx:\r\n mx=t\r\n \r\nprint(mx)\r\n", "#problem 911b\r\nn,a,b=list(map(int,input().split()))\r\nprint(max(min(a//i,b//(n-i)) for i in range(1,n)))", "n,a,b=map(int,input().split())\r\nc=[]\r\nfor i in range(1,n):\r\n c.append(min(a//i,b//(n-i)))\r\nprint(max(c))", "def cake_rule(n, a, b):\r\n m = min(a, b)\r\n for i in range(m):\r\n if a // (i + 1) + b // (i + 1) >= n:\r\n s = i + 1\r\n return s\r\n\r\n\r\nN, A, B = [int(j) for j in input().split()]\r\nprint(cake_rule(N, A, B))\r\n", "import re\n\ntheNumbers = re.split(\"\\\\s\", input())\nx = int(theNumbers[0])\ny = int(theNumbers[1])\nz = int(theNumbers[2])\ncount = 0\npossible = True\n\nplates = x\nmaxim = 0\nfor x1 in range(1, x):\n minim = min(int(y/x1), int(z/(x-x1)))\n if minim > maxim:\n maxim = minim\n \nprint(maxim)\n \t\t \t \t\t \t\t \t \t\t \t \t\t\t\t\t", "n , a , b = map(int,input().split())\r\n\r\nans = 0\r\n\r\nif a > b :\r\n a , b = b , a\r\n\r\nfor i in range(1 , n // 2 + 1 ):\r\n\r\n ans = max(ans , min(a // i , b // (n - i)))\r\n\r\n\r\nprint(ans)\r\n\r\n", "n,a,b=map(int,input().split())\r\nm=0\r\nfor i in range(1,n):\r\n m=max(min(a//i,b//(n-i)),m)\r\nprint(m)", "n,a,b=map(int,input().split())\nif a+b==n:\n print(1)\nelse:\n p=0\n a,b=min(a,b),max(a,b)\n for i in range(1,n//2+1):\n r=min(a//i,b//(n-i))\n p=max(p,r)\n print(p)\n\n \t \t\t\t\t \t\t\t \t\t\t \t\t\t\t \t \t", "n,a,b = [int(i) for i in input().split()]\r\nmaxi = -1\r\nfor i in range(1,n):\r\n if min(a//i,b//(n-i))>maxi:\r\n maxi = int(min(a//i,b//(n-i)))\r\nprint(maxi)\r\n\r\n", "n,a,b=map(int,input().split())\r\nl1=[]\r\n\r\nfor x in range(1,n):\r\n l1.append(min(a//x , b//(n-x)))\r\nprint(max(l1))\r\n", "\"\"\" 616C \"\"\"\r\n\"\"\" 1152B \"\"\"\r\nimport math\r\n# import sys\r\ndef main():\r\n\t# n ,m= map(int,input().split())\r\n\t# arr = list(map(int,input().split()))\r\n\t# b = list(map(int,input().split()))\r\n\t# n = int(input())\r\n\t# string = str(input())\r\n\tn,a,b= map(int,input().split())\r\n\tif(n==(a+b)):\r\n\t\tprint(1)\r\n\t\treturn\r\n\tans = 0\r\n\tfor i in range(1,n):\r\n\t\ttemp = min(a//i,b//(n-i))\r\n\t\tans =max(temp,ans)\r\n\tprint(ans)\r\n\treturn\r\n\r\nmain()\r\n# def test():\r\n# \tt = int(input())\r\n# \twhile t:\r\n# \t\tmain()\r\n# \t\tt-=1\r\n# test()", "n, a, b = map(int, input().split())\r\nans = 0\r\nfor i in range(1, min(b + 1, n)):\r\n ans = max(ans, min(b // i, a // (n - i)))\r\nprint(ans)\r\n", "n,a,b=map(int,input().split())\r\n\r\nif a>b:\r\n\ta,b=b,a\r\nans=0\r\nfor i in range(1,n//2+1):\r\n\tans=max(ans,min(a//i,b//(n-i)))\r\nprint(ans)", "n, a, b = map(int, input().split())\r\nl, r = 1, min(a, b)\r\nwhile l < r:\r\n mid = (l + r + 1) >> 1\r\n if a // mid + b // mid >= n:\r\n l = mid\r\n else:\r\n r = mid - 1\r\nprint(l)", "n, a, b = [int(x) for x in input().split()]\r\nmax1 =0\r\n\r\nfor i in range(1,n):\r\n if(min(int(a/i),int(b/(n-i)))>max1):\r\n\r\n max1 =min(int(a/i),int(b/(n-i)))\r\nprint(max1)\r\n", "n,a,b=[int(i) for i in input().split()]\r\nans=0\r\nfor i in range(1,min(a,b)+1):\r\n if(a//i + b//i>=n):\r\n ans=i\r\nprint(ans)\r\n", "import sys\r\nn,a,b=map(int,sys.stdin.readline().split())\r\nmaxa=0\r\nfor i in range(1,n):\r\n j=min(a//i,b//(n-i))\r\n if(j>maxa):\r\n maxa=j\r\nprint(maxa)", "n,a,b=map(int,input().split())\r\ni=1\r\nj=n-1\r\nl=[]\r\nwhile i<n and j>0:\r\n l.append(min(a//i,b//j))\r\n i=i+1\r\n j=j-1\r\nprint(max(l))", "n, a, b = map(int, input().split())\nprint(max(\n min(a//i, b//(n-i))\n for i in range(1, min(a+1, n))\n))\n", "inputs = input().split()\nn, a, b = [int(x) for x in inputs]\n\nlargest_min = 0\nfor i in range(1, n):\n current_min = min(a // i, b // (n - i))\n if current_min > largest_min:\n largest_min = current_min\n \nprint (largest_min)", "n, a, b = map(int, input().split())\r\n\r\nx = min(a,b)\r\nwhile a // x + b // x < n:\r\n x -= 1\r\nprint(x)", "n, a, b = [int(i) for i in input().strip().split()]\r\nmaxx = 0\r\nfor i in range(1,n):\r\n p_a = i\r\n p_b = n-i\r\n if min(a//p_a, b//p_b)>maxx:\r\n maxx = min(a//p_a, b//p_b)\r\nprint(maxx)\r\n", "n,a,b=map(int,input().split())\r\nfor i in range(1,min(a,b)+1):\r\n if a//i+b//i>=n: k=i\r\nprint(k)", "n, a, b = map(int,input().split())\r\ncan = 0\r\nfor i in range(1, n):\r\n\tc = a // i\r\n\td = b // (n-i)\r\n\tcan = max(can, min(c, d))\r\nprint(can)\r\n" ]

[ "# LUOGU_RID: 105175736\nn=int(input())\r\nret,ans=[],0\r\nfor i in range(n):\r\n\ta1,b1,a2,b2=map(int,input().split())\r\n\tif a1+b1>=a2+b2:\r\n\t\tret.extend([a1+b1,a2+b2])\r\n\t\tans+=a1+a2\r\n\telif a1>b2:\r\n\t\tans+=a1-b2\r\n\telif a2<b1:\r\n\t\tans+=a2-b1\r\nfor x in sorted(ret)[::2]:\r\n\tans-=x\r\nprint(ans)", "num_stacks = int(input())\r\n\r\nanswer = 0\r\narray = []\r\n\r\nfor i in range(num_stacks):\r\n a1, b1, a2, b2 = input().split(' ')\r\n a1 = int(a1)\r\n a2 = int(a2)\r\n b1 = int(b1)\r\n b2 = int(b2)\r\n\r\n if a1 + b1 >= a2 + b2:\r\n answer += a1 + a2\r\n array.append(a2 + b2)\r\n array.append(a1 + b1)\r\n \r\n elif a1 > b2:\r\n answer += a1 - b2\r\n\r\n elif b1 > a2:\r\n answer += a2 - b1\r\n\r\n # Elif both side skip\r\n\r\narray.sort()\r\n\r\nfor i in range(0, len(array), 2):\r\n answer -= array[i]\r\n\r\nprint(answer)" ]

[ "def solve(N, M):\r\n ans = 0\r\n while M > 1:\r\n ans += N // M\r\n N, M = M, N % M\r\n if M == 0: return 1000000\r\n return N - 1 + ans\r\n\r\nN = int(input())\r\nans = 1000000\r\nfor M in range(1, N + 1):\r\n ans = min([ans, solve(N, M)])\r\nprint(ans)", "TMP = 0\n\n\ndef dfs(a, b, n):\n global TMP\n if not b:\n TMP = n\n return None\n if b == 1:\n TMP += a - 1\n return None\n TMP += a // b\n dfs(b, a % b, n)\n\n\nclass CodeforcesTask134BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n\n def read_input(self):\n self.n = int(input())\n\n def process_task(self):\n ans = self.n - 1\n for i in range(1, self.n):\n global TMP\n TMP = 0\n dfs(self.n, i, self.n)\n ans = min(ans, TMP)\n self.result = str(ans)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask134BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "def solve(n):\r\n ans = n - 1\r\n for i in range(2, n // 2 + 1):\r\n j = n\r\n k = 0\r\n while i > 1 and j > 1:\r\n k += 1\r\n if j >= i:\r\n j -= i\r\n else:\r\n i -= j\r\n if i < 1 or j < 1:\r\n continue\r\n elif i == 1:\r\n ans = min(ans, k + j - 1)\r\n elif j == 1:\r\n ans = min(ans, k + i - 1)\r\n return ans\r\n\r\nif __name__ == \"__main__\":\r\n ans = solve(int(input()))\r\n print(ans)", "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\nfrom array import array\r\nfrom bisect import *\r\n\r\n# input = lambda: sys.stdin.buffer.readline().decode().strip()\r\n# inp = lambda dtype: [dtype(x) for x in input().split()]\r\ndebug = lambda *x: print(*x, file=sys.stderr)\r\nceil1 = lambda a, b: (a + b - 1) // b\r\nMint, Mlong, out = 2 ** 31 - 1, 2 ** 63 - 1, []\r\n\r\nsquares = []\r\nfor i in range(0, 520):\r\n squares.append(i * i)\r\n\r\n\r\ndef solve():\r\n def gcd(a, b):\r\n if min(a, b) == 1:\r\n return max(a, b) - 1\r\n\r\n if a < b:\r\n a, b = b, a\r\n\r\n if a % b == 0:\r\n return 1 << 60\r\n return a // b + gcd(a % b, b)\r\n\r\n n = int(input())\r\n mn = n - 1\r\n\r\n for p in range(1, n):\r\n mn = min(mn, gcd(p, n))\r\n\r\n print(mn)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "def calc(n,m):\r\n ans=0\r\n while(m>1):\r\n ans+=n//m\r\n n,m=m,n%m\r\n\r\n if m==0:\r\n return float(\"inf\")\r\n return ans+n-1\r\n\r\n\r\n\r\n\r\nn=int(input())\r\nans=n-1\r\nfor i in range(1,n+1):\r\n ans=min(ans,calc(n,i))\r\n\r\nprint(ans)\r\n" ]

[ "n, m, k = map(int, input().split())\r\nli = [[0 for _ in range(1001)] for _ in range(1001)]\r\nfor i in range(1001):\r\n li[i][0] = 1\r\n li[i][i] = 1\r\nfor i in range(1, 1001):\r\n for j in range(1, i):\r\n li[i][j] = li[i-1][j-1] + li[i-1][j]\r\nif 2 * k <= n-1 and 2 * k <= m:\r\n print(li[n-1][2 * k] * li[m-1][2 * k] % 1000000007)\r\nelse:\r\n print(0)", "from math import factorial\r\n\r\n\r\n# Obtener los datos de entrada\r\nn, m, k = map(int, input().split())\r\n\r\n# Definicion de combinacion\r\ndef combinacion(n, k):\r\n if k > n:\r\n return 0\r\n # No hay formas de tomar k elementos de un conjunto de n elementos\r\n # si k es mayor que n\r\n return factorial(n)//(factorial(k)*factorial(n-k))\r\n\r\nresult = (combinacion(n-1, 2 * k) * combinacion(m-1, 2 * k)) % 1000000007\r\nprint(result)", "from math import comb\n\nBIG = 1_000_000_007\nn, m, k = map(int, input().split())\n\nans = (comb(n-1, 2*k) % BIG) * (comb(m-1, 2*k) % BIG)\nans %= BIG\n\nprint(ans)\n", "from math import *\r\nn, m, k = map(int, input().split())\r\nc = lambda n, k: 0 if k > n else factorial(n) // (factorial(k) * factorial(n - k))\r\nprint(c(n - 1, 2 * k) * c(m - 1, 2 * k) % 1000000007)", "M=1000000007\r\nR=2000\r\nF=[1]*(R+1)\r\nfor i in range(2, R+1):\r\n F[i]=(F[i-1]*i)%M\r\ndef modpow(x, p):\r\n if p==0:\r\n return 1\r\n y=modpow(x, p//2)\r\n if p%2:\r\n return (y*y*x)%M\r\n return (y*y)%M\r\ndef modhyp(x):\r\n return modpow(x, M-2)\r\nFhyp=[1]*(R+1)\r\nFhyp[R]=modhyp(F[R])\r\nfor i in range(R-1, -1, -1):\r\n Fhyp[i]=(Fhyp[i+1]*(i+1))%M\r\ndef C(n, k):\r\n if k<0 or n<0:\r\n return 0\r\n if k>n:\r\n return 0\r\n return (F[n]*Fhyp[n-k]*Fhyp[k])%M\r\nn,m,k=[int(e) for e in input().split()]\r\nx=0\r\nfor i in range(1, n):\r\n x+=C(i-1, k-1)*C(n-i-1, k)\r\n x%=M\r\ny=0\r\nfor i in range(1, m):\r\n y+=C(i-1, k-1)*C(m-i-1, k)\r\n y%=M\r\nprint((x*y)%M)", "\r\n\r\nmod = int(1e9 + 7)\r\n\r\n\r\ndef main():\r\n mat = [[0 for i in range(1001)] for j in range(1001)]\r\n for i in range(1, 1001):\r\n mat[0][i] = 1\r\n for k in range(1, 1001):\r\n sn = 0\r\n sp = 0\r\n for n in range(2, 1001):\r\n sn = (sn + mat[k-1][n-2]) % mod\r\n sp = (sp + (n-2)*mat[k-1][n-2]) % mod\r\n mat[k][n] = ((n-1)*sn - sp + mod) % mod\r\n a, b, c = [int(x) for x in input().split()]\r\n print((mat[c][a] * mat[c][b]) % mod)\r\n\r\n\r\nmain()\r\n", "from math import factorial\r\n\r\n\r\nn, m, k = map(int, input().split())\r\n\r\ndef combinacion(n, k):\r\n if k > n:\r\n return 0\r\n return factorial(n)//(factorial(k)*factorial(n-k))\r\n\r\nresult = (combinacion(n-1, 2 * k) * combinacion(m-1, 2 * k)) % 1000000007\r\nprint(result)", "from math import factorial\r\n\r\nMOD = 1000000007\r\n\r\ndef c(n, k):\r\n if k > n:\r\n return 0\r\n return factorial(n) //(factorial(k) * factorial(n - k))\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nprint ((c(n - 1, 2 * k) * c(m - 1, 2 * k)) % MOD)", "import time\n\ndef Binc(bcs, n, k):\n if (k > n): return 0\n if k > n // 2: k = n - k\n if k == 0: return 1\n if k == 1: return n\n while len(bcs) < n - 3:\n for i in range(len(bcs), n - 3):\n r = []\n for j in range(2, i // 2 + 3): r.append(Binc(bcs, i + 3, j - 1) + Binc(bcs, i + 3, j))\n bcs.append(r)\n r = bcs[n - 4]\n if len(r) < k - 1:\n for i in range(len(r), k - 1): r.append(Binc(bcs, n - 1, k - 1) + Binc(bcs, n - 1, k))\n return bcs[n - 4][k - 2]\n\nbcs = []\nbcs_ = []\n\nmod_ = 1000000007\n\nn, m, k = map(int, input().split())\n\nnk = Binc(bcs, n - 1, 2*k) % mod_\nmk = Binc(bcs_, m - 1, 2*k) % mod_\nprint((nk * mk) % mod_)\n", "p = int(1e9 + 7)\r\n\r\ndef forvor(n, m, kk):\r\n k2 = (kk << 1) + 1\r\n kn, km = n - k2, m - k2\r\n if kn < 0 or km < 0:\r\n return 0\r\n kl = max(kn, km)\r\n K = list(range(1, kl + 2))\r\n M = [1] * (kl + 1)\r\n for k in range(1, kk + 1):\r\n T = [0] * (kl + 1)\r\n for i in range(kl + 1):\r\n t = 0\r\n for i2 in range(i + 1):\r\n t += M[i2] * K[i - i2]\r\n T[i] = t % p\r\n M = T\r\n return M[kn] * M[km] % p\r\n\r\nn, m, k = map(int, input().split())\r\nprint(forvor(n, m, k))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, k = map(int, input().split())\r\nmod = pow(10, 9) + 7\r\nl = max(n, m)\r\ndp = [1] * (l + 1)\r\ndp[0] = 0\r\nfor _ in range(k):\r\n dp0 = [0] * (l + 1)\r\n s = 0\r\n for i in range(3, l + 1):\r\n s = (s + dp[i - 2]) % mod\r\n dp0[i] = (dp0[i - 1] + s) % mod\r\n dp = dp0\r\nans = dp[n] * dp[m] % mod\r\nprint(ans)", "from math import comb\r\n\r\nBIG = 1_000_000_007\r\nn, m, k = map(int, input().split())\r\n\r\nans = (comb(n-1, 2*k) % BIG) * (comb(m-1, 2*k) % BIG)\r\nans %= BIG\r\n\r\nprint(ans)", "def clovis(n,m,a):\r\n c=[]\r\n for i in range(2201):\r\n v=[0]*2200\r\n c.append(v)\r\n for i in range(2001):\r\n for j in range(i+1):\r\n if j==0 or j==i:\r\n c[i][j]=1\r\n else: c[i][j]=(c[i-1][j]+c[i-1][j-1])%1000000007\r\n res=c[n-1][2*a]*c[m-1][2*a]\r\n res%=1000000007\r\n return res\r\n\r\n\r\na,b,c=map(int,input().split())\r\nprint(clovis(a,b,c))\r\n" ]

[ "n=int(input())\r\nk=0\r\nfor a in range(1,n+1):\r\n\tfor b in range(a,n+1):\r\n\t\tc=a^b\r\n\t\tif b<=c and c<=n and a+b>c and b+c>a and a+c>b:\r\n\t\t\tk+=1\r\nprint(k)\r\n", "n = int(input())\r\nans=[[0]*(n+1) for i in range(n+1)]\r\naa=0\r\nfor i in range(1,n+1):\r\n for j in range(i,n+1):\r\n if i^j<=n:\r\n a=sorted([i,j,i^j])\r\n if a[0]+a[1]>a[2] and a[0]!=0:\r\n if ans[a[0]][a[1]]==0:\r\n aa+=1\r\n ans[a[0]][a[1]]=1\r\nprint(aa) ", "n=int(input())\r\ncount=0\r\nfor i in range(1,n+1):\r\n for j in range(i,n+1):\r\n temp=i^j\r\n if temp<j or temp>n or i+j<=temp:continue\r\n count+=1\r\nprint(count)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nans = 0\r\nfor i in range(1, n + 1):\r\n for j in range(i, n + 1):\r\n k = i ^ j\r\n if j <= k <= n and i + j > k:\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\nct=0\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n c=(i^j)\r\n if(c<i+j and c>=j and c<=n):\r\n ct+=1\r\nprint(ct)", "n = int(input())\r\ncount = 0\r\nfor a in range(n):\r\n for b in range(a + 1, n):\r\n c = a ^ b\r\n if b <= c <= n:\r\n if a + b > c and a + c > b and c + b > a:\r\n count += 1\r\nprint(count)", "# import numpy as np\r\n# import matplotlib.pyplot as plt\r\n# import pandas as pd\r\nimport math\r\n\r\nn = int(input())\r\nans = 0\r\nfor i in range(1, n + 1):\r\n for j in range(i, n + 1):\r\n temp = i ^ j\r\n if temp <= n and temp > 0 and temp >= j:\r\n if (i + j > temp) and (j + temp > i) and (i + temp > j): ans += 1\r\nprint(ans)\r\n", "n = int(input())\r\ncount = 0\r\nfor a in range(1,n+1):\r\n for b in range(a+1, n+1):\r\n c = a^b\r\n if c<a+b and b<c and c<=n:\r\n count+=1\r\n #print(a,b,c)\r\nprint(count)", "n = int(input())\r\nans = 0\r\nfor a in range(1, n + 1):\r\n for b in range(a, n + 1):\r\n c = a ^ b\r\n if a + b > c and c >= b and c <= n:\r\n ans += 1\r\nprint(ans) \r\n", "n = int(input())\r\n\r\nans = 0\r\n \r\nfor i in range(1, n):\r\n for j in range(i, n):\r\n if n >= i ^ j > j and i + j > i ^ j:\r\n ans += 1\r\n \r\nprint(ans)", "n = int(input())\nx = 0\nfor i in range(1, n + 1):\n for j in range(1, i + 1):\n k = i ^ j\n if k < j < i + k and k < i + j and j + k > i:\n x += 1\nprint(x)\n\n\t \t\t \t\t\t\t \t\t \t \t\t \t\t\t \t", "n = int(input())\r\n\r\ndef triangle_check(a, b, c):\r\n return (c < a + b)\r\n\r\ncount = 0\r\nfor a in range(1, n + 1):\r\n for b in range(a + 1, (n + 1)):\r\n c = a ^ b\r\n if (c <= n and c > b):\r\n if (triangle_check(a, b, c)):\r\n count += 1\r\nprint(count)", "print(sum(i-j<i^j<j for i in range(int(input())+1)for j in range(i//2,i)))\r\n \r\n", "n = int(input().strip())\r\n\r\nres = 0\r\nfor c in range(1, n+1):\r\n for b in range(1, c+1):\r\n a = 0\r\n base = 1\r\n bb, cc = b, c\r\n while bb > 0 or cc > 0:\r\n bx = bb % 2\r\n cx = cc % 2\r\n if bx != cx:\r\n a += base\r\n bb //= 2\r\n cc //= 2\r\n base *= 2\r\n if a >= 1 and a <= b and b <= c and a + b > c: \r\n res += 1\r\nprint(res)\r\n", "import math\r\nn = int(input())\r\nans = 0\r\nfor a in range(1, n+1):\r\n for b in range(a, n+1):\r\n c= a^b\r\n if c < b or c > n:\r\n continue\r\n if a+b > c:\r\n ans += 1\r\nprint(ans)", "n = int(input())\ntimes = 0\nfor i in range(1, n + 1):\n for j in range(i, n + 1):\n if i <= j and j <= i ^ j and i ^ j <= n:\n if i < i ^ j + j and j < i ^ j + i and i ^ j < i + j:\n times = times + 1\nprint(times)\n \t \t \t \t \t \t \t\t\t\t \t", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n):\r\n answer = 0\r\n for a in range(1, n+1):\r\n for b in range(a, n+1):\r\n c = a^b \r\n if 1 <= a <= b <= c <= n and a+b > c:\r\n answer+=1\r\n sys.stdout.write(f'{answer}\\n')\r\n \r\nn = int(input())\r\nprocess(n)", "def a(n):\r\n w=0\r\n for i in range(1,n+1):\r\n for j in range(i,n+1):\r\n q=i^j\r\n if q<=j and q+i>j:w+=1\r\n print(w//2)\r\na(int(input()))", "import sys,math\r\nfrom collections import defaultdict,deque\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\nc=0\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n k=i^j\r\n if(i<j<k<=n and i+j>k and j+k>i and i+k>j):\r\n #print(i,j,k)\r\n c+=1\r\nprint(c)\r\n", "n=int(input())\r\nc=0\r\nfor i in range(1,n+1):\r\n for j in range(i,n+1):\r\n temp=i^j\r\n if temp>j and i+j>temp and temp<=n:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nans = 0\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n k = i^j\r\n if k>j and (i+j)>k and k<=n:\r\n ans+=1\r\nprint(ans)", "\r\nn = int(input())\r\ncount = 0\r\nfor i in range(1, n+1):\r\n for j in range(1, n+1):\r\n x = i^j;\r\n if (x<=n and x>0):\r\n k=0\r\n if (i+j<=x):\r\n k+=1\r\n elif (i+x<=j):\r\n k+=1\r\n elif (x+j<=i):\r\n k+=1\r\n if (k<=0):\r\n count+=1\r\nprint(count//6)", "def correct(a,b,c):\n\tif a+b<=c or b+c<=a or a+c<=b:\n\t\treturn False\n\treturn True\n\nn = int(input())\nans = 0\nfor i in range(2,n+1):\n\tfor j in range(i+1,n+1):\n\t\ts = i^j\n\t\tif (s>j and s<=n) and correct(i,j,i^j):\n\t\t\tans += 1\nprint (ans)", "n = int(input())\r\ndic = {}\r\nfor i in range(1,n+1):\r\n dic[i] = 1\r\n\r\nans = 0\r\nfor i in range(1,n+1):\r\n for j in range(i,n+1):\r\n x = i^j\r\n if x < j or i+j <= x or x > n:\r\n continue\r\n ans += 1\r\n # print(i,j,i^j)\r\n# print(len(set(ans))) \r\nprint(ans)\r\n\r\n", "n=int(input())\r\narr=[]\r\nfor i in range(1,n+1):\r\n arr.append(i)\r\ncount=0\r\ns1=set()\r\ns2=set()\r\nfor i in range(n):\r\n for j in range(n):\r\n a=arr[i]^arr[j]\r\n if(a>0 and a<=n and a+arr[i]>arr[j] and a+arr[j]>arr[i] and arr[i]+arr[j]>a):\r\n count=count+1\r\nprint(count//6) \r\n ", "n=int(input())\r\nc=0\r\nfor i in range(1,n+1):\r\n for j in range(i+1,n+1):\r\n d=i^j\r\n if(d<(i+j) and d<=n and d>=j):\r\n c+=1\r\nprint(c)\r\n", "def binary(n):\r\n s = bin(n)[2:]\r\n l = list(s)\r\n l = list(map(int , l))\r\n return l\r\n\r\ndef helper(l):\r\n l0 = []\r\n l1 = []\r\n for i in range(len(l)):\r\n if (l[i] == 0):\r\n l0.append(i)\r\n else:\r\n l1.append(i)\r\n return l0, l1\r\n\r\ndef positions(n):\r\n l0, l1 = helper(binary(n))\r\n if (len (l1 ) < 2) or (len(l0) < 1):\r\n return []\r\n else:\r\n l = []\r\n for j in range(1, len(l1)):\r\n for k in range(len(l0)):\r\n if l0[k] > l1[j]:\r\n l.append((l1[0], l1[j], l0[k]))\r\n return l\r\n \r\ndef func(n):\r\n postion = positions(n)\r\n l = binary(n)\r\n temp = 0;\r\n for (i, j, k) in postion:\r\n ans = 1\r\n for m in range(j+1, k):\r\n if l[m] == 1:\r\n ans*= 2\r\n for m in range(k+1, len(l)):\r\n ans*=2\r\n temp += ans\r\n return temp;\r\n \r\nn = int(input())\r\nans = 0\r\nfor i in range(1, n+1):\r\n ans += func(i)\r\nprint(ans)", "n = int(input())\r\nans = 0\r\nfor i in range(1,n+1):\r\n for j in range(1,i+1):\r\n if j >= i^j > i-j and i^j<=n: ans += 1\r\nprint(ans)", "import math\r\nimport bisect\r\nimport sys\r\nfrom collections import OrderedDict\r\ninput = sys.stdin.readline\r\ndef inp():\r\n\treturn(int(input()))\r\ndef inlt():\r\n\treturn(list(map(int,input().split())))\r\ndef insr():\r\n\ts = input()\r\n\treturn(s[:len(s)-1])\r\ndef invr():\r\n\treturn(map(int,input().split()))\r\n# N, M = inlt()\r\n# A = inlt()\r\n# T = inp()\r\n# MOD = 1e-7\r\n# for t in range(T):\r\nN = inp()\r\nout = 0\r\nfor i in range(1,N+1):\r\n\tfor j in range(i,N+1):\r\n\t\tcurr = i^j\r\n\t\tif j<=curr<N+1 and curr+i>j and i+j>curr:\r\n\t\t\t# print(i,j,curr)\r\n\t\t\tout += 1\r\nprint(out)", "def main():\r\n cnt = 0\r\n n = int(input())\r\n for a in range(1, n + 1):\r\n for b in range(a, n + 1):\r\n c = a ^ b\r\n if c < b or c > n:\r\n continue\r\n elif b + a > c and b - a < c:\r\n cnt = cnt + 1\r\n print(cnt)\r\n return\r\n\r\n\r\nmain()\r\n", "n = int(input())\r\nans = 0\r\nfor i in range(1, n + 1):\r\n for j in range(i, n + 1):\r\n t = i ^ j\r\n if t >= j and t <= n and t <= i + j - 1:\r\n ans += 1\r\nprint(ans)\r\n", "# Problem code: 922B\r\n# Took too long, but works\r\n\r\nn = int(input())\r\ntri_count = 0\r\n\r\nfor a in range(1,n+1):\r\n for b in range(a,n+1): # makes sure b >= a\r\n c = a ^ b # c ^ (a^b) is 0 when c = a^b (ie. 6 ^ 6 = 0)\r\n if c <= n and c >= b and c != (a+b): # c must be less than n, bigger than b, and the triangle must not be a line, as stated in the problem\r\n tri_count += 1\r\n\r\nprint(tri_count)", "from sys import stdin,stdout\r\n\r\nn=int(input())\r\n\r\nans=0\r\nfor i in range(1,n+1):\r\n for j in range(1,i+1):\r\n if j>=i^j>i-j and i^j<=n:\r\n ans+=1\r\nprint(ans) \r\n", "n = int(input())\ncount = 0\nfor i in range(1,n+1):\n for j in range(i+1,n+1):\n if j < (i^j) < (i+j) and (i^j) <= n:\n count += 1\nprint(count)\n", "# Magic Forest\r\nn = int(input())\r\nicount = 0\r\nfor a in range(1, n+1):\r\n for b in range(a, n+1):\r\n c = a ^ b\r\n if c >= b and c <= n and c < a + b:\r\n icount += 1\r\nprint(icount)\r\n", "a=int(input());s=0\r\nfor i in range(1,a+1):\r\n for j in range(i+1,a+1):\r\n if i+j>i^j and j+i^j>i and i^j+i>j and a>=i^j>=j:s+=1\r\nprint(s)", "n = int(input())\r\ncount = 0\r\nfor a in range(1,n+1):\r\n for b in range(a+1, n+1):\r\n c = a^b\r\n if c >= b and c <= n and a+b>c:\r\n count+=1\r\nprint(count)", "n=int(input())\r\nans=0\r\nfor a in range(1,n+1):\r\n for b in range(a,n+1):\r\n c=b^a\r\n if b<c<=n and a+b>c and a+c>b and b+c>a:\r\n ans+=1\r\nprint(ans)\r\n \r\n", "import sys\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\nimport math\r\n\r\nn = int(input())\r\nans = 0\r\nfor a in range(1, n + 1):\r\n for b in range(2, n + 1):\r\n c = a ^ b\r\n if c <= n and a + b > c and a + c > b and b + c > a:\r\n ans += 1\r\nprint(ans // 6)", "n=int(input())\r\nans=0\r\nfor xx in range(1,n+1):\r\n for yy in range(xx,n+1):\r\n zz=xx^yy\r\n if zz>0 and zz<=n and xx<=zz and yy<=zz and xx+yy>zz and xx+zz>yy and yy+zz>xx:\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\np = 0\r\nfor i in range(1,n+1):\r\n for j in range(i,n+1):\r\n k = i^j\r\n if k<=n and k>=j:\r\n a = [i,j,k]\r\n a.sort()\r\n if a[0]+a[1]>a[2]:\r\n p+=1\r\nprint(p)\r\n", "#https://codeforces.com/contest/922/problem/B\nn=int(input())\nans=0\nfor a in range(1,n+1):\n\tfor b in range(a+1,n+1):\n\t\tc=a^b\n\t\tif c>b and c<n+1 and a+b>c and b+c > a and c+a>b:\n\t\t\tans+=1\n\t\t\t#print(a,b,c)\nprint(ans)\n", "#input\r\nn = int(input())\r\n \r\n#calculation\r\ncount = 0\r\nn4=1\r\nfor i in range(1, 2000):\r\n n4 = n4<<1\r\n if(n4 > int(n/2)):\r\n break\r\n \r\nfor a in range(1, n4):\r\n if((a & (a-1))!=0):\r\n for b in range(a+1, n+1):\r\n c = a^b\r\n if c>b and c <=n and a+b!=c:\r\n #print(bin(a)[2:],bin(b)[2:],bin(c)[2:])\r\n count += 1\r\n \r\n#output\r\nprint(count)" ]

[ "s=list(input()+'a')\r\nfor i in range(len(s)-2):\r\n if s[i]==s[i+1]:\r\n s[i+1]=list({'a', 'b', 'c'}-{s[i]}-{s[i+2]})[0]\r\nprint(''.join(s[:-1]))\r\n", "def add(a, b):\r\n for j in range(26):\r\n c = chr(j + ord('a'))\r\n if(c != a and c != b):\r\n return c\r\n \r\n\r\ns = list(input())\r\nn = len(s)\r\nfor i in range(1, n - 1):\r\n if(s[i] == s[i - 1]):\r\n s[i] = add(s[i - 1], s[i + 1])\r\nif(n > 1):\r\n if(s[-1] == s[-2]):\r\n for j in range(26):\r\n c = chr(j + ord('a'))\r\n if(c != s[-2]):\r\n s[-1] = c \r\n break \r\n \r\nprint(''.join(s))\r\n \r\n \r\n ", "\"\"\"\nSummary of Code:\n- Gets the string, convert it to string\n- change the substring of the same letter with minimum difference\n\nTime Complexity:\n- O(2N) => O(N)\n\nSpace Complexity:\n- O(N)\n\nWhy the chosen algorithm are good:\n- the maximum of N is 2*10^5 and time complexity is O(N)\n- thus it should be fast enough\n\"\"\"\ns = list(input()) + [\"\"]\nj = 0\nfor i in range(len(s)):\n if s[j] == s[i]:\n continue\n else:\n for k in range(j+((i-j)&1),i,2):\n if 0 < k < len(s)-1:\n s[k] = \"a\" if \"a\" not in {s[k-1], s[k+1]} else \"b\" if \"b\" not in {s[k-1], s[k+1]} else \"c\"\n elif k == 0:\n s[k] = \"a\" if s[k+1] != \"a\" else \"b\"\n elif k == len(s)-1:\n s[k] = \"a\" if s[k-1] != \"a\" else \"b\"\n j = i\nprint(\"\".join(s))\n \t \t \t\t \t\t\t\t \t\t\t\t \t\t \t", "t = input() + ' '\r\ns = ' '\r\nfor a, b in zip(t, t[1:]):\r\n if a == s[-1]:\r\n for q in 'abc':\r\n if a != q != b:\r\n s += q\r\n break\r\n else: s += a\r\nprint(s[1:])", "from math import *\r\nfrom copy import *\r\nfrom collections import *\r\nfrom heapq import *\r\ndef solve():\r\n s=list(input())\r\n s.append('x')\r\n alp='abcdefghijklmnopqrstuvwxyz'\r\n for i in range(len(s)-1):\r\n if(s[i]==s[i+1]):\r\n for j in range(26):\r\n if s[i]!=alp[j] and s[i+2]!=alp[j]:\r\n s[i+1]=alp[j];break;\r\n print(''.join(s[:-1]))\r\n# for _ in range(int(input())):solve()\r\nsolve()", "s=input()\r\nif len(s)%2==0:\r\n s+='#'\r\ns=list(s)\r\nn=len(s)\r\nfor i in range(n-1):\r\n if s[i]==s[i+1]:\r\n s[i+1]=list({'a','b','c'}-{s[i]}-{s[i+2]})[0]\r\nt=\"\".join(s)\r\nif t[-1]=='#':\r\n print(t[:n-1])\r\nelse:\r\n print(t)", "s = str(input())\nn = len(s)\nL = [s[i] for i in range(n)]\nA = \"abcdefghijklmnopqrstuvwxyz\"\nancien = \"#\"\nactuel = s[0]\ni = 1\nd = 0\nwhile i < n:\n while i < n and s[i] == actuel:\n i += 1\n j = 0\n while A[j] == ancien or A[j] == actuel or (i < n and A[j] == s[i]):\n j += 1\n for l in range(d+1,i,2):\n L[l] = A[j]\n ancien = actuel\n if i < n:\n actuel = s[i]\n d = i\nfor i in range(n):\n print(L[i],end=\"\")\n", "s = list(input())\r\nn = len(s)\r\nfor i in range(0,n-1,1):\r\n if s[i] == s[i+1]:\r\n if i > n-3:\r\n if s[i] != \"z\":\r\n s[i+1] = \"z\"\r\n else:\r\n s[i+1] = \"y\"\r\n else:\r\n if s[i] != \"z\" and s[i+2] != \"z\":\r\n s[i+1] = \"z\"\r\n elif s[i] != \"y\" and s[i+2] != \"y\":\r\n s[i+1] = \"y\"\r\n else:\r\n s[i+1] = \"x\"\r\nprint(\"\".join(s))\r\n \r\n", "#import sys\r\n#import bisect\r\n#def get_line(): return list(map(int,sys.stdin.readline().strip().split()))\r\n#def in1(): return int(input())\r\n\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\n\r\ns1=list(str(input()))\r\nt1=len(s1)\r\nfor i in range(len(s1)):\r\n if i==0:\r\n t2=s1[0]\r\n else:\r\n if (i+1)<t1:\r\n t3=s1[i+1]\r\n if t2==s1[i]:\r\n for j in b:\r\n if j!=t3 and j!=t2:\r\n s1[i]=j\r\n t2=j\r\n break\r\n else:\r\n t2=s1[i]\r\n else:\r\n if t1>1:\r\n if s1[t1-1]==s1[t1-2]:\r\n for j in b:\r\n if j!=t2 and j!=s1[t1-2]:\r\n s1[t1-1]=j\r\n break\r\ns=\"\"\r\ns=s.join(s1)\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", "s=input()\r\narr=[]\r\nfor i in s:\r\n\tarr.append(i)\r\ni=0\r\nj=0\r\nwhile i<len(arr) and j<len(arr):\r\n\twhile j<len(arr) and arr[i]==arr[j]:\r\n\t\tj+=1\r\n\tcc=ord('a')\r\n\twhile cc==ord(arr[i]) or (i>0 and cc==ord(arr[i-1])) or (j<len(arr) and cc==ord(arr[j])):\r\n\t\tcc+=1\r\n\tfor k in range(i,j):\r\n\t\tif (i+k)%2==1:\r\n\t\t\tarr[k]=chr(cc)\r\n\ti=j\r\nprint(''.join(arr))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input().rstrip()) + [\"?\"]\r\nfor i in range(len(s) - 2):\r\n if s[i] == s[i + 1]:\r\n x = set([s[i], s[i + 2]])\r\n for j in [\"a\", \"b\", \"c\"]:\r\n if not j in x:\r\n s[i + 1] = j\r\n break\r\ns.pop()\r\nprint(\"\".join(s))", "ch=input()\r\nl=list(ch)\r\nif len(l)==1:\r\n print(ch)\r\nelse: \r\n k=list(\"abcdefghijklmnopqrstuvwxyz\")\r\n for i in range(1,len(ch)-1):\r\n if l[i-1]==l[i]:\r\n for j in k:\r\n if j!=l[i+1] and j!=l[i-1]:\r\n l[i]=j\r\n break\r\n if l[len(l)-1]==l[len(l)-2]:\r\n for j in k:\r\n if j!=l[len(l)-2]:\r\n l[len(l)-1]=j\r\n break\r\n print(\"\".join(l)) ", "s = list(input().strip())\nn = len(s)\ncost = 0\nfor i in range(1, n):\n if s[i] == s[i - 1]:\n c = ord('a')\n a = ord(s[i - 1])\n b = a\n if i + 1 < n:\n b = ord(s[i + 1])\n while c in [a, b]:\n c += 1\n c = chr(c)\n s[i] = c\n cost += 1\ns = \"\".join(s)\nprint(s)\n", "a = list(input())\r\nper = ('a', 'b', 'c')\r\nfor i in range(1,len(a)):\r\n per2 = True\r\n if a[i] == a[i-1]:\r\n for j in per:\r\n if i < len(a)-1:\r\n if a[i+1] != j and j != a[i-1]:\r\n a[i] = j\r\n break\r\n else:\r\n if a[i-1] != j:\r\n a[i] = j\r\n break\r\nprint(''.join(a))", "s = list(input())\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in range(len(s)-1):\r\n if s[i] == s[i+1]:\r\n if len(s)>i+2:\r\n for j in alpha:\r\n if j != s[i+2] and j != s[i]:\r\n s[i+1] = j\r\n else:\r\n for j in alpha:\r\n if j != s[i]:\r\n s[i+1] = j\r\nprint(''.join(s))", "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\n\r\ndef main():\r\n\ts = input().strip()+\"y\"\r\n\tans = \"\"\r\n\ti = 0\r\n\talphs = {i-97: chr(i) for i in range(97, 123)}\r\n\t# print(alphs)\r\n\twhile i < len(s)-1:\r\n\t\tif not ans:\r\n\t\t\tans += s[i]\r\n\t\telif ans[-1] == s[i]:\r\n\t\t\tind = 0\r\n\t\t\twhile ind == ord(ans[-1])-97 or ind == ord(s[i+1])-97:\r\n\t\t\t\tind += 1\r\n\t\t\t\tind %= 26\r\n\r\n\t\t\tans += alphs[ind]\r\n\t\telse:\r\n\t\t\tans += s[i]\r\n\t\ti += 1\r\n\tprint(ans)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "a = input()\r\nn=len(a)\r\nfor i in range(1,n):\r\n x,y=a[i],a[i-1]\r\n if x==y:\r\n if i==n-1:\r\n if x==y=='a':\r\n a=a[:i]+'b'\r\n else:\r\n a=a[:i]+'a'\r\n else:\r\n z=a[i+1]\r\n if x==z:\r\n if x=='a':\r\n a=a[:i]+'b'+a[i+1:]\r\n else:\r\n a=a[:i]+'a'+a[i+1:]\r\n else:\r\n if x!='a' and z!='a':\r\n a=a[:i]+'a'+a[i+1:]\r\n continue\r\n if x!='b' and z!='b':\r\n a=a[:i]+'b'+a[i+1:]\r\n continue\r\n if x!='c' and z!='c':\r\n a=a[:i]+'c'+a[i+1:]\r\nprint(a)", "S = list(input())\n\nN = len(S)\n\nS.append('?')\n\nfor i in range(1, N):\n if S[i - 1] == S[i]:\n for l in \"abc\":\n if l != S[i - 1] and l != S[i + 1]:\n S[i] = l\n break\n\nS.pop()\n\nprint(''.join(S))\n\n\n", "s = list(map(lambda c: ord(c), input()))\r\n\r\nfor i in range(1, len(s)):\r\n if s[i - 1] != s[i]:\r\n continue\r\n left = s[i - 1]\r\n right = s[i + 1] if i + 1 < len(s) else -1\r\n for x in range(ord('a'), ord('z') + 1):\r\n if x != left and x != right:\r\n s[i] = x\r\n break\r\n\r\nprint(''.join((map(lambda c: chr(c), s))))\r\n", "a = list(input())\r\nl = len(a)\r\nfor i in range(1, l):\r\n if a[i] == a[i-1]:\r\n if i < l-1:\r\n if a[i-1] != \"a\" and a[i+1] != \"a\":\r\n a[i] = \"a\"\r\n elif a[i-1] != \"b\" and a[i+1] != \"b\":\r\n a[i] = \"b\"\r\n elif a[i-1] != \"c\" and a[i+1] != \"c\":\r\n a[i] = \"c\"\r\n else:\r\n if a[i-1] != \"a\":\r\n a[i] = \"a\"\r\n elif a[i-1] != \"b\":\r\n a[i] = \"b\"\r\nprint(\"\".join(a))\r\n", "'''\r\n /\\\r\n / `.\r\n ,' `.\r\n /`.________ ( :\r\n \\ `. _\\_______ )\r\n \\ `.----._ `. \"`-.\r\n ) \\ \\ ` ,\"__\\\r\n \\ \\ ) ,-- (/o\\\\\r\n ( _ `. `---' ,--. \\ _)).\r\n `(-',-`----' ( (O \\ `--,\"`-.\r\n `/ \\ \\__) ,' O )\r\n / `--' ( O ,'\r\n ( `--,'\r\n \\ `== _.-'\r\n \\ .____.-;-'\r\n -hrr- ) `._ /\r\n ( |`-._\\ | ,' /\r\n `.__|__/ \"\\ |' /\r\n `._|_,'\r\n\r\nHAS ANYONE SEEN MY RIDER?\r\n----------------------------------CODING SUCKS----------YOUR STALKING DOES NOT THOUGH------\r\n\r\n'''\r\n\r\n\r\ns = list(input())\r\nl = ['a','b','c']\r\nl = set(l)\r\nif len(s)==1:\r\n ans = \"\"\r\n for i in s:\r\n ans = ans + i\r\n print(ans)\r\n exit()\r\nif len(s)==2:\r\n if s[0]==s[1]:\r\n t = list(l - set(list(s[0])))\r\n s[1] = t[0]\r\n ans = \"\"\r\n for i in s:\r\n ans = ans + i\r\n print(ans)\r\n exit()\r\n\r\n else:\r\n ans = \"\"\r\n for i in s:\r\n ans = ans + i\r\n print(ans)\r\n\r\n exit()\r\nfor i in range(1,len(s)-1):\r\n if s[i-1]!=s[i]:\r\n pass\r\n else:\r\n tt = list([s[i - 1], s[i + 1]])\r\n t = l - set(tt)\r\n t = list(t)\r\n s[i] = t[0]\r\n\r\nif s[-2]==s[-1]:\r\n tt = list([s[- 1], s[-3]])\r\n t = l - set(tt)\r\n t = list(t)\r\n s[-1] = t[0]\r\nans = \"\"\r\nfor i in s:\r\n ans = ans + i\r\nprint(ans)", "s = list(input())\nlast = \"\"\n\nfor i in range(len(s)):\n\tif s[i] == last:\n\t\tif i + 1 == len(s):\n\t\t\tif last != \"a\":\n\t\t\t\ts[i] = \"a\"\n\t\t\telse:\n\t\t\t\ts[i] = \"b\"\n\t\telse:\n\t\t\tif s[i+1] != \"a\" and last != \"a\" :\n\t\t\t\ts[i] = \"a\"\n\t\t\telif s[i+1] == \"b\" or last == \"b\":\n\t\t\t\ts[i] = \"c\"\n\t\t\telse:\n\t\t\t\ts[i] = \"b\"\n\tlast = s[i]\n\nprint(\"\".join(s))", "l=list(input())\r\ns='abcd'\r\nn=len(l)\r\nfor i in range(len(l)-1):\r\n if(l[i]==l[i+1]):\r\n for j in range(len(s)):\r\n if(s[j]!=l[i]):\r\n l[i+1]=s[j]\r\n if(i<n-2 and l[i+1]==l[i+2]):\r\n for k in range(len(s)):\r\n if(s[k]!=l[i] and s[k]!=l[i+2]):\r\n l[i+1]=s[k]\r\n break\r\n break\r\nprint(\"\".join(l))", "s = list(input())\nalphabet = ['a', 'b', 'c']\nif len(s) == 1:\n print(s[0])\n exit()\nif len(s) == 2 and s[0] == s[1]:\n symbol = ''\n for item in alphabet:\n if item != s[0]:\n symbol = item\n s[0] = symbol\nfor i in range(len(s) - 2):\n if s[i] == s[i + 1] and s[i] != s[i + 2]:\n central_symbol = ''\n for item in alphabet:\n if item != s[i] and item != s[i + 2]:\n central_symbol = item\n s[i + 1] = central_symbol\n elif s[i] == s[i + 1] == s[i + 2]:\n central_symbol = ''\n for item in alphabet:\n if item != s[i]:\n central_symbol = item\n s[i + 1] = central_symbol\nif s[-2] == s[-1]:\n symbol = ''\n for item in alphabet:\n if item != s[-2]:\n symbol = item\n s[-1] = symbol\nprint(''.join(s))\n", "s=input()\r\nnow='#'\r\nal='abc'\r\nfor i in range(len(s)):\r\n if s[i]==now:\r\n if i+1!=len(s):\r\n for j in range(3):\r\n if al[j]!=now and al[j]!=s[i+1]:\r\n print(al[j],end='')\r\n now=al[j]\r\n break\r\n else:\r\n for j in range(3):\r\n if al[j]!=now:\r\n print(al[j],end='')\r\n now=al[j]\r\n break\r\n else:\r\n print(s[i],end='')\r\n now=s[i]", "s = list(input())\r\n\r\nprev = s[0]\r\n\r\ni = 1\r\nwhile i < len(s):\r\n if s[i] == prev:\r\n for sym in 'xyz':\r\n if sym != s[i-1] and (i + 1 >= len(s) or sym != s[i+1]):\r\n s[i]=sym\r\n break\r\n\r\n if i + 1 < len(s):\r\n prev = s[i+1]\r\n i += 1\r\n else:\r\n prev = s[i]\r\n i += 1\r\n\r\nprint(''.join(s))\r\n\r\n ", "n=list(input())\r\nn.append('e')\r\nl=['a','b','c']\r\nv=len(n)\r\nfor i in range(1,v):\r\n\tj=0\r\n\tif n[i]==n[i-1] :\r\n\t\tn[i]=l[j]\r\n\t\twhile n[i]==n[i-1] or n[i]==n[i+1]:\r\n\t\t\tj+=1 \r\n\t\t\tn[i]=l[j]\r\nprint(\"\".join(n[:v-1]))", "# from debug import debug\r\nimport sys;input = sys.stdin.readline\r\na = ord('a')\r\ns = list(input().strip())\r\nn = len(s)\r\nstore = []\r\nl, r = 0, 0\r\nfor i in range(1, n):\r\n\tif s[i-1] == s[i]:\r\n\t\tr = i\r\n\telse:\r\n\t\tif l<r: store.append((l, r))\r\n\t\tl = i\r\nif l<r: store.append((l,r))\r\nfor x in store:\r\n\tif (x[1]-x[0]+1)&1:\r\n\t\tfor i in range(x[0], x[1]+1):\r\n\t\t\tif (i-x[0])&1: s[i] = chr(((ord(s[i])+1-a)%26)+a)\r\n\telse:\r\n\t\tif x[1] == n-1:\r\n\t\t\tlast = chr(((ord(s[x[0]])+1-a)%26)+a)\r\n\t\telse:\r\n\t\t\tfor i in range(26):\r\n\t\t\t\tif chr(i+a) != s[x[0]] and chr(i+a) != s[x[1]+1]:\r\n\t\t\t\t\tlast = chr(i+a)\r\n\t\t\t\t\tbreak\r\n\t\tfor i in range(x[0], x[1]+1):\r\n\t\t\tif (i-x[0])&1: s[i] = last\r\nprint(*s, sep=\"\")", "def main():\n l = list(input())\n l.append(\"ab\"[l[-1] == 'a'])\n a = l.pop(0)\n r = [a]\n for i, b in zip(range(1, len(l)), l):\n if a == b:\n c = l[i]\n for b in 'a', 'b', 'c':\n if a != b != c:\n break\n r.append(b)\n a = b\n print(''.join(r))\n\n\nif __name__ == '__main__':\n main()\n", "a=list(input())\r\nn=len(a)\r\nfor i in range(n-1):\r\n if(a[i]==a[i+1]):\r\n if (a[i]=='a'):\r\n if( i<n-2 and a[i+2]=='b'):\r\n a[i+1]='c'\r\n else:\r\n a[i+1]='b'\r\n elif (a[i]=='b'):\r\n if( i<n-2 and a[i+2]=='a'):\r\n a[i+1]='c'\r\n else:\r\n a[i+1]='a'\r\n else:\r\n if( i<n-2 and a[i+2]=='a'):\r\n a[i+1]='b'\r\n else:\r\n a[i+1]='a'\r\nprint(''.join(a[:]))", "s=list(input())\r\nleng=len(s)\r\nlet=['a','b','c']\r\nl=[0]*leng\r\nfor i in range(leng-1):\r\n if s[i]==s[i+1]:\r\n l[i]=1\r\ni=0\r\nwhile i<leng-1:\r\n if l[i]==1:\r\n if l[i+1]==1:\r\n for j in let:\r\n if s[i]!=j and s[i+2]!=j:\r\n s[i+1]=j\r\n i+=1\r\n break\r\n else:\r\n for j in let:\r\n if s[i-1]!=j and s[i+1]!=j:\r\n s[i]=j\r\n break\r\n else:\r\n s[i]=s[i]\r\n i+=1\r\nprint(''.join(s))\r\n", "def make_simple_string(s):\r\n n = len(s)\r\n s_list = list(s)\r\n \r\n for i in range(1, n):\r\n if s_list[i] == s_list[i - 1]:\r\n for c in 'abcdefghijklmnopqrstuvwxyz':\r\n if c != s_list[i - 1] and (i == n - 1 or c != s_list[i + 1]):\r\n s_list[i] = c\r\n break\r\n \r\n return ''.join(s_list)\r\n\r\n# Read input\r\ns = input().strip()\r\n\r\n# Get the simple string\r\nsimple_s = make_simple_string(s)\r\n\r\n# Print the result\r\nprint(simple_s)", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nprint = stdout.write\r\ns = list(input())\r\ns.pop()\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i-1] and i != len(s)-1:\r\n if s[i-1] != 'a' and s[i+1] != 'a':\r\n s[i] = 'a'\r\n elif s[i-1] != 'b' and s[i+1] != 'b':\r\n s[i] = 'b'\r\n elif s[i-1] != 'c' and s[i+1] != 'c':\r\n s[i] = 'c'\r\n if i == len(s)-1 and s[i] == s[i-1]:\r\n if s[i-1] != 'a':\r\n s[i] = 'a'\r\n else:\r\n s[i] = 'b'\r\nprint(''.join(s))", "s = list(input())\r\nl = len(s)\r\nfor i in range(1, l):\r\n if s[i] == s[i-1] and i != l-1:\r\n if s[i-1] != \"a\" and s[i+1] != \"a\":\r\n s[i] = \"a\"\r\n elif s[i-1] != \"b\" and s[i+1] != \"b\":\r\n s[i] = \"b\"\r\n elif s[i-1] != \"c\" and s[i+1] != \"c\":\r\n s[i] = \"c\"\r\n elif s[i-1] != \"d\" and s[i+1] != \"d\":\r\n s[i] = \"d\"\r\n if i == l-1 and s[i] == s[i-1]:\r\n if s[i-1] != \"a\":\r\n s[i] = \"a\"\r\n else:\r\n s[i] = \"b\"\r\nprint(\"\".join(s))\r\n", "s = input()\r\nn = len(s)\r\nans = list(s)\r\ni=j=0\r\nwhile i<n and j<n:\r\n while j<n and s[i]==s[j]: j += 1\r\n ch = 'a'\r\n while ch==s[i] or (i>0 and s[i-1]==ch) or (j<n and s[j]==ch):\r\n ch = chr(ord(ch)+1)\r\n for k in range(i+1,j,2): ans[k] = ch\r\n i = j\r\nprint(\"\".join(ans))", "\r\n\r\nfrom collections import defaultdict\r\n\r\ndef main():\r\n #\r\n # t = int(input())\r\n # for _ in range(t):\r\n #n = int(input())\r\n #a, b, p = list(map(int, input().split()))\r\n #a = list(map(int, input().split()))\r\n s = input()\r\n l = len(s)\r\n start = 0\r\n options = ['a','b', 'c']\r\n ans = ''\r\n for i in range(1,l):\r\n if s[i-1]== s[i] and start == 0:\r\n start=1\r\n startpos = i-1\r\n elif s[i-1]!= s[i] and start == 1:\r\n start = 0\r\n endpos = i\r\n r = endpos-startpos\r\n\r\n if s[endpos] == 'a':\r\n if s[endpos-1] == 'b':\r\n option = 'c'\r\n else:\r\n option = 'b'\r\n else:\r\n if s[endpos-1] != 'a':\r\n option = 'a'\r\n else:\r\n if s[endpos] == 'b':\r\n option = 'c'\r\n else:\r\n option = 'b'\r\n\r\n flag = 0\r\n for j in range(startpos,endpos):\r\n if flag == 0:\r\n ans+= s[j]\r\n flag = 1\r\n else:\r\n ans+= option\r\n flag = 0\r\n\r\n\r\n\r\n elif s[i - 1] != s[i] and start == 0:\r\n ans+=s[i-1]\r\n\r\n if start ==1:\r\n endpos = l\r\n r = endpos - startpos\r\n\r\n if s[endpos-1] == 'a':\r\n option = 'c'\r\n else:\r\n option = 'a'\r\n\r\n\r\n flag = 0\r\n for j in range(startpos, endpos):\r\n if flag == 0:\r\n ans += s[j]\r\n flag = 1\r\n else:\r\n ans += option\r\n flag = 0\r\n else:\r\n ans+= s[-1]\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math;\r\nfrom math import gcd,sqrt,floor,factorial,ceil\r\nfrom bisect import bisect_left,bisect_right\r\nimport bisect;\r\nimport sys;\r\nfrom sys import stdin,stdout\r\nimport os\r\nsys.setrecursionlimit(pow(10,7))\r\nimport collections\r\nfrom collections import defaultdict,Counter\r\nfrom statistics import median\r\n# input=stdin.readline\r\n# print=stdout.write\r\nfrom queue import Queue\r\ninf = float(\"inf\")\r\nfrom operator import neg;\r\ndef incrementor(s):\r\n char=ord(s)\r\n char+=1\r\n if char>ord(\"z\"):\r\n return \"a\"\r\n return chr(char)\r\ndef string(s):\r\n if len(s)==2:\r\n if s[0]==s[1]:\r\n s[0]=incrementor(s[0])\r\n for i in range(1,n-1):\r\n\r\n while s[i]== s[i+1] and s[i]==s[i-1]:\r\n s[i]=incrementor(s[i])\r\n for i in range(1,n-1):\r\n while s[i]== s[i+1] or s[i]==s[i-1]:\r\n s[i]=incrementor(s[i])\r\n return s;\r\n\r\ns=list(input())\r\nn=len(s)\r\nans=string(s)\r\nans=\"\".join(ans)\r\nprint(ans)\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\ndef wer(a,b):\r\n x=\"abcdefghijklmnopqrstuvwxyz\"\r\n for i in x:\r\n if i!=a and i!=b:\r\n return i\r\n\r\ns=input().strip()\r\ns=list(s)\r\nif(len(s)==1):\r\n print(*s)\r\nelse:\r\n for i in range(1,len(s)):\r\n if(s[i]==s[i-1]):\r\n if(i==len(s)-1):\r\n s[i]=wer(\"a\",s[i])\r\n else:\r\n s[i]=wer(s[i-1],s[i+1])\r\n for i in s:\r\n print(i,end=\"\")\r\n", "s = input()\r\nlast=None\r\no = s[0]\r\nfor i in range(1,len(s)):\r\n if s[i]==o[-1]:\r\n letras=[\"a\",\"b\",\"c\"]\r\n if o[-1] in letras:\r\n letras.remove(o[-1])\r\n if i<len(s)-1 and s[i+1] in letras:\r\n letras.remove(s[i+1])\r\n o+=letras[0]\r\n else:\r\n o+=s[i]\r\nprint(o)\r\n", "# import string\n\ndef read_int_array():\n return [int(x) for x in input().split(\" \")] \n\ndef read_int():\n return int(input())\n\nalphabets = 'abcdefghijklmnopqrstuvwxyz'\n\ndef main():\n s = input()\n ans = ''\n ans += s[0]\n for i in range(1,len(s)):\n if s[i] == ans[-1]:\n candidates = ans[:-1] + s[i+2:] + alphabets\n for c in candidates:\n if c != ans[-1] and (i==len(s)-1 or c != s[i+1]):\n ans += c\n break\n else:\n ans += s[i]\n print(ans)\n\nif __name__ == \"__main__\":\n main()\n\t \t\t \t\t\t\t \t \t \t \t \t\t", "s = list(input())\r\nalen = len(s)\r\nfor i in range(1,alen):\r\n if s[i] == s[i-1]:\r\n if i == alen-1:\r\n if s[i-1] == 'x':\r\n s[i] = 'y'\r\n else:\r\n s[i] = 'x'\r\n elif s[i-1] != 'x' and s[i+1] != 'x':\r\n s[i] = 'x'\r\n elif s[i-1] != 'y' and s[i+1] != 'y':\r\n s[i] = 'y'\r\n else:\r\n s[i] = 'z'\r\nprint(\"\".join(x for x in s))\r\n", "s=list(input())\r\nif len(s)==1: print(s[0])\r\nelse:\r\n for i in range(1,len(s)):\r\n if s[i]==s[i-1]:\r\n if s[i]!='z' and (i==len(s)-1 or s[i+1]!='z'): s[i]='z'\r\n elif s[i]!='b' and (i==len(s)-1 or s[i+1]!='b'): s[i]='b'\r\n else: s[i]='a'\r\n for item in s: print(item,end=\"\")", "st = input()\r\nx = 'abcd'\r\nelem = st[0]\r\nfor i in range(1, len(st)):\r\n if st[i] == elem[i - 1]:\r\n j = 0\r\n while x[j] == elem[i - 1] or (i + 1 < len(st) and x[j] == st[i + 1]):\r\n j += 1\r\n elem += x[j]\r\n else:\r\n elem += st[i]\r\nprint(elem)", "s=input()+'.'\r\nr=['.']\r\ntemp='abc'\r\nfor i,j in zip(s,s[1:]):\r\n if i==r[-1]:\r\n for k in temp:\r\n if k!=i and k!=j:\r\n r+=[k]\r\n break\r\n else:\r\n r+=[i]\r\nprint(''.join(r[1:]))", "l = [chr(97+i) for i in range(26)]\r\n\r\ns=input()\r\ns = list(s)\r\nfor i in range(1,len(s)):\r\n if s[i]==s[i-1]:\r\n for j in l:\r\n if j!=s[i]:\r\n if i==len(s)-1:\r\n s[i]=j\r\n break\r\n elif j!=s[i+1]:\r\n s[i]=j\r\n break\r\nprint(\"\".join(s))", "#just check for previouse and next ele\r\n#ans change it\r\ns=[i for i in input()];n=len(s)\r\nfor i in range(1,len(s)):\r\n if s[i]==s[i-1]:\r\n if i+1<n:\r\n for c in 'abcdefghi':\r\n if c!=s[i-1] and c!=s[i+1]:s[i]=c;break\r\n else:\r\n for c in 'abcbdefghi':\r\n if c!=s[i-1]:s[i]=c;break\r\nprint(\"\".join(s))\r\n", "s=input()\r\n\r\nr=\"\";r+=s[0]\r\nfor i in range(1,len(s)):\r\n if i!=len(s)-1:\r\n if s[i]!=r[-1]:\r\n r+=s[i]\r\n else:\r\n for j in range(97,97+26):\r\n if chr(j)!=r[-1] and chr(j)!=s[i+1]:\r\n r+=chr(j)\r\n break\r\n else:\r\n if s[i]!=r[-1]:\r\n r+=s[i]\r\n else:\r\n for j in range(97,97+26):\r\n if chr(j)!=r[-1]:\r\n r+=chr(j)\r\n break\r\n\r\nprint(r)", "s=input()\r\nk=0\r\nn=len(s)\r\nd=[0]*n\r\nl=['a','b','c','d','e']\r\nd[0]=s[0]\r\nf=0\r\nfor i in range(1,n):\r\n if s[i]==s[i-1]:\r\n if k==0:\r\n f=i-1\r\n k+=1\r\n elif k==0:\r\n d[i]=s[i]\r\n else:\r\n k=0\r\n for z in range(f,i):\r\n if (z-f)%2==0:\r\n d[z]=s[z]\r\n else:\r\n for j in l:\r\n if d[z-1]!=j and s[z+1]!=j:\r\n d[z]=j\r\n break\r\nif k!=0:\r\n for z in range(f,n):\r\n if (z-f)%2==0:\r\n d[z]=s[z]\r\n else:\r\n for j in l:\r\n if z==n-1 and d[z-1]!=j:\r\n d[z]=j\r\n break\r\n \r\n elif d[z-1]!=j and s[z+1]!=j:\r\n d[z]=j\r\n break\r\n \r\nfor i in range(n):\r\n if d[i]==0:\r\n print(s[i],end='')\r\n else:\r\n print(d[i],end='')\r\n\r\n \r\n", "s = list(input())+['|']\r\nn = len(s)\r\nfor i in range(n-2):\r\n if s[i]==s[i+1]: s[i+1] = list({'a','b','c'}-{s[i]}-{s[i+2]})[0]\r\nprint(''.join(s[:-1]))", "string=input()+'?'\r\nt='abc'\r\nv=['?']\r\nfor i,j in zip(string,string[1:]):\r\n if i==v[-1]:\r\n for x in t:\r\n if x!=i and x!=j:\r\n v+=[x]\r\n break\r\n else:\r\n v+=[i]\r\nprint(''.join(v[1:]))\r\n", "s = input()+' '\r\nt = 'abc'\r\nr = s[0]\r\nfor i in range(1, len(s)-1):\r\n if s[i]==r[i-1]:\r\n j = 0\r\n while (t[j] == s[i] or t[j] == s[i+1]):\r\n j+=1\r\n r += t[j]\r\n else:\r\n r += s[i]\r\nprint(r)", "from collections import Counter\ns = input()\nc = Counter(s)\nchars = []\nfor x in c:\n chars.append(x)\nn = len(chars)\nm = len(s)\nif n <= 2:\n x = 0\n for i in range(97, 122):\n if chr(i) not in chars and x < 2:\n x += 1\n chars.append(chr(i))\nx = s[0]\nfor i in range(1, m):\n if s[i] != x[-1]:\n x+=s[i]\n elif i == m - 1:\n for y in chars:\n if y != s[i]:\n x += y\n break\n else:\n z = s[i + 1]\n for y in chars:\n if y != s[i] and y != z:\n x += y\n break\nprint(x)", "lis=['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 = list(input())+['#']\r\nn=len(s)\r\nfor i in range(1,n):\r\n if s[i]==s[i-1]:\r\n for j in lis:\r\n if j!=s[i] and j!=s[i+1]:\r\n s[i]=j\r\n break\r\nprint(''.join(s[:-1])) \r\n\r\n\r\n", "s = list(input())\r\n\r\n\r\ndef next(c):\r\n return chr((ord(c) - ord(\"a\") + 1) % 26 + ord(\"a\"))\r\n\r\n\r\ndef nextt(p, n):\r\n c = next(p)\r\n while c == p or c == n:\r\n c = next(c)\r\n\r\n return c\r\n\r\nfor i in range(1, len(s)-1):\r\n if s[i-1] == s[i] and s[i] == s[i+1]:\r\n s[i] = next(s[i])\r\n\r\n\r\nfor i in range(0, len(s)-1):\r\n if s[i] == s[i+1]:\r\n if i == 0:\r\n s[i] = next(s[i])\r\n elif i == len(s)-2:\r\n s[i+1] = next(s[i])\r\n else:\r\n s[i+1] = nextt(s[i+1], s[i+2])\r\n\r\nprint(\"\".join(s))", "from random import choice\r\n\r\ns = input()\r\nn = len(s)\r\nans = list()\r\n\r\nif len(s) == 1:\r\n print(s)\r\n\r\nelse:\r\n ans.append(s[0])\r\n for i in range(1, n):\r\n if s[i] != ans[i - 1]:\r\n ans.append(s[i])\r\n\r\n else:\r\n temp = {'a', 'c', 'm'}\r\n temp -= {ans[i - 1]}\r\n if i != n - 1:\r\n temp -= {s[i + 1]}\r\n\r\n ans.append(choice(list(temp)))\r\n\r\nprint(''.join(ans))\r\n", "# cook your dish here\r\ns=input()\r\ny=[]\r\nfor i in s:\r\n y.append(i)\r\ny.append(' ')\r\ni=1\r\nwhile i<len(y):\r\n if y[i]==y[i-1]:\r\n for j in 'abc':\r\n if y[i]!=j and y[i+1]!=j:\r\n y[i]=j\r\n break\r\n i+=1\r\nfor i in range(len(y)-1):\r\n print(y[i],end=\"\")", "p = {'a','b','c'}\r\ns=input();t=len(s)\r\nans=[s[0]]\r\nfor x in range(1,t):\r\n if ans[-1] == s[x]:\r\n if x+1 !=t:\r\n ans.append((p-{ans[-1],s[x+1]}).pop())\r\n else:\r\n ans.append((p-{ans[-1]}).pop())\r\n else:\r\n ans.append(s[x])\r\nprint(''.join(map(str,ans)))", "import sys\r\n\r\ns = sys.stdin.readline().strip()\r\n\r\ndef getPrime(s):\r\n s = list(s)\r\n for i in range(1,len(s),2):\r\n neighbors = [s[i-1],'']\r\n checkNext = True\r\n if i+1<len(s):\r\n neighbors[1] = s[i+1]\r\n if s[i]==neighbors[0] and s[i]==neighbors[1]:\r\n checkNext = False\r\n changeByPos = i\r\n if checkNext and (i+2<len(s)):\r\n if s[i]==s[i+1] and s[i]==s[i+2]:\r\n neighbors[0]=s[i]\r\n neighbors[1]=s[i]\r\n changeByPos+=1\r\n \r\n if s[changeByPos] in neighbors:\r\n if not 'a' in neighbors:\r\n s[changeByPos]='a'\r\n elif not 'b' in neighbors:\r\n s[changeByPos]='b'\r\n else:\r\n s[changeByPos]='c'\r\n return \"\".join(s)\r\n \r\n \r\n \r\nprint(getPrime(s))", "#Anuneet Anand\r\n \r\nS = list(input())\r\n \r\np = \"\"\r\nfor i in range(len(S)):\r\n\tif S[i]==p:\r\n\t\ta = chr((ord(p)-97+1)%26 + 97)\r\n\t\tif i!=len(S)-1 and a==S[i+1]:\r\n\t\t\ta = chr((ord(a)-97+1)%26 + 97)\r\n\t\tS[i]=a\t\r\n\t\tp = S[i]\r\n\telse:\r\n\t\tp = S[i]\r\n \r\nx = \"\".join(str(i) for i in S)\r\nprint(x)", "# for this problem, I used a greedy approach. If prev char is equal to current char, replace current char w the first letter that doesn't collide w prev and next of current char. Run and space time complexity is O(n).\nimport sys\ninp = sys.stdin.readline()\ns = list(inp)\n\ns.append('a')\n\nfor i in range(1, len(s)-1):\n if s[i] == s[i-1]:\n for j in range(26):\n if j + ord('a') == ord(s[i-1]) or j + ord('a') == ord(s[i+1]):\n continue\n s[i] = chr(j + ord('a'))\n break\nfor i in range(len(s)-1):\n print(s[i], end='')\n\n \t\t\t\t\t\t\t\t \t\t \t \t\t", "\r\nfrom sys import stdin\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\n\r\ns=list(input())\r\nn=len(s)\r\np = \"\"\r\nfor i in range(n):\r\n\tif s[i]==p:\r\n\t\ta = chr((ord(p)-97+1)%26 + 97)\r\n\t\tif i!=n-1 and a==s[i+1]:\r\n\t\t\ta = chr((ord(a)-97+1)%26 + 97)\r\n\t\ts[i]=a\t\r\n\t\tp = s[i]\r\n\telse:\r\n\t\tp = s[i]\r\nprint(\"\".join(s))\r\n\r\n", "s = input()+' '\r\nt = 'abc'\r\nr = [i for i in s]\r\nfor i in range(1, len(r)-1):\r\n if r[i]==r[i-1]:\r\n j = 0\r\n while (t[j] == r[i] or t[j] == r[i+1]):\r\n j+=1\r\n r[i] = t[j]\r\nprint(\"\".join(r)[:-1])", "from sys import stdin, stdout, setrecursionlimit\r\nimport threading\r\n\r\n# tail-recursion optimization\r\n# In case of tail-recusion optimized code, have to use python compiler.\r\n# Otherwise, memory limit may exceed.\r\n# declare the class Tail_Recursion_Optimization\r\nclass Tail_Recursion_Optimization:\r\n def __init__(self, RECURSION_LIMIT, STACK_SIZE):\r\n setrecursionlimit(RECURSION_LIMIT)\r\n threading.stack_size(STACK_SIZE)\r\n return None\r\n \r\nclass SOLVE:\r\n def solve(self):\r\n R = stdin.readline\r\n #f = open('input.txt');R = f.readline\r\n W = stdout.write\r\n \r\n s = list(R())\r\n l = len(s)\r\n for i in range(1, l):\r\n if i == l-1 and s[i] == s[i-1]:\r\n prev, pres = ord(s[i-1]), 97\r\n for j in range(26):\r\n if prev != pres:\r\n s[i] = chr(pres)\r\n break\r\n pres += 1\r\n elif s[i] == s[i-1]:\r\n prev, pres, nxt = ord(s[i-1]), 97, ord(s[i+1])\r\n for j in range(26):\r\n if prev != pres != nxt:\r\n s[i] = chr(pres)\r\n break\r\n pres += 1\r\n \r\n W(''.join(s))\r\n return 0\r\n \r\ndef main():\r\n s = SOLVE()\r\n s.solve()\r\n#Tail_Recursion_Optimization(10**7, 2**26) # recursion-call size, stack-size in byte\r\n#threading.Thread(target=main).start()\r\nmain()", "s=list(input())\r\nn=len(s)\r\ndef call(a,b):\r\n str=\"anfrozeyuibiu\"\r\n for i in str:\r\n if i!=a and i!=b:\r\n return i\r\ndef call1(a):\r\n str=\"urweifbn\"\r\n for i in str:\r\n if i!=a:\r\n return i \r\nfor i in range(1,n):\r\n if s[i]==s[i-1]:\r\n if i==n-1:\r\n s[i]=call1(s[i])\r\n else:\r\n s[i]=call(s[i],s[i+1])\r\nprint(*s,sep='')", "from sys import stdin,stdout\r\nz=list(stdin.readline())\r\nl=len(z)-1;i=0\r\nwhile i<l:\r\n k=i;p=z[i]\r\n while i<l and z[i]==p:i+=1\r\n r=k-i;t=''\r\n for r in 'ghk':\r\n if r!=p and r!=z[i]:t=r\r\n k+=1\r\n for i in range(k,i,2):z[i]=t\r\nstdout.write(''.join(z))", "import random\r\nimport string\r\ns = list(input())\r\nfor i in range(len(s)-2):\r\n if s[i] == s[i+1]:\r\n while s[i+1] == s[i] or s[i+1] == s[i+2]:\r\n s[i+1] = random.choice(string.ascii_lowercase)\r\ntry:\r\n while s[-1] == s[-2]:\r\n s[-2] = random.choice(string.ascii_lowercase)\r\nexcept: pass\r\nprint(''.join(s))", "s = list(input() + '_')\r\n\r\nfor i in range(1, len(s) - 1):\r\n if s[i] == s[i-1]:\r\n for ch in 'abc':\r\n if ch not in s[i-1]+s[i+1]:\r\n s[i] = ch\r\n break\r\n elif s[i] == s[i+1]:\r\n for ch in 'abc':\r\n if ch not in s[i]+s[i+2]:\r\n s[i+1] = ch\r\n break\r\n\r\nprint(''.join(s[:-1]))", "a = list(input())\r\nn=len(a)\r\nfor i in range(1,n):\r\n x,y=a[i],a[i-1]\r\n if x==y:\r\n if i==n-1:\r\n if x==y=='a':\r\n a[i]='b'\r\n else:\r\n a[i]='a'\r\n else:\r\n z=a[i+1]\r\n if x!='a' and z!='a':\r\n a[i]='a'\r\n continue\r\n if x!='b' and z!='b':\r\n a[i]='b'\r\n continue\r\n if x!='c' and z!='c':\r\n a[i]='c'\r\nprint(''.join(a))", "import sys\r\n#import random\r\nfrom bisect import bisect_right as rb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**8)\r\nfrom queue import PriorityQueue\r\nfrom math import *\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\nmod = 10**9 + 7\r\n\r\na = list(ip())\r\n\r\nn = len(a)\r\nfl = -1\r\nb = []\r\n\r\nfor i in range (n-1) :\r\n if (fl == -1 and a[i] == a[i+1]) :\r\n fl = i\r\n continue\r\n\r\n if (fl != -1 and a[i] == a[i+1]) :\r\n b.append(i)\r\n fl = -1\r\n continue\r\n\r\n if (fl != -1) :\r\n b.append(fl)\r\n fl = -1\r\n continue\r\n\r\nif (fl != -1) :\r\n b.append(fl)\r\n fl = -1\r\n\r\nfor i in b :\r\n for j in range (26) :\r\n\r\n ch = chr (97+j)\r\n\r\n if (i>0 and i<n) :\r\n if (ch != a[i-1] and ch != a[i+1]) :\r\n a[i] = ch\r\n break\r\n if (i == 0) :\r\n if (ch != a[i+1]) :\r\n a[i] = ch\r\n break\r\n\r\nprint(''.join(a))\r\n", "s = list(input().strip())\r\n\r\ni, j = 0, 0\r\nwhile i < len(s):\r\n while j < len(s) and s[j] == s[i]:\r\n j += 1\r\n \r\n c = 'a'\r\n\r\n while c == s[i] or (i > 0 and c == s[i - 1]) or (j < len(s) and c == s[j]):\r\n c = chr(ord(c) + 1)\r\n\r\n for k in range(i + 1, j, 2):\r\n s[k] = c\r\n\r\n i = j\r\n\r\nprint(''.join(s))\r\n", "s=[*input()]+[\"0\"]\r\nr=\"\"\r\nfor i in range(1,len(s)-1):\r\n if s[i]==s[i-1]:\r\n for j in \"qwertyuiopasdfghjklzxcvbnm\":\r\n if j!=s[i] and j!=s[i+1]:\r\n s[i]=j\r\n break\r\n \r\nprint(\"\".join(s[:-1]))", "\r\n# for divyanshu\r\n\r\ndef solve():\r\n\r\n s = list(input())\r\n n = len(s)\r\n a1 = 0\r\n for i in range(1, n):\r\n if s[i] == s[i-1]:\r\n a1 += 1\r\n for j in 'abcdefghijklmnopqrstuvwxyz':\r\n if i+1 < n:\r\n if s[i] != j and s[i+1] != j:\r\n s[i] = j\r\n break\r\n else:\r\n if s[i] != j:\r\n s[i] = j\r\n break\r\n print(*s, sep='')\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "import sys, string\ninput = sys.stdin.readline\n\ns = list(input())\n\nfor i in range(1, len(s)-1):\n if s[i-1] == s[i]:\n for j in string.ascii_lowercase:\n if j != s[i-1] and j != s[i+1]:\n s[i] = j\n break\n\nprint(''.join(s))\n", "Q=lambda:list(input())\r\nSI = lambda: input()\r\nVN = lambda: map(int,input().split())\r\nLV= lambda: [int(i) for i in input().split()]\r\nNI = lambda: int(input());s=Q();ss = set('abcdefghijklmnopqrstuvwxyz')\r\nfor i in range(1,len(s)):\r\n if s[i]==s[i-1]:\r\n k='khaeld'\r\n if i+1<len(s):k=s[i+1]\r\n res=ss.difference(set([s[i], k]));s[i]=res.pop()\r\nprint(''.join(s))", "s=[*input()]+[\" \"]\r\nfor i in range(1,len(s)-1):\r\n if s[i]==s[i-1]:\r\n for j in \"abc\":\r\n if j!=s[i-1] and j!=s[i+1]:\r\n s[i]=j\r\n break\r\nprint(\"\".join(s))", "alphabet = set('abcdefghijklmnopqrstuvwxyz')\r\n\r\ndef az_except(exception_list):\r\n d = list(alphabet.difference(set(exception_list)))\r\n return d[0]\r\n\r\ns = input()\r\nn = len(s)\r\na = list(s)\r\nused = [False] * n\r\nindex = []\r\nfor i in range(n - 1):\r\n if not used[i] and a[i] == a[i + 1]:\r\n used[i] = True\r\n used[i + 1] = True\r\n index.append(i + 1)\r\nfor i in range(len(index)):\r\n v = index[i]\r\n exl = [a[v - 1]]\r\n if v < n - 1:\r\n exl.append(a[v + 1])\r\n a[v] = az_except(exl)\r\nprint(''.join(a))\r\n", "def main():\n l, asc = list(input()), tuple(\"abcdefghijklmnopqrstuvwxyz\")\n a = l[-1]\n for b in asc:\n if a != b:\n break\n a = l.pop(0)\n l.append(b)\n res = [a]\n for i, b in zip(range(1, len(l)), l):\n if a == b:\n c = l[i]\n for b in asc:\n if a != b != c:\n break\n res.append(b)\n a = b\n print(''.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "def main():\n asc, d = \"abcdefghijklmnopqrstuvwxyz\", {}\n for a in asc:\n for c in asc:\n for b in asc:\n if a != b != c:\n d[a, c] = b\n break\n a, x, l = '*', 0, []\n for b in input():\n if a == b:\n x += 1\n else:\n l.append((a, x))\n a, x = b, 1\n del l[0]\n l.append((a, x))\n l.append((d[a, a], 0))\n a, x = l.pop(0)\n res = []\n f = res.append\n for b, y in l:\n if x & 1:\n if x > 1:\n f((a + d[a, a]) * (x // 2))\n f(a)\n else:\n if x > 2:\n f((a + d[a, a]) * (x // 2 - 1))\n f(a + d[a, b])\n a, x = b, y\n print(''.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "String = list(input())\r\nchng = dict()\r\nfor i in range(26): chng[chr(ord('a')+i)] = chr(ord('a')+i+1)\r\nchng['z'] = 'a'\r\nfor i in range(1, len(String)):\r\n if String[i] == String[i-1]:\r\n String[i] = chng[String[i]]\r\n if i+1 < len(String) and String[i] == String[i+1]: String[i] = chng[String[i]]\r\nprint(''.join(String))", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input()[:-1])\r\nfor i in range(1, len(s)):\r\n if s[i] == s[i-1]:\r\n if s[i-1] == 'a':\r\n if i < len(s)-1 and s[i+1] == 'b':\r\n s[i] = 'c'\r\n else:\r\n s[i] = 'b'\r\n else:\r\n if i < len(s)-1 and s[i+1] == 'a':\r\n if s[i-1] == 'b':\r\n s[i] = 'c'\r\n else:\r\n s[i] = 'b'\r\n else:\r\n s[i] = 'a'\r\n\r\nprint(''.join(s))", "s=list(input())+[\"A\"]\r\nm=len(s)\r\nfor i in range(m-2):\r\n if s[i]==s[i+1]:\r\n s[i+1]=list({\"a\",\"b\",\"c\"}-{s[i]}-{s[i+2]})[0]\r\nprint(\"\".join(s[:-1]))", "s = input()\nx = 'abcd'\nt = s[0]\nfor i in range(1, len(s)):\n if s[i] == t[i - 1]:\n j = 0\n while x[j] == t[i - 1] or (i + 1 < len(s) and x[j] == s[i + 1]):\n j += 1\n t += x[j]\n else:\n t += s[i]\nprint(t)", "import sys\nimport math\nimport itertools as it\nimport operator as op\nimport fractions as fr\n\n\nA = 'abcdefghijklmnopqrstuvwxyz'\nAd = dict(zip(A,range(len(A))))\nAdi = dict(zip(range(len(A)),A))\n\ns = sys.stdin.readline().strip()\n\nsi = list(map(lambda c: Ad[c], s))\n\ni = 0\nwhile i < len(si)-1:\n\n j = i+1\n while j < len(si) and si[i] == si[j]:\n j+=1\n\n if j-i > 1:\n c = (si[i] + 1) % len(A)\n if j < len(si) and c == si[j]:\n c = (si[j] + 1) % len(A)\n if c == si[i]:\n c = (si[j] - 1) % len(A)\n\n for k in range(i+1,j,2):\n si[k] = c\n\n i = j\n\n\ns = ''.join(list(map(lambda c: Adi[c], si)))\nprint(s)", "s=input()\r\nans=[]\r\nn=len(s)\r\nfor i in range(n):\r\n if ans and ans[-1]==s[i]:\r\n ng=set()\r\n ng.add(ans[-1])\r\n if i<n-1:\r\n ng.add(s[i+1])\r\n use='a'\r\n while use in ng:\r\n use=chr(ord(use)+1)\r\n ans.append(use)\r\n else:\r\n ans.append(s[i])\r\n\r\nprint(''.join(ans))", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nS=readline().rstrip()\r\nN=len(S)\r\nans_lst=[]\r\nfor s in S:\r\n if ans_lst and ans_lst[-1]!=None and ans_lst[-1]==s:\r\n ans_lst.append(None)\r\n else:\r\n ans_lst.append(s)\r\nfor i in range(N):\r\n if ans_lst[i]==None:\r\n for s in \"abc\":\r\n if i and ans_lst[i-1]==s or i<N-1 and ans_lst[i+1]==s:\r\n continue\r\n ans_lst[i]=s\r\n break\r\nprint(*ans_lst,sep=\"\")", "s = str(input()) + 'AA'\r\nst = s[0]\r\n\r\nlf = 0\r\nrg = 1\r\n\r\nres = []\r\n\r\nwhile lf < len(s) - 1 and rg < len(s):\r\n if s[rg] == st:\r\n rg += 1\r\n else:\r\n if rg - lf == 1:\r\n res.append(st)\r\n else:\r\n n = rg - lf\r\n diff = s[rg]\r\n if s[lf] in ['a','b'] and diff in ['a','b']:\r\n new = 'c'\r\n elif s[lf] == 'a':\r\n new = 'b'\r\n elif s[lf] == 'b':\r\n new = 'a'\r\n elif diff == 'a':\r\n new = 'b'\r\n else:\r\n new = 'a'\r\n t = (st + new) * (n // 2) \r\n t = (t + st) if n % 2 == 1 else t\r\n res.append(t)\r\n \r\n \r\n lf = rg\r\n rg += 1\r\n st = s[lf]\r\nprint(\"\".join(res))", "import sys\ninp = sys.stdin.readline()\ns = list(inp)\n\ns.append('a')\n\nfor i in range(1, len(s)-1):\n if s[i] == s[i-1]:\n for j in range(26):\n if j + ord('a') == ord(s[i-1]) or j + ord('a') == ord(s[i+1]):\n continue\n s[i] = chr(j + ord('a'))\n break\nfor i in range(len(s)-1):\n print(s[i], end='')\n\n \t \t \t\t \t \t\t\t\t \t", "s = list(input())\r\npre = s[0]\r\ni = 1\r\nwhile i<len(s):\r\n if s[i] == pre:\r\n for t in 'xyz':\r\n if (t != s[i-1]) and (i>=len(s)-1 or t != s[i+1]):\r\n s[i] = t\r\n break\r\n if i<len(s)-1:\r\n pre = s[i+1]\r\n i += 1\r\n else:\r\n pre = s[i]\r\n i += 1\r\nprint(''.join(s))", "a=input()\r\ns=a[0]\r\nk=1\r\nfor i in range(1,len(a)):\r\n if a[i]==a[i-1]:\r\n k+=1\r\n if(k%2==0):\r\n if(i==len(a)-1):\r\n if a[i]=='a':\r\n s+='b'\r\n else:\r\n s+='a'\r\n else:\r\n temp=3\r\n t='caba'\r\n if a[i+1]=='b' or a[i]=='b':\r\n temp-=2\r\n if a[i+1]=='a' or a[i]=='a':\r\n temp-=1\r\n s+=t[temp]\r\n else:\r\n s+=a[i]\r\n else:\r\n k=1\r\n s+=a[i]\r\nprint(s)\r\n\r\n", "s = input()\nn = len(s)\nfor i in range(1,n):\n if s[i]==s[i-1]:\n a = set(list(range(97, 123, 1)))\n b = ('?' if i == n - 1 else s[i + 1])\n c = set([ord(s[i]),ord(b)])\n a = a-c\n s = s[:i]+chr(a.pop())+s[i+1:]\nprint(s)", "s = input()\nn = len(s)\nif n==1:\n\tprint (s[0])\n\texit()\n\t\nans = s[0]\nfor i in range(1,n-1):\n\tif s[i]==ans[i-1]:\n\t\tif ans[i-1]==\"a\" or s[i+1]==\"a\":\n\t\t\tif ans[i-1]==\"b\" or s[i+1]==\"b\":\n\t\t\t\tans += \"c\"\n\t\t\telse:\n\t\t\t\tans += \"b\"\n\t\telse:\n\t\t\tans += \"a\"\n\telse:\n\t\tans += s[i]\nif s[-1]==ans[-1]:\n\tif ans[-1]==\"a\":\n\t\tans += \"b\"\n\telse:\n\t\tans += \"a\"\nelse:\n\tans += s[-1]\nprint (ans)", "__author__ = 'aste'\r\n\r\n\r\ndef main():\r\n s = input()\r\n n = len(s)\r\n\r\n letters = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\n res = list(s)\r\n for i in range(1, n):\r\n if res[i - 1] == res[i]:\r\n for j in letters:\r\n if j != res[i - 1] and (i == n - 1 or j != res[i + 1]):\r\n res[i] = j\r\n break\r\n\r\n print(\"\".join(res))\r\n\r\nmain()\r\n", "s = list(input())\nn = len(s)\n\nptr = 0\nwhile ptr<n-1:\n\tif s[ptr]==s[ptr+1]:\n\t\tpossible = ( chr ( ( ord(s[ptr])-1 - ord('a') )%26 +ord('a') ) , chr ( ( ord(s[ptr])+1 - ord('a') )%26 +ord('a') ) )\n\t\tif ptr!=n-2:\n\t\t\tif s[ptr+2] != possible[0]: s[ptr+1] = possible[0]\n\t\t\telse: s[ptr+1] = possible[1]\n\t\telse:\n\t\t\ts[ptr+1] = possible[0]\t\n\tptr += 1\n\nprint(''.join(s))", "def replace_adjacent_chars(s):\r\n s_list = list(s)\r\n\r\n for i in range(1, len(s_list)):\r\n if s_list[i] == s_list[i - 1]:\r\n # Replace the current character with a lowercase alphabet that is different\r\n if i != len(s_list) - 1:\r\n for j in range(97, 123):\r\n sam = chr(j)\r\n if s_list[i - 1] != sam and s_list[i + 1] != sam:\r\n s_list[i] = sam\r\n break\r\n else:\r\n for j in range(97, 123):\r\n sam = chr(j)\r\n if s_list[i - 1] != sam:\r\n s_list[i] = sam\r\n break\r\n\r\n # Convert the modified list back to a string\r\n modified_string = ''.join(s_list)\r\n\r\n return modified_string\r\n\r\n# Example usage\r\noriginal_string = input()\r\nmodified_string = replace_adjacent_chars(original_string)\r\nprint(modified_string)\r\n", "s = list(input())\r\nl, r = 0, 0\r\nf = True\r\nalf = ['a', 'b', 'c']\r\nfor i in range(len(s)-1):\r\n if s[i] == s[i+1] and f:\r\n l = i\r\n f = False\r\n elif not f:\r\n f = True\r\n r = i\r\n if (r-l)%2 == 1:\r\n r += 1\r\n s_ = set(s[l:r+1])\r\n c = ''\r\n for j in alf:\r\n if not (j in s_):\r\n c = j\r\n break\r\n for j in range(1, r-l+1, 2):\r\n s[l+j] = c\r\n \r\nif not f:\r\n r = len(s)-1\r\n if (r-l)%2 == 1:\r\n r += 1\r\n s_ = set(s[l:r+1])\r\n c = ''\r\n for j in alf:\r\n if not (j in s_):\r\n c = j\r\n break\r\n for j in range(1, r-l+1, 2):\r\n s[l+j] = c\r\nprint(*s, sep = '')\r\n", "def inc(a):\r\n return chr(97 + (ord(a)-96)%26)\r\n\r\nl = [i for i in input()]\r\ni = 1\r\nwhile i<len(l):\r\n if l[i] == l[i-1]:\r\n l[i] = inc(l[i])\r\n if i+1 < len(l) and l[i] == l[i+1]:\r\n l[i] = inc(l[i])\r\n i += 2\r\n continue\r\n i += 1\r\nprint(\"\".join(l))\r\n", "s=list(input())\r\ndah='abcdefghijklmnopqrstuvwxyz'\r\nfor i in range(len(s)-1):\r\n\tif s[i]==s[i+1]:\r\n\t\tif i+2<len(s):\r\n\t\t\tfor ch in dah:\r\n\t\t\t\tif ch!=s[i+2] and ch!=s[i]:\r\n\t\t\t\t\ts[i+1]=ch\r\n\t\telse:\r\n\t\t\tfor ch in dah:\r\n\t\t\t\tif ch!=s[i]:\r\n\t\t\t\t\ts[i+1]=ch\r\nfor i in range(len(s)):\r\n\tprint(s[i],end='')\r\n\t\t\r\n\t\t\t\r\n\t", "def next_char(ch):\r\n return chr(ord(ch) + 1 - 26 * (ord(ch) + 1 > ord('z')))\r\n\r\n\r\ndef change(x, L, R):\r\n nxt = next_char(x[L])\r\n if R < len(x) and (R - L) % 2 == 0 and x[R] == nxt:\r\n nxt = next_char(nxt)\r\n x[L + 1: R:2] = [nxt] * ((R - L) // 2)\r\n\r\n\r\ndef solution(s):\r\n x = list(s)\r\n idx = 1\r\n while idx < len(x):\r\n if x[idx] == x[idx - 1]:\r\n L = idx - 1\r\n while idx < len(x) and x[idx] == x[L]:\r\n idx += 1\r\n change(x, L, idx)\r\n idx += 1\r\n return ''.join(x)\r\n\r\n\r\ns = input()\r\nprint(solution(s))", "s = str(input())\r\nn = len(s)\r\ns = [ord(c)-ord('a') for c in s]\r\nans = []\r\nfor i, c in enumerate(s):\r\n if ans:\r\n if ans[-1] == c:\r\n if i != n-1:\r\n for d in range(26):\r\n if d != ans[-1] and d != s[i+1]:\r\n ans.append(d)\r\n break\r\n else:\r\n for d in range(26):\r\n if d != ans[-1]:\r\n ans.append(d)\r\n break\r\n else:\r\n ans.append(c)\r\n else:\r\n ans.append(c)\r\nans = [chr(c+ord('a')) for c in ans]\r\nprint(''.join(ans))\r\n", "alf = ['z', 'g', 'w']\r\nst = list(input())\r\nl, g = 0, 0\r\nbo = True\r\nfor i in range(len(st)-1):\r\n if st[i] == st[i+1] and bo:\r\n l = i\r\n bo = False\r\n elif not bo:\r\n bo = True\r\n g = i\r\n if (g-l)%2 == 1:\r\n g += 1\r\n sr = set(st[l:g+1])\r\n c = ''\r\n for j in alf:\r\n if not (j in sr):\r\n c = j\r\n break\r\n for j in range(1, g-l+1, 2):\r\n st[l+j] = c\r\n \r\nif not bo:\r\n g = len(st)-1\r\n if (g-l)%2 == 1:\r\n g += 1\r\n sr = set(st[l:g+1])\r\n c = ''\r\n for j in alf:\r\n if not (j in sr):\r\n c = j\r\n break\r\n for j in range(1, g-l+1, 2):\r\n st[l+j] = c\r\nprint(*st, sep = '')\r\n", "#import sys\r\n#sys.stdin = open('in', 'r')\r\n#n = int(input())\r\n#a = [int(x) for x in input().split()]\r\n#n,m = map(int, input().split())\r\n\r\ns = input()\r\nres = ''\r\n\r\nprev = '0'\r\nfor i in range(len(s)):\r\n c = s[i]\r\n if c == prev:\r\n nxt = s[i+1] if i + 1 < len(s) else '0'\r\n if 'a' != prev and 'a' != nxt:\r\n c = 'a'\r\n elif 'b' != prev and 'b' != nxt:\r\n c = 'b'\r\n elif 'c' != prev and 'c' != nxt:\r\n c = 'c'\r\n res += c\r\n prev = c\r\n\r\nprint(res)\r\n", "# Problem: C. Simple Strings\r\n# Contest: Codeforces - Educational Codeforces Round 12\r\n# URL: https://codeforces.com/problemset/problem/665/C\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# \r\n# KAPOOR'S\r\n\r\nfrom sys import stdin, stdout \r\n\r\ndef INI():\r\n\treturn int(stdin.readline())\r\n\t\r\ndef INL():\r\n\treturn [int(_) for _ in stdin.readline().split()]\r\n\t\r\ndef INS():\r\n\treturn stdin.readline()\r\n\r\ndef MOD():\r\n return pow(10,9)+7\r\n\t\r\ndef OPS(ans):\r\n\tstdout.write(str(ans)+\"\\n\")\r\n\t\r\ndef OPL(ans):\r\n\t[stdout.write(str(_)+\"\") for _ in ans]\r\n\tstdout.write(\"\\n\")\r\n\r\n\t\r\nif __name__==\"__main__\":\r\n\tS=list(INS())\r\n\tn=len(S)\r\n\tT=set([chr(_) for _ in range(97,123)])\r\n\t\r\n\tfor _ in range(1,n):\r\n\t\tif S[_-1]==S[_]:\r\n\t\t\tif _!=n-1:\r\n\t\t\t\tS[_]=(T-{S[_-1],S[_+1]}).pop()\r\n\t\t\telse:\r\n\t\t\t\tS[_]=(T-{S[_-1]}).pop()\r\n\tOPL(S)", "import sys\r\nimport bisect\r\nfrom bisect import bisect_left as lb\r\ninput_=lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nfrom math import log\r\nfrom math import gcd\r\nfrom math import atan2,acos\r\nfrom random import randint\r\nsa=lambda :input_()\r\nsb=lambda:int(input_())\r\nsc=lambda:input_().split()\r\nsd=lambda:list(map(int,input_().split()))\r\nse=lambda:float(input_())\r\nsf=lambda:list(input_())\r\nflsh=lambda: sys.stdout.flush()\r\n#sys.setrecursionlimit(10**6)\r\nmod=10**9+7\r\ngp=[]\r\ncost=[]\r\ndp=[]\r\nmx=[]\r\nans1=[]\r\nans2=[]\r\nspecial=[]\r\nspecnode=[]\r\na=0\r\nkthpar=[]\r\ndef dfs(root,par):\r\n if par!=-1:\r\n dp[root]=dp[par]+1\r\n for i in range(1,20):\r\n if kthpar[root][i-1]!=-1:\r\n kthpar[root][i]=kthpar[kthpar[root][i-1]][i-1]\r\n for child in gp[root]:\r\n if child==par:continue\r\n kthpar[child][0]=root\r\n dfs(child,root)\r\ndef hnbhai():\r\n s=list(sa())\r\n tot=0\r\n for i in range(1,len(s)):\r\n if s[i]==s[i-1]:\r\n s[i]=\"?\"\r\n tot+=1\r\n n=len(s)\r\n for i in range(n):\r\n if s[i]==\"?\":\r\n #print(1)\r\n if i<n-1 and i>0:\r\n for j in range(26):\r\n if chr(ord('a')+j)!=s[i-1] and chr(ord('a')+j)!=s[i+1]:\r\n s[i]=chr(ord('a')+j)\r\n break\r\n elif i==n-1:\r\n if s[i-1]!='z':\r\n s[i]='z'\r\n elif s[i-1]!='a':\r\n s[i]='a'\r\n print(\"\".join(s))\r\nfor _ in range(1):\r\n hnbhai()\r\n", "def solve(s):\r\n n = len(s)\r\n result = []\r\n i = 0\r\n\r\n while i < n:\r\n j = i\r\n while j < n and s[j] == s[i]:\r\n j += 1\r\n\r\n c = 'a'\r\n while c == s[i] or (j < n and c == s[j]):\r\n c = chr(ord(c) + 1)\r\n\r\n for k in range(i, j):\r\n if (i + k) & 1:\r\n result.append(c)\r\n else:\r\n result.append(s[k])\r\n i = j\r\n\r\n return ''.join(result)\r\n\r\nif __name__ == \"__main__\":\r\n s = input().strip()\r\n result = solve(s)\r\n print(result)\r\n\r\n\r\n\r\n#bbaa", "import sys,random,bisect\r\nfrom collections import deque,defaultdict\r\nfrom heapq import heapify,heappop,heappush\r\nfrom itertools import permutations\r\nfrom math import gcd,log\r\nmod = int(1e9 + 7)\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\n\r\n\r\n\r\ns=input()\r\n\r\nres=[s[0]]\r\n\r\nn=len(s)\r\n\r\nfor i in range(1,n):\r\n if s[i]!=res[-1]:\r\n res.append(s[i])\r\n elif i==n-1:\r\n res.append(\"a\" if res[-1]!=\"a\" else \"b\")\r\n elif res[-1]==s[i+1]:\r\n res.append(\"a\" if res[-1]!=\"a\" else \"b\")\r\n else:\r\n for c in \"abcd\":\r\n if c!=res[-1] and c!=s[i+1]:\r\n res.append(c)\r\n break\r\nprint(\"\".join(res))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "'''\r\nCreated on Apr 21, 2016\r\nGmail : [email protected]\r\n@author: Md. Rezwanul Haque\r\n'''\r\ns = list(input())\r\nn = len(s)\r\ns = s + [' ']\r\ndef new(c):\r\n if c == 'z':\r\n return 'a'\r\n return chr(ord(c) + 1)\r\nfor i in range(1, n):\r\n if s[i] == s[i-1]:\r\n s[i] = new(s[i])\r\n if s[i] == s[i+1]:\r\n s[i] = new(s[i])\r\nfor i in range(n):\r\n print(s[i], end = '')\r\n", "s = list(input())\nn = len(s)\nfor i in range(1, n):\n if i != n - 1:\n if s[i] == s[i - 1]:\n for j in range(97, 123):\n if ord(chr(j)) != ord(s[i - 1]) and ord(chr(j)) != ord(s[i + 1]):\n s[i] = chr(j)\n break\n elif i == n - 1:\n if s[i] == s[i - 1]:\n for j in range(97, 123):\n if ord(chr(j)) != ord(s[i - 1]):\n s[i] = chr(j)\n break\nprint(*s, sep='')", "s = input()\r\nn = len(s)\r\nfor i in range(1, n):\r\n if s[i] == s[i - 1]:\r\n a = set(list(range(97, 123)))\r\n b = ('?' if i == n - 1 else s[i + 1])\r\n c = {ord(s[i]), ord(b)}\r\n a = a - c\r\n s = s[:i] + chr(a.pop()) + s[i + 1:]\r\nprint(s)\r\n", "s=list(input())\r\nfor i in range(1,len(s)-1):\r\n if s[i-1]==s[i]==s[i+1]:\r\n if s[i]==\"a\":\r\n s[i]=\"b\"\r\n else:\r\n s[i]=\"a\"\r\n\r\nfor i in range(len(s)-1):\r\n if s[i]==s[i+1]:\r\n a = chr((ord(s[i]) -ord(\"a\") +1)%26 + ord('a'))\r\n if a==s[i-1]:\r\n a=chr((ord(a) -ord(\"a\") +1)%26 +ord('a'))\r\n s[i]=a\r\n \r\nprint(*s, sep=\"\")", "# aadiupadhyay\r\nimport sys\r\nfrom collections import *\r\nfrom random import *\r\nimport os.path\r\nfrom math import gcd\r\nmod = 998244353\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\n\r\ndef solve():\r\n\r\n s = st()\r\n n = len(s)\r\n a1 = 0\r\n for i in range(1, n):\r\n if s[i] == s[i-1]:\r\n a1 += 1\r\n for j in 'abcdefghijklmnopqrstuvwxyz':\r\n if i+1 < n:\r\n if s[i] != j and s[i+1] != j:\r\n s[i] = j\r\n break\r\n else:\r\n if s[i] != j:\r\n s[i] = j\r\n break\r\n print(*s, sep='')\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n" ]

[ "def mex(arr,n):\r\n mini=float(\"inf\")\r\n for l,r in arr:\r\n mini=min(mini,r-l+1)\r\n print(mini)\r\n for i in range(n):\r\n print(i%mini,end=\" \")\r\n return \"\"\r\n\r\na,b=map(int,input().strip().split())\r\nblanck=[]\r\nfor i in range(b):\r\n x,y=map(int,input().strip().split())\r\n blanck.append([x,y])\r\nprint(mex(blanck,a))", "x=1000000\r\nn,m=[int(x) for x in input().split()]\r\nwhile(m):\r\n\ta,b=[int(x) for x in input().split()]\r\n\tx=min(x,b-a+1)\r\n\tm-=1\r\nprint(x)\r\nmylist=list(map(lambda y:y%x ,range(n)))\r\nfor _ in mylist:\r\n\tprint(_,end=\" \")", "n, m = [int(x) for x in input().split()]\r\n\r\nbest = 99999999999\r\nfor _ in range(m):\r\n a, b = [int(x) for x in input().split()]\r\n if (b-a+1) < best:\r\n best = (b-a)+1\r\n\r\ncount = 0\r\narr = []\r\nfor _ in range(n):\r\n arr.append(str(count))\r\n count = (count+1)%best\r\n\r\nprint(best)\r\nprint(\" \".join(arr))\r\n ", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,m=(int(i) for i in input().split())\r\nd={}\r\nk=n+1\r\nfor i in range(m):\r\n a,b=(int(i) for i in input().split())\r\n k=min(k,b-a+1)\r\nl=[]\r\nfor i in range(n):\r\n l.append(i%k)\r\nprint(k)\r\nprint(*l)", "def main():\r\n n, m = map(int, input().split())\r\n arr = [map(int, input().split()) for _ in range(m)]\r\n val = min([y - x + 1 for x, y in arr])\r\n print(val)\r\n print((\"{}\" + \" {}\" * (n - 1)).format(*(i % val for i in range(n))))\r\n\r\n\r\nmain()\r\n", "import sys\nlines = sys.stdin.readlines()\n(n, m) = map(int, lines[0].strip().split(\" \"))\nminQLen = n\nfor i in range(1, m+1):\n (l, r) = map(int, lines[i].strip().split(\" \"))\n minQLen = min(minQLen, r - l +1)\nprint(minQLen)\narr = [ i % minQLen for i in range(n)]\nprint(\" \".join(map(str, arr)))", "from math import inf\n\n\ndef main():\n n, m = map(int, input().split())\n rgs = []\n for _ in range(m):\n rgs.append(list(map(int, input().split())))\n\n minn = inf\n for l, r in rgs:\n minn = min(minn, r - l + 1)\n arr = []\n sl = list(range(minn))\n for i in range(n):\n arr.append(sl[i % len(sl)])\n print(minn)\n print(*arr)\n\n\ndef init():\n import os\n import sys\n\n sys.setrecursionlimit(2 * 10 ** 8)\n if 'CP_LOCAL_ENV' in os.environ:\n sys.stdin = open('cf_test_a.txt')\n\n\nif __name__ == '__main__':\n init()\n main()\n", "import sys\nimport math\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\nASCIILOWER = 97\nASCIIUPPER = 65\n\n\ndef getInt():\n return int(sys.stdin.readline().rstrip())\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef printOutput(ans):\n ans1, array = ans\n sys.stdout.write(str(ans1) + \"\\n\")\n for ele in array:\n sys.stdout.write(str(ele) + \" \")\n sys.stdout.write(\"\\n\")\n\n\ndef solve(n, sets):\n array = [0 for _ in range(n)]\n sets.sort() # sort by start\n sets.sort(key=lambda x: x[1] - x[0], reverse=True) # sort by length\n # print(sets)\n # result, we have smallest lengths last and go from the start\n # now we go through and label the array\n prev = (0, 0)\n ans1 = sets[-1][1] - sets[-1][0] + 1\n for i in range(len(array)):\n array[i] = i % ans1\n\n return ans1, array\n\n\ndef readinput():\n n, m = getInts()\n sets = []\n for _ in range(m):\n li, ri = getInts()\n sets.append((li, ri))\n printOutput(solve(n, sets))\n\n\nreadinput()\n", "n, m = map(int, input().split())\r\n\r\nmex = 10**9\r\nfor i in range(m):\r\n l, r = list(map(int, input().split()))\r\n mex = min(mex, r - l + 1)\r\nprint(mex)\r\n\r\na = [(i % mex) for i in range(n)]\r\nprint(\" \".join(map(str,a)))", "class CodeforcesTask739ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.n_m = []\r\n self.ms = []\r\n\r\n def read_input(self):\r\n self.n_m = [int(x) for x in input().split(\" \")]\r\n for x in range(self.n_m[1]):\r\n self.ms.append([int(x) for x in input().split(\" \")])\r\n\r\n def process_task(self):\r\n lens = [x[1] - x[0] + 1 for x in self.ms]\r\n target = min(lens)\r\n result = []\r\n current = 0\r\n for x in range(self.n_m[0]):\r\n result.append(current)\r\n current += 1\r\n if current == target:\r\n current = 0\r\n self.result = \"{0}\\n{1}\".format(target, \" \".join([str(x) for x in 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 = CodeforcesTask739ASolution()\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\nd=[]\r\nk=n\r\nfor i in range(m):\r\n l,r=map(int, input().split())\r\n k=min(k, r-l+1)\r\nprint(k)\r\nfor i in range(n):\r\n print(i%k, end=' ')\r\n\r\n", "n, m = map(int, input().split())\nar = []\nln = 10000000000000\nfor i in range(m):\n a, b = map(int, input().split())\n ar.append([a, b])\n ln = min(ln, b - a + 1)\nprint(ln)\nfor i in range(n):\n print(i % ln, end=\" \")\n", "n,m = map(int,input().split())\r\nans = n+1\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n ans = min(ans, b-a+1)\r\nprint(ans)\r\narr = [0] * n\r\nput = 0\r\nfor i in range(n):\r\n arr[i] = put \r\n put += 1\r\n if(put == ans):\r\n put = 0\r\nprint(*arr) ", "n,m=map(int,input().split())\r\nLen=float('inf')\r\nfor i in range(m):\r\n l,r=map(int,input().split())\r\n Len=min(Len,r-l+1)\r\nans=[]\r\nfor i in range(n):\r\n ans.append(i%Len)\r\nprint(Len)\r\nprint(*ans)", "n, m = map(int, input().split())\r\nlens = []\r\nk = 10 ** 10\r\nanswer = []\r\nfor i in range(m):\r\n n1, n2 = map(int, input().split())\r\n if n2 - n1 + 1 < k:\r\n k = n2 - n1 + 1\r\nw = 0\r\nwhile len(answer) < n:\r\n q = w * k\r\n for i in range(k):\r\n if i + q == n:\r\n break\r\n answer.append(i)\r\n w += 1\r\n\r\nprint(k)\r\nfor elem in answer:\r\n print(elem, end=' ')", "from math import *\r\nfrom sys import *\r\nfrom queue import *\r\nfrom decimal import *\r\n\r\nn,m=(int(z) for z in input().split())\r\ne=n\r\nfor i in range(m):\r\n j,k=(int(z) for z in input().split())\r\n e=min(e,k-j+1)\r\nres=[]\r\nfor i in range(n):\r\n res.append(i%e)\r\nprint(e)\r\nprint(' '.join(map(str,res)))", "n,m=map(int,input().split())\r\n#l=[int(i) for i in input().split()]\r\nminlen=n \r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n minlen=min(minlen,b-a+1)\r\nprint(minlen)\r\nans=[i for i in range(minlen)]*(n//minlen)+[i for i in range(minlen)][0:n%minlen]\r\nprint(*ans)", "#!/usr/bin/python3.5\r\nn,m=[int(x) for x in input().split()]\r\n\r\np=999999999999999999999\r\n\r\nfor i in range(m):\r\n a,b=[int(x) for x in input().split()]\r\n p=min(p,b-a+1)\r\n\r\nprint(p)\r\n\r\nfor i in range(n):\r\n print(i%p,end=' ')\r\n", "n, cuts = (int(x) for x in input().split())\r\nshortest = n\r\nfor i in range(cuts):\r\n l, r = (int(x) for x in input().split())\r\n shortest = min(shortest, r - l + 1)\r\nans = [i % shortest for i in range(n)]\r\nprint(shortest)\r\nprint(*ans)\r\n \r\n", "n,m=map(int,input().split())\r\nv=min(int(r)-int(l)+1 for i in m*'_' for l,r in [input().split()])\r\nprint(v,*(list(range(v))*(n//v+1))[:n])", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\ndef main():\r\n n,m = map(int ,input().split())\r\n k = 1e9\r\n for i in range(m):\r\n l,r = map(int , input().split())\r\n k = min(k , r - l + 1)\r\n print(k)\r\n p = (n + k - 1)//k\r\n a = [i for i in range(k)] * p\r\n print(*a[:n])\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=input().split()\r\nn=int(s[0])\r\nm=int(s[1])\r\nmn=100000000\r\n\r\nfor i in range(m):\r\n str=input().split()\r\n if int(str[1])-int(str[0])<mn:\r\n mn=int(str[1])-int(str[0])\r\n\r\nprint(mn+1)\r\n\r\nfor i in range(n):\r\n print(i%(mn+1),end=\" \")\r\n", "n,m = map(int,input().split())\r\nmn = 100000000\r\nfor _ in range(m):\r\n x,y = map(int,input().split())\r\n mn = min(mn,y-x+1)\r\nprint(mn)\r\nfor i in range(n):\r\n print(i%mn,end=\" \")\r\n\r\n \r\n \r\n \r\n", "import os,io\nfrom sys import stdout\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\n\ndef binomial_coefficient(n, k):\n if 0 <= k <= n:\n ntok = 1\n ktok = 1\n for t in range(1, min(k, n - k) + 1):\n ntok *= n\n ktok *= t\n n -= 1\n return ntok // ktok\n else:\n return 0\n\nn, m = list(map(int, input().split()))\n\nminRange = 10e5\nfor _ in range(m):\n l, r = list(map(int, input().split()))\n minRange = min(minRange, r-l+1)\n\nprint(minRange)\nprint(\" \".join([str(e%minRange) for e in range(n)]))\n", "n, m = [int(i) for i in input().split()]\nc = n\nfor i in range(m):\n a, b = [int(i) for i in input().split()]\n c = min(b-a+1, c)\nprint(c)\nfor i in range(n):\n print(i%c, end= ' ')", "n,m=map(int,input().split())\r\nA=[-1 for i in range(n)]\r\nf=0\r\ne=999999999999999\r\nfor i in range(m) :\r\n a,b=map(int,input().split())\r\n e=min(b-a+1,e)\r\nprint(e)\r\nfor i in range(n) :\r\n A[i]=f\r\n f+=1\r\n if f==e :\r\n f=0\r\nprint(*A)\r\n \r\n", "n, m = list(map(int, input().split()))\r\nmex = float('inf')\r\nfor _ in range(m):\r\n l, r = (list(map(int, input().split())))\r\n mex = min(mex, r - l + 1)\r\nres = [i % mex for i in range(n)]\r\nprint(mex)\r\nprint(*res)", "n, m = map(int, input().split())\r\nmi = float('inf')\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n mi = min(mi, r - l + 1)\r\n\r\nprint(mi)\r\nans = []\r\nfor i in range(n):\r\n ans.append(i % mi)\r\n\r\nprint(*ans)\r\n", "n, m = list(map(int, input().split()))\r\nminimum = 10000000000\r\nfor i in range(m):\r\n a, b = list(map(int, input().split()))\r\n if (b - a + 1) < minimum:\r\n minimum = b - a + 1\r\nnow = 0\r\nline = []\r\nfor i in range(n):\r\n line += [now]\r\n now += 1\r\n if now >= minimum:\r\n now = 0\r\nprint(minimum)\r\nprint(\" \".join(map(str, line)))\r\n ", "n, m = list(map(int, input().split()))\r\nret = 1000000001\r\nfor i in range(0, m):\r\n u, v = [int (i) for i in input().split()]\r\n ret = min(ret, v - u + 1)\r\n\r\nprint (ret)\r\nfor i in range(0, n):\r\n print (i % ret, end=' ')\r\n", "n,m = (int(i) for i in input().split())\r\nmaxd = 10**10\r\nl = -1\r\nr = -1\r\nfor i in range(m):\r\n a,b = (int(i) for i in input().split())\r\n if b-a< maxd:\r\n l = a-1\r\n r = b-1\r\n maxd = r-l\r\nans_l = [0]*n\r\nfor i in range(l,r+1):\r\n ans_l[i] = i-l\r\nk = maxd\r\nt = -1\r\n\r\nfor i in range(l-1,-1,-1):\r\n if t < 0:\r\n t = k\r\n ans_l[i] = t\r\n t-=1\r\nt = 0\r\nfor i in range(r+1,n):\r\n if t > maxd:\r\n t = 0\r\n ans_l[i]=t\r\n t+=1\r\nprint(maxd+1)\r\nprint(' '.join(list(map(str,ans_l))))", "nm=[int(n) for n in input().split()]\r\nn=nm[0]\r\nm=nm[1]\r\n\r\nans=n+1\r\n\r\nfor i in range(m):\r\n ab=[int(n) for n in input().split()]\r\n a=ab[0]\r\n b=ab[1]\r\n ans=min(ans,b-a+1)\r\n \r\nprint(ans)\r\n\r\nfor i in range(n):\r\n print((i)%ans,end=' ')", "n, m = map(int, input().split())\r\na = [0] * n\r\np = [0] * m\r\nans = 10 ** 6\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n ans = min(ans, r - l + 1)\r\n\r\nk = 0\r\nfor i in range(n):\r\n a[i] = k\r\n k = (k + 1) % ans\r\n \r\nprint(ans)\r\nprint(' '.join(map(str, a)))", "n,m = map(int,input().split())\r\nA = [0] * m\r\nfor j in range(m):\r\n A[j] = list(map(int,input().split()))\r\nmins = float('infinity')\r\nfor j in range(m):\r\n mins = min(mins, A[j][1] - A[j][0] + 1)\r\nprint(mins)\r\nans = [0] * mins\r\nfor j in range(mins):\r\n ans[j] = j\r\nprint(' '.join(map(str, (n// mins) * ans + ans[:n % mins])))", "import sys\ninput = sys.stdin.readline\n\nlength, subs = list(map(int, input().strip().split()))\nlol = 9999999999999999999999999999\n\nfor i in range(subs):\n start,end = list(map(int, input().strip().split()))\n if abs(start-end) + 1 < lol:\n lol = abs(start-end) + 1\n\nprint(lol)\n\nconstruct = []\ncount = 0\nwhile count < length:\n construct.append(str(count%lol))\n count+=1\nprint(' '.join(construct))\n\n \t\t \t \t \t\t\t\t\t\t\t\t \t \t\t \t\t \t", "n,m=map(int,input().split())\r\na=10**9\r\nfor r in range(m):\r\n p,q=map(int,input().split())\r\n a=min(a,q-p)\r\nans=[i for i in range(a+1)]\r\nans*=(n//(a+1))\r\nfor i in range(n%(a+1)):\r\n ans+=[i]\r\nprint(a+1)\r\nprint(*ans)", "n,m=map(int,input().split())\nip=[]\nans=[]\nk=n+1\nfor i in range(m):\n a,b=map(int,input().split())\n if b-a<k:\n k=b-a\nprint(k+1)\ni=0\nk+=1\nfor j in range(n):\n ans.append(i%k)\n i+=1\nfor i in ans:\n print(i, end=' ')\n", "import sys\n\ninput = sys.stdin.readline\n\nn, m = map(int, input().split())\nans = n\nlists = []\n\nfor k in range(m):\n st, en = map(int, input().split())\n \n ans = min(ans, en-st+1)\n \nprint(ans)\n\nfor i in range(n):\n lists.append(str(i%ans))\n\nprint(' '.join(lists))\n\t \t \t \t \t\t\t\t \t \t\t \t \t\t\t\t", "n, m = list(map(int, input().split()))\ninter = []\nmini = 1000000000\nfor i in range(m):\n l, r = list(map(int, input().split()))\n inter.append([l, r])\n diff = r - l + 1\n if diff < mini:\n mini = diff\n\nprint(mini)\nres = [(i % mini) for i in range(n)]\nprint(\" \".join(map(str, res)))\n\n# print(diff + 1)\n# print(listi)\n", "n,m=[int(i) for i in input().split()]\r\nans=100000000\r\nfor i in range(m):\r\n k,l=[int(i) for i in input().split()]\r\n ans=min(ans,l-k+1)\r\nprint(ans)\r\nprint(' '.join([str(i%ans) for i in range(n)]))\r\n", "n,m=map(int,input().split())\r\ns=10**9\r\nL=[]\r\na=[]\r\nfor i in range(m):\r\n l,r=map(int,input().split())\r\n if abs(r-l)+1<s:\r\n s=abs(r-l)+1\r\n L.append([l,r])\r\nprint(s)\r\nwhile len(a)<n:\r\n for j in range(s):\r\n a.append(str(j))\r\n if len(a)==n:\r\n break\r\nfor i in a:\r\n print(i,end=\" \")\r\n\r\n \r\n \r\n \r\n", "n, m = map(lambda x: int(x), input().split())\n\nans = n\nfor i in range(m):\n\tl, r = map(lambda x: int(x), input().split())\n\tans = min(ans, r - l + 1)\n\nprint(ans)\nfor i in range(n):\n\tprint(i % ans, end = ' ')\n\n", "n, m = map(int, input().split())\nans = 1000000000\nfor i in range(1,m+1):\n x, y = map(int, input().split())\n ans = min(ans, y - x + 1)\nprint(str(ans)+'\\n'+' '.join(map(str, [x % ans for x in range(0,n)])))\n", "from itertools import cycle, islice\nn, m = [int(x) for x in input().split()]\nres = min([int(b)-int(a)+1 for a,b in [input().split() for _ in range(m)]])\nprint(res)\nprint(' '.join(islice(cycle([str(x) for x in range(res)]), n)))\n", "n, m = map(int, input().split() )\r\ns = [0]*m\r\nk = [0]*m\r\nt = 100000\r\nfor i in range(m):\r\n s[i] = list(map(int, input().split() ))\r\n k[i] = s[i][1] - s[i][0]\r\n if k[i] < t:\r\n t = k[i]\r\nprint(t + 1)\r\n\r\nans = [0]*n\r\n\r\nk = n - (t+1)*(n//(t+1))\r\nc = n//(t+1)\r\n\r\nfor i in range(0, c*(t+1), t+1 ):\r\n for j in range( t+1 ):\r\n ans[j + i ] = j\r\n \r\nfor i in range((n//(t+1))*(t+1), (n//(t+1))*(t+1)+k ):\r\n ans[i] = i%(t+1)\r\ns = \" \".join(list(map(str, ans)))\r\n\r\nprint(s)\r\n", "n, m = map(int, input().split())\nml = n\n\nfor _ in range(m):\n l, r = map(int, input().split())\n ml = min(ml, r - l + 1)\n\nans, cur = [0] * n, 0\n\nfor i in range(n):\n ans[i] = cur % ml\n cur += 1\n\nprint(ml)\nprint(*ans)", "n, m = map(int, input().split())\r\nd = n\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n d = min(d, r - l + 1)\r\nprint(d)\r\nfor i in range(n):\r\n print(i % d, end = ' ')\r\n", "import sys\ninput=sys.stdin.readline\nnm=input().strip().split()\nm=int(nm[1])\nn=int(nm[0])\nlengths=[]\nfor i in range(m):\n subs=input().strip().split()\n a=int(subs[0])\n b=int(subs[1])\n lengths.append(abs(a-b)+1)\nlmex=min(lengths)\nprint(lmex)\nfor i in range(n):\n print(i%lmex, end='')\n print(' ', end='')\n \t\t \t\t \t \t\t \t \t\t\t \t \t\t\t\t", "ans=[]\r\nmn=10**18\r\nn,m=map(int,input().split())\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n mn=min(mn,y-x+1)\r\nfor i in range(1,n+1):\r\n ans.append(i%mn)\r\n\r\nprint(mn)\r\nprint(*ans)", "n, m = map(int, input().split())\r\nmexi = 1e9\r\nfor i in range(m):\r\n r, l = map(int, input().split())\r\n mexi = min(mexi, l - r + 1)\r\nprint(mexi)\r\nd = [str(j % mexi) for j in range(n)]\r\nprint(' '.join(d))", "n,q=map(int,input().split())\r\ng=1e9\r\nfor i in range(q):\r\n a,b=map(int,input().split())\r\n g=min(g,abs(b-a)+1)\r\ny=range(g)\r\nprint(g)\r\nfor i in range(n):\r\n print(y[i%g],end=\" \")\r\n", "n, m = map(int,input().split())\nans = 100005\nfor _ in range(m) :\n l, r = map(int,input().split())\n ans = min(ans, r - l + 1)\nprint(ans)\npos = 0\nfor i in range(n) :\n print(pos, end = \" \")\n pos += 1\n if pos == ans :\n pos = 0\n", "amount, mass = map(int,input().split())\nminim = amount\nfor i in range (mass):\n l, r = map(int, input().split())\n if (minim > (r - l + 1)):\n minim = (r - l + 1)\ni = 0\r\nprint(minim)\nwhile (i < amount):\n print(i % minim, end = ' ')\n i += 1", "n,m=map(int , input().split())\r\nmex=10000000\r\nfor i in range (m):\r\n a,b=map(int , input().split())\r\n mex=min(mex,b-a)\r\nmex=mex+1\r\nprint(mex)\r\nnum=0\r\nx=' '.join([str(i%mex) for i in range(n)])\r\nprint(x)", "from sys import stdin\r\n\r\ntest = stdin.readlines()\r\n\r\nn, m = map(int, test[0].split())\r\nmin_len = n\r\nfor i in range(1, m + 1):\r\n l, r = map(int, test[i].split())\r\n min_len = min(min_len, r - l + 1)\r\n\r\nans = list(range(min_len)) * (n // min_len + 1)\r\nans = ans[:n]\r\nprint(min_len)\r\nprint(*ans)\r\n", "import math\n\n\ndef read_int():\n return int(input().strip())\n\n\ndef read_ints():\n return list(map(int, input().strip().split(' ')))\n\n\ndef solve():\n n, m = read_ints()\n min_len = math.inf\n for _ in range(m):\n a, b = read_ints()\n min_len = min(min_len, b-a+1)\n print(min_len)\n print(' '.join(str(i%min_len) for i in range(n)))\n\n\nif __name__ == '__main__':\n solve()\n", "from operator import itemgetter\r\nn,m = map(int,input().split())\r\nans = 10**9\r\nfor i in range(m):\r\n l,r = map(int,input().split())\r\n ans = min(ans,r - l + 1)\r\nprint(ans)\r\nfor i in range(n):\r\n print(i % ans,end=\" \")\r\n", "n, m = map(int, input().split())\r\nl, r = map(int, input().split())\r\nmin = r - l\r\nfor _ in range(m-1):\r\n l, r = map(int, input().split())\r\n if r - l < min:\r\n min = r - l\r\nmin += 1\r\nprint(min)\r\nfor i in range(n):\r\n print(i % min, end = ' ')", "r=lambda:list(map(int, input().split()))\r\nn,m=r()\r\nd=lambda x:x[1]-x[0]+1\r\nl=min(d(r())for _ in range(m))\r\nprint(l)\r\nprint(' '.join(str(i % l) for i in range(n)))\r\n", "a,b=list(map(int,input().split()))\r\nnums=[0]*a\r\nans=float(\"inf\")\r\nfor i in range(b):\r\n c,d=list(map(int,input().split()))\r\n # count=d-c+1\r\n ans=min(ans,d-c+1)\r\n\r\nfor i in range(a):\r\n index=i\r\n i=i%ans\r\n nums[index]=i\r\nprint(ans)\r\nprint(*nums)\r\n", "import sys\nfrom math import *\nreadints=lambda:map(int, input().strip('\\n').split())\n\n\nn,m=readints()\n\nsmallest=float('inf')\nfor _ in range(m):\n l,r=readints()\n smallest = min(smallest, r-l+1)\n\nans = [0]*n\nfor i in range(n):\n ans[i] = i%smallest\n\nprint(smallest)\nprint(' '.join(list(map(lambda i: str(i), ans))))\n", "n,m = map(int,input().split())\nmn = n\nfor _ in range(m):\n l,r = map(int,input().split())\n mn = min(mn,r-l+1)\nj = 0\nanswer = [0]*n\nfor i in range(n):\n answer[i] = j%mn\n j += 1\nprint(mn)\nprint(*answer)\n", "def get_line(func=int,sym=' '):\r\n return [func(i) for i in input().split(sym)]\r\n\r\nn,m=get_line()\r\nans=1<<1000\r\nfor i in range(m):\r\n l,r=get_line()\r\n ans=min(ans,r-l+1)\r\n\r\nprint(ans)\r\nk=0\r\ndata=\"\"\r\nfor i in range(n):\r\n data+='%d%s'%(k,' 'if i<n-1 else '')\r\n k=(k+1)%ans\r\nprint(data)\r\n", "from sys import stdin\r\nfrom sys import stdout\r\nn, m = [int(x) for x in stdin.readline().split()]\r\nans = -1\r\nfor _ in range(m):\r\n t, p = tuple(int(x) for x in stdin.readline().split())\r\n if ans == -1 or ans > p-t+1:\r\n ans = p-t+1\r\nstdout.write(str(ans) + '\\n')\r\na = [str(i%ans) for i in range(n)]\r\nstdout.write(' '.join(a))\r\n", "n, m = map(int, input().split())\nans = [-1] * n\nmv = float('inf')\nfor _ in range(m):\n l, r = map(int, input().split())\n if r-l+1 < mv:\n mv = r-l+1\nfor i in range(n):\n ans[i] = i % mv\nprint(mv)\nfor v in ans:\n print(v, end=' ')\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nc = 10**6\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n c = min(c, b-a+1)\r\nx = 0\r\nd = []\r\nfor i in range(n):\r\n d.append(x)\r\n x = (x+1)%c\r\nprint(c)\r\nprint(' '.join(map(str, d)))", "n, m = map(int, input().split())\r\nmx = 1000000000\r\nfor _ in range(m):\r\n l, r = map(int, input().split())\r\n mx = min(mx, r - l + 1)\r\n\r\nprint(mx)\r\nresult = []\r\nj = 0\r\nfor i in range(n):\r\n result.append(j)\r\n j += 1\r\n if j == mx:\r\n j = 0\r\n\r\nprint(' '.join(map(str, result)))\r\n", "n,m = map(int,input().split())\r\naa=[]\r\nfor i in range(m):\r\n l,r = map(int,input().split())\r\n aa.append([l,r])\r\nmm = min(aa[i][1]-aa[i][0] for i in range(m))\r\nprint(mm+1)\r\nans=[0]*(n)\r\nfor i in range(n):\r\n ans[i] = i%(mm+1)\r\nprint(*ans) \r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\na = 10**18\r\n\r\nfor _ in range(m):\r\n l, r = map(int, input().split())\r\n a = min(a, r-l+1)\r\n\r\nprint(a)\r\n\r\nans = [-1]*n\r\n\r\nfor i in range(n):\r\n ans[i] = i%a\r\n\r\nprint(*ans)", "n, m = map(int, input().split())\r\n\r\nans = n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n ans = min(ans, y - x + 1)\r\n\r\nprint(ans)\r\nfor i in range(n):\r\n print(i % ans, end=\" \")\r\nprint()", "import sys\n\nn, m = map(int, input().split())\nmex = n\nfor i in range(m):\n l, r = map(int, input().split())\n mex = min(mex, r-l+1)\n\nA = [i%mex for i in range(n)]\nprint(mex)\nprint(' '.join(map(str, A)))\n", "n, m = list(map(int, input().split()))\r\nA = []\r\nAset = set()\r\nfor _ in range(m):\r\n Aset.add(tuple(map(int, input().split())))\r\n\r\nA = [Aset.pop() for _ in range(len(Aset))]\r\nA.sort(key=lambda x: x[1] - x[0])\r\nm = len(A)\r\nmex = A[0][1] - A[0][0] + 1\r\nres = [i % mex for i in range(n)]\r\nprint(mex)\r\nprint(*res)", "n, m = map(int, input().split())\r\narr = [tuple(map(int, input().split())) for _ in range(m)]\r\nmin_len = n\r\nfor l, r in arr:\r\n min_len = min(min_len, r - l + 1)\r\nprint(min_len)\r\nprint(' '.join(map(str, [i % min_len for i in range(n)])))\r\n", "n, m = map(int, input().split())\r\nmn = n\r\nfor _ in range(m):\r\n l, r = map(int, input().split())\r\n mn = min(mn, r - l + 1)\r\nprint(mn)\r\nprint(*[i % mn for i in range(n)])\r\n", "r=lambda:list(map(int, input().split()))\nn,m=r()\nd=lambda x:x[1]-x[0]+1\nl=min(d(r())for _ in range(m))\nprint(l)\nprint(' '.join(str(i % l) for i in range(n)))\n", "import math\r\nfrom os import startfile\r\nimport random \r\nfrom queue import Queue\r\nimport time \r\nimport heapq\r\nimport sys \r\ndef main(n,intervals):\r\n\r\n smallest_dist=float('inf')\r\n\r\n for e in intervals:\r\n a,b=e\r\n smallest_dist=min(smallest_dist,(b-a+1)) \r\n\r\n arr=[] \r\n val=0\r\n while len(arr)!=n:\r\n\r\n arr.append(val)\r\n val=(val+1)%smallest_dist \r\n print(smallest_dist)\r\n print(*arr)\r\n return \r\n\r\nn,m=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(m):\r\n arr.append(list(map(int,input().split())))\r\nmain(n,arr)\r\n\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\nstore=10000000\r\nans=[]\r\nfor i in range(m):\r\n l,r=map(int,input().split())\r\n store=min(store,r-l+1)\r\nfor i in range(n):\r\n ans.append(i%store)\r\nprint(store)\r\nprint(*ans)\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n", "n,m=list(map(int,input().split()))\r\nmn,a,b=float(\"inf\"),[],[]\r\nfor i in range(m):\r\n l,r=list(map(int,input().split()))\r\n b.append([l,r])\r\n mn=min(mn,r-l+1)\r\nprint(mn)\r\nfor i in range(n):\r\n a.append(i%mn)\r\nprint(*a)", "import sys\nn, m = map(int, input().split())\n\nle = 2 ** 30\n\nfor i in range(m):\n l, r = map(int, input().split())\n le = min(r - l + 1, le)\n\n\na = (list(range(0, le)) * ((n + le - 1) // le))[:n]\nres = \" \".join(map(str, a))\nprint(le)\nprint(res)\n", "n, m = map(int, input().split())\r\nr = [list(map(int, input().split())) for j in range(m)]\r\nv = min(ri[1] - ri[0] + 1 for ri in r)\r\nprint(v, ' '.join(str(i % v) for i in range(n)), sep='\\n')", "n, m = map(int, input().split())\n\nk = 100000\nseg = []\nfor i in range(m):\n l, r = map(int, input().split())\n k = min(k, r-l+1)\na = [i%k for i in range(n)]\n\nprint(k)\nfor i in range(len(a)):\n print(a[i], end=(\" \" if i != len(a)-1 else \"\\n\"))\n \n \n", "import sys\n\nclass Pair:\n def __init__(self, l, r):\n self.l = l\n self.r = r\n self.diff = r - l\n\n def __lt__(self, other):\n return self.diff < other.diff\n\n def __str__(self):\n return str(self.diff)\n\n def __repr__(self):\n return '[{x}]'.format(x=self.diff)\n\nn, m = [int(x) for x in input().strip().split()]\na = [0] * (n + 1)\n\nINF = sys.maxsize\nmex = INF\n\nindices = []\n\nfor i in range(m):\n l, r = [int(x) for x in input().strip().split()]\n indices.append(Pair(l, r))\n\nindices.sort()\n\nassert len(indices) > 0\nmin_length = indices[0].diff + 1\n\nfor i in range(1, n + 1):\n a[i] = i % min_length\n\nprint(min_length)\nprint(' '.join((str(a[i]) for i in range(1, n + 1))))", "[n, m] = [int(x) for x in input().split(\" \")]\r\nmex = n + 1\r\nfor i in range(m):\r\n [l, r] = [int(x) for x in input().split(\" \")]\r\n if r - l + 1 < mex:\r\n mex = r - l + 1\r\n\r\nres = [\"\"] * n\r\ni = 0\r\nfor j in range(n):\r\n res[j] = str(i)\r\n i+=1\r\n if i==mex:\r\n i = 0\r\nprint(mex)\r\nprint(\" \".join(res))\r\n\r\n\r\n\r\n", "n,m = map(int, input().split())\r\nans = min([y-x+1 for x,y in [list(map(int, input().split())) for _ in range(m)]])\r\nprint(ans)\r\nnum = list(map(str, range(ans))) * (n//ans+1)\r\nprint(' '.join(num[:n]))\r\n\r\n\r\n\r\n\r\n", "n,m=map(int, input().split())\r\nans=10**18\r\nfor i in range(m):\r\n l,r=map(int, input().split())\r\n ans=min(ans,r-l+1)\r\nprint(ans)\r\nfor i in range(n):\r\n print(i%ans,end=\" \")\r\n ", "import sys\ninput = sys.stdin.readline\n#\nn,m = map(int, input().split())\nmex = []\nfor i in range(m):\n mex.append(list(map(int,input().split())))\nans = min([j-i+1 for i,j in mex])\nprint(ans)\nlis = []\nfor i in range(n):\n lis.append(str(i%ans))\nprint(' '.join(lis))\n \t\t\t\t \t\t\t \t\t\t\t \t \t\t \t \t \t", "import sys\r\ninput=sys.stdin.readline\r\nn,m=map(int,input().split())\r\nseg=[list(map(int,input().split())) for i in range(m)]\r\nmin_l=10**18\r\nfor l,r in seg:\r\n min_l=min(min_l,r-l+1)\r\nans=[i for i in range(min_l)]*((n+min_l-1)//min_l)\r\nans=ans[:n]\r\nprint(min_l)\r\nprint(*ans)", "n,m=list(map(int,input().split()))\r\na=[]\r\nfor i in range(m):\r\n b=list(map(int,input().split()))\r\n a.append(b[1]-b[0]+1)\r\nc=min(a)\r\nb=[0]*n\r\nfor i in range(n):\r\n b[i]=i%c\r\nprint(c)\r\nprint(*b)", "#import sys\r\n#sys.stdin = open(\"stdin.inp\", \"r\")\r\nn, m = map(int, input().split())\r\nminx = 0xfffffff\r\nfor i in range(0, m):\r\n u, v = map(int, input().split())\r\n minx = min(v - u + 1, minx)\r\nprint(minx)\r\nfor i in range(0, n):\r\n print(i % minx, end=\" \")", "from itertools import cycle\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n res = float('inf')\r\n for _ in range(m):\r\n l, r = map(int, input().split())\r\n res = min(res, r - l + 1)\r\n print(res)\r\n k = 0\r\n for i in cycle(range(res)):\r\n print(i, end=' ')\r\n k += 1\r\n if k == n:\r\n break", "from math import *\r\nfrom collections import *\r\nfrom random import *\r\nfrom decimal import Decimal\r\nfrom heapq import *\r\nfrom bisect import *\r\nimport sys\r\ninput=sys.stdin.readline\r\nsys.setrecursionlimit(10**5)\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\ndef inp():\r\n return int(input())\r\ndef st():\r\n return input().rstrip('\\n')\r\nd=100000000000\r\nn,m=ma()\r\nfor i in range(m):\r\n x,y=ma()\r\n d=min(d,y-x)\r\nr=[i for i in range(d+1)]\r\ni=0\r\nprint(d+1)\r\nwhile(i<n):\r\n print(r[i%(d+1)],end=\" \")\r\n i+=1\r\n \r\n\r\n \r\n \r\n", "import math,sys\nfrom sys import stdin, stdout\nfrom collections import Counter, defaultdict, deque\ninput = stdin.readline\nI = lambda:int(input())\nli = lambda:list(map(int,input().split()))\n\ndef case():\n n,k=li()\n a=[]\n for i in range(k):\n a.append(li())\n m=n \n p,q=-1,-1\n for i in range(k):\n if(m>=a[i][1]-a[i][0]):\n p,q=a[i][0],a[i][1]\n m=a[i][1]-a[i][0] \n ans=[0]*n \n c=0\n #print(p,q)\n for i in range(n):\n ans[i]=i%(q-p+1)\n print(q-p+1)\n print(*ans)\n\n\nfor _ in range(1):\n case()", "def mex(a):\r\n n, s, w = len(a), set(a), 0\r\n while w <= n and w in s:\r\n w += 1\r\n return w\r\n\r\nn, m = map(int, input().split())\r\nmnlen = n\r\nq = []\r\nfor _ in range(m):\r\n l, r = map(int, input().split())\r\n mnlen = min(mnlen, r - l + 1)\r\n q.append((l, r))\r\ncycle = [j for j in range(mnlen)]\r\na = cycle * (n // mnlen) + cycle[:n % mnlen]\r\nprint(mnlen)\r\nprint(' '.join(map(str, a))) ", "def main():\n n, m = map(int, input().split())\n a = [list(map(int, input().split())) for i in range(m)]\n z = min(y - x + 1 for x, y in a)\n print (z)\n print( ' '.join([str(i % z) for i in range(n)]))\n\nmain()\n", "if __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n smallest_range = 10 ** 9\r\n for i in range(m):\r\n l, r = map(int, input().split())\r\n smallest_range = min(smallest_range, r - l + 1)\r\n res = [0] * n\r\n cur = 0\r\n for i in range(n):\r\n res[i] = cur\r\n cur = (cur + 1) % smallest_range\r\n print(smallest_range)\r\n print(' '.join(list(map(str, res))))\r\n", "n, m = map(int, input().split())\r\n\r\nsegments = []\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n segments.append((y - x, (x, y)))\r\n \r\nm_seg = min(segments)\r\nprint(m_seg[0] + 1)\r\nlst = [0] * n\r\n\r\nk = 0\r\nfor i in range(n):\r\n lst[i] = str(k)\r\n k = (k + 1) % (m_seg[0] + 1)\r\n\r\nprint(' '.join(lst))", "n,m=map(int,input().split())\r\nlen=float(\"inf\")\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n len=min(len,b-a+1)\r\nprint(len)\r\narr=[]\r\ni=0\r\nwhile i<n:\r\n for el in range(len):\r\n arr.append(el)\r\n i+=len\r\nprint(*(arr[:n]))", "n, m = map(int, input().split())\nans = n\nfor i in range(m):\n\ta, b = map(int, input().split())\n\tans = min(ans, b - a + 1)\nprint(ans)\nq = [i for i in range(ans)]\nw = []\nwhile len(w) < n:\n\tw += q\nprint(*w[:n])", "n,m = map(int,input().split())\r\nlis=[0]*(n)\r\nans=10000000000000000\r\nfor _ in range(m):\r\n a,b = map(int,input().split())\r\n ans=min(ans,b-a+1)\r\ntmp=[i for i in range(ans)]\r\nfor i in range(n):\r\n lis[i] = tmp[i%ans]\r\nprint(ans)\r\nprint(*lis)\r\n\r\n \r\n \r\n \r\n " ]

[ "read = lambda: map(int, input().split())\r\nh, w = read()\r\na = [input() for i in range(h)]\r\nN = 501\r\nvr = [[0] * N for i in range(N)]\r\nhr = [[0] * N for i in range(N)]\r\nfor i in range(h):\r\n for j in range(w):\r\n vr[j + 1][i + 1] = vr[j][i + 1] + vr[j + 1][i] - vr[j][i]\r\n hr[j + 1][i + 1] = hr[j][i + 1] + hr[j + 1][i] - hr[j][i]\r\n if a[i][j] == '#': continue\r\n if i != h - 1 and a[i + 1][j] == '.': vr[j + 1][i + 1] += 1\r\n if j != w - 1 and a[i][j + 1] == '.': hr[j + 1][i + 1] += 1\r\nq = int(input())\r\nfor i in range(q):\r\n r1, c1, r2, c2 = read()\r\n p1 = hr[c2 - 1][r2] - hr[c1 - 1][r2] - hr[c2 - 1][r1 - 1] + hr[c1 - 1][r1 - 1]\r\n p2 = vr[c2][r2 - 1] - vr[c1 - 1][r2 - 1] - vr[c2][r1 - 1] + vr[c1 - 1][r1 - 1]\r\n ans = p1 + p2\r\n print(ans)\r\n", "h, w = list(map(int, input().split()))\r\nmp = []\r\nmp.append(list(\"#\" * (w + 2)))\r\nfor i in range(h):\r\n mp.append(list(input()))\r\n mp[i + 1].insert(0, \"#\")\r\n mp[i + 1].append(\"#\")\r\nmp.append(list(\"#\" * (w + 2)))\r\nmpV = []\r\nmpH = []\r\nmpV.append([])\r\nmpH.append([])\r\nfor i in range(w + 2):\r\n mpV[0].append(0)\r\n mpH[0].append(0)\r\n\r\nfor i in range(1, h + 2):\r\n mpV.append([])\r\n mpH.append([])\r\n mpV[i].append(0)\r\n mpH[i].append(0)\r\n for j in range(1, w + 2):\r\n mpV[i].append(mpV[i][j - 1] + mpV[i - 1][j] - mpV[i - 1][j - 1] + (\r\n 1 if mp[i][j] == \".\" and mp[i + 1][j] == \".\" else 0))\r\n mpH[i].append(mpH[i][j - 1] + mpH[i - 1][j] - mpH[i - 1][j - 1] + (\r\n 1 if mp[i][j] == \".\" and mp[i][j + 1] == \".\" else 0))\r\nanc = []\r\nn = int(input())\r\nfor k in range(n):\r\n y0, x0, y1, x1 = list(map(int, input().split()))\r\n A = mpV[y0 - 1][x0 - 1]+mpV[y1-1][x1]-mpV[y1-1][x0-1]-mpV[y0-1][x1]\r\n A += mpH[y0 - 1][x0 - 1]+mpH[y1][x1-1]-mpH[y1][x0-1]-mpH[y0-1][x1-1]\r\n anc.append(A)\r\nfor k in range(n):\r\n print(anc[k])", "n,m=map(int,input().split())\r\nr,c=[[0 for i in range(m+1)]for j in range(n+1)],[[0 for i in range(m+1)]for j in range(n+1)]\r\ng=[' '*(m+1)]+[' '+input() for _ in range(n)]\r\nfor i in range(1,n+1):\r\n for j in range(1,m+1): \r\n r[i][j]=r[i][j-1]+r[i-1][j]-r[i-1][j-1]+(g[i][j]==g[i][j-1]=='.')\r\n c[i][j]=c[i][j-1]+c[i-1][j]-c[i-1][j-1]+(g[i][j]==g[i-1][j]=='.')\r\nq=int(input())\r\nfor _ in ' '*q:\r\n r1,c1,r2,c2=map(int,input().split())\r\n print(r[r2][c2]-r[r1-1][c2]-r[r2][c1]+r[r1-1][c1]+c[r2][c2]-c[r1][c2]-c[r2][c1-1]+c[r1][c1-1])", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport heapq as h \r\nfrom bisect import bisect_left\r\n\r\nfrom types import GeneratorType\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n import os\r\n self.os = os\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n self.os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\nimport time\r\nstart_time = time.time()\r\n\r\nimport collections as col\r\nimport math, string\r\nfrom functools import reduce\r\n\r\ndef getInts():\r\n return [int(s) for s in input().split()]\r\n\r\ndef getInt():\r\n return int(input())\r\n\r\ndef getStrs():\r\n return [s for s in input().split()]\r\n\r\ndef getStr():\r\n return input()\r\n\r\ndef listStr():\r\n return list(input())\r\n\r\nMOD = 10**9+7\r\n\r\n\"\"\"\r\nfor each row, an array [0,1,0,0,1,...] where 1 means we can have a domino starting there\r\nsame for each col\r\nthen compute prefix sums\r\n\"\"\"\r\n\r\ndef solve():\r\n N, M = getInts()\r\n grid = []\r\n for n in range(N):\r\n grid.append(getStr())\r\n rows = [[]]\r\n cols = [[]]\r\n for n in range(N):\r\n curr = 0\r\n tmp = [0]\r\n for m in range(M-1):\r\n if grid[n][m] == '.' and grid[n][m+1] == '.':\r\n curr += 1\r\n tmp.append(curr)\r\n tmp.append(curr)\r\n rows.append(tmp)\r\n for m in range(M):\r\n curr = 0\r\n tmp = [0]\r\n for n in range(N-1):\r\n if grid[n][m] == '.' and grid[n+1][m] == '.':\r\n curr += 1\r\n tmp.append(curr)\r\n tmp.append(curr)\r\n cols.append(tmp)\r\n for q in range(getInt()):\r\n r1, c1, r2, c2 = getInts()\r\n ans = 0\r\n for c in range(c1,c2+1):\r\n ans += cols[c][r2-1] - cols[c][r1-1]\r\n for r in range(r1,r2+1):\r\n ans += rows[r][c2-1] - rows[r][c1-1]\r\n print(ans)\r\n return\r\n\r\n \r\n \r\n \r\n \r\n#for _ in range(getInt()): \r\nsolve()", "h, w = [int(e) for e in input().split()]\r\na = [['#' for _ in range(w+2)] for _ in range(h+2)]\r\nhor = [[0 for _ in range(w+2)] for _ in range(h+2)]\r\nver = [[0 for _ in range(w+2)] for _ in range(h+2)]\r\n\r\nfor i in range(1, h + 1):\r\n a[i] = ['#'] + list(input()) + ['#']\r\n\r\nfor i in range(1, h + 1):\r\n for j in range(1, w + 1):\r\n hor[i][j] = hor[i-1][j]+hor[i][j-1]-hor[i-1][j-1]\r\n ver[i][j] = ver[i-1][j]+ver[i][j-1]-ver[i-1][j-1]\r\n if a[i][j] == '.' and a[i][j - 1] == '.':\r\n hor[i][j] += 1\r\n if a[i][j] == '.' and a[i-1][j] == '.':\r\n ver[i][j] += 1\r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n r1, c1, r2, c2 = [int(e) for e in input().split()]\r\n ans = 0\r\n ans += hor[r2][c2] - hor[r1-1][c2] - hor[r2][c1] + hor[r1-1][c1]\r\n ans += ver[r2][c2] - ver[r1][c2] - ver[r2][c1-1] + ver[r1][c1-1]\r\n\r\n print(ans)", "h, w = map(int, input().split())\r\na = []\r\nb = []\r\nc = []\r\na.append('#' * (w+1))\r\nfor i in range(h):\r\n a.append('#' + input())\r\nh += 1\r\nw += 1\r\nfor i in range(h):\r\n b.append([0] * w)\r\n c.append([0] * w)\r\nfor i in range(1, h):\r\n for j in range(1, w):\r\n b[i][j] = b[i-1][j] + b[i][j-1] - b[i-1][j-1]\r\n c[i][j] = c[i-1][j] + c[i][j-1] - c[i-1][j-1]\r\n if a[i][j]+a[i][j-1] == '..':\r\n b[i][j] += 1\r\n if a[i][j]+a[i-1][j] == '..':\r\n c[i][j] += 1\r\n\r\nq = int(input())\r\nfor i in range(q):\r\n r1, c1, r2, c2 = map(int, input().split())\r\n ans = b[r2][c2] - b[r1-1][c2] - b[r2][c1] + b[r1-1][c1]\r\n ans += c[r2][c2] - c[r1][c2] - c[r2][c1-1] + c[r1][c1-1]\r\n print(ans)\r\n \r\n \r\n ", "import sys\r\nimport math\r\nimport heapq\r\nfrom collections import defaultdict, deque\r\nfrom decimal import *\r\ndef read():\r\n return int(input())\r\ndef readm():\r\n return map(int,input().split())\r\ndef readl():\r\n return list(map(int,input().split()))\r\n\r\n'''C New year and domino'''\r\nH,W=readm()\r\nrect=[input() for i in range(H)]\r\nQ=read()\r\nN=[]\r\nfor q in range(Q):\r\n N.append(readl())\r\nrowsums=[[0]*(W) for _ in range(H)]\r\ncolsums=[[0]*(W) for _ in range(H)]\r\n\r\nfor i in range(H):\r\n for j in range(W):\r\n if i==0:\r\n continue\r\n colsums[i][j]+=colsums[i-1][j]+(1 if rect[i][j]=='.' and rect[i-1][j]=='.' else 0)\r\nfor j in range(W):\r\n for i in range(H):\r\n if j==0:\r\n continue\r\n rowsums[i][j]+=rowsums[i][j-1]+(1 if rect[i][j]=='.' and rect[i][j-1]=='.' else 0)\r\n\r\nfor q in N:\r\n x1,y1,x2,y2=q[0]-1,q[1]-1,q[2]-1,q[3]-1\r\n ans=0\r\n # row answers\r\n for i in range(x1,x2+1):\r\n if y1==0:\r\n ans+=rowsums[i][y2]\r\n continue\r\n ans+=rowsums[i][y2]-rowsums[i][y1-1]-(1 if rect[i][y1]=='.' and rect[i][y1-1]=='.' else 0)\r\n # col answers\r\n for j in range(y1,y2+1):\r\n if x1==0:\r\n ans+=colsums[x2][j]\r\n continue\r\n ans+=colsums[x2][j]-colsums[x1-1][j]-(1 if rect[x1][j]=='.' and rect[x1-1][j]=='.' else 0)\r\n print(ans)\r\n", "import sys,io,os\r\ntry:Z=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nexcept:Z=lambda:sys.stdin.readline().encode()\r\nY=lambda:map(int,Z().split())\r\nH,W=Y();a=[];o=[]\r\nfor _ in range(H):a.append(Z().strip())\r\nC=[[0]*(W+1)for i in range(H+1)];R=[[0]*(W+1)for i in range(H+1)]\r\nfor x in range(W):\r\n t=0;p=a[0][x]==46\r\n for y in range(1,H):\r\n v=a[y][x]==46\r\n if p and v:t+=1\r\n p=v;C[y+1][x+1]=t+C[y+1][x]\r\nfor y in range(H):\r\n t=0;p=a[y][0]==46\r\n for x in range(1,W):\r\n v=a[y][x]==46\r\n if p and v:t+=1\r\n p=v;R[y+1][x+1]=t+R[y][x+1]\r\nfor _ in range(int(Z())):\r\n r1,c1,r2,c2=Y()\r\n v=C[r2][c2]-C[r2][c1-1]-C[r1][c2]+C[r1][c1-1]\r\n v+=R[r2][c2]-R[r2][c1]-R[r1-1][c2]+R[r1-1][c1]\r\n o.append(str(v))\r\nprint('\\n'.join(o))", "h, w = map(int, input().split())\r\ns = [input() for _ in range(h)]\r\nver = [[0] * (w + 1) for _ in range(h + 1)]\r\nhor = [[0] * (w + 1) for _ in range(h + 1)]\r\nfor i in range(1, h + 1):\r\n for j in range(1, w + 1):\r\n ver[i][j] = ver[i - 1][j] + ver[i][j - 1] - ver[i - 1][j - 1]\r\n hor[i][j] = hor[i - 1][j] + hor[i][j - 1] - hor[i - 1][j - 1]\r\n if i < h and s[i - 1][j - 1] == '.' and s[i][j - 1] == '.':\r\n ver[i][j] += 1\r\n if j < w and s[i - 1][j - 1] == '.' and s[i - 1][j] == '.':\r\n hor[i][j] += 1\r\ntt = int(input())\r\nfor _ in range(tt):\r\n xb, yb, xa, ya = map(int, input().split())\r\n ans = 0\r\n ans += hor[xa][ya - 1] - hor[xb - 1][ya - 1] - hor[xa][yb - 1] + hor[xb - 1][yb - 1]\r\n ans += ver[xa - 1][ya] - ver[xa - 1][yb - 1] - ver[xb - 1][ya] + ver[xb - 1][yb - 1]\r\n print(ans)# 1691795507.0083253", "from math import sqrt,gcd,ceil,floor,log,factorial\r\nfrom itertools import permutations,combinations\r\nfrom collections import Counter, defaultdict\r\n\r\nh,w=map(int,input().split())\r\nmat=[0]\r\nfor _ in range(h):\r\n mat.append('0'+input())\r\n\r\nq=int(input()) \r\ndp=[[0 for j in range(w+1)] for i in range(h+1)]\r\nrow=[[0 for j in range(w+1)] for i in range(h+1)]\r\ncol=[[0 for j in range(w+1)] for i in range(h+1)]\r\n\r\nfor i in range(1,h+1):\r\n for j in range(1,w+1):\r\n if mat[i][j]=='.':\r\n if i==1 and j==1:\r\n continue\r\n \r\n elif i==1:\r\n if mat[i][j-1]=='.':\r\n dp[i][j]=1+dp[i][j-1]\r\n \r\n \r\n else:\r\n dp[i][j]=dp[i][j-1]\r\n \r\n row[i][j]=dp[i][j]\r\n \r\n elif j==1:\r\n if mat[i-1][j]=='.':\r\n dp[i][j]=1+dp[i-1][j]\r\n \r\n else:\r\n dp[i][j]=dp[i-1][j]\r\n \r\n col[i][j]=dp[i][j]\r\n \r\n else:\r\n if mat[i-1][j]=='.' and mat[i][j-1]=='.':\r\n dp[i][j]=dp[i-1][j]+dp[i][j-1]+2-dp[i-1][j-1]\r\n row[i][j]=1+row[i][j-1]\r\n col[i][j]=1+col[i-1][j]\r\n \r\n elif mat[i-1][j]=='.' and mat[i][j-1]=='#':\r\n dp[i][j]=dp[i-1][j]+dp[i][j-1]+1-dp[i-1][j-1]\r\n row[i][j]=row[i][j-1]\r\n col[i][j]=1+col[i-1][j]\r\n \r\n elif mat[i-1][j]=='#' and mat[i][j-1]=='.':\r\n dp[i][j]=dp[i-1][j]+dp[i][j-1]+1-dp[i-1][j-1]\r\n row[i][j]=1+row[i][j-1]\r\n col[i][j]=col[i-1][j]\r\n \r\n elif mat[i-1][j]=='#' and mat[i][j-1]=='#':\r\n dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]\r\n row[i][j]=row[i][j-1]\r\n col[i][j]=col[i-1][j]\r\n \r\n else:\r\n if i==1 and j==1:\r\n continue\r\n \r\n elif i==1:\r\n dp[i][j]=dp[i][j-1]\r\n row[i][j]=row[i][j-1]\r\n \r\n elif j==1:\r\n dp[i][j]=dp[i-1][j]\r\n col[i][j]=col[i-1][j]\r\n \r\n else:\r\n dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]\r\n row[i][j]=row[i][j-1]\r\n col[i][j]=col[i-1][j]\r\n \r\nfor _ in range(q):\r\n r1,c1,r2,c2=map(int,input().split())\r\n print(dp[r2][c2]-dp[r1][c1]-(dp[r2][c1]-dp[r1][c1])-(dp[r1][c2]-dp[r1][c1])+row[r1][c2]-row[r1][c1]+col[r2][c1]-col[r1][c1])\r\n \r\n ", "h,w=map(int,input().split())\r\ng=[list(input()) for i in range(h)]\r\nq=int(input())\r\nud=[[0]*w for i in range(h-1)]\r\nlr=[[0]*(w-1) for i in range(h)]\r\nfor i in range(h-1):\r\n for j in range(w):\r\n if g[i][j]==g[i+1][j]==\".\":\r\n ud[i][j]+=1\r\nfor j in range(w-1):\r\n for i in range(h-1):\r\n ud[i][j+1]+=ud[i][j]\r\nfor j in range(w-1):\r\n for i in range(h):\r\n if g[i][j]==g[i][j+1]==\".\":\r\n lr[i][j]+=1\r\nfor i in range(h-1):\r\n for j in range(w-1):\r\n lr[i+1][j]+=lr[i][j]\r\nx=[[0]*(w-1) for i in range(h)]\r\ny=[[0]*w for i in range(h-1)]\r\nfor i in range(h-1):\r\n for j in range(w):\r\n if g[i][j]==g[i+1][j]==\".\":\r\n y[i][j]=1\r\nfor i in range(h):\r\n for j in range(w-1):\r\n if g[i][j]==g[i][j+1]==\".\":\r\n x[i][j]=1\r\nfor i in range(h-2):\r\n for j in range(w):\r\n y[i+1][j]+=y[i][j]\r\nfor i in range(h-1):\r\n for j in range(w-1):\r\n y[i][j+1]+=y[i][j]\r\nfor i in range(h):\r\n for j in range(w-2):\r\n x[i][j+1]+=x[i][j]\r\nfor i in range(h-1):\r\n for j in range(w-1):\r\n x[i+1][j]+=x[i][j]\r\ncnt=[[0]*(w+1) for i in range(h+1)]\r\nfor i in range(h):\r\n for j in range(w):\r\n if i==0 and j==0:\r\n continue\r\n elif i==0:\r\n cnt[i+1][j+1]=x[i][j-1]\r\n elif j==0:\r\n cnt[i+1][j+1]=y[i-1][j]\r\n else:\r\n cnt[i+1][j+1]=x[i][j-1]+y[i-1][j]\r\nfor _ in range(q):\r\n r1,c1,r2,c2=map(int,input().split())\r\n ans=cnt[r2][c2]-cnt[r2][c1-1]-cnt[r1-1][c2]+cnt[r1-1][c1-1]\r\n if r1>=2:\r\n ans-=ud[r1-2][c2-1]\r\n if c1>=2:\r\n ans+=ud[r1-2][c1-2]\r\n if c1>=2:\r\n ans-=lr[r2-1][c1-2]\r\n if r1>=2:\r\n ans+=lr[r1-2][c1-2]\r\n print(ans)", "h, w = (int(x) for x in input().split())\na = [[x != '.' for x in input()] for _ in range(h)]\n\ndef build(f):\n d = [[0 for _ in range(w + 1)]]\n for r in range(h):\n d.append([0])\n for c in range(w):\n d[-1].append(d[-2][c + 1] + d[-1][c] - d[-2][c] + f(r, c))\n return d\n\nver = build(lambda r, c: not a[r][c] and r < h - 1 and not a[r + 1][c])\nhor = build(lambda r, c: not a[r][c] and c < w - 1 and not a[r][c + 1])\n\nfor _ in range(int(input())):\n r1, c1, r2, c2 = (int(x) for x in input().split())\n s = ver[r2 - 1][c2] - ver[r1 - 1][c2] - ver[r2 - 1][c1 - 1] + ver[r1 - 1][c1 - 1]\n s += hor[r2][c2 - 1] - hor[r1 - 1][c2 - 1] - hor[r2][c1 - 1] + hor[r1 - 1][c1 - 1]\n print(s)\n", "n,m = map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nx=[[0 for i in range(m)] for i in range(n)]\r\ny=[[0 for i in range(m)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(1,m):\r\n if l[i][j]=='#':\r\n x[i][j]=x[i][j-1]\r\n else:\r\n if l[i][j-1]=='.':\r\n x[i][j]=1+x[i][j-1]\r\n else:\r\n x[i][j]=x[i][j-1]\r\nfor i in range(m):\r\n for j in range(1,n):\r\n if l[j][i]=='#':\r\n y[j][i]= y[j-1][i]\r\n else:\r\n if l[j-1][i]=='.':\r\n y[j][i]=1+y[j-1][i]\r\n else:\r\n y[j][i]=y[j-1][i]\r\nmod_x = [[0 for i in range(m)] for i in range(n)]\r\nmod_y = [[0 for i in range(m)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if j==0:\r\n mod_y[i][j]=y[i][j]\r\n else:\r\n mod_y[i][j]+=mod_y[i][j-1]+y[i][j]\r\nfor i in range(m):\r\n for j in range(n):\r\n if j==0:\r\n mod_x[j][i]=x[j][i]\r\n else:\r\n mod_x[j][i]+=mod_x[j-1][i]+x[j][i]\r\n\r\n \r\nq=int(input())\r\nfor i in range(q):\r\n a,b,c,d=map(int,input().split())\r\n a-=1\r\n b-=1\r\n c-=1\r\n d-=1\r\n if a==0:\r\n ans = mod_x[c][d]-mod_x[c][b]\r\n else:\r\n ans = mod_x[c][d]-mod_x[a-1][d]-mod_x[c][b]+mod_x[a-1][b]\r\n if b==0:\r\n ans+= mod_y[c][d]-mod_y[a][d]\r\n else:\r\n ans+=mod_y[c][d]- mod_y[c][b-1]-mod_y[a][d]+mod_y[a][b-1]\r\n print(ans)\r\n", "def solveQuery(hor, ver, q):\r\n\tr1, c1, r2, c2 = tuple(q)\r\n\thorVal = hor[r2][c2]-hor[r1-1][ c2] - hor[r2][c1] + hor[r1-1][c1]\r\n\tverVal = ver[r2][c2] - ver[r2][c1-1] - ver[r1][c2] + ver[r1][c1-1]\r\n\tif r2 - r1 == 0:\r\n\t\tverVal = 0\r\n\tif c2 - c1 == 0:\r\n\t\thorVal = 0\r\n\treturn horVal + verVal\r\n\r\ndef solve( r, c, s, qs):\r\n\thor = [[0 for _ in range(c+1)] for _ in range(r+1)]\r\n\tver = [[0 for _ in range(c+1)] for _ in range(r+1)]\r\n\tfor i in range(1, r+1):\r\n\t\tfor j in range(2, c+1):\r\n\t\t\tif s[i-1][j-1] == s[i-1][j-2] == '.':\r\n\t\t\t\thor[i][j] = 1\r\n\r\n\tfor i in range(1, r+1):\r\n\t\tfor j in range(3, c+1):\r\n\t\t\t\thor[i][j] += hor[i][j-1] \r\n\r\n\r\n\tfor i in range(2, r+1):\r\n\t\tfor j in range(2, c+1):\r\n\t\t\thor[i][j] += hor[i-1][j]\r\n\r\n\r\n\r\n\tfor i in range(2, r+1):\r\n\t\tfor j in range(1, c+1):\r\n\t\t\tif s[i-1][j-1] == s[i-2][j-1] == '.':\r\n\t\t\t\tver[i][j] = 1\r\n\r\n\tfor i in range(3, r+1):\r\n\t\tfor j in range(1, c+1):\r\n\t\t\t\tver[i][j] += ver[i-1][j] \r\n\t\r\n\r\n\tfor i in range(2, r+1):\r\n\t\tfor j in range(2, c+1):\r\n\t\t\tver[i][j] += ver[i][j-1]\r\n\tfor q in qs:\r\n\t\tprint(solveQuery(hor, ver, q))\r\n\r\n\r\n\r\nr, c = (int(n) for n in input().split())\r\ns = []\r\nfor i in range(1, r+1):\r\n\ts.append(input())\r\n\r\nlq = int(input())\r\nqs = []\r\nfor i in range(lq):\r\n\tqs.append([int(n) for n in input().split()])\r\nsolve(r,c,s,qs)\r\n", "from collections import *\nfrom itertools import *\nfrom random import *\nfrom bisect import *\nfrom string import *\nfrom queue import *\nfrom heapq import *\nfrom math import *\nfrom re import *\nfrom sys 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\ndx = [-1, 1, 0, 0, 1, -1, 1, -1]\ndy = [0, 0, 1, -1, 1, -1, -1, 1]\n\n\n###########################---Test-Case---#################################\n\"\"\"\n\nIf you Know me , Then you probably don't know me !\n\n\"\"\"\n###########################---START-CODING---##############################\n\n\nh, w = zzz()\nhorizontal = [[0 for _ in range(w)] for _ in range(h)]\nvertical = [[0 for _ in range(w)] for _ in range(h)]\ngrids = [list(fast()) for _ in range(h)]\n\nfor i in range(h):\n for j in range(1, w):\n horizontal[i][j] = horizontal[i][j - 1] + (grids[i][j] == '.' and grids[i][j - 1] == '.') * 1\nfor i in range(1, h):\n for j in range(w):\n vertical[i][j] = vertical[i - 1][j] + (grids[i][j] == '.' and grids[i - 1][j] == '.') * 1\n\n\nfor i in range(int(z())):\n a, b, c, d = zzz()\n ans = 0\n for x in range(a - 1, c):\n ans += horizontal[x][d - 1] - horizontal[x][b - 1]\n\n for x in range(b - 1, d):\n ans += vertical[c - 1][x] - vertical[a - 1][x]\n print(ans)\n", "H, W = map(int, input().split())\r\ngrid = [\"|\" * (W+1)] + [\"|\" + input() for _ in range(H)]\r\nQ = int(input())\r\n\r\nhor = [[0 for _ in range(W+1)] for _ in range(H+1)]\r\nver = [[0 for _ in range(W+1)] for _ in range(H+1)]\r\n\r\nfor i in range(1, H+1):\r\n for j in range(1, W+1):\r\n hor[i][j] = hor[i-1][j] + hor[i][j-1] - hor[i-1][j-1]\r\n ver[i][j] = ver[i-1][j] + ver[i][j-1] - ver[i-1][j-1]\r\n if grid[i][j-1] == \".\" and grid[i][j] == \".\":\r\n hor[i][j] += 1\r\n if grid[i-1][j] == \".\" and grid[i][j] == \".\":\r\n ver[i][j] += 1\r\n\r\nfor _ in range(Q):\r\n r1, c1, r2, c2 = map(int, input().split())\r\n\r\n answer = 0\r\n answer += ver[r2][c2] - ver[r1][c2] - ver[r2][c1-1] + ver[r1][c1-1]\r\n answer += hor[r2][c2] - hor[r2][c1] - hor[r1-1][c2] + hor[r1-1][c1]\r\n\r\n print(answer)\r\n", "from sys import stdin, setrecursionlimit\r\n\r\n\r\ndef solve():\r\n h, w = (int(s) for s in stdin.readline().split())\r\n mas = [['']*(w+1)]+[['']+list(input()) for _ in range(h)]\r\n q = int(stdin.readline())\r\n\r\n dp_col = [[0]*(w+1) for _ in range(h + 1)]\r\n dp_row = [[0]*(w+1) for _ in range(h + 1)]\r\n\r\n for i in range(1, h + 1):\r\n for j in range(1, w + 1):\r\n dp_col[i][j] = dp_col[i-1][j] + dp_col[i][j-1] - dp_col[i-1][j-1] + (mas[i][j] == '.' and mas[i-1][j] == '.')\r\n dp_row[i][j] = dp_row[i-1][j] + dp_row[i][j-1] - dp_row[i-1][j-1] + (mas[i][j] == '.' and mas[i][j-1] == '.')\r\n\r\n for _ in range(q):\r\n r1, c1, r2, c2 = (int(s) for s in stdin.readline().split())\r\n print(dp_col[r2][c2] - dp_col[r1][c2] - dp_col[r2][c1 - 1] + dp_col[r1][c1 - 1] + dp_row[r2][c2] - dp_row[r2][c1] - dp_row[r1 - 1][c2] + dp_row[r1 - 1][c1])\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n, m = map(int, input().split())\r\nli = [' '*(m+1)]+[' '+input() for _ in range(n)]\r\nr,c = [[0 for i in range(m+1)] for i in range(n+1)],[[0 for i in range(m+1)] for i in range(n+1)]\r\nq = int(input())\r\nfor i in range(1,n+1):\r\n\tfor j in range(1,m+1):\r\n\t\tr[i][j]=r[i-1][j]+r[i][j-1]-r[i-1][j-1]+(li[i][j]=='.' and li[i][j-1]=='.')\r\n\t\tc[i][j]=c[i-1][j]+c[i][j-1]-c[i-1][j-1]+(li[i][j]=='.' and li[i-1][j]=='.')\r\nfor _ in range(q):\r\n\tr1,c1,r2,c2 = map(int,input().split())\r\n\tprint (c[r2][c2]-c[r1][c2]-c[r2][c1-1]+c[r1][c1-1]+r[r2][c2]-r[r2][c1]-r[r1-1][c2]+r[r1-1][c1])\r\n", "def solve():\r\n numRows, numCols = map(int, input().split())\r\n\r\n grid = [[\"#\"]*(numCols+1)]\r\n grid.extend([\"#\"] + list(input()) for row in range(numRows))\r\n\r\n h, v = computeSolutions(numRows, numCols, grid)\r\n\r\n numQueries = int(input())\r\n for q in range(numQueries):\r\n r1, c1, r2, c2 = map(int, input().split())\r\n print(solution(r1, c1, r2, c2, h, v))\r\n \r\ndef computeSolutions(numRows, numCols, grid):\r\n\r\n h = [[0 for c in range(numCols + 1)] for r in range(numRows+1)]\r\n v = [[0 for c in range(numCols + 1)] for r in range(numRows+1)]\r\n\r\n for r in range(1, numRows+1):\r\n for c in range(1, numCols+1):\r\n\r\n h[r][c] = h[r-1][c] + h[r][c-1] - h[r-1][c-1]\r\n v[r][c] = v[r][c-1] + v[r-1][c] - v[r-1][c-1]\r\n\r\n if grid[r][c] != \".\": continue\r\n\r\n if grid[r][c-1] == \".\":\r\n h[r][c] += 1\r\n\r\n if grid[r-1][c] == \".\":\r\n v[r][c] += 1\r\n\r\n return h, v\r\n \r\ndef solution(r1, c1, r2, c2, h, v):\r\n s = h[r2][c2] - h[r2][c1] - h[r1-1][c2] + h[r1-1][c1]\r\n s += v[r2][c2] - v[r2][c1-1] - v[r1][c2] + v[r1][c1-1]\r\n return s\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n\r\n", "h, w = map(int, input().split())\ngrid = (h + 1) * [ None ]\ngrid[0] = (w + 1) * '#'\nfor r in range(1, h + 1):\n grid[r] = '#' + input().strip()\n\nrt = [ [ 0 for c in range(w + 1) ] for r in range(h + 1) ]\nfor r in range(1, h + 1):\n for c in range(1, w + 1):\n if '.' == grid[r][c] == grid[r][c - 1]:\n delta = 1\n else:\n delta = 0\n rt[r][c] = rt[r][c - 1] + delta\n for c in range(1, w + 1):\n rt[r][c] += rt[r - 1][c]\nct = [ [ 0 for c in range(w + 1) ] for r in range(h + 1) ]\nfor c in range(1, w + 1):\n for r in range(1, h + 1):\n if '.' == grid[r][c] == grid[r - 1][c]:\n delta = 1\n else:\n delta = 0\n ct[r][c] = ct[r - 1][c] + delta\n for r in range(1, h + 1):\n ct[r][c] += ct[r][c - 1]\n\ndebug = False\nif debug:\n print()\n for r in range(1, h + 1):\n print(grid[r][1:])\n print(rt[r][1:])\n print()\n for c in range(1, w + 1):\n print(''.join([ grid[r][c] for r in range(1, h + 1) ]))\n print([ ct[r][c] for r in range(1, h + 1) ])\n print()\n\nq = int(input())\nfor i in range(q):\n r, c, R, C = map(int, input().split())\n if debug:\n print(rt[R][C], -rt[R][c], -rt[r - 1][C], rt[r - 1][c], '\\n',\n ct[R][C], -ct[r][C], -ct[R][c - 1], ct[r][c - 1])\n x = rt[R][C] - rt[R][c] - rt[r - 1][C] + rt[r - 1][c] + \\\n ct[R][C] - ct[r][C] - ct[R][c - 1] + ct[r][c - 1]\n print(x)\n", "\r\n\r\ndef main():\r\n\tr, c = map(int, input().split())\r\n\tmx = 501\r\n\tboard = [['0'] * (mx) for _ in range(mx)]\r\n\thorz = [[0] * (mx) for _ in range(mx)]\r\n\tvert = [[0] * (mx) for _ in range(mx)]\r\n\r\n\tfor i in range(1,r+1):\r\n\t\ts = input().strip()\r\n\t\tfor j in range(1,c+1):\r\n\t\t\tboard[i][j] = s[j-1]\r\n\r\n\tfor i in range(1, r):\r\n\t\tfor j in range(1, c+1):\r\n\t\t\thorz[i][j] = horz[i-1][j] + horz[i][j-1] - horz[i-1][j-1]\r\n\t\t\tif board[i][j] == '.' and board[i+1][j] == '.':\r\n\t\t\t\thorz[i][j] += 1\r\n\t\t# print(horz[i][1:c+1])\r\n\r\n\tfor i in range(1, r+1):\r\n\t\tfor j in range(1, c):\r\n\t\t\tvert[i][j] = vert[i-1][j] + vert[i][j-1] - vert[i-1][j-1]\r\n\t\t\tif board[i][j] == '.' and board[i][j+1] == '.':\r\n\t\t\t\tvert[i][j] += 1\r\n\r\n\t\r\n\t# printBoard(board, r, c)\r\n\t# printBoard(vert, r, c)\t\r\n\t# printBoard(horz, r, c)\r\n\r\n\tn = int(input())\r\n\tfor _ in range(n):\r\n\t\ta, b, c, d = map(int, input().split())\r\n\r\n\t\t# print(\"flag\", horz[c-1][d], c-1, d)\r\n\r\n\t\tans1 = horz[c-1][d]-horz[c-1][b-1]-horz[a-1][d]+horz[a-1][b-1]\r\n\t\tans2 = vert[c][d-1]-vert[c][b-1]-vert[a-1][d-1]+vert[a-1][b-1]\r\n\t\tprint(ans1 + ans2)\r\n\r\n\t\t# print(\"Coord\", [a,b], [c,d], horz[a][b] + vert[a][b], horz[c][d] + vert[c][d])\r\n\t\t# print(cur_value - sub_vert - sub_horz, cur_value, sub_vert, sub_horz)\r\n\t\t# print(horz[c][d] - horz[c][b-1] - horz[a-1][d] + horz[a-1][b-1])\r\n\t\t# print(vert[c][d] - vert[c][b-1] - vert[a-1][d] + vert[a-1][b-1])\r\n\r\n\r\n\t# printBoard(board)\r\n\t# printBoard(horz)\r\n\t# print()\r\n\t# printBoard(vert)\r\n\t# print(board[0][7])\r\n\r\n\r\ndef printBoard(board, r, c):\r\n\tfor r in range(r+1):\r\n\t\tprint(board[r][:c+1])\r\n\tprint()\r\n\r\n\r\nmain()", "n, m = map(int, input().split())\r\nboard = [[\"#\"] * (m + 2)] + [[\"#\"] + list(input()) + [\"#\"] for i in range(n)] + [[\"#\"] * (m + 2)]\r\nansr = [[0] * (m + 2) for i in range(n + 2)]\r\nansc = [[0] * (m + 2) for i in range(n + 2)]\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n ansr[i][j] = ansr[i - 1][j] + ansr[i][j - 1] - ansr[i - 1][j - 1] + (1 if board[i][j] == \".\" and board[i][j - 1] == \".\" else 0)\r\n ansc[i][j] = ansc[i - 1][j] + ansc[i][j - 1] - ansc[i - 1][j - 1] + (1 if board[i][j] == \".\" and board[i - 1][j] == \".\" else 0)\r\n \r\nq = int(input())\r\nfor i in range(q):\r\n r1, c1, r2, c2 = map(int, input().split())\r\n print(ansr[r2][c2] + ansc[r2][c2] - ansc[r1][c2] - ansc[r2][c1 - 1] - ansr[r1 - 1][c2] - ansr[r2][c1] + ansr[r1 - 1][c1] + ansc[r1][c1 - 1])\r\n\r\n", "R = lambda: map(int, input().split())\r\nn, m = R()\r\nb = [input() for _ in range(n)]\r\ndph = [[0 for y1 in range(m + 2)] for x1 in range(n + 2)]\r\ndpv = [[0 for y2 in range(m + 2)] for x2 in range(n + 2)]\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n dpv[i][j] += (2 <= i <= n and b[i - 1][j - 1] == b[i - 2][j - 1] == '.') + dpv[i - 1][j]\r\n dph[i][j] += (2 <= j <= m and b[i - 1][j - 1] == b[i - 1][j - 2] == '.') + dph[i][j - 1]\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n dpv[i][j] += dpv[i][j - 1]\r\n dph[i][j] += dph[i - 1][j]\r\nfor i in range(int(input())):\r\n i1, j1, i2, j2 = R()\r\n hc = max(0, dph[i2][j2] - dph[i2][j1] - dph[i1 - 1][j2] + dph[i1 - 1][j1])\r\n vc = max(0, dpv[i2][j2] - dpv[i2][j1 - 1] - dpv[i1][j2] + dpv[i1][j1 - 1])\r\n print(hc + vc)", "h,w = map(int, input().split())\r\n\r\nlt = [[0 for _ in range(600)] for _ in range(600)]\r\nfor i in range(1,h+1):\r\n s = '0' + input()\r\n for j in range(1, w+1):\r\n lt[i][j] = s[j]\r\ndp1, dp2 = [[0 for _ in range(600)] for _ in range(600)], [[0 for _ in range(600)] for _ in range(600)]\r\n\r\nfor i in range(1, h+1):\r\n for j in range(1, w+1):\r\n dp1[i][j] = dp1[i-1][j] + dp1[i][j-1] - dp1[i-1][j-1] + (lt[i][j]==lt[i][j-1]=='.')\r\n dp2[i][j] = dp2[i-1][j] + dp2[i][j-1] - dp2[i-1][j-1] + (lt[i][j]==lt[i-1][j]=='.')\r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n r1, c1, r2, c2 = map(int, input().split())\r\n \r\n ans=0 \r\n ans+=dp1[r2][c2] - dp1[r1-1][c2] - dp1[r2][c1] + dp1[r1-1][c1]\r\n ans+=dp2[r2][c2] - dp2[r1][c2] - dp2[r2][c1-1] + dp2[r1][c1-1]\r\n print(ans)\r\n \r\n", "from itertools import accumulate \nimport math\nimport bisect\n\ndef list_sum(L1, L2):\n return [L1[i] + L2[i] for i in range(len(L1))]\n\nh, w = [int(x) for x in input().split()]\nM = []\nfor i in range(h):\n M.append([1 if c == '.' else 0 for c in input().rstrip()])\n\nH = [[0]+list(accumulate(M[i][j] and M[i][j+1] for j in range(w-1))) for i in range(h)]\nV = [[0]+list(accumulate(M[i][j] and M[i+1][j] for i in range(h-1))) for j in range(w)]\n\nHsum = list(accumulate(H, list_sum))\nVsum = list(accumulate(V, list_sum))\n\ndef can(a, b):\n return Hsum[a][b] + Vsum[b][a]\n\ndef query(a1, b1, a2, b2):\n return (can(a2, b2) + can(a1, b1) - can(a1, b2) - can(a2, b1) +\n H[a1][b2] - H[a1][b1] + V[b1][a2] - V[b1][a1])\n\nq = int(input())\nfor i in range(q):\n a1, b1, a2, b2 = [int(x)-1 for x in input().split()]\n print(query(a1, b1, a2, b2))\n", "def ckrow(r,c1,c2):\r\n\tk=0\r\n\tfor i in range(c1+1,c2+1):\r\n\t\tif g[r][i]==g[r][i-1]=='.':k+=1\r\n\treturn k\r\ndef ckcol(r,c1,c2):\r\n\tk=0\r\n\tfor i in range(c1+1,c2+1):\r\n\t\tif g[i][r]==g[i-1][r]=='.':k+=1\r\n\treturn k\t\r\n\t\r\nh,w=map(int,input().split())\r\ng=['#'*(w+1)]\r\nfor _ in range(h):g.append('#'+input())\r\ndp=[[0 for i in range(w+1)] for i in range(h+1)]\r\nfor i in range(1,h+1):\r\n\tfor j in range(1,w+1):\r\n\t\tif g[i][j]=='#':dp[i][j]=dp[i-1][j]+dp[i][j-1]-dp[i-1][j-1]\r\n\t\telse:\r\n\t\t\tx,y=dp[i-1][j],dp[i][j-1]\r\n\t\t\tx+=1 if g[i-1][j]=='.' else 0\r\n\t\t\ty+=1 if g[i][j-1]=='.' else 0\r\n\t\t\tdp[i][j]=x+y-dp[i-1][j-1]\r\n\r\nfor _ in range(int(input())):\r\n\tr1,c1,r2,c2=map(int,input().split())\r\n\tans=dp[r1][c1]+dp[r2][c2]-dp[r1][c2]-dp[r2][c1]\r\n\tans+=ckrow(r1,c1,c2)\r\n\tans+=ckcol(c1,r1,r2)\r\n\tprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\na = [' ' + input()[:-1] for i in range(n)]\r\na = [' ' * (m + 1)] + a\r\nq = int(input())\r\n\r\ncol = [[0 for i in range(m + 1)] for i in range(n + 1)]\r\nrow = [[0 for i in range(m + 1)] for i in range(n + 1)]\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n col[i][j] = col[i - 1][j] + col[i][j - 1] - col[i - 1][j - 1] + (a[i][j] == '.' and a[i - 1][j] == '.')\r\n row[i][j] = row[i - 1][j] + row[i][j - 1] - row[i - 1][j - 1] + (a[i][j] == '.' and a[i][j - 1] == '.')\r\n\r\nfor i in range(q):\r\n r1, c1, r2, c2 = map(int, input().split())\r\n print(col[r2][c2] - col[r1][c2] - col[r2][c1 - 1] + col[r1][c1 - 1] \\\r\n + row[r2][c2] - row[r2][c1] - row[r1 - 1][c2] + row[r1 - 1][c1])", "from __future__ import nested_scopes, generators, division, absolute_import, with_statement, print_function, unicode_literals\nimport sys, os, time\n# input = raw_input\n# range = xrange\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# sys.stdout = open(pass, 'w')\n\ndef solve():\n rows,cols,=rv()\n tab = [input() for _ in range(rows)]\n horizontalcount, verticalcount = [[0] * (cols + 1) for _ in range(rows)], [[0] * cols for _ in range(rows + 1)]\n for row in range(rows):\n for col in range(1, cols + 1):\n horizontalcount[row][col] = horizontalcount[row][col - 1] + (1 if col < cols and tab[row][col] == '.' and tab[row][col - 1] == '.' else 0)\n for col in range(cols):\n for row in range(1, rows + 1):\n verticalcount[row][col] = verticalcount[row - 1][col] + (1 if row < rows and tab[row][col] == '.' and tab[row - 1][col] == '.' else 0)\n queries, = rv()\n res = [None] * queries\n for query in range(queries):\n r1, c1, r2, c2, = [val - 1 for val in map(int, input().split())]\n temp = 0\n for row in range(r1, r2 + 1):\n temp += horizontalcount[row][c2 + 1 - 1] - horizontalcount[row][c1]\n for col in range(c1, c2 + 1):\n temp += verticalcount[r2 + 1 - 1][col] - verticalcount[r1][col];\n res[query] = temp\n print(\"\\n\".join(map(str, res)))\n\n\nsolve()", "n, m = map(int, input().split())\na = []\nfor _ in range(n):\n x = list(input().strip())\n a.append(x)\n\nhor = [[0 for _ in range(m)] for _ in range(n)]\nver = [[0 for _ in range(m)] for _ in range(n)]\nfor i in range(n):\n for j in range(m):\n if i - 1 >= 0 and j - 1 >= 0:\n hor[i][j] -= hor[i - 1][j - 1]\n ver[i][j] -= ver[i - 1][j - 1]\n if i - 1 >= 0:\n hor[i][j] += hor[i - 1][j]\n ver[i][j] += ver[i - 1][j]\n if j - 1 >= 0:\n hor[i][j] += hor[i][j - 1]\n ver[i][j] += ver[i][j - 1]\n\n if j - 1 >= 0 and a[i][j - 1] == '.' and a[i][j] == '.':\n hor[i][j] += 1\n\n if i - 1 >= 0 and a[i - 1][j] == '.' and a[i][j] == '.':\n ver[i][j] += 1\n\nq = int(input())\nfor _ in range(q):\n r1, c1, r2, c2 = map(int, input().split())\n r1 -= 1\n c1 -= 1\n r2 -= 1\n c2 -= 1\n val = hor[r2][c2] + ver[r2][c2]\n val -= hor[r2][c1]\n if r1 - 1 >= 0:\n val += hor[r1 - 1][c1]\n val -= hor[r1 - 1][c2]\n\n val -= ver[r1][c2]\n if c1 - 1 >= 0:\n val += ver[r1][c1 - 1]\n val -= ver[r2][c1 - 1]\n print(val)\n", "# Author : nitish420 --------------------------------------------------------------------\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nmod=10**9+7\r\n# sys.setrecursionlimit(10**6)\r\n# from functools import lru_cache\r\n\r\n\r\n\r\ndef main():\r\n r,c=map(int,input().split())\r\n arr=[]\r\n for _ in range(r):\r\n arr.append(list(input()))\r\n dpr=[[0 for _ in range(c+1)]for _ in range(r+1)]\r\n dpc=[[0 for _ in range(c+1)]for _ in range(r+1)]\r\n\r\n for i in range(2,c+1):\r\n dpr[1][i]=dpr[1][i-1]\r\n if arr[0][i-1]=='.':\r\n if arr[0][i-2]=='.':\r\n dpr[1][i]+=1\r\n \r\n \r\n for i in range(2,r+1):\r\n dpc[i][1]=dpc[i-1][1]\r\n if arr[i-1][0]=='.':\r\n if arr[i-2][0]=='.':\r\n dpc[i][1]+=1\r\n \r\n \r\n for i in range(2,r+1):\r\n for j in range(2,c+1):\r\n dpr[i][j]=dpr[i-1][j]+dpr[i][j-1]-dpr[i-1][j-1]\r\n dpc[i][j]=dpc[i-1][j]+dpc[i][j-1]-dpc[i-1][j-1]\r\n if arr[i-1][j-1]=='.':\r\n if arr[i-2][j-1]=='.':\r\n dpc[i][j]+=1\r\n if arr[i-1][j-2]=='.':\r\n dpr[i][j]+=1\r\n \r\n # for item in dpr:\r\n # print(*item)\r\n # for item in dpc:\r\n # print(*item)\r\n \r\n for _ in range(int(input())):\r\n r1,c1,r2,c2=map(int,input().split())\r\n print(dpc[r2][c2]-dpc[r2][c1-1]-dpc[r1][c2]+dpc[r1][c1-1]+dpr[r2][c2]-dpr[r2][c1]-dpr[r1-1][c2]+dpr[r1-1][c1])\r\n\r\n\r\n\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\r\n# endregion\r\n\r\nif __name__ == '__main__':\r\n main()", "from sys import maxsize, stdout, stdin,stderr\r\nmod = int(1e9+7)\r\nimport sys\r\ndef I(): return int(stdin.readline())\r\ndef lint(): return [int(x) for x in stdin.readline().split()]\r\ndef S(): return list(map(str,input().strip()))\r\ndef grid(r, c): return [lint() for i in range(r)]\r\nfrom collections import defaultdict, Counter, deque\r\nimport math\r\nimport heapq\r\nfrom heapq import heappop , heappush\r\nimport bisect\r\nfrom itertools import groupby\r\nfrom itertools import permutations as comb\r\ndef gcd(a,b): \r\n while b:\r\n a %= b\r\n tmp = a\r\n a = b\r\n b = tmp\r\n \r\n return a\r\n \r\ndef lcm(a,b): \r\n return a // gcd(a, b) * b\r\n \r\ndef check_prime(n):\r\n for i in range(2, int(n ** (1 / 2)) + 1):\r\n if not n % i:\r\n return False\r\n return True\r\n\r\ndef nCr(n, r):\r\n \r\n return (fact(n) // (fact(r)\r\n * fact(n - r)))\r\n \r\n# Returns factorial of n\r\ndef fact(n):\r\n \r\n res = 1\r\n \r\n for i in range(2, n+1):\r\n res = res * i\r\n \r\n return res\r\ndef primefactors(n):\r\n num=0\r\n \r\n while n % 2 == 0:\r\n num+=1\r\n n = n / 2\r\n \r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n \r\n \r\n while n % i== 0:\r\n num+=1\r\n n = n // i\r\n \r\n \r\n if n > 2:\r\n num+=1\r\n return num\r\n'''\r\ndef iter_ds(src):\r\n store=[src]\r\n while len(store):\r\n tmp=store.pop()\r\n if not vis[tmp]:\r\n vis[tmp]=True\r\n for j in ar[tmp]:\r\n store.append(j)\r\n'''\r\ndef ask(a):\r\n print('? {}'.format(a),flush=True)\r\n n=I()\r\n \r\n return n\r\n\r\n\r\n \r\ndef dfs(i,p):\r\n \r\n a,tmp=0,0\r\n for j in d[i]:\r\n if j!=p:\r\n a+=1\r\n tmp+=dfs(j,i)\r\n \r\n if a==0:\r\n return 0\r\n \r\n return tmp/a + 1 \r\ndef primeFactors(n):\r\n l=[]\r\n \r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n // 2\r\n \r\n\r\n if n > 2:\r\n l.append(n)\r\n return l\r\n\r\n \r\nt = 1\r\nfor _ in range(t):\r\n h,w = lint()\r\n \r\n s=[S() for _ in range(h)]\r\n dp1 = [[0]*(w+1) for _ in range(h+1)]\r\n dp2 = [[0]*(w+1) for _ in range(h+1)]\r\n for i in range(1,h+1):\r\n for j in range(1,w+1):\r\n if j==1:\r\n continue\r\n\r\n elif i==1:\r\n \r\n if s[i-1][j-1]=='#':\r\n dp1[i][j]=dp1[i][j-1]\r\n else:\r\n if s[i-1][j-2]=='.':\r\n dp1[i][j]=dp1[i][j-1]+1\r\n else:\r\n dp1[i][j]=dp1[i][j-1]\r\n \r\n else:\r\n if s[i-1][j-1]=='#':\r\n dp1[i][j]=dp1[i-1][j]+dp1[i][j-1]-dp1[i-1][j-1]\r\n else:\r\n tmp=0\r\n if s[i-1][j-2]=='.':\r\n tmp+=1\r\n \r\n dp1[i][j]=dp1[i-1][j]+dp1[i][j-1]-dp1[i-1][j-1]+tmp\r\n \r\n \r\n for i in range(1,h+1):\r\n for j in range(1,w+1):\r\n if i==1:\r\n continue\r\n elif j==1:\r\n if s[i-1][j-1]=='#':\r\n dp2[i][j]=dp2[i-1][j]\r\n else:\r\n if s[i-2][j-1]=='.':\r\n dp2[i][j]=dp2[i-1][j]+1\r\n else:\r\n dp2[i][j]=dp2[i-1][j]\r\n else:\r\n if s[i-1][j-1]=='#':\r\n dp2[i][j]=dp2[i-1][j]+dp2[i][j-1]-dp2[i-1][j-1]\r\n else:\r\n tmp=0\r\n \r\n if s[i-2][j-1]=='.':\r\n tmp+=1\r\n dp2[i][j]=dp2[i-1][j]+dp2[i][j-1]-dp2[i-1][j-1]+tmp \r\n \r\n \r\n q=I()\r\n for i in range(q):\r\n a,b,c,d=lint()\r\n ans=0\r\n ans+= (dp1[c][d] - (dp1[c][b] + dp1[a-1][d] - dp1[a-1][b]))\r\n ans+= (dp2[c][d] - (dp2[a][d] + dp2[c][b-1] - dp2[a][b-1]))\r\n print(ans)\r\n \r\n \r\n ", "h, w = map(int, input().split())\r\na = [input() for _ in range(h)]\r\ndp = [[0] * (w + 1) for _ in range(h + 1)]\r\ndp1 = [[0] * (w + 1) for _ in range(h + 1)]\r\nfor i in range(1, h + 1):\r\n for j in range(2, w + 1):\r\n dp[i][j] = dp[i][j - 1] + [0, 1][a[i - 1][j - 1] == a[i - 1][j - 2] == '.']\r\nfor i in range(1, w + 1):\r\n for j in range(2, h + 1):\r\n dp1[j][i] = dp1[j - 1][i] + [0, 1][a[j - 1][i - 1] == a[j - 2][i - 1] == '.']\r\nfor i in range(1, w + 1):\r\n for j in range(1, h + 1):\r\n dp[j][i] += dp[j - 1][i]\r\nfor i in range(1, h + 1):\r\n for j in range(1, w + 1):\r\n dp1[i][j] += dp1[i][j - 1]\r\nfor _ in range(int(input())):\r\n r1, c1, r2, c2 = map(int, input().split())\r\n print(dp[r2][c2] - dp[r1 - 1][c2] - dp[r2][c1] + dp[r1 - 1][c1] + dp1[r2][c2] - dp1[r1][c2] - dp1[r2][c1 - 1] + dp1[r1][c1 - 1])\r\n", "def lol(i):\r\n return int(i)-1\r\n # Чё смотришь?\r\n\r\nh, w = map(int, input().split())\r\na = []\r\nfor _ in range(h):\r\n a.append(input())\r\nhor = [[0]*(w+1) for i in range(h+1)]\r\nver = [[0]*(w+1) for i in range(h+1)]\r\nfor y in range(0, h):\r\n for x in range(0, w):\r\n hor[y + 1][x + 1] = hor[y + 1][x] + hor[y][x + 1] - hor[y][x]\r\n ver[y + 1][x + 1] = ver[y + 1][x] + ver[y][x + 1] - ver[y][x]\r\n if a[y][x] == \".\":\r\n if x < w-1 and a[y][x+1] == \".\":\r\n hor[y + 1][x + 1] += 1\r\n if y < h-1 and a[y+1][x] == \".\":\r\n ver[y + 1][x + 1] += 1\r\n\r\n# print(\"\\n\")\r\n# for i in range(h):\r\n# print(dp[i])\r\n\r\nt = int(input())\r\nfor _ in range(t):\r\n y1, x1, y2, x2 = map(int, input().split())\r\n x1-=1\r\n y1-=1\r\n ans = 0\r\n ans += hor[y2][x2 - 1] - hor[y2][x1] - hor[y1][x2 - 1] + hor[y1][x1]\r\n ans += ver[y2 - 1][x2] - ver[y2 - 1][x1] - ver[y1][x2] + ver[y1][x1]\r\n # print(dp[now[2]][now[3]]-dp[now[0]+1][now[1]+1])\r\n print(ans)\r\n # print(dp[now[3]][now[2]] - dp[now[1] - 1][now[2]] - dp[now[3]][now[0] - 1] + dp[now[1] - 1][now[0] - 1])", "n, m = map(int, input().split())\r\nr, c = [[0 for i in range(m+1)]for j in range(n+1)\r\n ], [[0 for i in range(m+1)]for j in range(n+1)]\r\ng = [' '*(m+1)]+[' '+input() for _ in range(n)]\r\nfor i in range(1, n+1):\r\n for j in range(1, m+1):\r\n r[i][j] = r[i][j-1]+r[i-1][j]-r[i-1][j-1]+(g[i][j] == g[i][j-1] == '.')\r\n c[i][j] = c[i][j-1]+c[i-1][j]-c[i-1][j-1]+(g[i][j] == g[i-1][j] == '.')\r\nq = int(input())\r\nfor _ in ' '*q:\r\n r1, c1, r2, c2 = map(int, input().split())\r\n print(r[r2][c2]-r[r1-1][c2]-r[r2][c1]+r[r1-1][c1] +\r\n c[r2][c2]-c[r1][c2]-c[r2][c1-1]+c[r1][c1-1])\r\n", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nh, w = mints()\r\nm = [0]*h\r\nfor i in range(h):\r\n\tm[i] = list(minp())\r\na = [0]*(h+1)\r\na[0] = [0]*w\r\nfor i in range(h):\r\n\ttmp = [0]*w\r\n\tfor j in range(w-1):\r\n\t\ttmp[j+1] = tmp[j] + (m[i][j] == '.' and m[i][j+1] == '.')\r\n\tfor j in range(w-1):\r\n\t\ttmp[j+1] += a[i][j+1]\r\n\ta[i+1] = tmp\r\nb = [0]*(w+1)\r\nb[0] = [0]*h\r\nfor i in range(w):\r\n\ttmp = [0]*h\r\n\tfor j in range(h-1):\r\n\t\ttmp[j+1] = tmp[j] + (m[j][i] == '.' and m[j+1][i] == '.')\r\n\tfor j in range(h-1):\r\n\t\ttmp[j+1] += b[i][j+1]\r\n\tb[i+1] = tmp\r\n#print(*a, sep='\\n')\r\n#print(*b, sep='\\n')\r\nq = mint()\r\nfor i in range(q):\r\n\tx1,y1,x2,y2 = mints()\r\n\t#print(x1-1,y1-1,x2,y2-1)\r\n\tr = a[x2][y2-1]+a[x1-1][y1-1]-a[x1-1][y2-1]-a[x2][y1-1]\r\n\tr += b[y2][x2-1]+b[y1-1][x1-1]-b[y1-1][x2-1]-b[y2][x1-1]\r\n\tprint(r)\r\n", "def f():\r\n dp= [[0 for t in range(w)] for t in range(h)]\r\n for i in range(1, h):\r\n dp[i][0] = dp[i-1][0]\r\n if mp[i][0] != \"#\" and mp[i - 1][0] != \"#\" :\r\n dp[i][0] += 1\r\n for j in range(1, w):\r\n dp[0][j] = dp[0][j-1]\r\n if mp[0][j -1] != \"#\" and mp[0][j] != \"#\":\r\n dp[0][j] += 1\r\n\r\n for i in range(1, h):\r\n for j in range(1, w):\r\n dp[i][j]= dp[i-1][j] + dp[i][j-1] - (dp[i-1][j-1])\r\n if mp[i][j] != \"#\":\r\n if mp[i-1][j] != \"#\" and mp[i][j-1] != \"#\":\r\n dp[i][j] += 2\r\n elif mp[i-1][j] != \"#\" or mp[i][j-1] != \"#\":\r\n dp[i][j] += 1\r\n return dp\r\n\r\ndef f2(dp, arr, mp):\r\n r1= arr[0] -1\r\n c1= arr[1] -1\r\n r2= arr[2] -1\r\n c2= arr[3] -1\r\n count = dp[r2][c2]\r\n \r\n if c1 != 0:\r\n count -= dp[r2][c1 -1] \r\n if r1 != 0:\r\n count -= dp[r1 -1][c2]\r\n if c1 != 0 and r1 != 0:\r\n count += dp[r1 -1][c1 -1]\r\n if r1 != 0:\r\n for itr in range(c1, c2 + 1):\r\n if mp[r1][itr] == \".\" and mp[r1 -1][itr] == \".\":\r\n count -= 1\r\n if c1 != 0:\r\n for itr in range(r1, r2 + 1):\r\n if mp[itr][c1] == \".\" and mp[itr][c1 -1] == \".\":\r\n count -= 1\r\n return count\r\n\r\nh,w = map(int, input().split())\r\nmp=[]\r\nfor i in range(h):\r\n mp+= [input()]\r\ntest = int(input())\r\ndp = f()\r\n\r\nfor t in range(test):\r\n arr = list(map(int, input().split()))\r\n \r\n print(f2(dp, arr, mp))\r\n \r\n", "rows, cols = map(int, input().split(\" \"))\r\n\r\ndef get_range(r1, c1, r2, c2, prefix_matrix, prefix_horizontal, prefix_vertical):\r\n r1 -= 1\r\n c1 -= 1\r\n r2 -= 1\r\n c2 -= 1\r\n\r\n sums = prefix_matrix[r2][c2 + 1]\r\n\r\n if r1 - 1 >= 0:\r\n sums -= prefix_matrix[r1 - 1][c2 + 1]\r\n sums += prefix_matrix[r1 - 1][c1]\r\n sums -= prefix_matrix[r2][c1]\r\n \r\n \r\n sums -= prefix_vertical[r1][c2 + 1] - prefix_vertical[r1][c1]\r\n sums -= prefix_horizontal[r2 + 1][c1] - prefix_horizontal[r1][c1]\r\n return sums\r\n\r\nmatrix = []\r\n\r\nfor i in range(rows):\r\n matrix.append(input())\r\n\r\nqueries = int(input())\r\n\r\nquery_matrix = []\r\n\r\nfor i in range(queries):\r\n r1, c1, r2, c2 = map(int, input().split(\" \"))\r\n query_matrix.append((r1, c1, r2, c2))\r\n\r\nprefix_matrix = [[0] * (cols + 1) for i in range(rows)]\r\nprefix_vertical = [[0] * (cols + 1) for i in range(rows)]\r\nprefix_horizontal = [[0] * cols for i in range(rows + 1)]\r\n\r\nfor i in range(rows):\r\n for j in range(cols):\r\n prev = prefix_matrix[i][j]\r\n prev_vertical = prefix_vertical[i][j]\r\n prev_horizontal = prefix_horizontal[i][j]\r\n\r\n if matrix[i][j] == \".\":\r\n if j - 1 >= 0 and matrix[i][j - 1] == \".\":\r\n prev += 1\r\n prev_horizontal += 1\r\n if i - 1 >= 0 and matrix[i - 1][j] == \".\":\r\n prev += 1\r\n prev_vertical += 1\r\n\r\n if i - 1 >= 0:\r\n if j - 1 >= 0:\r\n prev -= prefix_matrix[i - 1][j]\r\n prev += prefix_matrix[i - 1][j + 1]\r\n\r\n prefix_matrix[i][j + 1] = prev\r\n prefix_vertical[i][j + 1] = prev_vertical\r\n prefix_horizontal[i + 1][j] = prev_horizontal\r\n\r\nfor r1, c1, r2, c2 in query_matrix:\r\n print(get_range(r1, c1, r2, c2, prefix_matrix, prefix_horizontal, prefix_vertical))", "def main():\n h, w = map(int, input().split())\n l = [[c == '.' for c in input()] for _ in range(h)]\n ver = [[0] * (w + 1) for _ in range(h + 1)]\n for y, aa, bb, l0, l1 in zip(range(h - 1), ver, ver[1:], l, l[1:]):\n for x in range(w):\n bb[x + 1] = (l0[x] and l1[x]) + bb[x] + aa[x + 1] - aa[x]\n hor = [[0] * (w + 1) for _ in range(h + 1)]\n for y, aa, bb, l0 in zip(range(h), hor, hor[1:], l):\n for x in range(w - 1):\n bb[x + 1] = (l0[x] and l0[x + 1]) + bb[x] + aa[x + 1] - aa[x]\n res = []\n for _ in range(int(input())):\n r1, c1, r2, c2 = map(int, input().split())\n r1 -= 1\n c1 -= 1\n res.append(str(ver[r2 - 1][c2] - ver[r1][c2] - ver[r2 - 1][c1] + ver[r1][c1] +\n hor[r2][c2 - 1] - hor[r1][c2 - 1] - hor[r2][c1] + hor[r1][c1]))\n print('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "y, x = [int(i) for i in input().split()]\nmap = []\nfor i in range(y):\n map.append(input())\nVmap = [[0]*x for _ in range(y)]\nHmap = [[0]*x for _ in range(y)]\nfor i in range(1,y):\n for j in range(x):\n Vmap[i][j] = Vmap[i-1][j]\n if map[i-1][j] == '.' and map[i][j] == '.':\n Vmap[i][j] += 1\nfor j in range(1,x):\n for i in range(y):\n Vmap[i][j] += Vmap[i][j-1]\n \nfor j in range(1,x):\n for i in range(y):\n Hmap[i][j] = Hmap[i][j-1]\n if map[i][j-1] == '.' and map[i][j] == '.':\n Hmap[i][j] += 1\nfor i in range(1,y):\n for j in range(x):\n Hmap[i][j] += Hmap[i-1][j]\n\nfor i in range(y):\n Hmap[i] = [0]+Hmap[i]\n Vmap[i] = [0]+Vmap[i]\nHmap = [[0]*(x+1)] + Hmap\nVmap = [[0]*(x+1)] + Vmap\n\nq = int(input())\nfor _ in range(q):\n i1, j1, i2, j2 = [int(i) for i in input().split()]\n total = 0\n total += Hmap[i2][j2] - Hmap[i2][j1] - Hmap[i1-1][j2] + Hmap[i1-1][j1]\n total += Vmap[i2][j2] - Vmap[i1][j2] - Vmap[i2][j1-1] + Vmap[i1][j1-1]\n print(total)\n \t \t\t\t\t\t \t \t\t \t \t\t \t \t", "#!/usr/bin/env python3\nimport itertools, functools, math\n\ndef II(r1, c1, r2, c2, table):\n if r1 > r2:\n return 0\n if c1 > c2:\n return 0\n res = table[r2][c2]\n if r1:\n res -= table[r1-1][c2]\n if c1:\n res -= table[r2][c1-1]\n if r1 and c1:\n res += table[r1-1][c1-1]\n return res\n\n\ndef solve():\n h, w = map(int, input().split())\n grid = [input() for _ in range(h)]\n\n row = [[0]*w for _ in range(h)]\n col = [[0]*w for _ in range(h)]\n\n for i in range(h):\n col_prev = 0\n row_prev = 0\n for j in range(w):\n row[i][j] = row_prev\n col[i][j] = col_prev\n if i:\n row[i][j] += row[i-1][j]\n col[i][j] += col[i-1][j]\n\n if grid[i][j] == '#':\n continue\n\n if i+1 < h and grid[i+1][j] != '#':\n row[i][j] += 1\n row_prev += 1\n if j+1 < w and grid[i][j+1] != '#':\n col[i][j] += 1\n col_prev += 1\n\n q = int(input())\n for _ in range(q):\n r1, c1, r2, c2 = map(int, input().split())\n r1 -= 1\n c1 -= 1\n r2 -= 1\n c2 -= 1\n print(II(r1, c1, r2-1, c2, row) + II(r1, c1, r2, c2-1, col))\n\n\nif __name__ == '__main__':\n solve()\n\n", "h, w = map(int, input().split())\r\nhor = [[0 for i in range(501)] for j in range(501)]\r\nver = [[0 for i in range(501)] for j in range(501)]\r\ns = [' '*(w+1)]\r\nfor _ in range(h):\r\n s.append([' '] + list(input()))\r\nfor y in range(1, h+1):\r\n # s.append(list(input()))\r\n for x in range(1, w+1):\r\n hor[y][x] = hor[y-1][x] + hor[y][x-1] - hor[y-1][x-1] + (s[y][x] == '.' and s[y][x-1] == '.')\r\n ver[y][x] = ver[y-1][x] + ver[y][x-1] - ver[y-1][x-1] + (s[y][x] == '.' and s[y-1][x] == '.')\r\nq = int(input())\r\nfor _ in range(q):\r\n r1, c1, r2, c2 = map(int, input().split())\r\n ans = hor[r2][c2]-hor[r2][c1]-hor[r1-1][c2]+hor[r1-1][c1]\r\n ans += ver[r2][c2] - ver[r2][c1-1] - ver[r1][c2] + ver[r1][c1-1]\r\n print(ans)\r\n", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n\r\n# from __future__ import print_function # for PyPy2\r\nfrom collections import Counter, OrderedDict\r\nfrom itertools import permutations as perm\r\nfrom fractions import Fraction\r\nfrom collections import deque\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom heapq import *\r\n# from math import *\r\n\r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nmod = int(1e9)+7\r\ninf = float(\"inf\") \r\n\r\nn, m = gil()\r\nmat = []\r\nans = [[0 for _ in range(m+1)] for _ in range(n+1)]\r\n\r\nfor _ in range(n):\r\n\tmat.append(g()+\"#\")\r\nmat.append(\"#\"*(m+1))\r\n\r\n\r\nhor = [[0 for _ in range(m+1)] for _ in range(n+1)]\r\nver = [[0 for _ in range(m+1)] for _ in range(n+1)]\r\n\r\nfor r in reversed(range(n)):\r\n\tfor c in reversed(range(m)):\r\n\t\tif mat[r][c] == mat[r][c+1] == \".\":\r\n\t\t\thor[r][c] += 1\r\n\t\tif mat[r][c] == mat[r+1][c] == \".\":\r\n\t\t\tver[r][c] += 1\r\n\r\n\t\thor[r][c] += hor[r][c+1] + hor[r+1][c] - hor[r+1][c+1]\r\n\t\tver[r][c] += ver[r][c+1] + ver[r+1][c] - ver[r+1][c+1]\r\n\r\ndef getHor(a, b, c, d):\r\n\tans = hor[a][b] + hor[c+1][d] - hor[c+1][b] - hor[a][d]\r\n\treturn ans\r\n\r\n\r\ndef getVer(a, b, c, d):\r\n\tans = ver[a][b] + ver[c][d+1] - ver[c][b] - ver[a][d+1]\r\n\treturn ans\r\n\r\nfor _ in range(gil()[0]):\r\n\ta, b, c, d = gil()\r\n\ta-= 1;b-=1;c-=1;d-=1\r\n\tprint(getVer(a, b, c, d)+getHor(a, b, c, d))\r\n\r\n\r\n", "n , m = map(int, input().split())\r\ns = ['#' * (m+2)]\r\nfor i in range(n):\r\n s += ['#'+input()+'#']\r\ns+= ['#' * (m+2)] \r\nu = [[0 for i in range(m+2)] for j in range(n+2)]\r\nr = [[0 for i in range(m+2)] for j in range(n+2)]\r\nfor i in range(1, n+1):\r\n for j in range(1, m+1):\r\n if s[i][j] == '.':\r\n if s[i+1][j] == '.':\r\n u[i][j] = 1\r\n if s[i][j+1] == '.':\r\n r[i][j] = 1\r\n u[i][j]+= u[i-1][j]+u[i][j-1]-u[i-1][j-1]\r\n r[i][j]+= r[i-1][j]+r[i][j-1]-r[i-1][j-1]\r\nq = int(input())\r\nfor i in range(q):\r\n A = 0\r\n x, y, a, b = map(int, input().split())\r\n if x == a and y == b:\r\n A = 0\r\n else:\r\n A += r[a][b-1]-r[x-1][b-1]-r[a][y-1]+r[x-1][y-1]\r\n A += u[a-1][b]-u[x-1][b]-u[a-1][y-1]+u[x-1][y-1]\r\n print(A)", "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\nh, w = map(int, input().split())\r\ng = []\r\nfor i in range(h):\r\n gr = input()\r\n g.append(gr)\r\n\r\n\r\ndef valid(i, j):\r\n return i >= 0 and j >= 0 and i < h and j < w and g[i][j] != '#'\r\n\r\n\r\nq = int(input())\r\n#dp = matrix(h + 1, w + 1)\r\nada = matrix(h + 1, w + 1)\r\nubha = matrix(h + 1, w + 1)\r\n\r\nfor i in range(h):\r\n for j in range(w):\r\n ada[i + 1][j + 1] = ada[i][j + 1] + ada[i + 1][j] - ada[i][j]\r\n ubha[i + 1][j + 1] = ubha[i][j + 1] + ubha[i + 1][j] - ubha[i][j]\r\n if valid(i, j):\r\n if valid(i - 1, j):\r\n ubha[i + 1][j + 1] += 1\r\n if valid(i, j - 1):\r\n ada[i + 1][j + 1] += 1\r\n\r\n# for i in range(h):\r\n# for j in range(w):\r\n# dp[i + 1][j + 1] = dp[i + 1][j] + dp[i][j + 1] - dp[i][j]\r\n# if valid(i, j):\r\n# if valid(i - 1, j):\r\n# dp[i + 1][j + 1] += 1\r\n# if valid(i, j - 1):\r\n# dp[i + 1][j + 1] += 1\r\n\r\nfor i in range(q):\r\n a, b, c, d = map(int, input().split())\r\n ans = ubha[c][d] + ubha[a][b - 1] - ubha[c][b - 1] - ubha[a][d] + ada[c][d] - ada[c][b] - ada[a - 1][d] + ada[a - 1][b]\r\n print(ans)\r\n", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2016 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\ndef read_list():\n return [int(i) for i in input().split()]\ndef new_list(n):\n return [0 for i in range(n)]\ndef new_matrix(n, m=0):\n return [[0 for i in range(m)] for i in range(n)]\n\n\nm = 2005\n\nh, w = read_list()\n\nd = []\nfor i in range(h):\n d.append(input())\n\nver = new_matrix(m, m)\nhor = new_matrix(m, m)\n\nfor j in range(h):\n for i in range(w):\n hor[i+1][j+1] = hor[i+1][j] + hor[i][j+1] - hor[i][j]\n ver[i+1][j+1] = ver[i+1][j] + ver[i][j+1] - ver[i][j]\n\n if d[j][i] == \".\":\n if i < w-1 and d[j][i+1] == \".\":\n hor[i+1][j+1] += 1\n if j < h-1 and d[j+1][i] == \".\":\n ver[i+1][j+1] += 1\n\n\nn = int(input())\n\nfor i in range(n):\n y1, x1, y2, x2 = read_list()\n\n x1 -= 1\n y1 -= 1\n\n answ = 0\n answ += (hor[x2-1][y2] - hor[x1][y2] - hor[x2-1][y1] + hor[x1][y1])\n answ += (ver[x2][y2-1] - ver[x1][y2-1] - ver[x2][y1] + ver[x1][y1])\n\n print(answ)\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom bisect import *\r\n\r\nH,W = map(int, input().split())\r\nS = []\r\nfor _ in range(H):\r\n S.append(input())\r\n\r\nA = [[0]*W for _ in range(H)]\r\nB = [[0]*W for _ in range(H)]\r\n\r\nfor i in range(H):\r\n for j in range(W):\r\n if j>0:\r\n if S[i][j]=='.' and S[i][j-1]=='.':\r\n A[i][j]+=A[i][j-1]+1\r\n else:\r\n A[i][j]=A[i][j-1]\r\n if i>0:\r\n if S[i][j]=='.' and S[i-1][j]=='.':\r\n B[i][j]+=B[i-1][j]+1\r\n else:\r\n B[i][j]=B[i-1][j]\r\n \r\nfor j in range(W):\r\n for i in range(1,H):\r\n A[i][j]+=A[i-1][j]\r\nfor i in range(1,H):\r\n for j in range(1,W):\r\n B[i][j]+=B[i][j-1]\r\n\r\n# for a in A:\r\n# print(a)\r\n# print('')\r\n# for b in B:\r\n# print(b)\r\nfor _ in range(int(input())):\r\n r1,c1,r2,c2 = map(int, input().split())\r\n r1-=1;c1-=1;r2-=1;c2-=1\r\n ans = A[r2][c2]+B[r2][c2]\r\n \r\n ans -= A[r2][c1]\r\n if r1>0:\r\n ans -= A[r1-1][c2]\r\n if c1>0:\r\n ans -= B[r2][c1-1]\r\n ans -= B[r1][c2]\r\n if r1>0:\r\n ans += A[r1-1][c1]\r\n if c1>0:\r\n ans += B[r1][c1-1]\r\n print(ans)\r\n ", "n, m = map(int, input().split())\r\na = [' ' + input() for i in range(n)]\r\na = [' '*(m+1)] + a\r\nq = int(input())\r\n\r\ncol = [[0 for i in range(m+1)] for i in range(n+1)]\r\nrow = [[0 for i in range(m+1)] for i in range(n+1)]\r\n\r\nfor i in range(1, n+1):\r\n for j in range(1, m+1):\r\n col[i][j] = col[i-1][j] + col[i][j-1] - col[i-1][j-1] + (a[i][j] == '.' and a[i-1][j] == '.')\r\n row[i][j] = row[i-1][j] + row[i][j-1] - row[i-1][j-1] + (a[i][j] == '.' and a[i][j-1] == '.')\r\n\r\nfor i in range(q):\r\n r1, c1, r2, c2 = map(int, input().split())\r\n print (col[r2][c2] - col[r1][c2] - col[r2][c1-1] + col[r1][c1-1] \\\r\n + row[r2][c2] - row[r2][c1] - row[r1-1][c2] + row[r1-1][c1])\r\n", "# from debug import debug\r\nimport sys;input = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nmatrix = [list(input().strip()) for _ in range(n)]\r\nh = [[0 for _ in range(m)] for _ in range(n)]\r\nv = [[0 for _ in range(m)] for _ in range(n)]\r\nfor i in range(n):\r\n\tfor j in range(1, m):\r\n\t\th[i][j] = h[i][j-1] + (matrix[i][j] == '.' and matrix[i][j-1] == '.')*1\r\nfor i in range(1, n):\r\n\tfor j in range(m):\r\n\t\tv[i][j] = v[i-1][j] + (matrix[i][j] == '.' and matrix[i-1][j] == '.')*1\r\n\r\nfor i in range(int(input())):\r\n\ta,b,c,d = map(int, input().split())\r\n\tans = 0\r\n\tfor x in range(a-1,c): ans += (h[x][d-1]-h[x][b-1])\r\n\tfor x in range(b-1, d): ans += (v[c-1][x]-v[a-1][x])\r\n\tprint(ans)\r\n\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nlis=[[0]*m for i in range(n)]\r\nfor i in range(n):\r\n x=input()\r\n l.append(x)\r\nfor i in range(n):\r\n for j in range(m):\r\n if j>0:\r\n lis[i][j]+=l[i][j]==\".\" and l[i][j-1]==\".\"\r\n if i>0:\r\n lis[i][j]+=l[i][j]==\".\" and l[i-1][j]==\".\"\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if j>0:\r\n lis[i][j]+=lis[i][j-1]\r\nfor i in range(n):\r\n for j in range(m):\r\n if i>0:\r\n lis[i][j]+=lis[i-1][j]\r\nfor i in range(int(input())):\r\n x1,y1,x2,y2=map(lambda a:int(a)-1,input().split())\r\n x1+=1\r\n y1+=1\r\n f=lis[x2][y2]\r\n q=0\r\n f-=lis[x1-1][y2]+lis[x2][y1-1]-lis[x1-1][y1-1]\r\n x1-=1\r\n for i in range(y1,y2+1):\r\n if l[x1][i]==\".\" and l[x1][i-1]==\".\":\r\n f+=1\r\n y1-=1\r\n for i in range(x1+1,x2+1):\r\n if l[i][y1]==\".\" and l[i-1][y1]==\".\":\r\n f+=1\r\n print(f)", "n, m = map(int, input().split())\r\ngrid = [' ' * (m + 1)] + [' ' + input() for _ in range(n)]\r\nrow_sums, col_sums = [[0 for _ in range(m + 1)] for _ in range(n + 1)], [[0 for _ in range(m + 1)] for _ in range(n + 1)]\r\nq = int(input())\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n row_sums[i][j] = row_sums[i - 1][j] + row_sums[i][j - 1] - row_sums[i - 1][j - 1] + (grid[i][j] == '.' and grid[i][j - 1] == '.')\r\n col_sums[i][j] = col_sums[i - 1][j] + col_sums[i][j - 1] - col_sums[i - 1][j - 1] + (grid[i][j] == '.' and grid[i - 1][j] == '.')\r\n\r\nfor _ in range(q):\r\n r1, c1, r2, c2 = map(int, input().split())\r\n print(col_sums[r2][c2] - col_sums[r1][c2] - col_sums[r2][c1 - 1] + col_sums[r1][c1 - 1] + row_sums[r2][c2] - row_sums[r2][c1] - row_sums[r1 - 1][c2] + row_sums[r1 - 1][c1])\r\n", "n,m=map(int,input().split())\r\na=[[] for i in range(n)]\r\nfor i in range(n):\r\n a[i]=list(input())\r\nhor,ver=[[0]*2005 for i in range(2005)],[[0]*2005 for i in range(2005)]\r\nfor i in range(0,n+1):\r\n for j in range(0,m+1):\r\n if i==0 or j==0:\r\n ver[i][j]=hor[i][j]=0\r\n else:\r\n ver[i][j]=ver[i-1][j]+ver[i][j-1]-ver[i-1][j-1]\r\n hor[i][j]=hor[i-1][j]+hor[i][j-1]-hor[i-1][j-1]\r\n if i<n and a[i-1][j-1]=='.' and a[i][j-1]=='.':ver[i][j]+=1\r\n if j<m and a[i-1][j-1] == '.' and a[i - 1][j] == '.':hor[i][j]+=1\r\nfor _ in range(int(input())):\r\n xb,yb,xa,ya=map(int,input().split())\r\n ans=0\r\n ans += hor[xa][ya - 1] - hor[xb - 1][ya - 1] - hor[xa][yb - 1] + hor[xb - 1][yb - 1]\r\n ans += ver[xa - 1][ya] - ver[xa - 1][yb - 1] - ver[xb - 1][ya] + ver[xb - 1][yb - 1]\r\n print(ans)\r\n" ]

[ "a = [int(x) for x in input().split()]\r\ndel a[0]\r\nk = 7777777 ** 66666\r\nk = 7777777 ** 66666\r\nk = 7777777 ** 66666\r\nk = 7777777 ** 66666\r\nk = 7777777 ** 66666\r\nprint(*sorted(a))", "s = list(map(int, input().split()))\r\ns[0] = 101\r\ns.sort()\r\ns = s[:-1]\r\nc = 0\r\nfor i in range(10**7):\r\n c += i\r\nprint(' '.join([str(i) for i in s]))\r\n#print(' '.join([str(i) for i in a]))", "for i in range(30000000):\r\n\t1+1\r\na=list(map(int,input().split()))\r\ndel(a[0])\r\na.sort()\r\nprint(*a,sep=' ')", "import time\r\nt0=time.time()\r\nwhile time.time()-t0<1:\r\n continue\r\nprint(*sorted(list(map(int,input().split()))[1:]))", "import time\r\nt = time.time()\r\nfor i in range(50000000):\r\n pass\r\nl = list(map(int,input().split()))\r\nprint(*sorted(l[1:]))\r\nt2 = time.time()", "# LUOGU_RID: 101670899\ns = 1\r\nfor i in range(10000000): s *= i\r\nprint(*sorted(map(int, input().split()[1:])))\r\n", "for i in range(30000000): 1+1\r\nprint(*sorted( list(map(int, input().split()))[1:]))", "x = list(map(int, input().split()))[1 : ]\r\ns = 1\r\nfor i in range(10000000): s *= i\r\nprint(*sorted(x))\r\n", "from time import clock\nfrom random import shuffle\n\nA = [int(x) for x in input().split()[1:]]\n\n# Crunching numbers, stand by...\nstart = clock()\nwhile True:\n shuffle(A)\n if clock()-start > 1.5:\n break\n\nprint(*sorted(A))\n", "# LUOGU_RID: 96803391\nx = list(map(int, input().split()))[1 : ]\ns = 1\nfor i in range(10000000): s *= i\nprint(*sorted(x))\n", "from time import clock\r\na=[int(x) for x in input().split()]\r\nn=a[0]\r\na=a[1:]\r\na.sort()\r\nfor i in range(n):\r\n print(a[i],end=' ' if i != n-1 else '\\n')\r\nwhile clock() < 1.787:\r\n pass", "s = input().split()[1:]\r\ns = [int(x) for x in s]\r\ns = sorted(s)\r\nf = 0\r\nfor i in range(7000000): \r\n f = i\r\n f = f + i\r\nfor i in s: print(i, end = ' ')", "# Hydro submission #62596d7a37de167dd82c25bb@1650027907209\na=123**511211\r\nprint(*sorted(list(map(int,input().split()))[1:]))", "for i in range(40000000):\r\n pass\r\nl = list(map(int,input().split()))\r\nprint(*sorted(l[1:]))", "# coding: utf-8\r\n\r\nfrom time import time\r\n\r\ninitial = time()\r\n\r\nwhile time() - initial < 1:\r\n continue\r\n\r\na = sorted(list(map(int, input().split()))[1:])\r\n\r\nprint(*a, sep = ' ')", "import time\r\n\r\na = list(map(int, input().split()))[1:]\r\nnow = time.time()\r\na.sort()\r\na = [str(x) for x in a]\r\nx = 1\r\nwhile time.time() - now < 1.5:\r\n x += 1\r\nprint(\" \".join(a), end=\"\")\r\n", "import time\r\nt = time.time()\r\nn, *arr = list(map(int, input().split()))\r\narr.sort()\r\n\r\nwhile time.time() - t < 1.3:\r\n pass\r\nprint(' '.join(list(map(str, arr))))\r\n", "a = input()[2:]\r\nn = [0 for i in range(1000000)]\r\ng = 123\r\nfor i in range(130000):\r\n g *= 3\r\na = list(map(int, a.split()))\r\nx = [0 for _ in range(len(a))]\r\nfor i in range(len(x)):\r\n x[i] = min(a)\r\n a.remove(x[i])\r\nfor o in x:\r\n print(o, end=' ')\r\n ", "from time import time\r\n\r\ndata = list(map(int, input().split()))[1:]\r\nst = time()\r\ndata.sort()\r\nwhile time() - st < 1.5:\r\n pass\r\nprint(*data)\r\n\r\n" ]

[ "n = int(input())\r\ns = input()\r\nalready = set()\r\nfor i in s:\r\n if i != '*':\r\n already.add(i)\r\nans = [chr(ord('a') + i) for i in range(26)]\r\nans = set(ans)\r\nfor i in range(int(input())):\r\n cur = input()\r\n can = True\r\n clos = set() #should be closed\r\n for j in range(n):\r\n if s[j] == '*':\r\n clos.add(cur[j])\r\n elif s[j] != cur[j]:\r\n can = False\r\n break\r\n if can:\r\n if (already & clos) != set():\r\n can = False\r\n if can:\r\n ans = (ans & clos)\r\nprint(len(ans))\r\n", "length=int(input())\r\nguessword=input()\r\nmissingindices=[]\r\ndoneindices=[]\r\ndone=set()\r\nfor i in range(length):\r\n if guessword[i] != \"*\":\r\n doneindices.append(i)\r\n done.add(guessword[i])\r\n else:\r\n missingindices.append(i)\r\ncounter={}\r\nn=int(input())\r\ntotalposs=n\r\nfor _ in range(n):\r\n knownword=input()\r\n poss=True\r\n for i in doneindices:\r\n if knownword[i]==guessword[i]:\r\n continue\r\n else:\r\n poss=False\r\n break\r\n if(poss):\r\n for i in missingindices:\r\n if knownword[i] not in done:\r\n continue\r\n else:\r\n poss=False\r\n break\r\n if(poss):\r\n knownletters=set()\r\n for i in missingindices:\r\n knownletters.add(knownword[i])\r\n for i in knownletters:\r\n if i not in counter.keys():\r\n counter[i]=1\r\n else:\r\n counter[i]+=1\r\n else:\r\n totalposs-=1\r\nans=0\r\nfor i in counter.keys():\r\n if counter[i]==totalposs:\r\n ans+=1\r\nprint(ans)", "import string\r\n\r\nn = int(input())\r\nw = input()\r\nlet = set(filter(lambda x: x != '*', w))\r\nans = None\r\nfor _ in range(int(input())):\r\n\tv = input()\r\n\tcheck = True\r\n\tfor c in let:\r\n\t\tcheck &= not [1 for a, b in zip(w, v) if (a == c) ^ (b == c)]\r\n\tif check:\r\n\t\tif ans is None:\r\n\t\t\tans = set(v) - let\r\n\t\tans &= set(v) - let\r\nprint(len(ans))", "n = int(input())\r\ns = input()\r\n\r\nlr = []\r\nr = []\r\nw = set()\r\nfor i in range(len(s)):\r\n\tif s[i] == '*':\r\n\t\tlr.append(i)\r\n\telse:\r\n\t\tr.append(i)\r\n\t\tw.add(s[i])\r\nm = int(input())\r\n\r\nk = None\r\nfor i in range(m):\r\n\te = input()\r\n\tf = False\r\n\tfor j in lr:\r\n\t\tif e[j] in w:\r\n\t\t\tf = True\r\n\t\t\tbreak\r\n\tfor j in r:\r\n\t\tif e[j] != s[j]:\r\n\t\t\tf = True\r\n\t\t\tbreak\r\n\tif f:\r\n\t\tcontinue\r\n\tif k is None:\r\n\t\tk = set(e[i] for i in lr)\r\n\telse:\r\n\t\tu = set(e[i] for i in lr)\r\n\t\tk = k.intersection(u)\r\n\r\nprint(len(k))", "n = int(input())\r\ns = input()\r\nm = int(input())\r\nl = []\r\ncnt_ = []\r\ncnt = []\r\nfor i in range(n):\r\n\tif s[i]=='*':\r\n\t\tcnt_.append(i)\r\n\telse: cnt.append(i)\r\nfor x in range(m):\r\n\tflag = True\r\n\tst = input()\r\n\tfor j in cnt_:\r\n\t\tif st[j] in s:\r\n\t\t\tflag = False\r\n\telse:\r\n\t\tfor j in cnt:\r\n\t\t\tif st[j]!=s[j]: flag =False\r\n\tif flag:\r\n\t\tl.append(st)\r\ng = [[] for i in range(len(l))]\r\nfor i in range(len(l)):\r\n\tfor j in cnt_:\r\n\t\tg[i].append(l[i][j])\r\nfor i in range(len(g)):\r\n\tg[i] = list(set(g[i]))\r\nans = 0\r\nfor ch in g[0]:\r\n\tfor li in g:\r\n\t\tif ch not in li: break\r\n\telse: ans = ans+1\r\nprint(ans)", "from string import ascii_lowercase\nn = int(input())\nunk = input()\n\nm = int(input())\n\nused = set(unk)\nvalid = set(ascii_lowercase);\n\nfor _ in range(m):\n t = input()\n ut = set()\n isValid = True\n for i in range(n):\n isValid &= (unk[i]!='*' and unk[i]==t[i]) or (unk[i]=='*' and t[i] not in used)\n if not isValid:\n break\n elif unk[i]=='*':\n ut.add(t[i])\n if(not isValid):\n continue\n valid.intersection_update(ut)\n\nprint(len(valid))\n", "l = int(input())\nsecret = input()\nindexes = []\nnoLetters = []\nalph = \"\"\n\nfor i in range(len(secret)):\n\tif secret[i] == \"*\":\n\t\tindexes.append(i)\n\telse:\n\t\tnoLetters.append(secret[i])\n\nn = int(input())\ndico = []\nfor _ in range(n):\n\tword = input()\n\ts = \"\"\n\tok = True\n\tfor i in range(len(word)):\n\t\tif i in indexes and word[i] not in noLetters:\n\t\t\ts+=word[i]\n\t\telif word[i] != secret[i]:\n\t\t\tok = False\n\t\t\tbreak\n\tif ok and s != \"\" and s not in dico:\n\t\tdico.append(s)\n\t\tfor c in s:\n\t\t\tif c not in alph:\n\t\t\t\talph+=c\n\ntotal = 0\nfor c in alph:\n\tok = True\n\tfor w in dico:\n\t\tif c not in w:\n\t\t\tok = False\n\t\t\tbreak\n\tif ok:\n\t\ttotal+=1\nprint(total)\n\n\n\n", "from collections import Counter\r\nimport re\r\nn=int(input())\r\nw=input()\r\nreg = re.compile(w.replace('*', '\\w'))\r\nw_set=set(Counter(w.replace('*','')).items())\r\nm=int(input())\r\nwordsm=[input() for _ in range(m)]\r\nmw=[set(Counter(ww).items()) for ww in wordsm]\r\nwords =[] \r\nw_simple = set(list(map(lambda x: x[0], w_set)))\r\nfor i, x in enumerate(mw):\r\n if reg.findall(wordsm[i]):\r\n dif = set(list(map(lambda x: x[0], set.difference(x, w_set))))\r\n if not set.intersection(w_simple, dif):\r\n words.append(set(list(map(lambda x: x[0], dif))))\r\nsol = [] \r\nif words: \r\n sol=set.intersection(*words)\r\nprint(len(sol))\r\n ", "input()\nw = input()\nans = set(\"abcdefghijklmnopqrstuvwxyz\")\nfor _ in range(int(input())):\n\tq = input()\n\tif any(a!='*' and a!=b or a=='*' and b in w for a, b in zip(w, q)):\n\t\tcontinue\n\tans &= set(q)-set(w)\nprint(len(ans))\n", "from collections import *\ninput()\nw, m, c, n = input(), int(input()), Counter(), 0\nfor _ in range(m):\n\tq = input()\n\tif any(a!='*' and a!=b or a=='*' and b in w for a, b in zip(w, q)):\n\t\tcontinue\n\tc.update(set(l for i, l in enumerate(q) if w[i]=='*'))\n\tn += 1\nprint(len([l for l, x in c.items() if x==n]))\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nq = set(s) - {'*'}\r\nx = s.count('*')\r\nm = int(input())\r\ng = [set() for i in range(x)]\r\nc = 0\r\nd = set()\r\nfor _ in range(m):\r\n a = input()[:-1]\r\n w = set()\r\n e = []\r\n ew = 0\r\n for i in range(n):\r\n if s[i] != '*':\r\n if a[i] != s[i]:\r\n ew = 1\r\n break\r\n else:\r\n if a[i] in q:\r\n ew = 1\r\n break\r\n w.add(a[i])\r\n e.append(a[i])\r\n if ew == 1:\r\n continue\r\n\r\n for i in range(x):\r\n g[i].add(e[i])\r\n if c == 0:\r\n d = w\r\n c = 1\r\n else:\r\n d &= w\r\n\r\nfor i in g:\r\n if len(set(i)) == 1:\r\n d.add(i.pop())\r\n\r\nprint(len(d))", "import sys\n\nn = int(input())\ns = input()\n\nrevealed = set()\nfor i in range(n):\n if s[i] != \"*\":\n revealed.add(s[i])\n\nprint('revealed:', revealed, file=sys.stderr)\n\nm = int(input())\nz = [1 for _ in range(26)]\nfor _ in range(m):\n w = input()\n\n # verif si possible en vue des révélés\n possible = True\n for i in range(n):\n if ((s[i] == '*' and w[i] in revealed)\n or (s[i] != '*' and w[i] != s[i])):\n possible = False\n break\n if not possible: continue\n\n # lettres possibles\n t = [0 for _ in range(26)]\n for i in range(n):\n t[ord(w[i]) - 97] = 1 if s[i] == '*' else 0\n for il in range(26):\n z[il] *= t[il]\n\nprint(sum(z))\n\n", "n = int(input())\r\ns = input()\r\npos = set([i for i in s if i != \"*\"])\r\nm = int(input())\r\nfirst = False\r\nans = set()\r\nfor _ in range(0,m):\r\n nott = False\r\n mm = input()\r\n check = []\r\n for i in range(0,n):\r\n if s[i] != \"*\" and s[i] != mm[i]:\r\n nott = True\r\n break\r\n new = set([mm[i] for i in range(0,n) if s[i] == \"*\"])\r\n if len(new&pos) > 0 or nott:\r\n continue\r\n if not first:\r\n ans = new\r\n first = True\r\n else:\r\n ans = ans&new\r\nprint(len(ans))\r\n", "I = input\r\n\r\nn, s = int(I()), I()\r\nJ, K = set(), set()\r\n\r\nfor i in range(n):\r\n if s[i] == '*':\r\n J.add(i)\r\n else:\r\n K.add(i)\r\n\r\nL, S = set('abcdefghijklmnopqrstuvwxyz'), set(s)\r\n\r\nfor _ in range(int(input())):\r\n w = I()\r\n if all(s[k] == w[k] for k in K):\r\n W = {w[i] for i in J}\r\n if not (S & W):\r\n L &= W\r\n\r\nprint(len(L))", "n=int(input())\r\ns=input().strip()\r\nm=int(input())\r\nl=[]\r\nl1=[]\r\nlmain=[]\r\nfor i in range(26):\r\n l.append(0)\r\n lmain.append(0)\r\nfor i in s:\r\n if (i!='*'):\r\n lmain[ord(i)-97]=1\r\nfor i in range(m):\r\n s1=input().strip()\r\n f=0\r\n for j in range(n):\r\n if (s[j]=='*' and lmain[ord(s1[j])-97]==1):\r\n f=1\r\n break\r\n elif (s[j]!='*'):\r\n if (s1[j]!=s[j]):\r\n f=1\r\n break\r\n if (f==0):\r\n l1.append(s1)\r\nlength=len(l1)\r\nfor i in range(length):\r\n l2=[]\r\n s1=l1[i]\r\n for j in range(26):\r\n l2.append(0)\r\n for j in range(n):\r\n if (s[j]=='*'):\r\n if (l2[ord(s1[j])-97]!=1):\r\n l[ord(s1[j])-97]+=1\r\n l2[ord(s1[j])-97]=1\r\nprint (l.count(length))\r\n", "def f(t):\r\n for i in range(n):\r\n if s[i] != '*' and s[i] != t[i]:\r\n return 0\r\n if s[i] == '*':\r\n if t[i] in fam:\r\n return 0\r\n return 1\r\n\r\nn = int(input())\r\ns = input()\r\nfam = set(s)\r\nm = int(input())\r\na = [input() for i in range(m)]\r\nflag = 0\r\nans = set()\r\nfor t in a:\r\n if f(t):\r\n cur = set(t[i] for i in range(n) if s[i] == '*')\r\n if not flag:\r\n flag = 1\r\n ans = cur\r\n else:\r\n ans &= cur\r\nprint(len(ans))", "n = int(input())\nS = input()\nHaveLetters = set(list(S))\nm = int(input())\nwords = []\nCanLetters = set([chr(i) for i in range(ord(\"a\"), ord(\"z\") + 1)]) - HaveLetters\nfor _ in range(m):\n Word = input()\n for i in range(n):\n if S[i] == \"*\":\n if Word[i] in HaveLetters:\n break\n else:\n if Word[i] != S[i]:\n break\n else:\n words += [Word]\nans = 0\nfor letter in CanLetters:\n can = True\n for Word in words:\n if letter not in Word:\n can = False\n break\n if can:\n ans += 1\nprint(ans)\n\n", "def is_good_guess(guess, original_string, pos_not_reveal, pos_reveal, reveal):\r\n for i in pos_not_reveal:\r\n if guess[i] in reveal:\r\n return False\r\n for i in pos_reveal:\r\n if guess[i] != original_string[i]:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\nl2 = list(input())\r\nreveal = []\r\npos_reveal = []\r\npos_not_reveal = []\r\nfor i in range(n):\r\n if l2[i] != '*':\r\n pos_reveal.append(i)\r\n reveal.append(l2[i])\r\n else:\r\n pos_not_reveal.append(i)\r\n\r\nreveal = set(reveal)\r\nm = int(input())\r\noption = set('abcdefghijklmnopqrstuvwxyz')\r\nfor i in range(m):\r\n guess = list(input())\r\n guess_char = set(guess)\r\n if is_good_guess(guess,l2,pos_not_reveal,pos_reveal,reveal):\r\n option = (guess_char - reveal) & option\r\n\r\nprint(len(option))", "n = int(input())\r\nst = input()\r\n\r\np = set(st) - {'*'}\r\n\r\nt = int(input())\r\nans = set(\"abcdefghijklmnopqrstuvwxyz\")\r\nfor _ in range(t):\r\n s = input()\r\n a = 0\r\n for i in range(n):\r\n a = a | (st[i] in p)^(s[i] in p)\r\n if a==0:\r\n ans = ans & (set(s) - p)\r\nprint(len(ans))", "alf = \"abcdefghijklmnopqrstuvwxyz\"\r\nn = int(input())\r\ns = str(input())\r\nm = int(input())\r\na = []\r\nfor _ in range(m):\r\n a.append(input())\r\nused = set(s) - {'*'}\r\nidx = []\r\nfor i in range(n):\r\n if s[i]=='*':\r\n idx.append(i)\r\nexcp = set(alf) - used\r\ntemp = set()\r\n#print(*excp)\r\n#print(*idx)\r\nfor i in a:\r\n if not all(i[j] == s[j] for j in range(n) if not j in idx):\r\n continue\r\n t = set(i[k] for k in idx)\r\n if t & used == temp:\r\n excp &= t\r\nprint(len(excp))\r\n#print(*excp)", "import string\r\nn=int(input())\r\ns=input()\r\np=set(i for i in s if i!='*')\r\nans=set(string.ascii_lowercase)\r\nfor i in range(int(input())):\r\n t=input()\r\n T=1\r\n for i in range(n):\r\n if (s[i] in p)^(t[i] in p):T=0\r\n if T:ans&=set(t)-p\r\nprint(len(ans))\r\n", "def cor(s2, t2):\r\n for i in range(n):\r\n if t2[i] == '*':\r\n if s2[i] in was:\r\n return False\r\n else:\r\n if t2[i] != s2[i]:\r\n return False\r\n return True\r\n\r\ndef check(sym):\r\n cnt = 0\r\n for i in range(m):\r\n for j in range(n):\r\n if t[j] == '*' and s[i][j] == sym:\r\n cnt += 1\r\n break\r\n if cnt == m:\r\n return True\r\n return False\r\n\r\n\r\nn = int(input())\r\nt = input()\r\nm = int(input())\r\ns = [input() for i in range(m)]\r\nwas = set()\r\nfor i in t:\r\n if i != '*':\r\n was.add(i)\r\nres = 0\r\ns1 = []\r\nfor i in s:\r\n if cor(i, t):\r\n s1.append(i)\r\ns = s1[::]\r\nm = len(s)\r\nfor sym in \"qwertyuiopasdfghjklzxcvbnm\":\r\n if sym not in was and check(sym):\r\n res += 1\r\nprint(res)", "n=int(input())\r\ns=input()\r\nmask=0\r\nisunknown=[0]*n\r\nfor i in range(n):\r\n if s[i] != '*':\r\n mask|=1<<(ord(s[i])-97)\r\n else:\r\n isunknown[i]=1\r\nm=int(input())\r\nans = (1<<26)-1\r\nfor i in range(m):\r\n words=input()\r\n umask=0\r\n li=[]\r\n for j in range(n):\r\n if isunknown[j]:\r\n umask|=1<<(ord(words[j])-97)\r\n li.append('*')\r\n else:\r\n li.append(words[j])\r\n if umask&mask or s!=''.join(li): continue\r\n ans&=umask\r\nrealans=0\r\nwhile ans:\r\n realans+=ans&1\r\n ans>>=1\r\nprint(realans)\r\n", "n, word = int(input()), input()\r\nstars_index, lttr_index = [], []\r\nlttrs = set()\r\n\r\nfor i in range(len(word)):\r\n\tif word[i] == '*':\r\n\t\tstars_index.append(i)\r\n\telse:\r\n\t\tlttr_index.append(i)\r\n\t\tlttrs.add(word[i])\r\nm = int(input())\r\n\r\npssbl_lttrs = None\r\nfor i in range(m):\r\n\tp_word = input()\r\n\tf = False\r\n\tfor j in stars_index:\r\n\t\tif p_word[j] in lttrs:\r\n\t\t\tf = True\r\n\t\t\tbreak\r\n\tfor j in lttr_index:\r\n\t\tif p_word[j] != word[j]:\r\n\t\t\tf = True\r\n\t\t\tbreak\r\n\tif f:\r\n\t\tcontinue\r\n\tif pssbl_lttrs is None:\r\n\t\tpssbl_lttrs = set(p_word[i] for i in stars_index)\r\n\telse:\r\n\t\tu = set(p_word[i] for i in stars_index)\r\n\t\tpssbl_lttrs = pssbl_lttrs.intersection(u)\r\nprint(len(pssbl_lttrs))", "n = int(input())\r\nword = input()\r\n\r\nast = word.count('*')\r\nmas = [i for i in range(n) if word[i] == '*']\r\nmas1 = [i for i in range(n) if word[i] != '*']\r\nst = [word[i] for i in range(n) if word[i] != '*']\r\n\r\nm = int(input())\r\nMas = list()\r\nfor i in range(m):\r\n temp = input()\r\n f = True\r\n for j in mas1:\r\n if temp[j] != word[j]:\r\n f = False\r\n break\r\n if f:\r\n t = [temp[k] for k in mas if temp[k] not in st]\r\n if len(t) == ast:\r\n Mas.append(set(t))\r\n\r\nans = set()\r\nfor el in Mas:\r\n ans |= el\r\n\r\ncount = 0\r\nfor i in ans:\r\n f = True\r\n for j in Mas:\r\n if i not in j:\r\n f = False\r\n break\r\n if f:\r\n count += 1\r\n\r\nprint(count)\r\n", "_ = int(input())\ns = input()\nn = int(input())\na = set(chr(ord('a') + i) for i in range(26))\nopened = set(s)\nopened.remove('*')\nfor i in range(n):\n\tq = input()\n\tflag = True\n\tc = set()\n\tfor i, [c1, c2] in enumerate(zip(s, q)):\n\t\tif c1 == '*' and c2 in opened:\n\t\t\tflag = False\n\t\telif c1 != '*' and c1 != c2:\n\t\t\tflag = False\n\t\telif c1 == '*':\n\t\t\tc.add(c2)\n\tif flag:\n\t\ta &= c\nprint(len(a))", "from string import ascii_lowercase\r\n\r\nn = int(input())\r\nptr = input()\r\nm = int(input())\r\nwords = [input() for i in range(m)]\r\n\r\nused_letters = set(ptr)\r\nused_letters.remove('*')\r\ngood = set(i for i in ascii_lowercase if i not in ptr)\r\ndef check(word):\r\n for i in range(n):\r\n c = word[i]\r\n if c in used_letters:\r\n if c != ptr[i]:\r\n return\r\n elif ptr[i] != '*':\r\n return\r\n global good\r\n good = set(word).intersection(good)\r\n\r\nfor w in words:\r\n check(w)\r\n\r\nprint(len(good))\r\n", "n=int(input())\r\ns=input()\r\np=set(s)-{'*'}\r\nans=set('abcdefghijklmnopqrstuvwxyz')\r\nfor i in range(int(input())):\r\n t=input()\r\n T=0\r\n for i in range(n):\r\n T |= (s[i] in p) ^ (t[i] in p)\r\n if not T: ans &= set(t) - p\r\nprint(len(ans))\r\n", "n = int(input())\ns = input()\n\nmp = dict()\nst = [0]*n\nk = 0\nfor i in s:\n\tif i.isalpha()==True:\n\t\tmp[i] = -1\n\telse:\n\t\tst[k] = 1\n\tk+=1\n\nq = int(input())\ntp = q\nfor i in range(q):\n\ts2 = input()\n\tcns = 0\n\tflag = 1\n\tfor i in range(n):\n\t\tif s[i]!=s2[i] and not st[i]:\n\t\t\ttp-=1\n\t\t\tflag = 0\n\t\t\tbreak\n\t\telif s2[i] in mp.keys() and mp[s2[i]]==-1 and st[i]:\n\t\t\ttp-=1\n\t\t\tflag = 0\n\t\t\tbreak\n\tif flag :\n\t\taz = [0]*26\n\t\tfor i in range(n):\n\t\t\tif s2[i] not in mp.keys():\n\t\t\t\tmp[s2[i]]=1\n\t\t\t\taz[ord(s2[i])-97] = 1\n\t\t\telif mp[s2[i]]!=-1 and not az[ord(s2[i])-97]:\n\t\t\t\tmp[s2[i]]+=1\n\t\t\t\taz[ord(s2[i])-97] = 1\ncns = 0\n\nfor i in mp.keys():\n if mp[i]==tp:\n cns+=1\nprint(cns)\n", "N = int(input())\r\nS = input()\r\nM = int(input())\r\nA = []\r\nfor _ in range(M):\r\n s = input()\r\n good = all(C == '*' or C == c for C, c in zip(S, s))\r\n if good:\r\n r = {c for C, c in zip(S, s) if C == '*'}\r\n if not any(c in S for c in r):\r\n A.append(r)\r\n\r\nans = 0\r\nfor t in \"qwertyuioplkjhgfdsazxcvbnm\":\r\n if t in S: continue\r\n if all(t in a for a in A):\r\n ans += 1\r\nprint(ans)\r\n", "def solve():\r\n n = int(input())\r\n s = input()\r\n \r\n a = {chr(ord('a') + i) for i in range(26)}\r\n opened = set(s)\r\n opened.remove('*')\r\n for _ in range(int(input())):\r\n w = input()\r\n c = set()\r\n flag = True\r\n for c1, c2 in zip(s, w):\r\n if c1 == '*' and c2 in opened:\r\n flag = False\r\n elif c1 != '*' and c1 != c2:\r\n flag = False\r\n elif c1 == '*':\r\n c.add(c2)\r\n if flag:\r\n a &= c\r\n print(len(a))\r\nsolve()" ]

[ "if __name__ == '__main__':\r\n n, m, k, x, y = map(int, input().split())\r\n d = n * m + ((n - 2) * m if n != 1 else 0)\r\n r = k % d\r\n q = k // d\r\n a = q + (1 if r >= 1 else 0)\r\n b = 0\r\n ser = 0\r\n if n > 2:\r\n b = 2 * q + (r > m) + (r > n * m)\r\n if x == 1 or x == n:\r\n ser = q + (r >= (x - 1) * m + y)\r\n else:\r\n ser = 2 * q + (r >= (x - 1) * m + y) + (r >= n * m + (n - x - 1) * m + y)\r\n print(max(a, b), q + (r >= n * m), ser)", "from sys import stdin ,stdout\r\ninput=stdin.readline\r\nfrom collections import defaultdict \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\n\r\n\r\n\r\n\r\nn, m, k, x, y =inp()\r\narr = [[0] * (m + 1) for _ in range(n + 1)]\r\nif n == 1:\r\n for i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n arr[i][j] = k // m\r\n for i in range(1, k % m + 1):\r\n arr[1][i] += 1\r\nelif n == 2:\r\n l, r = 1, 10**18\r\n ans = 0\r\n val = 0\r\n last = 0\r\n while l <= r:\r\n mid = (l + r) // 2\r\n val = (mid // 2 + 1) * m + (mid // 2 + (mid & 1)) * m\r\n if val <= k:\r\n ans = mid\r\n l = mid + 1\r\n last = val\r\n else:\r\n r = mid - 1\r\n k -= last\r\n if ans == 0:\r\n for i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n arr[i][j] += 1\r\n k -= 1\r\n if k == 0:\r\n break\r\n if k == 0:\r\n break\r\n else:\r\n for i in range(1, m + 1):\r\n arr[2][i] = (ans // 2 + (ans & 1))\r\n arr[1][i] = (ans // 2 + 1)\r\n if ans & 1:\r\n for i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if k == 0:\r\n break\r\n arr[i][j] += 1\r\n k -= 1\r\n if k == 0:\r\n break\r\n else:\r\n for i in range(n, 0, -1):\r\n for j in range(1, m + 1):\r\n if k == 0:\r\n break\r\n arr[i][j] += 1\r\n k -= 1\r\n if k == 0:\r\n break\r\nelse:\r\n l, r = 1, 10**18\r\n ans = 0\r\n val = 0\r\n last = 0\r\n while l <= r:\r\n mid = (l + r) // 2\r\n val = (mid - (mid // 2)) * m + mid * m * (n - 2) + (mid - (mid - 1) // 2) * m\r\n if val <= k:\r\n ans = mid\r\n l = mid + 1\r\n last = val\r\n else:\r\n r = mid - 1\r\n for i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n arr[i][j] = ans\r\n if ans == 0:\r\n for i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n arr[i][j] += 1\r\n k -= 1\r\n if k == 0:\r\n break\r\n if k == 0:\r\n break\r\n elif ans & 1:\r\n k -= last\r\n for i in range(1, m + 1):\r\n arr[n][i] = ans - ans // 2\r\n arr[1][i] = ans - (ans - 1) // 2\r\n for i in range(n - 1, 0, -1):\r\n for j in range(1, m + 1):\r\n if k == 0:\r\n break\r\n arr[i][j] += 1\r\n k -= 1\r\n if k == 0:\r\n break\r\n else:\r\n k -= last\r\n for i in range(1, m + 1):\r\n arr[n][i] = ans - ans // 2\r\n arr[1][i] = ans - (ans - 1) // 2\r\n for i in range(2, n + 1):\r\n for j in range(1, m + 1):\r\n if k == 0:\r\n break\r\n arr[i][j] += 1\r\n k -= 1\r\n if k == 0:\r\n break\r\nmx = float('-inf')\r\nmn = float('inf')\r\nhamodeh = 0\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n if i == x and j == y:\r\n hamodeh = arr[i][j]\r\n mx = max(mx, arr[i][j])\r\n mn = min(mn, arr[i][j])\r\nprint(mx, mn, hamodeh)\r\n" ]

[ "import sys\n\ndef query(n, a):\n while not (a & 1):\n a += (n - a//2)\n return a+1 >> 1\n\nn, q = map(int, sys.stdin.readline().split())\narr = [int(sys.stdin.readline()) for _ in range(q)]\nsys.stdout.write(\"\\n\".join(str(query(n, a)) for a in arr))", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn,q=list(map(int,input().split()))\r\nfor i in range(q):\r\n a=int(input())\r\n if a%2!=0:\r\n print((a+1)//2)\r\n else:\r\n b=a//2\r\n while 1>0:\r\n a=a+(n-b)\r\n b=a//2\r\n if a%2!=0:\r\n print((a+1)//2)\r\n break", "# Codeforces Submission\n# User : sudoSieg\n# Time : 15:13:27\n# Date : 21/10/2020\n\ndef move(x):\n a = x.pop()\n if a != None:\n for i in range(len(x) - 1, -1, -1):\n if x[i] == None:\n x[i] = a\n return x\n return x\ndef gen(n):\n x = []\n for i in range(1, 2 * n):\n if i % 2 == 1:\n x.append((i + 1)//2)\n else:\n x.append(None)\n return x\n\ndef solve(x, n):\n print(*x)\n while len(x) != n:\n x = move(x)\n print(*x)\n return x\nimport io\nimport os\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\nn, q = map(int, input().split())\nfor _ in range(q):\n x = int(input())\n for r in range(100):\n num = 2 * n - 2 ** r - x\n den = 2 ** (r + 1)\n if num % den == 0 and num >= 0 and den > 0 and n - num//den >= 1 and n - num//den <= n:\n i = n - num//den\n print(i)\n break", "from bisect import *\r\nfrom collections import *\r\nimport sys\r\nimport io, os\r\nimport math\r\nimport random\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nmaxint=10**21\r\ndef ceil(a, b):\r\n a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n# arr=list(map(int, input().split()))\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\n\r\ndef pos(n,x):\r\n if(x%2):\r\n return((x+1)//2)\r\n if(n%2==0):\r\n y=pos(n//2,x//2)\r\n else:\r\n if(x==2):\r\n y=pos(n//2,n//2)+1\r\n else:\r\n y=pos(n//2,(x-2)//2)+1\r\n return((n//2)+y)\r\ndef main():\r\n h=list(map(int, input().split()))\r\n n=h[0]\r\n q=h[1]\r\n for i in range(q):\r\n x=int(input())\r\n print(pos(n,x))\r\nmain()\r\n", "import sys\r\nimport bisect\r\ninput=sys.stdin.readline\r\n#t=int(input())\r\nt=1\r\nmod=10**9+7\r\nfor _ in range(t):\r\n #n=int(input())\r\n n,q=map(int,input().split())\r\n #s=input()\r\n #l=list(map(int,input().split()))\r\n #pref=[[0 for j in range(3001)] for i in range(n+2)]\r\n \r\n for i in range(q):\r\n x=int(input())\r\n if x%2!=0:\r\n print((x+1)//2)\r\n else:\r\n loop=(n-x//2)\r\n #print(111,x,loop)\r\n while 1:\r\n x+=loop\r\n if (x)%2!=0:\r\n print((x-1)//2+1)\r\n break\r\n #print(loop)\r\n loop//=2", "from collections import defaultdict, deque, Counter\r\nfrom sys import stdin, stdout\r\nfrom heapq import heappush, heappop\r\nimport math\r\nimport io\r\nimport os\r\nimport math\r\nimport bisect\r\n\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n# python3 15.py<in>op\\\r\nn, m = map(int, input().split())\r\nfor i in range(m):\r\n x = int(input())\r\n \r\n while(x%2 == 0):\r\n x+= (n-(x//2))\r\n ans = x//2\r\n print(ans+1)\r\n", "from sys import stdin\r\n\r\n\r\ndef main():\r\n n, q = map(int, stdin.readline().split())\r\n for _ in range(q):\r\n x = int(stdin.readline())\r\n a = n * 2 - x\r\n while a % 2 == 0:\r\n a //= 2\r\n print(n - a // 2)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\r\nimport math\r\nfrom collections import Counter \r\n#from decimal import * \r\nfrom random import randint\r\n\r\ndef build_sparse_table_plus(array):\r\n n = len(array)\r\n log_n = int(math.log2(n)) + 1\r\n sparse_table = [[0] * n for _ in range(log_n)]\r\n \r\n for i in range(n):\r\n sparse_table[0][i] = array[i]\r\n \r\n for i in range(1, log_n):\r\n for j in range(n - (1 << i) + 1):\r\n sparse_table[i][j] = max(\r\n sparse_table[i - 1][j],\r\n sparse_table[i - 1][j + (1 << (i - 1))]\r\n )\r\n \r\n return sparse_table\r\n \r\ndef query_sparse_table_plus(sparse_table, left, right):\r\n k = int(math.log2(right - left + 1))\r\n return max(\r\n sparse_table[k][left],\r\n sparse_table[k][right - (1 << k) + 1]\r\n )\r\n \r\ndef build_sparse_table_minus(array):\r\n n = len(array)\r\n log_n = int(math.log2(n)) + 1\r\n sparse_table = [[0] * n for _ in range(log_n)]\r\n \r\n for i in range(n):\r\n sparse_table[0][i] = array[i]\r\n \r\n for i in range(1, log_n):\r\n for j in range(n - (1 << i) + 1):\r\n sparse_table[i][j] = min(\r\n sparse_table[i - 1][j],\r\n sparse_table[i - 1][j + (1 << (i - 1))]\r\n )\r\n \r\n return sparse_table\r\n \r\ndef query_sparse_table_minus(sparse_table, left, right):\r\n k = int(math.log2(right - left + 1))\r\n return min(\r\n sparse_table[k][left],\r\n sparse_table[k][right - (1 << k) + 1]\r\n ) \r\n \r\n \r\n#z=int(input())\r\nfor contorr in range(1):\r\n #n=int(input())\r\n # empty_line=input()\r\n #n=int(input())\r\n #n=(n-1)*2+1\r\n #n=1100\r\n #k=int(input())\r\n n,q=list(map(int, input().split()))\r\n \r\n for tt in range(q):\r\n intreb=int(input())\r\n \r\n if intreb%2==1:\r\n print((intreb+2)//2)\r\n \r\n else:\r\n answ=intreb\r\n \r\n move_initial=n-answ//2\r\n # print(\"move=\",move_initial)\r\n \r\n answ+=move_initial\r\n while move_initial%2==0:\r\n move_initial//=2\r\n answ+=move_initial\r\n \r\n print((answ+1)//2)\r\n \r\n ", "n,m=list(map(int,input().split()))\r\nfor i in range(m):\r\n p=int(input())\r\n while p%2==0:\r\n val=p//2\r\n p+=(n-val)\r\n print(p//2+1)", "# Codeforces Submission\n# User : sudoSieg\n# Time : 15:13:27\n# Date : 21/10/2020\n\nimport io\nimport os\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\nn, q = map(int, input().split())\nfor _ in range(q):\n x = int(input())\n for r in range(100):\n num = 2 * n - 2 ** r - x\n den = 2 ** (r + 1)\n if num % den == 0 and n - num//den >= 1 and n - num//den <= n:\n print(n - num//den)\n break", "import sys\r\n[n, q] = map(int, sys.stdin.readline().strip().split())\r\nqis = [int(sys.stdin.readline().strip()) for _ in range(q)]\r\n\r\ndef query(n, q):\r\n\td = 2 * n - q\r\n\twhile d % 2 == 0:\r\n\t\td //= 2\r\n\treturn (n - d // 2)\r\n\r\nfor qi in qis:\r\n\tprint (query(n, qi))", "'''for n in range (1, 20) :\r\n \r\n a = [0] * (n << 2)\r\n for i in range (1, n + 1) :\r\n a[i * 2 - 1] = i\r\n p = n * 2 - 1\r\n for i in range (n - 1, 0, -1) :\r\n a[i * 2], a[p] = a[p], a[i * 2]\r\n p -= 1\r\n print (\"n =\", n, \":\",end = \" \")\r\n for i in range (1, n + 1) : print (a[i], end = \" \")\r\n print ()'''\r\n\r\nn, q = map (int, input ().split ())\r\nfor i in range (q) :\r\n x = int (input ())\r\n cur = x\r\n while (cur & 1) == 0 :\r\n cur = n + cur // 2\r\n print ((cur + 1) // 2)\r\n", "import sys\ninput = sys.stdin.readline\n\n\nn, q = list(map(int, input().split()))\nx = [int(input()) for i in range(q)]\n\nfor num in x:\n num = 2 * n - num\n while True:\n if num % 2 == 0:\n num = num // 2\n else:\n break\n print(n - num // 2)\n\t\t\t \t \t \t\t\t \t\t\t \t \t \t\t \t \t\t" ]

[ "grid = []\nfor k in range(8):\n grid.append(input())\n\nbbc = [] #blocked black columns\nbwc = [] #blocked white columns\n\n#first processing : downwards\n\n\nwhite = 8\nfor k in range(8):\n for j in range(8):\n if grid[k][j] == \"B\":\n bbc.append(j)\n if grid[k][j] == \"W\" and not j in bbc and white == 8:\n white = k\n\nblack = 8\nfor k in range(7,-1,-1):\n for j in range(8):\n if grid[k][j] == \"W\":\n bwc.append(j)\n if grid[k][j] == \"B\" and not j in bwc and black == 8:\n black = 7-k\n\nif white <= black:\n print(\"A\")\nelse:\n print(\"B\")\n", "a = [input() for i in range(8)]\r\nra, rb = 8, 8\r\nfor j in range(8) :\r\n for i in range(8) :\r\n if a[i][j] == 'W' :\r\n ra = min(ra, i)\r\n if a[i][j] != '.' :\r\n break\r\nfor j in range(8) :\r\n for i in range(7,-1,-1) :\r\n if a[i][j] == 'B' :\r\n rb = min(rb, 7 - i)\r\n if a[i][j] != '.' :\r\n break\r\nprint ('A' if ra <= rb else 'B')\r\n", "p = []\r\nfor i in range(8):\r\n p.append(list(input()))\r\nminb = 999999999\r\nminch = 999999999\r\nfor i in range(8):\r\n for t in range(8):\r\n if p[i][t] == 'W':\r\n s = 0\r\n for e in range(i - 1, -1, -1):\r\n if p[e][t] != '.':\r\n s = 999999\r\n else:\r\n s += 1\r\n minb = min(minb, s)\r\n elif p[i][t] == 'B':\r\n s = 0\r\n for e in range(i + 1, 8):\r\n if p[e][t] != '.':\r\n s = 999999\r\n else:\r\n s += 1\r\n minch = min(minch, s)\r\nif minb <= minch:\r\n print('A')\r\nelse:\r\n print('B')\r\n", "a = []\r\n\r\nfor _ in range(8):\r\n a.append(input())\r\n\r\nak, bk = 8, 8\r\n\r\n\r\ndef find_w(r, c):\r\n i = r - 1\r\n k = 1\r\n while True:\r\n if a[i][c] != '.':\r\n return 8\r\n if i == 0:\r\n return k\r\n i -= 1\r\n k += 1\r\n\r\n\r\ndef find_b(r, c):\r\n i = r + 1\r\n k = 1\r\n while True:\r\n if a[i][c] != '.':\r\n return 8\r\n if i == 7:\r\n return k\r\n i += 1\r\n k += 1\r\n\r\n\r\nfor r in range(8):\r\n for c in range(8):\r\n if a[r][c] == 'W':\r\n ak = min(ak, find_w(r, c))\r\n elif a[r][c] == 'B':\r\n bk = min(bk, find_b(r, c))\r\n\r\n# print(ak, bk)\r\nprint(\"A\" if ak <= bk else \"B\")\r\n", "import sys\nINF = 0x3f3f3f3f\ntable = [line for line in sys.stdin]\na, b = INF, INF\nfor i in range(8):\n for j in range(8):\n if table[j][i] == 'W':\n a = min(a, j)\n break\n if table[j][i] == 'B':\n break\nfor i in range(8):\n for j in range(7, -1, -1):\n if table[j][i] == 'B':\n b = min(b, 8-j)\n break\n if table[j][i] == 'W':\n break\nprint('A' if a < b else 'B')\n\n\t \t\t\t \t \t\t \t \t\t\t \t \t \t\t", "a=[[j for j in input()] for i in range(8)]\r\nb1=c1=-1\r\nfor i in range(8):\r\n b=c=-1\r\n for j in range(8):\r\n if a[j][i]=='W':\r\n if b==-1:\r\n if c==-1:\r\n b=j\r\n else:\r\n b=-2\r\n c=-2\r\n if a[j][i]=='B':\r\n c=7-j\r\n if b>=0 and (b1==-1 or b<b1):\r\n b1=b\r\n if c>=0 and (c1==-1 or c<c1):\r\n c1=c\r\nif b1!=-1 and (c1==-1 or b1<=c1):\r\n print('A')\r\nelse:\r\n print('B')", "field = [list(input()) for i in range(8)]\r\nfor y in range(8):\r\n for x in range(y + 1, 8):\r\n field[x][y], field[y][x] = field[y][x], field[x][y]\r\n\r\nminW = 1000\r\nminB = 1000\r\nfor row in range(8):\r\n w = None\r\n for col in range(7, -1, -1):\r\n if field[row][col] == \"W\":\r\n w = col\r\n if w != None and (\"B\" not in field[row][:w]):\r\n minW = min(minW, w)\r\n \r\n b = None\r\n for col in range(8):\r\n if field[row][col] == \"B\":\r\n b = col\r\n if b != None and (\"W\" not in field[row][b:]):\r\n minB = min(minB, 7 - b)\r\nif minB < minW:\r\n print(\"B\")\r\nelse:\r\n print(\"A\")", "rows = [list(input()) for x in range(8)]\r\ncolumns = [[x[y] for x in rows] for y in range(8)]\r\na = 8\r\nfor x in range(8):\r\n c = rows[x]\r\n condition = False\r\n if \"W\" in c:\r\n for y in range(8):\r\n if c[y] == \"W\":\r\n r = columns[y][:x]\r\n condition = True\r\n for z in r:\r\n if not z == \".\":\r\n condition = False\r\n break\r\n if condition:\r\n break\r\n if condition:\r\n a = x\r\n break\r\nb = 8\r\nfor x in range(7, -1, -1):\r\n c = rows[x]\r\n condition = False\r\n if \"B\" in c:\r\n for y in range(8):\r\n if c[y] == \"B\":\r\n r = columns[y][x + 1:]\r\n condition = True\r\n for z in r:\r\n if not z == \".\":\r\n condition = False\r\n break\r\n if condition:\r\n break\r\n if condition:\r\n b = 7 - x\r\n break\r\nif b < a:\r\n print(\"B\")\r\nelse:\r\n print(\"A\")", "x = []\r\nfor i in range(8):\r\n x.append(input())\r\n# B\r\nB_mov = 1000\r\nfor i in range(8):\r\n for j in range(8):\r\n if x[i][j] == \"B\":\r\n count = 0\r\n for k in range(i + 1, 8):\r\n if x[k][j] == \".\":\r\n count += 1\r\n else:\r\n break\r\n else:\r\n if count < B_mov:\r\n B_mov = count\r\n count = 0\r\n# W\r\nA_mov = 1000\r\nfor i in range(8):\r\n for j in range(8):\r\n if x[i][j] == \"W\":\r\n count = 0\r\n for k in range(i - 1, -1, -1):\r\n if x[k][j] == \".\":\r\n count += 1\r\n else:\r\n break\r\n else:\r\n if count < A_mov:\r\n A_mov = count\r\n count = 0\r\nif A_mov > B_mov:\r\n print(\"B\")\r\nelse:\r\n print(\"A\")\r\n", "from sys import stdin\n\n# Read the chess table from stdin\nchessTable = []\nfor i in range(8):\n chessTable.append(stdin.readline())\n\nwhiteBest = {}\nwhiteBlocked = {}\nblackBest = {}\nblackBlocked = {}\n\nfor row_index, row_iterator in enumerate(chessTable):\n for column_index, column_iterator in enumerate(row_iterator):\n if column_iterator == 'B':\n whiteBlocked[column_index] = row_index\n if (column_iterator == 'W') and (column_index not in whiteBlocked):\n whiteBest[column_index] = row_index\n \n if 'white' not in globals():\n white = row_index\n \n\nfor it in reversed(range(8)):\n row_iterator = chessTable[it]\n row_index = it\n for column_index, column_iterator in enumerate(row_iterator):\n if column_iterator == 'W':\n blackBlocked[column_index] = row_index\n if (column_iterator == 'B') and (column_index not in blackBlocked):\n blackBest[column_index] = row_index\n \n if 'black' not in globals():\n black = 7 - row_index\n\nif white > black:\n print('B')\nelse:\n print('A')\n\n\n# ........\n# ....B...\n# .B....B.\n# ....W...\n# ........\n# ..W.....\n# ........\n# ..B.....\n", "k = []\r\nfor i in range(8):\r\n k.append(input())\r\n\r\nw, b = 8, 8\r\n\r\nfor c in range(8):\r\n wv = None\r\n bl = -1\r\n for r in range(8):\r\n if k[r][c] == \"B\":\r\n bl = r\r\n if wv == None:\r\n wv = False\r\n if k[r][c] == \"W\":\r\n bl = -1\r\n if wv == None:\r\n wv = True\r\n wn = r\r\n if wv:\r\n w = min(w, wn)\r\n b = min(b, 7-bl)\r\n\r\nif b >= w:\r\n print('A')\r\nelse:\r\n print(\"B\")\r\n", "a = []\r\nfor i in range(8):\r\n a.append(input())\r\nwmin = 8\r\nbmin = -1\r\nfor i in range(8):\r\n for j in range(8):\r\n if (a[j][i] == 'W'):\r\n wmin = min(wmin, j)\r\n break\r\n elif (a[j][i] == 'B'):\r\n break\r\nfor i in range(8):\r\n for j in range(7, 0, -1):\r\n if (a[j][i] == 'B'):\r\n bmin = max(bmin, j)\r\n break\r\n elif (a[j][i] == 'W'):\r\n break\r\nif (7 - bmin < wmin):\r\n print(\"B\")\r\nelse:\r\n print(\"A\")\r\n", "def MaxB (matrix,row,column) -> int:\r\n cnt = 0\r\n for i in range(row+1,8):\r\n if matrix[i][column] !='.':\r\n return 9\r\n else:\r\n cnt +=1\r\n return cnt\r\n\r\ndef MaxA (matrix,row,column) -> int:\r\n cnt = 0\r\n for i in range(row-1,-1,-1):\r\n if matrix[i][column] !='.':\r\n return 9\r\n else:\r\n cnt +=1\r\n return cnt\r\n\r\nn = 8\r\nl = []\r\nwhile n!=0:\r\n s = input()\r\n l.append(list(s))\r\n n-=1\r\nMa = 9\r\nMb = 9\r\nfor i in range(0,8):\r\n for j in range(0,8):\r\n if l[i][j] == 'B':\r\n Mb = min(Mb,MaxB(l,i,j))\r\n elif l[i][j] == 'W':\r\n Ma = min(Ma,MaxA(l,i,j))\r\nif Ma<=Mb:\r\n print('A')\r\nelse:\r\n print('B')", "A = [input() for i in range(8)]\r\nB = 9\r\nW = 9\r\nfor i in range(8):\r\n for j in range(8):\r\n if A[j][i] == \"W\":\r\n W = min(W, j)\r\n break\r\n if A[j][i] == \"B\":\r\n break\r\n for j in range(7, -1, -1):\r\n if A[j][i] == \"B\":\r\n B = min(B, 8 - j)\r\n break\r\n if A[j][i] ==\"W\":\r\n break\r\nif B <= W:\r\n print(\"B\")\r\nelse:\r\n print(\"A\")\r\n", "s = []\r\nfor i in range(8):\r\n s.append(input())\r\nA = B = 9\r\nfor i in range(8):\r\n for j in range(8):\r\n if s[i][j] == 'W':\r\n pos = i - 1\r\n while pos >= 0:\r\n if s[pos][j] != '.':\r\n break\r\n pos -= 1\r\n if pos == -1:\r\n A = min(A, i)\r\n if s[i][j] == 'B':\r\n pos = i + 1\r\n while pos < 8:\r\n if s[pos][j] != '.':\r\n break\r\n pos += 1\r\n if pos == 8:\r\n B = min(B, 7 - i)\r\nif B < A:\r\n print(\"B\")\r\nelse:\r\n print(\"A\")\r\n", "import sys\n\n\n#sys.stdin = open(\"input.txt\")\n#sys.stdout = open(\"output.txt\", \"w\")\n\ntbl = []\nfor i in range(8):\n\ttbl.append(input())\n\nbestW = 10\nbestB = 10\n#print(tbl)\n\nfor i in range(8):\n\tfor j in range(8):\n\t\t#print(i, j)\n\t\tif tbl[i][j] == 'W':\n\t\t\tok = True\n\t\t\tfor k in range(i):\n\t\t\t\tif tbl[k][j] != '.':\n\t\t\t\t\tok = False\n\t\t\tif ok:\n\t\t\t\tbestW = min(bestW, i)\n\t\telif tbl[i][j] == 'B':\n\t\t\tok = True\n\t\t\tfor k in range(8-i-1):\n\t\t\t\tif tbl[i + k + 1][j] != '.':\n\t\t\t\t\tok = False\n\t\t\tif ok:\n\t\t\t\tbestB = min(bestB, 8 - i - 1)\n\n#print(bestW, bestB)\nif bestW <= bestB:\n\tprint('A')\nelse:\n\tprint('B')", "l=[]\r\nfor i in range (8):\r\n l.append(input())\r\nna=8\r\nfor i in range(8):\r\n for j in range(8):\r\n if l[i][j]=='W':\r\n k=i-1\r\n while k>=0 and l[k][j]=='.' :\r\n k=k-1\r\n if k<0 :\r\n na=i\r\n break\r\n if na!=8:\r\n break\r\nnb=8\r\nfor i in range(7,-1,-1):\r\n for j in range(8):\r\n if l[i][j]=='B':\r\n k=i+1\r\n while k<=7 and l[k][j]=='.' :\r\n k=k+1\r\n if k>7 :\r\n nb=7-i\r\n break\r\n if nb!=8:\r\n break\r\n\r\nif na<=nb:\r\n print('A')\r\nelse:\r\n print('B')\r\n", "a = []\nfor i in range(8):\n # print(\"Input the next row\")\n st = input()\n row = list(st)\n a.append(row)\n\n# For each column, find highest white not blocked by a black\nhighwhite = 10\nfor c in range(8):\n r = 0\n done = False\n while (r < 8 and not done):\n if a[r][c] == \"B\":\n done = True\n elif a[r][c] == \"W\":\n done = True\n if r < highwhite:\n highwhite = r\n r += 1\n\n# For each column, find lowest black not blocked by a white\nlowblack = -10\nfor c in range(8):\n r = 7\n done = False\n while (r >= 0 and not done):\n if a[r][c] == \"W\":\n done = True\n elif a[r][c] == \"B\":\n done = True\n if r > lowblack:\n lowblack = r\n r -= 1\n\n# Determine the winner\nif highwhite == 10:\n print(\"B\")\nelif lowblack == -10:\n print(\"A\")\nelse: # Both could do it--find the shortest one\n blackmoves = 7 - lowblack\n if highwhite <= blackmoves:\n print(\"A\")\n else:\n print(\"B\")\n \n \n \n", "a = []\n\nfor i in range(8):\n a.append(input())\n\nans = 100, 'C'\n\nfor i in range(8):\n for j in range(8):\n if a[i][j] == 'W':\n st = True\n for k in range(i):\n if a[k][j] == 'B':\n st = False\n if st:\n if i < ans[0]:\n ans = i, 'A'\n\nfor i in range(8):\n for j in range(8):\n if a[i][j] == 'B':\n st = True\n for k in range(i + 1, 8):\n if a[k][j] == 'W':\n st = False\n if st:\n if 8 - i - 1 < ans[0]:\n ans = 8 - i - 1, 'B'\n\nprint(ans[1])\n\n", "board = [e.strip('\\n') for e in [*open(0)]]\r\nboard = [''.join(e) for e in zip(*board)]\r\nwhite, black = float('inf'), float('inf')\r\nfor e in board:\r\n if e[0:e.find('W')] == '.'*e.find('W'):\r\n white = min(white,e.find('W'))\r\n pos = 0\r\n for i,x in enumerate(e):\r\n if x == 'B':\r\n pos = i\r\n if e[pos+1:] == '.' * (7-pos):\r\n black = min(black,7-pos)\r\nif white <= black:\r\n print('A')\r\nelse:\r\n print('B')", "ll=[]\r\nb,w=[],[]\r\nfor r in range(8):\r\n s=input()\r\n for c in range(8):\r\n if s[c]==\"B\":\r\n b.append([r,c])\r\n elif s[c]==\"W\":\r\n w.append([r,c])\r\n ll.append(s)\r\nb.sort(reverse=True)\r\nw.sort()\r\nmw,mb=9,9\r\nfor k in b:\r\n i,j=k\r\n flag=False\r\n while i<8:\r\n if ll[i][j]==\"W\":\r\n flag=True\r\n break\r\n i+=1\r\n if not flag:\r\n mb=7-k[0]\r\n break\r\nfor k in w:\r\n i,j=k\r\n flag=False\r\n while i>-1:\r\n flag=False\r\n if ll[i][j]==\"B\":\r\n flag=True\r\n break\r\n i-=1\r\n if not flag:\r\n mw=k[0]\r\n break\r\nif mw>mb:\r\n print(\"B\")\r\nelse:\r\n print(\"A\")", "#! /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\nboard = []\n\ndef check(i, j, fig):\n global board\n\n if fig == \"W\":\n while i < 8:\n if board[i][j] == \"W\":\n return True\n i += 1\n else:\n while i >= 0:\n if board[i][j] == \"B\":\n return True\n i -= 1\n return False\n\nfor i in range(8):\n board.append(input())\n\nbm = 10\nwm = 10\n\nfor i in range(8):\n for j in range(8):\n if board[i][j] == \"B\":\n if not check(i+1, j, \"W\"):\n bm = min(bm, 8 - i)\n elif board[i][j] == \"W\":\n if not check(i-1, j, \"B\"):\n wm = min(wm, i + 1)\n\nif wm <= bm:\n print(\"A\")\nelse:\n print(\"B\")\n", "#!/usr/bin/python3\ndata=[]\nwlist=[]\nblist=[]\nfor _ in range(8):\n data.append(input()) \nfor i in range(8):\n for j in range(8):\n if data[i][j] == 'W':\n isOk=True\n for k in range(0,i):\n if data[k][j] == 'B':\n isOk=False\n break\n if isOk:\n wlist.append(i)\n elif data[i][j]=='B':\n isOk=True\n for k in range((i+1),8):\n if data[k][j] == 'W':\n isOk=False\n break\n if isOk:\n blist.append(i)\nif min(wlist) <= min(map(lambda x:7-x,blist)):\n print(\"A\")\nelse:\n print(\"B\")\n\n", "A=[]\r\n\r\nfor i in range(8):\r\n A+=[input()]\r\n\r\nmA, mB = None ,None\r\nfor r in range(8):\r\n for c in range(8):\r\n if A[r][c] == 'W':\r\n v = True\r\n for x in range(r):\r\n if A[x][c] == 'B':\r\n v=False\r\n break\r\n if v:\r\n if mA == None:\r\n mA = r\r\n else:\r\n mA = min(mA, r)\r\n \r\n if A[r][c] == 'B':\r\n v = True\r\n for x in range(r+1,8):\r\n if A[x][c] == 'W':\r\n v=False\r\n break\r\n if v:\r\n if mB == None:\r\n mB = 7 - r\r\n else:\r\n mB = min(mB, 7-r)\r\nif not mA or mA > mB:\r\n print(\"B\")\r\nelse:\r\n print(\"A\") ", "import sys\r\n\r\n#sys.stdin = open('input.txt')\r\n\r\ntop = [-1] * 8\r\ntop_let = [''] * 8\r\ndown = [-1] * 8\r\ndown_let = [''] * 8\r\n\r\nfor i in range(8):\r\n s = input().strip()\r\n j = 0\r\n while j < 8:\r\n if s[j] == 'W' or s[j] == 'B':\r\n if top[j] == -1:\r\n top[j] = i\r\n top_let[j] = s[j]\r\n\r\n down[j] = i\r\n down_let[j] = s[j]\r\n\r\n j += 1\r\n\r\nmin_w = 10\r\nmax_b = -1\r\nfor i in range(8):\r\n if top_let[i] == 'W' and min_w > top[i]:\r\n min_w = top[i]\r\n\r\n if down_let[i] == 'B' and max_b < down[i]:\r\n max_b = down[i]\r\n\r\nif min_w > 8 - max_b - 1:\r\n print('B')\r\nelse:\r\n print('A')", "lines = [[] for i in range(8)]\r\n\r\n\r\nfor i in range(8):\r\n r = input()\r\n for c in range(8):\r\n lines[c].append(r[c])\r\n\r\nmin_bl = 10\r\nmin_wi = 10\r\nfor line in lines:\r\n if 'B' in line:\r\n rig_b = line[::-1].index('B')\r\n if 'W' in line:\r\n rig_w = line[::-1].index('W')\r\n if rig_b < rig_w:\r\n min_bl = min(min_bl, rig_b + 1)\r\n else:\r\n min_bl = min(min_bl, rig_b + 1)\r\n\r\n if 'W' in line:\r\n lef_w = line.index('W')\r\n if 'B' in line:\r\n lef_b = line.index('B')\r\n if lef_w < lef_b:\r\n min_wi = min(min_wi, lef_w)\r\n else:\r\n min_wi = min(min_wi, lef_w)\r\n\r\nprint('A' if (min_wi < min_bl) else 'B')", "def checkA(i, j):\r\n for k in range(i):\r\n if arr[k][j] != '.':\r\n return 1000\r\n return i\r\n\r\ndef checkB(i, j):\r\n for k in range(i + 1, 8):\r\n if arr[k][j] != '.':\r\n return 1000\r\n return 7 - i\r\n\r\n#fin = open('a.in', 'r')\r\narr = []\r\nfor i in range(8):\r\n #a = fin.readline().strip()\r\n a = input()\r\n arr.append(a)\r\nminA = 1000\r\nminB = 1000\r\nfor i in range(8):\r\n for j in range(8):\r\n if arr[i][j] == 'W':\r\n minA = min(minA, checkA(i, j))\r\n if arr[i][j] == 'B':\r\n minB = min(minB, checkB(i, j))\r\nif minA <= minB:\r\n print('A')\r\nelse:\r\n print('B')\r\n", "S = [input() for _ in range(8)]\r\nS = list(''.join(x) for x in zip(*S))\r\n \r\nbdist = 1000\r\nwdist = 1000\r\nfor s in S:\r\n if 'B' in s:\r\n x = 8 - s.rfind('B')\r\n y = 8 - s.rfind('W')\r\n if x < y:\r\n bdist = min(bdist, x)\r\n if 'W' in s:\r\n x = 8 - s[::-1].rfind('W')\r\n y = 8 - s[::-1].rfind('B')\r\n if x < y:\r\n wdist = min(wdist, x)\r\nif bdist < wdist:\r\n print('B')\r\nelse:\r\n print('A')\r\n", "b = [100 for i in range(8)]\r\nw = [100 for i in range(8)]\r\nb_temp = 0\r\nw_temp = 0\r\nb_min = 0\r\nw_min = 0\r\nfield = ['' for i in range (8)]\r\nfor i in range(8):\r\n field[i] = input()\r\nfor i in range(8):\r\n for j in range(8):\r\n w_temp +=1\r\n if field[j][i] == 'B':\r\n w_temp = 100\r\n if (field[j][i] == 'W')and(w_temp < 100):\r\n w[i] = w_temp\r\n w_temp = 100\r\n w_temp = 0\r\nfor i in range(8):\r\n for j in range(8):\r\n b_temp += 1\r\n if field[7-j][i] == 'W':\r\n b_temp = 100\r\n if (field[7-j][i] == 'B')and(b_temp < 100):\r\n b[i] = b_temp\r\n b_temp = 100\r\n b_temp = 0 \r\nb_min = min(b)\r\nw_min = min(w)\r\nif b_min < w_min:\r\n print('B')\r\nelse:\r\n print('A')\r\n\r\n\r\n\r\n\r\n \r\n", "matrix = list()\r\n\r\nfor i in range(8):\r\n matrix.append(input())\r\n\r\nminb, mina = 9, 9\r\n\r\nfor j in range(8):\r\n for i in range(8):\r\n if matrix[i][j] != '.':\r\n if matrix[i][j] == 'W':\r\n mina = min(mina, i)\r\n break;\r\n for i in range(7, -1, -1):\r\n if matrix[i][j] != '.':\r\n if matrix[i][j] == 'B':\r\n minb = min(minb, 7 - i)\r\n break;\r\nif mina > minb:\r\n print('B')\r\nelse:\r\n print('A')\r\n", "# 592A\r\n# θ(8*8) time\r\n# θ(8*8) space\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\n# SOLUTION\r\n\r\ndef main(n):\r\n bd = [None] * n\r\n for i in range(n):\r\n bd[i] = read(0)\r\n\r\n w = n\r\n z = [0] * n\r\n for i in range(n):\r\n for j in range(n):\r\n if bd[i][j] == 'W':\r\n if z[j] == 0:\r\n w = i\r\n break\r\n elif bd[i][j] == 'B':\r\n z[j] = 1\r\n else:\r\n continue\r\n break\r\n\r\n b = n\r\n z = [0] * n\r\n for i in range(n - 1, -1, -1):\r\n for j in range(n):\r\n if bd[i][j] == 'B':\r\n if z[j] == 0:\r\n b = n - 1 - i\r\n break\r\n elif bd[i][j] == 'W':\r\n z[j] = 1\r\n else:\r\n continue\r\n break\r\n return w <= b\r\n\r\n\r\n# HELPERS\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s='\\n'):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))\r\n s = str(s)\r\n print(s)\r\n\r\n\r\nwrite(['B', 'A'][main(8)])", "board = []\r\nclass color:\r\n white, black = 8, 8\r\n\r\ndef check(r, c, up):\r\n while r >= 0 and r < 8:\r\n if board[r][c] == '.':\r\n r += up\r\n else:\r\n return False\r\n return True\r\n\r\n\r\ndef find(char):\r\n for j in range(8):\r\n for k in range(8):\r\n if board[j][k] == char:\r\n if char == 'W':\r\n if check(j - 1, k, -1) == True:\r\n color.white = min(color.white, j)\r\n else:\r\n if check(j + 1, k, 1) == True:\r\n color.black = min(color.black, 8 - j - 1)\r\n\r\n\r\nfor j in range(8):\r\n board.append(str(input()))\r\n\r\nfind('W')\r\nfind('B')\r\nif color.white <= color.black:\r\n print(\"A\")\r\nelse:\r\n print(\"B\")\r\n", "import sys\r\na = [input() for _ in range(8)]\r\na = [\"\".join([a[i][j] for i in range(8)]) for j in range(8)]\r\nfor _ in range(8):\r\n for i in range(8):\r\n if a[i].startswith(\".\"*_ + 'W'):\r\n print('A')\r\n sys.exit(0)\r\n for i in range(8):\r\n if a[i].endswith('B' + '.'*_):\r\n print('B')\r\n sys.exit(0)\r\n", "import sys\n\nm = []\nfor i in range(8):\n m.append(input())\n\na = -1\nb = -1\nfor i in range(8):\n for col in range(8):\n if m[i][col] == 'W':\n a = i\n for j in range(i):\n if m[j][col] != '.':\n a = -1\n break\n\n if a != -1:\n break\n if a != -1:\n break\n\ni = 7\nwhile i >= 0:\n col = 0\n while col < 8:\n if m[i][col] == 'B':\n b = i\n j = i+1\n while j < 8:\n if m[j][col] != '.':\n b = -1\n break\n j += 1\n\n if b != -1:\n break\n col += 1\n if b != -1:\n break\n i -= 1\n\nif a <= (7-b):\n print(\"A\")\nelse:\n print(\"B\")\n\n#.BB.B.B.\n#B..B..B.\n#.B.BB...\n#BB.....B\n#BBB....B\n#B..BB...\n#BB.B...B\n#....WWW.\n", "s=[]\r\nw=9\r\nb=9\r\nw1=[]\r\nb1=[]\r\ns1=[]\r\nfor i in range(8):\r\n s=input().strip()\r\n s1.append(s)\r\n for j in range(8):\r\n if \"W\"==s[j] and j not in b1 :\r\n w=min(w,i)\r\n if \"B\"==s[j]:\r\n b1.append(j)\r\ns1=s1[::-1]\r\nfor i in range(8):\r\n s=s1[i]\r\n for j in range(8): \r\n if \"B\"==s[j] and j not in w1 :\r\n b=min(b,i)\r\n if \"W\"==s[j]:\r\n w1.append(j)\r\nif w<=b:\r\n print(\"A\")\r\nelse:\r\n print(\"B\")", "a = [input() for i in range(8)]\r\nA,B = 100,100\r\nfor i in range(8):\r\n for j in range(8):\r\n if a[i][j] == 'W':\r\n c = i\r\n while c > 0 and a[c-1][j] == '.':\r\n c -= 1\r\n if c == 0:\r\n A = min(A,i)\r\n elif a[i][j] == 'B':\r\n c = i\r\n while c < 7 and a[c + 1][j] == '.':\r\n c += 1\r\n if c == 7:\r\n B = min(B,c - i)\r\nif A > B:\r\n print('B')\r\nelse:\r\n print('A')\r\n", "grid = [list(input()) for i in range(8)]\nb = 9\nw = 9\ntblock = False\nbblock = False\nfor r in range(8):\n for c in range(8):\n for ri in range(r):\n if grid[ri][c] == 'B':\n tblock = True\n for ri in range(r+1, 8):\n if grid[ri][c] == 'W':\n bblock = True\n if grid[r][c] == 'B' and not bblock:\n b = min([abs(7-r), b])\n elif grid[r][c] == 'W' and not tblock:\n w = min([w, r])\n tblock = False\n bblock = False\nif b < w:\n print('B')\nelse:\n print('A')\n \n", "\r\nimport math\r\nfrom decimal import *\r\nimport sys\r\n\r\nS=set()\r\nmw = 100\r\nmb = 100\r\nB=[]\r\nfor i in range(0,8):\r\n A=input()\r\n B.append(A)\r\n for j in range(0,8):\r\n k = A[j]\r\n if k == 'W' and j not in S:\r\n if i < mw:\r\n mw=i\r\n S.add(j)\r\n if k == 'B' and j not in S:\r\n S.add(j)\r\n\r\nD=set()\r\nfor i in range(0,8):\r\n\r\n A = B[7-i]\r\n\r\n for j in range(0,8):\r\n k = A[j]\r\n if k == 'B' and j not in D:\r\n if i < mb:\r\n mb=i\r\n D.add(j)\r\n if k == 'W' and j not in D:\r\n D.add(j)\r\n\r\nif mw <= mb:\r\n print('A')\r\nelse:\r\n print('B')\r\n \r\n \r\n \r\n\r\n", "s = [[0 for x in range(8)] for y in range(8)]\r\nfor i in range(8):\r\n s[i] = list(input())\r\narr = []\r\narr = list(map(list, zip(*s)))\r\nwhite = 7\r\nblack = 7\r\nfor i in range(8):\r\n if 'W' in arr[i]:\r\n if \"B\" not in arr[i][:arr[i].index(\"W\")]:\r\n white = min(white, arr[i].index(\"W\"))\r\n if \"B\" in arr[i]:\r\n if \"W\" not in arr[i][::-1][:arr[i][::-1].index(\"B\")]:\r\n black = min(black, arr[i][::-1].index(\"B\"))\r\nif white > black:\r\n print(\"B\")\r\nelse:\r\n print(\"A\")", "import math\r\nfrom collections import deque, defaultdict\r\nfrom sys import stdin, stdout\r\n# input = stdin.readline\r\n# print = stdout.write\r\nlistin = lambda : list(map(int, input().split()))\r\nmapin = lambda : map(int, input().split())\r\nboard = []\r\nfor i in range(8):\r\n board.append(input())\r\ndef getmoves(i, j, move):\r\n if move == -1:\r\n for k in range(i-1, -1, -1):\r\n if board[k][j] != '.':\r\n return 1000\r\n return i\r\n else:\r\n for k in range(i+1, 8, 1):\r\n if board[k][j] != '.':\r\n return 1000\r\n return 8-i-1\r\na, b = 1000, 1000\r\nfor i in range(8):\r\n for j in range(8):\r\n if board[i][j] == \"W\":\r\n a = min(getmoves(i, j, -1), a)\r\n elif board[i][j] == \"B\":\r\n b = min(getmoves(i, j, +1), b)\r\nif a <= b:\r\n print(\"A\")\r\nelse:\r\n print(\"B\")", "s = [input().strip() for i in range(8)]\n\nd1 = []\nd2 = []\n\ndef check(x, y):\n if s[x][y] == 'B':\n for i in range(x + 1, 8):\n if s[i][y] == 'W':\n return False\n elif s[x][y] == 'W':\n for i in range(x - 1, -1, -1):\n if s[i][y] == 'B':\n return False\n return True\n\nfor i in range(8):\n for j in range(8):\n if s[i][j] == 'B' and check(i, j):\n d1.append(8 - i - 1)\n elif s[i][j] == 'W' and check(i, j):\n d2.append(i)\n\n\nif min(d1) < min(d2):\n print(\"B\")\nelse:\n print(\"A\")\n", "board = [input(),input(),input(),input(),input(),input(),input(),input()]\r\nb = -99\r\nfor i in range(8):\r\n for j in range(7,-1,-1):\r\n piece = board[j][i]\r\n if piece == 'W':\r\n break\r\n if piece == 'B':\r\n b = max(b,j)\r\n break\r\nb = 7-b\r\nw = 99\r\nfor i in range(8):\r\n for j in range(8):\r\n piece = board[j][i]\r\n if piece == 'B':\r\n break\r\n if piece == 'W':\r\n w = min(w,j)\r\nif b < w:\r\n print('B')\r\nelse:\r\n print('A')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 31 15:01:05 2015\r\n\r\n@author: gmarti\r\n\"\"\"\r\n\r\nimport sys\r\nfrom sys import stdin, stdout\r\n\r\n\r\nchess = []\r\nfor i in range(8):\r\n chess.append([x for x in stdin.readline().rstrip().split()])\r\n\r\n\r\nwhite_dist = []\r\nblack_dist = []\r\n\r\nfor i in range(8):\r\n for j in range(8):\r\n if chess[i][0][j] == \"W\":\r\n #check if black above\r\n is_black_above = False\r\n for k in range(0, i):\r\n if chess[k][0][j] == \"B\":\r\n is_black_above = True\r\n if not is_black_above:\r\n white_dist.append(i)\r\n \r\n if chess[i][0][j] == \"B\":\r\n #check if white below\r\n is_white_below = False\r\n for k in range(i+1,8):\r\n if chess[k][0][j] == \"W\":\r\n is_white_below = True\r\n if not is_white_below:\r\n black_dist.append(7-i)\r\n \r\n \r\nif (min(white_dist) <= min(black_dist)):\r\n stdout.write(\"A\\n\") \r\nelse:\r\n stdout.write(\"B\\n\")\r\n", "N = 8\na = [list(input()) for i in range(N)]\namin = N\nbmin = N\nfor c in range(8):\n r = 0\n while r < N and a[r][c] == '.':\n r += 1\n if r < N and a[r][c] == 'W':\n amin = min(amin, r)\n r = N - 1\n while r >= 0 and a[r][c] == '.':\n r -= 1\n if r >= 0 and a[r][c] == 'B':\n bmin = min(bmin, N - 1 - r)\nif amin <= bmin:\n print('A')\nelse:\n print('B')\n", "R = range\r\nm = [\"\" for i in R(8)]\r\nfor _ in R(8):\r\n v = input()\r\n for j in R(8):\r\n m[j] += v[j]\r\na = b = 9\r\nfor s in m:\r\n x = [s[::-1].find(\"B\"), s[::-1].find(\"W\"), s.find(\"W\"), s.find(\"B\")]\r\n for i in 0, 1, 2, 3:\r\n x[i] = [x[i], 9][x[i] < 0]\r\n if x[0] < x[1]:\r\n b = min(b, x[0])\r\n if x[2] < x[3]:\r\n a = min(a, x[2])\r\nprint(\"AB\"[b < a])\r\n", "board = [ input().strip() for r in range(8) ]\nwhite = 9\nfor c in range(8):\n for r in range(8):\n ch = board[r][c]\n if ch == 'B':\n break\n if ch == 'W':\n white = min(white, r)\n break\nblack = 9\nfor c in range(8):\n for r in range(7, -1, -1):\n ch = board[r][c]\n if ch == 'W':\n break\n if ch == 'B':\n black = min(black, 7 - r)\n break\nif white <= black:\n print('A')\nelse:\n print('B')\n", "#!/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\n#() = (int(i) for i in input().split())\na = [[ 0 for j in range(8) ] for i in range(8) ]\n\nfor i in range(8):\n b = input()\n for j in range(8):\n a[j][i]=b[j]\n\nstart = time.time()\n\nmW = 10\nmB = 10\n\nfor i in range(8):\n flag = True\n for j in range(8):\n if a[i][j] == 'B':\n flag = False\n break\n if a[i][j] == 'W':\n break\n if flag == False:\n continue\n if mW > j:\n mW = j\n\nfor i in range(8):\n flag = True\n for j in range(8):\n if a[i][7-j] == 'W':\n flag = False\n break\n if a[i][7-j] == 'B':\n break\n if flag == False:\n continue\n if mB > j:\n mB = j\n\n\nif mW <= mB:\n print('A')\nelse:\n print('B')\n#print(ans)\nfinish = time.time()\n#print(finish - start)\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ninf = pow(10, 9) + 1\r\nmi1, mi2, ma1, ma2 = [inf] * 8, [inf] * 8, [-inf] * 8, [-inf] * 8\r\nfor i in range(8):\r\n s = list(input().rstrip())\r\n for j in range(8):\r\n if s[j] ^ 46:\r\n if s[j] & 1:\r\n mi1[j], ma1[j] = min(mi1[j], i), max(ma1[j], i)\r\n else:\r\n mi2[j], ma2[j] = min(mi2[j], i), max(ma2[j], i)\r\na, b = inf, inf\r\nfor i, j in zip(mi1, mi2):\r\n if i < j:\r\n a = min(a, i)\r\nfor i, j in zip(ma1, ma2):\r\n if i < j:\r\n b = min(b, 8 - j - 1)\r\nans = \"A\" if a <= b else \"B\"\r\nprint(ans)", "R=range\r\nm=['' for i in R(8)]\r\nfor _ in R(8):\r\n v=input()\r\n for j in R(8):m[j]+=v[j]\r\na=b=9\r\nfor s in m:\r\n x=[s[::-1].find('B'),s[::-1].find('W'),s.find('W'),s.find('B')]\r\n for i in 0,1,2,3:x[i]=[x[i],9][x[i]<0]\r\n if x[0]<x[1]:b=min(b,x[0])\r\n if x[2]<x[3]:a=min(a,x[2])\r\nprint('AB'[b<a])", "index_B = list()\r\nindex_A = list()\r\nfor col in list(zip(*[list(input()) for i in range(8)])):\r\n step = 0\r\n for k in col:\r\n if k == 'W':\r\n index_A.append(step)\r\n break\r\n if k == 'B':\r\n break\r\n step += 1\r\n step = 0\r\n for k in col[::-1]:\r\n if k == 'B':\r\n index_B.append(step)\r\n break\r\n if k == 'W':\r\n break\r\n step += 1\r\nprint('A' if min(index_A or [8]) <= min(index_B or [8]) else 'B')\r\n", "\nboard = []\nfor i in range(8):\n board.append(input().strip())\n\n# r, c system\nR = 8\nC = 8\nN = 8\n\ndef yieldColumns(board):\n for i in range(8):\n A = []\n for j in range(8):\n A.append(board[j][i])\n yield A\n\ndef countDict(A):\n d = {}\n d['W'] = 0\n d['B'] = 0\n for l in A:\n if l not in d:\n d[l] = 0\n d[l] += 1\n return d\n\ndef whiteWinIn(c):\n isW = False\n count = 0\n for i in range(len(c)):\n j = 7-i\n if c[j] == 'W':\n isW = True\n count = 0\n if c[j] == 'B':\n isW = False\n\n if isW and i == 7:\n return count\n count += 1\n return -1\n\ndef blackWinIn(c):\n isW = False\n count = 0\n for i in range(len(c)):\n j = i\n if c[j] == 'B':\n isW = True\n count = 0\n if c[j] == 'W':\n isW = False\n\n if isW and i == 7:\n return count\n count += 1\n return -1\n\ndef solve(board):\n wWin = 1e10\n bWin = 1e10\n for c in yieldColumns(board):\n\n w = whiteWinIn(c)\n if w != -1:\n wWin = min(w, wWin)\n b = blackWinIn(c)\n if b != -1:\n bWin = min(b, bWin)\n\n if wWin <= bWin:\n return 'A'\n else:\n return 'B'\n\nprint(solve(board))\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/592/A\n\nl_w = [9] * 8\nl_b = [9] * 8\n\nfor y in range(8):\n i = 0\n for c in input():\n if c == \"W\":\n if l_b[i] == 9 and l_w[i] == 9:\n l_w[i] = y\n l_b[i] = 10\n elif c == \"B\":\n l_b[i] = 7 - y\n i += 1\n\nmin_w = min(l_w)\nmin_b = min(l_b)\n\nif min_w > min_b:\n print(\"B\")\nelse:\n print(\"A\")", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#for tt in range(INT()):\r\n\r\ng = []\r\nfor i in range(8):\r\n s = STR()\r\n g.append(s)\r\n\r\nr1 = []\r\nr2 = []\r\nfor i in range(len(g)):\r\n for j in range(len(g)):\r\n f = True\r\n if g[i][j] == 'W':\r\n for k in range(0,i):\r\n if g[k][j] == 'B':\r\n f = False\r\n break\r\n if f :\r\n x = i - 0\r\n r1.append(x)\r\n\r\n elif g[i][j] == 'B':\r\n for k in range(i+1 , 8):\r\n if g[k][j] == 'W':\r\n f = False\r\n break\r\n if f :\r\n x = 7 - i\r\n r2.append(x)\r\n\r\nr1.sort()\r\nr2.sort()\r\n#print(r1)\r\n#print(r2)\r\nif len(r1)==0:\r\n print('B')\r\n exit(0)\r\nif len(r2)==0:\r\n print('A')\r\n exit(0)\r\n\r\nif r1[0]<=r2[0]:\r\n print('A')\r\nelse:\r\n print('B')\r\n", "a=[]\r\nfor i in range(8):\r\n\ta.append(input())\r\n\r\nA=[]\r\nB=[]\r\n\r\nfor i in range(8):\r\n\tfor j in range(8):\r\n\t\tif a[i][j]=='B': B.append([i, j])\r\n\t\telif a[i][j]=='W': A.append([i, j])\r\n\r\na1=set()\r\nb1=set()\r\nfor i in A:\r\n\tfl=True\r\n\tfor j in B:\r\n\t\tif i[1]==j[1] and i[0]>j[0]:\r\n\t\t\tfl=False\r\n\t\t\tbreak\r\n\tif fl: a1.add(i[0])\r\n\r\nfor i in B:\r\n\tfl=True\r\n\tfor j in A:\r\n\t\tif i[1]==j[1] and i[0]<j[0]:\r\n\t\t\tfl=False\r\n\t\t\tbreak\r\n\tif fl: b1.add(7-i[0])\r\n\r\nif min(a1|b1) in a1: print('A')\r\nelse :print ('B')", "g, v = [input() for i in range(8)], [8, 8]\r\nfor i in range(8):\r\n for j in range(8):\r\n if g[i][j] == 'W' and all(g[k][j] == '.' for k in range(i)):\r\n v[0] = min(v[0], i)\r\n elif g[i][j] == 'B' and all(g[k][j] == '.' for k in range(i + 1, 8)):\r\n v[1] = min(v[1], 7 - i)\r\nprint('A' if v[0] <= v[1] else 'B')", "field = [input() for i in range(8)]\nfield = [[field[y][x] for y in range(8)] for x in range(8)]\n\nwa = float('+inf')\nwb = float('+inf')\n\n\nfor row in field:\n row = ''.join(row)\n if 'W' in row:\n if ('B' in row) and row.index('W') > row.index('B'):\n pass\n else:\n nwa = row.index('W')\n wa = min(wa, nwa)\n if 'B' in row:\n if ('W' in row) and row.rindex('W') > row.rindex('B'):\n pass\n else:\n nwb = 7 - row.rindex('B')\n wb = min(wb, nwb)\n\n\nif wa <= wb:\n print('A')\nelse:\n print('B')\n", "a=['','','','','','','','']\r\nfor i in range(8):\r\n s=input()\r\n r=0\r\n for j in s:\r\n a[r]+=j\r\n r+=1\r\nAkmin,Bkmin=100,100\r\nfor i in a:\r\n Ak,Bk=0,200\r\n for j in i:\r\n if j=='B':\r\n Bk=0\r\n Ak=200\r\n if j=='W':\r\n Bk=200\r\n if Ak<Akmin:\r\n Akmin=Ak\r\n if j=='.':\r\n Ak+=1\r\n Bk+=1 \r\n if Bk<Bkmin:\r\n Bkmin=Bk\r\nif Akmin<=Bkmin:\r\n print('A')\r\nelse:\r\n print('B')", "#!/usr/bin/env python3\n\nif __name__ == '__main__':\n grid = [list(input()) for _ in range(8)]\n\n has_black = set()\n min_white = 999\n for i in range(8):\n for j in range(8):\n if grid[i][j] == 'W':\n if j not in has_black:\n min_white = min(min_white, i)\n elif grid[i][j] == 'B':\n has_black.add(j)\n\n has_white = set()\n min_black = 999\n for i in reversed(range(8)):\n for j in range(8):\n if grid[i][j] == 'W':\n has_white.add(j)\n elif grid[i][j] == 'B':\n if j not in has_white:\n min_black = min(min_black, 8-i-1)\n\n if min_white <= min_black:\n print('A')\n else:\n print('B')\n", "a=[[] for i in range(8)]\r\ncolw=[]\r\ncolb=[]\r\nfor i in range(8):\r\n a[i]=input()\r\n for v in range(8):\r\n if a[i][v]=='W':\r\n colw.append([i,v])\r\n elif a[i][v]=='B':\r\n colb.append([i,v])\r\nw=0\r\nminw=8\r\nfor i in range(len(colw)):\r\n for v in range(colw[i][0]):\r\n if a[v][colw[i][1]]!='B':\r\n w+=1\r\n else:\r\n w=0\r\n break\r\n if w>0 and w<minw:\r\n minw=w\r\n w=0\r\nb=0\r\nminb=8\r\nfor i in range(len(colb)):\r\n for v in range(7,colb[i][0],-1):\r\n if a[v][colb[i][1]]!='W':\r\n b+=1\r\n else:\r\n b=0\r\n break\r\n if b>0 and b<minb:\r\n minb=b\r\n b=0\r\nif minb<minw:\r\n print('B')\r\nelse:\r\n print('A')", "def main():\n ww, bb = [8], [8]\n for col in zip(*[input() for _ in range(8)]):\n _wb = ([8], [8], [])\n for i, c in enumerate(col):\n _wb[\"WB.\".find(c)].append(i)\n _w, _b, _ = _wb\n w, b = min(_w), min(_b)\n if w < b:\n ww.append(w)\n _w[0] = _b[0] = -1\n w, b = max(_w), max(_b)\n if w < b:\n bb.append(7 - b)\n print(\"AB\"[min(ww) > min(bb)])\n\n\nif __name__ == '__main__':\n main()\n", "our = [input() for i in range(8)]\nresA = 100\nresB = 100\nfor i in range(8):\n for j in range(8):\n if our[i][j] == 'W':\n curr = i\n while curr > 0 and our[curr - 1][j] == '.':\n curr -= 1\n if curr == 0:\n resA= min(resA, i)\n elif our[i][j] == 'B':\n curr = i\n while curr < 7 and our[curr + 1][j] == '.':\n curr += 1\n if curr == 7:\n resB = min(resB, curr - i)\nif resA <= resB:\n print('A')\nelse:\n print('B')" ]

[ "t, l, r = map(int, input().split())\r\nx = [False] * 5000001\r\nk = [0] * 5000001\r\nb = [0] * 5000001\r\nN = 0\r\nres = 0\r\nfor i in range(2, r + 1):\r\n if not x[i]:\r\n b[N] = i\r\n N += 1\r\n b[i] = i\r\n j = 0\r\n while j < N and i * b[j] <= r:\r\n x[i * b[j]] = True\r\n b[i * b[j]] = b[j]\r\n if i % b[j] == 0:\r\n break\r\n j += 1\r\n k[i] = i * (b[i] - 1) // 2 + k[i // b[i]]\r\nfor i in range(r, l - 1, -1):\r\n res = (res * t + k[i]) % 1000000007\r\nprint(res)# 1691535550.084508" ]

[ "from sys import stdin\n\n\n# main starts\nn = int(stdin.readline().strip())\nif n% 2 == 0:\n\tprint(\"white\")\n\tprint(1, 2)\nelse:\n\tprint(\"black\")", "a=int(input())\nif a%2==0:\n print('white')\n print('1 2')\nelse:\n print('black')\n\t \t\t \t\t \t\t \t\t\t\t\t\t\t \t\t\t \t\t\t\t \t", "print([\"white\\n1 2\", \"black\"][int(input())%2])", "if int(input())&1 :\r\n print('black')\r\nelse :\r\n print('white\\n1 2')", "if int(input())%2==0:\r\n print(\"white\\n1 2\")\r\nelse:\r\n print(\"black\")", "'''\r\nCreated on ٠٥‏/١٢‏/٢٠١٤\r\n\r\n@author: mohamed265\r\n''' \r\nprint(\"black\") if int(input()) % 2 == 1 else print(\"white\\n1 2\")", "n = int(input())\r\nif n % 2 == 0 : print(\"white\");print(\"1 2\")\r\nelse:print(\"black\")\r\n", "print( \"white\\n1 2\" if int(input())%2==0 else \"black\" )\n", "n=int(input());\r\nif(n%2==1):\r\n print(\"black\");\r\nelse:\r\n print(\"white\\n1 2\");", "i = int(input())\r\n\r\nif i % 2 == 1:\r\n print(\"black\")\r\nelse:\r\n print(\"white\")\r\n print(\"1 2\")", "import sys\r\nimport math as mt\r\ninput=sys.stdin.buffer.readline \r\nt=1\r\nfor __ in range(t):\r\n n=int(input())\r\n if(n%2!=0):\r\n print('black')\r\n else:\r\n print('white')\r\n print(1,2)", "import sys\r\ninput=sys.stdin.buffer.readline\r\nimport os\r\n\r\nn=int(input())\r\nif n%2==0:\r\n\tprint(\"white\")\r\n\tprint(\"1 2\")\r\nelse:\r\n\tprint(\"black\")", "# Wadea #\r\n\r\nn = int(input())\r\nif n % 2 == 0:print(\"white\");print(1,2)\r\nelse:print(\"black\")", "n=int(input());\r\nif n%2==1: print(\"black\");\r\nelse: print(\"white\\n1 2\");", "from sys import stdin\r\ninp = stdin.readline\r\n\r\nn = int(inp())\r\n\r\nif n % 2:\r\n print(\"black\")\r\nelse:\r\n print(\"white\")\r\n print(\"1 2\")\r\n\r\n", "N = int(input())\n\nif N%2 == 0:\n print(\"white\")\n print(1, 2)\nelse:\n print(\"black\")\n\t \t \t \t\t\t \t \t\t \t\t\t", "print(\"black\" if int(input())%2 else \"white\\n1 2\")", "print(\"black\") if int(input())%2 == 1 else print(\"white\\n1 2\")", "import sys\r\nimport os\r\n# import numpy as np\r\nfrom math import sqrt, gcd, ceil, log, floor, sin, pi\r\nfrom math import factorial as fact\r\nfrom bisect import bisect, bisect_left\r\nfrom collections import defaultdict, Counter, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom itertools import permutations\r\ninput = sys.stdin.readline\r\ndef read(): return list(map(int, input().strip().split()))\r\ndef read_f(): return list(map(float, input().strip().split()))\r\n# read_f = lambda file: list(map(int, file.readline().strip().split()))\r\n# from time import time\r\n# sys.setrecursionlimit(5*10**6)\r\n\r\n\r\nMOD = 10**9 + 7\r\n\r\n\r\ndef build(arr):\r\n n = len(arr)\r\n tree = [[0,0]for i in range(2*n - 1)]\r\n for i in range(n):\r\n tree[n+i-1][0] = arr[i]\r\n for i in range(n-2, -1, -1):\r\n x = tree[i*2+1][1]\r\n if x:\r\n tree[i][0] = tree[i*2+1][0] ^ tree[i*2+2][0]\r\n tree[i][1] = 0\r\n else:\r\n tree[i][0] = tree[i*2+1][0] | tree[i*2+2][0]\r\n tree[i][1] = 1\r\n return(tree)\r\n\r\ndef update(tree, ind, val, n):\r\n ind = n+ind-1\r\n tree[ind][0] = val\r\n \r\n while ind > 0:\r\n par = (ind-1)>>1\r\n x = tree[(par<<1) + 1][1]\r\n if x:\r\n tree[par][0] = tree[(par<<1) + 1][0] ^ tree[(par<<1) + 2][0]\r\n else:\r\n tree[par][0] = tree[(par<<1) + 1][0] | tree[(par<<1) + 2][0]\r\n ind = (ind-1)>>1 \r\n\r\ndef main():\r\n # file1 = open(\"C:\\\\Users\\\\shank\\\\Desktop\\\\Comp_Code\\\\input.txt\", \"r\")\r\n # n = int(file1.readline().strip());\r\n # par = list(map(int, file1.read().strip().split(\" \")))\r\n # file1.close()\r\n # ans_ = []\r\n n = int(input())\r\n if n%2:\r\n print(\"black\")\r\n else:\r\n print(\"white\\n1 2\")\r\n \r\n # for i in ans_:print(i)\r\n # file = open(\"output.txt\", \"w\")\r\n # file.write(ans+\"\\n\")\r\n # file.close()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n", "#/usr/bin/env python3\r\nimport sys\r\nn = int(sys.stdin.readline())\r\nif n % 2 == 1:\r\n print('black')\r\nelse:\r\n print('white')\r\n print('1 2')", "print('black' if input()[-1] in '13579' else 'white\\n1 2')", "def main():\r\n\timport sys\r\n\tinput = sys.stdin.readline\r\n\t\r\n\tn = int(input())\r\n\tif n & 1:\r\n\t\tprint(\"black\")\r\n\telse:\r\n\t\tprint(\"white\")\r\n\t\tprint(1, 2)\r\n\t\r\n\treturn 0\r\n\r\nmain()\r\n", "n = int(input())\r\nprint('white\\n1 2' if n & 1 == 0 else 'black')", "n = int(input())\nif n % 2:\n\tprint(\"black\")\nelse:\n\tprint(\"white\")\n\tprint(\"1 2\")", "def main():\n n = int(input()) & 1\n print(('white', 'black')[n])\n if not n:\n print(1, 2)\n\n\nmain()\n", "from sys import stdin\r\n# input=stdin.buffer.readline\r\ninput=lambda : stdin.readline().strip()\r\nlin=lambda :list(map(int,input().split()))\r\niin=lambda :int(input())\r\nmain=lambda :map(int,input().split())\r\nfrom math import ceil,sqrt,factorial,log\r\nfrom collections import deque\r\nfrom bisect import bisect_left\r\nmod=998244353\r\nmod=1000000007\r\ndef gcd(a,b):\r\n\ta,b=max(a,b),min(a,b)\r\n\twhile a%b!=0:\r\n\t\ta,b=b,a%b\r\n\treturn b\r\ndef moduloinverse(a):\r\n\treturn(pow(a,mod-2,mod))\r\ndef solve(we):\r\n\tn=iin()\r\n\tif n%2==0:\r\n\t\tprint(\"white\")\r\n\t\tprint(1,2)\r\n\telse:\r\n\t\tprint(\"black\")\r\n\r\nqwe=1\r\n# qwe=iin()\r\nfor _ in range(qwe):\r\n\tsolve(_+1)", "n = int( input() )\r\nif n % 2:\r\n\tprint ( \"black\" )\r\nelse:\r\n\tprint ( \"white\\n1 2\" )", "n=int(input())\nif n%2==1:\n\tprint('black')\nelse:\n\tprint('white')\n\tprint(1,2)\n\t\t\t \t \t\t\t \t \t \t \t\t\t \t", "from sys import stdin,stdout\r\n\r\nI = stdin.readline\r\nP = stdout.write\r\n\r\nn = int(I())\r\nif(n%2 == 0):\r\n P(\"white\\n\")\r\n if(n == 2):\r\n P(\"1 2\")\r\n else:\r\n P(\"1 2\")\r\nelse:\r\n P(\"black\\n\")\r\n ", "#!/usr/bin/env python3\n# created : 2020. 12. 31. 23:59\n\nimport os\nfrom sys import stdin, stdout\n\n\ndef solve(tc):\n n = int(stdin.readline().strip())\n if n%2:\n print(\"black\")\n else:\n print(\"white\")\n print(\"1 2\")\n\n\ntcs = 1\ntc = 1\nwhile tc <= tcs:\n solve(tc)\n tc += 1\n", "print(\"black\"if int(input())%2else \"white\\n1 2\")", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport functools\r\nimport itertools\r\nfrom collections import deque, OrderedDict\r\nsys.setrecursionlimit(1000000)\r\n\r\n\r\ndef I():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef F():\r\n return float(sys.stdin.readline())\r\n\r\n\r\ndef InI():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef InF():\r\n return map(float, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef NInit(n, num=-1, init=0):\r\n return [init for i in range(n)] if num == -1 else [[init] * num for i in range(n)]\r\n\r\n\r\nn = I()\r\nif n & 1:\r\n print(\"black\")\r\nelse:\r\n print(\"white\\n1 2\")\r\n", "__author__ = 'zhan'\n\nprint(\"black\" if int(input())&1 else \"white\\n1 2\")", "print ('white\\n 1 2' if int(input())%2==0 else 'black')", "if int(input()) % 2:\r\n print(\"black\")\r\nelse:\r\n print(\"white\")\r\n print(1, 2)\r\n", "import sys\r\n#sys.setrecursionlimit(10**7)\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Vasya_and_Chess():\r\n n = inp()\r\n\r\n if n % 2 == 0:\r\n print(\"white\")\r\n print(str(1) + ' ' + str(2))\r\n else:\r\n print(\"black\")\r\n\r\n\r\nVasya_and_Chess()", "#!/usr/bin/pypy3\n\nfrom sys import stdin,stderr\n\ndef readInts(): return map(int,stdin.readline().strip().split())\ndef print_err(*args,**kwargs): print(*args,file=stderr,**kwargs)\n \ndef solve(vs):\n return None\n\ndef run():\n n, = readInts()\n if n%2==0:\n print(\"white\")\n print(\"1 2\")\n else:\n print(\"black\")\n \nrun()\n", "n = int(input())\r\nprint('black' if n % 2 else 'white\\n1 2')\r\n", "n = int (input()) ; print(\"black\" if n&1 else \"white\\n1 2 \")\r\n", "from math import ceil, log, floor, sqrt\nimport math\t\n\t\n\t\nk = 1\t\ndef mod_expo(n, p, m):\n\t\"\"\"find (n^p)%m\"\"\"\n\tresult = 1\n\twhile p != 0:\n\t\tif p%2 == 1:\n\t\t\tresult = (result * n)%m\n\t\tp //= 2\n\t\tn = (n * n)%m\n\treturn result\n\t\ndef min_subs(n, binary):\n\ta, b = 1, 1\n\tmx = 0\n\tprev = not int(binary[0])\n\tres = [0] * n\n\tfor i in range(n):\n\t\tif int(binary[i]) == 1:\n\t\t\t#b = 1\n\t\t\tif int(binary[i]) == prev:\n\t\t\t\ta += 1\n\t\t\t\tb = a\n\t\t\tres[i] = a\n\t\telse:\n\t\t\t#a = 1\n\t\t\tif int(binary[i]) == prev:\n\t\t\t\tb += 1\n\t\t\t\ta = b\n\t\t\tres[i] = b\t\n\t\t\t\n\t\t\t\n\t\tprev = int(binary[i])\n\t\t\n\t\tmx = max(mx, max(a, b))\n\tprint(mx)\n\tprint(*res, sep=' ')\n\t#return 1 + (n- las)\n\ndef steps(n):\n\treturn n//2 + 1\n\t\n\t\ndef find_winner(n):\n\tif n%2:\n\t\tprint(\"black\")\n\telse:\n\t\tprint(\"white\")\n\t\tprint(\"1 2\")\n\t\ndef can_palindrome(r, g, b, w):\n\tno = 0\n\tmn = pow(10, 9) + 1\n\tmn = min(mn, r)\n\tmn = min(mn, g)\n\tmn = min(mn, b)\n\tif r%2 == 1:\n\t\tno += 1\n\tif g%2 == 1:\n\t\tno += 1\n\tif b%2 == 1:\n\t\tno += 1\n\tif w%2 == 1:\n\t\tno += 1\n\tif no <= 1:\n\t\treturn True\n\tif no == 3 and mn > 0:\n\t\treturn True\n\treturn False\ndef max_find(n, k, z, a):\n\tres = 0\n\ts = 0\n\tmx = 0\n\tfor t in range(z+1):\n\t\tpos = k -2*t\n\t\tif pos < 0:\n\t\t\tcontinue\n\t\tmx = 0\n\t\ts = 0\n\t\tfor i in range(pos + 1):\n\t\t\tif i < n-1:\n\t\t\t\tmx = max(mx, a[i] + a[i+1])\n\t\t\ts += a[i]\n\t\tres = max(res, s + mx*t)\n\treturn res\n\t\n\t\nt = 1\n#t = int(input())\nwhile t:\n\tt = t - 1\n\tn = int(input())\n\t#r, g, b, w = map(int, input().split())\n\t#a = input()\n\t#arr = list(map(int, input().split()))\n\t#mx = max(arr)\n\t#res = ['a' * (mx + 1)] * (n+1)\n\t#for i, x in enumerate(arr):\n\t#\twho = 'a' if res[i][x] == 'b' else 'b'\n\t#\tres[i+1] = res[i][:x] + who + res[i][x + 1:]\n\t#a = list(map(int, input().strip().split()))[:n]\n\t#if can_palindrome(r, g, b, w):\n\t#\tprint(\"YES\")\n\t#else:\n\t#\tprint(\"NO\")\n\t#n = int(n)\n\t#for i, x in enumerate(arr):\n # who = 'a' if res[i][x] == 'b' else 'b'\n # res[i + 1] = res[i][:x] + who + res[i][x + 1:]\n\t#print('\\n'.join(res))\n\tfind_winner(n)\n\t\n", "n = int(input())\r\nprint(\"black\" if (n % 2 == 1) else \"white\\n1 2\")", "import sys\nn=int(sys.stdin.readline().strip())\nif n %2==0:\n print(\"white\")\n print(\"1 2\")\nelse:\n print(\"black\")\n \t \t\t \t\t\t \t\t\t\t\t \t\t\t \t \t\t", "s = int(input())\r\nif s % 2 == 0 :\r\n print('white')\r\n print(*(1,2))\r\nelse:\r\n print('black')", "import sys\r\nn=int(sys.stdin.readline().strip())\r\nif n %2==0:\r\n print(\"white\")\r\n print(\"1 2\")\r\nelse:\r\n print(\"black\")", "a = int(input())\r\n\r\nif a%2==0:\r\n print(\"white\")\r\n print(\"1 2\")\r\nelse:\r\n print(\"black\")", "n =int (input())\r\nif n%2==0:\r\n print (\"white\\n1 2\")\r\nelse:\r\n print(\"black\")", "if int(input()) % 2 == 0:\r\n print('white 1 2')\r\nelse:\r\n print('black')", "x = int(input())\n\nif x%2:\n print('black')\nelse:\n print('white')\n print(1, 2)\n\n\t\t\t\t \t \t\t\t \t\t\t\t\t \t\t \t\t\t\t", "n = int(input())\r\nif (n % 2 == 1):\r\n\tprint(\"black\")\r\nelse:\r\n\tprint(\"white\\n1 2\")", "def main():\r\n n = int(input().strip()) # Use input() instead of raw_input() and convert the result to an integer\r\n if n % 2 == 0:\r\n print(\"white\")\r\n print(\"1 2\")\r\n else:\r\n print(\"black\")\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\nprint( \"white\\n1 2\" if n%2==0 else \"black\" )\n", "print('black' if int(input()) % 2 == 1 else 'white\\n1 2')\r\n", "space_numbers = int(input())\n\nif (space_numbers % 2 != 0):\n print(\"black\")\nelse:\n print(\"white\")\n print(\"{} {}\".format(1, 2))\n\n \t\t\t\t \t\t \t \t\t\t \t \t \t \t", "n=int(input())\nprint(\"white\\n1 2\" if (n % 2==0) else \"black\");\n", "print(\"white\\n1 2\" if int(input()) % 2 == 0 else \"black\")", "print('black' if (int(input()) % 2 == 1) else 'white\\n1 2')", "# LUOGU_RID: 132709979\n# pypy3\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nimport sys\r\n\r\nfrom math import gcd\r\n\r\nIN = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nPN = lambda x: sys.stdout.write(x)\r\nI = lambda: int(IN())\r\nS = lambda: IN().split()\r\nM = lambda: map(int, IN().split())\r\nL = lambda: list(map(int, IN().split()))\r\nG = lambda: map(lambda x: int(x) - 1, IN().split())\r\n\r\nn = I()\r\n\r\nif n % 2 == 1:\r\n print(\"black\")\r\nelse:\r\n print(\"white\")\r\n print(1, 2)", "if int(input())%2==0:\r\n print(\"white\")\r\n print(1,2)\r\nelse:\r\n print(\"black\")\r\n", "def main():\r\n n = int(input())\r\n if n%2 == 0:\r\n print('white')\r\n print(1,2)\r\n else:\r\n print('black')\r\n\r\nmain()\r\n", "import sys\r\nimport os.path\r\n \r\nif(os.path.exists('input.txt')) :\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n sys.stderr = open(\"error.txt\", \"w\")\r\n \r\ndepth = 1000000\r\nmod = 1000000007 \r\nlim = mod * mod\r\nsys.setrecursionlimit(depth) \r\n \r\nlinp = lambda: list(minp())\r\nminp = lambda: map(int, input().split())\r\n \r\nfrom math import inf, ceil, sqrt, log2, gcd\r\nfrom collections import defaultdict, deque\r\n \r\ndxy = [(1, 0),(-1, 0),(0, 1),(0, -1)]\r\n\r\nn = int(input())\r\nif (n&1) : print(\"black\")\r\nelse : print(\"white\"), print(\"1 2\")\r\n" ]

[ "from sys import *\r\nfrom math import *\r\n\r\nmod = 1000000000\r\nf = [0 for i in range(200)]\r\nf[0] = f[1] = 1\r\nfor i in range(2, 200):\r\n f[i] = f[i - 1] + f[i - 2]\r\nn, m = stdin.readline().split()\r\nn = int(n)\r\nm = int(m)\r\na = list(map(int, stdin.readline().split()))\r\nfor i in range(m):\r\n tp, x, y = stdin.readline().split()\r\n tp = int(tp)\r\n x = int(x)\r\n y = int(y)\r\n if tp == 1:\r\n x -= 1\r\n a[x] = y\r\n else:\r\n s = 0\r\n x -= 1\r\n y -= 1\r\n for p in range(y - x + 1):\r\n s += f[p] * a[x + p]\r\n print(s % mod)", "n,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nf = [1]*n\r\nfor i in range(2,n):\r\n f[i] = f[i-1]+f[i-2]\r\nfor i in range(m):\r\n t,l,r = map(int, input().split())\r\n if t==1:\r\n a[l-1] = r\r\n else:\r\n sum_lr = 0\r\n for x in range(r-l+1):\r\n sum_lr += f[x] * a[l+x-1]\r\n print(sum_lr%1000000000)\r\n", "import sys\r\nreadline=sys.stdin.readline\r\nimport math\r\n\r\ndef Extended_Euclid(n,m):\r\n stack=[]\r\n while m:\r\n stack.append((n,m))\r\n n,m=m,n%m\r\n if n>=0:\r\n x,y=1,0\r\n else:\r\n x,y=-1,0\r\n for i in range(len(stack)-1,-1,-1):\r\n n,m=stack[i]\r\n x,y=y,x-(n//m)*y\r\n return x,y\r\n\r\nclass MOD:\r\n def __init__(self,p,e=None):\r\n self.p=p\r\n self.e=e\r\n if self.e==None:\r\n self.mod=self.p\r\n else:\r\n self.mod=self.p**self.e\r\n\r\n def Pow(self,a,n):\r\n a%=self.mod\r\n if n>=0:\r\n return pow(a,n,self.mod)\r\n else:\r\n assert math.gcd(a,self.mod)==1\r\n x=Extended_Euclid(a,self.mod)[0]\r\n return pow(x,-n,self.mod)\r\n\r\n def Build_Fact(self,N):\r\n assert N>=0\r\n self.factorial=[1]\r\n if self.e==None:\r\n for i in range(1,N+1):\r\n self.factorial.append(self.factorial[-1]*i%self.mod)\r\n else:\r\n self.cnt=[0]*(N+1)\r\n for i in range(1,N+1):\r\n self.cnt[i]=self.cnt[i-1]\r\n ii=i\r\n while ii%self.p==0:\r\n ii//=self.p\r\n self.cnt[i]+=1\r\n self.factorial.append(self.factorial[-1]*ii%self.mod)\r\n self.factorial_inve=[None]*(N+1)\r\n self.factorial_inve[-1]=self.Pow(self.factorial[-1],-1)\r\n for i in range(N-1,-1,-1):\r\n ii=i+1\r\n while ii%self.p==0:\r\n ii//=self.p\r\n self.factorial_inve[i]=(self.factorial_inve[i+1]*ii)%self.mod\r\n\r\n def Fact(self,N):\r\n if N<0:\r\n return 0\r\n retu=self.factorial[N]\r\n if self.e!=None and self.cnt[N]:\r\n retu*=pow(self.p,self.cnt[N],self.mod)%self.mod\r\n retu%=self.mod\r\n return retu\r\n\r\n def Fact_Inve(self,N):\r\n if self.e!=None and self.cnt[N]:\r\n return None\r\n return self.factorial_inve[N]\r\n\r\n def Comb(self,N,K,divisible_count=False):\r\n if K<0 or K>N:\r\n return 0\r\n retu=self.factorial[N]*self.factorial_inve[K]%self.mod*self.factorial_inve[N-K]%self.mod\r\n if self.e!=None:\r\n cnt=self.cnt[N]-self.cnt[N-K]-self.cnt[K]\r\n if divisible_count:\r\n return retu,cnt\r\n else:\r\n retu*=pow(self.p,cnt,self.mod)\r\n retu%=self.mod\r\n return retu\r\n\r\nclass Matrix:\r\n def __init__(self,H=0,W=0,matrix=False,eps=0,mod=0,identity=0):\r\n if identity:\r\n if H:\r\n self.H=H\r\n self.W=H\r\n else:\r\n self.H=W\r\n self.W=W\r\n self.matrix=[[0]*self.W for i in range(self.H)]\r\n for i in range(self.H):\r\n self.matrix[i][i]=identity\r\n elif matrix:\r\n self.matrix=matrix\r\n self.H=len(self.matrix)\r\n self.W=len(self.matrix[0]) if self.matrix else 0\r\n else:\r\n self.H=H\r\n self.W=W\r\n self.matrix=[[0]*self.W for i in range(self.H)]\r\n self.mod=mod\r\n self.eps=eps\r\n\r\n def __eq__(self,other):\r\n if type(other)!=Matrix:\r\n return False\r\n if self.H!=other.H:\r\n return False\r\n if self.mod:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.matrix[i][j]%self.mod!=other.matrix[i][j]%self.mod:\r\n return False\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.eps<abs(self.matrix[i][j]-other.matrix[i][j]):\r\n return False\r\n return True\r\n\r\n def __ne__(self,other):\r\n if type(other)!=Matrix:\r\n return True\r\n if self.H!=other.H:\r\n return True\r\n if self.mod:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.matrix[i][j]%self.mod!=other.matrix[i][j]%self.mod:\r\n return True\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.eps<abs(self.matrix[i][j]-other.matrix[i][j]):\r\n return True\r\n return False\r\n\r\n def __add__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n if self.mod:\r\n summ=Matrix(matrix=[[(self.matrix[i][j]+other.matrix[i][j])%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n summ=Matrix(matrix=[[self.matrix[i][j]+other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n if self.mod:\r\n summ=Matrix(matrix=[[(self.matrix[i][j]+other)%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n summ=Matrix(matrix=[[self.matrix[i][j]+other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return summ\r\n\r\n def __sub__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n if self.mod:\r\n diff=Matrix(matrix=[[(self.matrix[i][j]-other.matrix[i][j])%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n diff=Matrix(matrix=[[self.matrix[i][j]-other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n if self.mod:\r\n diff=Matrix(matrix=[[(self.matrix[i][j]-other)%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n diff=Matrix(matrix=[[self.matrix[i][j]-other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return diff\r\n\r\n def __mul__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n if self.mod:\r\n prod=Matrix(matrix=[[(self.matrix[i][j]*other.matrix[i][j])%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n prod=Matrix(matrix=[[self.matrix[i][j]*other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n if self.mod:\r\n prod=Matrix(matrix=[[(self.matrix[i][j]*other)%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n prod=Matrix(matrix=[[self.matrix[i][j]*other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return prod\r\n\r\n def __matmul__(self,other):\r\n if type(other)==Matrix:\r\n assert self.W==other.H\r\n prod=Matrix(H=self.H,W=other.W,eps=self.eps,mod=self.mod)\r\n for i in range(self.H):\r\n for j in range(other.W):\r\n for k in range(self.W):\r\n prod.matrix[i][j]+=self.matrix[i][k]*other.matrix[k][j]\r\n if self.mod:\r\n prod.matrix[i][j]%=self.mod\r\n elif type(other)==int:\r\n assert self.H==self.W\r\n if other==0:\r\n prod=Matrix(H=self.H,eps=self.eps,mod=self.mod,identity=1)\r\n elif other==1:\r\n prod=Matrix(matrix=[[self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n prod=Matrix(H=self.H,eps=self.eps,mod=self.mod,identity=1)\r\n doub=Matrix(matrix=[[self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n while other>=2:\r\n if other&1:\r\n prod@=doub\r\n doub@=doub\r\n other>>=1\r\n prod@=doub\r\n return prod\r\n\r\n def __truediv__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n if self.mod:\r\n quot=Matrix(matrix=[[(self.matrix[i][j]*MOD(self.mod).Pow(other.matrix[i][j],-1))%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n quot=Matrix(matrix=[[self.matrix[i][j]/other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n if self.mod:\r\n inve=MOD(self.mod).Pow(other,-1)\r\n quot=Matrix(matrix=[[(self.matrix[i][j]*inve)%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n quot=Matrix(matrix=[[self.matrix[i][j]/other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return quot\r\n\r\n def __floordiv__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n quot=Matrix(matrix=[[self.matrix[i][j]//other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n quot=Matrix(matrix=[[self.matrix[i][j]//other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return quot\r\n\r\n def __mod__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n rema=Matrix(matrix=[[self.matrix[i][j]%other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n rema=Matrix(matrix=[[self.matrix[i][j]%other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return rema\r\n\r\n def __pow__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n if self.mod:\r\n powe=Matrix(matrix=[[pow(self.matrix[i][j],other.matrix[i][j],self.mod) for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n powe=Matrix(matrix=[[pow(self.matrix[i][j],other.matrix[i][j]) for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n if self.mod:\r\n powe=Matrix(matrix=[[pow(self.matrix[i][j],other,self.mod) for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n powe=Matrix(matrix=[[pow(self.matrix[i][j],other) for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return powe\r\n\r\n def __lshift__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n lshi=Matrix(matrix=[[self.matrix[i][j]<<other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n lshi=Matrix(matrix=[[self.matrix[i][j]<<other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return lshi\r\n\r\n def __rshift__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n rshi=Matrix(matrix=[[self.matrix[i][j]>>other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n rshi=Matrix(matrix=[[self.matrix[i][j]>>other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return rshi\r\n\r\n def __and__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n conj=Matrix(matrix=[[self.matrix[i][j]&other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n conj=Matrix(matrix=[[self.matrix[i][j]&other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return conj\r\n\r\n def __or__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n disj=Matrix(matrix=[[self.matrix[i][j]|other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n disj=Matrix(matrix=[[self.matrix[i][j]|other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return disj\r\n\r\n def __xor__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n excl=Matrix(matrix=[[self.matrix[i][j]^other.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n excl=Matrix(matrix=[[self.matrix[i][j]^other for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return excl\r\n\r\n def __iadd__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]+=other.matrix[i][j]\r\n if self.mod:\r\n self.matrix[i][j]%=self.mod\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]+=other\r\n if self.mod:\r\n self.matrix[i][j]%=self.mod\r\n return self\r\n\r\n def __isub__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]-=other.matrix[i][j]\r\n if self.mod:\r\n self.matrix[i][j]%=self.mod\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]-=other\r\n if self.mod:\r\n self.matrix[i][j]%=self.mod\r\n return self\r\n\r\n def __imul__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]*=other.matrix[i][j]\r\n if self.mod:\r\n self.matrix[i][j]%=self.mod\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]*=other\r\n if self.mod:\r\n self.matrix[i][j]%=self.mod\r\n return self\r\n\r\n def __imatmul__(self,other):\r\n if type(other)==Matrix:\r\n assert self.W==other.H\r\n prod=Matrix(H=self.H,W=other.W,eps=self.eps,mod=self.mod)\r\n for i in range(self.H):\r\n for j in range(other.W):\r\n for k in range(self.W):\r\n prod.matrix[i][j]+=self.matrix[i][k]*other.matrix[k][j]\r\n if self.mod:\r\n prod.matrix[i][j]%=self.mod\r\n elif type(other)==int:\r\n assert self.H==self.W\r\n if other==0:\r\n return Matrix(H=self.H,eps=self.eps,mod=self.mod,identity=1)\r\n elif other==1:\r\n prod=Matrix(matrix=[[self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n prod=Matrix(H=self.H,eps=self.eps,mod=self.mod,identity=1)\r\n doub=self\r\n while other>=2:\r\n if other&1:\r\n prod@=doub\r\n doub@=doub\r\n other>>=1\r\n prod@=doub\r\n return prod\r\n\r\n def __itruediv__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.mod:\r\n self.matrix[i][j]=self.matrix[i][j]*MOD(self.mod).Pow(other.matrix[i][j],-1)%self.mod\r\n else:\r\n self.matrix[i][j]/=other.matrix[i][j]\r\n else:\r\n if self.mod:\r\n inve=MOD(self.mod).Pow(other,-1)\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.mod:\r\n self.matrix[i][j]=self.matrix[i][j]*inve%self.mod\r\n else:\r\n self.matrix[i][j]/=other\r\n return self\r\n\r\n def __ifloordiv__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]//=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]//=other\r\n return self\r\n\r\n def __imod__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]%=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]%=other\r\n return self\r\n\r\n def __ipow__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.mod:\r\n self.matrix[i][j]=pow(self.matrix[i][j],other.matrix[i][j],self.mod)\r\n else:\r\n self.matrix[i][j]=pow(self.matrix[i][j],other.matrix[i][j])\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n if self.mod:\r\n self.matrix[i][j]=pow(self.matrix[i][j],other,self.mod)\r\n else:\r\n self.matrix[i][j]=pow(self.matrix[i][j],other)\r\n return self\r\n\r\n def __ilshift__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]<<=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]<<=other\r\n return self\r\n\r\n def __irshift__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]>>=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]>>=other\r\n return self\r\n\r\n def __iand__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]&=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]&=other\r\n return self\r\n\r\n def __ior__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]|=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]|=other\r\n return self\r\n\r\n def __ixor__(self,other):\r\n if type(other)==Matrix:\r\n assert self.H==other.H\r\n assert self.W==other.W\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]^=other.matrix[i][j]\r\n else:\r\n for i in range(self.H):\r\n for j in range(self.W):\r\n self.matrix[i][j]^=other\r\n return self\r\n\r\n def __neg__(self):\r\n if self.mod:\r\n nega=Matrix(matrix=[[(-self.matrix[i][j])%self.mod for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n else:\r\n nega=Matrix(matrix=[[-self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return nega\r\n\r\n def __pos__(self):\r\n posi=Matrix(matrix=[[self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return posi\r\n\r\n def __invert__(self):\r\n inve=Matrix(matrix=[[~self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return inve\r\n\r\n def __abs__(self):\r\n abso=Matrix(matrix=[[abs(self.matrix[i][j]) for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n return abso\r\n\r\n def __getitem__(self,i):\r\n if type(i)==int:\r\n return self.matrix[i]\r\n elif type(i)==tuple:\r\n i,j=i\r\n if type(i)==int:\r\n i=slice(i,i+1)\r\n if type(j)==int:\r\n j=slice(j,j+1)\r\n return Matrix(matrix=[lst[j] for lst in self.matrix[i]],eps=self.eps,mod=self.mod)\r\n\r\n def __contains__(self,x):\r\n for i in range(self.H):\r\n if x in self.matrix[i]:\r\n return True\r\n return False\r\n\r\n def __str__(self):\r\n digit=[max(len(str(self.matrix[i][j])) for i in range(self.H)) for j in range(self.W)]\r\n return \"\\n\".join([(\" [\" if i else \"[[\")+\", \".join([str(self.matrix[i][j]).rjust(digit[j],\" \") for j in range(self.W)])+\"]\" for i in range(self.H)])+\"]\"\r\n\r\n def __bool__(self):\r\n return True\r\n\r\n def Transpose(self):\r\n return Matrix(matrix=[[self.matrix[i][j] for i in range(self.H)] for j in range(self.W)])\r\n\r\n def Trace(self):\r\n assert self.H==self.W\r\n trace=sum(self.matrix[i][i] for i in range(self.H))\r\n if self.mod:\r\n trace%=self.mod\r\n return trace\r\n\r\n def Elem_Raw_Operate_1(self,i1,i2):\r\n self.matrix[i1],self.matrix[i2]=self.matrix[i2],self.matrix[i1]\r\n\r\n def Elem_Raw_Operate_2(self,i,c):\r\n if self.mod:\r\n self.matrix[i]=[self.matrix[i][j]*c%self.mod for j in range(self.W)]\r\n else:\r\n self.matrix[i]=[self.matrix[i][j]*c for j in range(self.W)]\r\n\r\n def Elem_Raw_Operate_3(self,i1,i2,c):\r\n if self.mod:\r\n self.matrix[i1]=[(self.matrix[i1][j]+c*self.matrix[i2][j])%self.mod for j in range(self.W)]\r\n else:\r\n self.matrix[i1]=[self.matrix[i1][j]+c*self.matrix[i2][j] for j in range(self.W)]\r\n\r\n def Elimination(self,determinant=False,inverse_matrix=False,linear_equation=False,rank=False,upper_triangular=False):\r\n h=0\r\n ut=Matrix(matrix=[[self.matrix[i][j] for j in range(self.W)] for i in range(self.H)],eps=self.eps,mod=self.mod)\r\n if determinant or inverse_matrix:\r\n assert self.H==self.W\r\n det=1\r\n if inverse_matrix:\r\n assert self.H==self.W\r\n im=Matrix(H=self.H,eps=self.eps,mod=self.mod,identity=1)\r\n if linear_equation:\r\n assert self.H==linear_equation.H\r\n le=Matrix(matrix=[[linear_equation.matrix[i][j] for j in range(linear_equation.W)] for i in range(linear_equation.H)],eps=self.eps,mod=self.mod)\r\n for j in range(ut.W):\r\n for i in range(h,ut.H):\r\n if abs(ut.matrix[i][j])>ut.eps:\r\n if determinant or inverse_matrix:\r\n det*=ut.matrix[i][j]\r\n if self.mod:\r\n det%=self.mod\r\n if self.mod:\r\n inve=MOD(self.mod).Pow(ut.matrix[i][j],-1)\r\n else:\r\n inve=1/ut.matrix[i][j]\r\n\r\n ut.Elem_Raw_Operate_1(i,h)\r\n if determinant and i!=h and self.mod:\r\n det=(-det)%self.mod\r\n if inverse_matrix:\r\n im.Elem_Raw_Operate_1(i,h)\r\n if linear_equation:\r\n le.Elem_Raw_Operate_1(i,h)\r\n\r\n ut.Elem_Raw_Operate_2(h,inve)\r\n if inverse_matrix:\r\n im.Elem_Raw_Operate_2(h,inve)\r\n if linear_equation:\r\n le.Elem_Raw_Operate_2(h,inve)\r\n\r\n for ii in range(ut.H):\r\n if ii==h:\r\n continue\r\n x=-ut.matrix[ii][j]\r\n ut.Elem_Raw_Operate_3(ii,h,x)\r\n if inverse_matrix:\r\n im.Elem_Raw_Operate_3(ii,h,x)\r\n if linear_equation:\r\n le.Elem_Raw_Operate_3(ii,h,x)\r\n h+=1\r\n break\r\n else:\r\n det=0\r\n tpl=()\r\n if determinant:\r\n tpl+=(det,)\r\n if inverse_matrix:\r\n if det<=0:\r\n im=False\r\n tpl+=(im,)\r\n if linear_equation:\r\n tpl+=(le,)\r\n if rank:\r\n tpl+=(h,)\r\n if upper_triangular:\r\n tpl+=(ut,)\r\n if len(tpl)==1:\r\n tpl=tpl[0]\r\n return tpl\r\n\r\nclass Lazy_Segment_Tree:\r\n def __init__(self,N,f,e,f_act,e_act,operate,lst=None):\r\n self.N=N\r\n self.f=f\r\n self.e=e\r\n self.f_act=f_act\r\n self.e_act=e_act\r\n self.operate=operate\r\n self.segment_tree=[self.e]*(self.N+self.N)\r\n self.segment_tree_act=[self.e_act]*(self.N+self.N)\r\n if lst!=None:\r\n for i,x in enumerate(lst):\r\n self.segment_tree[i+self.N]=x\r\n for i in range(self.N-1,0,-1):\r\n self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])\r\n self.segment_tree_act=[self.e_act]*(self.N+self.N)\r\n\r\n def __getitem__(self,i):\r\n if type(i) is int:\r\n if -self.N<=i<0:\r\n i+=self.N*2\r\n elif 0<=i<self.N:\r\n i+=self.N\r\n else:\r\n raise IndexError('list index out of range')\r\n self.Propagate_Above(i)\r\n self.Recalculate_Above(i)\r\n return self.Operate_At(i)\r\n else:\r\n a,b,c=i.start,i.stop,i.step\r\n if a==None or a<-self.N:\r\n a=self.N\r\n elif self.N<=a:\r\n a=self.N*2\r\n elif a<0:\r\n a+=self.N*2\r\n else:\r\n a+=self.N\r\n if b==None or self.N<=b:\r\n b=self.N*2\r\n elif b<-self.N:\r\n b=self.N\r\n elif b<0:\r\n b+=self.N*2\r\n else:\r\n b+=self.N\r\n return self.segment_tree[slice(a,b,c)]\r\n\r\n def __setitem__(self,i,x):\r\n if -self.N<=i<0:\r\n i+=self.N*2\r\n elif 0<=i<self.N:\r\n i+=self.N\r\n else:\r\n raise IndexError('list index out of range')\r\n self.Propagate_Above(i)\r\n self.segment_tree[i]=x\r\n self.segment_tree_act[i]=self.e_act\r\n self.Recalculate_Above(i)\r\n\r\n def Operate_At(self,i):\r\n return self.operate(self.segment_tree[i],self.segment_tree_act[i])\r\n\r\n def Propagate_At(self,i):\r\n self.segment_tree[i]=self.Operate_At(i)\r\n self.segment_tree_act[i<<1]=self.f_act(self.segment_tree_act[i<<1],self.segment_tree_act[i])\r\n self.segment_tree_act[i<<1|1]=self.f_act(self.segment_tree_act[i<<1|1],self.segment_tree_act[i])\r\n self.segment_tree_act[i]=self.e_act\r\n\r\n def Propagate_Above(self,i):\r\n H=i.bit_length()-1\r\n for h in range(H,0,-1):\r\n self.Propagate_At(i>>h)\r\n\r\n def Recalculate_Above(self,i):\r\n while i>1:\r\n i>>=1\r\n self.segment_tree[i]=self.f(self.Operate_At(i<<1),self.Operate_At(i<<1|1))\r\n\r\n def Build(self,lst):\r\n for i,x in enumerate(lst):\r\n self.segment_tree[i+self.N]=x\r\n for i in range(self.N-1,0,-1):\r\n self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])\r\n self.segment_tree_act=[self.e_act]*(self.N+self.N)\r\n\r\n def Fold(self,L=None,R=None):\r\n if L==None:\r\n L=self.N\r\n else:\r\n L+=self.N\r\n if R==None:\r\n R=self.N*2\r\n else:\r\n R+=self.N\r\n self.Propagate_Above(L//(L&-L))\r\n self.Propagate_Above(R//(R&-R)-1)\r\n vL=self.e\r\n vR=self.e\r\n while L<R:\r\n if L&1:\r\n vL=self.f(vL,self.Operate_At(L))\r\n L+=1\r\n if R&1:\r\n R-=1\r\n vR=self.f(self.Operate_At(R),vR)\r\n L>>=1\r\n R>>=1\r\n return self.f(vL,vR)\r\n\r\n def Fold_Index(self,L=None,R=None):\r\n if L==None:\r\n L=self.N\r\n else:\r\n L+=self.N\r\n if R==None:\r\n R=self.N*2\r\n else:\r\n R+=self.N\r\n if L==R:\r\n return None\r\n x=self.Fold(L-self.N,R-self.N)\r\n while L<R:\r\n if L&1:\r\n if self.segment_tree[L]==x:\r\n i=L\r\n break\r\n L+=1\r\n if R&1:\r\n R-=1\r\n if self.segment_tree[R]==x:\r\n i=R\r\n break\r\n L>>=1\r\n R>>=1\r\n while i<self.N:\r\n if self.segment_tree[i]==self.segment_tree[i<<1]:\r\n i<<=1\r\n else:\r\n i<<=1\r\n i|=1\r\n i-=self.N\r\n return i\r\n\r\n def Operate_Range(self,a,L=None,R=None):\r\n if L==None:\r\n L=self.N\r\n else:\r\n L+=self.N\r\n if R==None:\r\n R=self.N*2\r\n else:\r\n R+=self.N\r\n L0=L//(L&-L)\r\n R0=R//(R&-R)-1\r\n self.Propagate_Above(L0)\r\n self.Propagate_Above(R0)\r\n while L<R:\r\n if L&1:\r\n self.segment_tree_act[L]=self.f_act(self.segment_tree_act[L],a)\r\n L+=1\r\n if R&1:\r\n R-=1\r\n self.segment_tree_act[R]=self.f_act(self.segment_tree_act[R],a)\r\n L>>=1\r\n R>>=1\r\n self.Recalculate_Above(L0)\r\n self.Recalculate_Above(R0)\r\n\r\n def Update(self):\r\n for i in range(1,self.N):\r\n self.Propagate_At(i)\r\n for i in range(self.N,self.N*2):\r\n self.segment_tree[i]=self.Operate_At(i)\r\n self.segment_tree_act[i]=self.e_act\r\n for i in range(self.N-1,0,-1):\r\n self.segment_tree[i]=self.f(self.segment_tree[i<<1],self.segment_tree[i<<1|1])\r\n\r\n def Bisect_Right(self,L=None,f=None):\r\n if L==self.N:\r\n return self.N\r\n if L==None:\r\n L=0\r\n L+=self.N\r\n self.Propagate_Above(L//(L&-L))\r\n self.Propagate_Above(self.N//(self.N&-self.N)-1)\r\n l,r=L,self.N*2\r\n vl=self.e\r\n vr=self.e\r\n while l<r:\r\n if l&1:\r\n vl=self.f(vl,self.Operate_At(l))\r\n l+=1\r\n if r&1:\r\n r-=1\r\n vr=self.f(self.Operate_At(r),vr)\r\n l>>=1\r\n r>>=1\r\n if f(self.f(vl,vr)):\r\n return self.N\r\n v=self.e\r\n while True:\r\n while L%2==0:\r\n L>>=1\r\n self.Propagate_Above(L)\r\n vv=self.f(v,self.Operate_At(L))\r\n if f(vv):\r\n v=vv\r\n L+=1\r\n else:\r\n while L<self.N:\r\n L<<=1\r\n self.Propagate_Above(L)\r\n vv=self.f(v,self.Operate_At(L))\r\n if f(vv):\r\n v=vv\r\n L+=1\r\n return L-self.N\r\n\r\n def Bisect_Left(self,R=None,f=None):\r\n if R==0:\r\n return 0\r\n if R==None:\r\n R=self.N\r\n R+=self.N\r\n self.Propagate_Above(self.N//(self.N&-self.N))\r\n self.Propagate_Above(R//(R&-R)-1)\r\n vl=self.e\r\n vr=self.e\r\n l,r=self.N,R\r\n while l<r:\r\n if l&1:\r\n vl=self.f(vl,self.Operate_At(l))\r\n l+=1\r\n if r&1:\r\n r-=1\r\n vr=self.f(self.Operate_At(r),vr)\r\n l>>=1\r\n r>>=1\r\n if f(self.f(vl,vr)):\r\n return 0\r\n v=self.e\r\n while True:\r\n R-=1\r\n while R>1 and R%2:\r\n R>>=1\r\n self.Propagate_Above(R)\r\n vv=self.f(self.Operate_At(R),v)\r\n if f(vv):\r\n v=vv\r\n else:\r\n while R<self.N:\r\n R=2*R+1\r\n self.Propagate_Above(R)\r\n vv=self.f(self.Operate_At(R),v)\r\n if f(vv):\r\n v=vv\r\n R-=1\r\n return R+1-self.N\r\n\r\n def __str__(self):\r\n import copy\r\n segment_tree=copy.deepcopy(self.segment_tree)\r\n segment_tree_act=copy.deepcopy(self.segment_tree_act)\r\n for i in range(1,self.N):\r\n segment_tree[i]=self.operate(segment_tree[i],segment_tree_act[i])\r\n segment_tree_act[i<<1]=self.f_act(segment_tree_act[i<<1],segment_tree_act[i])\r\n segment_tree_act[i<<1|1]=self.f_act(segment_tree_act[i<<1|1],segment_tree_act[i])\r\n segment_tree_act[i]=self.e_act\r\n for i in range(self.N,self.N*2):\r\n segment_tree[i]=self.operate(segment_tree[i],segment_tree_act[i])\r\n segment_tree_act[i]=self.e_act\r\n for i in range(self.N-1,0,-1):\r\n segment_tree[i]=self.f(segment_tree[i<<1],segment_tree[i<<1|1])\r\n return '['+', '.join(map(str,[self.operate(x,a) for x,a in zip(segment_tree[self.N:],segment_tree_act[self.N:])]))+']'\r\n\r\nN,M=map(int,readline().split())\r\nA=list(map(int,readline().split()))\r\nmod=10**9\r\nE=Matrix(2,2,mod=mod,identity=1)\r\nE0=Matrix(2,2,mod=mod)\r\nF=Matrix(matrix=[[1,1],[1,0]],mod=mod)\r\nF_inve=F.Elimination(inverse_matrix=True)\r\ndef f(tpl0,tpl1):\r\n mat0,x0,s0=tpl0\r\n mat1,x1,s1=tpl1\r\n return (mat0+mat1,x0+x1,s0+s1)\r\ne=(E0,0,E0)\r\ndef f_act(a,b):\r\n return a+b\r\ne_act=0\r\ndef operate(tpl,a):\r\n mat,x,s=tpl\r\n return (mat,x+a,s+mat*a)\r\nF_pow=[E]\r\nfor i in range(N-1):\r\n F_pow.append(F_pow[-1]@F)\r\nF_inve_pow=[E]\r\nfor i in range(N-1):\r\n F_inve_pow.append(F_inve_pow[-1]@F_inve)\r\nlst=[]\r\nfor i in range(N):\r\n lst.append((F_pow[i],A[i],F_pow[i]*A[i]))\r\nLST=Lazy_Segment_Tree(N,f,e,f_act,e_act,operate,lst)\r\nfor _ in range(M):\r\n data=map(int,readline().split())\r\n t=next(data)\r\n if t==1:\r\n i,v=data\r\n i-=1\r\n mat,x,s=LST.Fold(i,i+1)\r\n LST.Operate_Range(v-x,i,i+1)\r\n elif t==2:\r\n l,r=data\r\n l-=1\r\n s=LST.Fold(l,r)[2]\r\n s@=F_inve_pow[l]\r\n ans=s[0][0]\r\n print(ans)\r\n else:\r\n l,r,d=data\r\n l-=1\r\n LST.Operate_Range(d,l,r)", "n,m = map(int,input().split())\r\nd = [int(x) for x in input().split()]\r\nf = [1,1]\r\nfor i in range(n):\r\n f.append((f[-1]+f[-2])% 1000000000)\r\nfor i in range(m):\r\n s = [int(x) for x in input().split()]\r\n if s[0] == 1:\r\n x = s[1]-1\r\n v = s[2]\r\n d[x] = v\r\n elif s[0] == 2:\r\n r = s[2]-1\r\n l = s[1]-1\r\n ans = 0\r\n for i in range(r-l+1):\r\n #print(\"(\",f[i],d[i+l],ans,\")\")\r\n ans = (ans % 10**9 + d[i+l]% 10**9 * f[i] % 10**9)% 10**9\r\n print(ans) \r\n elif s[0] == 3:\r\n r = s[2]-1\r\n l = s[1]-1 \r\n x = s[3]\r\n for i in range(l,r+1):\r\n d[i] += x\r\n", "mod = 10**9\r\nFibArray = [1,1] \r\ndef fibonacci(n): \r\n if n<=len(FibArray): \r\n return FibArray[n-1]\r\n else: \r\n temp_fib = fibonacci(n-1)+fibonacci(n-2) \r\n FibArray.append(temp_fib) \r\n return temp_fib\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor _ in range(m):\r\n\tquery = list(map(int, input().split()))\r\n\tif query[0]==1:\r\n\t\ta[query[1]-1] = query[2]\r\n\telif query[0]==3:\r\n\t\td = query[3]\r\n\t\tfor i in range(query[1]-1, query[2]):\r\n\t\t\ta[i]+=d\r\n\telse:\r\n\t\tl, r = query[1], query[2]\r\n\t\ts = 0\r\n\t\tfor x in range(r-l+1):\r\n\t\t\t# print(fibonacci(x+1), a[l+x-1])\r\n\t\t\ts+=((fibonacci(x+1)*a[l+x-1]))\t\r\n\t\tprint(s%mod)\t\r\n\t", "\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(m):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n a[l-1] = r\r\n else:\r\n s = 0\r\n fiba = fibb = 1\r\n for i in range(l-1, r):\r\n s += fiba * a[i]\r\n fiba, fibb = fibb, fiba + fibb\r\n print(s % 1000000000)\r\n" ]

[ "x1, y1 = list(map(int, input().split()))\r\nx2, y2 = list(map(int, input().split()))\r\nprint(max(abs(x1-x2), abs(y1-y2)))", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nmoo = 0\r\nx, y = x1, y1\r\na = min(abs(x2-x1), abs(y2-y1))\r\nmoo += a\r\nif x2 > x and y2 > y:\r\n x += a\r\n y += a\r\nelif x2 < x and y2 < y:\r\n x -= a\r\n y -= a\r\nelif x2 < x and y2 > y:\r\n x -= a\r\n y += a\r\nelse:\r\n x += a\r\n y -= a\r\nif x == x2:\r\n moo += abs(y2-y)\r\nelse:\r\n moo += abs(x2-x)\r\nprint(moo)", "x1 ,y1 = map(int,input().strip().split())\r\nx2 , y2 = map(int,input().strip().split())\r\nans = max(abs(x1 - x2) , abs(y1 - y2))\r\nprint(ans)", "l1=list(map(int, input().split()))\r\nl2=list(map(int, input().split()))\r\nprint(max(abs(l1[0]-l2[0]), abs(l1[1]-l2[1])))", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n x1,y1 = map(int, wtf[0].split())\r\n x2,y2 = map(int, wtf[1].split())\r\n print(max(abs(y1-y2),abs(x1-x2)))", "x1,y1=list(map(int,input().split(\" \")))\r\nx2,y2=list(map(int,input().split(\" \")))\r\n\r\nresult1=max(x1,x2)-min(x1,x2)\r\nresult2=max(y1,y2)-min(y1,y2)\r\n\r\nprint(max(result1,result2))", "[x1, y1] = map(int, input().split())\r\n[x2, y2] = map(int, input().split())\r\n\r\na = x1-x2\r\nb = y1-y2\r\n\r\na = abs(a)\r\nb = abs(b)\r\n\r\nif a>b:\r\n print(a)\r\nelse:\r\n print(b)", "n,m=map(int,input().split())\r\np,q=map(int,input().split())\r\nt=abs(n-p)\r\ny=abs(m-q)\r\nprint(max(t,y))", "n=[int(x) for x in input().split()]\r\nm=[int(x) for x in input().split()]\r\nif n[0]>=0:\r\n m[0]=m[0]-n[0]\r\nelse:\r\n m[0]=m[0]+abs(n[0])\r\nif n[1]>=0:\r\n m[1]=m[1]-n[1]\r\nelse:\r\n m[1]=m[1]+abs(n[1])\r\nprint(max(abs(m[0]),abs(m[1])))\r\n", "from math import *\r\n\r\nx1, y1 = [int(i) for i in input().split()]\r\nx2, y2 = [int(i) for i in input().split()]\r\nprint(max(abs(x1 - x2), abs(y1 - y2)))", "sLine = input()\r\nsSplit = sLine.split()\r\nx1 = int(sSplit[0])\r\ny1 = int(sSplit[1])\r\nsLine = input()\r\nsSplit = sLine.split()\r\nx2 = int(sSplit[0])\r\ny2 = int(sSplit[1])\r\n\r\nd = max(abs(x2 - x1), abs(y2 - y1))\r\nprint(d)\r\n", "c1 = list(map(int, input().split()))\r\nc2 = list(map(int, input().split()))\r\n\r\nprint(max(abs(c1[0] - c2[0]), abs(c1[1] - c2[1])))\r\n", "p1=list(map(int,input().split()))\nx1=p1[0]\ny1=p1[1]\np2=list(map(int,input().split()))\nx2=p2[0]\ny2=p2[1]\nyo1=abs(x1-x2)\nyo2=abs(y1-y2)\nchota=min(yo1,yo2)\nbada=max(yo1,yo2)\nans=chota+(bada-chota)\n\nprint(ans)", "a,b = map(int,input().split())\r\nc,d = map(int,input().split())\r\nprint(max(abs(a-c),abs(b-d)))", "x1, y1 = list(map(int, input().split()))\nx2, y2 = list(map(int, input().split()))\n\ns1 = abs(x2-x1)\ns2 = abs(y2-y1)\n\nprint(max(s1, s2))\n\t \t \t \t\t \t \t\t \t\t \t \t\t", "a,b,c,d = *map(int,input().split()), *map(int,input().split())\r\nprint(max(abs(a-c), abs(b-d)))", "a,b=map(int,input().split())\r\nc,d=map(int,input().split())\r\nprint(max(abs(c-a),abs(b-d)))\r\n ", "x, y=map(int, input().split())\r\nz, t=map(int, input().split())\r\nprint(max(abs(x-z), abs(y-t)))", "a,b=map(int,input().split())\r\nx,y=map(int,input().split())\r\nprint(max(abs(x-a),abs(y-b)))", "x1,y1 = map(int,input().split())\r\nx2,y2 = map(int,input().split())\r\nif abs(x1-x2)>abs(y1-y2):\r\n print(abs(x1-x2))\r\nelse:\r\n print(abs(y1-y2))\r\n", "x1, y1 = map(int, input().split())\nx2, y2 = map(int, input().split())\n\nmindiff = min(abs(x1 - x2), abs(y1 - y2))\nans = mindiff\nans += abs(x1 - x2) - mindiff\nans += abs(y1 - y2) - mindiff\nprint(ans)\n", "x1,y1 = map(int,input().split())\r\nx2,y2 = map(int,input().split())\r\nans1 = abs(x1-x2)\r\nans2 = abs(y1-y2)\r\nprint(max(ans1,ans2))\r\n", "string=input()\r\ns=string.split()\r\nx1=int(s[0])\r\ny1=int(s[1])\r\nstring1=input()\r\ns1=string1.split()\r\nx2=int(s1[0])\r\ny2=int(s1[1])\r\na=x2-x1\r\nb=y2-y1\r\nif(True):\r\n if(a<0):\r\n a=a*(-1)\r\n if(b<0):\r\n b=b*(-1)\r\n if(a==b):\r\n ans=a \r\n else:\r\n ans=min(a,b)\r\n ans=ans+(max(a,b)-min(a,b))\r\nprint(ans)", "x1 , y1 = [int(x)for x in input().split()]\r\nx2 , y2 = [int(x)for x in input().split()]\r\na = abs(y1-y2)\r\nb = abs(x1-x2)\r\nprint(max(a,b))", "a, b = map(int, input().split())\r\nc, d = map(int, input().split())\r\ndiff1 = abs(a - c)\r\ndiff2 = abs(b - d)\r\nprint(max(diff1,diff2))\r\n\r\n", "x1,y1=list(map(int,input().split()))\r\nx2,y2=list(map(int,input().split()))\r\nMax,Min=max([abs(x2-x1),abs(y2-y1)]),min([abs(x2-x1),abs(y2-y1)])\r\nprint(Min+(Max-Min))", "x1,y1 = (int(x) for x in input().split())\r\nx2,y2 = (int(x) for x in input().split())\r\ndx = abs(x1-x2)\r\ndy = abs(y1-y2)\r\nprint(min(dy,dx) + max(dx, dy)-min(dx,dy))", "current_x, current_y = map(int, input().split())\nreach_x, reach_y = map(int, input().split())\n\ndef find_min_steps(current_x, current_y, reach_x, reach_y):\n return max(abs(current_x - reach_x), abs(current_y - reach_y))\n\nprint(find_min_steps(current_x, current_y, reach_x, reach_y))\n", "[a, b] = map(int, input().split())\r\n[c, d] = map(int, input().split())\r\n\r\ncomp1 = abs(a-c)\r\ncomp2 = abs(b-d)\r\n\r\nif comp1 > comp2:\r\n print(comp1)\r\nelif comp2 > comp1:\r\n print(comp2)\r\nelif comp1 == comp2:\r\n print(comp1)", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nif x1>x2:\r\n if y1>y2:\r\n x=x1-x2\r\n y=y1-y2\r\n else:\r\n x=x1-x2\r\n y=y2-y1\r\nelse:\r\n if y1<y2:\r\n x=x2-x1\r\n y=y2-y1\r\n else:\r\n x=x2-x1\r\n y=y1-y2\r\nprint(max(x,y))", "x1,y1=list(map(int,input().split()))\r\nx2,y2=list(map(int,input().split()))\r\nh=abs(x2-x1)\r\nv=abs(y2-y1)\r\nprint(min(h,v)+abs(h-v))", "rx, ry = map(int, input().split());x, y = map(int, input().split())\r\nprint(max(abs(x - rx), abs(y - ry)))", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Thu Jun 25 18:46:25 2020\n\n@author: shailesh\n\"\"\"\n\nx1,y1 = [int(i) for i in input().split()]\n\nx2,y2 = [int(i) for i in input().split()]\n\nd1 = abs(x1 - x2)\nd2 = abs(y1-y2)\n\nif d1<d2:\n print(d1 + d2 - d1)\n\nelse:\n print(d2 + d1-d2)\n", "#!/usr/bin/env python3\n\ndef dist(x1, y1, x2, y2):\n return max(abs(x1-x2), abs(y1-y2))\n\nif __name__ == '__main__':\n x1, y1 = map(int, input().split())\n x2, y2 = map(int, input().split())\n print(dist(x1, y1, x2, y2))\n\n", "x1, y1 = input().split()\nx2, y2 = input().split()\nx1=int(x1)\nx2=int(x2)\ny1=int(y1)\ny2=int(y2)\nxd = abs(x1-x2)\nyd = abs(y1-y2)\nprint(max(xd,yd))\n\n\n \t \t \t \t \t \t \t \t \t\t\t\t \t\t", "x1, y1 = map( int, input().split() )\nx2, y2 = map( int, input().split() )\nprint( max( abs(x1 - x2), abs(y1 - y2) ) )\n", "a,b = map(int,input().split())\r\nc,d = map(int,input().split())\r\nprint(max(abs(d-b),abs(c-a)))\r\n", "s1 = input().split()\ns2 = input().split()\na = int(s1[0])\nb = int(s1[1])\nc = int(s2[0])\nd = int(s2[1])\nprint(max(abs(c - a), abs(d - b)))", "from math import *\na, b = input().split()\nc, d = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nd = int(d)\ne = abs(a-c)\nf = abs(b-d)\ng = 0\nif e >= f:\n\tprint(e)\nelif f >= e:\n\tprint(f)\t\n\n# 1481129670451", "import math\n\na, b = map(int, input().split())\nc, d = map(int, input().split())\n\nif c == a:\n\tprint(int(math.fabs(d-b)))\nelif d == b:\n\tprint(int(math.fabs(c-a)))\nelse:\n\tprint(max(int(math.fabs(c-a)), int(math.fabs(d-b))))\n \t\t\t\t\t\t\t \t\t \t \t \t\t\t\t \t\t", "#!/usr/bin/env python3\n\nx1, y1 = input().split()\nx2, y2 = input().split()\n\nx1, y1, x2, y2 = int(x1), int(y1), int(x2), int(y2)\n\ndx = abs(x1-x2)\ndy = abs(y1-y2)\n\nprint(max(dx, dy))", "start = list(map(int, input().split()))\nend = list(map(int, input().split()))\nprint(max(abs(start[0] - end[0]), abs(start[1] - end[1])))\n\n \t \t\t\t\t \t \t \t \t\t\t \t \t\t \t", "#!/usr/bin/python3\n\nx1, y1 = map(int,input().split())\nx2, y2 = map(int,input().split())\nprint(max(abs(x1-x2),(abs(y1-y2))))\n", "x0, y0 = map(int, input().split())\r\nx1, y1 = map(int, input().split())\r\n\r\nsteps = max(abs(x0 - x1), abs(y0 - y1))\r\nprint(steps)\r\n", "x1 , y1 = map(int , input().split())\r\nx2 ,y2 = map(int ,input().split())\r\ndiffx = abs(x1 - x2) \r\ndiffy = abs(y1 -y2) \r\nt = min(diffy , diffx) \r\nprint((max(diffx , diffy) - t) + t )", "def main():\r\n x = input()\r\n y = input()\r\n z = x.split() + y.split()\r\n z = [abs(int(z[0]) - int(z[2]))] + [abs(int(z[1]) - int(z[3]))]\r\n print(max(z))\r\n \r\nmain()", "# BOOGEYMAN >>> Version 11.0\nimport os, sys, math, itertools, bisect\nfrom string import ascii_lowercase, ascii_uppercase\nfrom collections import deque, defaultdict, OrderedDict, Counter\nii,si = lambda : int(input()), lambda : input() \nmi, msi = lambda : map(int,input().strip().split(\" \")), lambda : map(str,input().strip().split(\" \")) \nli, lsi = lambda : list(mi()), lambda : list(msi())\n\ndef BoogeyMan() -> None:\n '''\n Query\n '''\n def kangaroo(x1, v1, x2, v2):\n if x1 < x2 and v1 < v2:\n return 'NO'\n else:\n if v1!=v2 and (x2-x1)%(v2-v1)==0:\n return 'YES' \n else:\n return 'NO'\n \n a,b = mi()\n c,d = mi()\n counter = 0\n if abs(a-c) >= abs(b-d):\n print(f\"{abs(a-c)}\",end=\"\\n\")\n else:\n counter+=abs(a-c)+(abs(b-d)-abs(a-c))\n print(f\"{counter}\",end=\"\\n\")\n \n \n \n \n \nif __name__ == \"__main__\":\n try:\n from baba_yaga import cmdIO, _generator_\n def _BoogeyMan_() -> None : yield cmdIO(); yield BoogeyMan(); yield _generator_()\n master = _BoogeyMan_()\n try:\n while True: assert not next(master)\n except StopIteration: pass\n except (FileNotFoundError,ModuleNotFoundError): BoogeyMan()\n \t \t \t \t\t \t\t\t \t\t \t\t\t", "a,b = map(int, input().split())\nc,d = map(int, input().split())\n\nS=a-c\nV=b-d\n\nif abs(S) > abs(V):\n print (abs(S))\n\nelif abs(V) > abs(S):\n print(abs(V))\nelse:\n print(abs(V))\n \n", "r = lambda: map(int,input().split())\r\na,b = r()\r\nx,y = r()\r\nprint (max(abs(a-x),abs(b-y)))", "x1,y1 = map(int,input().split())\nx2,y2 = map(int,input().split())\ntotal = max(abs(x2-x1),abs(y2-y1))\nprint(total)", "x1,y1=map(int,input().split())\nx2,y2=map(int,input().split())\nres=max(abs(x1-x2),abs(y1-y2))\nprint(res)", "def distancia():\r\n x1, y1 = map(int, input().split())\r\n x2, y2 = map(int, input().split())\r\n x = abs(x2-x1)\r\n y = abs(y2-y1)\r\n if(x == y):\r\n print(x)\r\n return \r\n if(x<y):\r\n print((y-x) + x)\r\n return\r\n elif(x>y):\r\n print((x-y) + y)\r\n return\r\ndistancia()\r\n\r\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nimport math\r\na = math.dist([x1], [x2])\r\nb = math.dist([y1], [y2])\r\nprint(int (max(a, b)))", "def main():\n [x1, y1] = [int(_) for _ in input().split()]\n [x2, y2] = [int(_) for _ in input().split()]\n\n distance_x = abs(x1 - x2)\n distance_y = abs(y1 - y2)\n\n result = min(distance_x, distance_y) + abs(distance_x - distance_y)\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "a,b=map(int, input() .split())\r\nx,y=map(int, input() .split())\r\nd1=abs(a-x)\r\nd2=abs(b-y)\r\nm=min(d1,d2)\r\nd3=abs(d1-d2)\r\nprint(m+d3)", "x1, y1 = [int(ele) for ele in input().split()]\r\nx2, y2 = [int(ele) for ele in input().split()]\r\n\r\ndx = 0\r\ndy = 0\r\n\r\nif x1 > x2:\r\n\tdx = x1-x2\r\nelse:\r\n\tdx = x2- x1\r\n\r\nif y1 > y2:\r\n\tdy = y1-y2\r\nelse:\r\n\tdy = y2-y1\r\n\r\nif dx > dy:\r\n\tprint (dx)\r\nelse:\r\n\tprint (dy)", "n, m = (int(x) for x in input().split())\r\ni, j = (int(x) for x in input().split())\r\nprint(max((abs(n-i)),(abs(m-j))))", "i=lambda:map(int,input().split())\r\na,b=i()\r\nc,d=i()\r\nprint(max(abs(c-a),abs(d-b)))", "a,b = map(int,input().split())\nc,d = map(int,input().split())\n\nx=abs(a-c)\ny=abs(b-d)\n\nvalor = min(x,y)+(max(x,y)-min(x,y))\nprint(valor)", "import math\r\n\r\nx1,y1=list(map(int,input().split()))\r\nx2,y2=list(map(int,input().split()))\r\nc=(math.fabs(x2-x1))\r\nd=(math.fabs(y2-y1))\r\nprint(int(max(c,d)))\r\n", "x,y=map(int,input().split())\r\na,b=map(int,input().split())\r\nd,e=abs(x-a),abs(y-b)\r\nif d==e:\r\n\tprint(d)\r\nelse:\r\n\tprint(min(d,e)+abs(max(d,e)-min(d,e)))", "x,y = map(int,input().split())\r\na,b = map(int,input().split())\r\nh = abs(x-a)\r\nl = abs(y-b)\r\nif h==l:\r\n print(h)\r\nelse:\r\n print(max(h,l))\r\n", "\ninp1= input()\ninp2= input()\n\ns=inp1.split(\" \")\nd=inp2.split(\" \")\ns1=int(s[0]) - int(d[0])\ns2=int(s[1]) - int(d[1])\n\ns1 = abs(s1)\ns2 = abs(s2)\nif(s1>s2):\n print(s1)\nelif(s1<s2):\n print(s2)\nelse :\n print(s1)\n\t \t \t \t \t \t \t\t\t\t\t \t\t \t", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nif x1> x2:\r\n a= x1-x2\r\nelse:\r\n a =x2-x1\r\nif y1> y2:\r\n b= y1-y2\r\nelse:\r\n b =y2-y1\r\nprint (max(a,b))", "# 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\n \r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n \r\n \r\n# n = int(input())\r\nx,y = list(map(int,input().split()))\r\na,b = list(map(int,input().split()))\r\n\r\n# print(max(x,y)+min(a,b)\r\n\r\nmx = abs(x-a)\r\nmx2 = abs(y-b)\r\nprint(max(mx,mx2))", "def solution(l1,l2):\r\n return max(abs(l1[0]-l2[0]),abs(l1[1]-l2[1]))\r\n\r\ndef answer():\r\n l1=[int(x) for x in input().split()]\r\n l2=[int(x) for x in input().split()]\r\n print(solution(l1,l2))\r\nanswer()", "x,y=map(int,input().split())\r\nn,m=map(int,input().split())\r\n\r\nt=abs(x-n)\r\nk=abs(y-m)\r\n\r\nif t>k:\r\n print(t)\r\nelse:\r\n print(k)", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\nx = abs(x1-x2)\r\ny = abs(y1 - y2)\r\n\r\nprint(min(x, y) + abs(x - y))\r\n ", "#!/usr/bin/env python3.5\n# -*- coding: utf-8 -*-\n\n#**********************************\n\n#\t>\tAuthor: SuperDian\n#\t>\tMail: [email protected]\n#\t>\tCreate Time: Thu 21 Jan 2016 11:39:26 PM CST\n#\t>\tFile Name: test.py\n\n#*****************************\n\n\nd1 = [int(x) for x in input().split()]\nd2 = [int(x) for x in input().split()]\nprint(max(abs(d1[0]-d2[0]),abs(d1[1]-d2[1])))\n\n", "x , y = map(int,input().split())\r\n\r\nx1 , y1 = map(int,input().split())\r\n\r\nr1 = abs(x1 - x)\r\nr2 = abs(y1 - y)\r\n\r\nprint(max(r1 , r2))\r\n\r\n\r\n", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\na = abs(x2-x1)\r\nb = abs(y2-y1)\r\nprint(max(a,b))", "x1,y1 = list(map(int, input().strip().split()))\r\nx2,y2 = list(map(int, input().strip().split()))\r\nprint(max(abs(x2-x1),abs(y2-y1)))", "#!/usr/bin/python3\n\n(x1, y1) = input().split()\n(x1, y1) = (int(x1), int(y1))\n(x2, y2) = input().split()\n(x2, y2) = (int(x2), int(y2))\n\nprint(max(abs(x1-x2), abs(y1-y2)))\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\na = abs(x2 - x1)\r\nb = abs(y2 - y1)\r\nans = min(a, b)\r\na -= ans\r\nb -= ans\r\nans += a + b\r\nprint(ans)", "x, y = map(int, input().split())\r\nx1, y1 = [int(k) for k in input().split()]\r\nprint(max(abs(x - x1), abs(y - y1)))\r\n\r\n\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\nx1,y1=map(int,sys.stdin.readline().split())\r\nx2,y2=map(int,sys.stdin.readline().split())\r\nprint(max(abs(x2-x1),abs(y2-y1)))\r\n", "from sys import stdin as fin\n\n# fin = open(\"ecr6a.in\", \"r\")\n\nx1, y1 = map(int, input().split())\nx2, y2 = map(int, input().split())\n\nsx, sy = abs(x1 - x2), abs(y1 - y2)\nprint(min(sx, sy) + abs(sx - sy))", "x1, y1 = [int(x) for x in input().split(\" \")]\r\nx2, y2 = [int(x) for x in input().split(\" \")]\r\n\r\nprint(max(abs(y1 - y2), abs(x1 - x2)))", "x0,y0 = input().split()\nx,y = input().split()\n\n\nx0,y0,x,y = int(x0),int(y0),int(x),int(y)\nx,y,x0,y0 = abs(x-x0),abs(y-y0),0,0\nd=[x,y]\nprint(min(d)+abs(x-y))\n\n\t \t \t \t\t \t\t\t\t\t \t\t\t\t \t \t", "x,y=map(int,input().split(' '))\r\nx1,y1=map(int,input().split(' '))\r\nif(abs(x1-x)>abs(y1-y)):\r\n print(abs(x1-x))\r\nelse:\r\n print(abs(y1-y))", "x1,y1 = [int(x) for x in input().split()]\r\nx2,y2 = [int(x) for x in input().split()]\r\n\r\nprint(max(abs(x2-x1), abs(y2-y1)))", "I = lambda: [int(i) for i in input().split()]\r\n\r\nx1, y1 = I()\r\nx2, y2 = I()\r\nprint(max(abs(x1-x2), abs(y1-y2)))", "[x1,y1] = map(int, input().split())\r\n[x2,y2] = map(int, input().split())\r\nprint(max(abs(x1-x2), abs(y1-y2)))\r\n", "s1=input()\r\ns2=input()\r\ndx=abs(int(s1[:s1.index(' ')])-int(s2[:s2.index(' ')]))\r\ndy=abs(int(s1[s1.index(' ')+1:])-int(s2[s2.index(' ')+1:]))\r\nprint(max(dx,dy))\r\n", "a,b = map(int,input().split())\nx,y = map(int,input().split())\n\nl1 = abs(a-x)\nl2 = abs(b-y)\n\nif (l1>l2):\n print((l1-l2)+l2)\nelse: print((l2-l1)+l1)\n\t \t \t\t\t \t \t\t\t\t \t\t \t\t\t\t\t", "import math\r\n[x, y] = map(int, input().split())\r\n[x2, y2] = map(int, input().split())\r\nc = 0\r\nif y2 < y:\r\n y2 = 2*y - y2\r\nif x2 < x:\r\n x2 = 2*x - x2\r\ny2 = y2 - y\r\nx2 = x2 - x\r\nif x2 < y2:\r\n c = y2\r\nif x2 > y2:\r\n c = x2\r\nif x2 == y2:\r\n c = x2\r\nprint(c)", "sx, sy = map(int, input().split())\r\nx, y = map(int, input().split())\r\nprint(max(abs(x-sx), abs(y-sy)))\r\n", "\r\nn,m=(int(x) for x in input().split())\r\nK,L=(int(x) for x in input().split())\r\nx= abs(K-n)\r\ny=abs(L-m)\r\nM=max(x,y)\r\nprint(M)", "# LUOGU_RID: 101606944\na, b, c, d = map(int, open(0).read().split())\r\nprint(max(abs(a - c), abs(b - d)))", "x,y = map(int, input().split())\nxx,yy = map(int, input().split())\ndx = abs(xx-x)\ndy = abs(yy-y)\nprint(max(dx,dy))\n", "a1 = input()\r\na2 = input()\r\na1 = a1.split(' ')\r\na2 = a2.split(' ')\r\nx1 = int(a1[0])\r\ny1 = int(a1[1])\r\nx2 = int(a2[0])\r\ny2 = int(a2[1])\r\ndx = abs(x2-x1)\r\ndy = abs(y2-y1)\r\nprint(max(dx,dy))", "[x1,y1] = map(int, input() .split())\n[x2,y2] = map(int, input() .split())\nprint(max(abs((x2-x1)),abs((y2-y1))))\n\n\n\n ", "\r\na,b = map(int,input().split())\r\nc,d = map(int,input().split())\r\nprint(max(abs(c-a),abs(d-b)))", "[x1, y1] = map(int, input().split())\n[x2, y2] = map(int, input().split())\nif abs(x2 - x1) >= abs(y2 - y1):\n print (abs(x2 - x1))\nelif abs(y2 - y1) >= abs(x2 - x1):\n print (abs(y2 - y1))\n", "if __name__ == \"__main__\":\r\n x1, y1 = [int(x) for x in input().split()]\r\n x2, y2 = [int(x) for x in input().split()]\r\n\r\n print( max( abs(x1-x2),abs(y1-y2) ) )", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Thu Jan 21 14:59:34 2016\n\n@author: kebl4230\n\"\"\"\nstart = [int(entry) for entry in input().split()]\nend = [int(entry) for entry in input().split()]\nx_dist = abs(start[0] - end[0])\ny_dist = abs(start[1] - end[1])\nresult = x_dist + y_dist - min(x_dist,y_dist) * (1 if (x_dist > 0 and y_dist > 0) else 0)\nprint(result)", "from math import *\r\n\r\nx1,y1 = map(int,input().split())\r\nx2,y2 = map(int,input().split())\r\nprint (max(abs(y2-y1),abs(x2-x1)))", "x,y = map(int,input().split())\r\nx1,y1 = map(int,input().split())\r\nif x1 - x>0:\r\n\tt = x1 - x\r\nelse:\r\n\tt = x - x1\r\nif y1 - y>0:\r\n\tt1 = y1 - y\r\nelse: \r\n\tt1 = y - y1\r\nprint(max(t,t1))\r\n", "import sys\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n\r\na,b=map(int,input().split())\r\nc,d=map(int,input().split())\r\nprint(max(abs(a-c),abs(b-d)))\r\n \r\n", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nm=abs(x2-x1)\r\nn=abs(y2-y1)\r\nif m==n:\r\n print(m)\r\nelse:\r\n print(max(m,n))\r\n", "x, y = map(int, input().split())\r\ni, j = map(int, input().split())\r\n\r\nct = 0\r\na = min(x, i); c = max(x, i)\r\nb = min(y, j); d = max(y, j)\r\nprint(max(c - a, d - b))", "i=input\nx,y=[int(n) for n in i().split()]\na,b=[int(n) for n in i().split()]\nprint(max(abs(a-x),abs(b-y)))\n\t\t \t\t \t \t \t\t\t\t \t\t\t \t \t\t\t\t \t", "import sys\r\nreadline=sys.stdin.readline\r\nwrite=sys.stdout.write\r\n\r\nX,Y=map(int,readline().split())\r\nx,y=map(int,readline().split())\r\nans=max(abs(X-x),abs(Y-y))\r\nprint(ans)", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nx = abs(x2 - x1)\r\ny = abs(y2 - y1)\r\nprint(max(x, y))", "[x,y] = map(int, input().split())\r\n[a,b] = map(int, input().split())\r\nprint(max(abs(x-a),abs(y-b)))", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\nxdiff = abs(x2-x1)\r\nydiff = abs(y2-y1)\r\n\r\nif xdiff > ydiff:\r\n\tprint (xdiff)\r\nelif ydiff > xdiff:\r\n\tprint (ydiff)\r\nelse:\r\n\tprint (xdiff)\r\n\r\n", "[x1,y1]=map(int, input().split())\r\n[x2,y2]=map(int, input().split())\r\na=abs(x1-x2)\r\nb=abs(y1-y2)\r\nprint (max(a,b))", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\np=abs(x1-x2)\r\nq=abs(y1-y2)\r\nprint(max(p,q))\r\n \r\n ", "[x,y] = map(int,input().split())\r\n[x2,y2] = map(int,input().split())\r\nd_x = abs(x2-x)\r\nd_y = abs(y2-y)\r\nprint(min(d_x,d_y)+abs(d_x-d_y))", "[x1,y1]=map(int,input().split())\r\n[x2,y2]=map(int,input().split())\r\nx=abs(x1-x2)\r\ny=abs(y1-y2)\r\nprint(max(x,y))", "[x_1, y_1] = map(int, input().split())\n[x_2, y_2] = map(int, input().split())\nx = abs(x_2 - x_1)\ny = abs(y_2 - y_1)\nif x>=y:\n print(x)\nelse:\n print(y)", "x1,y1=map(int,input().split(' '))\r\nx2,y2=map(int,input().split(' '))\r\nres=0\r\nif( int( ((x1-x2)**2)**.5 ) > res):\r\n res=int( ((x1-x2)**2)**.5 )\r\nif( int( ((y1-y2)**2)**.5 ) > res):\r\n res=int( ((y1-y2)**2)**.5 )\r\nprint(res)", "def c(a,b):\r\n if a-b>0:\r\n return a-b\r\n else:\r\n return b-a\r\nx,y=[int(i) for i in input().split()]\r\nk,l=[int(i) for i in input().split()]\r\nd=c(y,l)\r\ne=c(x,k)\r\nif d>e:\r\n print(d)\r\nelse:\r\n print(e)\r\n", "from math import *\r\nx1,y1=[int(x) for x in input().split()]\r\nx2,y2=[int(x) for x in input().split()]\r\nprint(max(int(fabs(x1-x2)),int(fabs(y1-y2))))", "x, y = map(int, input().split())\r\na, b = map(int, input().split())\r\nprint(max(abs(x-a), abs(y-b)))\r\n", "x1,y1=(int(i) for i in input().split())\r\nx2,y2=(int(i) for i in input().split())\r\nprint(max(abs(x2-x1),abs(y2-y1)))", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\nx_steps = x2-x1\r\ny_steps = y2-y1\r\nif x_steps<0:\r\n x_steps = x_steps*-1\r\n\r\nif y_steps<0:\r\n y_steps = y_steps*-1\r\nif x_steps>=y_steps:\r\n print(y_steps+(x_steps - y_steps))\r\nelse:\r\n print(x_steps + (y_steps - x_steps))\r\n", "x1,y1=map(int,input().split());\r\nx2,y2=map(int,input().split());\r\nx = max(abs(x2-x1) , abs(y2 - y1))\r\nprint(x)", "x1,y1 = map(int,input().split())\r\nx2,y2 = map(int,input().split())\r\n\r\nd = min(abs(x1-x2),abs(y1-y2))\r\n\r\nif x1 < x2:\r\n x1 = x1 + d\r\nelse:\r\n x1 = x1 - d\r\n \r\nif y1 < y2:\r\n y1 = y1 + d\r\nelse:\r\n y1 = y1 -d\r\n \r\n\r\n \r\nans = d+ abs(x1-x2) + abs(y1-y2)\r\n\r\nprint(ans)\r\n", "import math\n\nUSE_FILE = False \n\ndef main():\n s_x, s_y = tuple(map(int, input().split()))\n d_x, d_y = tuple(map(int, input().split()))\n distance_x = abs(s_x - d_x)\n distance_y = abs(s_y - d_y)\n return max(distance_x, distance_y)\n\n\n\n\n\n\n \n\n\n\n\nif __name__==\"__main__\":\n if USE_FILE:\n import sys\n sys.stdin = open('/home/stefan/input.txt', 'r')\n print(main())\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nx = abs(x1 - x2)\r\ny = abs(y1 - y2)\r\nif x <= y :\r\n print (y)\r\nelse :\r\n print (x)", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\na = abs(x1 - x2)\r\nb = abs(y2 - y1)\r\n\r\nif a > b:\r\n print(a)\r\nelse:\r\n print(b)", "n,m=map(int,input().split())\r\np,q=map(int,input().split())\r\nprint(max(abs(n-p),abs(m-q)))", "[w, x] = map(int,input().split())\r\n[y, z] = map(int,input().split())\r\ndx = abs(y - w)\r\ndy = abs(z - x)\r\nm = max(dx,dy)\r\nprint(m)", "import sys\nx1, y1 = map(int, sys.stdin.readline().split())\nx2, y2 = map(int, sys.stdin.readline().split())\nprint(max(abs(x2-x1),abs(y2-y1)))\n", "x1, y1 = [int(s) for s in input().split(\" \")]\r\nx2, y2 = [int(s) for s in input().split(\" \")]\r\nprint(max(abs(x2-x1), abs(y2-y1)))", "a1,b1=map(int,input().split())\r\na2,b2=map(int,input().split())\r\nx=abs(a1-a2)\r\ny=abs(b1-b2)\r\nprint(max(x,y))", "def solve(a1, b1, a2, b2):\r\n tmp1=abs(a1-a2)\r\n tmp2=abs(b1-b2)\r\n ans=max(tmp1,tmp2)\r\n return ans\r\n\r\n\r\na1,b1=map(int,input().split())\r\na2,b2=map(int,input().split())\r\nprint(solve(a1, b1, a2, b2))\r\n", "x1, y1 = input().split()\nx2, y2 = input().split()\nx, y = abs(int(x1)- int(x2)), abs(int(y1) - int(y2))\nif (x > y): print(x)\nelse: print(y)\n \t \t\t \t\t\t \t \t\t \t \t \t \t", "[x1, y1] = map(int, input().split())\r\n[x2, y2] = map(int, input().split())\r\n\r\nxdiff = abs(x2-x1)\r\nydiff = abs(y2-y1)\r\nprint(max(xdiff, ydiff))\r\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\na = abs(x1 - x2)\r\nb = abs(y1 - y2)\r\nprint(min(a, b) + (max(a, b) - min(a, b)))", "a = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\nprint(max(abs(x - y) for (x, y) in zip(a, b)))\n", "a,b=map(int,input().split())\r\nx,y=map(int,input().split())\r\nprint(max(abs(a-x),abs(b-y)))", "(x1,y1)=tuple(input().split())\n(x2,y2)=tuple(input().split())\n\nprint(max(abs(int(x1)-int(x2)),abs(int(y1)-int(y2))))", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nprint(max(abs(y1-y2),abs(x1-x2)))", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nprint(max(abs(x2-x1),abs(y2-y1)))", "a,b=map(int,input().split())\r\nn,m=map(int,input().split())\r\nn,m=abs(n-a),abs(m-b)\r\nn,m=min(n,m),max(n,m)\r\nprint(m)", "list1=[]\r\nstr1=input()\r\nlist2=str1.split(\" \")\r\nlist2_length=len(list2)\r\ni=0\r\nwhile i<=list2_length-1:\r\n list1.append(int(list2.pop()))\r\n i+=1\r\nlist1.reverse()\r\nlist3=[]\r\nstr3=input()\r\nlist4=str3.split(\" \")\r\nlist4_length=len(list4)\r\nj=0\r\nwhile j<=list4_length-1:\r\n list3.append(int(list4.pop()))\r\n j+=1\r\nlist3.reverse()\r\nprint(max(abs(list1[0]-list3[0]),abs(list1[1]-list3[1])))", "n = [int(x) for x in input().split()]\nm = [int(x) for x in input().split()]\nhold1 = abs(n[0] - m[0])\nhold2 = abs(n[1] - m[1])\nprint(max(hold1, hold2))", "x1,y1 = map(int,input().split())\r\nx2,y2 = map(int,input().split())\r\nprint (max(abs(x1-x2), abs(y1-y2)))", "a, b = map(int, input().split())\nc, d = map(int, input().split())\nprint(max(abs(a - c), abs(b - d)))\n", "a=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nx1=a[0]\r\ny1=a[1]\r\nx2=b[0]\r\ny2=b[1]\r\na1=abs(x1-x2)\r\na2=abs(y1-y2)\r\nr=max(a1,a2)\r\nprint(r)", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n A = list(map(int, input().split()))\r\n B = list(map(int, input().split()))\r\n C = [abs(A[0] - B[0]), abs(A[1] - B[1])]\r\n print(max(C))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "current_x, current_y = map(int, input().split())\nreach_x, reach_y = map(int, input().split())\n\nprint(max(abs(current_x - reach_x), abs(current_y - reach_y)))", "m,n=map(int,input().split())\n\np,q=map(int,input().split())\n\nz=max(abs(m-p), abs(n-q))\n\nprint(z)", "a, b = map(int, input().split())\r\nc, d = map(int, input().split())\r\ndx = abs(a - c)\r\ndy = abs(b - d)\r\nz = min(dx, dy)\r\nans = z\r\ndx -= z\r\ndy -= z\r\nans += dx\r\nans += dy\r\nprint(ans)\r\n", "def solve():\n start = [int(i) for i in input().split()]\n end = [int(i) for i in input().split()]\n\n diff_x = abs(start[0] - end[0])\n diff_y = abs(start[1] - end[1])\n\n if diff_x == diff_y:\n print(diff_x)\n else:\n print((max(diff_x, diff_y) - min(diff_x, diff_y)) + min(diff_x, diff_y))\n\n\nsolve()\n\t\t \t\t \t \t \t\t \t \t \t \t\t\t\t\t \t \t\t", "(x1,y1) = [int(x) for x in input().split(' ')]\n(x2,y2) = [int(x) for x in input().split(' ')]\n\ndx = abs(x1-x2)\ndy = abs(y1-y2)\n\nmn = min(dx, dy)\nmx = max(dx, dy)\nprint(mn + (mx-mn))\n", "x1, y1 = [int(x) for x in input().split()]\r\nx2, y2 = [int(x) for x in input().split()]\r\nprint(max(abs(x1 - x2), abs(y1 - y2)))", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nif(abs(x2-x1)==abs(y2-y1)):\r\n\tprint(abs(x2-x1))\r\nelse:\r\n\tprint(max(abs(x2-x1),abs(y2-y1)))", "a,b = input().split()\r\n\r\nc,d = input().split()\r\n\r\nx1 = int(a)\r\nx2 = int(c)\r\n\r\ny1 = int(b)\r\ny2 = int(d)\r\n\r\ndiffx = abs(x1 - x2)\r\ndiffy = abs(y1 - y2)\r\n\r\nm1 = min(diffx,diffy)\r\nm2 = max(diffx,diffy)\r\n\r\nsteps = m1 + abs(diffx - diffy)\r\nprint(steps)", "x1, y1 = map(int,input().split())\nx2, y2 = map(int,input().split())\n\nprint(min((abs(x1 - x2)),(abs(y1-y2))) + (abs((abs(x1 - x2))-abs((y1-y2)))))\n\n\n\n\n\n\n\n' این همه تلاش برای رسیدن به فرمول بالا'\n\n'''\nif y1 > y2: #down\n if x1 == x2:\n print(y1-y2)\n elif x1 > x2: #left\n print(min((x1 - x2),(y1-y2)) + (abs((x1 - x2)-(y1-y2))))\n else: # right\n pass\nelif y2 > y1: #Top\n if x1 == x2:\n print(y2-y1)\n elif x1 > x2: #left\n pass\n else: #right\n pass\nelse:\n print(abs(x1-x2))\n'''", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\nmi = min(abs(x1 - x2), abs(y1 - y2))\r\nma = max(abs(x1 - x2), abs(y1 - y2))\r\nprint(mi + ma - mi)\r\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\nx = abs(x1 - x2)\r\ny = abs(y1 - y2)\r\n\r\nif x > y:\r\n x, y = y, x\r\nprint(x + (y - x))\r\n", "#professor robot\r\nx1,y1 = map(int,input().split())\r\nx2,y2 = map(int,input().split())\r\nprint(max(abs(x1-x2), abs(y1 - y2)))", "a,b=[int(i) for i in input().split()]\r\nc,d=[int(i) for i in input().split()]\r\nx=max(a,c)-min(a,c)\r\ny=max(b,d)-min(b,d)\r\nprint(max(x,y))", "x=input().split(' ')\r\ny=input().split(' ')\r\nprint(max(abs(int(x[0])-int(y[0])),abs(int(x[1])-int(y[1]))))\r\n", "x,y=map(int,input().split())\r\na,b=map(int,input().split())\r\nA=abs(x-a)\r\nB=abs(y-b)\r\nprint(max(A,B))", "a,b = map(int,input().split())\r\nm,n = map(int,input().split())\r\nz = min(abs(m-a),abs(n-b)) + abs(abs(m-a)-abs(n-b))\r\nprint(z)\r\n", "xf,yf=map(int,input().split())\r\n \r\nxe,ye=map(int,input().split())\r\n\r\nx = abs(xf-xe)\r\ny = abs(yf-ye)\r\n\r\n\r\nif x == y:\r\n print(x)\r\n\r\nif x > y:\r\n print(x) \r\nelif y>x:\r\n print(y)", "#!/bin/python3\r\n\r\nimport sys\r\nx,y = map(int, input().split())\r\nx1,y1 =map(int, input().split())\r\nprint(max(abs(x -x1), abs(y - y1)))\r\n", "xf, yf = input().split()\r\nxf, yf = int(xf), int(yf)\r\nxt, yt = input().split()\r\nxt, yt = int(xt), int(yt)\r\n\r\nprint(abs(xf-xt) + abs(yf-yt) - min(abs(xf-xt),abs(yf-yt)))", "x1,y1 = map(int,input().split(\" \"))\r\nx2,y2= map(int,input().split(\" \"))\r\ndifx = abs(x2-x1)\r\ndify = abs(y2-y1)\r\nprint(min(dify,difx) + abs(difx-dify) )", "# tested by Hightail - https://github.com/dj3500/hightail\r\nfrom sys import stdin, stdout\r\n\r\n\r\n#Start of Program\r\nx1, y1 = [int(x) for x in stdin.readline().rstrip().split()]\r\nx2, y2 = [int(x) for x in stdin.readline().rstrip().split()]\r\n\r\nmx = 0\r\n\r\nif x1 > x2:\r\n mx = x1 - x2\r\nelif x1 < x2:\r\n mx = x2 - x1\r\n \r\nmy = 0\r\n\r\nif y1 > y2:\r\n my = y1 - y2\r\nelif y1 < y2:\r\n my = y2 - y1\r\n \r\n\r\n#Print Output Result \r\nans = max(mx,my)\r\n \r\nstdout.write( str(ans) + \"\\n\" )", "[a,b] = map(int, input().split())\r\n[x,y] = map(int, input().split())\r\nc = abs(x-a)\r\nd = abs(y-b)\r\nn = max(c, d)\r\nprint(n)", "x1, y1 = map(int,input().split())\nx2, y2 = map(int,input().split())\nprint(max(abs(x1-x2),abs(y1-y2)))\n", "x,y=map(int,input().split())\nX,Y=map(int,input().split())\nprint(max(abs(X-x),abs(Y-y)))\n\t \t \t \t\t \t \t \t\t \t \t", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\nt = 0\r\n\r\nprint(max(abs(x2 - x1), abs(y2 - y1)))", "x1, y1 = input().split()\nx2, y2 = input().split()\nprint( max( abs( int( x1 ) - int( x2 ) ) , abs( int( y1 ) - int( y2 ) ) ) )\n", "[x1, y1] = map(int, input().split())\n[x2, y2] = map(int, input().split())\n\nrelativex = abs(x2 - x1)\nrelativey = abs(y2 - y1)\n\nprint(max(relativex, relativey))\n", "[x11, y11] = map(int, input().split())\r\n[x22, y22] = map(int, input().split())\r\nprint(max(abs(x11 - x22), abs(y11 - y22)))", "px, py = [int(i) for i in input().split()]\r\nx, y = [int(i) for i in input().split()]\r\nprint(min(abs(x - px), abs(y - py)) + max(abs(x - px), abs(y - py)) - min(abs(x - px), abs(y - py)))", "x, y = map(int, input().split())\r\nx1, y1 = map(int, input().split())\r\nprint(max(abs(x-x1), abs(y-y1)))\r\n", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nprint(max(abs(x1-x2),abs(y1-y2)))\r\n# My code says who am i\r\n# I want to burn and born at this way\r\n# In my eye there is not any things Except love ...\r\n", "I = lambda: map(int, input().split())\r\na1, b1 = I()\r\na2, b2 = I()\r\nprint(max(abs(a1 - a2), abs(b1 - b2)))", "x1, y1 = map(int , input().split())\r\nx2, y2 = map(int , input().split())\r\nans = max( abs(x1-x2) , abs(y1-y2) )\r\nprint(ans)", "x = [int(s) for s in input().split(' ')]\r\ny = [int(s) for s in input().split(' ')]\r\nans = max(abs(x[0] - y[0]), abs(x[1] - y[1]))\r\nprint(ans)", "class Solver() :\r\n\tdef __init__(self, x1, y1, x2, y2) :\r\n\t\tself.x1 = x1\t#use self compulsively\r\n\t\tself.y1 = y1\r\n\t\tself.x2 = x2\r\n\t\tself.y2 = y2\r\n\tdef do(self) :\r\n\t\td1 = abs(self.x1 - self.x2)\r\n\t\td2 = abs(self.y1 - self.y2)\r\n\t\td = max(d1, d2)\r\n\t\treturn d\r\n\r\nclass Inputer() :\r\n\tdef __init__(self) :\r\n\t\tself.sLine1 = input()\r\n\t\tself.sLine2 = input()\r\n\tdef do(self) :\r\n\t\tsSplit1 = self.sLine1.split()\r\n\t\tx1 = int(sSplit1[0])\r\n\t\ty1 = int(sSplit1[1])\r\n\t\tsSplit2 = self.sLine2.split()\r\n\t\tx2 = int(sSplit2[0])\r\n\t\ty2 = int(sSplit2[1])\r\n\t\treturn x1, y1, x2, y2\r\n\r\ninputer = Inputer()\r\nsolver = Solver(*inputer.do())\r\nprint(solver.do())\r\n", "w,h=map(int,input().split())\r\nu,a=map(int,input().split())\r\nprint(max(abs(w-u),abs(h-a)))", "[x1,y1] = map(int,input().split())\r\n[x2,y2] = map(int,input().split())\r\nx = abs (x1-x2)\r\ny = abs (y1-y2)\r\nprint (max(x,y))", "[x1, y1] = map (int, input ().split ())\n[x2, y2] = map (int, input ().split ())\nprint (max (abs (x2 - x1), abs (y2 - y1)))", "x1,y1=[int(i) for i in input().split()]\r\nx2,y2=[int(i) for i in input().split()]\r\nprint(max(abs(x1-x2),abs(y1-y2)))", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nprint(max(map(abs,[x1-x2,y2-y1])))\r\n", "args1 = input().split()\r\nargs2 = input().split()\r\nx1 = int(args1[0])\r\nx2 = int(args2[0])\r\ny1 = int(args1[1])\r\ny2 = int(args2[1])\r\nprint(max(abs(x1-x2), abs(y1-y2)))", "p1 = list(map(int,input().split()))\r\np2 = list(map(int,input().split()))\r\ndx = p1[0]-p2[0] if p1[0]>p2[0] else p2[0]-p1[0]\r\ndy = p1[1]-p2[1] if p1[1]>p2[1] else p2[1]-p1[1]\r\nprint(max(dx,dy))\r\n", "x,y = [int(x) for x in input().split()]\nxf,yf = [int(x) for x in input().split()]\n\nif xf>x:\n suma1=xf-x\nelse:\n suma1=x-xf\n \nif yf>y:\n suma2=yf-y\nelse:\n suma2=y-yf\n \n \nif suma1>suma2:\n pasos=suma1\nelse:\n pasos=suma2\n \nprint(pasos)", "\r\n\r\nx1,y1=(int(x)for x in input().split())\r\nx2,y2=(int(i)for i in input().split())\r\nprint (max(abs(x1-x2),abs(y1-y2)))", "a,b = map(int,input().split())\r\nx,y = map(int,input().split())\r\nprint( max( abs(a-x),abs(b-y) ) )", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nx1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nprint(max(abs(x1-x2),abs(y1-y2)))", "[x1,y1] = map(int, input().split())\r\n[x2,y2] = map(int, input().split())\r\n\r\nX = abs(x1-x2)\r\n\r\nY = abs(y1-y2)\r\n\r\nd = max(X,Y)\r\n\r\nprint(d)", "x1,y1=map(int,input().split(\" \"))\r\nx2,y2=map(int,input().split(\" \"))\r\na=abs(x1-x2)\r\nb=abs(y1-y2)\r\nprint(max(a,b))", "a,b = map(int, input().split())\r\nx,y = map(int, input().split())\r\nprint(max(abs(a-x),abs(b-y)))\r\n", "s=input()\r\ns=s.split()\r\nx1=int(s[0])\r\ny1=int(s[1])\r\ns=input()\r\ns=s.split()\r\nx2=int(s[0])\r\ny2=int(s[1])\r\nt1 = abs(x2-x1)\r\nt2=abs(y2-y1)\r\nprint(max(t1,t2))\r\n", "[a,b] = map(int, input().split())\r\n[c,d] = map(int, input().split())\r\nx=max(a-c,c-a)\r\ny=max(b-d,d-b)\r\nif x>y:\r\n print(x)\r\nelse:\r\n print(y)", "[x1, y1] = map(int, input().split())\n[x2, y2] = map(int, input().split())\n\na = abs(x2 - x1)\nb = abs(y2 - y1)\n\nprint(max(a, b))", "x1, y1 = [int(i) for i in input().split()]\r\nx2, y2 = [int(i) for i in input().split()]\r\nprint(max(abs(x1-x2), abs(y1-y2)))\r\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nlx = abs(x1 - x2)\r\nly = abs(y1 - y2)\r\nprint( max(lx, ly) )", "[x1, y1] = [int(x) for x in input().split()]\r\n[x2, y2] = [int(x) for x in input().split()]\r\nprint(max(abs(x1-x2), abs(y1-y2)))\r\n", "x,y = map(int,input().split())\r\na,b = map(int,input().split())\r\nprint(max(abs(x-a),abs(y-b)))", "x,y = map(int,input().split())\r\na,b = map(int,input().split())\r\ns = abs(x - a)\r\nr = abs(y - b)\r\nprint(max(s,r))", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\na=abs(x1-x2)\r\nb=abs(y1-y2)\r\nprint(min(a,b)+abs(a-b))", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\n\r\ns1=min(abs(x1-x2),abs(y1-y2))\r\ns2=abs(abs(x1-x2)-abs(y1-y2))\r\n\r\nprint(s1+s2)", "[x1,y1] = map(int,input().split())\r\n[x2,y2] = map(int,input().split())\r\nif abs(x1-x2)<=abs(y1-y2):\r\n d=abs(y1-y2)\r\nelse:\r\n d=abs(x1-x2)\r\nprint(d)", "if __name__ == \"__main__\":\n x1, y1 = [int(i) for i in input().split(\" \")]\n x2, y2 = [int(i) for i in input().split(\" \")]\n print(max([abs(x1 - x2), abs(y1 - y2)]))\n\n\n\n\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out1.out\",'w')\r\nx1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nprint(max(abs(x2-x1),abs(y2-y1)))\r\n", "#coding: utf-8\n\nstart = list(map(int, input().split()))\nend = list(map(int, input().split()))\n\nmaxdist = 0\n\nif abs(start[0] - end[0]) > maxdist:\n maxdist = abs(start[0] - end[0])\n\nif abs(start[1] - end[1]) > maxdist:\n maxdist = abs(start[1] - end[1])\n\nprint(maxdist)\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\nresult = max(abs(x1-x2), abs(y2-y1))\r\n\r\nprint(result)\r\n", "x,y = map(int, input().split())\r\na,b = map(int, input().split())\r\nresp = max(abs(x-a), abs(y-b))\r\nprint(resp)", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nprint(max(max(x1, x2) - min(x1, x2), max(y1, y2) - min(y1, y2)))", "x0, y0 = map(int,input().split())\r\nx1, y1 = map(int,input().split())\r\n\r\nX=abs(x1-x0)\r\nY=abs(y1-y0)\r\nprint(X+Y-min(X,Y))", "# Professer GukiZ's robot\n[x1,y1] = map(int,input().split())\n[x2,y2] = map(int,input().split())\nprint(max(abs(x1-x2),abs(y1-y2)))\n", "l=list(map(int,input().split()))\r\nx1,y1=l[0],l[1]\r\nl=list(map(int,input().split()))\r\nx2,y2=l[0],l[1]\r\ndx=abs(x2-x1)\r\ndy=abs(y2-y1)\r\nif(dx>dy):\r\n print(dx)\r\nelse:\r\n print(dy)\r\n\r\n", "w, h = map(int, input().split())\r\nu, a = map(int, input().split())\r\nprint(max(abs(w - u), abs(h - a)))", "[a,b] = map(int, input().split())\r\n[x,y] = map(int, input().split())\r\nd = abs(b-y)\r\nc = abs(a-x)\r\nq = max(c , d)\r\nprint(q)\r\n", "x,y=[int(n) for n in input().split()]\nx1,y1=[int(n) for n in input().split()]\nans=max(abs(x1-x),abs(y1-y))\nprint(ans)", "a,b = map(int,(input().split()))\r\nc,d = map(int,input().split())\r\ndef f(a,b,c,d):\r\n x = abs(a-c)\r\n y = abs(b-d)\r\n e = min(x,y)\r\n if e==x :\r\n print(e+min(abs(b+e-d),abs(b-e-d)))\r\n else:\r\n print(e+min(abs(a-e-c),abs(a+e-c)))\r\n \r\n \r\nf(a,b,c,d)", "[a, b] = map(int, input().split())\r\n[c, d] = map(int, input().split())\r\nr = abs(d - b)\r\nf = abs(c - a)\r\ns = max(r, f)\r\nprint (s)", "s1 = input().split()\r\ns2 = input().split()\r\n\r\nx1 = int(s1[0])\r\ny1 = int(s1[1])\r\nx2 = int(s2[0])\r\ny2 = int(s2[1])\r\n\r\ndx = abs(x2 - x1)\r\ndy = abs(y2 - y1)\r\n\r\nprint(max(dx, dy))\r\n\r\n", "x1,y1 = list(map(int,input().split()))\r\nx2,y2 = list(map(int,input().split()))\r\nsteps=0\r\nif x1 == x2 and y1 != y2:\r\n steps = abs(y1-y2)\r\nelif x1 != x2 and y1 == y2:\r\n steps = abs(x1-x2)\r\nelif x1 != x2 and y1 != y2:\r\n a=min(abs(x1-x2),abs(y1-y2))\r\n b=max(abs(x1-x2),abs(y1-y2))-a\r\n steps=a+b\r\nprint(steps)\r\n", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nprint(max(abs(x2-x1),abs(y2-y1)))", "x1, y1 = map(int, input().split())\nx2, y2 = map(int, input().split())\nx, y = abs(x1- x2), abs(y1 - y2)\nif (x > y): print(x)\nelse: print(y)\n\t\t \t \t\t\t\t\t \t\t \t \t \t\t", "x1,y1=list(map(int,input().split()))\r\nx2,y2=list(map(int,input().split()))\r\nt=[abs(x2-x1),abs(y2-y1)]\r\nprint(max(t))", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nprint(max(abs(x2-x1), abs(y2-y1)))", "a,b=input().split()\nc,d=input().split()\na=int(a)\nb=int(b)\nc=int(c)\nd=int(d)\n\nprint(max(abs(c-a), abs(d-b)))\n\t \t \t\t \t\t \t\t \t\t \t\t", "x1,y1 = (int(i) for i in input().split())\nx2,y2 = (int(i) for i in input().split())\nans = 0\nwx = abs(x1-x2)\nwy = abs(y1-y2)\nfirstway = min(abs(x1-x2),abs(y1-y2))\nans+=firstway\nwx -= firstway\nwy -= firstway\nans+=wx+wy\nprint(ans)\n", "def solve():\r\n x1, y1 = map(int, input().split())\r\n x2, y2 = map(int, input().split())\r\n \r\n print(max(abs(x1 - x2), abs(y1 - y2)))\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "x1,y1=map(int,input().split())\nx2,y2=map(int,input().split())\np=0\na=[x1,x2]\nb=[y1,y2]\na.sort()\nb.sort()\nc=a[1]-a[0]\nd=b[1]-b[0]\nif c<d:\n\td-=c\n\tp=p+c+d\nelif d<c:\n\tc-=d\n\tp=p+c+d\nelse:\n\tp=d\nprint (p)\n\t\n\n# 1481128231543", "a,b = map(int,input().split())\nc,d = map(int,input().split())\n\nx=abs(a-c)\ny=abs(b-d)\n\nvalor = max(x,y)\nprint(valor)", "x1, y1 = input().split()\r\nx2, y2 = input().split()\r\nx1=int(x1)\r\nx2=int(x2)\r\ny1=int(y1)\r\ny2=int(y2)\r\nxd = abs(x1-x2)\r\nyd = abs(y1-y2)\r\nprint(max(xd,yd))\r\n\r\n", "string = input()\r\nnumbers = string.split()\r\nx1, y1 = int(numbers[0]), int(numbers[1])\r\nstring = input()\r\nnumbers = string.split()\r\nx2, y2 = int(numbers[0]), int(numbers[1])\r\na = abs(x1 - x2)\r\nb = abs(y1 - y2)\r\nprint(max([a, b]))", "a,b=map(int,input().split())\r\na1,b1=map(int,input().split())\r\nt=0\r\nk=abs(a-a1)\r\nt=abs(a-a1)\r\nk2=abs(b-b1)\r\nif k2-t<=0 :\r\n k2=0\r\nelse :\r\n k2=k2-t\r\nprint(k2+k)\r\n", "x1, y1 = [int(x) for x in input().split()]\nx2, y2 = [int(x) for x in input().split()]\ndx, dy = abs(x2 - x1), abs(y2 - y1)\nprint(dx + dy - min(dx, dy))\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nm1 = min(abs(x1-x2), abs(y1-y2))\r\nm2 = max(abs(x1-x2), abs(y1-y2))\r\nprint(m2)\r\n", "x1,y1 = map(int,input().split())\r\nx2,y2 = map(int,input().split())\r\nx = abs(x1-x2)\r\ny = abs(y1-y2)\r\nb = max(x,y)\r\nprint(b)", "\r\ninp1= input()\r\ninp2= input()\r\n\r\ns=inp1.split(\" \")\r\nd=inp2.split(\" \")\r\ns1=int(s[0]) - int(d[0])\r\ns2=int(s[1]) - int(d[1])\r\n\r\ns1 = abs(s1)\r\ns2 = abs(s2)\r\nif(s1>s2):\r\n print(s1)\r\nelif(s1<s2):\r\n print(s2)\r\nelse :\r\n print(s1)", "x1,y1 = list(map(int,input().split()))\r\nx2,y2 = list(map(int,input().split()))\r\n\r\nprint(max(abs(y1-y2),abs(x2-x1)))", "x1,y1= map(int,input().split(' '))\r\nx2,y2= map(int,input().split(' '))\r\nk= abs(abs(x1-x2)-abs(y1-y2)) + min(abs(x1-x2),abs(y1-y2))\r\nprint(k)\r\n", "def main():\r\n\t(x1, y1) = input().split()\r\n\t(x1, y1) = (int(x1), int(y1))\r\n\t(x2, y2) = input().split()\r\n\t(x2, y2) = (int(x2), int(y2))\r\n\t#(x1, y1, x2, y2) = (3, 4, 6, 1)\r\n\tresult = max(abs(x1 - x2), abs(y1 - y2))\r\n\tprint(result)\r\n\r\nmain()", "x1, y1 = list(map(int,input().split(\" \")))\r\nx2, y2 = list(map(int,input().split(\" \")))\r\ndx = abs(x1 - x2)\r\ndy = abs(y1 - y2)\r\nprint(max(dx, dy))\r\n", "if __name__ == '__main__':\r\n iX, iY = map(int, input().split(' '))\r\n fX, fY = map(int, input().split(' '))\r\n\r\n print(max(abs(iX - fX), abs(iY - fY)))\r\n # count = 0\r\n # dif = 0\r\n\r\n # if iY < fY and fX > iX:\r\n # dif = fX - iX\r\n # iY += dif\r\n # dif += fY - iY\r\n \r\n # elif iY > fY and fX > iX:\r\n # dif = iY - fY\r\n # iX += dif\r\n # dif += fX - iX\r\n \r\n # elif iY < fY and fX < iX:\r\n # dif = iY - fY\r\n # dif = fX - iX\r\n # dif *= -1 if dif < 0 else 1\r\n # print(dif)\r\n # iY += -1 * dif\r\n # dif += fY - iY\r\n\r\n # elif iY > fY and fX < iX:\r\n # iX += -1 * dif\r\n # dif += fX - iX\r\n", "x, y = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nprint(max(max(x, x2)-min(x, x2), (max(y, y2)-min(y, y2))))", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nx = abs(x2 - x1)\r\ny = abs(y2 - y1)\r\nans = min(x,y)\r\nm = x\r\nx = x - min(x,y)\r\ny = y - min(m,y)\r\nans = ans + x + y\r\nprint(ans)", "x1, y1 = list(map(int, input().split()))\r\nx2, y2 = list(map(int, input().split()))\r\nprint(max(abs(x2 - x1),abs(y2 - y1)))", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nans=0\r\nif abs(y1-y2)<abs(x1-x2):\r\n ans+=abs(y1-y2)\r\n if x1<x2:\r\n x1+=ans\r\n else:\r\n x1-=ans\r\n ans+=abs(x1-x2)\r\nelse:\r\n ans+=abs(x1-x2)\r\n if y1<y2:\r\n y1+=ans\r\n else:\r\n y1-=ans\r\n ans+=abs(y1-y2)\r\nprint(ans)\r\n", "a, b = [int(x) for x in input().split()]\r\nc, d = [int(x) for x in input().split()]\r\ndx = abs(a - c)\r\ndy = abs(b - d)\r\nprint(max(dx, dy))", "fir=input().split()\r\nsec=input().split()\r\nfir[0]=int(fir[0])\r\nfir[1]=int(fir[1])\r\nsec[0]=int(sec[0])\r\nsec[1]=int(sec[1])\r\nxchange=abs(fir[0]-sec[0])\r\nychange=abs(fir[1]-sec[1])\r\nprint(max(xchange,ychange))\r\n", "[x_1,y_1] = [int(i) for i in input().split()]\r\n[x_2,y_2] = [int(i) for i in input().split()]\r\n\r\nprint(max(abs(x_1-x_2),abs(y_1-y_2)))\r\n", "x1, y1 = tuple(map(int, input().split()))\nx2, y2 = tuple(map(int, input().split()))\n\ndx, dy = abs(x2-x1), abs(y2-y1)\n\nprint(min(dx, dy) + max(dx, dy) - min(dx, dy))\n", "x1,y1=(int(i) for i in input().split())\r\nx2,y2=(int(i) for i in input().split())\r\nprint (max(abs(x1-x2),abs(y1-y2)))", "a,b=map(int,input().split())\r\nc,d=map(int,input().split())\r\nm= max( abs(a-c),abs(b-d))\r\nprint(m)", "\r\nfrom math import *\r\n\r\nsx, sy = map(int, input().split())\r\ntx, ty = map(int, input().split())\r\nprint(max(abs(sx - tx), abs(sy - ty)))", "a,b=map(int,input().split())\r\nc,d=map(int,input().split())\r\ns=max(abs(c-a),abs(d-b))\r\nprint(s)\r\n", "x1,y1=list(map(int,input().split()))\r\nx2,y2=list(map(int,input().split()))\r\n\r\nprint(max(abs(x2-x1),abs(y2-y1)))\r\n", "[a,b]=map(int, input().split())\r\n[c,d]=map(int, input().split())\r\nx=abs(c-a)\r\ny=abs(d-b)\r\nprint (abs(max(x,y)))", "a = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nx1, y1 = a\r\n\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nx2, y2 = a\r\n\r\nprint(max(abs(x1-x2), abs(y1-y2)))", "'''\r\n##======================================================================================================================================##\r\n ## _____ _ _ _ _____ _ _ _ _ _____ _____ ____ ___ ____ ___ ##\r\n ## | / \\ | \\ / | | | | |\\ | | | | | | | | \\ | | | ##\r\n ## |_____ / \\ | \\/ | |_____ | | | \\ | | __ --- |_____ |____| | | | |___ |___| ##\r\n ## | / \\ | | | | | | \\ | | | | | | | | | | \\ ##\r\n ## _____| / \\ | | _____| \\ __ / | \\| |_____| _____| | | |___/ |____ | \\ ##\r\n##======================================================================================================================================##\r\n------------------------------Samsung_Spider------------------------------\r\n'''\r\nrx, ry = map(int, input().split())\r\nx, y = map(int, input().split())\r\nprint(min(abs(x - rx), abs(y - ry)) + abs(abs(x - rx) - abs(y - ry)))", "def main():\n x, y = map(int, input().split())\n u, v = map(int, input().split())\n print(max(abs(x - u), abs(y - v)))\n\n\nif __name__ == '__main__':\n main()\n", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\n\r\ndx=abs(x1-x2)\r\ndy=abs(y1-y2)\r\n\r\nprint(max(dx,dy))", "def main():\r\n x1, y1 = list(map(int, input().split()))\r\n x2, y2 = list(map(int, input().split()))\r\n\r\n delta_x, delta_y = abs(x1 - x2), abs(y1 - y2)\r\n print(max(delta_x, delta_y))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a,b=[int(x) for x in input().split()]\r\nc,d=[int(x) for x in input().split()]\r\nprint(max(abs(c-a),abs(d-b)))", "a, b = map(int, input().split())\r\nc, d = map(int, input().split())\r\ne, f = abs(a-c), abs(b-d)\r\nprint(int(max(e, f)))", "x1, y1 = list(map(int, input().split()))\r\nx2, y2 = list(map(int, input().split()))\r\n\r\na = abs(abs(x1-x2) - abs(y1-y2))\r\nb = abs(abs(x1-x2) + abs(y1-y2))\r\nprint(a + abs(b-a)//2)\r\n", "x1,y1 = map(int,input().split())\r\nx2,y2 = map(int,input().split())\r\nprint(max(abs(x2-x1),abs(y2-y1)))", "x1,y1 = map(int,input().split())\r\nx2,y2 = map(int,input().split())\r\n\r\nminn = min(abs(x1-x2),abs(y1-y2))\r\na1,b1 = x1+minn,y1+minn\r\na2,b2 = x1-minn,y1+minn\r\na3,b3 = x1-minn,y1-minn\r\na4,b4 = x1+minn,y1-minn\r\n\r\nans = abs(x2-a1)+abs(y2-b1)\r\nans = min(ans,abs(x2-a2)+abs(y2-b2))\r\nans = min(ans,abs(x2-a3)+abs(y2-b3))\r\nans = min(ans,abs(x2-a4)+abs(y2-b4))\r\n\r\nprint(ans+minn)", "x,y=map(int,input().split())\r\nm,n=map(int,input().split())\r\na=abs(m-x)\r\nb=abs(n-y)\r\nprint(max(a,b))", "x1=list(map(int,input().split()))\r\nf1=list(map(int,input().split()))\r\nn1=f1[0]-x1[0]\r\nn2=f1[1]-x1[1]\r\nprint(max(abs(n1),abs(n2)))", "s = input().split()\r\ne = input().split()\r\nx_1 = int(s[0])\r\ny_1 = int(s[1])\r\nx_2 = int(e[0])\r\ny_2 = int(e[1])\r\n\r\nif abs(x_1 - x_2) == abs(y_1 - y_2):\r\n print(abs(x_1 - x_2))\r\nelif abs(x_1 - x_2) < abs(y_1 - y_2):\r\n print(abs(y_1 - y_2))\r\nelse:\r\n print(abs(x_1 - x_2))", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\naux=max(x1-x2,x2-x1)\r\naux2=max(y1-y2,y2-y1)\r\nprint(max(aux,aux2))", "x1,y1=input().split()\r\nx2,y2=input().split()\r\na=abs(int(x1)-int(x2))\r\nb=abs(int(y1)-int(y2))\r\nif a<b:\r\n print(b)\r\nelif a==b:\r\n print(a)\r\n\r\nelse:\r\n print(a) \r\n \r\n", "a, b = map(int, input().split(' '))\nc, d = map(int, input().split(' '))\nx, y = abs(c - a), abs(d - b)\nif x >= y:\n print(x)\nelse:\n print(y)\n\t\t \t\t \t\t\t\t\t \t\t\t\t\t \t", "\r\nx,y=list(map(int,input().split()))\r\nx1,y1=list(map(int,input().split()))\r\nprint(max(abs(x-x1),abs(y-y1)))", "x1,y1=map(int,input().split(' '))\r\nx2,y2=map(int,input().split(' '))\r\nprint (max(abs(x1-x2),abs(y1-y2)))", "# coding=utf8\r\n\r\nif __name__ == '__main__':\r\n loc_src = str(input()).split()\r\n loc_tar = str(input()).split()\r\n print(max([abs(int(it_src) - int(it_tar)) for it_src, it_tar in zip(loc_src, loc_tar)]))\r\n", "a, b = map(int,input().split())\r\nc, d = map(int, input().split())\r\nm = max(abs(c - a), abs(d - b))\r\nprint(m)", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nd1=abs(x2-x1)\r\nd2=abs(y2-y1)\r\ns=min(d1,d2)\r\ns=s+max(d1,d2)-min(d1,d2)\r\nprint(s)", "#A\r\n\r\nxi, yi = map(int,input().split())\r\nxf, yf = map(int, input().split())\r\nxf = abs(xf-xi)\r\nyf = abs(yf-yi)\r\nsteps = 0\r\nif xf == yf:\r\n steps += xf\r\nelif xf == 0:\r\n steps += yf\r\nelif yf == 0:\r\n steps += xf\r\nelse:\r\n reduce = min(xf,yf)\r\n steps += reduce\r\n steps += (max(xf,yf) - reduce)\r\nprint(steps)", "rx, ry = map(int, input().split()); x, y = map(int, input().split())\r\nprint(min(abs(x - rx), abs(y - ry)) + abs(abs(x - rx) - abs(y - ry)))", "x1,y1 = map(int, input().split())\nx2,y2 = map(int, input().split())\nmin_x = int(abs(x2 - x1))\nmin_y = int(abs(y2 - y1))\nsteps = max(min_x,min_y)\nprint(steps)\n\t\t \t\t \t\t \t\t\t \t \t \t \t\t", "a, b = map(int, input().split())\r\nc, d = map(int, input().split())\r\nprint(max(abs(a-c),abs(b-d)))\r\n", "x1,y1 = map(int,input().split())\r\nx2,y2 = map(int,input().split())\r\nprint(max(abs(x1-x2),abs(y1-y2)))\r\n", "#!/usr/bin/env python3\r\n\r\nx1, y1 = list([int(x) for x in input().split()])\r\nx2, y2 = list([int(x) for x in input().split()])\r\nx = abs(x2 - x1)\r\ny = abs(y2 - y1)\r\nprint(max(x,y))\r\n", "[x1,y1] = map(int, input().split())\r\n[x2,y2] = map(int, input().split())\r\ndistanceX = abs(x1-x2)\r\ndistanceY = abs(y1-y2)\r\nprint(min(distanceX,distanceY)+max(distanceX,distanceY)-min(distanceX, distanceY))", "# Professer GukiZ's robot\n[x1,y1] = map(int,input().split())\n[x2,y2] = map(int,input().split())\nif abs(x1-x2) >= abs(y1-y2):\n print(abs(x1-x2))\nelse:\n print(abs(y1-y2))\n", "import sys\r\n\r\ndef main():\r\n x1, y1, x2, y2 = map(int, sys.stdin.read().strip().split())\r\n d1, d2 = abs(x1 - x2), abs(y1 - y2)\r\n return min(d1, d2) + abs(d1 - d2)\r\n \r\nprint(main())\r\n", "a,b = list(map(int, input().split()))\r\nx,y = list(map(int, input().split()))\r\n\r\nif abs(x-a) < abs(y-b):\r\n dist = abs(x-a)\r\n dist += abs(y - b) - dist\r\nelse:\r\n dist = abs(y-b)\r\n dist += abs(x - a) - dist\r\nprint(dist)\r\n", "[a, b] = map(int, input().split())\n[c, d] = map(int, input().split())\nmax = max(abs(c - a), abs(b - d))\nprint(max)\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\nx, y = abs(x1-x2), abs(y1-y2)\r\n\r\nprint(max(x, y))\r\n", "a,b=[int(x)for x in input().split()]\nx,y=[int(x)for x in input().split()]\nprint(max(abs(a-x),abs(b-y)))", "a, b = input().split( )\r\nx1 = int(a)\r\ny1 = int(b)\r\na, b = input().split( )\r\nx2 = int(a)\r\ny2 = int(b)\r\n\r\ngap_x = abs(x2 - x1)\r\ngap_y = abs(y2 - y1)\r\n\r\nif gap_x < gap_y:\r\n\tans = gap_x + gap_y - gap_x\r\nelse:\r\n\tans = gap_y + gap_x - gap_y\r\n\r\nprint (ans)\r\n", "x,y=map(int,input().split(' '))\r\na,b=map(int,input().split(' '))\r\nprint(max(abs(x-a),abs(b-y)))", "x, y = map(int, input().split())\r\nX, Y = map(int, input().split())\r\nprint(max(abs(x-X),abs(y-Y)))\r\n", "a,b=map(int,input().split())\r\nc,d=map(int,input().split())\r\nx=abs(a-c)\r\ny=abs(b-d)\r\nprint(max(x,y))\r\n", "x0,y0 = map(int,input().split())\r\nx1,y1 = map(int,input().split())\r\n\r\nprint(max(abs(x0-x1),abs(y0-y1)))", "[w, x] = map(int,input().split())\r\n[y, z] = map(int,input().split())\r\ndx = abs(y - w)\r\ndy = abs(z - x)\r\nif(dy > dx):\r\n print (abs(dx + (dy - dx)))\r\nif(dy < dx):\r\n print(abs(dy + (dx - dy)))\r\nif(dx == dy):\r\n print (abs(dx))\r\n", "a = list(map(int, input().split()))\nb = list(map(int, input().split()))\nprint(max(abs(b[0] - a[0]), abs(b[1] - a[1])))", "X = list(map(int, input().split()))\r\nY = list(map(int, input().split()))\r\nprint(max(abs(X[0] - Y[0]), abs(X[1] - Y[1])))\r\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\nprint(max(abs(x1-x2), abs(y1-y2)))\r\n", "# import sys \r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"OUTPUX.out\",\"w\")\r\nx1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\ndiff1,diff2=abs(x1-x2),abs(y2-y1)\r\nif diff1<diff2:\r\n\tdiff1,diff2=diff2,diff1\r\nprint(diff1-diff2+diff2)\r\n\r\n\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 x, y = IA()\r\n x2, y2 = IA()\r\n return max(abs(x-x2), abs(y-y2))\r\n \r\n\r\nif __name__ == '__main__':\r\n print(main())", "[x1,y1] = list(map(int,input().split(\" \")))\r\n[x2,y2] = list(map(int,input().split(\" \")))\r\nprint(max(abs(x1-x2),abs(y1-y2)))\r\n", "x1,y1 = map(int,input().split())\nx2,y2 = map(int,input().split())\nX = abs(x1-x2)\nT = abs(y1-y2)\nprint(max(X,T))", "x1,y1=list(map(int,input().split()))\r\nx2,y2=list(map(int,input().split()))\r\np=abs(x1-x2)\r\nq=abs(y1-y2)\r\nif(p>=q):\r\n print(p)\r\nelse:\r\n print(q)\r\n", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\na=b=0\r\nif x1>x2:\r\n\ta=x1-x2\r\nelse:\r\n\ta=x2-x1\r\nif y1>y2:\r\n\tb=y1-y2\r\nelse:\r\n\tb=y2-y1\r\nprint(max(a,b))", "from math import *\r\nstart = list(map(int, input().split()))\r\nfinish = list(map(int, input().split()))\r\nx = abs(start[0] - finish[0])\r\ny = abs(start[1] - finish[1])\r\nif x > y:\r\n print(x)\r\nelse:\r\n print(y)\r\n", "x1, y1=map(int, input().split())\r\nx2, y2=map(int, input().split())\r\n\r\nx=abs(x2-x1);y=abs(y2-y1)\r\nprint(max(x, y))", "a, b = map(int, input().split())\r\nc, d = map(int, input().split())\r\nprint(max(abs(a - c), (abs(d - b))))\r\n", "i = list(map(int,input().split()))\nf = list(map(int,input().split()))\nx = abs(i[0] - f[0])\ny = abs(i[1] - f[1])\nprint(max(x,y))\n\t\t\t \t\t\t \t\t \t \t \t\t \t\t\t \t \t\t", "x1, y1 = [int(x) for x in input().split()]\nx2, y2 = [int(x) for x in input().split()]\nr = 0\nif abs(x1-x2)<abs(y1-y2):\n r += abs(x1-x2) + (abs(y1-y2)-abs(x1-x2))\nelif abs(x1-x2)>abs(y1-y2):\n r += abs(y1-y2) + (abs(x1-x2)-abs(y1-y2))\nelse:\n r += abs(x1-x2)\nprint(r)\n# 1512576885703\n", "x,y=map(int,input().split())\r\nx1,y1=map(int,input().split())\r\nprint(max(abs(x-x1),abs(y-y1)))\r\n", "a, b=map(int, input().split())\r\nc, d=map(int, input().split())\r\n\r\ng=abs(c-a)\r\nh=abs(d-b)\r\nx=max(g, h)\r\ny=min(g, h)\r\nz=abs(x-y)\r\nif g==h:\r\n print(g)\r\nelse:\r\n print(y+z)", "a,b=map(int,input().split())\r\nx,y=map(int,input().split())\r\na=a-x\r\nif a<0:\r\n\ta*=-1\r\nb=b-y\r\nif b<0:\r\n\tb*=-1\r\nprint(max(a,b))\r\n", "xy1 = list(map(int, input().split()))\r\nxy2 = list(map(int, input().split()))\r\nprint(max(abs(xy2[0] - xy1[0]), abs(xy2[1] - xy1[1])))", "a,b=map(int,input().split())\r\nc,d=map(int,input().split())\r\nr= max( abs(a-c),abs(b-d))\r\nprint(r)", "[a, b] = map(int, input().split())\r\n[c, d] = map(int, input().split())\r\n\r\nx = abs (a-c)\r\ny = abs (b-d)\r\n\r\ns = max(x, y)\r\n\r\nprint (s)", "\r\nx2,y2=map(int,input().split())\r\nx1,y1=map(int,input().split())\r\n\r\nm=min(abs(x1-x2),abs(y2-y1) )\r\nd=max(abs(x1-x2),abs(y2-y1) )\r\nans = m+d-m\r\nprint(ans )\r\n", "x,y=map(int,input().split())\r\n\r\na,b=map(int,input().split())\r\n\r\nprint(max(abs(x-a),abs(y-b)))", "# for testCase in range(int(input())):\nx ,y = map(int ,input().split())\nx1 ,y1 = map(int ,input().split())\nx = abs(x-x1)\ny = abs(y-y1)\nprint(min(x ,y)+abs(x-y))\n", "#!/usr/bin/python3\n\nx1, y1 = map(int,input().split())\nx2, y2 = map(int,input().split())\nprint(max((max(x1,x2)-min(x1,x2)),(max(y1,y2)-min(y1,y2))))\n\n", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nx = abs(x2-x1)\r\ny = abs(y2-y1)\r\nprint(max(x,y))", "a,b=map(int,input().split())\r\nc,d=map(int,input().split())\r\n\r\nt1=abs(a-c)\r\nt2=abs(b-d)\r\nprint(max(t1,t2))\r\n", "import math\nx1,y1 = (int(i) for i in input().split())\nx2,y2 = (int(i) for i in input().split())\ns = 0\nmax = 0\nif (math.fabs(x2-x1)>math.fabs(y2-y1)):\n max = int(math.fabs(y2-y1))\nelse:\n max = int(math.fabs(x2-x1))\ns+=max\nif (x1>x2):\n x1-=max\nelse:\n x1+=max\nif (y1>y2):\n y1-=max\nelse:\n y1+=max\nif (x1!=x2):\n max = math.fabs(x1-x2)\n max = int(max)\n s+=max\nif (y1!=y2):\n max = math.fabs(y1-y2)\n max = int(max)\n s+=max\nprint(s)", "a,b=map(int,input().split());c,d=map(int,input().split());print(max(abs(d-b),abs(c-a)))", "a, b = map(int, input().split())\r\nc, d = map(int, input().split())\r\nans = max(abs(a - c), abs(b - d))\r\n\r\nprint(ans)", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nprint(max(abs(x1-x2),abs(y1-y2)))", "x1, y1 = [int(t) for t in input().split()]\r\nx2, y2 = [int(t) for t in input().split()]\r\n\r\ndx = abs(x2 - x1)\r\ndy = abs(y2 - y1)\r\n\r\nprint(max(dx, dy))\r\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nz1, z2 = abs(x1 - x2), abs(y1 - y2)\r\nprint(max(z1, z2))\r\n", "x1,y1=input().split()\r\nx2,y2=input().split()\r\nx1=int(x1)\r\ny1=int(y1)\r\nx2=int(x2)\r\ny2=int(y2)\r\nprint(max(abs(y2-y1),abs(x2-x1)))", "x,y=map(int,input().split())\r\na,b=map(int,input().split())\r\ns=abs(x-a)\r\ne=abs(y-b)\r\nprint(max(s,e))\r\n\r\n", "# A. Professor GukiZ's Robot\n\nx1, y1 = map(int, input().split())\nx2, y2 = map(int, input().split())\n\nx_diff = abs(x1 - x2)\ny_diff = abs(y1 - y2)\n\nans = min(x_diff, y_diff) + abs(x_diff - y_diff)\nprint(ans)\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nx1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\nf = abs(x1 - x2)\r\ns = abs(y1 - y2)\r\n\r\nprint(max(f, s))", "# https://codeforces.com/problemset/problem/620/A\r\n\r\nx1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\nprint(max(abs(x1 - x2), abs(y1 - y2)))\r\n", "x1, y1 = list(map(int, input().split()))\r\nx2, y2 = list(map(int, input().split()))\r\nprint(max(abs(x1 - x2), abs(y1 - y2)))", "from math import *\r\n\r\ns1 , s2 = input().split()\r\n\r\nx1 = int(s1)\r\ny1 = int(s2)\r\n\r\ns1 , s2 = input().split()\r\n\r\nx2 = int(s1)\r\ny2 = int(s2)\r\n\r\n\r\n\r\n\r\nprint ( max ( abs(x1-x2) , abs(y1-y2) ))\r\n", "x1, y1 = list(map(int, input().split()))\r\nx2, y2 = list(map(int, input().split()))\r\nx_change, y_change, ans = 0, 0, 0\r\n\r\nif x2 > x1: x_change = 1\r\nelif x2 < x1: x_change = -1\r\nelse: x_change = 0\r\n\r\nif y2 > y1: y_change = 1\r\nelif y2 < y1: y_change = -1\r\nelse: y_change = 0\r\n\r\nif abs(x2 - x1) <= abs(y2 - y1):\r\n\tnew_y = y1 + y_change*abs(x2 - x1)\r\n\tans = abs(x2- x1) + abs(new_y - y2)\r\nelse:\r\n\tnew_x = x1 + x_change*abs(y2 - y1)\r\n\tans = abs(y2- y1) + abs(new_x - x2)\r\nprint(ans)", "[x1,y1]=map(int,input().split())\r\n[x2,y2]=map(int,input().split())\r\ndx=abs(x2-x1)\r\ndy=abs(y2-y1)\r\nz=max(dx,dy)\r\nprint(z)", "x,y=list(map(int,input().split()))\r\nx1,y1=list(map(int,input().split()))\r\na=abs(x-x1)\r\nb=abs(y-y1)\r\nif(a>=b):\r\n print(a)\r\nelse:\r\n print(b) \r\n\r\n", "a,b=map(int,input().split())\r\nc,d=map(int,input().split())\r\nma= max( abs(a-c),abs(b-d))\r\nprint(ma)", "x,y = map(int,input().split())\r\nx1,y1 = map(int,input().split())\r\n\r\nprint(max(abs(x-x1),abs(y-y1)))", "[x1, y1] = map(int, input().split()) \r\n[x2, y2] = map(int, input().split())\r\nxdiff = abs(x2 - x1)\r\nydiff = abs(y2 - y1)\r\nif xdiff >= ydiff:\r\n print(xdiff)\r\nelse:\r\n print(ydiff)\r\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nprint(max(abs(x1 - x2), abs(y2 - y1)))\r\n", "x,y = map(int, input().split())\nxx,yy = map(int, input().split())\ndx = abs(xx-x)\ndy = abs(yy-y)\nprint(min(dx,dy) + abs(dx-dy))\n", "a,b = list(map(int, input().split()))\r\nx,y = list(map(int, input().split()))\r\n\r\nprint(max( abs(x-a),abs(y-b) ))", "a,b = [int(i) for i in input().split()]\r\nc,d = [int(i) for i in input().split()]\r\nprint(max(abs(a-c),abs(b-d)))\r\n", "x, y = map(int, input().split())\na, b = map(int, input().split())\nans = max(abs(x - a), abs(y - b))\nprint(ans)\n", "starting = input()\r\nstarting = starting.split()\r\nx1 = int(starting[0])\r\ny1 = int(starting[1])\r\n\r\nending = input()\r\nending = ending.split()\r\nx2 = int(ending[0])\r\ny2 = int(ending[1])\r\n\r\nx_diff = abs(x2-x1)\r\ny_diff = abs(y2-y1)\r\n\r\n#print (x_diff, y_diff)\r\n\r\nif x_diff<y_diff:\r\n\tans = y_diff\r\nelif y_diff<x_diff:\r\n\tans = x_diff\r\nelse:\r\n\tans = x_diff\r\n\t\r\nprint (ans)", "x, y = map(int, input().split())\r\nx1, y1 = map(int, input().split())\r\nprint(max(abs(x1 - x), abs(y1 - y)))", "print(max(abs(a-b)for a,b in zip(*[map(int,input().split())for _ in(1,2)])))", "a, b = map(int, input().split())\r\nx, y = map(int, input().split())\r\nprint(max(abs(x - a), abs(y - b)))", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nprint(max([abs(a[0]-b[0]),abs(a[1]-b[1])]))\r\n", "def robot_move(x, y, a, b):\r\n return max(abs(x - a), abs(y - b))\r\n \r\nx, y = map(int, input().split())\r\na, b = map(int, input().split())\r\nprint(robot_move(x, y, a, b))", "import sys\r\nx1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\ndif1 = abs(x1 - x2)\r\ndif2 = abs(y1 - y2)\r\nans = max(dif1, dif2)\r\nprint(ans)", "sx, sy = (int(el) for el in input().split())\r\nfx, fy = (int(el) for el in input().split())\r\nprint(max(abs(sx - fx), abs(sy - fy)))", "x1, y1 = map(int, input().split())\nx2, y2 = map(int, input().split())\nx_diff = abs(x2 - x1)\ny_diff = abs(y2 - y1)\n\nprint(max(x_diff, y_diff))\n", "a , b = [int(x) for x in input().split()]\r\nc , d = [int(x) for x in input().split()]\r\n\r\nxdiff = abs(a - c)\r\nydiff = abs(b - d)\r\n\r\nif (xdiff < ydiff):\r\n\tans = xdiff\r\n\tans = ans + (ydiff - xdiff)\r\nelse: \r\n\tans = ydiff\t\r\n\tans = ans + (xdiff - ydiff)\r\n\r\nprint(ans)\t\r\n", "R = lambda : map(int, input().split())\nx1,y1 = R()\nx2,y2 = R()\nd1 = abs(x1-x2)\nd2 = abs(y1-y2)\nprint(d1+d2-min(d1,d2))", "x1 , y1 = map(int , input().split())\r\nx2 , y2 = map(int , input().split())\r\nt = min(abs(x2 - x1) , abs(y2 - y1))\r\nif x1 < x2:\r\n x1 += t\r\nif x1 > x2:\r\n x1 -= t\r\nif y1 < y2:\r\n y1 += t\r\nif y1 > y2:\r\n y1 -= t\r\nprint(t + abs(x2 - x1) + abs(y2 - y1))\r\n\r\n \r\n", "x1, x2 = map(int, input().split())\r\nx3, x4 = map(int, input().split())\r\na = abs(x2 - x4)\r\nb = abs(x1 - x3)\r\nprint(max(a, b))", "x,y = map(int,input().split())\r\nx1,y1 = map(int,input().split())\r\nprint(max(abs(x1-x),abs(y1-y)))", "a,b=map(int,input().split())\r\nc,d=map(int,input().split())\r\ndiff=abs(a-c)\r\ndiff1=abs(b-d)\r\nif(diff1>diff):\r\n print(diff1)\r\nelse:\r\n print(diff)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/620/A\r\n\r\nx1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\n\r\nt = 0\r\n\r\nprint(max(abs(x2 - x1), abs(y2 - y1)))", "a, b = map(int, input().split())\nx, y = map(int, input().split())\nm, M = sorted([abs(a - x), abs(b - y)])\nprint(M)\n", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nd=abs(x1-x2)\r\ns=abs(y1-y2)\r\nc=min(d,s)\r\np=max(d,s)\r\nx=abs(c-p)\r\nprint(c+x)", "def solve():\r\n x1, y1 = map(int, input().split())\r\n x2, y2 = map(int, input().split())\r\n\r\n x_gap = abs(x1 - x2)\r\n y_gap = abs(y1 - y2)\r\n\r\n print(x_gap if x_gap > y_gap else y_gap)\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "x1, y1 = (int(i) for i in input().split())\nx2, y2 = (int(i) for i in input().split())\nres = max(abs(x2 - x1), abs(y2 - y1))\nprint(res)\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\tx1,y1=read_ints()\n\tx2,y2=read_ints()\n\tprint(max(abs(x1-x2), abs(y1-y2)))\n\nsolve()\n", "ans_x, ans_y = map(int, input().split())\r\nx, y = map(int, input().split())\r\n\r\nprint(max(abs(ans_x-x), abs(ans_y-y)))\r\n", "a,b=[int(i) for i in input().split()]\r\nc,d=[int(i) for i in input().split()]\r\nif abs(a-c)<abs(b-d):\r\n print(abs(a-c)+(abs(b-d)-abs(a-c)))\r\nelse:\r\n print(abs(b-d)+(abs(a-c)-abs(b-d)))", "from math import fabs\r\n\r\n\r\ndef max(a, b):\r\n return a if a > b else b\r\n\r\n\r\nx1, y1 = map(int, input().split(' '))\r\nx2, y2 = map(int, input().split(' '))\r\nmx = max(fabs(x2 - x1), fabs(y2 - y1))\r\nprint(int(mx))\r\n", "a,b=map(int,input().split())\r\nc,d=map(int,input().split())\r\nprint(max(abs(a-c),abs(b-d)))\r\n", "x1, y1 = map(int, input().split())\r\nx2, y2 = map(int, input().split())\r\nx = abs(x2 - x1)\r\ny = abs(y2 - y1)\r\nprint(min(x, y) + (x - min(x, y)) + (y - min(x, y))) \r\n", "x1,y1=map(int,input().split())\r\nx2,y2=map(int,input().split())\r\nprint(max(abs(y2-y1),abs(x2-x1)))", "[x,y] = map(int,input().split())\r\n[x2,y2] = map(int,input().split())\r\nprint(min(abs(x2-x),abs(y2-y))+abs(abs(x2-x)-abs(y2-y)))", "a=[int(x) for x in input().split()]\nx1=a[0]\ny1=a[1]\nb=[int(x) for x in input().split()]\nx2=b[0]\ny2=b[1]\nm=abs(y1-y2)\nn=abs(x1-x2)\nprint(max(m,n))" ]

[ "import math\r\nimport sys\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom functools import *\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom random import *\r\nfrom string import *\r\nfrom types import GeneratorType\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\n# endregion fastio\r\n\r\n# # region interactive\r\n# def printQry(a, b) -> None:\r\n# sa = str(a)\r\n# sb = str(b)\r\n# print(f\"? {sa} {sb}\", flush = True)\r\n\r\n# def printAns(ans) -> None:\r\n# s = str(ans)\r\n# print(f\"! {s}\", flush = True)\r\n# # endregion interactive\r\n\r\n# # region dfsconvert\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n# # endregion dfsconvert\r\n\r\n# MOD = 998244353\r\n# MOD = 10 ** 9 + 7\r\n# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))\r\n\r\ndef dfs(graph, start=0):\r\n n = len(graph)\r\n\r\n dfn = [-1] * n\r\n sz = [1] * n\r\n visited, finished = [False] * n, [False] * n\r\n time = n - 1\r\n\r\n stack = [start]\r\n while stack:\r\n start = stack[-1]\r\n\r\n # push unvisited children into stack\r\n if not visited[start]:\r\n visited[start] = True\r\n for child in graph[start]:\r\n if not visited[child]:\r\n stack.append(child)\r\n else:\r\n stack.pop()\r\n dfn[start] = time\r\n time -= 1\r\n\r\n # update with finished children\r\n for child in graph[start]:\r\n if finished[child]:\r\n sz[start] += sz[child]\r\n\r\n finished[start] = True\r\n\r\n return dfn, sz\r\n\r\nclass SegTree:\r\n def __init__(self, nums: list) -> None:\r\n n = len(nums)\r\n self.n = n\r\n self.tree = [0] * (4 * n)\r\n self.lazy = [0] * (4 * n)\r\n self.build(nums, 1, 1, n)\r\n \r\n def build(self, nums: list, o: int, l: int, r: int) -> None:\r\n if l == r:\r\n self.tree[o] = nums[l - 1]\r\n return\r\n\r\n m = (l + r) >> 1\r\n self.build(nums, o * 2, l, m)\r\n self.build(nums, o * 2 + 1, m + 1, r)\r\n self.pushUp(o)\r\n\r\n def xor(self, o: int, l: int, r: int) -> None:\r\n self.tree[o] = r - l + 1 - self.tree[o] # 异或反转\r\n self.lazy[o] ^= 1\r\n\r\n def do(self, o: int, l: int, r: int, val: int) -> None:\r\n self.tree[o] = r - l + 1 - self.tree[o] # 异或反转\r\n self.lazy[o] ^= 1\r\n\r\n def op(self, a: int, b: int) -> int:\r\n # + - * / max min\r\n return a + b\r\n \r\n def maintain(self, o: int, l: int, r: int) -> None:\r\n self.tree[o] = self.op(self.tree[l], self.tree[r])\r\n self.lazy[o] ^= 1\r\n\r\n def pushUp(self, o: int) -> None:\r\n self.tree[o] = self.tree[o * 2] + self.tree[o * 2 + 1]\r\n\r\n def pushDown(self, o: int, l: int, r: int) -> None:\r\n m = (l + r) >> 1\r\n self.do(o * 2, l, m, self.lazy[o]) # 调用相应的更新操作方法\r\n self.do(o * 2 + 1, m + 1, r, self.lazy[o])\r\n self.lazy[o] = 0\r\n\r\n def update(self, o: int, l: int, r: int, L: int, R: int, val: int) -> None:\r\n if L <= l and r <= R: # 当前区间已完全包含在更新区间，不需要继续往下更新，存在lazy\r\n self.xor(o, l, r)\r\n return\r\n\r\n if self.lazy[o]: # 当前lazyd存在更新，往下传递\r\n self.pushDown(o, l, r)\r\n\r\n m = (l + r) >> 1\r\n if m >= L: # 左节点在更新区间\r\n self.update(o * 2, l, m, L, R, val)\r\n if m < R: # 右节点在更新区间\r\n self.update(o * 2 + 1, m + 1, r, L, R, val)\r\n\r\n self.pushUp(o) # 从左右节点更新当前节点值\r\n\r\n def query(self, o: int, l: int, r: int, L: int, R: int) -> int:\r\n if R < l or L > r:\r\n return 0\r\n\r\n if L <= l and r <= R:\r\n return self.tree[o]\r\n\r\n if self.lazy[o]: # 当前lazyd存在更新，往下传递\r\n self.pushDown(o, l, r)\r\n\r\n m = (l + r) >> 1\r\n res = 0\r\n if m >= L: # 左节点在查询区间\r\n res += self.query(o * 2, l, m, L, R)\r\n if m < R: # 右节点在查询区间\r\n res += self.query(o * 2 + 1, m + 1, r, L, R)\r\n\r\n return res\r\n \r\ndef solve() -> None:\r\n n = sint()\r\n\r\n p = ints()\r\n # 建图\r\n g = [[] for _ in range(n)]\r\n for i, u in enumerate(p, 1):\r\n g[u - 1].append(i)\r\n\r\n # DFN序\r\n dfn, sz = dfs(g)\r\n # print(dfn)\r\n # print(sz)\r\n\r\n t = ints()\r\n nums = [0] * n\r\n for i, v in enumerate(t):\r\n nums[dfn[i]] = v\r\n # print(nums)\r\n st = SegTree(nums)\r\n\r\n for _ in range(sint()):\r\n qry = input().split()\r\n u = int(qry[1]) - 1\r\n if qry[0] == \"get\":\r\n print(st.query(1, 1, n, dfn[u] + 1, dfn[u] + sz[u]))\r\n else:\r\n st.update(1, 1, n, dfn[u] + 1, dfn[u] + sz[u], 1)\r\n\r\n# for _ in range(int(input())):\r\nsolve()", "class LazySegTree:\n def __init__(self, init_val, seg_ide, lazy_ide, f, g, h):\n self.n = len(init_val)\n self.num = 2**(self.n-1).bit_length()\n\n self.seg_ide = seg_ide\n self.lazy_ide = lazy_ide\n\n self.f = f #(seg, seg) -> seg\n self.g = g #(seg, lazy, size) -> seg\n self.h = h #(lazy, lazy) -> lazy\n\n self.seg = [seg_ide]*2*self.num\n for i in range(self.n):\n self.seg[i+self.num] = init_val[i]\n for i in range(self.num-1, 0, -1):\n self.seg[i] = self.f(self.seg[2*i], self.seg[2*i+1])\n\n self.size = [0]*2*self.num\n for i in range(self.n):\n self.size[i+self.num] = 1\n for i in range(self.num-1, 0, -1):\n self.size[i] = self.size[2*i] + self.size[2*i+1]\n\n self.lazy = [lazy_ide]*2*self.num\n\n def update(self, i, x):\n i += self.num\n self.seg[i] = x\n while i:\n i = i >> 1\n self.seg[i] = self.f(self.seg[2*i], self.seg[2*i+1])\n\n def calc(self, i):\n return self.g(self.seg[i], self.lazy[i], self.size[i])\n\n def calc_above(self, i):\n i = i >> 1\n while i:\n self.seg[i] = self.f(self.calc(2*i), self.calc(2*i+1))\n i = i >> 1\n\n def propagate(self, i):\n self.seg[i] = self.g(self.seg[i], self.lazy[i], self.size[i])\n self.lazy[2*i] = self.h(self.lazy[2*i], self.lazy[i])\n self.lazy[2*i+1] = self.h(self.lazy[2*i+1], self.lazy[i])\n self.lazy[i] = self.lazy_ide\n\n def propagate_above(self, i):\n H = i.bit_length()\n for h in range(H, 0, -1):\n self.propagate(i >> h)\n\n def query(self, l, r):\n l += self.num\n r += self.num\n lm = l // (l & -l)\n rm = r // (r & -r) -1\n self.propagate_above(lm)\n self.propagate_above(rm)\n\n al = self.seg_ide\n ar = self.seg_ide\n while l < r:\n if l & 1:\n al = self.f(al, self.calc(l))\n l += 1\n if r & 1:\n r -= 1\n ar = self.f(self.calc(r), ar)\n l = l >> 1\n r = r >> 1\n return self.f(al, ar)\n\n def oprerate_range(self, l, r, a):\n l += self.num\n r += self.num\n lm = l // (l & -l)\n rm = r // (r & -r) -1\n self.propagate_above(lm)\n self.propagate_above(rm)\n while l < r:\n if l & 1:\n self.lazy[l] = self.h(self.lazy[l], a)\n l += 1\n if r & 1:\n r -= 1\n self.lazy[r] = self.h(self.lazy[r], a)\n l = l >> 1\n r = r >> 1\n\n self.calc_above(lm)\n self.calc_above(rm)\n\nf = lambda x, y: x+y\n\ng = lambda x, a, s: s-x if a%2 == 1 else x\n\nh = lambda a, b: a+b\n\n\ndef EulerTour(g, root):\n n = len(g)\n root = root\n g = g\n\n tank = [root]\n eulerTour = []\n left = [0]*n\n right = [-1]*n\n depth = [-1]*n\n parent = [-1]*n\n child = [[] for i in range(n)]\n\n eulerNum = -1\n de = -1\n\n while tank:\n v = tank.pop()\n if v >= 0:\n eulerNum += 1\n eulerTour.append(v)\n left[v] = eulerNum\n right[v] = eulerNum\n tank.append(~v)\n de += 1\n depth[v] = de\n for u in g[v]:\n if parent[v] == u:\n continue\n tank.append(u)\n parent[u] = v\n child[v].append(u)\n else:\n de -= 1\n if ~v != root:\n eulerTour.append(parent[~v])\n eulerNum += 1\n right[parent[~v]] = eulerNum\n return eulerTour, left, right\n\nimport bisect\n\nimport sys\nimport io, os\ninput = sys.stdin.readline\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\n\ndef main():\n\n n = int(input())\n P = list(map(int, input().split()))\n T = list(map(int, input().split()))\n\n P = [p-1 for p in P]\n P = [-1]+P\n\n edge = [[] for i in range(n)]\n for i, p in enumerate(P):\n if p != -1:\n edge[p].append(i)\n\n et, left, right = EulerTour(edge, 0)\n d = {}\n B = sorted(left)\n #print(B)\n #print(right)\n for i, b in enumerate(B):\n d[b] = i\n A = [0]*n\n for i in range(n):\n A[d[left[i]]] = T[i]\n\n seg = LazySegTree(A, 0, 0, f, g, h)\n q = int(input())\n for i in range(q):\n query = list(map(str, input().split()))\n if query[0] == 'get':\n u = int(query[1])-1\n l = d[left[u]]\n r = bisect.bisect_right(B, right[u])\n print(seg.query(l, r))\n else:\n u = int(query[1])-1\n l = d[left[u]]\n r = bisect.bisect_right(B, right[u])\n seg.oprerate_range(l, r, 1)\n\nif __name__ == '__main__':\n main()\n" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\npow2 = [1]\r\nfor _ in range(19):\r\n pow2.append(2 * pow2[-1])\r\nx = [[] for _ in range(15)]\r\nz, c = 0, 0\r\nfor i in range(5):\r\n s = list(input().rstrip())\r\n for j in s:\r\n if j == 32:\r\n continue\r\n x[i].append(pow2[c])\r\n z ^= (j & 1) * pow2[c]\r\n c += 1\r\nfor i in range(5):\r\n u = x[i]\r\n v = u[::-1]\r\n l = max(i - 2, 0)\r\n r = l + len(u)\r\n for j in range(l, r):\r\n x[j + 5].append(u[j - l])\r\n x[j + 10].append(v[j - l])\r\ns = set()\r\nfor u in x:\r\n v = [0]\r\n for i in u:\r\n v.append(v[-1] ^ i)\r\n for i in v:\r\n for j in v:\r\n s.add(i ^ j)\r\ns.remove(0)\r\nn = pow2[19]\r\ndp = [0] * n\r\nfor i in range(n):\r\n if dp[i]:\r\n continue\r\n for j in s:\r\n if i & j:\r\n continue\r\n dp[i ^ j] = 1\r\nans = \"Karlsson\" if dp[z] else \"Lillebror\"\r\nprint(ans)", "import sys\n\n\nmasks = [1, 2, 3, 4, 6, 7, 8, 9, 16, 17, 18, 24, 32, 34, 36, 48, 56, 64, 68, 96, 112, 120, 128, 136, 137, 256, 264, 272, 274, 384, 512, 528, 529, 544, 548, 768, 896, 1024, 1056, 1058, 1088, 1536, 1792, 1920, 2048, 2112, 2116, 3072, 3584, 3840, 3968, 4096, 4224, 4352, 4368, 4370, 8192, 8448, 8456, 8704, 8736,\n 8740, 12288, 16384, 16896, 16912, 16913, 17408, 17472, 24576, 28672, 32768, 33792, 33824, 33826, 34816, 49152, 57344, 61440, 65536, 69632, 69760, 73728, 74240, 74272, 74276, 131072, 139264, 139520, 139528, 147456, 148480, 148544, 196608, 262144, 278528, 279040, 279056, 279057, 294912, 296960, 393216, 458752]\ninit_status = 0\n\n\ndef read_input():\n global init_status\n readline = sys.stdin.readline\n buf = []\n for _ in range(5):\n buf.extend(readline().strip().split(' '))\n for i in range(19):\n if buf[i] == 'O':\n init_status |= 1 << i\n\n\ndef solve():\n global masks\n masks = [m for m in masks if m | init_status == init_status]\n dp = [False] * (2 ** 19)\n for i in range(init_status + 1):\n if dp[i]:\n continue\n for mask in masks:\n if mask & i > 0:\n continue\n dp[i | mask] = True\n return dp[init_status]\n\n\nread_input()\nif solve():\n print('Karlsson')\nelse:\n print('Lillebror')\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nlines = [\r\n [0, 1, 2],\r\n [3, 4, 5, 6],\r\n [7, 8, 9, 10, 11],\r\n [12, 13, 14, 15],\r\n [16, 17, 18],\r\n [0, 3, 7],\r\n [1, 4, 8, 12],\r\n [2, 5, 9, 13, 16],\r\n [6, 10, 14, 17],\r\n [11, 15, 18],\r\n [2, 6, 11],\r\n [1, 5, 10, 15],\r\n [0, 4, 9, 14, 18],\r\n [3, 8, 13, 17],\r\n [7, 12, 16]\r\n]\r\n\r\ndp = [0] + [-1] * (1 << 19)\r\n\r\n\r\ndef dfs(state: int):\r\n if dp[state] != -1:\r\n return dp[state]\r\n\r\n for line in lines:\r\n for i in range(len(line)):\r\n line_bit = 0\r\n for j in range(i, len(line)):\r\n line_bit |= 1 << line[j]\r\n if state & line_bit == line_bit and dfs(state & ~line_bit) == 0:\r\n dp[state] = 1\r\n return 1\r\n dp[state] = 0\r\n return 0\r\n\r\n\r\nstart_bit = 0\r\nfor s in (0, 3, 7, 12, 16):\r\n for i, c in enumerate(input().split(), start=s):\r\n if c == 'O':\r\n start_bit |= 1 << i\r\n\r\nprint('Karlsson' if dfs(start_bit) else 'Lillebror')\r\n" ]

[ "from math import *\nw,h,alpha = [int(x) for x in input().strip().split()]\nif alpha > 90 : alpha = 180-alpha\nif w < h: w,h = h,w\nc = cos(alpha*pi/180.0)\ns = sin(alpha*pi/180.0)\nt = tan(alpha*pi/360.0)\n \nprint(h*h/s) if t > h/w else print( (w*h-(w*w+h*h)/2*tan(alpha*pi/360.0))/(c) )\n \t \t \t \t \t\t \t\t\t \t \t\t\t\t \t", "import math\nw,h,alpha=list(map(lambda x: int(x),input().split(\" \")));\n\nif alpha>90: alpha=180-alpha;\nif alpha==0 : print(w*h);\nelif alpha==90:\n print(min(w,h)**2);\n\n\nelse:\n limit=2*(math.degrees(math.atan(h/w)));\n if limit>90: limit=180-limit;\n c=math.cos(math.radians(alpha));\n s=math.sin(math.radians(alpha));\n # print(limit);\n if alpha>=limit:\n print(min(w,h)**2/s);\n else:\n print(w*h -((c-1)*((4*w*h*s)-2*(w**2+h**2))/(4*s*c)));", "import math\r\nh, w, a = map(float, input().split())\r\nif a > 90.0:\r\n a = 180.0 - a\r\nif h > w:\r\n h, w = w, h\r\na = a / 180 * math.pi\r\nans = 0\r\nif a / 2 >= math.atan(h / w):\r\n ans = h * h / math.sin(a)\r\nelse:\r\n ans = h*w / math.cos(a) - (h*h + w*w) / 2 * math.tan(a/2) / math.cos(a)\r\nprint(ans)# 1691666829.9459567", "from math import sin, cos, tan, atan, pi\n\n\ndef main():\n w, h, a = map(int, input().split())\n a = min(a, 180 - a) * pi / 180\n if h > w:\n h, w = w, h\n if h * (1 + cos(a)) < w * sin(a):\n res = h * h / sin(a)\n else:\n res = h * w - ((w - h * tan(a / 2)) ** 2 * tan(a) + (h - w * tan(a / 2)) ** 2 * tan(a)) / 4\n print('{:.9f}'.format(res))\n\n\nif __name__ == '__main__':\n main()", "from math import sin,cos,tan\r\nPI = 3.141592653589793238463\r\n[w,h,a] =[int(i) for i in input().split()]\r\nif h > w:\r\n h,w = w,h\r\nif a > 90:\r\n a = 180 - a\r\nif a==0:\r\n print(w*h)\r\nelse:\r\n b = (a*PI)/180\r\n w = w/2.0\r\n h = h/2.0\r\n if tan(b/2) >= h/w:\r\n print (4*h*h/sin(b))\r\n else:\r\n ans = 4*w*h\r\n m = -1 / tan(b)\r\n c = w*sin(b) + w*cos(b) / tan(b)\r\n ans = ans - (h - m*w - c)*(w - (h - c)/m)\r\n m = tan(b)\r\n c = h*cos(b) + h*sin(b)*tan(b)\r\n ans = ans - (h + m*w - c)*((h - c)/m + w)\r\n print (ans)\r\n", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import *\r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect, insort\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nfrom copy import deepcopy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"../output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A: print(*ele,end=\"\\n\")\r\n\r\n# from sys import stdin\r\n# input = stdin.buffer.readline\r\n# I = lambda : list(map(int,input().split()))\r\n\r\n# import sys\r\n# input=sys.stdin.readline\r\nw,h,a=L()\r\nif (a > 90): a = 180 - a\r\n \r\nif (a == 0) :\r\n print(w * h)\r\nelif (a == 90) :\r\n print(min(w, h) ** 2)\r\nelse :\r\n a = a * pi / 180.0\r\n if (w < h) : w, h = h, w\r\n corner_x = cos(a) * (w / 2.0) + sin(a) * (h / 2.0)\r\n if (corner_x >= w / 2 ) :\r\n x0 = w / 2.0 + (h / 2.0 - (h / 2.0) / cos(a)) * (cos(a) / sin(a))\r\n y0 = h / 2.0 - (tan(a) * (- w / 2.0) + (h / 2.0) / cos(a))\r\n x1 = w / 2.0 - (h / 2.0 - (w / 2.0) / sin(a)) * (-tan(a))\r\n y1 = h / 2.0 - ((-cos(a) / sin(a)) * (w / 2.0) + (w / 2.0) / sin(a))\r\n \r\n print(w * h - x1 * y1 - x0 * y0)\r\n else :\r\n y = tan(a) * (w / 2.0) - (h / 2.0) / cos(a) + h / 2.0\r\n y0 = y - h\r\n x0 = y * tan(pi / 2.0 - a)\r\n print(w * h - (y0 * tan(pi / 2.0 - a) + x0) * h)", "from math import radians, cos, sin, atan2\n\ndef rotate(point, alpha):\n x = point[0]\n y = point[1]\n return (x * cos(alpha) - y * sin(alpha), x * sin(alpha) + y * cos(alpha))\n\ndef crs(a, b):\n return a[0] * b[1] - a[1] * b[0]\n\ndef m(end, start):\n return (end[0] - start[0], end[1] - start[1])\n\ndef area(poly):\n ret = 0\n n = len(poly)\n\n for i in range(n):\n j = (i + 1) % n\n ret += crs(poly[i], poly[j])\n\n return abs(ret) / 2.0\n\ndef intersect(a, b, c, d):\n r = crs(m(c, d), m(a, d)) * crs(m(c, d), m(b, d)) <= 0\n r &= crs(m(b, a), m(c, a)) * crs(m(b, a), m(d, a)) <= 0\n if not r:\n return None\n\n x1 = a[0]\n y1 = a[1]\n\n x2 = c[0]\n y2 = c[1]\n\n dx1 = b[0] - a[0]\n dx2 = d[0] - c[0]\n\n dy1 = b[1] - a[1]\n dy2 = d[1] - c[1]\n\n if dx2 * dy1 == dx1 * dy2:\n return None\n\n t = ((x1 - x2) * dy2 + (y2 - y1) * dx2) / (dx2 * dy1 - dx1 * dy2)\n return (x1 + t * dx1, y1 + t * dy1)\n\n\nw, h, alpha = map(int, input().split())\n\nif alpha == 0 or alpha == 180:\n print(w * h)\nelse:\n alpha = radians(alpha) \n pnt = []\n\n pnt.append((w / 2, h / 2))\n pnt.append((-w / 2, h / 2))\n pnt.append((-w / 2, -h / 2))\n pnt.append((w / 2, -h / 2))\n\n\n pnt2 = []\n for p in pnt:\n pnt2.append(rotate(p, alpha))\n\n pnt2.append(pnt2[0])\n pnt.append(pnt[0])\n\n points_total = []\n\n for st in range(4):\n for en in range(4):\n t = intersect(pnt[st], pnt[st + 1], pnt2[en], pnt2[en + 1])\n\n if t != None:\n points_total.append(t)\n\n points_total = sorted(points_total, key=lambda x: atan2(x[1], x[0]))\n\n print(area(points_total))\n", "import sys\r\nimport math\r\n\r\n\r\ndef read_input(input_path=None):\r\n if input_path is None:\r\n f = sys.stdin\r\n else:\r\n f = open(input_path, 'r')\r\n\r\n w, h, a = map(int, f.readline().split())\r\n\r\n return w, h, a\r\n\r\n\r\ndef sol(w, h, a):\r\n if h > w:\r\n w, h = h, w\r\n\r\n if a > 90:\r\n a = 90 - (a - 90)\r\n\r\n a = math.radians(a)\r\n\r\n if a < 2 * math.atan2(h, w):\r\n area = w * h\r\n\r\n s = (w / 2) - (h / 2 * math.tan(a / 2))\r\n bigger_area = 0.5 * s * s * math.tan(a)\r\n\r\n s = (h / 2) - (w / 2 * math.tan(a / 2))\r\n lower_area = 0.5 * s * s * math.tan(a)\r\n\r\n res = area - 2 * bigger_area - 2 * lower_area\r\n else:\r\n res = h * h / math.sin(a)\r\n\r\n return [f\"{res}\"]\r\n\r\n\r\ndef solve(input_path=None):\r\n return sol(*read_input(input_path))\r\n\r\n\r\ndef main():\r\n for line in sol(*read_input()):\r\n print(f\"{line}\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "#!/usr/bin/python3\nfrom math import *\n\nw,h,alpha = [int(x) for x in input().strip().split()]\n\nif alpha > 90 : alpha = 180-alpha\nif w < h: w,h = h,w\n\nc = cos(alpha*pi/180.0)\ns = sin(alpha*pi/180.0)\nt = tan(alpha*pi/360.0)\n\nprint(h*h/s) if t > h/w else print( (w*h-(w*w+h*h)/2*tan(alpha*pi/360.0))/(c) )\n", "from math import *\r\n\r\nw,h,alpha = [int(x) for x in input().strip().split()]\r\n\r\nif alpha > 90 : alpha = 180 - alpha\r\nif w < h: w,h = h,w\r\n\r\nc = cos(alpha * pi / 180.0)\r\ns = sin(alpha * pi / 180.0)\r\nt = tan(alpha * pi / 360.0)\r\n\r\nprint(h * h / s) if t > h / w else print( (w * h - (w * w + h * h) / 2 * tan(alpha * pi / 360.0)) / (c))" ]

[ "a1, a2, a3 = map(int,input().split())\r\nb1, b2, b3 = map(int,input().split())\r\nn = int(input())\r\na = a1 + a2 + a3\r\nb = b1 + b2 + b3\r\n\r\nif (a%5 == 0):\r\n x = int((a/5))\r\nelse: x = int((a/5 + 1))\r\nif (b%10 == 0):\r\n z = int((b/10))\r\nelse: z = int((b/10 + 1))\r\n\r\nif (x + z) > n :\r\n print(\"NO\")\r\nelse: print(\"YES\")\r\n", "a1, a2, a3 = map(int, input().split())\nb1, b2, b3 = map(int, input().split())\nn = int(input())\ncups = a1 + a2 + a3\nmedals = b1 + b2 + b3\nselves = 0\nif cups % 5:\n\tselves += (cups // 5) + 1\nelse:\n\tselves += (cups // 5)\nif medals % 10:\n\tselves += (medals // 10) + 1\nelse:\n\tselves += (medals // 10)\nif n < selves:\n\tprint('NO')\nelse:\n\tprint('YES')\n \t \t\t \t \t \t\t \t \t\t \t\t\t \t\t\t\t", "q=(sum(map(int,input().split()))+4)//5\r\nw=(sum(map(int,input().split()))+9)//10\r\nn=int(input())\r\nprint(\"YES\"if q+w<=n else \"NO\")", "a1,a2,a3 = map(int,input().split())\nb1,b2,b3 = map(int,input().split())\npol = int(input())\nmed = a1+a2+a3\ncub = b1+b2+b3\npolm = med//5\npolc = cub//10\nif (med % 5) != 0 :\n polm = polm+1\n\nif (cub % 10) != 0 :\n polc = polc+1\n\nif (polc + polm) > pol :\n print('NO')\nelse :\n print('YES')\n# Sun Oct 31 2021 18:00:13 GMT+0000 (Coordinated Universal Time)\n", "c=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nn=int(input())\r\n\r\n\r\nc=sum(c)\r\nm=sum(m)\r\ntotal=0\r\nif c%5==0:\r\n total+=c//5\r\nelse:\r\n total+=c//5+1\r\n\r\nif m%10==0:\r\n total+=m//10\r\nelse:\r\n total+=m//10+1\r\n \r\nif total<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def main():\r\n a1, a2, a3 = map(int, input().split())\r\n b1, b2, b3 = map(int, input().split())\r\n n = int(input())\r\n \r\n if (a1 + a2 + a3 + 4) // 5 + (b1 + b2 + b3 + 9) // 10 <= n:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\nif __name__ == '__main__':\r\n main()", "n = sum(list(map(int ,input().split()))) \r\nx = n // 5 \r\nif n % 5 > 0 : \r\n x += 1\r\nm = sum(list(map(int ,input().split()))) \r\nt = m // 10\r\nif m % 10 > 0:\r\n t += 1 \r\n\r\nk = int(input())\r\nif k - x < t : \r\n print(\"NO\")\r\nelse: \r\n print(\"YES\")", "import sys\r\nimport math\r\nfrom collections import defaultdict,Counter\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n\r\n'''\r\nOk.. the change has to be applied to all\r\n\r\n'''\r\ninf = 10**9+7\r\na=LII()\r\nb=LII()\r\nn=II()\r\nsa=sum(a)\r\nsb=sum(b)\r\n\r\nbshelves=sb//10+int(sb%10!=0)\r\nashelves=sa//5+int(sa%5!=0)\r\n# print(ashelves,bshelves)\r\nprint(\"YES\" if ashelves+bshelves<=n else \"NO\")", "from math import ceil\r\nline1 = input().split(\" \")\r\nline2 = input().split(\" \")\r\nshelves = int(input())\r\n\r\na1 = int(line1[0])\r\na2 = int(line1[1])\r\na3 = int(line1[2])\r\nb1 = int(line2[0])\r\nb2 = int(line2[1])\r\nb3 = int(line2[2])\r\ncups = a1 + a2 + a3\r\nmedals = b1 + b2 + b3\r\nif medals == 0:\r\n if (ceil(cups/5) + medals/10) <= shelves:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelif cups == 0:\r\n if (cups/5 + ceil(medals/10)) <= shelves:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if (ceil(cups/5) + ceil(medals/10)) <= shelves:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\nl=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nn=int(input())\r\nl_s=math.ceil(sum(l)/5)\r\nk_s=math.ceil(sum(k)/10)\r\nif l_s+k_s<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a1, a2, a3 = [int(i) for i in input().split()]\r\n\r\nb1, b2, b3 = [int(i) for i in input().split()]\r\n\r\nn = int(input())\r\n\r\na = a1 + a2 + a3\r\n\r\nb = b1 + b2 + b3\r\n\r\nn1 = a//5\r\n\r\nn2 = b//10\r\n\r\nif a % 5 != 0:\r\n n1 = n1 + 1\r\n\r\nif b % 10 != 0:\r\n n2 = n2 + 1\r\n \r\nn3 = n1 + n2\r\n\r\nif n >= n3:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "import math\r\na1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\nn=int(input())\r\na=a1+a2+a3\r\nb=b1+b2+b3\r\nif math.ceil(a/5)+math.ceil(b/10)<=n:\r\n print('YES')\r\nelse:\r\n print('NO')", "from math import ceil\ncup=sum(map(int,input().split()))\nmed=sum(map(int,input().split()))\nn=int(input())\nc=ceil(cup/5)\nm=ceil(med/10)\nif c+m<=n:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "from math import ceil as c\r\nprint('YES' if c(sum(list(map(int,input().split())))/5) + c(sum(list(map(int,input().split())))/10) <= int(input()) else 'NO')", "a, b, c, = map(int, input().split())\r\nd, e, f, = map(int, input().split())\r\nz = int(input())\r\nx = a+b+c\r\ny = d+e+f\r\nwhile x > 0 :\r\n x -=5\r\n z-= 1\r\nwhile y > 0 :\r\n y -= 10\r\n z -=1\r\nif z >= 0 :\r\n print('YES')\r\nelse:\r\n print('NO')", "from math import ceil\n\n\nif __name__ == '__main__':\n # lets find out the number of shelves available\n\n # so we know the number of medals and number of number of cups\n # first we check if there are atleast 2 shelves, one for each type\n # now we first calculate the number of medals, if\n # if medals = 15\n # no. of rows = math.ceil(18 / 10) = 2\n\n # so now if this is greater than n: print(no) else check if\n # remaining rows >= math.ceil(cups/5)\n\n\n cups = list(map(int, input().split()))\n medals = list(map(int, input().split()))\n k = int(input())\n\n num_cup_rows = ceil(sum(cups)/5)\n num_medal_rows = ceil(sum(medals)/10)\n if num_cup_rows + num_medal_rows <= k:\n print('YES')\n else:\n print('NO')\n", "\r\nj=lambda:sum(map(int,input().split()))\r\nprint('YNEOS'[((j()+4)//5+(j()+9)//10)>j()::2])", "a1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\nn=int(input())\r\ns1=(a1+a2+a3)//5\r\ns2=(b1+b2+b3)//10\r\nif (a1+a2+a3)%5:\r\n s1+=1\r\nif (b1+b2+b3)%10:\r\n s2+=1\r\nif s1+s2<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import ceil\r\n\r\n\r\nclass Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\ta = list(map(int, input().split()))\r\n\t\tb = list(map(int, input().split()))\r\n\t\tn = int(input())\r\n\r\n\t\tif ceil(sum(a) / 5) + ceil(sum(b) / 10) <= n:\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "# Wadea #\r\n\r\na1,a2,a3 = map(int,input().split())\r\na = a1+a2+a3\r\nb1,b2,b3 = map(int,input().split())\r\nb = b1+b2+b3\r\nn = int(input())\r\nif n == 1 and a > 0 and b > 0:\r\n print(\"NO\")\r\nelse:\r\n for j in range(a+b):\r\n if a == 0:\r\n if b == 0:\r\n break\r\n else:\r\n if b >= 10:\r\n b -= 10\r\n n -= 1\r\n else:\r\n n -= 1\r\n b -= b\r\n else:\r\n if a >= 5:\r\n a -= 5\r\n n -= 1\r\n else:\r\n n -= 1\r\n a -= a\r\n if n >= 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "trophy = input().split()\nmedal = input().split()\npos_shelf=int(input())\ntrophy_tot = 0\nmedal_tot = 0\nfor x in trophy:\n trophy_tot += int(x)\nfor x in medal:\n medal_tot += int(x)\n\nshelves = 0\nshelves += trophy_tot // 5\nif(trophy_tot % 5 != 0):\n shelves += 1\nshelves += medal_tot // 10\nif(medal_tot % 10 != 0):\n shelves += 1\nif(shelves <= pos_shelf):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t \t \t\t \t \t\t\t \t", "cup=sum(map(int,input().split()))\r\nmedal=sum(map(int,input().split()))\r\nn=int(input())\r\n\r\ns_cup=2*n-(cup+medal)//5\r\ns_medal=(cup+medal)//5-n\r\np=1\r\nfor i in range(s_cup):\r\n if 5*i>=cup and 10*(n-i)>=medal:\r\n p=0\r\n print('YES')\r\n break\r\nif p==1:\r\n print('NO')", "a1, a2, a3=[int(i) for i in input().split()]\r\nb1, b2, b3=[int(i) for i in input().split()]\r\nn=int(input())\r\na=a1+a2+a3\r\nb=b1+b2+b3\r\nif ((a+5-1)//5)+((b+10-1)//10)<=n:\r\n print('YES')\r\nelse:\r\n print('NO')", "a1, a2, a3 = map(int, input().split())\nb1, b2, b3 = map(int, input().split())\nn = int(input())\n\ncups = a1 + a2 + a3\nmedals = b1 + b2 + b3\n\ncup_shelves = cups // 5 if cups % 5 == 0 else cups // 5 + 1\nmedal_shelves = medals // 10 if medals % 10 == 0 else medals // 10 + 1\n\nif n >= cup_shelves + medal_shelves:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a1,a2,a3=[int(i) for i in input().split()]\r\nb1,b2,b3=[int(i) for i in input().split()]\r\nn=int(input())\r\na=a1+a2+a3\r\nb=b1+b2+b3\r\np=0\r\nif b%10==0:\r\n p+=b//10\r\nelse:\r\n p+=b//10+1\r\nif a%5==0:\r\n p+=a//5\r\nelse:\r\n p+=a//5+1\r\nif p<=n:\r\n print('YES')\r\nelse:\r\n print('NO')", "import math\r\nx=[int(q)for q in input().split()]\r\ny=[int(q)for q in input().split()]\r\nn=int(input())\r\nif math.ceil(sum(x)/5)+math.ceil(sum(y)/10)<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\n\n\ndef yes_or_no(flag: bool):\n return \"YES\" if flag else \"NO\"\n\n\ndef test():\n a = sum(list(map(int, input().split())))\n b = sum(list(map(int, input().split())))\n n = int(input())\n\n print(yes_or_no(math.ceil(a / 5) + math.ceil(b / 10) <= n))\n\n\nif __name__ == \"__main__\":\n # t = int(input())\n t = 1\n for _ in range(t):\n test()\n", "from math import ceil\r\na1, a2, a3 = map(int, input().split())\r\nb1, b2, b3 = map(int, input().split())\r\nn = int(input())\r\n\r\nif ceil(sum([a1,a2,a3])/5) + ceil(sum([b1, b2, b3])/10) <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\na=sum(map(int, input().split()))\r\nb=sum(map(int, input().split()))\r\nn=int(input())\r\nif n>=math.ceil(a/5)+math.ceil(b/10):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,a1,a2=map(int,input().split())\nb,b1,b2=map(int,input().split())\nn=int(input())\nbob=b+b1+b2\naob=a+a1+a2\nif aob==0:\n aob=0\nelif aob<=5:\n aob=1\nelif aob%5==0:\n aob//=5\nelse:\n aob=(aob//5)+1\nif bob==0:\n bob=0\nelif bob<=10:\n bob=1\nelif bob%10==0:\n bob//=10\nelse:\n bob=(bob//10)+1\nif aob+bob<=n:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nn = int(input())\r\n\r\nasu = sum(a)\r\nbs = sum(b)\r\n\r\ns = 0\r\nif asu % 5 == 0:\r\n s += asu // 5\r\nelse:\r\n s+= asu // 5 + 1\r\nif bs % 10 == 0:\r\n s += bs // 10 \r\nelse:\r\n s+= bs//10 + 1\r\n\r\nif s <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "cup = list(map(int, input().split()))\r\nmedal = list(map(int, input().split()))\r\nn = int(input())\r\n\r\na = sum(cup) // 5\r\nb = sum(medal) // 10\r\n\r\nif sum(cup) % 5 != 0:\r\n a += 1\r\nif sum(medal) % 10 != 0:\r\n b += 1\r\n\r\nprint(\"YES\" if a + b <= n else \"NO\")\r\n", "l=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nn=int(input())\r\nif (sum(l)+5-1)//5+(sum(l2)+10-1)//10>n:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "import math\r\nx,y,z =map(int, input().split())\r\na,b,c=map(int, input().split())\r\nn=int(input())\r\nkk=math.ceil((x+y+z)/5)\r\nll= math.ceil((a+b+c)/10)\r\nprint([\"NO\",\"YES\"][n>=(kk+ll)])", "a = -(sum(list(map(int, input().split(' ')))) // - 5)\r\nb = -(sum(list(map(int, input().split(' ')))) // - 10)\r\nprint('YES') if a + b <= int(input()) else print('NO')", "import math\r\na=sum(list(map(int,input().split())))\r\nb=sum(list(map(int,input().split()))) \r\nprint(\"YES\" if math.ceil(a/5)+math.ceil(b/10)<=int(input()) else\"NO\")", "from math import ceil\r\n\r\ndef sol2():\r\n a = sum(list(map(int, input().split())))\r\n b = sum(list(map(int, input().split())))\r\n n = int(input())\r\n\r\n needA = ceil(a / 5)\r\n needB = ceil(b / 10)\r\n tot = needA + needB\r\n if tot <= n:\r\n print('YES')\r\n else:\r\n print('NO')\r\nsol2()", "# Read input\r\ncups = list(map(int, input().split()))\r\nmedals = list(map(int, input().split()))\r\nn = int(input())\r\n\r\n# Calculate the total number of shelves required for cups and medals\r\ntotal_shelves = (sum(cups) + 4) // 5 + (sum(medals) + 9) // 10\r\n\r\n# Check if the total shelves required are less than or equal to n\r\nif total_shelves <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "import math\r\na1,a2,a3 = [int(i)for i in input().split()]\r\nb1,b2,b3= [int(i)for i in input().split()]\r\nn=int(input(''))\r\na4=a1+a2+a3\r\nb4=b1+b2+b3\r\namount1=math.ceil(a4/5)\r\namount2=math.ceil(b4/10)\r\n\r\nif amount1 + amount2 > n:\r\n print('NO')\r\nelif amount1 + amount2 <= n:\r\n print('YES')", "from math import ceil\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nn = int(input())\r\n\r\nsua = ceil(sum(a)/5)\r\nsub = ceil(sum(b)/10)\r\nif sua + sub <= n :\r\n print('YES')\r\nelse:\r\n print('NO')", "import math\r\n\r\na = sum(map(int, input().split()))\r\nb = sum(map(int, input().split()))\r\nn = int(input())\r\n\r\nif int(math.ceil(a / 5)) + int(math.ceil(b / 10)) <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\n\r\nReader = input().split()\r\na1 = int(Reader[0])\r\na2 = int(Reader[1])\r\na3 = int(Reader[2])\r\ncups = a1+a2+a3\r\nReader = input().split()\r\nb1 = int(Reader[0])\r\nb2 = int(Reader[1])\r\nb3 = int(Reader[2])\r\nmedals = b1 + b2 + b3\r\nN = int(input())\r\nif math.ceil(cups / 5) + math.ceil(medals / 10) <= N:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\nline = input().split(sep=\" \")\r\ncups = int(line[0])+int(line[1])+int(line[2])\r\nline = input().split(sep=\" \")\r\nmedal = int(line[0])+int(line[1])+int(line[2])\r\nn = int(input())\r\n\r\nn -= math.ceil(cups/5.0)\r\nn -=math.ceil(medal/10.0)\r\n\r\nif(n>=0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a1,a2,a3 = map(int,input().split())\r\nb1,b2,b3 = map(int,input().split())\r\nn = int(input())\r\n\r\na = a1 + a2 + a3\r\nb = b1 + b2 + b3\r\n\r\nn1 = a//5\r\nif a%5!=0:\r\n\tn1 += 1\r\nn2 = b//10\r\nif b%10!=0:\r\n\tn2 += 1\r\n\r\nif n1+n2 <= n:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "import math\n\nA = tuple(map(int, input().split()))\nB = tuple(map(int, input().split()))\nn = int(input())\n\ncups = int(math.ceil(sum(A) / 5))\nmedals = int(math.ceil(sum(B) / 10))\n\nif (cups + medals) <= n:\n print('YES')\nelse:\n print('NO')\n", "import math\r\na,b,c = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\nk = int(input())\r\ncnt1=math.ceil((a+b+c) / 5)\r\ncnt2=math.ceil((x+y+z) / 10)\r\nif(cnt1+cnt2 > k): print(\"NO\")\r\nelse: print(\"YES\")", "a1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\ns1=a1+a2+a3\r\ns2=b1+b2+b3\r\nn=int(input())\r\ncnt=0\r\nif s1%5:\r\n cnt+=s1//5+1\r\nelse:\r\n cnt+=s1//5\r\nif s2%10:\r\n cnt+=s2//10+1\r\nelse:\r\n cnt+=s2//10\r\nif cnt>n:print('NO')\r\nelse:print('YES')", "cups = input().split()\r\nmedals = input().split()\r\nshelves = int(input())\r\ntotal_medals = 0\r\ntotal_cups = 0\r\n\r\nfor i in cups:\r\n total_cups += int(i)\r\nfor i in medals:\r\n total_medals += int(i)\r\n\r\ncount = 0\r\ncount += total_cups // 5\r\nif total_cups % 5 > 0:\r\n count += 1\r\ncount += total_medals //10\r\nif total_medals % 10 > 0:\r\n count += 1\r\n\r\nif count>shelves:\r\n print('NO')\r\nelse:\r\n print(\"YES\")", "cups = sum(list(map(int, input().split())))\r\nmedals = sum(list(map(int, input().split())))\r\nn = int(input())\r\n\r\ncup_shelves, remainder = divmod(cups, 5)\r\nif remainder:\r\n cup_shelves += 1\r\n\r\nmedal_shelves, remainder = divmod(medals, 10)\r\nif remainder:\r\n medal_shelves += 1\r\n\r\nif cup_shelves + medal_shelves > n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from math import *\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nn=int(input())\r\na=sum(a)\r\nb=sum(b)\r\nans='YES'\r\na=ceil(a/5)\r\nb=ceil(b/10)\r\nwhile ans=='YES':\r\n if a>n:\r\n ans='NO'\r\n if b>n:\r\n ans='NO'\r\n if a+b>n:\r\n ans='NO'\r\n break\r\nprint(ans)", "from math import *\r\nwhile True:\r\n try:\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n n = eval(input())\r\n if ceil(sum(a) / 5) + ceil(sum(b) / 10) <= n:\r\n print('YES')\r\n else:\r\n print('NO')\r\n except:\r\n break", "a1, a2, a3 = map(int, input().split())\r\nb1, b2, b3 = map(int, input().split())\r\nn = int(input())\r\nif (a1 + a2 + a3 + 4) // 5 + (b1 + b2 + b3 + 9) // 10 > n:\r\n print('NO')\r\nelse:\r\n print('YES')", "import math\r\na1,a2,a3 = map(int,input().split())\r\nb1,b2,b3 = map(int,input().split())\r\nn = int(input())\r\nx = math.ceil((a1+a2+a3)/5)\r\ny = math.ceil((b1+b2+b3)/10)\r\nif x+y>n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\r\na,b,c = map(int,input().split())\r\nd,e,f = map(int,input().split())\r\nn = int(input())\r\ns1 = a+b+c\r\ns2 = d+e+f\r\ncount = math.ceil(s1/5)+math.ceil(s2/10)\r\nif(count>n):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from math import *\r\na1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\nn=int(input())\r\nc=a1+a2+a3\r\nm=b1+b2+b3\r\nif int(ceil(c/5)) + int(ceil(m/10)) > n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nn = int(input())\r\n\r\nshelf_for_cups = math.ceil(sum(a) / 5)\r\nshelf_for_medals = math.ceil(sum(b) / 10)\r\n\r\nsum_ = shelf_for_medals + shelf_for_cups\r\n# print(sum_, shelf_for_medals, shelf_for_cups)\r\n\r\nif sum_ > n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "import sys\r\n# sys.setrecursionlimit(1000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x)+'\\n')\r\n\r\n# from decimal import Decimal\r\n# from random import randint\r\n# from copy import deepcopy\r\nfrom collections import deque,Counter\r\nfrom heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\nfrom math import inf,sqrt,gcd,pow,ceil,floor,log,log2,log10,pi,sin,cos,tan,asin,acos,atan\r\n# from functools import cmp_to_key\r\n# from itertools import permutations,combinations\r\n\r\na=sum(list(map(int,input().split())))\r\nb=sum(list(map(int,input().split())))\r\nn=int(input())\r\nif (a-1)//5+1+(b-1)//10+1<=n:\r\n print('YES')\r\nelse:\r\n print('NO')", "import collections\r\nfrom math import sqrt\r\nfrom collections import *\r\nfrom itertools import permutations\r\nmod = 1000000007\r\ndef main():\r\n cup = map(int, input().split())\r\n medal = map(int, input().split())\r\n n = int(input())\r\n c_cup = sum(cup)\r\n if c_cup%5==0:\r\n c_cup //= 5\r\n else:\r\n c_cup=c_cup//5+1\r\n c_med = sum(medal)\r\n if c_med%10==0:\r\n c_med//=10\r\n else:\r\n c_med=c_med//10+1\r\n if c_cup+c_med>n:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n # test = int(input())\r\n # for _ in range(test):\r\n # n = int(input())\r\n # a = list(map(int, input().split()))\r\n # flag = 0\r\n # for x in a:\r\n # if sqrt(x)!=int(sqrt(x)):\r\n # flag = 1\r\n # break\r\n # print(\"YES\") if flag==1 else print(\"NO\")\r\nif __name__ == \"__main__\":\r\n main()", "def ceil_div(numer, denom):\n return -(-numer // denom)\n\n\ncups = sum(map(int, input().split()))\nmedals = sum(map(int, input().split()))\nshelves_needed = ceil_div(cups, 5) + ceil_div(medals, 10)\nprint(\"YES\" if int(input()) >= shelves_needed else \"NO\")\n", "a = sum(int(i) for i in input().split())\nb = sum(int(i) for i in input().split())\nn = int(input())\nn = n - (a + 4) // 5 - (b + 9) // 10\nres = \"YES\" if n >= 0 else \"NO\"\nprint(res)\n", "# LUOGU_RID: 101569705\na1, a2, a3, b1, b2, b3, n = map(int, open(0).read().split())\r\nprint((a1 + a2 + a3 - 1) // 5 + 1 + (b1 + b2 + b3 - 1) // 10 + 1 > n and 'NO' or 'YES')", "import math\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nn = int(input())\r\np = sum(a)\r\nq = sum(b)\r\nif (math.ceil(p/5)+math.ceil(q/10))<=n: \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a1, a2, a3=[int(k) for k in input().split()]\r\nb1, b2, b3=[int(k) for k in input().split()]\r\na, b=a1+a2+a3, b1+b2+b3\r\nn=int(input())\r\nif a//5+int(bool(a%5))+b//10+int(bool(b%10))<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "shelves = 0\r\ns_1 = sum(list(map(int,input().split())))\r\ns_2 = sum(list(map(int,input().split())))\r\nshelves += s_1//5 + int(s_1%5!=0) + s_2//10 + int(s_2%10!=0)\r\nn = int(input())\r\nprint('YES' if shelves <= n else 'NO')", "import math\r\na=sum(map(int,input().split()))\r\nb=sum(map(int,input().split()))\r\nn=int(input())\r\nprint(\"NO\" if (math.ceil(a/5)+math.ceil(b/10)>n) else \"YES\")", "import math\r\na,b,c,d,e,f,g,x = *map(int,input().split()), *map(int,input().split()), int(input()),0\r\nx += math.ceil((a+b+c)/5)\r\nx += math.ceil((d+e+f)/10)\r\nprint(\"YES\" if x <= g else \"NO\")", "a = list(map(int, input().split()))\nb = list(map(int, input().split()))\nn = int(input())\n\ncups = (a[0] + a[1] + a[2] + 4) // 5\nmedals = (b[0] + b[1] + b[2] + 9) // 10\n\nif cups + medals <= n:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "la=list(map(int,input().split()))\r\nlb=list(map(int,input().split()))\r\nn=int(input())\r\nsa=sum(la)\r\nsb=sum(lb)\r\nc=0\r\nif sa%5==0:\r\n c+=sa//5\r\nelse:\r\n c+=(sa//5)+1\r\nif sb%10==0:\r\n c+=sb//10\r\nelse:\r\n c+=(sb//10)+1\r\nif c<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\n\r\n\r\ndef solve(n, m, t):\r\n\r\n medc = math.ceil(n/5)\r\n medm = math.ceil(m/10)\r\n\r\n if medc + medm > t:\r\n return 'NO'\r\n\r\n return 'YES'\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = sum(list(map(int, input().split()))), sum(list(map(int, input().split())))\r\n t = int(input())\r\n print(solve(n, m, t))", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nt=sum(a)\r\nm=sum(b)\r\ns=0\r\ns+=((t//5)+(m//10))\r\nif t%5!=0:\r\n\ts+=1\r\nif m%10!=0:\r\n\ts+=1\r\nn=int(input())\r\nif s<=n:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "from math import ceil\n\na1, a2, a3 = map(int, input().split())\nb1, b2, b3 = map(int, input().split())\nn = int(input())\n\na = (a1 + a2 + a3) / 5\nb = (b1 + b2 + b3) / 10\n\nn -= ceil(a)\nn -= ceil(b)\n\nif n >= 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "import math\na1,a2,a3=list(map(int,input().split()))\nb1,b2,b3=list(map(int,input().split()))\nn=int(input())\ncups=a1+a2+a3\nmedals=b1+b2+b3\nmed_sh=math.ceil(medals/10)\ncup_sh=math.ceil(cups/5)\nif(med_sh+cup_sh)<=n:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=0\r\ns1=sum(a)\r\ns2=sum(b)\r\nc=c+s1//5\r\nif(s1%5!=0):\r\n c+=1\r\nc=c+s2//10\r\nif(s2%10!=0):\r\n c+=1\r\nsl=int(input())\r\nif(c<=sl):\r\n print('YES')\r\nelse:\r\n print('NO')", "import math\n\n(first_prize_cups, second_prize_cups, third_prize_cups) = map(int, input().split(' '))\n(first_prize_medals, second_prize_medals, third_prize_medals) = map(int, input().split(' '))\nshelves = int(input())\n\ncups = first_prize_cups + second_prize_cups + third_prize_cups\nmedals = first_prize_medals + second_prize_medals + third_prize_medals\n\nif shelves >= (math.ceil(cups / 5) + math.ceil(medals / 10)):\n print('YES')\nelse:\n print('NO')", "a1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\nn=int(input())\r\nm=a1+a2+a3\r\np=b1+b2+b3\r\nif m%5==0:\r\n s=m//5\r\nelse:\r\n s=(m//5)+1\r\nif p%10==0:\r\n d=p//10\r\nelse:\r\n d=(p//10)+1\r\nr=d+s\r\nif r<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a1, a2, a3 = map(int, input().split())\r\nb1, b2, b3 = map(int, input().split())\r\nn = int(input())\r\nif ((a1 + a2 + a3 - 1) // 5 + 1) + ((b1 + b2 + b3 - 1) // 10 + 1) <= n:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import math\r\nl = [int(x) for x in input().split()]\r\nm = [int(x) for x in input().split()]\r\nn = int(input())\r\nc = math.ceil(sum(l)/5)\r\nmm = math.ceil(sum(m)/10)\r\nif n<c+mm:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "from math import ceil\n\na1,a2,a3 = map(int,input().split(\" \"))\nb1,b2,b3 = map(int,input().split(\" \"))\nn = int(input())\nif ceil((a1+a2+a3)/5)+ceil((b1+b2+b3)/10) <= n:\n print (\"YES\")\nelse:\n print (\"NO\")", "a1,a2,a3 = map(int,input().split())\r\nb1,b2,b3 = map(int,input().split())\r\nn = int(input())\r\nsum1 = (a1 + a2 + a3) // 5\r\nsum2 = (b1 + b2 + b3) // 10\r\nif (a1 + a2 + a3) % 5 != 0 :\r\n sum1 += 1\r\nif (b1 + b2 + b3) % 10 != 0 :\r\n sum2 += 1\r\nif (sum1+sum2) <= n :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "a = map(int, input().split())\r\nb = map(int, input().split())\r\nn = int(input())\r\n\r\na1 = sum(a)\r\nb1 = sum(b)\r\n\r\n\r\nwhile a1 > 0:\r\n n = n - 1\r\n a1 = a1 - 5\r\nwhile b1 > 0:\r\n n = n - 1\r\n b1 = b1 - 10\r\n\r\nif n >= 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = sum([int(x) for x in input().split()])\nb = sum([int(x) for x in input().split()])\nc = int(input())\n\nimport math\n\nsa = math.ceil(a/5)\n\nsb = math.ceil(b/10)\n\nif c < sa + sb:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n\t \t \t\t \t\t\t \t\t\t \t \t \t\t", "i=lambda:sum(map(int,input().split()))\r\nprint('YNEOS'[((i()+4)//5+(i()+9)//10)>i()::2])", "import math\r\nx=input()\r\ny=input()\r\nz=int(input())\r\nc=[int(i) for i in x.split()]\r\nm=[int(i) for i in y.split()]\r\ns1=math.ceil((c[0]+c[1]+c[2])/5)\r\ns2=math.ceil((m[0]+m[1]+m[2])/10)\r\nif z-(s1+s2) < 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "a1, a2, a3 = map(int, input().split())\r\nb1, b2, b3 = map(int, input().split())\r\nn = int(input())\r\na = a1 + a2 + a3\r\nb = b1 + b2 + b3\r\nc = 1 if a % 5 else 0\r\nd = 1 if b % 10 else 0\r\na //= 5\r\nb //= 10\r\nif (a+b+c+d) <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nn = int(input())\r\nnum1 = math.ceil(sum(a) / 5)\r\nnum2 = math.ceil(sum(b) / 10)\r\nif num1 + num2 <= n:\r\n print('YES')\r\nelse:\r\n print('NO')", "from math import *\r\nx,y,z=map(int,input().split())\r\na,b,c=map(int,input().split())\r\nn=int(input())\r\nA=x+y+z;B=a+b+c\r\nprint('YES' if (ceil(A/5)+ceil(B/10))<=n else 'NO')", "a = sum(list(map(int, input().split())))\r\nb = sum(list(map(int, input().split())))\r\nn = int(input())\r\n\r\nk = ((a+5-1)//5) + (b+10-1)//10\r\n\r\nif k<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nn = int(input())\r\ns1 = sum(a)\r\ns2 = sum(b)\r\nq1 = s1 // 5\r\nr1 = s1 % 5\r\n# print(q1,r1)\r\nrem = n - q1\r\nif r1!=0:\r\n rem = rem - 1\r\n\r\n\r\nq2 = s2//10\r\nr2 = s2%10\r\n# print(q2,r2)\r\n\r\nrem = rem - q2\r\nif r2 != 0:\r\n rem = rem - 1\r\n\r\nif rem>=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\n\r\nacup = list(map(int, input().split()))\r\nbmed = list(map(int, input().split()))\r\nn = int(input())\r\n\r\ns = math.ceil(sum(acup)/5) + math.ceil(sum(bmed)/10)\r\n# print(s)\r\nif n >= s:\r\n print('YES')\r\nelse:\r\n print('NO')", "from math import *\r\nx1, x2, x3 = map(int, input().split())\r\ny1, y2, y3 = map(int, input().split())\r\nn = int(input())\r\nc = x1 + x2 + x3\r\nm = y1 + y2 + y3\r\nif int(ceil(c / 5)) + int(ceil(m / 10)) > n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a=sum(map(int,input().split()))\r\nb=sum(map(int,input().split()))\r\nn=int(input())\r\nif ((a+4)//5+(b+9)//10)<=n:\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\nn=int(input())\r\nif ((a+b+c)%5)==0:\r\n cups=(a+b+c)//5\r\nelse:\r\n cups=(a+b+c)//5+1\r\nif ((x+y+z)%10)==0:\r\n medals=(x+y+z)//10\r\nelse:\r\n medals=((x+y+z)//10)+1\r\nif cups+medals<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(map(int, input().split()))\nb = list(map(int, input().split()))\nshelves = int(input())\nout = 0\ntemp = 0\nfor n in a:\n temp += n\nout += temp // 5\nif (temp % 5 != 0):\n out += 1\ntemp = 0\nfor n in b:\n temp += n\nout += temp // 10\nif (temp % 10 != 0):\n out += 1\nprint(\"YES\" if shelves >= out else \"NO\")\n\t\t\t\t \t\t \t\t \t \t\t \t\t\t \t \t", "q, w, e = map(int, input().split())\r\nr, t, y = map(int, input().split())\r\nu = int(input())\r\ni = q + w + e\r\no = r + t + y\r\np = i // 5\r\np += o // 10\r\nif(i % 5 > 0):\r\n p += 1\r\nif(o % 10 > 0):\r\n p += 1\r\nif(p <= u):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a1, a2, a3 =[int(i) for i in input().split()]#kubki\r\nb1, b2, b3 = [int(i) for i in input().split()]#medali\r\nn = int(input())\r\nm = 0\r\nif (b1+b2+b3)%10==0:\r\n m = (b1+b2+b3)//10\r\nelse:\r\n m = (b1+b2+b3)//10+1\r\nk = 0\r\nif (a1+a2+a3)%5==0:\r\n k = (a1+a2+a3)//5\r\nelse:\r\n k = (a1+a2+a3)//5+1\r\nif k+m<=n:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nq = int(input())\r\na = sum(a) // 5 if 5 * (sum(a) // 5) == sum(a) else sum(a) // 5 + 1\r\nb = sum(b) // 10 if 10 * (sum(b) // 10) == sum(b) else sum(b) // 10 + 1\r\nif a + b > q:\r\n print('NO')\r\nelse:\r\n print('YES')", "from math import ceil\r\nc=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\nn=int(input())\r\nc=ceil(sum(c)/5)\r\nm=ceil(sum(m)/10)\r\nprint(\"YES\") if n>=(c+m) else print(\"NO\")", "a = (sum(list(map(int, input().split())))+5-1)//5\nb = (sum(list(map(int, input().split())))+10-1)//10\nn = int(input())\nif a+b <= n:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t \t \t\t\t\t \t\t \t \t\t \t \t\t\t", "cups = list(map(int, input().split()))\r\nmedals= list(map(int, input().split()))\r\nshelf = int(input())\r\nneeded = 0\r\nif sum(cups) % 5 ==0:\r\n needed += sum(cups)//5\r\nelse:\r\n needed += sum(cups)//5 + 1\r\n\r\nif sum(medals) % 10 == 0:\r\n needed += sum(medals)//10\r\nelse:\r\n needed += sum(medals)//10 + 1\r\n\r\nprint(\"YES\") if needed <= shelf else print(\"NO\")", "a1,a2,a3=map(int,input().split(' '))\r\nb1,b2,b3=map(int,input().split(' '))\r\nn=int(input())\r\np=0\r\na=a1+a2+a3\r\nb=b1+b2+b3\r\nif a>0:\r\n\tif a%5==0:\r\n\t\tp+=a//5\r\n\telse:\r\n\t\tp+=a//5\r\n\t\tp+=1\r\nif b>0:\r\n\tif b%10==0:\r\n\t\tp+=b//10\r\n\telse:\r\n\t\tp+=b//10\r\n\t\tp+=1\r\nif p>n:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "a1, a2, a3 = [int(i) for i in input().split()]\r\nb1, b2, b3 = [int(i) for i in input().split()]\r\nn = int(input())\r\na = a1+a2+a3\r\nb = b1+b2+b3\r\nl = a//5 + (a % 5 != 0)\r\nd = b//10 + (b % 10 != 0)\r\nif l+d <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\na,b,c = map(int,input().split())\r\ne,f,g = map(int,input().split())\r\nn = int(input())\r\nsum1 = math.ceil((a + b + c)/5)\r\nsum2 = math.ceil((e+f+g)/10)\r\nif sum1 + sum2 > n:\r\n print('NO')\r\nif sum1 + sum2 <= n:\r\n print('YES')\r\n\r\n\r\n", "a, b, c = map(int, input(). split())\r\na0, b0, c0 = map(int, input(). split())\r\nn = int(input())\r\nS1 = a + b + c\r\nS2 = a0 + b0 + c0\r\nif S1 % 5 == 0:\r\n n -= (S1 // 5)\r\nif S1 % 5 != 0:\r\n n -= (S1 // 5 + 1)\r\nif S2 % 10 == 0:\r\n n -= (S2 // 10)\r\nif S2 % 10 != 0:\r\n n -= (S2 // 10 + 1)\r\nif n >= 0:\r\n print('YES')\r\nif n < 0:\r\n print('NO')\r\n", "kub=[int(i) for i in input().split()]\r\nmed=[int(i) for i in input().split()]\r\ns=int(input())\r\nprint('NYOE S'[(sum(kub)+4)//5+(sum(med)+9)//10<=s::2])", "import math\r\na=input()\r\nb=input()\r\nc=int(input())\r\nk=a.split()\r\ng=b.split()\r\nsum1=int(g[0]) + int(g[1])+int(g[2])\r\nsum2=int(k[0]) + int(k[1])+ int(k[2])\r\nshelf=math.ceil(sum1/10) + math.ceil(sum2/5)\r\nif shelf > c:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "import math\r\nn1 = input().split()\r\nn2 = input().split()\r\nn3 = int(input())\r\nsum_cups = 0\r\nsum_medals = 0\r\nfor i in n1:\r\n sum_cups += int(i)\r\nfor i in n2:\r\n sum_medals += int(i)\r\n\r\nmin_cup_shelves = math.ceil(sum_cups / 5)\r\nmin_medal_shelves = math.ceil(sum_medals / 10)\r\nif min_medal_shelves + min_cup_shelves <= n3:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = map(int, input().split())\r\nb = map(int, input().split())\r\nn = int(input())\r\nprint(\"YES\" if (sum(a) + 4) // 5 + (sum(b) + 9) // 10 <= n else \"NO\")", "import math\na1,a2,a3 = list(map(int,input().split()))\nb1,b2,b3 = list(map(int,input().split()))\nn = int(input())\nk1 = math.ceil((a1+a2+a3)/5)\nk2 = math.ceil((b1+b2+b3)/10)\nif k1+k2<=n: \n print(\"YES\")\nelse:\n print(\"NO\")\n", "a=input()\r\na1=int(a.split()[0])\r\na2=int(a.split()[1])\r\na3=int(a.split()[2])\r\na4=a1+a2+a3 #total\r\nb=input()\r\nb1=int(b.split()[0])\r\nb2=int(b.split()[1])\r\nb3=int(b.split()[2])\r\nb4=b1+b2+b3\r\nn=int(input())\r\nif a4%5==0: a5=a4//5 #shelves for cups\r\nelse: a5=a4//5+1\r\nif b4%10==0: b5=b4//10 #shelves for medals\r\nelse: b5=b4//10+1\r\nif n<a5+b5: print(\"NO\")\r\nelse: print(\"YES\")\r\n", "a = sum(map(int, input().split()))\r\nb = sum(map(int, input().split()))\r\nn = int(input())\r\nif n < (a + 4) // 5 + (b + 9) // 10:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "a1,a2,a3=map(int, input().split())\r\nb1,b2,b3=map(int, input().split())\r\nn=int(input())\r\nx=a1+a2+a3\r\ny=b1+b2+b3\r\nif x%5==0:\r\n a=x//5\r\nelse:\r\n a=x//5+1\r\nif y%10==0:\r\n b=y//10\r\nelse:\r\n b=y//10+1\r\nif a+b<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\ncup=list(map(int,input().split()))\r\nmedal=list(map(int,input().split()))\r\nn=int(input())\r\ntc=0\r\ntm=0\r\nreqd=0\r\n\r\nfor i in cup:\r\n tc+=i\r\nfor i in medal:\r\n tm+=i\r\nif (math.ceil(tc/5)+math.ceil(tm/10))<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nn=int(input())\r\nimport math\r\na=math.ceil(sum(x)/5)\r\nb=math.ceil(sum(y)/10)\r\nif(a+b>n):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a = sum(map(int, input().split()))\r\nb = sum(map(int, input().split()))\r\nc = int(input())\r\nprint(\"YES\" if (a+4)//5+(b+9)//10<=c else \"NO\")", "# https://codeforces.com/problemset/problem/448/A\r\nimport math\r\n\r\na = input().split()\r\nb = input().split()\r\nn = int(input())\r\n\r\na_size = sum([int(x) for x in a])\r\nb_size = sum([int(x) for x in b])\r\na_ceiling = math.ceil(a_size/5)\r\nb_ceiling = math.ceil(b_size/10)\r\nif a_ceiling+b_ceiling > n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\r\na1, a2, a3 = map(int, input().split(\" \"))\r\nb1, b2, b3 = map(int, input().split(\" \"))\r\nn = int(input())\r\nsoNganCup = 0\r\nsoNganMedal = 0\r\ncup = a1 + a2 + a3\r\nmedal = b1 + b2 + b3\r\nif(cup == 0):\r\n soNganCup = 0\r\nelif(cup <= 5):\r\n soNganCup = 1\r\nelse:\r\n soNganCup = math.ceil(cup/5)\r\nif(medal == 0):\r\n soNganMedal = 0\r\nelif(medal <=10):\r\n soNganMedal = 1\r\nelse:\r\n soNganMedal = math.ceil(medal/10)\r\nif n >= soNganCup + soNganMedal:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a1, a2, a3 = [int(i) for i in input().split()]\r\nb1, b2, b3 = [int(i) for i in input().split()]\r\nn = int(input())\r\n\r\nshelves = (b1+b2+b3) // 10 + (1 if (b1+b2+b3) % 10 != 0 else 0) + (a1 + a2+a3) // 5 + (1 if (a1+a2+a3) % 5 != 0 else 0)\r\nif shelves <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\nsumCups = 0\r\nsumMedals = 0\r\n\r\ncups = input()\r\ncups = cups.split(\" \")\r\n\r\nmedals = input()\r\nmedals = medals.split(\" \")\r\n\r\nshelves = int(input())\r\n\r\nfor i in range(3):\r\n\tsumCups += int(cups[i])\r\n\tsumMedals += int(medals[i])\r\n\t\r\nmedalShelf = math.ceil(sumMedals/10)\r\nmedalCups = math.ceil(sumCups/5)\r\n\r\nif medalShelf + medalCups > shelves:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\r\n", "import math \r\ndef func(cups,medals,shelves):\r\n total_cups = 0\r\n total_medals = 0 \r\n for i in cups: \r\n total_cups += i \r\n for i in medals: \r\n total_medals += i\r\n shelves_needed = math.ceil(total_cups/5) + math.ceil(total_medals/10)\r\n if shelves_needed <= shelves: \r\n print(\"YES\")\r\n else: \r\n print(\"NO\")\r\n\r\ncups = list(map(int, input().split()))\r\nmedals = list(map(int, input().split()))\r\nshelves = int(input())\r\nfunc(cups,medals,shelves)", "a1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\nn=int(input())\r\na=a1+a2+a3\r\nb=b1+b2+b3\r\nif a%5==0:\r\n cub=a//5\r\n\r\nelse:\r\n cub=a//5+1\r\n\r\nif b%10==0:\r\n med=b//10\r\n\r\nelse:\r\n med=b//10+1\r\nvsego=cub+med\r\n\r\nif n>=vsego:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')", "from math import ceil\r\na1, a2, a3=map(int, input().split())\r\nb1, b2, b3=map(int, input().split())\r\nn= int(input())\r\nif n>= ceil((a1+a2+a3)/5)+ceil((b1+b2+b3)/10):\r\n print('YES')\r\nelse:\r\n print('NO')", "x=[int(w) for w in input().split()]\r\ny=[int(r) for r in input().split()]\r\nn=int(input())\r\nif (sum(x))%5!=0:\r\n n-=(int(sum(x)/5)+1)\r\nelse: \r\n n-=(int(sum(x)/5))\r\nif (sum(y))%10!=0:\r\n n-=(int(sum(y)/10)+1)\r\nelse:\r\n n-=(int(sum(y)/10))\r\nif n>=0:\r\n print('YES')\r\nelse:\r\n print('NO')", "u=map(int,input().split())\r\ni=map(int,input().split())\r\no=int(input())\r\na=sum(u)\r\nb=sum(i)\r\nlst=[]\r\nc=0\r\nc1=0\r\nif a%5!=0:\r\n c+=(a//5)+1\r\nelse:\r\n c+=(a//5)\r\nif b%10!=0:\r\n c1+=(b//10)+1\r\nelse:\r\n c1+=(b//10)\r\nif c1+c>o:\r\n lst.append(\"NO\")\r\nelse:\r\n lst.append(\"YES\")\r\nfor df in lst:\r\n print(df)", "cups = map(int,input().split())\r\nmedals = map(int,input().split())\r\nn = int(input())\r\na = (sum(cups)+5-1)//5\r\nb = (sum(medals)+10-1)//10\r\nprint(\"NO\" if a+b > n else \"YES\")", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nn = int(input())\r\n\r\nif (a[0]+a[1]+a[2]+4)//5 + (b[0]+b[1]+b[2]+9)//10 > n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\r\n\r\na1, a2, a3 = [int(i) for i in input().split()]\r\nb1, b2, b3 = [int(i) for i in input().split()]\r\nn = int(input())\r\n\r\nall_a = a1 + a2 + a3\r\nrequired_for_a = math.ceil(all_a / 5)\r\nall_b = b1 + b2 + b3\r\nrequired_for_b = math.ceil(all_b / 10)\r\n\r\nprint(\"YES\" if required_for_a + required_for_b <= n else \"NO\")\r\n", "c1,c2,c3=map(int,input().split())\r\nm1,m2,m3=map(int,input().split())\r\nn=int(input())\r\na=c1+c2+c3\r\nb=m1+m2+m3\r\nif((a//5+(a%5!=0))+(b//10+(b%10!=0))<=n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "from math import ceil\nf = lambda: sum(int(x) for x in input().split())\nc, m, n = f(), f(), int(input())\nprint('YES' if n >= (ceil(c / 5) + ceil(m / 10)) else 'NO')", "c = input().split(' ')\r\nm = input().split(' ')\r\nn = int(input())\r\n\r\na1 = int(c[0])\r\na2 = int(c[1])\r\na3 = int(c[2])\r\nb1 = int(m[0])\r\nb2 = int(m[1])\r\nb3 = int(m[2])\r\ns = (a1+a2+a3)/5\r\ns = int(s)\r\nif (a1+a2+a3) % 5 != 0:\r\n s += 1\r\ns += (b1+b2+b3)/10\r\ns = int(s)\r\nif (b1+b2+b3) % 10 != 0:\r\n s += 1\r\nif s <= n:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "import math\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nn = int(input())\r\nif n >= (math.ceil(sum(a) / 5) + math.ceil(sum(b) / 10)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=sum(map(int,input().split()))\nb=sum(map(int,input().split()))\nc=int(input())\nans=0\nif a%5==0:\n ans=ans+(a//5)\nelse:\n ans=ans+(a//5)+1\nif b%10==0:\n ans=ans+(b//10)\nelse:\n ans=ans+(b//10)+1\nif c>=ans:\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", "def krug(a, b):\r\n return (a+b-1) // b\r\n \r\nfirs = input()\r\ntwe = input()\r\nn = int(input())\r\na1 = int((firs.split(\" \")[0]))\r\na2 = int((firs.split(\" \")[1]))\r\na3 = int((firs.split(\" \")[2]))\r\nb1 = int((twe.split(\" \")[0]))\r\nb2 = int((twe.split(\" \")[1]))\r\nb3 = int((twe.split(\" \")[2]))\r\n\r\np = krug((a1 + a2 + a3), 5) + krug((b1 + b2 + b3), 10)\r\n\r\nif n >= p:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\n# Sat Oct 30 2021 17:21:54 GMT+0000 (Coordinated Universal Time)\n", "# link : https://codeforces.com/problemset/problem/448/A\r\n# author : Mohamed Ibrahim\r\n\r\ni=lambda:sum(map(int,input().split()))\r\nprint('YNEOS'[((i()+4)//5+(i()+9)//10)>i()::2])", "a1, a2, a3 = map(int, input().split())\r\nb1, b2, b3 = map(int, input().split())\r\nn = int(input())\r\nc = a1+a2+a3 \r\nm = b1+b2+b3 \r\nif c%5==0:\r\n tc = c//5 \r\nelse:\r\n tc = (c//5) +1\r\nif m%10==0:\r\n tm = m//10\r\nelse:\r\n tm = (m//10)+1\r\nif tc+tm <=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "cup1, cup2, cup3 = list([int(x) for x in input().split()])\r\nmedal1, medal2, medal3 = list([int(x) for x in input().split()])\r\nshelves = int(input())\r\nif (cup1 + cup2 + cup3) % 5 == 0:\r\n cup_space = int((cup1 + cup2 + cup3) / 5)\r\nelse:\r\n cup_space = (cup1 + cup2 + cup3) // 5 + 1\r\nif (medal1 + medal2 + medal3) % 10 == 0:\r\n medal_space = int((medal1 + medal2 + medal3) / 10)\r\nelse:\r\n medal_space = (medal1 + medal2 + medal3) // 10 + 1\r\nif medal_space + cup_space <= shelves:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a1, a2, a3 = map(int, input().split())\r\nb1, b2, b3 = map(int, input().split())\r\nn = int(input())\r\n\r\ncup_total = a1 + a2 + a3\r\nmedal_total = b1 + b2 + b3\r\n\r\nres = 0\r\nif cup_total % 5 == 0:\r\n res += cup_total // 5\r\nelse:\r\n res += cup_total // 5 + 1\r\n\r\nif medal_total % 10 == 0:\r\n res += medal_total // 10\r\nelse:\r\n res += medal_total // 10 + 1\r\n\r\nif res <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = []\r\na = input().split()\r\na = [int(items) for items in a]\r\nb = []\r\nb = input().split()\r\nb = [int(items) for items in b]\r\nn = int(input())\r\naTotal = a[0] + a[1] + a[2]\r\nbTotal = b[0] + b[1] + b[2]\r\nwhile aTotal >= 5:\r\n aTotal -= 5\r\n n -= 1\r\nwhile bTotal >= 10:\r\n bTotal -= 10\r\n n -= 1\r\nif n < 0:\r\n print(\"NO\")\r\nelif n == 0 and (b != 0 or a != 0):\r\n print(\"NO\")\r\nelif n == 1 and bTotal != 0 and aTotal != 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun May 9 12:02:14 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\ns = input().split()\r\ns = [int(i) for i in s]\r\nd = input().split()\r\nd = [int(i) for i in d]\r\nc = 0\r\nm = 0\r\nfor i in s:\r\n c += i\r\nfor i in d:\r\n m += i\r\nn = int(input())\r\ncn = 0\r\nwhile True:\r\n if c >= 5:\r\n cn += 1\r\n c -= 5\r\n elif c > 0:\r\n cn += 1\r\n break\r\n else:\r\n break\r\nwhile True:\r\n if m >= 10:\r\n cn += 1\r\n m -= 10\r\n elif m > 0:\r\n cn += 1\r\n break\r\n else:\r\n break\r\nif cn <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import ceil\r\na1,a2,a3=map(int, input().split())\r\nb1,b2,b3=map(int, input().split())\r\nn=int(input())\r\na=ceil((a1+a2+a3)/5)\r\nb=ceil((b1+b2+b3)/10)\r\nif n-(a+b)>=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a= list(map(int,input().split()))\r\nb= list(map(int,input().split()))\r\nn= int(input())\r\nif (sum(a)+4)//5 + (sum(b)+9)//10 <=n:\r\n print('YES')\r\nelse: \r\n print('NO') ", "import math\r\n\r\n\r\ncup=[int(i) for i in input().split()]\r\nmedal=[int(j) for j in input().split()]\r\nn=int(input())\r\ns_cup=sum(cup)\r\ns_medal=sum(medal)\r\nif s_cup%5==0:\r\n req_cup=math.floor(s_cup/5)\r\nelse :\r\n req_cup=int(math.floor(s_cup/5))+1\r\nif s_medal%10==0:\r\n req_medal=math.floor(s_medal/10)\r\nelse :\r\n req_medal=int(math.floor(s_medal/10))+1\r\nif req_cup+req_medal>n:\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")", "a1,a2,a3 = map(int,input().split())\nb1,b2,b3 = map(int,input().split())\npol = int(input())\nmed = a1+a2+a3\ncub = b1+b2+b3\n\nif (med % 5) == 0 :\n polm = med//5\nelse :\n polm = (med//5)+1\n\n\nif (cub % 10) == 0 :\n polc = cub//10\nelse :\n polc = (cub//10)+1\n\nif (polc + polm) > pol :\n print('NO')\nelse :\n print('YES')\n# Sun Oct 31 2021 17:58:14 GMT+0000 (Coordinated Universal Time)\n", "'''\nAuthor : knight_byte\nFile : A_Rewards.py\nCreated on : 2021-05-03 22:06:05\n'''\n\nimport math\n\n\ndef main():\n c = sum(list(map(int, input().split())))\n m = sum(list(map(int, input().split())))\n n = int(input())\n sc = math.ceil(c/5)\n sm = math.ceil(m/10)\n print(\"NYOE S\"[((sc+sm) <= n)::2])\n\n\nif __name__ == '__main__':\n main()\n", "a1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\nsuma=a1+a2+a3\r\nsumb=b1+b2+b3\r\nc=int(input())\r\npolki=c\r\nif (sumb+10-1)//10+(suma+5-1)//5>c:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "jiangbei=input().split(' ')\njiangpai=input().split(' ')\nN=eval(input())\nA=sum([eval(i) for i in jiangbei])\nB=sum([eval(i) for i in jiangpai])\ni=0\nj=0\nkey1=A//5\nkey2=B//10\nif key1*5<A:\n key1+=1\nif key2*10<B:\n key2+=1\nif key1+key2<=N:\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", "a=sum(map(int, input().split()))\r\nb=sum(map(int, input().split()))\r\nx=int(input())\r\nl=0\r\nl+=(a//5+1) if a%5 else a//5\r\nl+=(b//10+1) if b%10 else b//10\r\nprint(\"YES\") if l<=x else print(\"NO\")", "from math import ceil\r\na1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\nn=int(input())\r\na=(a1+a2+a3)\r\nna=ceil(a/5)\r\nb=b1+b2+b3\r\nnb=ceil(b/10)\r\nif n>=na+nb:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\na1,a2,a3=map(int,input(\"\").split())\r\nb1,b2,b3=map(int,input(\"\").split())\r\nn=int(input(\"\"))\r\nt=math.ceil((a1+a2+a3)/5)\r\nt2=math.ceil((b1+b2+b3)/10)\r\nif n>=(t+t2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\na1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\nn=eval(input())\r\na=a1+a2+a3\r\nb=b1+b2+b3\r\ni=math.ceil(a/5)\r\nj=math.ceil(b/10)\r\nif i+j>n:\r\n print('NO')\r\nelse:\r\n print('YES')", "if __name__ == '__main__':\r\n s = input().split()\r\n a = [int(i) for i in s]\r\n s = input().split()\r\n b = [int(i) for i in s]\r\n n = int(input())\r\n m = sum(b)\r\n k = sum(a)\r\n\r\n if m % 10 != 0:\r\n pm = m//10 + 1\r\n else:\r\n pm = m // 10\r\n\r\n if k % 5 != 0:\r\n pk = k // 5 + 1\r\n else:\r\n pk = k // 5\r\n if pm + pk <= n:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a1,a2,a3 = [int(x) for x in input().split()]\r\nb1,b2,b3 = [int(x) for x in input().split()]\r\nn = int(input())\r\na = a1+a2+a3\r\nb = b1+b2+b3\r\nans = 0\r\nif a%5 == 0:\r\n ans+=int(a/5)\r\nelse:\r\n ans+=int(a/5)+1\r\nif b%10 == 0:\r\n ans+=int(b/10)\r\nelse:\r\n ans+=int(b/10)+1\r\nif ans<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import ceil\ncups = ceil(sum(list(map(int, input().split()))) / 5)\nmedals = ceil(sum(list(map(int, input().split()))) / 10)\nsh = int(input())\nif cups + medals <= sh:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t \t\t\t \t\t \t \t \t\t \t \t\t", "li_c=list(map(int,input().split()))\r\nli_m=list(map(int,input().split()))\r\nn=int(input())\r\na=0\r\na_c,a_m=0,0\r\nfor i in range(3):\r\n a_c=a_c+li_c[i]\r\n a_m=a_m+li_m[i]\r\nc1=a_c/5\r\nif(c1.is_integer()):\r\n c1=int(c1)\r\nelse:\r\n c1=int(c1)+1\r\nn-=c1\r\nc2=a_m/10\r\nif(c2.is_integer()):\r\n c2=int(c2)\r\nelse:\r\n c2=int(c2)+1\r\nif(n>=c2):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n ", "a=list(map(int, input().split(maxsplit=2)))\r\nb=list(map(int, input().split(maxsplit=2)))\r\nn=int(input())\r\n\r\nif sum(a)%5==0 and sum(b)%10==0:\r\n if sum(a)//5+sum(b)//10<=n:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif sum(a)%5!=0 and sum(b)%10==0:\r\n if sum(a) // 5 + sum(b) // 10+1 <= n:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif sum(a)%5==0 and sum(b)%10!=0:\r\n if sum(a) // 5 + sum(b) // 10 + 1 <= n:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif sum(a)%5!=0 and sum(b)%10!=0:\r\n if sum(a) // 5 + sum(b) // 10 + 2 <= n:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "import math\r\na = sum(list(map(int,input().split())))\r\nb = sum(list(map(int,input().split())))\r\nn = int(input())\r\nif (math.ceil(a/5)+math.ceil(b/10)) <=n:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nn = int(input())\r\ncups = (sum(a) + 4) // 5\r\nmedals = (sum(b) + 9) // 10\r\n# print(cups)\r\n# print(medals)\r\n# print(cups + medals)\r\nif (cups + medals) <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math;\n\ncups = [int(x) for x in input().split()]\nmedals = [int(x) for x in input().split()]\nn = int(input())\n\nnumCups, numMedals = 0, 0\nfor c in cups:\n\tnumCups += c\nfor m in medals:\n\tnumMedals += m\n\nrequiredShelves = 0\n# print(numCups)\n# print(numMedals)\nrequiredShelves += math.ceil(numCups/5)\nrequiredShelves += math.ceil(numMedals/10)\nif requiredShelves <= n:\n\tprint('YES')\nelse:\n\tprint('NO')\n \t \t \t \t \t\t\t\t \t \t \t\t", "import math\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nn=int(input())\r\nx=sum(a)\r\ny=sum(b)\r\np=math.ceil(x/5)\r\nq=math.ceil(y/10)\r\nif n>=(p+q):\r\n print('YES')\r\nelse:\r\n print('NO')", "from math import ceil,gcd\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\n\r\ndef li():\r\n return list(map(int,input().split()))\r\ndef arr(a):\r\n return array('i',a)\r\n\r\ndef solve():\r\n #for _ in range(int(input())):\r\n # n=input()\r\n a=li()\r\n b=li()\r\n n=int(input())\r\n if n>=(ceil(sum(b)/10)+ceil(sum(a)/5)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nsolve()\r\n", "a1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\nn=int(input())\r\ncup=a1+a2+a3\r\nmedals=b1+b2+b3\r\nshelv=0\r\nif cup%5!=0:\r\n shelv+=(int(cup/5))+1\r\nelse:\r\n shelv+=int(cup/5)\r\nif medals%10!=0:\r\n shelv+=(int(medals/10))+1\r\nelse:\r\n shelv+=int(medals/10)\r\nif shelv<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "a = sorted(list(map(int, input().split())), reverse = True)\r\nb = sorted(list(map(int, input().split())), reverse = True)\r\nn = int(input())\r\n\r\nres = [0]\r\nflag = True\r\ni = 0\r\ncomplete = False\r\nwhile flag and not complete:\r\n for cup in a:\r\n if res[i] + cup == 5:\r\n res[i] += cup\r\n if res[-1] != 0:\r\n i += 1\r\n res.append(0)\r\n\r\n elif res[i] + cup < 5:\r\n res[i] += cup\r\n if res[i] == 5:\r\n if res[-1] != 0:\r\n i += 1\r\n res.append(0)\r\n else:\r\n canPut = 5 - res[i]\r\n res[i] += canPut\r\n remain = cup - canPut\r\n while remain >= 5:\r\n res.append(5)\r\n remain -= 5\r\n i += 1\r\n if remain != 0:\r\n res.append(remain)\r\n i += 1\r\n if len(res) > n:\r\n flag = False\r\n break\r\n if res[-1] != 0:\r\n i += 1\r\n res.append(0)\r\n for medals in b:\r\n if res[i] + medals == 10:\r\n res[i] += medals\r\n i += 1\r\n res.append(0)\r\n elif res[i] + medals < 10:\r\n res[i] += medals\r\n if res[i] == 10:\r\n i += 1\r\n res.append(0)\r\n else:\r\n canPut = 10 - res[i]\r\n res[i] += canPut\r\n remain = medals - canPut\r\n while remain >= 10:\r\n res.append(10)\r\n remain -= 10\r\n i += 1\r\n res.append(remain)\r\n i += 1\r\n if res[-1] == 0:\r\n res.pop()\r\n if len(res) > n:\r\n flag = False\r\n break\r\n else:\r\n complete = True\r\nif flag == False or len(res) > n:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "from math import ceil\r\n# for _ in range(int(input())):\r\na1,a2,a3 = map(int,input().split())\r\nb1,b2,b3 = map(int,input().split())\r\nn = int(input())\r\nif ((ceil((a1+a2+a3)/5)+ceil((b1+b2+b3)/10))<=n):\r\n print('YES')\r\nelse:\r\n print('NO')", "import math\r\na1, a2, a3 = [int(i) for i in input().split()]\r\nb1, b2, b3 = [int(i) for i in input().split()]\r\nn = int(input())\r\na, b = a1 + a2 + a3, b1 + b2 + b3\r\nm = math.ceil(a/5) + math.ceil(b/10)\r\nif n >= m:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import os\r\nimport sys\r\nimport random\r\nfrom typing import List, Tuple\r\n\r\nif 'COMPUTERNAME' in os.environ and os.environ['COMPUTERNAME'] == 'AZAMAT':\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n\r\n\r\nconst = 1000000007\r\n\r\n\r\ndef in_int() -> int:\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef in_str() -> str:\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef in_map_int() -> map:\r\n return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef in_map_str() -> List:\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef in_arr_int() -> List:\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef in_arr_str() -> List:\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef gcd(x: int, y: int) -> int:\r\n x, y = max(x, y), min(x, y)\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\ndef is_simple(x: int) -> bool:\r\n k = int(x ** 0.5) + 1\r\n for i in range(2, k + 1):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\n\r\ndef low_sqrt(x: int) -> int:\r\n i = 1\r\n while i * i < x:\r\n i += 1\r\n return i\r\n\r\n\r\ndef high_sqrt(x: int) -> int:\r\n i = 1\r\n while i * i <= x:\r\n i += 1\r\n return i\r\n\r\n\r\ndef C(n: int, k: int) -> int:\r\n i = 1\r\n kk = 1\r\n while i <= k:\r\n kk *= i\r\n i += 1\r\n nn = kk\r\n while i <= n:\r\n nn *= i\r\n i += 1\r\n j = 1\r\n nk = 1\r\n while j <= n - k:\r\n nk *= j\r\n j += 1\r\n return nn // (kk * nk)\r\n\r\n\r\ndef divisors(x: int) -> dict:\r\n dct = {}\r\n i = 2\r\n while x > 1:\r\n if x % i == 0:\r\n x //= i\r\n dct[i] = dct.get(i, 0) + 1\r\n else:\r\n i += 1\r\n return dct\r\n\r\n\r\n# =====================================\r\n\r\n\r\ndef render() -> Tuple:\r\n n = random.randint(1, 5)\r\n arr = [[] for _ in range(n)]\r\n k = 0\r\n for i in range(n):\r\n m = random.randint(1, 10)\r\n k += m\r\n for j in range(m):\r\n arr[i].append(random.randint(1, 10))\r\n return n, k, arr\r\n\r\n\r\ndef slow(n: int, k: int, arr: List) -> List:\r\n ans = []\r\n for i in range(n):\r\n ans.extend(arr[i])\r\n ans.sort()\r\n return ans\r\n\r\n\r\ndef test() -> None:\r\n t = 10\r\n for i in range(t):\r\n n, k, arr = render()\r\n slow_ = slow(n, k, arr)\r\n fast_ = solve(n, arr)\r\n if slow_ == fast_:\r\n print(f'Test {i + 1}: OK')\r\n else:\r\n print(f'Test {i + 1}: Wrong answer')\r\n print(n)\r\n print(*arr)\r\n print()\r\n print('Found:', *fast_)\r\n print('Expected:', *slow_)\r\n print('======================================')\r\n\r\n\r\n# =====================================\r\n\r\n\r\ndef solve(n: int, a1: int, a2: int, a3: int, b1: int, b2: int, b3: int) -> str:\r\n a = a1 + a2 + a3\r\n b = b1 + b2 + b3\r\n ka = (a + 4) // 5\r\n kb = (b + 9) // 10\r\n if ka + kb > n:\r\n return 'NO'\r\n return 'YES'\r\n\r\n\r\ndef main() -> None:\r\n f = False\r\n t = 1\r\n if f:\r\n t = in_int()\r\n for _ in range(t):\r\n test_ = 0\r\n if test_:\r\n test()\r\n else:\r\n a1, a2, a3 = in_map_int()\r\n b1, b2, b3 = in_map_int()\r\n n = in_int()\r\n print(solve(n, a1, a2, a3, b1, b2, b3))\r\n # print(*slow(n, arr))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import math\r\n\r\na,b,c= map(int,input().split())\r\nd,e,f= map(int,input().split())\r\nn = int(input())\r\n\r\nsum1 = a+b+c\r\nsum2 = d+e+f\r\n\r\nss1 = math.ceil(sum1/5)\r\nss2 = math.ceil(sum2/10)\r\n\r\nif ss1+ss2 <= n:\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 A = sum(map(int, wtf[0].split()))\r\n B = sum(map(int, wtf[1].split()))\r\n n = int(wtf[2])\r\n print('YES' if (math.ceil(A/5) + math.ceil(B/10)) <= n else 'NO')\r\n", "cups = list(map(int, input().split()))\r\nmdls = list(map(int, input().split()))\r\nn = int(input())\r\nc = -((-sum(cups))//5)\r\nm = -((-sum(mdls))//10)\r\nprint([\"NO\",\"YES\"][n >= c+m])", "import math\r\na=sum(map(int,input().split()))\r\nb=sum(map(int,input().split()))\r\nn=int(input())\r\nsa=math.ceil(a/5)\r\nsb=math.ceil(b/10)\r\nif(sa+sb > n):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nn = int(input())\r\naa = sum(a)\r\nbb = sum(b)\r\ncups = math.ceil(aa/5)\r\nmedals = math.ceil(bb/10)\r\nif n-cups-medals >=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l=lambda:sum(map(int,input().split()))\r\nprint('YNEOS'[((l()+4)//5+(l()+9)//10)>l()::2])", "\r\n # n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nn=int(input())\r\na1=sum(a)\r\nb1=sum(b)\r\ns=0\r\nif(b1%10==0):\r\n s+=b1//10\r\nelse:\r\n s+=b1//10+1\r\nif(a1%5==0):\r\n s+=a1//5\r\nelse:\r\n s+=a1//5+1\r\nif(s<=n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nn=int(input())\r\nif sum(x)%5>0:\r\n a=sum(x)//5+1\r\nelse:\r\n a=sum(x)//5\r\nif sum(y)%10>0:\r\n b=sum(y)//10+1\r\nelse:\r\n b=sum(y)//10\r\nif a+b<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\ncups = list(map(int, input().split()))\r\nmedals = list(map(int, input().split()))\r\nshelves = int(input())\r\nused = math.ceil(sum(cups) / 5) + math.ceil(sum(medals) / 10)\r\n\r\nif used > shelves:\r\n print(\"NO\")\r\n \r\nif used <= shelves:\r\n print(\"YES\")", "a1, a2, a3 = map(int, input().split())\nb1, b2, b3 = map(int, input().split())\nn = int(input())\ncups = a1 + a2 + a3\nc = cups//5\nif cups - 5 * c > 0:\n c += 1\nmedals = b1 + b2 + b3\nm = medals//10 \nif medals - m * 10 > 0:\n m += 1\nif c + m <= n:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t\t \t\t \t \t \t\t \t \t \t", "c=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\ncups=sum(c)\r\nmedals=sum(m)\r\nn=int(input())\r\nif cups%5==0:\r\n nc=cups//5\r\nelse:\r\n nc=(cups//5)+1 \r\nif medals%10==0:\r\n nm=medals//10\r\nelse:\r\n nm=(medals//10)+1 \r\nif nc+nm<=n:\r\n print('YES')\r\nelse:\r\n print('NO')", "import math\r\n\r\na1, a2, a3 = [int(i) for i in input().split()]\r\nb1, b2, b3 = [int(i) for i in input().split()]\r\nn = int(input())\r\n\r\na = (a1 + a2 + a3)\r\nb = (b1 + b2 + b3)\r\n\r\nc = math.ceil(a / 5)\r\nd = math.ceil(b / 10)\r\n\r\nif c + d <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c=map(int,input().split())\r\na1,b1,c1=map(int,input().split())\r\nn=int(input())\r\nif ((a+b+c+4)//5 + (a1+b1+c1+9)//10)<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a, b, c = map(int, input().split())\r\nd, e, f = map(int, input().split())\r\nx = int(input())\r\ncheck = (a+b+c+4)//5+(d+e+f+9)//10\r\nprint(\"YES\" if check <= x else \"NO\")", "a1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\nn=int(input())\r\na=a1+a2+a3\r\nb=b1+b2+b3\r\nif a%5==0:\r\n x=a//5\r\nelse:\r\n x=(a//5)+1\r\nif b%10==0:\r\n y=b//10\r\nelse:\r\n y=(b//10)+1\r\nif x+y<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input().split()\nfor i in range(len(a)):\n a[i] = int(a[i])\nb = input().split()\nfor i in range(len(b)):\n b[i] = int(b[i])\nn = int(input())\n\ncupShelf = (a[0] + a[1] + a[2]) // 5\nif (a[0] + a[1] + a[2]) % 5 != 0:\n cupShelf += 1\nmedalShelf = (b[0] + b[1] + b[2]) // 10\nif (b[0] + b[1] + b[2]) % 10 != 0:\n medalShelf += 1\n\nif cupShelf + medalShelf > n:\n print(\"NO\")\nelse:\n print(\"YES\")\n\t\t \t \t \t \t\t \t \t\t\t \t \t\t", "import math\r\n\r\ndef place_rewards():\r\n all_a = [int(i) for i in input().split()]\r\n all_b = [int(i) for i in input().split()]\r\n n = int(input())\r\n ab = math.ceil(sum(all_a)/5) + math.ceil(sum(all_b)/10)\r\n\r\n if ab <= n:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n \r\n\r\nprint(place_rewards())\r\n", "import math\r\na = input().split()\r\naa = [int(i) for i in a]\r\nc = sum(aa)\r\nb = input().split()\r\nbb = [int(i) for i in b]\r\nm = sum(bb)\r\ns= 0\r\nfor i in range(0,c,5):\r\n s+=1\r\nfor i in range(0,m,10):\r\n s+=1\r\nn = int(input())\r\nif n >= s:\r\n print('YES')\r\nelse:\r\n print('NO')", "import math\r\na1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\nn=int(input())\r\ns=(a1+a2+a3)/5\r\ns1=math.ceil(s)\r\nc=(b1+b2+b3)/10\r\nc1=math.ceil(c)\r\nif c1+s1>n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "import math\r\na, b, c = [int(x) for x in input().split()]\r\nd, e, f = [int(x) for x in input().split()]\r\nif math.ceil((a + b + c) / 5) + math.ceil((d + e + f) / 10) > int(input()):\r\n print(\"NO\")\r\nelse:\r\n print('YES')", "# testCaseNum = int(input())\n# for testCase in range(testCaseNum):\n# a ,b ,k = map(int ,input().split())\ncups = list(map(int ,input().split()))\nmedals = list(map(int ,input().split()))\nn = int(input())\nimport itertools\ncnt = (sum(cups) + 4)//5\ncnt += (sum(medals) + 9)//10\nif n >= cnt:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import math\r\na = list(map(int,input().split(\" \")))\r\nb = list(map(int,input().split(\" \")))\r\nsa = sum(a)\r\nsb = sum(b)\r\nn = int(input())\r\nprint((\"NO\",\"YES\")[math.ceil(sa/5)+math.ceil(sb/10)<=n])\r\n \r\n \r\n", "a = sum(map(int, input().split()))\nb = sum(map(int, input().split()))\nprint([\"NO\", \"YES\"][abs(a // -5) + abs(b // -10) <= int(input())])\n", "a1, a2, a3 = map(int, input().split())\r\nb1, b2, b3 = map(int, input().split())\r\nn = int(input())\r\nshelves = [0 for i in range(n)]\r\na = sum((a1, a2, a3))\r\nb = sum((b1, b2, b3))\r\nfor i in range(n):\r\n if (a > 0):\r\n temp = a - shelves[i]\r\n shelves[i] = a - shelves[i]\r\n a -= temp \r\n if shelves[i] > 5:\r\n temp = shelves[i] - 5\r\n shelves[i] -= temp\r\n a += temp \r\nfor i in range(n):\r\n if b > 0 and shelves[i] == 0:\r\n shelves[i] = b\r\n b = 0\r\n if shelves[i] > 10:\r\n temp = shelves[i] - 10\r\n b += temp\r\n shelves[i] -= temp\r\nprint(\"YES\") if a == 0 and b == 0 else print(\"NO\")\r\n \r\n", "\r\nz,x,c = map(int,input().split()) # кубки\r\n\r\nq,w,e = map(int,input().split()) # медали\r\n\r\nn = int(input())\r\n\r\na = z + x + c\r\nb = q + w + e\r\n\r\na_okr = (a + 5 - 1) // 5\r\nb_okr = (b + 10 - 1) // 10\r\n\r\nif a_okr+b_okr > n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n ", "a1, a2, a3 = map(int, input().split(' '))\r\nb1, b2, b3 = map(int, input().split(' '))\r\nn = int(input())\r\n\r\ns = (a1 + a2 + a3 + 4) // 5\r\ns += (b1 + b2 + b3 + 9) // 10\r\n\r\nprint('YES' if s <= n else 'NO')\r\n", "\r\n\r\na1,a2,a3 = map(int,input().split())\r\n\r\nb1,b2,b3 = map(int,input().split())\r\n\r\n\r\n\r\nn =int(input())\r\nimport math\r\n\r\n\r\na = math.ceil((a1+a2+a3)/5)\r\nb = math.ceil((b1+b2+b3)/10)\r\n\r\nif a+b <= n:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from math import ceil\r\n\r\nc1, c2, c3 = map(int, input().split())\r\nm1, m2, m3 = map(int, input().split())\r\n\r\nc = c1 + c2 + c3\r\nm = m1 + m2 + m3\r\n\r\nn = int(input())\r\n\r\ncs = ceil(c / 5)\r\nms = ceil(m / 10)\r\n\r\ns = cs + ms\r\n\r\nprint(\"YES\" if s <= n else \"NO\")", "import math\r\na = sum(list(map(int,input().split())))\r\nb = sum(list(map(int,input().split())))\r\nn = int(input())\r\naS = (a + 4) // 5\r\nbS= (b + 9) // 10\r\nlagbe = aS+bS\r\nprint(\"YES\") if lagbe <=n else print(\"NO\")", "import math\r\na, b, c = map(int, input().split(\" \"))\r\nq, w, e = map(int, input().split(\" \"))\r\np = int(input())\r\n \r\na = a+b+c\r\nb = q+w+e\r\na = math.ceil(a/5)\r\nb = math.ceil(b/10)\r\nif a+b<=p:\r\n print('YES')\r\nelse:\r\n print('NO')", "list1 = list(map(int, input().split()))\r\nlist2 = list(map(int, input().split()))\r\nn = int(input())\r\nif sum(list1)%5 ==0:\r\n cup_shelf = sum(list1)//5\r\nelse:\r\n cup_shelf = sum(list1)//5 +1\r\nif sum(list2)%10 ==0:\r\n medal_shelf = sum(list2)//10\r\nelse:\r\n medal_shelf = sum(list2)//10 +1\r\n\r\nprint(\"YES\" if cup_shelf + medal_shelf <= n else \"NO\")", "import math\r\n\r\nif __name__ == \"__main__\":\r\n (a1,a2,a3) = map(int,input().split())\r\n (b1,b2,b3) = map(int,input().split())\r\n n = int(input())\r\n\r\n cups = a1 + a2 + a3\r\n medals = b1 + b2 + b3\r\n count = 0\r\n\r\n count += math.ceil(cups/5) + math.ceil(medals/10)\r\n \r\n if(count <= n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nn = int(input())\r\ntotal_cups = sum(a)\r\ntotal_medals = sum(b)\r\n\r\nif total_cups % 5 == 0:\r\n shelves_for_cups = total_cups // 5\r\nelse:\r\n shelves_for_cups = total_cups // 5 + 1\r\n\r\nif total_medals % 10 == 0:\r\n shelves_for_medals = total_medals // 10\r\nelse:\r\n shelves_for_medals = total_medals // 10 + 1\r\n\r\nif shelves_for_cups + shelves_for_medals <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\na1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\nn=int(input())\r\n\r\nslv_a=math.ceil((a1+a2+a3)/5)\r\nslv_b=math.ceil((b1+b2+b3)/10)\r\n\r\nif slv_a+slv_b<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "a = map(int,input().split())\r\nb = map(int,input().split())\r\nn = int(input())\r\ncups = sum(a)\r\nmedels = sum(b)\r\ncount = 0\r\nwhile cups>0 :\r\n cups -= 5\r\n count += 1\r\nwhile medels>0 :\r\n medels -= 10\r\n count += 1\r\nif n>=count :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nn=int(input())\r\nif(math.ceil(sum(a)/5)+math.ceil(sum(b)/10)<=n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nn=int(input())\r\nx,y=0,0\r\nif(sum(a)%5==0):\r\n x=sum(a)//5\r\nelse:\r\n x=sum(a)//5+1\r\nif(sum(b)%10==0):\r\n y=sum(b)//10\r\nelse:\r\n y=sum(b)//10+1\r\nif(x+y<=n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = sum(map(int, input().split()))\r\nb = sum(map(int, input().split()))\r\nn = int(input())\r\nprint(\"YES\" if (a+4) // 5 + (b+9) // 10 <= n else \"NO\")", "\r\nimport math\r\n\r\n\r\ndef is_possible(cups, medals, shelfs_count):\r\n cups_shelfs = 0\r\n medals_shefs = 0\r\n\r\n cups_count = sum(cups)\r\n cups_shelfs = math.ceil( cups_count / 5)\r\n\r\n\r\n\r\n if cups_shelfs > shelfs_count:\r\n return \"NO\"\r\n \r\n medals_count = sum(medals)\r\n medals_shefs = math.ceil(medals_count / 10)\r\n\r\n if medals_shefs > shelfs_count:\r\n return \"NO\"\r\n\r\n if (cups_shelfs + medals_shefs) > shelfs_count:\r\n return \"NO\"\r\n \r\n return \"YES\"\r\n \r\n\r\n\r\n\r\ndef main(): \r\n\r\n cups = [int(x) for x in input().split(' ')]\r\n medals = [int(x) for x in input().split(' ') ]\r\n shelfs_count = int(input())\r\n\r\n print(is_possible(cups=cups, medals=medals, shelfs_count=shelfs_count))\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\na= list(map(int, input().split()))\r\nb= list(map(int, input().split()))\r\nn= int(input())\r\n\r\nx= math.ceil(sum(a)/5)\r\ny= math.ceil(sum(b)/10)\r\n\r\nif (x+y)<=n: print('YES')\r\nelse: print('NO')\r\n \r\n", "l1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nn=int(input(''))\r\ns1=sum(l1)\r\ns2=sum(l2)\r\nif s1/5-int(s1/5)==0:\r\n k=int(s1/5)\r\nelse:\r\n k=int(s1/5)+1\r\nif (s2/10)-int(s2/10)==0:\r\n p=int(s2/10)\r\nelse:\r\n p=int(s2/10)+1\r\nif k+p<=n:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "a1,a2,a3=[int(x) for x in input().split()]\r\nb1,b2,b3=[int(x) for x in input().split()]\r\nc=int(input())\r\na,b=a1+a2+a3,b1+b2+b3\r\nif (a+4)//5+(b+9)//10>c:\r\n print('NO')\r\nelse: \r\n print('YES')", "import math\r\n\r\na1, a2, a3 = map(int, input().split())\r\nb1, b2, b3 = map(int, input().split())\r\nn = int(input())\r\n\r\ncups_count = a1 + a2 + a3\r\nmedals_count = b1 + b2 + b3\r\n\r\nshelfs_for_cups = math.ceil(cups_count / 5)\r\nshelfs_for_medals = math.ceil(medals_count / 10)\r\n\r\nif shelfs_for_medals + shelfs_for_cups > n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "from math import ceil\r\n\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nn = int(input())\r\nif ceil(sum(a)/5) + ceil(sum(b)/10) > n:\r\n print('NO')\r\nelse:\r\n print('YES')", "import math\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nn = int(input())\r\np = sum(a)\r\nm = sum(b)\r\nif (math.ceil(p/5) + math.ceil(m/10)) > n:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import math\r\n\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nn = int(input())\r\n\r\nx = math.ceil(sum(a)/5); y = math.ceil(sum(b)/10)\r\nprint( \"YES\" if (x+y<=n) else \"NO\")", "from math import ceil\r\na = sum(list(map(int,input().split())))\r\nb = sum(list(map(int,input().split())))\r\nn = int(input())\r\nif ceil(a/5)+ceil(b/10)<= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = (sum(list(map(int, input().split())))+5-1)//5\r\nb = (sum(list(map(int, input().split())))+10-1)//10\r\nn = int(input())\r\nif a+b <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a1, a2, a3 = map(int, input(). split())\nb1, b2, b3 = map(int, input(). split())\nn = int(input())\ncups = a1 + a2 + a3\nmedals = b1 + b2 + b3\ntotal = 0\nwhile medals > 0:\n medals -= 10\n total += 1\nwhile cups > 0:\n cups -= 5\n total += 1\nif n >= total:\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", "import math\r\n\r\nk, b, c = input().split()\r\nk = int(k)\r\nb = int(b)\r\nc = int(c)\r\nx = k + b + c\r\nx = x / 5\r\nx = math.ceil(x)\r\nq, w, e = input().split()\r\nq = int(q)\r\nw = int(w)\r\ne = int(e)\r\nf = q + w + e\r\nf = f / 10\r\nf = math.ceil(f)\r\nm = int(input())\r\nif f+x>m:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "import sys\nimport math\ninput = sys.stdin.readline\n\nAS = sum(map(int, input().split()))\nBS = sum(map(int, input().split()))\nSC = int(input())\nprint([\"NO\", \"YES\"][math.ceil(AS/5) + math.ceil(BS/10) <= SC])", "from math import ceil\r\nc=sum(list(map(int,input().split())))\r\nm=sum(list(map(int,input().split())))\r\nk=int(input())\r\nt=ceil(c/5)+ceil(m/10)\r\nif k>=t:\r\n\tprint(\"YES\")\r\nelse:\t\r\n\tprint(\"NO\")\r\n", "import math\r\na, b, c = [int(i) for i in input().split()]\r\nq, w, e = [int(i) for i in input().split()]\r\np = int(input())\r\n\r\na = a+b+c\r\nb = q+w+e\r\na = math.ceil(a/5)\r\nb = math.ceil(b/10)\r\nif a+b<=p:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "import math\r\n\r\ndef _input():\r\n return map(int, input().split())\r\n\r\ncup, medal = sum(_input()), sum(_input())\r\n\r\nn = int(input())\r\n\r\nif cup <= n*5:\r\n if cup <=5 and cup>0: \r\n n-=1\r\n else:\r\n n-=math.ceil(cup/5)\r\n if medal>0:\r\n if medal <=10 and medal>0:\r\n n-=1\r\n else:\r\n n-=math.ceil(medal/10)\r\n print(\"YES\" if n>=0 else \"NO\")\r\n\r\nelse:\r\n print(\"NO\")", "kub=input()\r\nmed=input()\r\nn=int(input())\r\nkubsum=0\r\nkubmed=0\r\nfor sim in kub.split():\r\n kubsum+=int(sim)\r\nfor sim in med.split():\r\n kubmed+=int(sim)\r\nif kubsum//5+min(1,kubsum%5)+kubmed//10+min(1,kubmed%10)>n:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "#بسم الله الرحمن الرحيم\r\ncup = [int(i) for i in input().split()]\r\nmedal = [int(i) for i in input().split()]\r\nshaves = int(input())\r\nx = sum(cup)\r\nx=abs(x//-5)\r\nz = sum(medal)\r\nz=abs(z//-10)\r\nif x+z<=shaves:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nn = int(input())\r\nif math.ceil(sum(a) / 5) + math.ceil(sum(b) / 10) <= n:\r\n print('YES')\r\nelse:\r\n print('NO')", "a1, a2, a3 = [int(i) for i in input().split()] \r\nb1, b2, b3 = [int(i) for i in input().split()] \r\nb = int(input()) \r\nk = 0 \r\nif (a1+a2+a3) % 5 == 0: \r\n k+=(a1+a2+a3)//5 \r\nelse: \r\n f = (a1+a2+a3)//5 \r\n k += f+1 \r\nif (b1+b2+b3) % 10 == 0: \r\n k += (b1+b2+b3)//10 \r\nelse: \r\n h = (b1+b2+b3)//10 \r\n k += h +1 \r\nif k <= b: \r\n print(\"YES\") \r\nelse: \r\n print(\"NO\")", "i=lambda k:-(-sum(map(int,input().split()))//k)\r\nprint('YNEOS'[i(5)+i(10)>i(1)::2])", "\r\nt = 1#int(input())\r\nfor q in range(0, t):\r\n\r\n lenght = 3\r\n s = input().split(\" \")\r\n y = input().split(\" \")\r\n ch1 = 0\r\n ch2 = 0\r\n n = int(input())\r\n for i in range(0, lenght):\r\n ch1 += int(s[i])\r\n ch2 += int(y[i])\r\n if ch1 // 5 != ch1 / 5:\r\n ch1 = (ch1 // 5) + 1\r\n else:\r\n ch1 = (ch1 // 5)\r\n if ch2 // 10 != ch2 / 10:\r\n ch2 = (ch2 // 10) + 1\r\n else:\r\n ch2 = (ch2 // 10)\r\n if ch2 + ch1 > n:\r\n print('NO')\r\n else:\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\n", "a1,a2,a3=map(int,input().split())\r\nb1,b2,b3=map(int,input().split())\r\nn=int(input())\r\ncup=a1+a2+a3\r\nmedal=b1+b2+b3\r\ncount=cup//5+medal//10\r\nif(cup%5!=0):\r\n count+=1\r\nif(medal%10!=0):\r\n count+=1\r\nif(n>=count):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "if (sum([int(i) for i in input().split()]) + 4) // 5 + (sum([int(i) for i in input().split()]) + 9) // 10 <= int(input()):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "a1,a2,a3=[int(i) for i in input().split()]\r\nb1,b2,b3=[int(i) for i in input().split()]\r\nn=int(input())\r\na=a1+a2+a3\r\nb=b1+b2+b3\r\nif a%5==0:\r\n c=a//5\r\nelse:\r\n c=a//5+1\r\nif b%10==0:\r\n c+=b//10\r\nelse:\r\n c+=b//10+1\r\nif c<=n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nn=int(input())\r\na=a.split()\r\nb=b.split()\r\ns=0\r\nd=0\r\nfor i in range(3):\r\n s+=int(a[i])\r\n d+=int(b[i])\r\nwhile d>0 and n>0:\r\n n-=1\r\n d-=10\r\nwhile s>0 and n>0:\r\n s-=5\r\n n-=1\r\nif s>0 or d>0:\r\n print('NO')\r\nelse:\r\n print('YES')", "a=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nn=int(input())\r\n\r\ns = sum(a)\r\ns2 = sum(b)\r\n\r\nk = (s + 5 - 1) // 5\r\nk2 = (s2 + 10 - 1) // 10\r\n\r\nif k + k2 <= n:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b,c=map(int,input().split())\r\nd,e,f=map(int,input().split())\r\nn=int(input())\r\na=a+b+c\r\ne=d+e+f\r\na=(a+4)//5\r\ne=(e+9)//10\r\nprint(\"YES\" if a+e<=n else \"NO\")", "a, b, c = map(int, input().split())\nx, y, z = map(int, input().split())\nr = int(input())\nn = (a + b + c)//5\nif (a + b + c)%5 != 0:\n n+=1\nm = (x + y + z)//10\nif (x + y + z)%10 != 0:\n m+=1\nif m+n>r:\n print('NO')\nelse:\n print('YES')\n \t\t\t \t \t\t \t \t \t \t\t\t \t", "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\n\r\nimport math\r\na,b,c=inp()\r\nd,e,f=inp()\r\nn=int(input())\r\nm=(a+b+c)/5\r\nn-=math.ceil(m)\r\n\r\nw=(d+e+f)/10\r\nn-=math.ceil(w)\r\nif n >= 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\na1,a2,a3 = [int(i) for i in input().split()]\r\na = a1+a2+a3\r\nb1,b2,b3 = [int(i) for i in input().split()]\r\nb = b1+b2+b3\r\nn = int(input())\r\na = a/5\r\na = math.ceil(a)\r\nb = b/10\r\nb = math.ceil(b)\r\nshelf = a + b\r\nif n >= shelf:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n" ]

[ "\r\ndef process(S):\r\n n = len(S)\r\n answer = 0\r\n harmonic_sums = [0]\r\n for i in range(1, n+2):\r\n x = harmonic_sums[-1]\r\n harmonic_sums.append(x+1/i)\r\n for i in range(n):\r\n if S[i] in 'AEIOUY':\r\n if i <= n-1-i:\r\n answer1 = (i+1)\r\n h1 = harmonic_sums[i+1]\r\n h2 = harmonic_sums[n-i]\r\n answer2 = (i+1)*(h2-h1)\r\n h3 = harmonic_sums[n+1]\r\n answer3 = (n+1)*(h3-h2)-(i+1)\r\n answer+=(answer1+answer2+answer3)\r\n else:\r\n answer1 = (n-i)\r\n h1 = harmonic_sums[n-i]\r\n h2 = harmonic_sums[i+1]\r\n answer2 = (n-i)*(h2-h1)\r\n h3 = harmonic_sums[n+1]\r\n answer3 = (n+1)*(h3-h2)-(n-i)\r\n answer+=(answer1+answer2+answer3)\r\n \r\n return answer \r\n\r\nS = input()\r\nprint(process(S))", "import sys\r\n\r\nceil1 = lambda a, b: (a + b - 1) // b\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\n\r\na, vow, cum, ans = input(), 'IEAOUY', [0], 0\r\nn = len(a)\r\n\r\nfor i in range(n):\r\n cum.append(cum[-1] + (a[i] in vow))\r\n\r\nl, r, tem = 0, n + 1, 0\r\nfor i in range(ceil1(n, 2)):\r\n l += 1\r\n r -= 1\r\n tem += cum[r] - cum[l - 1]\r\n ans += tem / (i + 1)\r\n\r\ndiv = n // 2 + 1\r\nif n & 1 == 0:\r\n ans += tem / div\r\n\r\nfor i in range(n // 2, 0, -1):\r\n div += 1\r\n tem -= cum[r] - cum[l - 1]\r\n ans += tem / div\r\n l -= 1\r\n r += 1\r\n\r\nprint(ans)\r\n", "m, t = 0, [q in 'IEAOUY' for q in input()]\nd = s = sum(t)\nfor k in range(len(t), 0, -1):\n m += d / k\n s -= t[k - 1] + t[-k]\n d += s\nprint(m)\n\t \t \t \t\t\t\t \t\t \t\t\t\t\t \t\t \t", "import sys\r\n\r\nceil1 = lambda a, b: (a + b - 1) // b\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\n\r\na, vow, cum, ans = input(), 'IEAOUY', [0], 0\r\nn = len(a)\r\n\r\nfor i in range(n):\r\n cum.append(cum[-1] + (a[i] in vow))\r\n\r\nl, r, tem = 0, n + 1, 0\r\nfor i in range(n >> 1):\r\n l += 1\r\n r -= 1\r\n tem += cum[r] - cum[l - 1]\r\n ans += tem / (i + 1) + tem / (n - i)\r\n\r\nif n & 1:\r\n l += 1\r\n r -= 1\r\n tem += cum[r] - cum[l - 1]\r\n ans += tem / ceil1(n, 2)\r\n\r\nprint(ans)\r\n" ]

[ "x = int(input())\r\nif not x:\r\n print(1)\r\n exit()\r\nprint('8426'[(x-1) % 4])", "n=int(input())\r\nlist1=[6,8,4,2]\r\nif(n==0):\r\n print(1)\r\nelse:\r\n print(list1[n%4])\r\n", "n = int(input())\r\nprint(pow(8,n,10))", "poss = [8, 4, 2, 6]\r\nn = int(input())\r\nif not n:\r\n print(1)\r\nelse:\r\n print(poss[n%4-1])", "NUMBER = '1378'\n\nlast_digit_of_the_number = int(NUMBER[3])\n\npower = int(input())\n\nif power == 0:\n print(1)\nelse:\n remainder = power % 4\n\n last_digit_of_the_number_at_power = (last_digit_of_the_number ** remainder\n if remainder != 0\n else last_digit_of_the_number ** 4)\n\n print(str(last_digit_of_the_number_at_power)[-1])\n", "n = int(input())\r\nprint(1 if n == 0 else [6,8,4,2][n % 4])", "n = int(input())\r\nprint([6,8,4,2,1][n%4-(n==0)])", "n = int(input())\r\nif n == 0:\r\n print(1)\r\nelif n > 0:\r\n units = [8, 4, 2, 6]\r\n n = (n - 1) % 4\r\n print(units[n])\r\n", "n = int(input())\r\nl = [6,8,4,2]\r\nif n == 0:\r\n print(1)\r\nelse:\r\n print(l[(n%4)])", "n = int(input())\r\n\r\nresult = 1\r\nc = 8\r\nwhile n > 0:\r\n if n % 2 == 1:\r\n result = (result * c) % 10;\r\n c = (c*c) % 10;\r\n n = n // 2\r\n\r\nprint(result)", "n = int(input())\nprint(pow(1378, n, 10))", "n=int(input())\r\ns=pow(8,n,10)\r\nprint(s)", "n=int(input())\r\np=[8,4,2,6]\r\nif(n==0):\r\n print(1)\r\nelse:\r\n print(p[(n-1)%4])", "\r\nl=[6,8,4,2]\r\ndata=int(input())\r\nif data==0:\r\n\tprint(1)\r\nelse:\r\n\tprint(l[data%4])", "def last_digit(n):\r\n if n<1:\r\n return 1\r\n elif (n - 1) % 4 == 0:\r\n return 8\r\n elif n % 2 == 0 and (n // 2) & 1 != 0:\r\n return 4\r\n elif n % 4 == 0:\r\n return 6\r\n else:\r\n return 2\r\nif __name__ == '__main__':\r\n n = int(input())\r\n print(last_digit(n))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n NUM:int = int(input())\r\n \r\n lastDigit:int = -1\r\n if NUM==0 : lastDigit = 1\r\n else : lastDigit = [6, 8, 4, 2][NUM%4]\r\n\r\n print(lastDigit)\r\n\r\nmain()", "n=int(input())\r\na=[8,4,2,6]\r\nif n==0:\r\n print(1)\r\nelse:\r\n print(a[int((n-1)%4)])\r\n", "n = int(input())\r\ndef binexp(base,power):\r\n res = 1\r\n while power != 0:\r\n if power&1:\r\n res = (res*base)%10\r\n base = (base*base)%10\r\n power >>= 1\r\n return res\r\nprint(binexp(8,n))\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n", "arr=[8,4,2,6]\r\na=int(input())\r\nif(a==0):\r\n print(1)\r\nelse:\r\n print(arr[a%4-1])", "# https://codeforces.com/problemset/problem/742/A\n\nvalue = int(input())\n\nresult = {\n 1: \"8\",\n 2: \"4\",\n 3: \"2\",\n 0: \"6\"\n}\n\nif value == 0:\n print(\"1\")\nelse:\n print(result.get(value % 4))", "n = int(input())\r\n\r\nif (n == 0): print(1)\r\nelse:\r\n p = n - 1\r\n if (p % 4 == 0): \r\n print(8)\r\n elif (p % 4 == 1): \r\n print(4)\r\n elif (p % 4 == 2): \r\n print(2)\r\n else:\r\n print(6)\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 25 13:44:17 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 58 - CF742-DIV2A\r\n\"\"\"\r\nvals = [8,4,2,6]\r\nn = int(input())\r\nif n == 0:\r\n print(1)\r\nelse:\r\n idx = n%4 - 1\r\n if idx < 0:\r\n idx += 4\r\n print(vals[idx])\r\n", "# 8 , 4, 2, 6, 8,\r\nn = int(input())\r\nif n == 0: print(1)\r\nelif n%4 == 1: print(8)\r\nelif n%4 == 2: print(4)\r\nelif n%4 == 3: print(2)\r\nelse: print(6)\r\n", "n=int(input())\r\nl=[8,4,2,6]\r\nprint(1 if n==0 else l[(n-1)%4])\r\n", "n = int(input())\r\n# we have 5 results 1(for n=0 only), 8(n=4a+1), 4(n=4a+2), 2(n=4a+3), 6(n=4a)\r\nif n==0:\r\n res=1\r\nelif n%4==1:\r\n res=8\r\nelif n%4==2:\r\n res=4\r\nelif n%4==3:\r\n res=2\r\nelse:\r\n res=6\r\nprint(res)", "a = int(input())\r\nb = a % 4\r\nif a == 0:\r\n print(1)\r\nelse:\r\n if b == 0:\r\n print(6)\r\n elif b == 1:\r\n print(8)\r\n elif b == 2:\r\n print(4)\r\n elif b == 3:\r\n print(2)", "# https://codeforces.com/problemset/problem/742/A\r\n\r\n# периодичность последний цифры степени\r\n\r\nd = {0: 6, 1: 8, 2: 4, 3: 2}\r\nk = int(input())\r\nif k == 0:\r\n print(1)\r\nelse:\r\n print(d[k % 4])", "s = int(input())\r\nb = [6,8,4,2]\r\nif s == 0:\r\n print(1)\r\n exit()\r\nprint(b[s % 4])\r\n", "def yzd_solution(n):\r\n if (n == 0): return \"1\"\r\n \r\n n = n % 4\r\n \r\n if (n == 1): return \"8\"\r\n if (n == 2): return \"4\"\r\n if (n == 3): return \"2\"\r\n if (n == 0): return \"6\"\r\n\r\nn = int(input())\r\nprint(yzd_solution(n))", "n= int(input())\r\ndic={0:6,1:8,2:4,3:2}\r\nprint(dic[n%4] if n>0 else 1)", "n = int(input())\r\n\r\nr = n%4\r\nif(n == 0):\r\n\tprint(1)\r\nelif(r==1):\r\n\tprint(8)\r\nelif(r==2):\r\n\tprint(4)\r\nelif(r==3):\r\n\tprint(2)\r\nelse:\r\n\tprint(6)", "x = int(input())\r\ny = [8, 4, 2, 6]\r\nif x == 0:\r\n print(1)\r\nelse:\r\n print(y[(x % 4) - 1])\r\n ", "n = int(input())\r\n# Last digits of the number sequence\r\nlast_digits = [8, 4, 2, 6]\r\n# If n is zero, answer is 1\r\nif n == 0:\r\n print(1)\r\nelse:\r\n # Take the modulus of n with 4 to get the index of last_digits\r\n print(last_digits[(n-1)%4])\r\n", "num = int(input())\r\nlst = [6, 8, 4, 2]\r\nif num == 0:\r\n\tprint(1)\r\nelse:\t\r\n\tprint(lst[num % 4])", "n = int(input())\r\nif n == 0:\r\n print(1)\r\n exit()\r\nif n % 4 == 0:\r\n print(6)\r\n exit()\r\nn = n % 4\r\nprint(str(1378 ** n)[-1])", "n = int(input())\r\n\r\nif not(n):\r\n print(1)\r\nelif n % 4 == 1:\r\n print(8)\r\nelif n % 4 == 2:\r\n print(4)\r\nelif n % 4 == 3:\r\n print(2)\r\nelse:\r\n print(6)\r\n", "import bisect\r\nleft = lambda l,a : bisect.bisect_left(l,a) #returns index of value>=a\r\nright = lambda l,a : bisect.bisect_right(l,a) #returns index of value >a\r\nimport sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\nn = int(input())\r\nd = {1:8,2:4,3:2,0:6}\r\nprint(d[n%4] if n!= 0 else 1)", "n=int(input())\r\nif n==0:\r\n print(1)\r\nelse:\r\n L=[6,8,4,2]\r\n print(L[n%4])\r\n", "n = int(input())\r\nr = [8,4,2,6]\r\nif(n == 0):\r\n print(1)\r\nelif(n%4 == 0):\r\n print(6)\r\nelse:\r\n print(r[n%4 -1])", "n = int(input())\nresult = [6, 8, 4, 2]\nif n == 0:\n print(1)\nelse:\n print(result[n % 4])\n\n \n", "# Link: https://codeforces.com/contest/742/problem/A\n\nlast_digits = [6, 8, 4, 2]\nn = int(input())\nprint(1 if n == 0 else last_digits[n % 4])", "def multi(a,b,M):\r\n return (( a % M) * (b % M)) % M\r\ndef binaryexp(x,n,M=10):\r\n res = 1\r\n while n != 0:\r\n if n % 2 == 1:\r\n res = (res*x)%M\r\n x = multi(x,x,M)\r\n n = int(n/2)\r\n return res\r\n\r\nprint(int(binaryexp(8,int(input())))%10)", "from collections import *\r\n# from math import ceil, gcd,inf\r\nfrom functools import *\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\n\r\nn=int(input())\r\nyu=n%4\r\nif n==0:print(1)\r\nelif yu==0:print(6)\r\nelif yu==1:print(8)\r\nelif yu==2:print(4)\r\nelif yu==3:print(2)\r\n \r\n ", "R=lambda:map(int,input().split())\r\nimport math as ma\r\ndef po(a,n,d):\r\n ans=1\r\n while(n):\r\n if(n%2):\r\n ans=((ans%d)*(a%d))%d\r\n n=n//2\r\n a=(((a%d)*(a%d))%d)\r\n return ans\r\nt,=R()\r\nprint(po(1378,t,10))", "n=int(input()) \r\n # n,q=map(int,input().split())\r\n # a=list(map(int,input().split()))\r\na=[8,4,2,6]\r\nif(n==0):\r\n print(1)\r\nelse: \r\n print(a[n%4-1]) ", "print(pow(8, int(input()), 10))\n", "n=int(input())\r\nif n==0:\r\n print(1)\r\nelse:\r\n w=n%4\r\n if w==1:\r\n print(8)\r\n elif w==2:\r\n print(4)\r\n elif w==3:\r\n print(2)\r\n else:\r\n print(6)", "n = int(input())\r\nif n == 0:\r\n print(1)\r\nelse:\r\n dict = {0: 6,\r\n 1: 8,\r\n 2: 4,\r\n 3: 2}\r\n print(dict[n % 4])\r\n", "\na = [6, 8, 4, 2]\n\nn =int(input())\n\nif n == 0:\n print(1)\nelse:\n temp = n%4\n print(a[temp])\n \t\t\t\t\t\t\t\t\t \t\t \t \t\t\t \t \t\t\t", "n = int(input())\r\nif n==0:\r\n print(1)\r\nelse:\r\n ans = [6,8,4,2]\r\n print(ans[n%4])\r\n", "n = int(input())\r\nif n == 0: print(1)\r\nelif n % 4 == 0 : print(6)\r\nelif n % 4 == 1: print(8)\r\nelif n % 4 == 2: print(4)\r\nelse: print(2)", "n=int(input())\r\np = [8,4,2,6]\r\nprint(1 if n == 0 else p[(n - 1) % 4])\r\n", "number = int(input())\r\n\r\nif number == 0:\r\n print(\"1\")\r\nelif (number - 1) % 4 == 0:\r\n print(\"8\")\r\nelif (number - 1) % 4 == 1:\r\n print(\"4\")\r\nelif (number - 1) % 4 == 2:\r\n print(\"2\")\r\nelse:\r\n print(\"6\")", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nans = pow(1378, n, 10)\r\nprint(ans)", "stepen = int(input())\r\nx = stepen%4\r\nif stepen == 0:\r\n\tprint(1)\r\nelse:\r\n\tif x == 1:\r\n\t\tprint(8)\r\n\telif x == 2:\r\n\t\tprint(4)\r\n\telif x == 3:\r\n\t\tprint(2)\r\n\telif x == 4 or x == 0:\r\n\t\tprint(6)", "n = int(input())\r\nmods = {0: 6, 1: 8, 2: 4, 3: 2}\r\n\r\nif n == 0:\r\n res = 1\r\nelse:\r\n mod = n % 4\r\n res = mods[mod]\r\n\r\nprint(res)\r\n", "#742A - Arpa’s hard exam and Mehrdad’s naive cheat\r\nn,m=int(input()),{1:8,2:4,3:2,0:6}\r\nprint(1 if n==0 else m[n%4])", "n = int(input())\r\n\r\nif n % 4 == 0:\r\n if n == 0:\r\n print(1)\r\n else:\r\n print(6)\r\nelif (n - 1) % 4 == 0:\r\n print(8)\r\nelif (n - 2) % 4 == 0:\r\n print(4)\r\nelif (n - 3) % 4 == 0:\r\n print(2)", "n = int(input())\r\nif n == 0 :\r\n print(1)\r\nelse :\r\n l = [8,4,2, 6]\r\n n = (n-1)%4\r\n print(l[n])", "import sys\r\n# Array\r\ndef create_array(size):\r\n return [None] * size\r\n\r\n# Linked List\r\nclass ListNode:\r\n def __init__(self, val):\r\n self.val = val\r\n self.next = None\r\n\r\ndef create_linked_list():\r\n return None\r\n\r\n# Stack\r\nclass Stack:\r\n def __init__(self):\r\n self.stack = []\r\n\r\n def push(self, item):\r\n self.stack.append(item)\r\n\r\n def pop(self):\r\n if not self.is_empty():\r\n return self.stack.pop()\r\n else:\r\n raise IndexError(\"Stack is empty\")\r\n\r\n def is_empty(self):\r\n return len(self.stack) == 0\r\n\r\n# Queue\r\nclass Queue:\r\n def __init__(self):\r\n self.queue = []\r\n\r\n def enqueue(self, item):\r\n self.queue.append(item)\r\n\r\n def dequeue(self):\r\n if not self.is_empty():\r\n return self.queue.pop(0)\r\n else:\r\n raise IndexError(\"Queue is empty\")\r\n\r\n def is_empty(self):\r\n return len(self.queue) == 0\r\n\r\n# Binary Search\r\ndef binary_search(arr, target):\r\n left = 0\r\n right = len(arr) - 1\r\n\r\n while left <= right:\r\n mid = (left + right) // 2\r\n\r\n if arr[mid] == target:\r\n return mid\r\n elif arr[mid] < target:\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n return -1\r\n\r\n# Hash Table\r\nclass HashTable:\r\n def __init__(self):\r\n self.table = {}\r\n\r\n def insert(self, key, value):\r\n self.table[key] = value\r\n\r\n def get(self, key):\r\n return self.table.get(key)\r\n\r\n# Heap\r\nimport heapq\r\n\r\ndef create_heap():\r\n return []\r\n\r\ndef heap_push(heap, item):\r\n heapq.heappush(heap, item)\r\n\r\ndef heap_pop(heap):\r\n return heapq.heappop(heap)\r\n\r\n# Graph\r\nclass Graph:\r\n def __init__(self):\r\n self.graph = {}\r\n\r\n def add_edge(self, u, v):\r\n if u in self.graph:\r\n self.graph[u].append(v)\r\n else:\r\n self.graph[u] = [v]\r\n\r\n# Tree\r\nclass TreeNode:\r\n def __init__(self, val):\r\n self.val = val\r\n self.left = None\r\n self.right = None\r\n\r\ndef create_tree(val):\r\n return TreeNode(val)\r\n\r\n# Depth-First Search (DFS)\r\ndef dfs(node):\r\n if node is None:\r\n return\r\n print(node.val)\r\n dfs(node.left)\r\n dfs(node.right)\r\n\r\n# Breadth-First Search (BFS)\r\nfrom collections import deque\r\n\r\ndef bfs(node):\r\n if node is None:\r\n return\r\n\r\n queue = deque()\r\n queue.append(node)\r\n\r\n while queue:\r\n current = queue.popleft()\r\n print(current.val)\r\n\r\n if current.left:\r\n queue.append(current.left)\r\n if current.right:\r\n queue.append(current.right)\r\n\r\n# Binary Search Tree (BST)\r\nclass BSTNode:\r\n def __init__(self, val):\r\n self.val = val\r\n self.left = None\r\n self.right = None\r\n\r\ndef bst_insert(root, val):\r\n if root is None:\r\n return BSTNode(val)\r\n if val < root.val:\r\n root.left = bst_insert(root.left, val)\r\n else:\r\n root.right = bst_insert(root.right, val)\r\n return root\r\n\r\n# AVL Tree\r\nclass AVLNode:\r\n def __init__(self, val):\r\n self.val = val\r\n self.left = None\r\n self.right = None\r\n self.height = 1\r\n\r\ndef avl_insert(root, val):\r\n if root is None:\r\n return AVLNode(val)\r\n if val < root.val:\r\n root.left = avl_insert(root.left, val)\r\n else:\r\n root.right = avl_insert(root.right, val)\r\n root.height = 1 + max(get_height(root.left), get_height(root.right))\r\n balance = get_balance(root)\r\n if balance > 1 and val < root.left.val:\r\n return avl_rotate_right(root)\r\n if balance < -1 and val > root.right.val:\r\n return avl_rotate_left(root)\r\n if balance > 1 and val > root.left.val:\r\n root.left = avl_rotate_left(root.left)\r\n return avl_rotate_right(root)\r\n if balance < -1 and val < root.right.val:\r\n root.right = avl_rotate_right(root.right)\r\n return avl_rotate_left(root)\r\n return root\r\n\r\ndef get_height(node):\r\n if node is None:\r\n return 0\r\n return node.height\r\n\r\ndef get_balance(node):\r\n if node is None:\r\n return 0\r\n return get_height(node.left) - get_height(node.right)\r\n\r\ndef avl_rotate_left(z):\r\n y = z.right\r\n T2 = y.left\r\n y.left = z\r\n z.right = T2\r\n z.height = 1 + max(get_height(z.left), get_height(z.right))\r\n y.height = 1 + max(get_height(y.left), get_height(y.right))\r\n return y\r\n\r\ndef avl_rotate_right(y):\r\n x = y.left\r\n T2 = x.right\r\n x.right = y\r\n y.left = T2\r\n y.height = 1 + max(get_height(y.left), get_height(y.right))\r\n x.height = 1 + max(get_height(x.left), get_height(x.right))\r\n return x\r\n\r\n# Red-Black Tree\r\nclass RBNode:\r\n def __init__(self, val):\r\n self.val = val\r\n self.left = None\r\n self.right = None\r\n self.parent = None\r\n self.color = 1\r\n\r\nclass RedBlackTree:\r\n def __init__(self):\r\n self.NIL = RBNode(None)\r\n self.NIL.color = 0\r\n self.NIL.left = None\r\n self.NIL.right = None\r\n self.root = self.NIL\r\n\r\ndef rb_insert(tree, key):\r\n node = RBNode(key)\r\n node.parent = None\r\n node.val = key\r\n node.left = tree.NIL\r\n node.right = tree.NIL\r\n node.color = 1\r\n\r\n y = None\r\n x = tree.root\r\n\r\n while x != tree.NIL:\r\n y = x\r\n if node.val < x.val:\r\n x = x.left\r\n else:\r\n x = x.right\r\n\r\n node.parent = y\r\n if y is None:\r\n tree.root = node\r\n elif node.val < y.val:\r\n y.left = node\r\n else:\r\n y.right = node\r\n\r\n if node.parent is None:\r\n node.color = 0\r\n return\r\n\r\n if node.parent.parent is None:\r\n return\r\n\r\n rb_insert_fixup(tree, node)\r\n\r\ndef rb_insert_fixup(tree, node):\r\n while node.parent.color == 1:\r\n if node.parent == node.parent.parent.right:\r\n u = node.parent.parent.left\r\n if u.color == 1:\r\n u.color = 0\r\n node.parent.color = 0\r\n node.parent.parent.color = 1\r\n node = node.parent.parent\r\n else:\r\n if node == node.parent.left:\r\n node = node.parent\r\n right_rotate(tree, node)\r\n node.parent.color = 0\r\n node.parent.parent.color = 1\r\n left_rotate(tree, node.parent.parent)\r\n else:\r\n u = node.parent.parent.right\r\n if u.color == 1:\r\n u.color = 0\r\n node.parent.color = 0\r\n node.parent.parent.color = 1\r\n node = node.parent.parent\r\n else:\r\n if node == node.parent.right:\r\n node = node.parent\r\n left_rotate(tree, node)\r\n node.parent.color = 0\r\n node.parent.parent.color = 1\r\n right_rotate(tree, node.parent.parent)\r\n if node == tree.root:\r\n break\r\n tree.root.color = 0\r\n\r\ndef left_rotate(tree, x):\r\n y = x.right\r\n x.right = y.left\r\n if y.left != tree.NIL:\r\n y.left.parent = x\r\n y.parent = x.parent\r\n if x.parent is None:\r\n tree.root = y\r\n elif x == x.parent.left:\r\n x.parent.left = y\r\n else:\r\n x.parent.right = y\r\n y.left = x\r\n x.parent = y\r\n\r\ndef right_rotate(tree, x):\r\n y = x.left\r\n x.left = y.right\r\n if y.right != tree.NIL:\r\n y.right.parent = x\r\n y.parent = x.parent\r\n if x.parent is None:\r\n tree.root = y\r\n elif x == x.parent.right:\r\n x.parent.right = y\r\n else:\r\n x.parent.left = y\r\n y.right = x\r\n x.parent = y\r\n\r\n# Trie\r\nclass TrieNode:\r\n def __init__(self):\r\n self.children = {}\r\n self.is_end_of_word = False\r\n\r\nclass Trie:\r\n def __init__(self):\r\n self.root = TrieNode()\r\n\r\n def insert(self, word):\r\n node = self.root\r\n for char in word:\r\n if char not in node.children:\r\n node.children[char] = TrieNode()\r\n node = node.children[char]\r\n node.is_end_of_word = True\r\n\r\n def search(self, word):\r\n node = self.root\r\n for char in word:\r\n if char not in node.children:\r\n return False\r\n node = node.children[char]\r\n return node.is_end_of_word\r\n\r\n# Priority Queue\r\nimport heapq\r\n\r\nclass PriorityQueue:\r\n def __init__(self):\r\n self.heap = []\r\n self.index = 0\r\n\r\n def push(self, item, priority):\r\n heapq.heappush(self.heap, (priority, self.index, item))\r\n self.index += 1\r\n\r\n def pop(self):\r\n return heapq.heappop(self.heap)[-1]\r\n\r\n# Merge Sort\r\ndef merge_sort(arr):\r\n if len(arr) <= 1:\r\n return arr\r\n\r\n mid = len(arr) // 2\r\n left_half = arr[:mid]\r\n right_half = arr[mid:]\r\n\r\n left_half = merge_sort(left_half)\r\n right_half = merge_sort(right_half)\r\n\r\n return merge(left_half, right_half)\r\n\r\ndef factorial(n):\r\n result = 1\r\n for i in range(1, n+1):\r\n result *= i\r\n return result\r\ndef is_prime(n):\r\n if n < 2:\r\n return False\r\n for i in range(2, int(n**0.5) + 1):\r\n if n % i == 0:\r\n return False\r\n return True\r\ndef find_max(numbers):\r\n if not numbers:\r\n return None\r\n max_num = numbers[0]\r\n for num in numbers:\r\n if num > max_num:\r\n max_num = num\r\n return max_num\r\ndef reverse_string(string):\r\n return string[::-1]\r\ndef fibonacci(n):\r\n sequence = [0, 1]\r\n while len(sequence) < n:\r\n next_num = sequence[-1] + sequence[-2]\r\n sequence.append(next_num)\r\n return sequence\r\ndef calculate_average(numbers):\r\n if not numbers:\r\n return None\r\n total = sum(numbers)\r\n average = total / len(numbers)\r\n return average\r\ndef is_palindrome(string):\r\n reversed_string = string[::-1]\r\n return string == reversed_string\r\ndef count_occurrences(elements):\r\n counts = {}\r\n for element in elements:\r\n if element in counts:\r\n counts[element] += 1\r\n else:\r\n counts[element] = 1\r\n return counts\r\ndef is_leap_year(year):\r\n if year % 4 == 0:\r\n if year % 100 == 0:\r\n if year % 400 == 0:\r\n return True\r\n else:\r\n return False\r\n else:\r\n return True\r\n else:\r\n return False\r\ndef is_leap_year(year):\r\n if year % 4 == 0:\r\n if year % 100 == 0:\r\n if year % 400 == 0:\r\n return True\r\n else:\r\n return False\r\n else:\r\n return True\r\n else:\r\n return False\r\ndef find_index(items, target):\r\n for i, item in enumerate(items):\r\n if item == target:\r\n return i\r\n return -1\r\ndef celsius_to_fahrenheit(celsius):\r\n fahrenheit = (celsius * 9/5) + 32\r\n return fahrenheit\r\nimport re\r\n\r\ndef is_valid_email(email):\r\n pattern = r'^[\\w\\.-]+@[\\w\\.-]+\\.\\w+$'\r\n if re.match(pattern, email):\r\n return True\r\n else:\r\n return False\r\ndef sort_numbers(numbers):\r\n sorted_numbers = sorted(numbers)\r\n return sorted_numbers\r\ndef power(base, exponent):\r\n if exponent == 0:\r\n return 1\r\n elif exponent < 0:\r\n return 1 / power(base, -exponent)\r\n else:\r\n return base * power(base, exponent - 1)\r\ndef is_sorted(numbers):\r\n return all(numbers[i] <= numbers[i + 1] for i in range(len(numbers) - 1))\r\ndef find_common_elements(list1, list2):\r\n return list(set(list1) & set(list2))\r\ndef sum_of_digits(number):\r\n return sum(int(digit) for digit in str(number))\r\ndef find_median(numbers):\r\n sorted_numbers = sorted(numbers)\r\n length = len(sorted_numbers)\r\n if length % 2 == 0:\r\n return (sorted_numbers[length // 2] + sorted_numbers[length // 2 - 1]) / 2\r\n else:\r\n return sorted_numbers[length // 2]\r\ndef remove_vowels(string):\r\n vowels = 'aeiouAEIOU'\r\n return ''.join(char for char in string if char not in vowels)\r\n\r\n\r\ndef merge(left, right):\r\n merged = []\r\n i = 0\r\n j = 0\r\n\r\n while i < len(left) and j < len(right):\r\n if left[i] < right[j]:\r\n merged.append(left[i])\r\n i += 1\r\n else:\r\n merged.append(right[j])\r\n j += 1\r\n\r\n while i < len(left):\r\n merged.append(left[i])\r\n i += 1\r\n\r\n while j < len(right):\r\n merged.append(right[j])\r\n j += 1\r\n\r\n return merged\r\n\r\n# Quick Sort\r\ndef quick_sort(arr):\r\n if len(arr) <= 1:\r\n return arr\r\n else:\r\n pivot = arr[0]\r\n less = [x for x in arr[1:] if x <= pivot]\r\n greater = [x for x in arr[1:] if x > pivot]\r\n return quick_sort(less) + [pivot] + quick_sort(greater)\r\n\r\n# Insertion Sort\r\ndef insertion_sort(arr):\r\n for i in range(1, len(arr)):\r\n key = arr[i]\r\n j = i - 1\r\n while j >= 0 and arr[j] > key:\r\n arr[j + 1] = arr[j]\r\n j -= 1\r\n arr[j + 1] = key\r\n\r\n# Selection Sort\r\ndef selection_sort(arr):\r\n for i in range(len(arr)):\r\n min_idx = i\r\n for j in range(i + 1, len(arr)):\r\n if arr[j] < arr[min_idx]:\r\n min_idx = j\r\n arr[i], arr[min_idx] = arr[min_idx], arr[i]\r\ninput= lambda: sys.stdin.readline().rstrip()\r\n###################################################################\r\nn=int(input())\r\nprint(pow(1378,n,10))", "l = [6,8,4,2];n = int(input());print(1 if n == 0 else l[n%4])", "a = int(input())\r\nb = [8, 4, 2 , 6]\r\nprint(b[(a % 4)-1] if a != 0 else 1)", "n = int(input())\r\nif n == 0:\r\n print(1)\r\nelse:\r\n last_digits = [8,4,2,6]\r\n n-=1\r\n n = n%4\r\n print(last_digits[n])", "#1378^1 = 8\r\n#1378 ^2 = 4\r\n#1378 ^ 3 = 2\r\n#1378 ^ 4 = 6\r\n#1378 ^ 5 = 8\r\n#1378 ^6 = 4\r\n#1378 ^7 = 2\r\n#1378 ^8 = 6\r\n# El patron es 8 4 2 6\r\nciclo = [8, 4, 2, 6]\r\n\r\nn = int(input())\r\n \r\nposicion_ciclo = (n - 1) % 4\r\n \r\nexponente = ciclo[posicion_ciclo]\r\n\r\nif n == 0:\r\n print(1)\r\nelse:\r\n print(exponente)\r\n \r\n", "def cout(n):\r\n return print(n)\r\ndef cin():\r\n return int(input())\r\ndef lcin():\r\n return list(map(int,input().split()))\r\ndef scin():\r\n return input()\r\na = cin()\r\nif a == 0:\r\n print(1)\r\nelse:\r\n b = a%4\r\n if b == 0:\r\n b = 4\r\n print(str(8**b)[-1])\r\n", "n= int(input())\r\npattern={0:6,1:8,2:4,3:2}\r\nprint(pattern[n%4] if n>0 else 1)", "v1=int(input());v3=[8,4,2,6]\r\nif v1==0:\r\n print(1)\r\n exit()\r\nprint(v3[(v1%4)-1])", "def p(value, degree):\r\n if degree == 0:\r\n return 1\r\n else:\r\n x = degree % 4\r\n if x == 1:\r\n return 8\r\n elif x == 2:\r\n return 4\r\n elif x == 3:\r\n return 2\r\n elif x == 0:\r\n return 6\r\n\r\n\r\nn = int(input())\r\n\r\n\r\nprint(p(8, n))", "# Link: https://codeforces.com/contest/742/problem/A\n\nlast_digits = [6, 8, 4, 2]\n\nn = int(input())\n\nif n == 0:\n print(1)\nelse:\n print(last_digits[n % 4])", "n = int(input())\r\nif n == 0:\r\n x = 1\r\nelif n % 4 == 0:\r\n x = 6\r\nelif n % 4 == 1:\r\n x = 8\r\nelif n % 4 == 2:\r\n x = 4\r\nelse:\r\n x = 2\r\nprint(x)\r\n", "def fastpow(x, y):\r\n\tif (y == 0):\r\n\t\treturn 1\r\n\tt = fastpow(x, y//2)\r\n\tt = t*t\r\n\tif (y%2):\r\n\t\tt *= x\r\n\treturn t%10\r\n\r\n\r\ndef sol():\r\n\tn = int(input())\r\n\tprint(fastpow(1378, n))\r\n\t\r\n\t\r\nsol()\r\n", "n = int(input())\r\n\r\n# Calculate the last digit using a pattern\r\nif n == 0:\r\n last_digit = 1\r\nelse:\r\n n %= 4 # Reduce n to its modulo 4 to find the pattern\r\n if n == 0:\r\n last_digit = 6\r\n elif n == 1:\r\n last_digit = 8\r\n elif n == 2:\r\n last_digit = 4\r\n else:\r\n last_digit = 2\r\n\r\nprint(last_digit)\r\n", "n = int(input())\r\nif n==0:\r\n print(1)\r\nelse:\r\n digits = [6,8,4,2]\r\n k = n%4\r\n print(digits[k])", "def power_mod(base, exponent, modulus):\r\n if modulus == 1:\r\n return 0\r\n\r\n result = 1\r\n base %= modulus\r\n\r\n while exponent > 0:\r\n if exponent % 2 == 1:\r\n result = (result * base) % modulus\r\n\r\n exponent >>= 1\r\n base = (base * base) % modulus\r\n\r\n return result\r\n\r\nn = int(input())\r\nresult = power_mod(1378, n, 10)\r\nprint(result)\r\n\r\n", "def cheat (ip):\r\n if (ip==0): return(1)\r\n sw= 3- (ip%4)\r\n cheat=[2, 4,8, 6]\r\n return (cheat[sw])\r\nip=int (input ())\r\nprint (cheat (ip))", "num = int(input())\r\nls = [6,8,4,2]\r\n \r\nif num==0:\r\n print(1)\r\nelse:\r\n print(ls[num%4])\r\n", "arr = [8, 4, 2, 6]\r\npower = int(input())\r\nif power == 0:\r\n print(1)\r\nelif power > 0:\r\n print(arr[(power-1) % 4])", "n = int(input())\r\n\r\n# Calculate the last digit of 1378^n\r\nresult = pow(1378, n, 10)\r\n\r\nprint(result)\r\n", "n = int(input())\nres = 1 if n == 0 else [8, 4, 2, 6][(n - 1) % 4]\nprint(res)\n", "n = int(input())\nif n==0:\n print(1);\nelif n%4==0:\n print(6)\nelif n%4==1:\n print(8)\nelif n % 4==2:\n print(4)\nelif n%4==3:\n print(2)\n\n\t \t\t \t \t \t\t \t \t \t\t\t \t", "n=int(input())\r\nres=1;base=1378\r\nwhile(n):\r\n if n%2:res=(base*res)%10;n-=1\r\n else:base=(base*base)%10;n/=2\r\nprint(res)", "n = int(input())\r\nif n==0:\r\n print(1)\r\nelse:\r\n n%=4\r\n if n%2:\r\n print(8 if n==1 else 2)\r\n else:\r\n print(4 if n==2 else 6)\r\n", "n = int(input())\r\nif (n == 0):\r\n print(\"1\")\r\nelif(n > 0):\r\n l1 = [8,4,2,6]\r\n n = (n-1)%4\r\n print(l1[n])\r\n\r\n", "def solve():\r\n n = int(input())\r\n if n == 0:\r\n res = 1\r\n else:\r\n if n % 4 == 0:\r\n res = 6\r\n else:\r\n res = (8 ** (n % 4)) % 10\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n = int(input())\r\nm = n%8\r\nif(n==0):\r\n print(\"1\")\r\nelif(m==0):\r\n print(\"6\")\r\nelif(m==1):\r\n print(\"8\")\r\nelif(m==2):\r\n print(\"4\")\r\nelif(m==3):\r\n print(\"2\")\r\nelif(m==4):\r\n print(\"6\")\r\nelif(m==5):\r\n print(\"8\")\r\nelif(m==6):\r\n print(\"4\")\r\nelif(m==7):\r\n print(\"2\")", "exponential = int(input())\r\n\r\n\r\ndef lastDigit(ordinal):\r\n options = [8, 4, 2, 6]\r\n return options[ordinal-1]\r\n\r\n\r\nanswer = 1\r\n\r\nif exponential != 0:\r\n if exponential > 4:\r\n temp = exponential % 4\r\n answer = lastDigit(temp)\r\n else:\r\n answer = lastDigit(exponential)\r\n\r\nprint(answer)", "n = int(input())\nif(n == 0):\n print(1)\nelse:\n n = n%4\n print([8,4,2,6][n-1])\n", "#author : Rohanbiswas\r\nprint(pow(8,int(input()),10))", "n = int(input())\r\nif n == 0:\r\n print(1)\r\nelif n % 2 == 1:\r\n x = (n // 2) + 1\r\n if x % 2 == 0:\r\n print(2)\r\n else:\r\n print(8)\r\nelif n % 2 == 0:\r\n if n % 4 == 0:\r\n print(6)\r\n else:\r\n print(4)", "\r\nn =int(input()) - 1\r\na = [8,4,2,6]\r\nif n==-1:\r\n print(1)\r\nelse:\r\n n = a[n%4]\r\n print(n)", "print([\"6842\"[n%4] if n else 1 for n in [int(input())]][0])", "n = int(input())\r\n\r\nif n == 0:\r\n print(\"1\")\r\nelse:\r\n pow_rem = (n-1)%4\r\n last_digit_of_pow_rem = {\r\n 0: 8,\r\n 1: 4,\r\n 2: 2,\r\n 3: 6\r\n }\r\n print(last_digit_of_pow_rem[pow_rem])", "### Hello! World ... ###\nn = int(input())\nprint(pow(8, n, 10))", "k = 8\r\nn = int(input())\r\nif n < 3:\r\n y = pow(k, n)\r\n k = y % 10\r\n print(k)\r\n \r\nelif n % 4 == 0:\r\n\r\n print(6)\r\n \r\nelif n % 4 == 1:\r\n\r\n print(8)\r\n \r\nelif n % 4 == 2:\r\n\r\n print(4)\r\n \r\nelse:\r\n print(2)", "n = int(input())\r\nif n == 0:\r\n print(\"1\")\r\nelif n % 2 == 0:\r\n if (n / 2) % 2 == 0:\r\n print(\"6\")\r\n else:\r\n print(\"4\")\r\nelse:\r\n if ((n-1) / 2) % 2 == 0:\r\n print(\"8\")\r\n else:\r\n print(\"2\")\r\n\"\"\"\r\nA Sequence\r\n\r\n-->1378 will take 8\r\n\r\n8 ^ 0 = 1 \r\n\r\n8 ^ 1 = 8 8\r\n8 ^ 2 = 64 4\r\n8 ^ 3 = 512 2\r\n8 ^ 4 = 4096 6\r\n8 ^ 5 = 32768 \r\n8 ^ 6 = 262144\r\n8 ^ 7 = 2097152\r\n8 ^ 8 = 16,777,216\r\n8 ^ 9 = 134,217,728\r\n8 ^ 10 = 1,073,741,824\r\n8 ^ 11 = 8,589,934,592\r\n8 ^ 12 = 68,719,476,736\r\n\r\neven : 4, 6\r\nodd : 8, 2\r\n\"\"\" ", "n=int(input())\r\nif n==0:\r\n print(1)\r\nelif n%4==0:\r\n print(6)\r\nelif n%2==0:\r\n print(4)\r\nelif (n%2!=0 and (n-1)%4==0) or n==1:\r\n print(8)\r\nelse:\r\n print(2)", "n=int(input())\r\nl=[6,8,4,2]\r\nif n==0:print(1)\r\nelse:print(l[n%4])", "n=int(input())\r\ncycle=[8,4,2,6]\r\nif n==0:\r\n print(1)\r\nelse:\r\n print(cycle[(n-1)%4])\r\n ", "n=int(input())\r\nif n==0:\r\n print('1')\r\nelse:\r\n r=n%4\r\n if r==0:\r\n print('6')\r\n elif r==1:\r\n print('8')\r\n elif r==2:\r\n print('4')\r\n elif r==3:\r\n print('2')", "t=int(input())\r\nprint((str(pow(1378,t,10))[-1]))", "def main() -> int:\r\n n = int(input())\r\n if not n:\r\n return 1\r\n my_dict = {1: 8, 2: 4, 3: 2, 0: 6}\r\n return my_dict[n % 4]\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "num = int(input())\r\nprint(pow(8 , num , 10))\r\n", "a = int(input())\r\nif a==0:\r\n print(1)\r\nelse:\r\n if(a+3)%4==0: print(8)\r\n elif (a+2)%4 == 0: print(4)\r\n elif(a+1)%4==0: print(2)\r\n elif(a%4==0): print(6)", "import math\r\nimport sys\r\n#!pip install numpy\r\n\r\n#import numpy as np \r\nres=int(input())\r\n#print ((8**res)-int((8**res)/10)*10)\r\nif(res==0):\r\n print(1) \r\nelif(res%4==0):\r\n print(6)\r\nelse:\r\n print ((8**(res%4))%10)", "n=int(input())\n\nx=n%4\nif(n==0):\n print(\"1\")\nelif(x==0):\n print(\"6\")\nelif(x==1):\n print(\"8\")\nelif(x==2):\n print(\"4\")\nelse:#x==3\n print(\"2\") ", "n = int(input())\r\nif n == 0:\r\n print(1)\r\nelse:\r\n n = n % 4\r\n digits = [8, 4, 2, 6]\r\n print(digits[n - 1])", "\r\n\r\n\r\ndef arpa():\r\n\r\n n = int(input())\r\n \r\n if n == 0:\r\n print(1)\r\n else:\r\n n -= 1\r\n values = [8,4,2,6]\r\n\r\n cycle = n % 4\r\n\r\n\r\n print(values[cycle])\r\n\r\n\r\n\r\n\r\narpa()\r\n\r\n\r\n", "IN = lambda:list(map(int, input().split()))\r\n\r\nn = int(input())\r\nres = 1\r\nif n > 0:\r\n if n%4 == 1: res = 8\r\n elif n%4 == 2: res = 4\r\n elif n%4 == 3: res = 2\r\n else: res = 6\r\nprint(res)", "n = int(input())\nans = 0\nif n == 0:\n print(1)\n exit()\nif n % 4 == 0:\n ans = 6\nelif n % 4 == 1:\n ans = 8\nelif n % 4 == 2:\n ans = 4\nelse:\n ans = 2\nprint(ans)\n\t\t \t\t \t \t\t\t\t \t \t\t \t\t \t\t\t", "n = int(input())\r\n\r\nprint(pow(138,n, 10))", "y=int(input())\r\nd=[8,4,2,6]\r\nif y==0:\r\n print(1)\r\nelse:\r\n z=(y-1)%4\r\n print(d[z])", "t = int(input())\r\nif t==0:\r\n print(1)\r\nelse:\r\n k = t%4\r\n if k==0:\r\n print(6)\r\n elif k==1:\r\n print(8)\r\n elif k==2:\r\n print(4)\r\n elif k==3:\r\n print(2)", "def main():\r\n print(pow(8, int(input()), 10))\r\n \r\nmain()", "'''\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. Arpa’s hard exam and Mehrdad’s naive cheat\r\n SOLUTATOIN....\r\n\r\n ************************************************************************\r\n'''\r\n\r\nn=int(input())\r\nif n==0:\r\n print(1)\r\nelse:\r\n r=(3*n)%4\r\n if r==0:\r\n print(6)\r\n elif r==1:\r\n print(2)\r\n elif r==2:\r\n print(4)\r\n elif r==3:\r\n print(8)", "import sys\ninput = sys.stdin.readline\n\nN = int(input())\nif N == 0 : print(1)\nelse : print([6, 8, 4, 2][N%4])\n", "data = {0: 6, 1: 8, 2: 4, 3: 2}\r\nn = int(input())\r\nif n == 0:\r\n print(1)\r\n quit()\r\n\r\nprint(data[n % 4])", "n = int(input())\r\n\r\n# 8 4 2 6 8 4 2 6 8 ...\r\n\r\nif n == 0:\r\n print(1)\r\n\r\nelse:\r\n print([8,4,2,6].__getitem__((n-1)%4))\r\n\r\n", "u=int(input())\r\nif u%4==0 and u!=0:\r\n u=4\r\nelse:\r\n u%=4\r\nprint(str(1378**(u))[-1])", "n=int(input())\nnum=1378\nif(n==0) : print(1)\nelif(n%4==1): print(8)\nelif(n%4==2): print(4)\nelif(n%4==3): print(2)\nelse: print(6)", "n=int(input())\r\nj=n%4\r\nprint(1 if n==0 else 8 if j==1 else 4 if j==2 else 2 if j==3 else 6)", "n = int(input())\r\nlast_digit = pow(1378, n, 10)\r\nprint(last_digit)\r\n", "exp = int(input())\r\nlist_ = [8, 4, 2, 6]\r\nif exp == 0:\r\n print(1)\r\nelse:\r\n for i in range(1, len(list_)+1):\r\n if exp <= len(list_):\r\n print(list_[exp-1])\r\n break\r\n else:\r\n proper_exp = exp % len(list_)\r\n print(list_[proper_exp-1])\r\n break\r\n\r\n", "n = int(input())\r\nif n>0:\r\n rm = n%4\r\n if rm==0:\r\n print(6)\r\n elif rm==1:\r\n print(8)\r\n elif rm==2:\r\n print(4)\r\n else:\r\n print(2)\r\n # 1 - 8\r\n # 2 - 4\r\n # 3 - 2\r\n # 4 - 6\r\n # 5 - 8\r\n # 6 - 4\r\n # 7 - 2\r\n # 8 - 6\r\n # 9 - 8\r\n # 10 - 4\r\n # 11 - 2\r\n # 12 - 6\r\nelse:\r\n print(1)", "numbo = int(input())\r\nbosco = numbo-1\r\nif(numbo) == 0:\r\n print(1)\r\nelse:\r\n if(bosco%4) == 1:\r\n print(4)\r\n elif (bosco%4) == 2:\r\n print(2)\r\n elif (bosco%4) == 3:\r\n print(6)\r\n elif (bosco%4) == 0:\r\n print(8)", "x = int(input())\r\nx = pow(1378, x, 10)\r\nprint(x)", "'''\r\n8\r\n4\r\n2\r\n6\r\n'''\r\nn = int(input())\r\narr = [6, 8, 4, 2]\r\n\r\nif n != 0:\r\n print(arr[n%4])\r\nelse:\r\n print(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 = int(input())\n if n == 0:\n print(1)\n else:\n cases = [8, 4, 2, 6]\n print(cases[(n - 1) % 4])\n\n\nif __name__ == \"__main__\":\n main()\n", "n=int(input())\r\ntemp=pow(1378,n,10)\r\ntemp_str=str(temp)\r\nprint(temp_str[len(temp_str)-1])", "the_list = [6, 8, 4, 2]\r\nn = int(input())\r\nif n == 0:\r\n print(1)\r\nelse:\r\n print(the_list[n - int(n / 4) * 4])", "n = int(input())\r\nl = [6,8,4,2]\r\nif n==0 : print(1)\r\nelse : print(l[n%4])", "a = int(input());\r\nprint(pow(8,a,10) );", "n = int(input())\r\nlast_digit = pow(8, n, 10)\r\nprint(last_digit)\r\n", "n=int(input())\r\nd={1:8,2:4,3:2,0:6}\r\nprint([1,d[n%4]][n>0])\r\n", "a = [6, 8, 4, 2]\r\nn = int(input())\r\nprint(a[n % 4] if n != 0 else 1)\r\n", "def pv(a, b):\r\n if b == 0:return 1\r\n if b % 2:\r\n return (pv(a, b - 1) * a) % 10\r\n x = pv(a, b // 2)\r\n return (x * x) % 10\r\nn = int(input())\r\nprint(pv(1378, n))", "print(pow(8,int(input()),10))", "n = int(input())\nif (n == 0): \n print(1)\nelse:\n last_digit = [6, 8, 4, 2][n % 4]\n print(last_digit)\n \t\t \t \t\t\t\t \t\t\t \t\t \t\t\t\t\t \t", "print(pow(1378 ,int(input()),10))", "print(pow(1378,int(input()),10))", "n = int(input())\r\nif(n==0):\r\n ans = 1\r\nelse:\r\n n = 4 + n%4\r\n ans = (8**n)%10\r\nprint(ans)", "n = int(input())\r\nif n==0: print(1)\r\nelse:\r\n n%=4\r\n print(8 if n==1 else 4 if n==2 else 2 if n==3 else 6)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nprint(1 if n == 0 else 8 if n%4==1 else 4 if n%4==2 else 2 if n%4==3 else 6)", "n=int(input())\r\nif n==0:\r\n print(1)\r\nelse:\r\n res=[6,8,4,2]\r\n print(res[(n%4)])\r\n\r\n# print(1378**5)\r\n# print(1378**100)\r\n# print(8**3)\r\n# print(8**4) ", "a=int(input())\r\nx=[8,4,2,6]\r\nif a==0:\r\n print(1)\r\nelse:\r\n a=(a-1)%4\r\n print(x[a])\r\n", "n = int(input())\nl = [6, 8 , 4 ,2]\nif n == 0:\n print(1)\nelse:\n print(l[n%4])\n \t\t\t \t \t \t\t \t\t\t\t\t \t\t\t\t \t", "n=int(input())\r\nd={\r\n 1:6,\r\n 2:8,\r\n 3:4,\r\n 4:2\r\n}\r\nif n:\r\n print(d[n%4+1])\r\nelse:\r\n print(1)", "ops = [6, 8, 4, 2]\n\nn = int(input())\n\nprint(ops[n % 4]) if n > 0 else print(1)", "n = int(input())\n\nif n == 0:\n\tprint(1)\nelse:\n\ta = (n-1)%4\n\tif a==0:\n\t\tprint(8)\n\telif a==1:\n\t\tprint(4)\n\telif a==2:\n\t\tprint(2)\n\telif a==3:\n\t\tprint(6)\n\t \t \t\t \t \t\t\t\t\t \t \t\t \t \t\t", "f={0: 6, 1: 8, 2: 4, 3: 2}\r\nn=int(input())\r\nif n==0:\r\n print(1)\r\nelse:\r\n print(f[n%4])", "n = int(input())\r\nprint('6842'[n%4] if n else 1)", "n = int(input())\r\nmod = n%4\r\nif n == 0:\r\n print(1)\r\nelse:\r\n if(mod==0):mod=4\r\n print((8**(mod))%10)", "n = int(input())\r\nif n==0:\r\n print(1)\r\nelse:\r\n d = {1:8, 2:4, 3:2, 0:6}\r\n print(d[n%4])", "n=int(input())\r\nd={0:6,1:8,2:4,3:2}\r\nprint(d[n%4] if n!=0 else 1)", "print(pow(8,int(input()),10))\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n#code 2000032121\n\n\n\n\n\n\n\t\t\t \t \t \t\t\t \t\t\t\t\t\t\t\t\t", "a=int(input())\r\nif(a==0):\r\n print(1)\r\nelse:\r\n if(a%4==0):\r\n print(6)\r\n elif(a%4==1):\r\n print(8)\r\n elif(a%4==2):\r\n print(4)\r\n elif(a%4==3):\r\n print(2)\r\n \r\n ", "import os\r\nfrom re import X\r\nimport sys\r\n\r\ndef solve():\r\n n = int(input())\r\n if n==0:\r\n print(1)\r\n return\r\n answer = [6,8,4,2]\r\n print(answer[n%4])\r\n\r\nif __name__ == '__main__':\r\n if os.path.exists('input.txt') and os.path.exists('output.txt'):\r\n sys.stdin = open('input.txt','r')\r\n sys.stdout = open('output.txt','w')\r\n solve()\r\n # t = int(input())\r\n # for _ in range(t):\r\n # solve()", "import sys\r\ninput = sys.stdin.readline\r\ndef solution():\r\n num = int(input())\r\n if num == 0:\r\n print(1)\r\n else:\r\n print((num%4 == 1) * 8 + (num%4 == 2) * 4 + (num%4 == 3) * 2 + (num%4 == 0) * 6)\r\nsolution()", "n=int(input())\r\nll=[8,4,2,6] #print(8**1,2,3,4)\r\nif n==0:\r\n print(1)\r\n exit()\r\nprint(ll[(n%4)-1])\r\n", "n=int(input())\r\nif n>4:\r\n if n%4==0:\r\n print(6)\r\n else:\r\n n-=n//4*4\r\n a=str(pow(8,n))\r\n print(a[-1])\r\nelse:\r\n a=str(pow(8,n))\r\n print(a[-1])", "# Ahmed Abdelrazik\r\nl = [8,4,2,6]\r\nn=int(input())\r\nprint(1 if n==0 else l[n%4-1])", "print(pow(8,int(input()), 10))\r\n", "a=int(input())\r\nif a==0:print(1)\r\nelse:\r\n l=[6,8,4,2]\r\n a=a%4\r\n print(l[a])", "n = int(input())\r\nprint(pow(1378, n, mod=10))\r\n", "#https://codeforces.com/problemset/problem/742/A\r\n#0:1, 1:8, 2:4, 3:2, 4:6, 5:8, 6:4\r\n\r\n\r\ndef get_number():\r\n return 1378\r\n\r\ndef get_firstDigit(number):\r\n return int(str(number)[-1])\r\n\r\ndef get_optionAnswers():\r\n return [6, 8, 4, 2]\r\n\r\nn = int(input())\r\nnumber = get_firstDigit(get_number())\r\noption_Answers = get_optionAnswers()\r\nif(n>0):\r\n answer = option_Answers[n%4]\r\nelse:\r\n answer = 1\r\nprint(answer)", "n=int(input())\r\nprint(pow(1378,n,10))", "import sys\r\nimport math\r\n\r\nfor line in sys.stdin:\r\n numbers = [int(x) for x in line.strip().split()]\r\n\r\nn= numbers[0]\r\nif n==0:\r\n print(1)\r\nelif (n%4==1):\r\n print(8)\r\nelif (n%4==2):\r\n print(4)\r\nelif (n%4==3):\r\n print(2)\r\nelif (n%4==0):\r\n print(6)", "n=int(input())\r\nnum=3*n\r\nif num==0:\r\n print(1)\r\n \r\nelif num%4==1:\r\n print(2)\r\nelif num%4==2:\r\n print(4)\r\nelif num%4==3:\r\n print(8)\r\nelse:\r\n print(6)\r\n", "# n=int(input())\r\n# for i in range(n):\r\n# a,b= map(int, input().split())\r\n# a = int(input())\r\n\r\n\r\n# n,h= map(int, input().split())\r\n# a=list(map(int,input().strip().split()))\r\n\r\n#-------- GCD------------ @@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\r\n\r\n# def gcd(a,b):\r\n\r\n# if (a==0):\r\n# return b \r\n# if (b==0):\r\n# return a\r\n# while(a != b):\r\n \r\n# if(a>b):\r\n \r\n# a = a-b\r\n# else:\r\n# b = b-a\r\n# return a \r\n# a,b= map(int, input().split())\r\n\r\n# ans = gcd(a,b)\r\n# print(ans)\r\n\r\n#--------------- LCM ------@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\r\n\r\n# def lcm(a,b):\r\n# if (a>b):\r\n# higher = a\r\n# else:\r\n# higher= b\r\n# value = higher\r\n# while True:\r\n# if(higher%a==0 and higher%b==0):\r\n# print(higher)\r\n# break\r\n# else:\r\n# higher = value + higher\r\n# return higher\r\n# a,b = map(int,input().split())\r\n# print(lcm(a,b))\r\n\r\n\r\n\r\n\r\n\r\n# TRAM@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\r\n# n=int(input())\r\n# capacity = 0\r\n# max_capa = 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# max_capa = max(max_capa,capacity)\r\n# print(max_capa)\r\n\r\n\r\n \r\n# color of ball@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\r\n# t =int(input())\r\n# for i in range(t):\r\n# n = int(input())\r\n\r\n# sort_list=list(map(int,input().strip().split()))\r\n# index = -1\r\n# minn = -99990\r\n \r\n# for i in range(len(sort_list)):\r\n# if sort_list[i] >= minn:\r\n# minn = sort_list[i]\r\n# index = i+1\r\n# print(index)\r\n\r\n\r\n\r\n# PRIMALITY TEST:-------@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\r\n\r\n# a = int(input())\r\n# i = 2\r\n# if a<2:\r\n# print('not prime')\r\n# elif a<=3:\r\n# print('prime')\r\n# elif a%i == 0:\r\n# print('not prime')\r\n# else:\r\n# while i*i <= a:\r\n# if a%i == 0:\r\n# print('not prime')\r\n# exit()\r\n# i += 1\r\n# print('prime')\r\n\r\n\r\n# SEIVE OF ERATOSTHENIS----------@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\r\n\r\n# n = int(input())\r\n# m = n+3\r\n# arr = [0] * m\r\n# print(arr)\r\n\r\n# i = 2\r\n# while i*i <= n:\r\n# # print(i)\r\n# if arr[i] == 0:\r\n# j = i*i\r\n# while j<=n:\r\n# arr[j] = 1\r\n \r\n# j += i\r\n\r\n# i += 1\r\n# i = 2\r\n# while i<=n:\r\n# if arr[i] == 0:\r\n# print(i)\r\n# i += 1 \r\n\r\n# PRIME FACTORIZATION--------@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\r\n\r\n# n = int(input())\r\n# i = 2\r\n# while i*i <= n:\r\n# if n%i == 0:\r\n# count = 0\r\n# while n%i == 0:\r\n# count += 1\r\n# n = n/i\r\n# print(i,\"^\",count)\r\n# i += 1\r\n# if n>1:\r\n# print(n,\"^\",1)\r\n\r\n# BINARY EXPONENTIATION------@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@\r\n\r\n# base,power = map(int,input().split())\r\n# res = 1\r\n# while power:\r\n# if power% 2 != 0:\r\n# res = res * base\r\n# power -= 1\r\n# else:\r\n# base = base*base\r\n# power = power/2\r\n# print(res) \r\n\r\n# -------------------MAIN CODE--------------------\r\npower = int(input())\r\n\r\nbase = 8\r\nm = 10\r\nres= 1\r\nwhile power:\r\n if power%2 != 0:\r\n res = (res*base)%m\r\n power -= 1\r\n else:\r\n base = (base*base)%m\r\n power = power/2\r\nprint(res)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a=int(input())\nl=[6,8,4,2]\nif a==0:\n print(1)\nelse:\n print(l[a%4])\n \t\t\t\t\t \t \t \t\t\t \t \t \t\t\t \t", "n = int(input())\r\nprint({1:8,2:4,3:2,0:6}.get(n%4) if n else 1)\r\n", "n=int(input())\r\nd={0:6,1:8,2:4,3:2}\r\nif n==0:\r\n print(1)\r\nelse:\r\n k=n%4\r\n print(d[k])", "n=int(input())\r\npattern = [8,4,2,6]\r\nif n==0:\r\n print(1)\r\nelse:\r\n print(pattern[(n-1)%4])\r\n", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter, deque\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef QA(sep=' '): return deque(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\ndef ari_term(n:int, a:int, d:int): return a+(n-1)*d\r\ndef is_ari_term(x:int, a:int, d:int):\r\n f, c = get_ari_term(x, a, d)\r\n res = any([ari_term(p, a, d) == x for p in [f, c]])\r\n return res\r\ndef get_ari_term(x:int, a:int, d:int):\r\n f = floor((x-a)/d + 1)\r\n c = ceil((x-a)/d + 1)\r\n return f, c\r\n\r\ndef main():\r\n n = I()\r\n if n == 0:\r\n return 1\r\n else:\r\n d = {1:8, 2:4 , 3:2, 4:6}\r\n for key in d.keys():\r\n if is_ari_term(n, key, 4):\r\n return d[key]\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n=int(input())\r\np=[]\r\nwhile n>0:\r\n p.append(n%5)\r\n n=int(n/5)\r\nh=sum(p)\r\nj=[]\r\nwhile h>0:\r\n j.append(h%5)\r\n h=int(h/5)\r\nprint(8**(sum(j))%10)", "from sys import stdin, stdout\r\n#from bisect import bisect_left, bisect_right\r\n#from collections import Counter, deque\r\n#from queue import Queue\r\n#import heapq\r\n#import math\r\n#from itertools import permutations, combinations, islice\r\n\r\ndef input():\r\n return stdin.readline().strip()\r\n\r\ndef solve():\r\n n = int(input())\r\n l = [6, 8, 4, 2]\r\n if n == 0:\r\n return f\"1\"\r\n else:\r\n return f\"{l[n%4]}\"\r\n \r\nstdout.write(solve())", "t=int(input())\r\nif t==0:\r\n print(1)\r\nelse:\r\n if t%4==1:\r\n print(8)\r\n elif t%4==2:\r\n print(4)\r\n elif t%4==3:\r\n print(2)\r\n elif t%4==0:\r\n print(6)\r\n", "n = int(input())\r\nlist = [8,4,2,6]\r\nif n == 0:\r\n print(1)\r\nelse:\r\n b = n % 4 - 1\r\n print(list[b])", "def solve():\r\n n = int(input())\r\n if n == 0 :\r\n print(1)\r\n return\r\n a = [6,8,4,2]\r\n print(a[n%4])\r\n \r\n#for i in range(int(input())):\r\nsolve()", "# LUOGU_RID: 101647876\nprint(pow(1378, int(input()), 10))", "n=int(input())\r\nif n%4==1:\r\n print(8)\r\nelif n%4==2:\r\n print(4)\r\nelif n%4==3:\r\n print(2)\r\nelse:\r\n print(6 if n!=0 else 1)\r\n \r\n#1 = 8\r\n#2 = 4\r\n#3 = 2\r\n#4 = 6\r\n#5 = 8\r\n#6 = 4\r\n#7 = 2\r\n#8 = 6", "#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/\r\n\r\nprint(pow(8,int(input()),10))\r\n\r\n#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/", "n = int(input())\r\nif n > 4:\r\n n = n % 4 + 4\r\nprint(8 ** n % 10, end = '')", "# Author : //- kibrom Hailu -\\\\\r\n\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque \r\nfrom bisect import bisect , bisect_left ,bisect_right \r\nfrom itertools import accumulate \r\nfrom heapq import heapify , heappop , heappush , heappushpop , heapreplace\r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n \r\n n = I()\r\n if n == 0:\r\n return str(1) \r\n\r\n if 8 **(n%4) == 1:\r\n return str(6)\r\n \r\n return str(8**(n%4))[-1]\r\n\r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nprint(solve())\r\n", "n=int(input())\r\nn1=n%4\r\nif n==0:\r\n print(1)\r\nelif n1==0:\r\n print(6)\r\nelif n1==1:\r\n print(8)\r\nelif n1==2:\r\n print(4)\r\nelif n1==3:\r\n print(2)", "n = int(input())\r\n\r\ndigit = pow(1378, n, 10)\r\n\r\nprint(digit)", "from functools import lru_cache\r\n\r\n\r\nn = int(input())\r\n\r\n\r\n\r\n@lru_cache(None)\r\ndef findPower(n):\r\n if n == 1:\r\n return 8\r\n if n == 0:\r\n return 1\r\n if n % 2 == 0:\r\n val = findPower(n//2) * findPower(n//2)\r\n return int(str(val)[-1])\r\n else:\r\n val = findPower(n//2) * findPower(n//2) \r\n return int(str(val)[-1]) * 8\r\n \r\nval = findPower(n)\r\nprint(str(val)[-1])\r\n \r\n ", "n=int(input())\r\nprint(pow(8,n,10))", "n = int(input())\r\nif n==0:print('1');exit()\r\nif n%4==0:print(6)\r\nelif n%4==3:print(2)\r\nelif n%4==2:print(4)\r\nelif n%4==1:print(8)", "n = int(input())\r\nif n==0:\r\n a = 1\r\n print(a)\r\nelif n%4 == 0:\r\n a=6\r\n print(a)\r\nelif n%4 == 1:\r\n a = 8\r\n print(a)\r\nelif n%4 == 2:\r\n a = 4\r\n print(a)\r\nelif n%4 == 3:\r\n a = 2\r\n print(a) ", "n = int(input())\r\n# l = pow(1378,n)\r\n# s = str(l) \r\n# si = s[-1]\r\n# print(si) \r\nif n==0:\r\n print(1)\r\nelif n%4==0:\r\n print(6)\r\nelif n%4==1:\r\n print(8)\r\nelif n%4==2:\r\n print(4)\r\nelif n%4==3:\r\n print(2)\r\n", "# ██████╗\r\n# ███ ███═█████╗\r\n# ████████╗ ██████╗ ████████╗ ████ █████ ████╗\r\n# ██╔═════╝ ██╔═══██╗ ██╔═════╝ ████ █ ███║\r\n# ██████╗ ██║ ╚═╝ ██████╗ ████ ████╔╝\r\n# ██╔═══╝ ██║ ██╗ ██╔═══╝ ███ ███╔══╝\r\n# ████████╗ ╚██████╔╝ ████████╗ ███ ██╔═╝\r\n# ╚═══════╝ ╚═════╝ ╚═══════╝ ███╔══╝\r\n# Legends ╚══╝\r\n\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nprint(pow(1378, n, 10))\r\n", "o = [8, 4, 2, 6]\np = int(input())\nif p == 0:\n print('1')\nelse:\n r = p % 4 - 1\n if r == -1:\n r = 3\n print(o[r])", "n = int(input())\r\nprint([8,4,2,6][n % 4 - 1] if n > 0 else 1)", "res = [8, 4, 2, 6]\r\nn = int(input())\r\nif n!=0:\r\n n = n%4 -1\r\n print(res[n])\r\nelse:\r\n print(1)", "n = int(input())\r\nmod = n %4\r\nif n == 0:\r\n print(1)\r\nelif mod ==0:\r\n print(6)\r\nelif mod == 1:\r\n print(8)\r\nelif mod == 2:\r\n print(4)\r\nelif mod == 3 :\r\n print(2)\r\n", "n = int(input())\r\nprint(8 if n % 4 == 1 else 4 if n % 4 == 2 else 2 if n % 4 == 3 else 1 if n == 0 else 6)", "n = int(input())\r\nif n == 0:\r\n print(1)\r\nelse:\r\n d = n % 4 - 1\r\n s = '8426'\r\n print(s[d])\r\n", "n=int(input())\r\nl=[8,4,2,6]\r\nif n==0:\r\n print(1)\r\nelse:\r\n p=n%4\r\n print(l[p-1])", "n= int(input())\r\nif (n==0):\r\n print(\"1\")\r\nif (n==1):\r\n print(\"8\")\r\nelif(n%2 == 0) and n%4 !=0:\r\n print(\"4\")\r\nelif(n%2==1) and (n%4)!=1 :\r\n print(\"2\")\r\nelif (n%4==1):\r\n print(\"8\")\r\nelif(n%4==0) and n!=0:\r\n print(\"6\")\r\n", "def main():\r\n m = int(input())\r\n k = 1\r\n f = 8\r\n while m:\r\n if m & 1:\r\n k = (k * f) % 10\r\n m >>= 1\r\n f = (f * f) % 10\r\n print(k)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\n\r\nif n == 0:\r\n last_digit = 1\r\nelse:\r\n last_digit_pattern = [8, 4, 2, 6]\r\n last_digit = last_digit_pattern[(n - 1) % 4]\r\n\r\nprint(last_digit)\r\n", "n = int(input())\r\nd = [6,8,4,2]\r\nif n == 0:\r\n print(1)\r\nelse:\r\n print(d[n%4])\r\n", "n=int(input())\r\nmod=n%4\r\ns=\"8426\"\r\nif(n==0):\r\n print(1)\r\nelse:\r\n print(s[mod-1])", "n = int(input())\r\nif n == 0:\r\n print(1)\r\nelse:\r\n a = [8 , 4 , 2 , 6 , 8 , 4 , 2,6]\r\n print(a[(n % 8) - 1])", "n = int(input())\r\n\r\nref = [6,8,4,2]\r\n\r\nif n==0:\r\n print('1')\r\nelse:\r\n print(ref[n%4])", "a=int(input())\r\nif a==0:\r\n print(1)\r\nelif a%4==1:\r\n print(8)\r\nelif a%4==2:\r\n print(4)\r\nelif a%4==3:\r\n print(2)\r\nelse:\r\n print(6)", "l=[8,4,2,6]\r\nn=int(input())\r\nprint(n==0 and 1 or l[(n%4)-1])", "i=int(input())\r\nprint(pow(1378,i,10))", "n = int(input())\r\no = [8, 4, 2, 6]\r\nif n == 0:\r\n print(1)\r\nelse:\r\n print(o[(n-1)%4])", "n=int(input())\r\nprint(1 if not n else 8 if not (n-1)%4 else 4 if not (n-2)%4 else 2 if not (n-3)%4 else 6)", "def main():\n i = int(input())\n if i == 0:\n print(1)\n return 0\n i %= 4\n if i == 0:\n i = 4\n print((1378**i)%10)\nmain()\n", "n = int(input()); print(1 if n == 0 else (8 ** (n % 4 + ((n % 4) == 0) * 4)) % 10 )", "dig = [8, 4, 2, 6]\r\nn = int(input())\r\nprint(dig[(n%4)-1] if n > 0 else 1)", "x=int(input())\r\n#n=1 8\r\n#n=2 4\r\n#n=3 2\r\n#n=4 6 \r\n#n=5 8\r\n#n=6 4\r\n#n=7 2\r\n# the diffrence equals 4 between 7 and 2, 8 and 1..etc\r\nv=0\r\nif x==0:\r\n v=1\r\nelse:\r\n while x>0:\r\n\r\n if x==1:\r\n v=8\r\n if x==2:\r\n v=4\r\n if x==3:\r\n v=2\r\n if x==4:\r\n v=6\r\n if x==-1:\r\n v='error'\r\n x=x-4\r\n \r\nprint(v)", "n = int(input())\r\nl = [6,8,4,2]\r\n\r\nif n==0:\r\n print(1)\r\nelse:\r\n print(l[n%4])", "def solution():\r\n n = int(input())\r\n if n != 0:\r\n d = [8,4,2,6]\r\n n = n % 4\r\n print(d[n - 1])\r\n else:\r\n print(1)\r\nsolution()\r\n", "n = int(input())\r\nlast_digit = [8,4,2,6]\r\nif n == 0:\r\n print(1)\r\nelse:\r\n print(last_digit[(n-1)%4])\r\n", "from sys import stdin\r\nn = int(stdin.readline().strip())\r\nif n != 0:\r\n if n % 4 == 1:\r\n print(8)\r\n elif n % 4 == 2:\r\n print(4)\r\n elif n % 4 == 3:\r\n print(2)\r\n elif n % 4 == 0:\r\n print(6)\r\nelse:\r\n print(1)", "n = int(input())\r\nprint([8, 4, 2, 6][(n-1)%4] if n > 0 else 1)", "\r\narr = [6, 8, 4, 2]\r\nn = int(input())\r\n\r\nif (n == 0):\r\n print(1)\r\nelse:\r\n n = n-(4*int(n/4));\r\n print(arr[n])", "# ██████╗\r\n# ███ ███═█████╗\r\n# ████████╗ ██████╗ ████████╗ ████ █████ ████╗\r\n# ██╔═════╝ ██╔═══██╗ ██╔═════╝ ████ █ ███║\r\n# ██████╗ ██║ ╚═╝ ██████╗ ████ ████╔╝\r\n# ██╔═══╝ ██║ ██╗ ██╔═══╝ ███ ███╔══╝\r\n# ████████╗ ╚██████╔╝ ████████╗ ███ ██╔═╝\r\n# ╚═══════╝ ╚═════╝ ╚═══════╝ ███╔══╝\r\n# Legends ╚══╝\r\nimport sys\r\ninput = sys.stdin.readline\r\nprint(pow(1378, int(input()), 10))\r\n", "n=int(input())\r\nans=0\r\nif n==0:\r\n ans=1\r\nelif n%4==1:\r\n ans=8\r\nelif n%4==2:\r\n ans=4\r\nelif n%4==3:\r\n ans=2\r\nelse:\r\n ans=6\r\nprint(ans)", "if __name__ == \"__main__\":\n n = int(input())\n print(1 if n == 0 else 8 if n % 4 == 1 else 4 if n % 4 == 2 else 2 if n % 4 == 3 else 6)", " \r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n#print = lambda x: sys.stdout.write(str(x) + \"\\n\")\r\n \r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\n#SLMII = lambda: sorted(LMII())\r\n\r\nn = II()\r\n\r\nans = {0:6, 1: 8, 2: 4, 3: 2}\r\n\r\nprint(ans[n%4] if n else 1)", "n = int(input())\r\nprint([1,[6,8,4,2][n%4]][n!=0])", "# https://codeforces.com/problemset/problem/742/A\r\n\r\nn = int(input())\r\n\r\nif n == 0:\r\n print(1)\r\nelse:\r\n res = [6, 8, 4, 2]\r\n m = n % 4\r\n print(res[m])\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n n = int(input())\r\n ans = n%4\r\n arr = [6,8,4,2]\r\n if(n==0):\r\n print(1)\r\n else:\r\n print(arr[ans])\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "x = int(input())\r\nif(x == 0):\r\n print(1)\r\nelse :\r\n x = (x - 1) % 4\r\n units = [8 , 4 , 2 ,6]\r\n print(units[x])", "\r\nbase = 8\r\npower = int(input())\r\nresult = 1\r\n\r\nwhile power !=0:\r\n if power% 2==1:\r\n power = power - 1\r\n result = (result * base)%10\r\n if power%2 ==0:\r\n base = (base*base)%10\r\n power = power //2\r\n\r\nprint(result)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nprint(pow(8, n, 10))", "def stepan(a, n):\r\n a = int(str(a)[-1])\r\n if n == 0:\r\n return 1\r\n if n % 2 == 0:\r\n return stepan(a**2, n//2)\r\n else:\r\n return a * stepan(a, n-1)\r\n \r\n \r\nn = int(input())\r\n\r\n\r\nprint(str(stepan(1378, n))[-1])\r\n\r\n#1 4\r\n#4\r\n#5 4 3 2\r\n#2 1 3 2\r\n\r\n#3\r\n\r\n ", "def solve():\r\n n = int(input())\r\n \r\n l = [8, 4, 2, 6]\r\n \r\n if n == 0:\r\n print(1)\r\n \r\n else:\r\n idx = (n - 1) % 4\r\n# print(idx)\r\n print(l[idx])\r\n \r\nfor _ in range(1): \r\n solve()", "n=int(input())\r\nif n==0:print(1)\r\nelif n%4==0:print(6)\r\nelif n%4==1:print(8)\r\nelif n%4==2:print(4)\r\nelif n%4==3:print(2)", "count=pow(8,int(input()),10)\r\nprint(count)", "#author : Rohanbiswas\nn = int(input())\nprint(pow(1378,n,10))\n \t\t \t\t\t\t\t \t\t \t \t\t \t", "p = int(input())\r\nif p == 0:\r\n print(1)\r\n exit()\r\np = p % 4\r\nif p == 1:\r\n print(8)\r\nelif p == 2:\r\n print(4)\r\nelif p == 3:\r\n print(2)\r\nelse:\r\n print(6)", "n=int(input())\r\nif n==0:\r\n print('1')\r\nelse:\r\n if n%4==0:\r\n print('6')\r\n elif n%4==1:\r\n print('8')\r\n elif n%4==2:\r\n print('4')\r\n elif n%4==3:\r\n print('2')\r\n", "n=int(input())\r\nif n==0:\r\n\tprint(1)\r\nelse:\r\n\tl=[6,8,4,2]\r\n\tprint(l[n%4])", "n = int(input())\nif n == 0 :\n print(1)\n exit(0)\nprint([6,8,4,2][n%4])", "n=int(input())\r\n\r\nl=[6,8,4,2]\r\nif(n==0):\r\n print(1)\r\nelse:\r\n print(l[n%4])", "def solve(n):\r\n if n == 0:\r\n return 1\r\n\r\n remainder = n % 4\r\n if remainder == 0:\r\n return 6\r\n elif remainder == 1:\r\n return 8\r\n elif remainder == 2:\r\n return 4\r\n else:\r\n return 2\r\n\r\n\r\nn = int(input())\r\nprint(solve(n))", "x = int(input())\r\nls = [8,4,2,6]\r\nif x == 0:\r\n print(1)\r\nelse:\r\n print(ls[((x-1)%4)])", "num = int(input())\r\nif(num==0):\r\n print(1)\r\nelse:\r\n a = 8\r\n b= num%4\r\n if(b==0):\r\n b = 4\r\n re = a ** b\r\n re = str(re)\r\n print(re[-1])", "n = int(input())\r\nif n == 0:\r\n print(1)\r\nelse:\r\n print({0:6, 1:8, 2:4, 3:2}[n % 4])", "a = int(input())\r\nd= [6, 8, 4, 2]\r\nif a != 0:\r\n print(d[a%4])\r\nelse:\r\n print(1)", "n=int(input())\r\nx=n%4\r\nif n==0:\r\n print(1)\r\nelif x==0:\r\n print(6)\r\nelif x==1:\r\n print(8)\r\nelif x==2:\r\n print(4)\r\nelif x==3:\r\n print(2)", "n = int(input())\r\nif n == 0:\r\n print(1)\r\nelse:\r\n print((8 ** (n % 4)) % 10 if n % 4 != 0 else 6)", "t=int(input())\r\nmemo={}\r\n\r\ndef powerize(last,exponent):\r\n \r\n if (last,exponent) in memo:\r\n return memo[(last,exponent)]\r\n if exponent<=pow(10,5):\r\n pro=pow(last,exponent)\r\n memo[(last,exponent)]=pro%10\r\n return pro%10\r\n if exponent%2==0:\r\n left=powerize(last,exponent//2)\r\n right=powerize(last,exponent//2)\r\n \r\n pro=left*right\r\n \r\n memo[(last,exponent)]=pro%10\r\n return pro%10\r\n else:\r\n half=exponent//2\r\n left=powerize(last,half+1)\r\n right=powerize(last,half)\r\n \r\n pro=left*right\r\n \r\n memo[(last,exponent)]=pro%10\r\n return pro%10\r\n \r\n\r\nprint(powerize(8,t))", "a = int(input())\r\n\r\nprint(pow(1378, a, 10))" ]

[ "n, alp = map(int, input().split())\r\na = 180 / n\r\n\r\nif alp >= (n-2)*180/n:\r\n print(\"1 2 3\")\r\nelse:\r\n k1 = int(alp / a)\r\n if (k1 + 1) * a - alp < alp - k1 * a:\r\n k1 += 1\r\n if k1 == 0:\r\n print(\"2 1 3\")\r\n else:\r\n print(1, 2, n + 1 - k1)\r\n", "n,a=[int(x) for x in input().split()]\nc=180/n\nx=2*c\nmin=a-c\nmin_v=n\nfor i in range(n-1,2,-1):\n if(abs(a-x)<min):\n min=abs(a-x)\n min_v=i \n \n x+=c\nprint(\"1 2 \"+str(min_v) )", "n, a = map(int, input().split())\r\n\r\nu = (n - 2) * 180 / n\r\nd = 180 / n\r\n\r\nt1, t2 = d * (a // d), d * (a // d + 1)\r\nangles = {abs(i * d - a): i for i in range(1, n - 1)}\r\ni = angles[min(angles.keys())]\r\n\r\nprint(1, 2, n - i + 1)\r\n", "n, a = map(int, input().split())\r\n\r\nalf = 180 * (n - 2) / n\r\n\r\nalf1 = 0\r\nans = 10 ** 9\r\nans_v = 0\r\nfor i in range(n - 2):\r\n alf1 += alf / (n - 2)\r\n \r\n if abs(alf1 - a) < ans:\r\n ans = abs(alf1 - a)\r\n ans_v = n - i\r\n \r\nprint(1, 2, ans_v)", "n, a = map(int, input().split())\r\na*=n\r\nk=1\r\nfor i in range(2,n-1):\r\n if abs(k*180 - a)> abs(i*180 - a): k=i\r\nprint(str(n-1)+' ' +str(n) + ' ' +str(n-1-k))\r\n", "s,a=map(int,input().split())\r\nprint(2,1,min(2+max(1,(a*s+90)//180),s))", "n, a = list(map(int, input().split()))\r\n\r\nbest = 200\r\nans = 0\r\n\r\nfor i in range(1, n - 1):\r\n if best > abs(180 * i / n - a):\r\n best = abs(180 * i / n - a)\r\n ans = n - i + 1\r\n\r\nprint(1, 2, ans)", "def ri(): return int(input())\r\ndef rli(): return list(map(int, input().split()))\r\ndef rls(): return list(input())\r\ndef pli(a): return \"\".join(list(map(str, a)))\r\n\r\n\r\nn, a = rli()\r\nminang = 180/n\r\nv1 = 2\r\nv2 = 1\r\nminerr = 114514810\r\nv3 = 0\r\nfor i in range(3, n+1):\r\n if(minerr > abs(a-minang*(i-2))):\r\n v3 = i\r\n minerr = abs(a-minang*(i-2))\r\n\r\nprint(v1, v2, v3)", "\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\nn,a=map(int,input().split())\r\n\r\nm=10**10\r\n\r\nfor i in range(1,n-1):\r\n if abs(a-i*180/n)<m:\r\n m=abs(a-i*180/n)\r\n im=i\r\n\r\nprint(1,n,im+1)\r\n\r\n\r\n\r\n", "n, a = map(int, input().split())\r\nv, va = 0, -180\r\nfor i in range(2, n):\r\n ca = (n - i) * 180 / n\r\n if abs(a - ca) < abs(a - va):\r\n v, va = i, ca\r\nprint(n, 1, v)", "from decimal import *\nn, a = map(int, input().split())\ngetcontext().prec = 20;\ntmp = Decimal(360.0)\nb = (Decimal(180.0)*(n-2)) / n\nd = Decimal(180.0) / n\nfor i in range(3,n+1):\n\tif abs(a-b) < tmp:\n\t\ttmp = abs(a-b)\n\t\tpos = i\n\tb = b - d\nprint(1,2,pos)", "n,a=map(int,input().split())\r\ns=180*(n-2)\r\nc=s/n\r\nk=(180-c)/2\r\nugl=[]\r\nfor i in range(1,n-1):\r\n ugl.append(k*i)\r\nmi=abs(ugl[0]-a)\r\nv=3\r\nfor i in range(len(ugl)):\r\n if abs(ugl[i]-a)<mi:\r\n mi=abs(ugl[i]-a)\r\n v=i+3\r\nprint('2 1',v)\r\n", "n,a = map(int,input().split())\nk = (a*n) // 180\nasdf = (a*n) % 180\nif(asdf > 90):\n\tans = k+1\nelse:\n\tans = k\nans = min(max(ans, 1), n-2)\n\nprint(1,2,n+1-ans)", "n, angle = (int(x) for x in input().split())\n\nangle_per = 180 / n\napprox = round(angle / angle_per)\nif approx == 0:\n print(1, n, 2)\nelif approx >= n - 2:\n print(1, 2, 3)\nelse:\n print(1, n, 1 + approx)\n", "def solve():\r\n n, a = map(int, input().split())\r\n\r\n slc = 360/n\r\n inscribe_slc = slc/2\r\n \r\n nearest_ang = 360.0\r\n ans = []\r\n\r\n v1 = 1\r\n v2 = 2\r\n for v3 in range(3, n+1):\r\n currang = (v3-v2)*inscribe_slc\r\n if nearest_ang > abs(currang - a):\r\n nearest_ang = abs(currang - a)\r\n ans = [v2, v1, v3]\r\n \r\n print(*ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "n,d=map(int,input().split())\r\ndegree=[]\r\ndeg=180*(n-2)/n\r\nfor i in range(1,n-1) :\r\n deeg=deg*i/(n-2)\r\n degree.append(deeg)\r\nmin_ekh=[]\r\nfor i in range(len(degree)):\r\n #if min_ekh>=abs(d-degree[i]):\r\n min_ekh.append(abs(d-degree[i]))\r\n \r\nprint(2,1,min_ekh.index(min(min_ekh))+3)\r\n", "arr=list(map(int, input().rstrip().split()))\r\nn=arr[0]\r\na=arr[1]\r\nfa=(180-((180*(n-2))/n))/2\r\nna=fa\r\nind=[]\r\nfor i in range(n-2):\r\n ind.append(abs(a-na))\r\n na+=fa \r\n#print(ind)\r\nflg=-1\r\nix=-1\r\ngg=min(ind)\r\nff=ind.index(gg)\r\nprint('1 2',end=\" \")\r\nprint(str(n-ff))", "\"\"\" Created by Henrikh Kantuni on 6/27/17 \"\"\"\n\nif __name__ == \"__main__\":\n n, a = [int(x) for x in input().split()]\n a = float(a)\n angle = 180 / n\n angles = []\n k = 2\n\n while n - k != 0:\n angles.append((angle * (n - k), k))\n k += 1\n\n count = 0\n m = 180\n minimum = ()\n\n while count < len(angles):\n if abs(angles[count][0] - a) < m:\n m = abs(angles[count][0] - a)\n minimum = angles[count]\n count += 1\n\n l = minimum[1]\n print(1, n, n - l + 1)\n", "n,a=map(int,input().split())\r\nprint(2,1,min(2+max(1,(a*n+90)//180),n))\r\n", "n, a = list(map(int, input().split()))\r\n\r\nc = round(n*a / 180.0) + 2\r\nif c == 2:\r\n c = 3\r\n\r\nif c > n:\r\n c = n\r\n\r\nprint(2, 1, c)\r\n", "from math import *\r\nfrom bisect import *\r\n\r\nn, ta = [int(i) for i in input().split()]\r\n\r\nva = [0]\r\n\r\nfor i in range(1, n):\r\n a = 2 * pi * i / n\r\n y = sin(a)\r\n x = cos(a)\r\n a0 = atan2(y, x-1)\r\n if a0 < 0: a0 += 2 * pi\r\n a0 = a0 * 180 / pi\r\n va.append(a0)\r\n\r\nans = []\r\nbdif = 999\r\n\r\ndef test(i, ii):\r\n global bdif, ans\r\n da = va[ii]-va[i]\r\n dif = abs(da - ta)\r\n if dif < bdif:\r\n bdif = dif\r\n ans = [i+1, 1, ii+1]\r\n\r\nfor i in range(1, n):\r\n tai = ta + va[i]\r\n ii = bisect_left(va, tai) - 1\r\n if i < ii:\r\n test(i, ii)\r\n if ii + 1 < n:\r\n test(i, ii + 1)\r\n\r\nprint(*ans)", "n, a = map(int,input().split())\r\nS = (n-2)*180\r\nv1=2\r\nv2=1\r\nv3=0\r\nk=2\r\nu=0\r\nmi=180\r\nfor i in range(2, n):\r\n k+=1\r\n u=((k-2)*(180-(n-2)*180/n))/2\r\n if abs(a-u)<mi:\r\n mi=abs(a-u)\r\n v3=i+1\r\nprint(v1,v2,v3)\r\n", "a,b=map(int,input().split())\r\nr=1\r\nb*=a\r\nfor i in range(2,a-1):\r\n if(abs(r*180-b)>abs(i*180-b)):\r\n r=i\r\nprint(a-1,a,a-r-1)", "n, theta = map(int, input().split())\r\nphi = (n-2)*180/n\r\nphi /= n-2\r\nk = round(theta/phi)\r\nk = max(k, 1)\r\n\r\nprint(f\"2 1 {min(2+k, n)}\")", "n,a=[int(i) for i in input().split()]\r\nx=0\r\nmin1=1000\r\nsave=0\r\nfor i in range(n-2):\r\n x+=(180/n)\r\n y=abs(x-a)\r\n if (y<min1):\r\n min1=y\r\n save=i\r\nprint (1,2,n-save)\r\n\r\n\r\n", "n,a=map(int,input().split())\r\nb=(n*a //180)\r\nb=max(1,min(n-2,b))\r\nk=b\r\nfor i in range(max(1,b-2),min(n-2,b+2)+1):\r\n if(abs(180*i-n*a)<abs(180*k-n*a)):\r\n k=i;\r\nprint(2,1,k+2)\r\n", "import sys\r\nn,a=(int(a) for a in input('').split())\r\n\r\nres=-1\r\ndiff=sys.maxsize\r\nfor i in range(1,n-1):\r\n resangle=180*i/n\r\n if abs(resangle-a)<diff:\r\n diff=abs(resangle-a)\r\n res=i\r\n\r\n\r\nprint('1 '+str(res+2)+' '+str(res+1))", "from fractions import Fraction\r\nn,a=list(map(int,input().strip().split(' '))) \r\nif a>=(n-2)*180/n:\r\n ans=3\r\nelif a<=180/n:\r\n ans=n\r\nelse:\r\n k=int(n-a*n/180+1)\r\n MIN=10**9\r\n MIN=abs(180*(n-k+1)/n-a)\r\n ans=k\r\n if k>3 and k<n:\r\n check1=k-1\r\n check2=k+1\r\n if abs(180*(n-check1+1)/n-a)<MIN:\r\n ans=check1\r\n MIN=abs(180*(n-check1+1)/n-a)\r\n if abs(180*(n-check2+1)/n-a)<MIN: \r\n ans=check2\r\n MIN=abs(180*(n-check1+1)/n-a)\r\n elif k==3:\r\n check2=k+1\r\n if abs(180*(n-check2+1)/n-a)<MIN: \r\n ans=check2\r\n MIN=abs(180*(n-check2+1)/n-a)\r\n elif k==n:\r\n check1=k-1\r\n if abs(180*(n-check1+1)/n-a)<MIN:\r\n ans=check1\r\n MIN=abs(180*(n-check1+1)/n-a)\r\nA=[1,2,ans]\r\nprint(*A)\r\n \r\n \r\n \r\n ", "a,b=map(int,input().split())\r\nprint('2 1 ')\r\nc,INF=180/a,100000\r\nangle,p=INF,0\r\nfor x in range(a-2):\r\n\tx=x+1;\r\n\tif (abs(x*c-b)<angle): \r\n\t\tangle=abs(x*c-b)\r\n\t\tp=x+2\r\nprint(p)", "# IAWT\r\nn, a = list(map(int, input().split()))\r\nx = a*2 / (360/n)\r\nif x % 1 <.5:\r\n x = int(x)\r\nelse:\r\n x = int(x) + 1\r\nif x == 0:\r\n x = 1\r\ny = x+1\r\nif a >= ((n-2) * 180 / n):\r\n print(1, 2, 3)\r\nelse:\r\n print(0+1, y+1, x+1)\r\n", "n, a = list(map(int, input().split()))\r\ndif = 180\r\nfor i in range(1, n-1):\r\n curdif = abs(180*i/n-a)\r\n if curdif < dif:\r\n dif = curdif\r\n index = i\r\nprint('1 2 '+str(n+1-index))\r\n \r\n", "'''\r\nimport sys\r\ndata = sys.stdin.readlines()\r\n'''\r\nimport math\r\n# reading from standard input\r\nimport fileinput\r\nfor line in fileinput.input():\r\n ainput = [int(x) for x in line.split()]\r\n# number of days\r\nd=1\r\n#rewrite into convenient variables \r\nn=ainput[0]\r\na=ainput[1]\r\nmaxa=((n-2)*180/n)\r\nmina=maxa/(n-2)\r\nif maxa<=a:\r\n print(2,1,n)\r\nelif mina>=a:\r\n print(2,1,3)\r\nelse:\r\n k=math.ceil(a/mina)\r\n if k*mina-a > a-(k-1)*mina: \r\n print(2,1,k+1)\r\n else:\r\n print(2,1,k+2) \r\n", "I = lambda : map(int, input().split())\nn, a = I()\n\nexp = 999999999999\nans = 0\n\nfor i in range(1, n-1):\n newexp = abs((i*180.0)/(n*1.0) - a)\n if newexp < exp:\n ans = i\n exp = newexp\n\nprint(2, 1, 2+ans)", "from math import floor, ceil\r\n\r\nn, a = input().split()\r\nn, a = int(n), int(a)\r\n\r\nx_l = n * a / 180.0\r\n\r\nif x_l < 1:\r\n res = 1\r\nelif x_l > n - 2:\r\n res = n - 2\r\nelse:\r\n if x_l % 1 <= .5:\r\n res = floor(x_l)\r\n else:\r\n res = ceil(x_l)\r\n\r\nprint(\"1 2 \" + str(n - res + 1))\r\n", "n, a = map(int, input().split())\nangle = (180 - ((n - 2) * 180) / n) / 2\n#print(angle)\ndifs = [abs(x*angle - a) for x in range(1, n-1)]\nnums = [(1,2,x) for x in range(n,2,-1)]\n#print(nums)\n#print(difs.index(min(difs)))\nprint(*nums[difs.index(min(difs))])\n\n", "from math import *\r\n\r\nn, a = map(int, input().split())\r\n\r\nd = (n - 2) * 180 / n\r\nm = 180 / n\r\n\r\nmn = 1000000\r\nnum = -1\r\n\r\nfor i in range(n - 2):\r\n if abs(a - d) < mn:\r\n mn = abs(a - d)\r\n num = i\r\n d -= m\r\n\r\nprint(1, 2, num + 3)\r\n", "n, a = input().split()\nn = int(n)\na = int(a)\n\nk = a * n / 180\n#print(k)\nif k < 1:\n\tk = 1\nif k > n - 2:\n\tk = n - 2\nprint(str(int(round(k, 0))) + \" \" + str(n - 1) + \" \" + str(n))\n", "#!/usr/bin/env python3\nimport sys\n\ndef main():\n n, a = map(int, sys.stdin.readline().split())\n sum_angles = 180 * (n - 2)\n if a >= sum_angles / n:\n print(\"2 1 {}\".format(n))\n return\n div = (n - 2) * n\n lo = 1\n hi = n - 1\n while lo + 1 < hi:\n mid = (lo + hi) // 2\n angle = sum_angles * mid / div\n if angle <= a:\n lo = mid\n else:\n hi = mid\n #print(\"vals\", lo, hi, file=sys.stderr)\n if (hi + lo) * sum_angles / div - 2 * a > 0:\n print(\"2 1 {}\".format(lo + 2))\n else:\n print(\"2 1 {}\".format(hi + 2))\n\n\nif __name__ == '__main__':\n main()\n", "n,a=map(int,input().split())\r\nx=(((n-2)*180)/n)/(n-2)\r\ny1=int(a//x)\r\nif y1==0:\r\n y1+=1\r\ny1=min(y1,n-2)\r\ny2=y1+1\r\ny2=min(y2,n-2)\r\nif abs(y1*x-a)<abs(y2*x-a):\r\n print(2,1,y1+2)\r\nelse:\r\n print(2,1,y2+2)\r\n \r\n \r\n \r\n", "n, a = [int(item) for item in input().split()]\r\n\r\nminAngleDist = float(\"inf\")\r\nfor i in range(1, n - 1):\r\n angle = i * 180 / n\r\n if abs(angle - a) < minAngleDist:\r\n minAngleDist = abs(angle - a)\r\n v = i\r\n\r\nprint(1, 2 + v, 1 + v)", "inp=input().split()\nn=int(inp[0])\na=int(inp[1])\nangle = 180/n\nminval=9999999\nmini=0\nfor i in range(1,n-1):\n\tcurang=i*angle\n\tif(abs(curang-a)<minval):\n\t\tminval=abs(curang-a)\n\t\tmini=i\nprint(str(2+mini)+\" 1 2\")\n\n\n", "n, a = map(int, input().split(\" \"))\r\n\r\ncurAnlge = 180 * (n - 2) / n\r\nminAngle = curAnlge - a\r\nnextAngle = (180 - curAnlge) / 2\r\n\r\ni = n\r\nangleCount = 1\r\n\r\nwhile i > 3:\r\n if minAngle > abs(curAnlge - nextAngle * angleCount - a):\r\n minAngle = (curAnlge - nextAngle * angleCount - a)\r\n i -= 1\r\n angleCount += 1\r\n else:\r\n break\r\n\r\nprint(\"2 1 \" + str(i))", "n,a= map(int,input().split())\r\n\r\nv= (n-2)*180/n\r\nnum=abs(v-a)\r\nx=3\r\ndiv=v/(n-2)\r\nfor i in range(4,n+1):\r\n v=v-div\r\n if(abs(v-a)<num):\r\n x=i\r\n num=abs(v-a)\r\nprint(1,2,x)\r\n", "n,angle = map(int,input().split())\r\ndata=[]\r\nans=361\r\npos=-1\r\nfor i in range(1,n-1):\r\n temp=180/n*i\r\n if abs(temp-angle)<ans:\r\n ans=abs(temp-angle)\r\n pos=i\r\nprint('2 1',pos+2)\r\n \r\n", "# 07/08/2021\r\n# geometry training\r\n\r\nn,a=map(int,input().split())\r\n\r\nmin_abs=360\r\nvertex=0\r\n\r\nfor i in range(3,n+1):\r\n angle = 180*(i-2)/n\r\n if abs(angle - a)<min_abs:\r\n min_abs=abs(angle-a)\r\n vertex = i\r\n\r\nprint(vertex,1,2)\r\n", "inputs = input().split(\" \")\nv = int(inputs[0])\nangle = int(inputs[1])\n\nmax_angle = ((v-2)*180) / v\nmin_angle = 180 / v\n\nposs_third_vertex = range(3, v+1)\n\nposs_angles = [i*min_angle for i in range(1, v-1)]\n\ndiffs = [abs(x - angle) for x in poss_angles]\n\nthird_vertex = poss_third_vertex[diffs.index(min(diffs))]\n\nprint(\"2 1 {}\".format(third_vertex))", "n, a = input().split()\nn = int(n)\na = int(a)\nu = -1\nm = 10000\nfor i in range(1, n-1):\n if abs(180/n*i-a) < m:\n m=abs(180/n*i-a)\n u = i\nprint(1+u, u+2, 1)\n\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, a = map(int, input().split())\r\nx = 180/n\r\nd = -1\r\nc = 360\r\nfor i in range(1, n-1):\r\n s = abs(i*x - a)\r\n if s < c:\r\n c = s\r\n d = i\r\nprint(2, 1, 2+d)", "n,a = map(int,input().strip().split())\r\n\r\nalpha = (180/n)\r\nmik = 1\r\n\r\nm = abs(alpha - a)\r\n\r\nfor k in range(2, n-1):\r\n if abs(alpha*k - a) < m:\r\n m = abs(alpha*k-a)\r\n mik = k\r\n\r\nprint(1,2,n-mik+1)\r\n# exit(0)\r\n\r\n\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡴⢋⠵⠉⠀⠀⠀⡠⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠳⣄⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡠⠋⠀⡎⠀⠀⡀⠔⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⢢⡀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠎⠀⠀⠀⠈⠉⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠱⡀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡰⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢳⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡸⠁⠀⣀⣀⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡇⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡸⠁⠀⠀⠀⠀⠀⠀⠈⠉⠒⠂⠀⠀⠀⠀⠀⠀⢀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠰⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠉⠉⠐⠒⠤⢀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠇⠀⠀⢰⠊⠉⢉⡁⠒⠢⣄⠀⣰⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⠒⢄⡀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡔⡛⠀⠀⠀⠘⢆⡀⠈⠃⠀⠀⡸⠀⠇⠀⠀⠀⠀⠀⡠⠤⠤⢀⣀⠀⠀⠀⠀⠀⠀⠁⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⢡⠇⠀⠀⠀⠀⠀⠉⠓⠒⠒⠉⠀⡼⠀⠀⠀⠀⠀⢸⠀⠀⠀⣤⠈⠉⠲⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡎⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡇⠸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡴⠀⠀⠀⠀⠀⠀⠀⠣⡀⠀⠀⠀⠀⠀⡸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⠃⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢁⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡜⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⠒⠒⠒⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡞⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⣾⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣰⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⠀⠂⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠋⠉⠉⢆⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⡴⡲⢳⡸⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀⠀⠀⠐⣶⣤⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⣾⠱⠁⡇⣎⠃⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⠀⠀⠀⠀⠀⠀⠀⠹⣍⠀⠈⠉⠑⠒⠒⠀⣤⠄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣟⠟⠀⢠⢫⠋⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⡆⠀⠀⠀⠀⠀⠀⠀⠈⠑⠂⠀⠀⠐⠒⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣴⠟⠋⠀⠀⡿⠃⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠠⠒⠒⠐⠒⡠⠊⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣴⠒⠒⢤⠋⠘⡆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣠⣪⢵⠶⡶⠚⠉⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⡠⠔⠂⠉⣴⠀⢰⠃⠀⠀⠸⣆⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣠⡾⡏⠁⠘⡄⢣⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⢀⠔⢸⠉⠗⠉⠀⠀⠀⠀⡇⢀⠇⠀⠀⠀⡰⠙⢦⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣠⡴⠟⠋⠀⡇⠀⠀⢣⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⢠⠊⠀⠸⠈⡄⠀⠀⠀⠀⠘⠀⠈⠀⠀⠀⡰⠁⡰⠋⢙⠦⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣀⣠⣴⠶⠛⠉⠀⠀⠀⠀⡇⠀⠀⢸⢸⠄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⡇⠀⠀⠀⢧⠈⣢⢴⡺⡟⠑⠢⣄⠀⠀⡰⣡⠊⠀⢠⠎⣠⡞⡏⠙⠛⠳⠶⠶⠿⠟⠛⠓⠉⠉⠀⠀⠀⠀⠀⠀⣀⠔⠃⠀⠀⡏⢸⠉⠲⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⣴⠀⠀⠀⠘⣴⢡⠋⣠⢃⣠⣤⡘⣆⣼⠟⠁⠀⣰⡣⢫⠎⠀⢰⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⠤⠊⠁⠀⡆⠀⡸⠀⡞⠀⠀⠘⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⡜⠈⢧⠀⠀⠀⡇⠈⠉⣴⣿⣿⣿⣷⡿⠁⠀⠀⣰⠟⠀⡜⠀⠀⠘⠳⣄⠀⠀⠀⠀⠀⠀⠀⠀⣀⠤⠐⠋⠀⠀⠀⠀⠀⡇⢠⠃⢀⠃⠀⠀⣄⠙⠤⣀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⢰⠁⠀⠈⢧⠀⠀⠻⡅⣼⣿⣿⣿⡿⠋⠀⠀⠀⡴⠃⠀⠀⡗⠀⠀⠇⠀⠀⠈⠑⠒⠒⠒⠒⠉⠁⠀⠀⠀⠀⠀⠀⠀⠀⢰⠃⡎⠀⣸⠀⠀⢀⣿⠀⠀⠀⠉⠒⢤⡀⠀⠀⠀\r\n# ⠀⡌⠀⠀⠀⠈⢣⡀⠀⠈⠛⠛⠛⠉⠀⠀⠀⣀⠞⡇⠀⠀⠀⢡⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡸⢰⠁⢀⠇⠀⠀⣸⠇⠀⠀⠀⠀⠀⠀⠈⠢⡀⠀\r\n# ⢠⠇⠀⠀⡄⠀⠀⢱⣄⠀⠀⠀⠀⠀⠀⣠⣾⠋⠀⡇⠀⠀⠀⠈⣧⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣴⠊⡇⡄⠀⣸⠀⠀⢀⡏⠀⠀⠀⠀⠀⠀⢀⡴⠂⠙⡄", "def solution(n, a):\n d = a * n / 180\n if d < 1:\n d = 1\n elif d > n - 2:\n d = n - 2\n else:\n d = round(d)\n return 1, n, 1 + d\n\nif __name__ == \"__main__\":\n n, a = map(int, input().split())\n print(\" \".join(map(str, solution(n, a))))\n", "n,a=map(int,input().split())\r\ndegree=[]\r\nd0=180*(n-2)/n\r\nd1=180/n\r\nd=d1\r\ni=2\r\nmind=180\r\nwhile d<=d0:\r\n\tdegree.append(d)\r\n\td=d1*i\r\n\ti+=1\r\n\tpass\r\nfor j in range(len(degree)):\r\n\tif abs(degree[j]-a)<mind:\r\n\t\tmind=abs(degree[j]-a)\r\n\t\tv3=j+3\r\n\tpass\r\nprint(2,1,v3)", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n return bestAngle_sVertices(*map(int, input().split()))\r\n\r\n\r\ndef bestAngle_sVertices(nVertices, angle):\r\n smallestAngle = 180 / nVertices\r\n if angle > 180 - 2*smallestAngle:\r\n return f'2 1 {nVertices}'\r\n\r\n elif angle < smallestAngle:\r\n return '2 1 3'\r\n\r\n return f'2 1 {2 + round(angle/smallestAngle)}'\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n", "n,a = [int(x) for x in input().split()]\r\nx=100000.0\r\nc=0\r\nan=180/n\r\nfor i in range(n,2,-1):\r\n if x>abs(an*(n-i+1)-a):\r\n c=i\r\n x=abs(an*(n-i+1)-a)\r\nprint(\"1 2 \"+str(c))", "import math\r\ndegs = []\r\nn,a = input().split()\r\nn,a = int(n),float(a)\r\nfor k in range(0,n+1):\r\n\tdegs.append((360*((k-1)/n)-180)/2)\r\n#print(degs)\r\n\r\nl,r = 2,3\r\nt1,t2,f1,f2 = 0,0,False,False\r\nans = 10**9\r\n\r\nwhile l < n and r <= n and l < r:\r\n\ttmp = degs[r] - degs[l]\r\n\tif abs(tmp - a) < ans :\r\n\t\tans = abs(tmp - a)\r\n\t\tt1 ,t2 = l,r\r\n\tif tmp > a:\r\n\t\tf1 ,f2 = True,False\r\n\tif tmp < a:\r\n\t\tf1 ,f2 = False,True\r\n\tif tmp == a:\r\n\t\tbreak\r\n\tif f1:\r\n\t\tl+=1\r\n\tif f2:\r\n\t\tr+=1\r\n\r\nprint(t1,1,t2)", "n, a = map(int, input().split())\r\n \r\nans = [2, 1, n]\r\nd = abs(180 * (n - 2) / n - a)\r\nfor i in range(3, n):\r\n tmp = 180 * (i - 2) / n\r\n if abs(tmp - a) < d:\r\n d = abs(tmp - a)\r\n ans[2] = i\r\n \r\nprint(' '.join(map(str, ans)))", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n return bestAngle_sVertices(*map(int, input().split()))\r\n\r\n\r\ndef bestAngle_sVertices(nVertices, angle):\r\n angle *= nVertices\r\n if angle < 180:\r\n return '2 1 3'\r\n\r\n angle /= 180\r\n angle += 2\r\n if angle > nVertices:\r\n return f'2 1 {nVertices}'\r\n\r\n return f'2 1 {round(angle)}'\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n", "n, a = map(int, input().split())\nwhole = 180 * (n - 2) / n\nsmall = whole / (n - 2)\nmindif = 1e9\nnum = 0\nfor i in range(1, n - 1):\n if mindif > abs(a - small * i):\n mindif = abs(a - small * i)\n num = i\nprint(n, n - 1, num)\n#print(num)", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n return bestAngle_sVertices(*map(int, input().split()))\r\n\r\n\r\ndef bestAngle_sVertices(nVertices, angle):\r\n angle *= nVertices\r\n if angle < 180:\r\n print('2 1 3')\r\n return\r\n\r\n angle /= 180\r\n angle += 2\r\n if angle > nVertices:\r\n print('2 1', nVertices)\r\n return\r\n\r\n print('2 1', round(angle))\r\n\r\n\r\nif __name__ == '__main__':\r\n # print(main())\r\n main()\r\n", "n,a=map(int,input().split())\r\nb=[(180*(i-2)/n,i) for i in range(3,n+1)]\r\nminim=(200,0)\r\nfor i in range(len(b)):\r\n\tif abs(b[i][0]-a)<minim[0]:\r\n\t\tminim=abs(b[i][0]-a),b[i][1]\r\n\t\t\r\n\r\nprint(2,1,minim[1])\r\n", "import math\n\nMOD = int(1e9+7)\n\ndef MOD_EXPO(b, p, m):\n if p==0: return 1\n ret = MOD_EXPO(b, p//2, m)%m\n ret = (ret*ret)%m\n return ((ret*b)%m if (p&1) else ret)\n\ndef POWER(N, K):\n ans = 1\n for i in range(K):\n ans *= N\n return ans\n\ndef SET(N, pos):\n return (N | (1<<pos))\n\ndef RESET(N, pos):\n return (N & ~(1<<pos))\n\ndef CHECK(N, pos):\n return (N & (1<<pos))\n\ndx4 = [1,-1,0,0]\ndy4 = [0,0,1,-1]\ndx6 = [0,0,1,-1,0,0]\ndy6 = [1,-1,0,0,0,0]\ndz6 = [0,0,0,0,1,-1]\ndx8 = [1,-1,0,0,-1,1,-1,1]\ndy8 = [0,0,1,-1,1,1,-1,-1]\ndkx8 = [-1,1,-1,1,-2,-2,2,2]\ndky8 = [2,2,-2,-2,1,-1,1,-1]\n\ntc = 1\neps = 1e-9\npi = math.acos(-1.0)\nmx = int(1e5)\n\nwhile True:\n try:\n n,a = map(float, input().split())\n except EOFError:\n break\n \n first = ((n-2)*180.0)/n\n second = (180.0-first)/2.0\n x, y, z = 1, 2, 3\n ans = abs(first-a)\n for i in range(3, int(n)):\n ang = (i-2)*second\n if abs(ang-a) < ans:\n ans = abs(ang-a)\n x, y, z = 2, 1, i\n print(x, y, z)\n\n\t \t \t \t \t\t \t \t \t\t \t", "n,a=list(map(int,input().split()))\r\nans=[1,0,0]\r\ns=180/n\r\nan=200\r\nfor i in range(1,n-1):\r\n\tif an>abs(a-s*i):\r\n\t\tan=abs(a-s*i)\r\n\t\tans[2]=1+i\r\n\t\tans[1]=2+i\r\nfor i in ans:\r\n\tprint(i,end=' ')\r\n\t\r\n", "# cook your dish here\r\nn,a = [int(x) for x in input().split()]\r\nx=1000.0\r\nc=0\r\nan=180/n\r\nfor i in range(n,2,-1):\r\n if x>abs(an*(n-i+1)-a):\r\n c=i\r\n x=abs(an*(n-i+1)-a)\r\nprint(\"1 2 \"+str(c))", "#!/usr/bin/python3\n\ndef read_ints():\n\treturn [int(i) for i in input().split()]\n\nn, a = read_ints()\n\nres = 1\n\nfor i in range(2, n - 1):\n\tif abs(a - res * 180 / n) > abs(a - i * 180 / n):\n\t\tres = i\n\nprint(2, 1, res + 2)", "import math\r\nfrom decimal import *\r\nn,a = map(int, input().split())\r\nd = Decimal(180 / n)\r\nres = Decimal(181)\r\nfor i in range(1, n-1):\r\n min = abs(Decimal(a - d*i))\r\n if min < res:\r\n res = min\r\n k = i + 2\r\nprint(\"2 1 \", k, sep = '')\r\n", "n, a = map(int, input().split())\nprint(2, 1, min(2 + max(1, (a * n + 90) // 180), n))", "inf=10**6\r\npar=[int(i) for i in str(input()).split()]\r\nn,a=par[0],par[1]\r\n\r\nangle_list=[[0,i] for i in range(n-1)]\r\nangle_list[0][0]=0\r\n\r\ninc=float(180)/float(n)\r\n\r\nfor i in range(1,n-1):\r\n angle_list[i][0]=angle_list[i-1][0]+inc\r\n\r\npointer1=0\r\npointer2=1\r\nmin_diff=inf\r\n#print(angle_list)\r\nv1=0\r\nv2=0\r\nwhile True:\r\n diff=angle_list[pointer2][0]-angle_list[pointer1][0]\r\n d=min([[min_diff,0],[abs(a-diff),1]],key=lambda x:x[0])\r\n min_diff=d[0]\r\n if d[1]==1:\r\n v1=pointer1\r\n v2=pointer2\r\n if diff==a:\r\n break\r\n if diff>a:\r\n pointer1+=1\r\n if pointer1==pointer2:\r\n pointer2+=1\r\n if diff<a:\r\n pointer2+=1\r\n if pointer2>=n-1:\r\n break\r\n#print(min_diff)\r\nprint(int(v1)+2,1,int(v2)+2)\r\n", "n, m = map(int, input().split())\r\nx = 180 / n\r\n\r\ny = int(m / x)\r\n\r\nz = y * x\r\n\r\nw = (y + 1) * x\r\n\r\nif m - z <= w - m:\r\n v = y\r\nelse:\r\n v = y + 1\r\nif v == 0:\r\n v = 1\r\nif 2 + v > n:\r\n print(2, 1, n)\r\nelse:\r\n print(2, 1, 2 + v)\r\n \r\n \r\n", "import math\r\nimport queue\r\n\r\nn, a=map(int,input().split())\r\n\r\na=n*a\r\n\r\nmin_a=abs(180-a)\r\nmin_x=1 \r\n\r\nfor i in range(2,n-1):\r\n temp=abs(180*i-a)\r\n if temp<min_a:\r\n min_a=temp\r\n min_x=i\r\n\r\nx=(n+1)-min_x\r\n\r\nprint(1,2,x)\r\n ", "#!/usr/bin/python3 -tt\n\nn, a = [int(x) for x in input().split()]\nans = 3\nfor i in range(4, n + 1):\n if abs((i - 2) * 180 / n - a) < abs((ans - 2) * 180 / n - a):\n ans = i\nprint(ans, 1, 2)\n", "n,a=map(int,input().split())\r\nll=[]\r\nalfa=(n-2)*180/n\r\nbeta=(180-alfa)/2\r\nx=beta\r\nwhile x<alfa:\r\n ll.append(x)\r\n x+=beta\r\nll.append(alfa)\r\nt=190\r\nf=0\r\nfor i in range(n-2):\r\n if abs(a-ll[i])<t:\r\n t=abs(a-ll[i])\r\n f=i\r\nprint(2,1,3+f)", "from math import ceil\nn, a = map(int, input().split())\n\nd = round(a * n / 180) + 2\nif d == 2:\n d = 3\nif d > n:\n d = n\nprint(2, 1, d)", "n,a = map(int,input().split())\r\nk = round(n * a / 180)\r\nif k == 0:\r\n\tk = 1\r\nelif k + 2 > n:\r\n\tk = n - 2\r\nprint(1,2+k,1+k)", "a = input()\r\nb = a.split(\" \")\r\nn, a = int(b[0]), int(b[1])\r\np = n * a\r\nl = list(abs(180 * (x + 1) - p) for x in range(n - 2))\r\nprint(2, 1, 2 + l.index(min(l)) + 1)\r\n", "import math\nimport decimal\n\ndef calcResult(n, a):\n\tr = 0.5/math.sin(math.pi/n)\n\tx = math.inf\n\tl = []\n\tfor i in range(3,int(n)+1):\n\t\ts1 = 1.0\n\t\ts2 = math.sqrt(2*pow(r,2) - 2*pow(r,2)*math.cos((2*math.pi/n)*(i-2)))\n\t\ts3 = math.sqrt(2*pow(r,2) - 2*pow(r,2)*math.cos((2*math.pi/n)*(i-1)))\n\t\ta1 = math.degrees(math.acos((pow(s3,2) + 1.0 - pow(s2,2))/(2*s3*1.0)))\n\t\tl.append(abs(a-a1))\n\tm = l.index(min(l))+3\n\tif m==99999:\n\t\treturn 100000\n\treturn m\n\n\nn, a = input().strip().split(' ')\nn, a = [float(n), float(a)]\nprint('2 1 ' + str(calcResult(n,a)))\n\n\n", "n,a=map(int,input().split())\r\nl=[]\r\nfor i in range(1,n-1):\r\n l.append((180*(i))/n)\r\n#print(l)\r\nx=abs(a-l[0])\r\nans=0\r\nfor i in range(len(l)):\r\n if abs(l[i]-a)<x:\r\n x=abs(l[i]-a)\r\n ans=i\r\nprint(2,1,2+ans+1)\r\n ", "n, a = map(int, input().split())\r\nq = 180 / n\r\nnum = float('inf')\r\nans = -1\r\nfor i in range(1, n - 1):\r\n if num > abs(a - q * i):\r\n num = a - q * i\r\n ans = i\r\n\r\nprint('2 1 {}'.format(ans + 2))", "n, a = map(int, input().split())\n\nimport decimal\nangulo_pequeno = decimal.Decimal(180)/n\n\nangulos_posibles = []\n\nfor i in range(n-2):\n angulos_posibles.append(angulo_pequeno*(i+1))\nangulos_posibles.reverse()\n\nmas_cerca = 0\nfor i in range(len(angulos_posibles)):\n if abs(a-angulos_posibles[mas_cerca])>abs(a-angulos_posibles[i]):\n mas_cerca = i\n\n\nprint(\"1 2\", mas_cerca+3)\n\t \t\t \t \t \t \t \t\t\t\t", "n, a = map(int, input().split())\r\nans = opt = 400\r\nfor i in range(3, n + 1):\r\n cur = abs(180 * (n - i + 1) - a * n)\r\n if cur < opt: ans, opt = i, cur\r\nprint(1, 2, ans)", "n, a = map(int, input().split())\r\nprint(min(n-1, max(round(a*n/180) + 1, 2)), n, 1)\r\n", "n,a=map(int,input().split())\r\nangle=180*(n-2)/n/(n-2)\r\nMax,Ma=0,180\r\nfor i in range(n-2):\r\n if abs(a-angle*(i+1))<Ma:\r\n Max,Ma=i+1,abs(a-angle*(i+1))\r\nprint(2,1,2+Max)", "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\nn,a = map(int,input().split())\r\n\r\nzs = (n-2)*180\r\nmds = zs/n\r\nans = 3\r\np = float(\"inf\")\r\nfor i in range(3,n+1):\r\n k = 180/n*(n-i+1)\r\n if abs(k-a)<p:\r\n p = abs(k-a)\r\n ans = i\r\nprint(1,2,ans)", "numList=input().split(\" \")\r\nn=int(numList[0])\r\na=int(numList[1])\r\nunitAngle=(180-(360/n))/(n-2)\r\nif n==3:\r\n\tprint(\"1 2 3\")\r\nelse:\r\n\tminAngle=360\r\n\tiResult=2\r\n\tvertice=2\r\n\twhile vertice<n:\r\n\t\tvertice+=1\r\n\t\tiTime=(n-2)-(vertice-3)\r\n\t\tiAngle=abs(unitAngle*iTime-a)\r\n\t\tif iAngle<minAngle:\r\n\t\t\tminAngle=iAngle\r\n\t\t\tiResult=vertice\r\n\tprint(\"1 2\",iResult)" ]

[ "'''\n Python3(PyPy3) Template for Programming-Contest.\n'''\n\nimport sys\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\nDXY = [(0, -1), (1, 0), (0, 1), (-1, 0)] # LDRU\nmod = 998244353\ninf = 1 << 64\n\n\ndef main():\n S = int(input())\n a, b, c = map(int, input().split())\n #Do math at other places :(\n if a == b == c == 0:\n print(S, 0, 0)\n else:\n print(a * S / (a + b + c), b * S / (a + b + c), c * S / (a + b + c))\n\n return 0\n\n\nif __name__ == \"__main__\":\n main()\n", "s = float(input())\r\na, b, c = map(float, input().split())\r\nif (a == b and b == c and c == 0):\r\n print('0 0 ')\r\n print(s)\r\nelse:\r\n print(a * s / (a + b + c), end = \" \")\r\n print(b * s / (a + b + c), end = \" \")\r\n print(c * s / (a + b + c), end = \" \")", "S = int(input())\nv = [int(x) for x in input().strip().split()]\nzeroes = v.count(0)\ntotal = sum(v)\nans = []\nif zeroes == 0:\n ans = [S * v[i] / total for i in range(3)]\nelif zeroes == 1:\n for i in range(3):\n if v[i] == 0:\n total -= v[i]\n for i in range(3):\n if v[i] != 0:\n ans.append(S * v[i] / total)\n else:\n ans.append(0)\nelse:\n # 2 or more\n for i in range(3):\n if v[i] == 0:\n ans.append(0)\n else:\n ans.append(S)\nprint(*ans)\n", "s=int(input()) \r\na, b, c = map(int, input().split())\r\nif a + b + c == 0:\r\n print(s, '0 0')\r\nelse:\r\n a_ratio = a * s / (a + b + c)\r\n b_ratio = b * s / (a + b + c)\r\n c_ratio = c * s / (a + b + c)\r\n print(f\"{a_ratio} {b_ratio} {c_ratio}\")# 1691320289.520811", "n = int(input())\r\na, b, c = map(int, input().split())\r\nif a == b == c == 0:\r\n print(0, 0, 0)\r\nelse:\r\n print((a * n) / (a+b+c), (b*n)/(a+b+c), (c * n) / (a+b+c))", "def count(x1, y1, z1, x2, y2, z2):\r\n if x2 == 0 and a != 0 or y2 == 0 and b != 0 or z2 == 0 and c != 0:\r\n return False\r\n if x2 == 0:\r\n x2 = 1\r\n if y2 == 0:\r\n y2 = 1\r\n if z2 == 0:\r\n z2 = 1\r\n return (x1 / x2) ** a * (y1 / y2) ** b * (z1 / z2) ** c < 1\r\n\r\n\r\nn = int(input())\r\na, b, c = map(int, input().split())\r\nl1, r1 = 0, n\r\nfor i in range(200):\r\n x1 = l1 + (r1 - l1) / 3\r\n l2, r2 = 0, n - x1\r\n for j in range(200):\r\n y1 = l2 + (r2 - l2) / 3\r\n y2 = r2 - (r2 - l2) / 3\r\n if count(x1, y1, n - x1 - y1, x1, y2, n - x1 - y2):\r\n l2 = y1\r\n else:\r\n r2 = y2\r\n y11 = l2\r\n x2 = r1 - (r1 - l1) / 3\r\n l2, r2 = 0, n - x2\r\n for j in range(200):\r\n y1 = l2 + (r2 - l2) / 3\r\n y2 = r2 - (r2 - l2) / 3\r\n if count(x2, y1, n - x2 - y1, x2, y2, n - x2 - y2):\r\n l2 = y1\r\n else:\r\n r2 = y2\r\n y22 = l2\r\n if count(x1, y11, n - x1 - y11, x2, y22, n - x2 - y22):\r\n l1 = x1\r\n p = y11\r\n else:\r\n r1 = x2\r\n p = y22\r\nprint(l1, p, n - l1 - p)\r\n", "a=int(input())\n\nb=list(map(int,input().split()))\n\nif sum(b)==0:print(' '.join([str(a/3)]*3))\n\nelse:print(' '.join(map(str,map(lambda x:a*x/sum(b),b))))\n\n\n\n\n\n# Made By Mostafa_Khaled", "from math import *\r\ndef f1(x,y,a,b,c,s):\r\n d = 1 if x==0 else log10(x)*a\r\n e = 1 if y==0 else log10(y)*b\r\n f = 1 if s-x-y==0 else log10(s-x-y)*c\r\n return d+e+f\r\ndef f2(x,a,b,c,s):\r\n l,r=0,s-x\r\n while r-l>10**-10:\r\n m1,m2=l+(r-l)/3,r-(r-l)/3\r\n if f1(x,m1,a,b,c,s)>f1(x,m2,a,b,c,s):\r\n r=m2\r\n else:\r\n l=m1\r\n return r\r\ndef f3(a,b,c,s):\r\n l,r=0,s\r\n while r-l>10**-10:\r\n m1,m2=l+(r-l)/3,r-(r-l)/3\r\n if f1(m1,f2(m1,a,b,c,s),a,b,c,s)>f1(m2,f2(m2,a,b,c,s),a,b,c,s):\r\n r=m2\r\n else:\r\n l=m1\r\n return r\r\ns=float(input())\r\na,b,c=list(map(int,input().split()))\r\nprint(\"%.10f %.10f %.10f\"%(f3(a,b,c,s),f2(f3(a,b,c,s),a,b,c,s),s-f3(a,b,c,s)-f2(f3(a,b,c,s),a,b,c,s)))", "s = int(input())\r\na, b, c = map(int, input().split())\r\nif a == 0 and b == 0 and c == 0:\r\n print(0, 0, 0)\r\nelse:\r\n x = 1.0*a*s/(a+b+c)\r\n y = 1.0*b*s/(a+b+c)\r\n z = 1.0*c*s/(a+b+c)\r\n print(x, y, z)" ]

[ "field = [[\"\"]*9 for i in range(9)]\r\nz = 0\r\nfor i in range(3):\r\n temp2 = input()\r\n for z2 in range(len(temp2)):\r\n if temp2[z2] != \" \":\r\n field[i][z] = temp2[z2]\r\n z+= 1\r\n z = 0\r\ninput()\r\nfor i in range(3,6):\r\n temp2 = input()\r\n for z2 in range(len(temp2)):\r\n if temp2[z2] != \" \":\r\n field[i][z] = temp2[z2]\r\n z+= 1\r\n z = 0\r\ninput()\r\nfor i in range(6,9):\r\n temp2 = input()\r\n for z2 in range(len(temp2)):\r\n if temp2[z2] != \" \":\r\n field[i][z] = temp2[z2]\r\n z+= 1\r\n z = 0\r\nx, y = map(int,input().split())\r\nx2 = ((y-1) % 3) * 3\r\ny2 = ((x-1) % 3) * 3\r\ntemp = 0\r\nfor i in range(3):\r\n for j in range(3):\r\n if field[y2+i][x2+j] == \".\":\r\n field[y2+i][x2+j] = \"!\"\r\n temp += 1\r\nif temp == 0:\r\n for i in range(9):\r\n for j in range(9):\r\n if field[i][j] == \".\":\r\n field[i][j] = \"!\"\r\nfor i in range(9):\r\n for j in range(9):\r\n if j % 3 == 0 and j != 0:\r\n print(\"\",end=\" \")\r\n print(field[i][j],end=\"\")\r\n if i % 3 == 2 and i != 8:\r\n print()\r\n print()\r\n", "table = []\r\n\r\nfields = []\r\nfield1, field2, field3 = [], [], []\r\nfor row in range(11):\r\n if row != 3 and row != 7:\r\n nexus = [i for i in input() if i != ' ']\r\n table.append(nexus)\r\n field1.append(nexus[:3])\r\n field2.append(nexus[3:6])\r\n field3.append(nexus[6:9])\r\n elif row == 3 or row == 7:\r\n input()\r\n fields.extend([field1, field2, field3])\r\n field1, field2, field3 = [], [], []\r\nfields.extend([field1, field2, field3])\r\n\r\n# print(*fields, sep='\\n')\r\n\r\nx_y = [int(i) - 1 for i in input().split()]\r\n\r\n# print(*table, sep='\\n')\r\n\r\npositions = []\r\nfor row in range(3):\r\n for column in range(3):\r\n coord = []\r\n for next_column in range(0, 7, 3):\r\n col = column + next_column\r\n r = row\r\n for next_row in range(0, 7, 3):\r\n coord.append([r + next_row, col])\r\n positions.append(coord)\r\n\r\n# print(*positions, sep='\\n')\r\n\r\nfor order_num, candidate in enumerate(positions):\r\n # print(x_y)\r\n if x_y in candidate:\r\n flag = 0\r\n for row in fields[order_num]:\r\n for ind in range(3):\r\n if row[ind] == '.':\r\n row[ind] = '!'\r\n flag = 1\r\n if flag == 0:\r\n for string in fields:\r\n for row in string:\r\n for ind in range(3):\r\n row[ind] = '!' if row[ind] == '.' else row[ind]\r\n\r\n# print(*fields, sep='\\n')\r\n\r\nfor row in range(0, 7, 3):\r\n for column in range(3):\r\n for r in range(row, row + 3):\r\n # print(r, column)\r\n print(*fields[r][column], sep='', end=' ')\r\n print()\r\n print()\r\n", "lst = []\r\n\r\nfor x in range(3):\r\n x = input().split()\r\n lst.append(x)\r\ns1 = input()\r\n\r\nfor x in range(3):\r\n x = input().split()\r\n lst.append(x)\r\ns2 = input()\r\n\r\nfor x in range(3):\r\n x = input().split()\r\n lst.append(x)\r\n\r\n(i, j) = map(int, input().split())\r\n\r\ni = i % 3\r\nj = j % 3\r\n\r\nif i > 0:\r\n i -= 1\r\nelse:\r\n i += 2\r\n\r\nif j > 0:\r\n j -= 1\r\nelse:\r\n j += 2\r\n \r\narray = []\r\nfor x in range(9):\r\n array.append([0] * 9)\r\n\r\nflag = False \r\nfor x in range(i * 3, (i + 1) * 3):\r\n for y in range(j, j + 1):\r\n for z in range(len(lst[x][y])):\r\n if lst[x][y][z] == '.':\r\n array[x][j * 3 + z] = '!'\r\n flag = True\r\n\r\nif not flag:\r\n for x in range(9):\r\n for y in range(3):\r\n for z in range(len(lst[x][y])):\r\n if lst[x][y][z] != '.':\r\n array[x][y * 3 + z] = lst[x][y][z]\r\n else:\r\n array[x][y * 3 + z] = '!'\r\nelse:\r\n for x in range(9):\r\n for y in range(3):\r\n for z in range(len(lst[x][y])):\r\n if array[x][y * 3 + z] != '!':\r\n array[x][y * 3 + z] = lst[x][y][z]\r\nK = 0 \r\nfor x in array:\r\n k = 0\r\n for y in x:\r\n print(y, end='')\r\n k += 1\r\n if k % 3 == 0:\r\n print(end=' ')\r\n print()\r\n K += 1\r\n if K % 3 == 0:\r\n print()\r\n", "m = []\r\n\r\nfor i in range(11):\r\n if (i == 3 or i == 7):\r\n s = input()\r\n else:\r\n s = input()\r\n s = s.replace(' ', '')\r\n s = list(s)\r\n m.append(s)\r\n\r\nx, y = map(int, input().split())\r\n\r\nxm = int(not(x % 3))\r\nym = int(not(y % 3))\r\n\r\n\r\nxs = x - ((x // 3 - xm) * 3) - 1\r\nys = y - ((y // 3 - ym) * 3) - 1\r\n\r\nxs, ys = ys, xs\r\n\r\nif (xs == 0 and ys == 0):\r\n xs = 0\r\n ys = 0\r\nelif (xs == 0 and ys == 1):\r\n xs = 0\r\n ys = 3\r\nelif (xs == 0 and ys == 2):\r\n xs = 0\r\n ys = 6\r\nelif (xs == 1 and ys == 0):\r\n xs = 3\r\n ys = 0\r\nelif (xs == 1 and ys == 1):\r\n xs = 3\r\n ys = 3\r\nelif (xs == 1 and ys == 2):\r\n xs = 3\r\n ys = 6\r\nelif (xs == 2 and ys == 0):\r\n xs = 6\r\n ys = 0\r\nelif (xs == 2 and ys == 1):\r\n xs = 6\r\n ys = 3\r\nelif (xs == 2 and ys == 2):\r\n xs = 6\r\n ys = 6\r\n\r\ncnt = 0\r\n\r\nfor i in range(ys, ys + 3):\r\n for j in range(xs, xs + 3):\r\n if (m[i][j] == '.'):\r\n cnt += 1\r\n\r\nif (cnt == 0):\r\n for i in range(9):\r\n for j in range(9):\r\n if (m[i][j] == '.'):\r\n m[i][j] = '!'\r\nelse:\r\n for i in range(9):\r\n for j in range(9):\r\n if (xs <= j < xs + 3 and ys <= i < ys + 3 and m[i][j] == '.'):\r\n m[i][j] = '!'\r\n\r\nfor i in range(9):\r\n m[i] = m[i][:3] + [' '] + m[i][3:6] + [' '] + m[i][6:]\r\n\r\nfor i in range(0, 9, 3):\r\n print(''.join(map(str, m[i])))\r\n print(''.join(map(str, m[i + 1])))\r\n print(''.join(map(str, m[i + 2])))\r\n print()\r\n \r\n", "mat = [[[['', '', ''], ['', '', ''], ['', '', '']] for j in range(3)] for i in range(3)]\r\n\r\nfor Y in range(3):\r\n for y in range(3):\r\n s = input().split()\r\n if len(s) == 0:\r\n s = input().split()\r\n for X in range(3):\r\n for x in range(3):\r\n mat[Y][X][y][x] = s[X][x]\r\ny, x = map(int, input().split())\r\ny -= 1\r\nx -= 1\r\nY = y // 3\r\ny %= 3\r\nX = x // 3\r\nx %= 3\r\nflag = 0\r\nfor x1 in range(3):\r\n for y1 in range(3):\r\n if mat[y][x][y1][x1] != 'o' and mat[y][x][y1][x1] != 'x':\r\n flag = 1\r\n mat[y][x][y1][x1] = '!'\r\nif (flag == 0):\r\n for a in range(3):\r\n for b in range(3):\r\n for c in range(3):\r\n for d in range(3):\r\n if mat[a][b][c][d] != 'o' and mat[a][b][c][d] != 'x':\r\n mat[a][b][c][d] = '!' \r\nfor Y in range(3):\r\n for y in range(3):\r\n for X in range(3):\r\n for x in range(3):\r\n print(mat[Y][X][y][x], end='')\r\n print(' ', end='')\r\n print()\r\n print()\r\n ", "a=[]\r\nfor j in range(11):\r\n b=input().split()\r\n if b==[]: continue\r\n else: a.append([i for i in b[0]+b[1]+b[2]])\r\nx,y=[int(i) for i in input().split()]\r\nchk=[2,0,1]\r\nx=chk[x%3]\r\ny=chk[y%3]\r\ncnt=0\r\nfor i in range(x*3,x*3+3):\r\n for j in range(y*3,y*3+3):\r\n if a[i][j]=='.':\r\n a[i][j]='!'\r\n cnt=1\r\nif cnt==0:\r\n for i in range(9):\r\n for j in range(9):\r\n if a[i][j]=='.': \r\n a[i][j]='!'\r\nfor i in range(9):\r\n if i!=0 and i%3==0: print()\r\n for j in range(3):\r\n print(''.join(a[i][j*3:j*3+3]),end=\" \")\r\n print()\r\n \r\n \r\n ", "m = list(filter(lambda x: x, [list(filter(lambda x: x != ' ', input())) for _ in range(11)]))\r\n\r\n\r\ndef write():\r\n for e1 in range(9):\r\n if e1 % 3 == 0 and e1 != 0:\r\n print()\r\n\r\n for e2, j in enumerate(m[e1]):\r\n print(j, end='')\r\n if (e2 + 1) % 3 == 0:\r\n print(end=' ')\r\n print()\r\n\r\n\r\ny, x = map(int, input().split())\r\n\r\nmx, my = (x - 1) % 3, (y - 1) % 3\r\n\r\n\r\nfx, fy = mx * 3, my * 3\r\ntx, ty = (mx + 1) * 3, (my + 1) * 3\r\n\r\nr = 0\r\nfor i in range(fx, tx):\r\n for j in range(fy, ty):\r\n if m[j][i] == '.':\r\n m[j][i] = '!'\r\n r += 1\r\n\r\nif r:\r\n write()\r\n exit(0)\r\n\r\nfor i in range(9):\r\n for j in range(9):\r\n if m[j][i] == '.':\r\n m[j][i] = '!'\r\n r += 1\r\n\r\nwrite()", "k=[]\r\nfor i in range(11):\r\n a=input()\r\n if i!=3 and i!=7:\r\n k.append(a[0]+a[1]+a[2]+a[4]+a[5]+a[6]+a[8]+a[9]+a[10]+' ')\r\na,b=map(int,input().split())\r\na-=1\r\nb-=1\r\nx=a%3\r\ny=b%3\r\nr=1\r\nfor i in range(3):\r\n s=k[x*3+i]\r\n for j in range(3):\r\n if s[y*3+j]=='.':\r\n s=s[:y*3+j]+\"!\"+s[y*3+j+1:]\r\n r=0\r\n k[x*3+i]=s\r\nif r==1:\r\n for i in range(9):\r\n s=k[i]\r\n for j in range(9):\r\n if s[j]=='.':\r\n s=s[:j]+\"!\"+s[j+1:]\r\n k[i]=s\r\nfor i in range(9):\r\n for j in range(9):\r\n print(k[i][j],end='')\r\n if j==2 or j==5:\r\n print(' ',end='')\r\n print('')\r\n if i==2 or i==5:\r\n print('')\r\n", "lines = []\r\nfor i in range(11):\r\n lines.append(input())\r\ncoords = list(map(int, input().split()))\r\nsqy = (coords[0] - 1) % 3\r\nsqx = (coords[1] - 1) % 3\r\nstartchange = False\r\nsqstart = {0: 0, 1: 4, 2: 8}\r\nchangesyms = {'x': 'x', 'o': 'o', '.': '!', ' ': ' ', '\\n': '\\n'}\r\nfree = 0\r\ntoprint = ''\r\ntoprint2 = ''\r\nfor i in range(11):\r\n for i1 in range(len(lines[i])):\r\n if i in range(sqstart[sqy], sqstart[sqy] + 3) and i1 in range(sqstart[sqx], sqstart[sqx] + 3):\r\n startchange = True\r\n else:\r\n startchange = False\r\n if startchange:\r\n toprint += changesyms[lines[i][i1]]\r\n if changesyms[lines[i][i1]] != lines[i][i1]:\r\n free += 1\r\n else:\r\n toprint += lines[i][i1]\r\nif free == 0:\r\n startchange = True\r\nelse:\r\n startchange = False\r\nsyms = 0\r\nfor i in toprint:\r\n if startchange:\r\n toprint2 += changesyms[i]\r\n if i not in changesyms:\r\n toprint2 += i\r\n else:\r\n toprint2 += i\r\n syms += 1\r\n if syms % 11 == 0 and syms != 99:\r\n toprint2 += '\\n'\r\n if syms % 33 == 0 and syms != 99:\r\n toprint2 += '\\n'\r\nprint(toprint2)\r\n \r\n \r\n \r\n \r\n", "field = []\r\nfor i in range(3):\r\n for j in range(3):\r\n line = input().split()\r\n field.append(''.join(line))\r\n a = list(map(int, input().split()))\r\n\r\na, b = a[0], a[1]\r\nc, d = a%3 + (3*(a%3==0)), b%3 + (3*(b%3==0))\r\n#print(a, b, c, d)\r\nisfree = 0\r\nfor i in range(3*(c-1), 3*c):\r\n for j in range(3*(d-1), 3*d):\r\n if field[i][j] == '.':\r\n isfree += 1\r\n\r\nif not isfree:\r\n #print(isfree)\r\n for i in range(9):\r\n for j in range(9):\r\n if field[i][j] == '.':\r\n field[i] = field[i][:j] + '!' + field[i][j+1:]\r\nelse:\r\n for i in range(3*(c-1), 3*c):\r\n for j in range(3*(d-1), 3*d):\r\n if field[i][j] == '.':\r\n field[i] = field[i][:j] + '!' + field[i][j+1:]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(field[3*i+j][:3], field[3*i+j][3:6], field[3*i+j][6:9])\r\n print()\r\n", "\r\nfield = [None]*3\r\n\r\nfor i in range(3):\r\n if i != 0: \r\n input() # empty\r\n field[i] = line = []\r\n for j in range(3):\r\n line.append(input().replace(' ', ''))\r\nx, y = map(lambda x: (int(x)-1)%3, input().split(' '))\r\n\r\n\r\n#for i in field: print(i)\r\n#print('done')\r\n\r\nfree = False\r\nfor i in range(3):\r\n if free: break\r\n for j in range(3):\r\n if field[x][i][y*3+j] == '.':\r\n free = True\r\n break\r\n\r\nif free:\r\n p = y*3\r\n for i in range(3):\r\n field[x][i] = field[x][i][:p] + field[x][i][p:p+3].replace('.', '!') + field[x][i][p+3:]\r\nelse:\r\n for line in field:\r\n for i in range(3):\r\n line[i] = line[i].replace('.', '!')\r\n\r\nj = 0\r\nfor line in field:\r\n if j == 0: j = 1\r\n else: print()\r\n for i in range(3):\r\n s = line[i]\r\n s = s[:3] + ' ' + s[3:6] + ' ' + s[6:]\r\n print(s)\r\n\r\n\r\n'''\r\n.!. ... ...\r\n... ... .z.\r\n... ... ...\r\n\r\n... ... ...\r\n... ... ...\r\n... x.. ...\r\n\r\n..x ... .e.\r\n.x. .s. .f.\r\nx.. ... .c.\r\n6 4\r\n\r\n'''\r\n", "l=[input() for _ in range(11)]\r\nx,y=map(int, input().split())\r\nx-=1\r\nx+=x//3\r\ny-=1\r\ny+=y//3\r\na,b=x%4*4,y%4*4\r\nf=0\r\nfor i in range(a,a+3):\r\n s=l[i][b:b+3]\r\n if '.' in s:\r\n l[i],f=l[i][:b]+s.replace('.','!')+l[i][b+3:],1\r\nfor s in l:\r\n print(s if f else s.replace('.','!'))\r\n", "A11, A21, A31 = input().split()\r\nA12, A22, A32 = input().split()\r\nA13, A23, A33 = input().split()\r\nA = input()\r\nA41, A51, A61 = input().split()\r\nA42, A52, A62 = input().split()\r\nA43, A53, A63 = input().split()\r\nA = input()\r\nA71, A81, A91 = input().split()\r\nA72, A82, A92 = input().split()\r\nA73, A83, A93 = input().split()\r\nA1 = A11 + A12 + A13\r\nA2 = A21 + A22 + A23\r\nA3 = A31 + A32 + A33\r\nA4 = A41 + A42 + A43\r\nA5 = A51 + A52 + A53\r\nA6 = A61 + A62 + A63\r\nA7 = A71 + A72 + A73\r\nA8 = A81 + A82 + A83\r\nA9 = A91 + A92 + A93\r\nAA = [A1, A2, A3, A4, A5, A6, A7, A8, A9]\r\nx, y = map(int, input().split())\r\nif 0 < x < 4:\r\n A = [1, 2, 3]\r\nelif 3 < x < 7:\r\n A = [4, 5, 6]\r\nelif 6 < x < 10:\r\n A = [7, 8, 9]\r\n\r\nif 0 < y < 4:\r\n B = [1, 4, 7]\r\nelif 3 < y < 7:\r\n B = [2, 5, 8]\r\nelif 6 < y < 10:\r\n B = [3, 6, 9]\r\n\r\nfor i in A:\r\n if i in B:\r\n C = i\r\n#print(C)\r\nif C == 2:\r\n x -= 0\r\n y -= 3\r\nif C == 3:\r\n x -= 0\r\n y -= 6\r\nif C == 4:\r\n x -= 3\r\n y -= 0\r\nif C == 5:\r\n x -= 3\r\n y -= 3\r\nif C == 6:\r\n x -= 3\r\n y -= 6\r\nif C == 7:\r\n x -= 6\r\n y -= 0\r\nif C == 8:\r\n x -= 6\r\n y -= 3\r\nif C == 9:\r\n x -= 6\r\n y -= 6\r\n#print(x, y)\r\nif x == 1:\r\n A = [1, 2, 3]\r\nelif x == 2:\r\n A = [4, 5, 6]\r\nelif x == 3:\r\n A = [7, 8, 9]\r\n\r\nif y == 1:\r\n B = [1, 4, 7]\r\nelif y == 2:\r\n B = [2, 5, 8]\r\nelif y == 3:\r\n B = [3, 6, 9]\r\nfor i in A:\r\n if i in B:\r\n C1 = i\r\n#print(C1)\r\nk = 0\r\nV = ['!']\r\nfor i in range(len(AA[C1 - 1])):\r\n if AA[C1 - 1][i] == '.':\r\n k += 1\r\n AA[C1 - 1] = AA[C1 - 1][:i] + '!' + AA[C1 - 1][i+1 :]\r\n\r\nif k == 0:\r\n for i in range(0, 9):\r\n for j in range(len(AA[i])):\r\n if AA[i][j] == '.':\r\n AA[i] = AA[i][:j] + '!' + AA[i][j+1:]\r\n\r\nprint(''.join(map(str, AA[0][0:3])), ''.join(map(str, AA[1][0:3])), ''.join(map(str, AA[2][0:3])))\r\nprint(''.join(map(str, AA[0][3:6])), ''.join(map(str, AA[1][3:6])), ''.join(map(str, AA[2][3:6])))\r\nprint(''.join(map(str, AA[0][6:])), ''.join(map(str, AA[1][6:])), ''.join(map(str, AA[2][6:])))\r\nprint('')\r\nprint(''.join(map(str, AA[3][0:3])), ''.join(map(str, AA[4][0:3])), ''.join(map(str, AA[5][0:3])))\r\nprint(''.join(map(str, AA[3][3:6])), ''.join(map(str, AA[4][3:6])), ''.join(map(str, AA[5][3:6])))\r\nprint(''.join(map(str, AA[3][6:])), ''.join(map(str, AA[4][6:])), ''.join(map(str, AA[5][6:])))\r\nprint('')\r\nprint(''.join(map(str, AA[6][0:3])), ''.join(map(str, AA[7][0:3])), ''.join(map(str, AA[8][0:3])))\r\nprint(''.join(map(str, AA[6][3:6])), ''.join(map(str, AA[7][3:6])), ''.join(map(str, AA[8][3:6])))\r\nprint(''.join(map(str, AA[6][6:])), ''.join(map(str, AA[7][6:])), ''.join(map(str, AA[8][6:])))", "a=[None]*11\r\nfor i in range(11):\r\n\ta[i]=list(input())\r\nx,y=map(int,input().split())\r\n\r\nx=(3 if x%3==0 else x%3)*4-3\r\ny=(3 if y%3==0 else y%3)*4-3\r\nrow_1=a[x-1][y-1:y+2]\r\nrow_2=a[x][y-1:y+2]\r\nrow_3=a[x+1][y-1:y+2]\r\nif '.' in row_1+row_2+row_3:\r\n\ta[x-1][y-1:y+2]=''.join(row_1).replace('.','!')\r\n\ta[x][y-1:y+2]=''.join(row_2).replace('.','!')\r\n\ta[x+1][y-1:y+2]=''.join(row_3).replace('.','!')\r\n\tfor i in range(11):\r\n\t\ta[i]=''.join(a[i])\r\nelse:\r\n\tfor i in range(11):\r\n\t\ta[i]=''.join(a[i]).replace('.','!')\r\nprint('\\n'.join(a))", "field = []\nfor _ in range(3):\n row = list(input().replace(' ', ''))\n field.append(row)\ninput()\nfor _ in range(3):\n row = list(input().replace(' ', ''))\n field.append(row)\ninput()\nfor _ in range(3):\n row = list(input().replace(' ', ''))\n field.append(row)\nx, y = list(map(int, input().split()))\nx -= 1\ny -= 1\nrow = x%3\ncolumn = y%3\nis_full = True\nfor i in range(row*3, row*3+3):\n for j in range(column*3, column*3+3):\n if field[i][j] == '.':\n field[i][j] = '!'\n is_full = False\nif is_full:\n for i in range(0, 9):\n for j in range(0, 9):\n if field[i][j] == '.':\n field[i][j] = '!'\nfor i in range(0, 9):\n for j in range(0, 9):\n print(field[i][j], end='')\n if (j == 2) or (j == 5):\n print(' ', end='')\n print(' ')\n if (i == 2) or (i == 5):\n print(' ')\n", "arr= [[] for i in range(9)]\r\nfor i in range(3):\r\n for j in range(3):\r\n l = input().split()\r\n for k in range(3):\r\n temp = l[k]\r\n temp = list(temp)\r\n arr[i*3 + k].append(temp)\r\n if (i<2):\r\n l = input()\r\n[r, c] = list(map(int, input().split()))\r\n\r\n\r\n\r\n# for x in arr:\r\n# print(x)\r\n \r\n \r\nr -= 1\r\nc -= 1\r\nr = r% 3\r\nc = c% 3\r\ntemp = arr[r*3 + c]\r\nb = True\r\nfor i in range(3):\r\n for j in range(3):\r\n if temp[i][j] == '.':\r\n temp[i][j] = '!'\r\n b = False\r\nif b:\r\n for k in range(9):\r\n temp = arr[k]\r\n for i in range(3):\r\n for j in range(3):\r\n if temp[i][j] == '.':\r\n temp[i][j] = '!'\r\n\r\n# for x in arr:\r\n# print(x)\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(3):\r\n temp = arr[i*3 +k][j]\r\n s = \"\"\r\n for c in temp:\r\n s+=c\r\n print(s, end = \" \")\r\n print()\r\n print()\r\n \r\n ", "def prnt(p):\r\n for i in p:\r\n for i3 in range(3):\r\n for i2 in i:\r\n for i4 in i2[i3]:\r\n print(i4, end=\"\")\r\n print(\" \", end=\"\")\r\n print()\r\n print()\r\n\r\n\r\np = []\r\nfor y1 in range(3):\r\n p.append([[], [], []])\r\n for y2 in range(3):\r\n s = input()\r\n if not s:\r\n s = input()\r\n s = s.split()\r\n for i in range(3):\r\n p[y1][i].append(list(s[i]))\r\n\r\ncrds = list(map(int, input().split()))\r\ncrds[0] -= 1\r\ncrds[1] -= 1\r\n\r\nx1 = crds[0]//3\r\ny1 = crds[1]//3\r\ny2 = crds[0]%3\r\nx2 = crds[1]%3\r\n\r\nhave_space = False\r\nfor i in p[y2][x2]:\r\n for i2 in i:\r\n if i2 == \".\":\r\n have_space = True\r\n break\r\n\r\nif have_space:\r\n for i in range(len(p[y2][x2])):\r\n for i2 in range(len(p[y2][x2][i])):\r\n if p[y2][x2][i][i2] == \".\":\r\n p[y2][x2][i][i2] = \"!\"\r\nelse:\r\n for i1 in range(3):\r\n for i2 in range(3):\r\n for i3 in range(3):\r\n for i4 in range(3):\r\n if p[i1][i2][i3][i4] == \".\":\r\n p[i1][i2][i3][i4] = \"!\"\r\n\r\nprnt(p)\r\n", "f = []\r\n\r\nfor i in range(11):\r\n t = list(input().split())\r\n s = \"\"\r\n for j in t:\r\n s += j\r\n f.append(s)\r\n\r\ndel f[7]\r\ndel f[3]\r\n\r\nx, y = map(int, input().split())\r\n\r\nx = (x - 1) % 3\r\ny = (y - 1) % 3\r\n\r\nvr = 0\r\nfor i in range(x * 3, (x + 1) * 3):\r\n for j in range(y * 3, (y + 1) * 3):\r\n if f[i][j] != '.':\r\n vr += 1\r\n else:\r\n a = list(f[i])\r\n a[j] = '!'\r\n f[i] = \"\".join(a)\r\n\r\nif (vr == 9):\r\n for i in range(9):\r\n a = list(f[i])\r\n for j in range(len(a)):\r\n if a[j] == '.':\r\n a[j] = '!'\r\n f[i] = \"\".join(a)\r\n \r\n print(f[i][:3] + \" \" + f[i][3:6] + \" \" + f[i][6:]) \r\n if (i + 1) % 3 == 0:\r\n print()\r\nelse:\r\n for i in range(9):\r\n print(f[i][:3] + \" \" + f[i][3:6] + \" \" + f[i][6:]) \r\n if (i + 1) % 3 == 0:\r\n print()\r\n", "field = [\r\n [[0] * 3, [0] * 3, [0] * 3],\r\n [[0] * 3, [0] * 3, [0] * 3],\r\n [[0] * 3, [0] * 3, [0] * 3]\r\n]\r\nfor i in range(3):\r\n for j in range(3):\r\n for k, line in enumerate(input().split()):\r\n field[i][k][j] = list(line)\r\n if i != 2:\r\n input()\r\nx, y = map(lambda x: (int(x) - 1) % 3, input().split())\r\nanywhere = True\r\nfor i in range(3):\r\n for j in range(3):\r\n if field[x][y][i][j] == '.':\r\n field[x][y][i][j] = '!'\r\n anywhere = False\r\nfor i1 in range(3):\r\n for i in range(3):\r\n for j1 in range(3):\r\n for j in range(3):\r\n if field[i1][j1][i][j] == '.' and anywhere:\r\n print('!', end='')\r\n else:\r\n print(field[i1][j1][i][j], end='')\r\n print(' ', end='')\r\n print()\r\n print()\r\n", "def is_full(board, x, y):\n for a in range(3):\n for b in range(3):\n if board[x * 3 + a][y * 3 + b] not in [\"o\", \"x\"]:\n return False\n return True\n\n\ndef fill_board(board, exclude, x, y):\n if exclude:\n for a in range(9):\n for b in range(9):\n if not ((x * 3 <= a <= x * 3 + 2) and (y * 3 <= b <= y * 3 + 2)):\n if board[a][b] not in [\"o\", \"x\"]:\n board[a][b] = \"!\"\n else:\n for a in range(3):\n for b in range(3):\n if board[x * 3 + a][y * 3 + b] not in [\"o\", \"x\"]:\n board[x * 3 + a][y * 3 + b] = \"!\"\n\n\nclass CodeforcesTask907BSolution:\n def __init__(self):\n self.result = ''\n self.board = []\n self.last_move = []\n\n def read_input(self):\n for x in range(11):\n in_ = input()\n if in_:\n self.board.append(list(in_.replace(\" \", \"\")))\n self.last_move = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n fill_board(self.board, is_full(self.board, *[(x - 1) % 3 for x in self.last_move]),\n *[(x - 1) % 3 for x in self.last_move])\n out_board = [\" \".join([\"\".join(x) for x in [row[:3], row[3:6], row[6:]]]) for row in self.board]\n out_board = out_board[:3] + [\"\"] + out_board[3:6] + [\"\"] + out_board[6:]\n self.result = \"\\n\".join(out_board)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask907BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "def check(a,b):\n\tglobal l\n\tstartX = 3*a\n\tstartY = 3*b\n\tfor i in range(3):\n\t\tfor j in range(3):\n\t\t\tif(l[startX+i][startY+j] == '.'):\n\t\t\t\treturn True\n\treturn False\n\ndef c1(a,b):\n\tglobal l\n\tstartX = 3*a\n\tstartY = 3*b\n\tfor i in range(3):\n\t\tfor j in range(3):\n\t\t\tif(l[startX+i][startY+j] == '.'):\n\t\t\t\tl[startX+i] = l[startX+i][:startY+j]+\"!\"+l[startX+i][startY+j+1:]\n\ndef c2(a,b):\n\tglobal l\n\tfor i in range(9):\n\t\tfor j in range(9):\n\t\t\tif((i//3!=a or j//3 !=b) and l[i][j] == '.'):\n\t\t\t\tl[i] = l[i][:j]+\"!\"+l[i][j+1:]\n\nl=[]\nfor i in range(3):\n\tl.append(input())\ninput()\n\nfor i in range(3):\n\tl.append(input())\n\ninput()\n\nfor i in range(3):\n\tl.append(input())\n\nfor i in range(9):\n\tl[i] = l[i].replace(\" \",\"\");\n\nm,n = list(map(int, input().split()))\n\ntargetX = (m-1)%3\ntargetY = (n-1)%3\n\nif(check(targetX , targetY)):\n\tc1(targetX, targetY)\nelse:\n\tc2(targetX, targetY)\n\nfor i in range(9):\n\tl[i] = l[i][:3]+\" \"+l[i][3:6]+\" \"+l[i][6:]\n\nfor val in range(9):\n\tif(val!=0 and val%3 == 0):\n\t\tprint()\n\tprint(l[val])\n", "d = []\r\nfor i in range(11):\r\n\td.append(input())\r\ndel d[7]\r\ndel d[3]\r\np = []\r\nfor i in d:\r\n\tp.append(''.join(i.split(' ')))\r\nx, y = map(int, input().split())\r\nX = (x - 1) // 3 + 1\r\nx = (x - 1) % 3\r\nY = y // 3\r\ny = (y - 1) % 3\r\n\r\nf = False\r\nfor i in range(3 * x, 3 * x + 3):\r\n\tfor j in range(3 * y, 3 * y + 3):\r\n\t\tif p[i][j] == '.':\r\n\t\t\tp[i] = p[i][:j] + '!' + p[i][j + 1:]\r\n\t\t\tf = True\r\n\r\nif not f:\r\n\tfor i in range(len(p)):\r\n\t\tfor j in range(len(p)):\r\n\t\t\tif p[i][j] == '.':\r\n\t\t\t\tp[i] = p[i][:j] + '!' + p[i][j + 1:]\r\nfor i in range(3):\r\n\tfor j in range(3):\r\n\t\tfor k in range(3):\r\n\t\t\tprint(p[i * 3 + j][3 * k:3 * k + 3], end = ' ')\r\n\t\tprint()\r\n\tprint()\r\n", "x=[[m for m in input()] for y in range(11)]\na,b=map(int,input().split(\" \")); a,b=(a-1)%3,(b-1)%3\ntarg=[(i,j) for i in range(3*a,3*a+3) for j in range(3*b,3*b+3)]\ndic = {0:0,1:1,2:2,3:4,4:5,5:6,6:8,7:9,8:10}\nboo = True\nfor z in targ:\n cur = x[dic[z[0]]][dic[z[1]]] \n if cur == \".\":\n x[dic[z[0]]][dic[z[1]]] = \"!\"\n boo = False\n else:\n pass\n\nif boo:\n x=[[\"!\" if l==\".\" else l for l in k] for k in x]\n\nfor i in x:\n print(\"\".join(i))\n\n \t\t\t \t\t\t \t\t \t\t\t\t\t \t", "field = []\r\nfor i in range(3):\r\n a1, a2, a3 = [], [], []\r\n for j in range(3):\r\n s = list(input())\r\n a1.append(s[:3])\r\n a2.append(s[4:7])\r\n a3.append(s[8:11])\r\n if i != 2:\r\n s = input()\r\n row = [a1, a2, a3]\r\n field.append(row)\r\nx, y = map(int, input().split())\r\nx -= 1\r\ny -= 1\r\nx, y = x % 3, y % 3\r\nisset = False\r\nfor i in range(3):\r\n for j in range(3):\r\n if field[x][y][i][j] == '.':\r\n isset = True\r\n field[x][y][i][j] = '!'\r\nif not isset:\r\n for x in range(3):\r\n for y in range(3):\r\n for i in range(3):\r\n for j in range(3):\r\n if field[x][y][i][j] == '.':\r\n field[x][y][i][j] = '!'\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(3): \r\n print(*field[i][k][j], sep='', end=' ')\r\n print()\r\n print()\r\n\r\n", "a = []\r\nfor i in range(0,11):\r\n s = input()\r\n if s != '':\r\n a.append([])\r\n for j in range(len(s)):\r\n if s[j] != ' ':\r\n a[-1].append(s[j])\r\nx, y = [int(i) - 1 for i in input().split()]\r\nxi = y % 3\r\nyi = x % 3\r\nf = False\r\nfor i in range(yi * 3, yi * 3 + 3):\r\n for j in range(xi * 3, xi * 3 + 3):\r\n if a[i][j] != 'x' and a[i][j] != 'o':\r\n f = True\r\n break\r\nif f == False:\r\n for i in range(9):\r\n if i == 3 or i == 6:\r\n print() \r\n for j in range(9):\r\n if j == 3 or j == 6:\r\n print(' ', end = \"\")\r\n if a[i][j] != 'x' and a[i][j] != 'o':\r\n print('!', end = '')\r\n else:\r\n print(a[i][j], end = '')\r\n print()\r\nelse:\r\n for i in range(9):\r\n if i == 3 or i == 6:\r\n print() \r\n for j in range(9):\r\n if j == 3 or j == 6:\r\n print(' ', end = \"\")\r\n if yi * 3 <= i <= yi * 3 + 2 and xi * 3 <= j <= xi * 3 + 2:\r\n if a[i][j] != 'x' and a[i][j] != 'o':\r\n print('!', end = '')\r\n else:\r\n print(a[i][j], end = '')\r\n else:\r\n print(a[i][j], end = '')\r\n print() ", "a = [[] for i in range(9)]\r\nfor i in range(2):\r\n for j in range(3):\r\n b = input()\r\n a[3 * i + j].append(b[0])\r\n a[3 * i + j].append(b[1])\r\n a[3 * i + j].append(b[2])\r\n a[3 * i + j].append(b[4])\r\n a[3 * i + j].append(b[5])\r\n a[3 * i + j].append(b[6])\r\n a[3 * i + j].append(b[8])\r\n a[3 * i + j].append(b[9])\r\n a[3 * i + j].append(b[10])\r\n b = input()\r\nfor j in range(3):\r\n b = input()\r\n a[j + 6].append(b[0])\r\n a[j + 6].append(b[1])\r\n a[j + 6].append(b[2])\r\n a[j + 6].append(b[4])\r\n a[j + 6].append(b[5])\r\n a[j + 6].append(b[6])\r\n a[j + 6].append(b[8])\r\n a[j + 6].append(b[9])\r\n a[j + 6].append(b[10])\r\ny, x = [int(x) for x in input().split()]\r\nx2 = (x - 1) % 3\r\ny2 = (y - 1) % 3\r\nx2 *= 3\r\ny2 *= 3\r\nf = 1\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[i + y2][j + x2] == '.':\r\n a[i + y2][j + x2] = '!'\r\n f = 0\r\nif f == 1:\r\n for i in range(9):\r\n for j in range(9):\r\n if a[i][j] == '.':\r\n a[i][j] = '!'\r\nfor i in range(3):\r\n for j in range(3):\r\n for l in range(3):\r\n print(a[3 * i + j][l], end='')\r\n print(' ', end='')\r\n for l in range(3, 6):\r\n print(a[3 * i + j][l], end='')\r\n print(' ', end='')\r\n for l in range(6, 9):\r\n print(a[3 * i + j][l], end='') \r\n print()\r\n print()", "a=[]\r\nfor i in range(0,3):\r\n a.append(input().split())\r\ns=input() \r\nfor i in range(0,3):\r\n a.append(input().split())\r\nd=input()\r\nfor i in range(0,3):\r\n a.append(input().split())\r\nq,w=map(int,input().split())\r\nz=q%3-1\r\nif z==-1:\r\n z=2\r\nx=w%3-1\r\nif x==-1:\r\n x=2\r\nz=z*3\r\nb=True\r\nfor i in range(z,z+3):\r\n if a[i][x].count('.')!=0:\r\n b=False\r\n a[i][x]=a[i][x].replace('.','!')\r\nif b:\r\n for i in range(0,9):\r\n for j in range(0,3):\r\n a[i][j]=a[i][j].replace('.','!')\r\nfor i in range(0,3):\r\n print(' '.join(a[i]))\r\nprint()\r\nfor i in range(3,6):\r\n print(' '.join(a[i]))\r\nprint()\r\nfor i in range(6,9):\r\n print(' '.join(a[i]))\r\n", "'''input\n... ... ...\n... ... ...\n... ... ...\n\n... ... ...\n... ... ...\n... x.. ...\n\n... ... ...\n... ... ...\n... ... ...\n6 4\n'''\nb = [list(''.join(input().split())) for i in range(11)]\ng = [[[[0] * 3 for _ in range(3)] for _ in range(3)] for _ in range(3)]\nb.remove([])\nb.remove([])\n# print(g)\nfor i in range(9):\n\tfor j in range(9):\n\t\tg[i // 3][j // 3][i % 3][j % 3] = b[i][j]\nx, y = map(int, input().split())\nx = (x-1) % 3\ny = (y-1) % 3\ngrid = g[x][y]\nc = 0\nfor p in grid:\n\tc += p.count('.')\nif c != 0:\n\tfor p in range(3):\n\t\tfor q in range(3):\n\t\t\tif grid[p][q] == '.':\n\t\t\t\tgrid[p][q] = '!'\n\tg[x][y] = grid\nelse:\n\tfor i in range(9):\n\t\tfor j in range(9):\n\t\t\tif g[i // 3][j // 3][i % 3][j % 3] == '.':\n\t\t\t\tg[i // 3][j // 3][i % 3][j % 3] = '!'\nfor i in range(9):\n\tfor j in range(9):\n\t\tb[i][j] = g[i // 3][j // 3][i % 3][j % 3]\nfor i in range(9):\n\tprint(''.join(b[i][:3]), ''.join(b[i][3: 6]), ''.join(b[i][6:]), sep=' ')\n\tif i % 3 == 2:\n\t\tprint()", "g = [[[[0,0,0], [0,0,0], [0,0,0]] for j in range(3)] for i in range(3)]\r\nfor i in range(9):\r\n s = [list(map(lambda t: 0 if t=='.' else 1 if t=='x' else -1, list(r))) for r in input().split()]\r\n for j in range(3):\r\n g[i//3][j][i%3] = s[j]\r\n if i%3==2 and i!=8:\r\n input()\r\nx, y = map(lambda i: int(i)-1, input().split())\r\nxi = g[x//3][y//3][x%3][y%3]\r\nf = any(i==0 for s in g[x%3][y%3] for i in s)\r\nm = lambda c, xg, yg: '!' if (c==0 and ((xg, yg)==(x%3, y%3) or not f)) else 'x' if c==1 else 'o' if c==-1 else '.'\r\nfor i in range(9):\r\n print(' '.join(''.join(m(g[i//3][j][i%3][ji], i//3, j) for ji in range(3)) for j in range(3)))\r\n if i%3==2:\r\n print('')\r\n", "import sys\n\n#f = open('input', 'r')\nf = sys.stdin\n\nm = []\nfor t in range(3):\n ml = [[] for _ in range(3)]\n for _ in range(3):\n map_line = f.readline().split()\n for i, x in enumerate(map_line):\n ml[i].append(list(x))\n m.append(ml)\n if t < 2:\n f.readline()\nx,y = map(int, f.readline().split())\nx-=1\ny-=1\nfx = x%3\nfy = y%3\nchecked = False\nfor i in range(3):\n for j in range(3):\n if m[fx][fy][i][j] == '.':\n m[fx][fy][i][j] = '!'\n checked = True\n\nif not checked:\n for i in range(9):\n for j in range(9):\n if m[i//3][j//3][i%3][j%3] == '.':\n m[i//3][j//3][i%3][j%3] = '!'\n\n\nfor t in range(3):\n for i in range(3):\n print(' '.join(''.join(x[i]) for x in m[t]))\n if t < 2:\n print()\n", "a = []\r\nfor i in range(11):\r\n b = input().split()\r\n if b != []:\r\n b = b[0] + b[1] + b[2]\r\n a.append(list(b))\r\nx, y = map(int, input().split())\r\nx = (x + 2) % 3 #����� ���� �� ���������\r\ny = (y + 2) % 3 #����� ���� �� �����������\r\nk = 0\r\nfor i in range(3 * x, 3 * x + 3):\r\n for j in range(3 * y, 3 * y + 3):\r\n if a[i][j] == '.':\r\n a[i][j] = '!'\r\n k += 1\r\nif k == 0:\r\n for i in range(9):\r\n for j in range(9):\r\n if a[i][j] == '.':\r\n a[i][j] = '!'\r\nfor i in range(1, 10):\r\n print(a[i - 1][0] + a[i-1][1] + a[i-1][2] + ' ' + a[i-1][3] + a[i -1 ][4] + a[i-1][5] + ' ' + a[i-1][6] + a[i-1][7] + a[i-1][8])\r\n if i % 3 == 0:\r\n print()", "l=[input() for _ in range(11)]\r\nx,y=map(int, input().split())\r\na,b=(x-1)%3*4,(y-1)%3*4\r\nf=0\r\nfor i in range(a,a+3):\r\n s=l[i][b:b+3]\r\n if '.' in s:\r\n l[i],f=l[i][:b]+s.replace('.','!')+l[i][b+3:],1\r\nfor s in l:\r\n print(s if f else s.replace('.','!'))\r\n", "a = [0] * 9\r\n\r\n\r\ndef check(x, y):\r\n global a\r\n for i in range(3):\r\n for j in range(3):\r\n if (a[i + x * 3][j + y * 3] == '.'):\r\n return True\r\n return False\r\n\r\ndef yall():\r\n global a\r\n for i in range(9):\r\n for j in range(9):\r\n if (a[i][j] == '.'):\r\n a[i][j] = '!'\r\n \r\ndef nall(x, y):\r\n global a\r\n for i in range(3):\r\n for j in range(3):\r\n if (a[i + x * 3][j + y * 3] == '.'):\r\n a[i + x * 3][j + y * 3] = '!'\r\n\r\nfor i in range(9):\r\n b = [j for j in input().split()]\r\n a[i] = [b[k][j] for k in range(3) for j in range(3)]\r\n if (i % 3 == 2 and i != 8):\r\n input()\r\n\r\nx, y = [int(i) for i in input().split()]\r\nx1 = (x-1) % 3\r\ny1 = (y-1) % 3\r\n\r\nif check(x1, y1):\r\n nall(x1, y1)\r\nelse:\r\n yall()\r\n \r\nfor i in range(9):\r\n for j in range(9):\r\n print(a[i][j], end = '')\r\n if (j % 3 == 2):\r\n print(\" \", end = '')\r\n if (i % 3 == 2):\r\n print()\r\n print()", "#!/usr/bin/env python3\n\nmp = []\nfor ii in range(11):\n if ii==3 or ii==7:\n input()\n continue\n mp.append(list(\"\".join([str(i) for i in input().split(' ')])))\ny,x = [int(i) for i in input().split(' ')]\n\nr = y%3\nc = x%3\n\ncnt = 0\nrr = (3+r-1)%3\ncc = (3+c-1)%3\nfor i in range(3):\n for j in range(3):\n if mp[rr*3+i][cc*3+j]=='.':\n mp[rr*3+i][cc*3+j] = '!'\n cnt += 1\nif cnt==0:\n for i in range(9):\n for j in range(9):\n if mp[i][j]=='.':\n mp[i][j] = '!'\n\nfor i in range(9):\n if i==3 or i==6:\n print(\"\")\n for j in range(9):\n if j==3 or j==6:\n print(\" \",end='')\n print (mp[i][j],end='')\n if j==8:\n print(\"\")\n", "field = []\r\n\r\n# Читаем поле\r\nfor j in range(0, 11):\r\n row_str = input()\r\n\r\n if len(row_str):\r\n row = []\r\n\r\n for i in range(0, 11):\r\n if row_str[i] in ['.', 'x', 'o']:\r\n row.append(row_str[i])\r\n\r\n field.append(row)\r\n\r\n# Читаем последний ход\r\nx, y = map(int, input().split())\r\n\r\nX = (x - 1) % 3\r\nY = (y - 1) % 3\r\n\r\n# Заполняем клектки в нужном маленьком поле и считаем их количество\r\nfilled = False\r\n\r\nfor i in range(X * 3, X * 3 + 3):\r\n for j in range(Y * 3, Y * 3 + 3):\r\n if field[i][j] == '.':\r\n field[i][j] = '!'\r\n filled = True\r\n\r\n# Если в маленьком поле нет места, то заполняем все свободные клетки\r\nif not filled:\r\n for i in range(0, 9):\r\n for j in range(0, 9):\r\n if field[i][j] == '.':\r\n field[i][j] = '!'\r\n\r\n# Выводим поле с возможными ходами\r\nfor i in range(0, 9):\r\n for j in range(0, 9):\r\n print(field[i][j], end='')\r\n\r\n if (j + 1) % 3 == 0:\r\n print(' ', end='')\r\n\r\n print('')\r\n\r\n if (i + 1) % 3 == 0:\r\n print('')\r\n", "arr = [[] for i in range(9)]\r\nfor i in range(3):\r\n q = list(input().split())\r\n arr[0] += q[0]\r\n arr[1] += q[1]\r\n arr[2] += q[2]\r\nq = input()\r\nfor i in range(3):\r\n q = list(input().split())\r\n arr[3] += q[0]\r\n arr[4] += q[1]\r\n arr[5] += q[2]\r\nq = input()\r\nfor i in range(3):\r\n q = list(input().split())\r\n arr[6] += q[0]\r\n arr[7] += q[1]\r\n arr[8] += q[2]\r\nx, y = map(int, input().split())\r\nx %= 3\r\ny %= 3\r\nif x == 1:\r\n if y == 1:\r\n pos = 0\r\n elif y == 2:\r\n pos = 1\r\n else:\r\n pos = 2\r\nelif x == 2:\r\n if y == 1:\r\n pos = 3\r\n elif y == 2:\r\n pos = 4\r\n else:\r\n pos = 5\r\nelse:\r\n if y == 1:\r\n pos = 6\r\n elif y == 2:\r\n pos = 7\r\n else:\r\n pos = 8\r\nif '.' in arr[pos]:\r\n for i in range(9):\r\n if arr[pos][i] == '.':\r\n arr[pos][i] = '!'\r\nelse:\r\n for i in range(9):\r\n for j in range(9):\r\n if arr[i][j] == '.':\r\n arr[i][j] = '!'\r\n\r\nans = []\r\nfor i in range(3):\r\n q = ''\r\n for j in range(3):\r\n for l in range(3):\r\n q += arr[j][i * 3 + l]\r\n q += ' '\r\n ans.append(q)\r\nans.append(' ')\r\nfor i in range(3):\r\n q = ''\r\n for j in range(3):\r\n for l in range(3):\r\n q += arr[3 + j][i * 3 + l]\r\n q += ' '\r\n ans.append(q)\r\nans.append(' ')\r\nfor i in range(3):\r\n q = ''\r\n for j in range(3):\r\n for l in range(3):\r\n q += arr[6 + j][i * 3 + l]\r\n q += ' '\r\n ans.append(q)\r\nfor i in range(11):\r\n print(ans[i])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s = []\nfor _ in range(11):\n s.append(input())\nr,c = map(int,input().split())\npos = False\nsr = ((r%3)*4-4)%12\nsc = ((c%3)*4-4)%12\nfor i in range(3):\n for j in range(3):\n if s[sr+i][sc+j] == '.':\n pos = True\n s[sr+i] = s[sr+i][:sc+j] + '!' + s[sr+i][sc+j+1:]\nif pos:\n print('\\n'.join(s))\nelse:\n for i in range(11):\n if i%4==3:\n continue\n for j in range(11):\n if s[i][j] == '.':\n s[i] = s[i][:j] + '!' + s[i][j+1:]\n print('\\n'.join(s))\n", "a = [[] for i in range(10)]\r\npp = -1\r\nfor i in range(11):\r\n b = input()\r\n b.split()\r\n if i == 3 or i == 7:\r\n continue\r\n pp += 1\r\n for j in range(len(b)):\r\n if b[j] == ' ':\r\n continue\r\n a[pp].append(b[j])\r\nx, y = map(int, input().split())\r\nx %= 3\r\ny %= 3\r\nif x == 0:\r\n x0 = 6\r\nif x == 1:\r\n x0 = 0\r\nif x == 2:\r\n x0 = 3\r\n \r\nif y == 0:\r\n y0 = 6\r\nif y == 1:\r\n y0 = 0\r\nif y == 2:\r\n y0 = 3\r\nans = False\r\nfor i in range(x0, x0 + 3):\r\n for j in range(y0, y0 + 3):\r\n if a[i][j] == '.':\r\n ans = True\r\n a[i][j] = '!'\r\nif ans == False:\r\n for i in range(0, 9):\r\n for j in range(0, 9):\r\n if a[i][j] == '.':\r\n a[i][j] = '!'\r\n \r\nfor i in range(0, 9):\r\n if i == 3 or i == 6:\r\n print()\r\n for j in range(0, 9):\r\n if j == 3 or j == 6:\r\n print(end = \" \")\r\n print(a[i][j], end = \"\")\r\n print()", "place = []\r\nfor i in range(11):\r\n if (i+1) % 4 == 0:\r\n input()\r\n else:\r\n place.append([j for j in input() if j != ' '])\r\n# print(place)\r\nx, y = map(int, input().split())\r\nif x % 3 == 0:\r\n x = 3\r\nelse:\r\n x = x%3\r\nif y % 3 == 0:\r\n y = 3\r\nelse:\r\n y = y%3\r\nyes = True\r\n# print(x, y)\r\nos = [[1, 2, 3], [4, 5 ,6], [7, 8, 9]]\r\nfor i in os[x-1]:\r\n for j in os[y-1]:\r\n if place[i-1][j-1] == '.':\r\n yes = False\r\n place[i-1][j-1] = '!'\r\n# print(place)\r\nif yes:\r\n for i in range(9):\r\n for j in range(9):\r\n if place[i][j] == '.':\r\n place[i][j] = '!'\r\n# print(place)\r\nfor i in range(9):\r\n if i == 3 or i == 6:\r\n print()\r\n for j in range(9):\r\n if j == 2 or j == 5:\r\n print(place[i][j], end=' ')\r\n else:\r\n print(place[i][j], end='')\r\n print()\r\n", "#!/usr/bin/env python3\n\ndef solve():\n M = [list(input().strip().replace(' ', '')) for _ in range(11)]\n del M[3::4]\n X, Y = map(int, input().strip().split())\n X, Y = X-1, Y-1\n lx, ly = X%3, Y%3\n\n unchanged = True\n print('\\n'.join(''.join(line) for line in M))\n\n for x in range(9):\n for y in range(9):\n if x//3 == lx and y//3 == ly and M[x][y] == '.':\n M[x][y] = '!'\n unchanged = False\n\n if unchanged:\n for x in range(9):\n for y in range(9):\n if M[x][y] == '.':\n M[x][y] = '!'\n M = [''.join(line) for line in M]\n M = ['{} {} {} '.format(line[:3], line[3:6], line[6:]) for line in M]\n M = '{}\\n\\n{}\\n\\n{}'.format('\\n'.join(M[:3]), '\\n'.join(M[3:6]), '\\n'.join(M[6:]))\n return M\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n_testcases = \"\"\"\n... ... ...\n... ... ...\n... ... ...\n\n... ... ...\n... ... ...\n... x.. ...\n\n... ... ...\n... ... ...\n... ... ...\n6 4\n__________________\n... ... ... \n... ... ... \n... ... ... \n\n... ... ... \n... ... ... \n... x.. ... \n\n!!! ... ... \n!!! ... ... \n!!! ... ... \n__________________\nxoo x.. x..\nooo ... ...\nooo ... ...\n\nx.. x.. x..\n... ... ...\n... ... ...\n\nx.. x.. x..\n... ... ...\n... ... ...\n7 4\n__________________\nxoo x!! x!! \nooo !!! !!! \nooo !!! !!! \n\nx!! x!! x!! \n!!! !!! !!! \n!!! !!! !!! \n\nx!! x!! x!! \n!!! !!! !!! \n!!! !!! !!! \n__________________\no.. ... ...\n... ... ...\n... ... ...\n\n... xxx ...\n... xox ...\n... ooo ...\n\n... ... ...\n... ... ...\n... ... ...\n5 5\n__________________\no!! !!! !!! \n!!! !!! !!! \n!!! !!! !!! \n\n!!! xxx !!! \n!!! xox !!! \n!!! ooo !!! \n\n!!! !!! !!! \n!!! !!! !!! \n!!! !!! !!! \n\"\"\".strip()\n\n# ======================= B O I L E R P L A T E ======================= #\n# Practicality beats purity\n\nfrom bisect import bisect_left, bisect_right\nfrom collections import defaultdict\nfrom functools import lru_cache\nfrom heapq import heapify, heappop, heappush\nfrom operator import itemgetter, attrgetter\nimport bisect\nimport collections\nimport functools\nimport heapq\nimport itertools\nimport math\nimport operator\nimport re\nimport string\nimport sys\n\ninf = float('inf')\ncache = lru_cache(None)\nsys.setrecursionlimit(10000)\n\ndef tree():\n return collections.defaultdict(tree)\n\ndef equal(x, y, epsilon=1e-6):\n # https://code.google.com/codejam/kickstart/resources/faq#real-number-behavior\n if -epsilon <= x - y <= epsilon:\n return True\n if -epsilon <= x <= epsilon or -epsilon <= y <= epsilon:\n return False\n return (-epsilon <= (x - y) / x <= epsilon or -epsilon <= (x - y) / y <= epsilon)\n\n\ndef get(_type): # For easy input\n if type(_type) == list:\n if len(_type) == 1:\n _type = _type[0]\n return list(map(_type, input().strip().split()))\n else:\n return [_type[i](inp) for i, inp in enumerate(input().strip().split())]\n else:\n return _type(input().strip())\n\nif __name__ == '__main__':\n printRecursionTree = timeit = lambda x: x\n _p, print = print, lambda *a, **b: None\n _p(solve())\n", "d=[]\r\nfor i in range(11):\r\n s=input()\r\n\r\n if(i!=3 and i!=7):\r\n d.append(s)\r\n\r\n\r\nx,y=map(int,input().split())\r\nx-=1\r\ny-=1\r\n\r\nrow=x%3\r\nif row == 1:\r\n row=3\r\n\r\nif row==2:\r\n row=6\r\n\r\ncol=y%3\r\n\r\nif(col==1):\r\n col=4\r\nif(col==2):\r\n col=8\r\n\r\nflag=False\r\n\r\nfor i in range(row,row+3):\r\n for j in range(col,col+3):\r\n if d[i][j]=='.':\r\n flag=True\r\n\r\nif(flag):\r\n for i in range(row, row + 3):\r\n for j in range(col, col + 3):\r\n if d[i][j] == '.':\r\n d[i]=d[i][:j]+'!'+d[i][j+1:]\r\nelse:\r\n for i in range(len(d)):\r\n for j in range(len(d[i])):\r\n if d[i][j] == '.':\r\n d[i]=d[i][:j]+'!'+d[i][j+1:]\r\n\r\nfor i in range(3):\r\n print(d[i])\r\n\r\nprint(\"\")\r\n\r\nfor i in range(3,6):\r\n print(d[i])\r\n\r\nprint(\"\")\r\n\r\nfor i in range(6,9):\r\n print(d[i])\r\n\r\n", "def main():\n def get_cell(x, y):\n (r, c) = 0, 0\n if x <= 2:\n r = 0\n elif x <= 5:\n r = 1\n elif x <= 8:\n r = 2\n if y <= 2:\n c = 0\n elif y <= 5:\n c = 1\n elif y <= 8:\n c = 2\n return (r, c)\n def get_cells(grids, fx, fy):\n count = 0\n for i in range(3):\n for j in range(3):\n if grids[fx][fy][i][j] == '.':\n grids[fx][fy][i][j] = '!'\n count += 1\n return count\n g = []\n for i in range(11):\n l = ''.join(input().split())\n if len(l) > 0:\n g.append(list(l))\n grids = []\n for k in range(3):\n gg = []\n for j in range(3):\n ggg = []\n for i in range(3 * k, 3 * k + 3):\n ggg.append(g[i][j * 3:j * 3 + 3])\n gg.append(ggg)\n grids.append(gg)\n (x, y) = map(int, input().split(' '))\n x -= 1\n y -= 1\n (cx, cy) = get_cell(x, y)\n fx, fy = x, y\n while fx >= 3:\n fx -= 3\n while fy >= 3:\n fy -= 3\n count = get_cells(grids, fx, fy)\n if count == 0:\n for i in range(3):\n for j in range(3):\n get_cells(grids, i, j)\n ret = []\n for k in range(3):\n for j in range(3):\n x = []\n for i in range(3):\n x.append(''.join(grids[k][i][j]))\n ret.append(x)\n ret.append(\"\")\n for thing in ret:\n print(' '.join(thing))\nmain()\n", "grid = []\r\n\r\nfor count in range(11):\r\n i = input().replace(\" \", \"\")\r\n if (i == \"\"):\r\n continue\r\n grid += [list(i)]\r\n# print(i)\r\nx, y = list(map(int, input().split()))\r\n#print(x,y)\r\nx -= 1\r\ny -= 1\r\n#print(x,y)\r\n\r\n#print()\r\n\r\ndef show(ar):\r\n s = \"\"\r\n for counter in range(1, 10):\r\n s += ar[counter-1]\r\n if counter%3 == 0:\r\n s += \" \"\r\n print(s)\r\n'''\r\nfor a in grid:\r\n show(a)\r\n'''\r\nx = (x%3)*3\r\ny = (y%3)*3\r\n#print(x,y)\r\n\r\ntot = 0\r\nfor i in range(x, x+3):\r\n for j in range(y, y+3):\r\n if grid[i][j] == \".\":\r\n grid[i][j] = \"!\"\r\n tot += 1\r\n\r\nif (tot == 0):\r\n for i in range(9):\r\n for j in range(9):\r\n if grid[i][j] == \".\":\r\n grid[i][j] = \"!\"\r\n\r\nfor a in range(9):\r\n row = grid[a]\r\n show(row)\r\n if a%3 == 2:\r\n print()\r\n", "bigf = []\r\nfor i in range(3):\r\n bigf.append(''.join(input().split()))\r\n_ = input()\r\nfor i in range(3):\r\n bigf.append(''.join(input().split()))\r\n_ = input()\r\nfor i in range(3):\r\n bigf.append(''.join(input().split()))\r\nx, y = map(int, input().split())\r\nx, y = (x - 1) % 3, (y - 1) % 3\r\ncheck = False\r\nfor i in range(3):\r\n for t in range(3):\r\n if bigf[x * 3 + i][y * 3 + t] == '.':\r\n check = True\r\nif check:\r\n for i in range(3):\r\n for t in range(3):\r\n if bigf[x * 3 + i][y * 3 + t] == '.':\r\n bigf[x * 3 + i] = bigf[x * 3 + i][:y * 3 + t] + chr(33) + bigf[x * 3 + i][y *3 + t + 1:]\r\nelse:\r\n for i in range(9):\r\n for t in range(9):\r\n if bigf[i][t] == '.':\r\n bigf[i] = bigf[i][:t] + chr(33) + bigf[i][t + 1:]\r\nfor i in range(9):\r\n if i % 3 == 0 and i > 0:\r\n print()\r\n for t in range(9):\r\n print(bigf[i][t], end='')\r\n if t % 3 == 2:\r\n print(' ', end = '')\r\n print()", "def line():\n L = input().split()\n return list(''.join(L))\n\nL = []\nfor i in range(0, 9):\n if i == 3 or i == 6:\n input()\n L.append(line())\n\nx, y = map(int, input().split())\nx -= 1\ny -= 1\nx %= 3\ny %= 3\n\nempt = True\nfor i in range(3*x, 3*(x+1)):\n for j in range(3*y, 3*(y+1)):\n if L[i][j] == '.':\n L[i][j] = '!'\n empt = False\n\n\nfor i in range(0, 9):\n if empt:\n L[i] = ''.join(L[i]).replace('.', '!')\n else:\n L[i] = ''.join(L[i])\n\nfor i in range(0, 9):\n if i == 3 or i == 6:\n print()\n print(L[i][:3], L[i][3:6], L[i][6:9])", "a = []\r\nfor i in range(11):\r\n a.append(list(input().split()))\r\na.pop(3)\r\na.pop(6)\r\nn, m = map(int, input().split())\r\nn -= 1\r\nm -= 1\r\nn %= 3\r\nm %= 3\r\nn *= 3\r\nstate = 0\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[n + i][m][j] == '.':\r\n a[n + i][m] = a[n + i][m][:j] + '!' + a[n + i][m][j + 1:]\r\n state = 1\r\nif state == 0:\r\n for i in range(9):\r\n for j in range(3):\r\n for k in range(3):\r\n if a[i][j][k] == '.':\r\n a[i][j] = a[i][j][:k] + '!' + a[i][j][k + 1:] \r\nfor i in range(9):\r\n for j in range(3):\r\n print(a[i][j], end = ' ')\r\n print()\r\n if i == 2 or i == 5:\r\n print()\r\n \r\n", "from math import ceil\ns = [list(input().replace(' ', '')) for i in range(3)]\ninput()\ns += [list(input().replace(' ', '')) for i in range(3)]\ninput()\ns += [list(input().replace(' ', '')) for i in range(3)]\ny, x = [int(k) for k in input().split(' ') if k]\nyb, xb = ceil(y / 3), ceil(x / 3)\ny -= (yb - 1) * 3 + 1\nx -= (xb - 1) * 3 + 1\ny *= 3\nx *= 3\nfound = 0\nfor dy in range(3):\n for dx in range(3):\n if s[y + dy][x + dx] == '.':\n found = 1\n s[y + dy][x + dx] = '!'\nif not found:\n for y in range(9):\n for x in range(9):\n if s[y][x] == '.':\n s[y][x] = '!'\nfor y in range(3):\n for x in range(3):\n print(s[y][x], end='')\n print(' ', end='')\n for x in range(3, 6):\n print(s[y][x], end='')\n print(' ', end='')\n for x in range(6, 9):\n print(s[y][x], end='')\n print(' ')\nprint()\nfor y in range(3, 6):\n for x in range(3):\n print(s[y][x], end='')\n print(' ', end='')\n for x in range(3, 6):\n print(s[y][x], end='')\n print(' ', end='')\n for x in range(6, 9):\n print(s[y][x], end='')\n print(' ')\nprint()\nfor y in range(6, 9):\n for x in range(3):\n print(s[y][x], end='')\n print(' ', end='')\n for x in range(3, 6):\n print(s[y][x], end='')\n print(' ', end='')\n for x in range(6, 9):\n print(s[y][x], end='')\n print(' ')\n", "t = []\r\nfor i in range(11):\r\n a= input().split()\r\n if i in [3,7]:continue\r\n \r\n t.append(a[0]+a[1]+a[2])\r\nf = []\r\nfor i in range(9):f.append(['.']*9)\r\n#print(t)\r\nn,m = map(int,input().split())\r\nn2 = n%3-1\r\nm2 = m%3-1\r\nif n2 < 0:n2+=3\r\nif m2 < 0:m2+=3\r\nfl = True\r\nfor i in range(n2*3,n2*3+3):\r\n for j in range(m2*3,m2*3+3):\r\n if t[i][j] == '.':\r\n fl = False\r\nif not fl:\r\n for i in range(n2*3,n2*3+3):\r\n for j in range(m2*3,m2*3+3):\r\n if t[i][j] == '.':\r\n f[i][j] = '!'\r\nfor i in range(9):\r\n for j in range(9):\r\n if j % 3 == 0 and j != 0:print(' ',end = '')\r\n if f[i][j] == '!' :\r\n print('!',end = '')\r\n else:\r\n #print(2)\r\n if t[i][j] != '.':print(t[i][j],end ='')\r\n elif fl:print('!',end ='')\r\n else:print('.',end ='')\r\n if (i+1)%3 == 0:print()\r\n print()\r\n'''a,b,c,d = map(int,input().split())\r\nif d > c*2 : print(-1)\r\nelse:\r\n print(max(b+max(0,(2*d)-b+1)+1,a+max(0,(2*d)-a+1)))\r\n print(b+max(0,(2*d)-b+1))\r\n print(c)\r\n'''\r\n", "field = [['.'] * 9 for i in range(9)]\r\n\r\nfor i in range(9) :\r\n s = input().split();\r\n \r\n if (s == []) :\r\n s = input().split();\r\n \r\n for j in range(3) :\r\n field[i][3 * j] = s[j][0];\r\n field[i][3 * j + 1] = s[j][1];\r\n field[i][3 * j + 2] = s[j][2];\r\n \r\nx, y = map(int, input().split());\r\nx -= 1;\r\ny -= 1;\r\n\r\nix, iy = x % 3, y % 3;\r\n\r\nif (ix == 0 and iy == 0) :\r\n fl = 0;\r\n \r\n for i in range(3) :\r\n for j in range(3) :\r\n if (field[i][j] == '.') :\r\n fl = 1;\r\n field[i][j] = '!';\r\n \r\n if (not fl) :\r\n for i in range(9) :\r\n for j in range(9) :\r\n if (field[i][j] == '.') :\r\n field[i][j] = '!';\r\n\r\nif (ix == 0 and iy == 1) :\r\n fl = 0;\r\n \r\n for i in range(3) :\r\n for j in range(3, 6) :\r\n if (field[i][j] == '.') :\r\n fl = 1;\r\n field[i][j] = '!';\r\n \r\n if (not fl) :\r\n for i in range(9) :\r\n for j in range(9) :\r\n if (field[i][j] == '.') :\r\n field[i][j] = '!';\r\n \r\nif (ix == 0 and iy == 2) :\r\n fl = 0;\r\n \r\n for i in range(3) :\r\n for j in range(6, 9) :\r\n if (field[i][j] == '.') :\r\n fl = 1;\r\n field[i][j] = '!';\r\n \r\n if (not fl) :\r\n for i in range(9) :\r\n for j in range(9) :\r\n if (field[i][j] == '.') :\r\n field[i][j] = '!';\r\n \r\n \r\nif (ix == 1 and iy == 0) :\r\n fl = 0;\r\n \r\n for i in range(3, 6) :\r\n for j in range(3) :\r\n if (field[i][j] == '.') :\r\n fl = 1;\r\n field[i][j] = '!';\r\n \r\n if (not fl) :\r\n for i in range(9) :\r\n for j in range(9) :\r\n if (field[i][j] == '.') :\r\n field[i][j] = '!';\r\n\r\nif (ix == 1 and iy == 1) :\r\n fl = 0;\r\n \r\n for i in range(3, 6) :\r\n for j in range(3, 6) :\r\n if (field[i][j] == '.') :\r\n fl = 1;\r\n field[i][j] = '!';\r\n \r\n if (not fl) :\r\n for i in range(9) :\r\n for j in range(9) :\r\n if (field[i][j] == '.') :\r\n field[i][j] = '!';\r\n \r\nif (ix == 1 and iy == 2) :\r\n fl = 0;\r\n \r\n for i in range(3, 6) :\r\n for j in range(6, 9) :\r\n if (field[i][j] == '.') :\r\n fl = 1;\r\n field[i][j] = '!';\r\n \r\n if (not fl) :\r\n for i in range(9) :\r\n for j in range(9) :\r\n if (field[i][j] == '.') :\r\n field[i][j] = '!';\r\n \r\n\r\nif (ix == 2 and iy == 0) :\r\n fl = 0;\r\n \r\n for i in range(6, 9) :\r\n for j in range(3) :\r\n if (field[i][j] == '.') :\r\n fl = 1;\r\n field[i][j] = '!';\r\n \r\n if (not fl) :\r\n for i in range(9) :\r\n for j in range(9) :\r\n if (field[i][j] == '.') :\r\n field[i][j] = '!';\r\n\r\nif (ix == 2 and iy == 1) :\r\n fl = 0;\r\n \r\n for i in range(6, 9) :\r\n for j in range(3, 6) :\r\n if (field[i][j] == '.') :\r\n fl = 1;\r\n field[i][j] = '!';\r\n \r\n if (not fl) :\r\n for i in range(9) :\r\n for j in range(9) :\r\n if (field[i][j] == '.') :\r\n field[i][j] = '!';\r\n \r\nif (ix == 2 and iy == 2) :\r\n fl = 0;\r\n \r\n for i in range(6, 9) :\r\n for j in range(6, 9) :\r\n if (field[i][j] == '.') :\r\n fl = 1;\r\n field[i][j] = '!';\r\n \r\n if (not fl) :\r\n for i in range(9) :\r\n for j in range(9) :\r\n if (field[i][j] == '.') :\r\n field[i][j] = '!';\r\n\r\n\r\nfor i in range(9) :\r\n if (i % 3 == 0 and i != 0) :\r\n print();\r\n \r\n for j in range(9) :\r\n if (j % 3 == 0 and j != 0) :\r\n print(\" \", end = \"\");\r\n print(field[i][j], end = \"\");\r\n \r\n print();\r\n", "m=[]\r\nfor i in range(11):\r\n m.append(list(input().replace(' ','')))\r\n if i==3 or i==7:\r\n m.pop(-1)\r\np=[]\r\na,b=map(int,input().split())\r\nfor i in range(3):\r\n p.append([[],[],[]])\r\nfor i in range(9):\r\n for j in range(9):\r\n p[i//3][j//3].append(m[i][j])\r\nq,w=(a-1)%3,(b-1)%3\r\nif '.' in p[q][w]:\r\n for i in range(9):\r\n if p[q][w][i]=='.':\r\n p[q][w][i]='!'\r\n for i in range(3):\r\n for j in range(3):\r\n s=''\r\n for x in range(3):\r\n s+=''.join(p[i][x][j*3:(1+j)*3])+' '\r\n print(s)\r\n print()\r\nelse:\r\n for i in range(3):\r\n for j in range(3):\r\n s=''\r\n for x in range(3):\r\n s+=(''.join(p[i][x][j*3:(1+j)*3])).replace('.','!')+' '\r\n print(s)\r\n print()", "def process(M, x, y):\r\n answer = []\r\n for i in range(11):\r\n row = list(M[i])\r\n if i != 3 and i != 7:\r\n answer.append(row[0:3]+row[4:7]+row[8:11])\r\n x, y = x-1, y-1\r\n x1, y1 = x % 3, y % 3\r\n done = False\r\n for i in range(3):\r\n for j in range(3):\r\n if answer[3*x1+i][3*y1+j] =='.':\r\n answer[3*x1+i][3*y1+j] = '!'\r\n done = True\r\n if not done:\r\n for i in range(9):\r\n for j in range(9):\r\n if answer[i][j]=='.':\r\n answer[i][j] = '!'\r\n final_answer = []\r\n for i in range(3):\r\n row = ''.join(answer[i])\r\n final_answer.append(f'{row[0:3]} {row[3:6]} {row[6:9]}')\r\n final_answer.append('')\r\n for i in range(3, 6):\r\n row = ''.join(answer[i])\r\n final_answer.append(f'{row[0:3]} {row[3:6]} {row[6:9]}')\r\n final_answer.append('')\r\n for i in range(6, 9):\r\n row = ''.join(answer[i])\r\n final_answer.append(f'{row[0:3]} {row[3:6]} {row[6:9]}')\r\n return final_answer\r\n \r\n\r\nM = []\r\nfor i in range(11):\r\n row = input()\r\n M.append(row)\r\nx, y = [int(x) for x in input().split()]\r\nanswer = process(M, x, y)\r\nfor row in answer:\r\n print(row)", "R=input\r\ng=[list(R()) for _ in range(11)]\r\nr,c=map(int,R().split())\r\nr,c=(r-1)%3*4,(c-1)%3*4\r\nf='.'\r\nfor i in range(9):\r\n s=g[r+i//3]\r\n if '.'==s[c+i%3]:\r\n s[c+i%3]=f='!'\r\nfor v in g:\r\n print(''.join(v).replace(f,'!'))\r\n", "g=[list(input()) for _ in range(11)]\r\nr,c=map(lambda x:(int(x)-1)%3*4,input().split())\r\nf,d='.!'\r\nfor i in range(9):\r\n v,e=g[r+i//3],c+i%3\r\n if v[e]<'o':v[e]=f=d\r\nfor v in g:print(''.join(v).replace(f,d))", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\n\r\ndef main():\r\n\tfield = []\r\n\tfor _ in range(3):\r\n\t\ts = input()\r\n\t\ts = s.replace(' ', '')\r\n\t\tfield.append(list(s))\r\n\tinput()\r\n\tfor _ in range(3):\r\n\t\ts = input()\r\n\t\ts = s.replace(' ', '')\r\n\t\tfield.append(list(s))\r\n\tinput()\r\n\tfor _ in range(3):\r\n\t\ts = input()\r\n\t\ts = s.replace(' ', '')\r\n\t\tfield.append(list(s))\r\n\tx, y = map(int, input().split())\r\n\tx -= 1\r\n\ty -= 1\r\n\tx %= 3\r\n\ty %= 3\r\n\tx *= 3\r\n\ty *= 3\r\n\tcnt = 0\r\n\tfor i in range(x, x + 3):\r\n\t\tfor j in range(y, y + 3):\r\n\t\t\tif field[i][j] != '.':\r\n\t\t\t\tcnt += 1\r\n\tif cnt == 9:\r\n\t\tfor i in range(9):\r\n\t\t\tfor j in range(9):\r\n\t\t\t\tif field[i][j] == '.':\r\n\t\t\t\t\tfield[i][j] = '!'\r\n\telse:\r\n\t\tfor i in range(x, x + 3):\r\n\t\t\tfor j in range(y, y + 3):\r\n\t\t\t\tif field[i][j] == '.':\r\n\t\t\t\t\tfield[i][j] = '!'\r\n\tfor i in range(9):\r\n\t\tprint(' '.join([''.join(field[i][:3]), ''.join(field[i][3:6]), ''.join(field[i][6:])]))\r\n\t\tif not (i + 1) % 3 and not i == 8:\r\n\t\t\tprint()\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\t", "def inp():\r\n b = []\r\n for i in range(3):\r\n for j in range(3):\r\n s = input()\r\n s = s[:3] + s[4:7] + s[8:]\r\n b.append(list(s))\r\n if i!=2:\r\n input()\r\n return b\r\ndef out():\r\n for i in range(3):\r\n for j in range(3):\r\n s = a[i * 3 + j]\r\n print(s[0],s[1],s[2],' ', s[3],s[4],s[5],' ', s[6],s[7],s[8], sep = '')\r\n if i!=2:\r\n print()\r\n\r\n\r\na = inp()\r\nx, y = map(int,input().split())\r\nx -= 1\r\ny -= 1\r\nx %= 3\r\ny %= 3\r\nf = True\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[x * 3 + i][y * 3 + j] == '.':\r\n a[x * 3 + i][y * 3 + j] = '!'\r\n f = False\r\nif f:\r\n for i in range(9):\r\n for j in range(9):\r\n if a[i][j] == '.':\r\n a[i][j] = '!'\r\nout()\r\n \r\n", "ls = []\r\nfor i in range(11):\r\n\tx = input()\r\n\tls.append(x)\r\n\t\r\ny = input().split()\r\nl = int(y[0])\r\nm = int(y[1])\r\nls2 = [8, 0, 4]\r\n \r\nrow_check = []\r\ninitial = ls2[l % 3]\r\nfor i in range(3):\r\n\trow_check.append(initial)\r\n\tinitial += 1\r\n\t\r\ncolumn_check = []\r\ninitial = ls2[m % 3]\r\nfor i in range(3):\r\n\tcolumn_check.append(initial)\r\n\tinitial += 1\r\n\r\n\r\ncount = 0\t\r\nfor i in row_check:\r\n\tdummy = list(ls[i])\r\n\tfor j in column_check:\r\n\t\tif dummy[j] == '.':\r\n\t\t\tcount += 1\r\n\t\t\tdummy[j] = '!'\r\n\tls[i] = ''.join(dummy)\r\n\r\n\t\t\t\r\nif count == 0:\r\n\tfor i in range(11):\r\n\t\tdummy = list(ls[i])\r\n\t\tfor j in range(len(dummy)):\r\n\t\t\tif dummy[j] == '.':\r\n\t\t\t\tdummy[j] = '!'\r\n\t\tls[i] = ''.join(dummy)\r\n\t\t\r\n\t\r\nfor i in range(11):\r\n\tprint(ls[i])", "board = [list(input()) for i in range(11)]\r\n(x, y) = map(int, input().split())\r\n\r\nx = (x - 1) % 3\r\ny = (y - 1) % 3\r\n\r\ncan = False\r\nfor i in range(3):\r\n for j in range(3):\r\n if board[x*4 + i][y*4 + j] == '.':\r\n board[x*4 + i][y*4 + j] = '!'\r\n can = True\r\n \r\nif not can:\r\n for i in range(11):\r\n if i % 4 != 3:\r\n for j in range(11):\r\n if board[i][j] == '.':\r\n board[i][j] = '!'\r\n\r\nfor i in range(11):\r\n print(''.join(board[i]))", "grid = [[] for _ in range(9)]\r\nfor block in range(3):\r\n for line in range(3):\r\n linestr = input()\r\n linestr = iter(linestr)\r\n gridline = grid[block*3 + line]\r\n for vertbl in range(3):\r\n for col in range(3):\r\n gridline.append(next(linestr))\r\n if vertbl < 2:\r\n next(linestr)\r\n if block < 2:\r\n input()\r\n\r\n\r\nx, y = (int(c) for c in input().split())\r\n\r\n\r\n# nope = True\r\nx, y = x-1, y-1\r\nblx, bly = x % 3, y % 3\r\ndef check():\r\n for xx in range(blx*3, blx*3+3):\r\n for yy in range(bly*3, bly*3+3):\r\n if grid[xx][yy]=='.':\r\n return False\r\n return True\r\nnope = check()\r\n\r\n\r\nfor block in range(3):\r\n for line in range(3):\r\n gridline = grid[block * 3 + line]\r\n output = ''\r\n for vertbl in range(3):\r\n for col in range(3):\r\n current = gridline[vertbl*3+col]\r\n if current != '.':\r\n output+=current\r\n elif nope:\r\n output+='!'\r\n elif (block == blx) and (vertbl == bly):\r\n output+='!'\r\n else:\r\n output+='.'\r\n if vertbl < 2:\r\n output+=' '\r\n print(output)\r\n if block<2:\r\n print()", "def check(a):\r\n for i in range(top, bottom + 1):\r\n for j in range(left, right + 1):\r\n if a[i][j] == '.':\r\n return True\r\n return False\r\na = []\r\nfor i in range(11):\r\n a.append(list(map(str, input())))\r\ny, x = map(int, input().split())\r\nsqx = x % 3\r\nif sqx == 0:\r\n sqx = 3\r\nsqy = y % 3\r\nif sqy == 0:\r\n sqy = 3\r\nleft = (sqx - 1) * 3 + (sqx - 1)\r\nright = sqx * 3 + (sqx - 1) - 1\r\nbottom = sqy * 3 + (sqy - 1 ) - 1\r\ntop = (sqy - 1) * 3 + (sqy - 1)\r\nif check(a):\r\n for i in range(11):\r\n for j in range(11):\r\n if i != 3 and i != 7 and a[i][j] == '.' and top <= i <= bottom and left <= j <= right:\r\n print('!', end='')\r\n elif i != 3 and i != 7:\r\n print(a[i][j], end='')\r\n print()\r\nelse:\r\n for i in range(11):\r\n for j in range(11):\r\n if i != 3 and i != 7 and a[i][j] == '.':\r\n print('!', end='')\r\n elif i != 3 and i != 7:\r\n print(a[i][j], end='')\r\n print()", "\r\nmtx = []\r\n\r\nfor i in range(11):\r\n inp = input()\r\n if inp.strip():\r\n mtx.append(list(''.join(inp.split())))\r\n\r\ny, x = map(int, input().split())\r\ny -= 1\r\nx -= 1\r\n\r\ngx = x % 3\r\ngy = y % 3\r\n\r\nfound = 0\r\nfor px in range(3):\r\n for py in range(3):\r\n if mtx[gy*3 + py][gx*3 + px] == '.':\r\n mtx[gy * 3 + py][gx * 3 + px] = '!'\r\n found += 1\r\n\r\nif not found:\r\n for px in range(9):\r\n for py in range(9):\r\n if mtx[py][px] == '.':\r\n mtx[py][px] = '!'\r\n\r\nfor i in range(9):\r\n st = ''\r\n for j in range(9):\r\n st += mtx[i][j]\r\n if j == 2 or j == 5:\r\n st += ' '\r\n print(st)\r\n\r\n if i == 2 or i == 5:\r\n print()\r\n\r\n", "R=input\r\ng=[list(R()) for _ in range(11)]\r\nr,c=map(lambda x:(x-1)%3*4,map(int,R().split()))\r\nf,d='.!'\r\nfor i in range(9):\r\n s,e=g[r+i//3],c+i%3\r\n if s[e]<'o':\r\n s[e]=f=d\r\nfor v in g:print(''.join(v).replace(f,d))", "matr = [['' for j in range(9)] for i in range(9)]\r\nr=0\r\nfor i in range(11):\r\n if i==3 or i==7:input();continue\r\n k=0\r\n for j,x in enumerate(input()):\r\n if x!=' ':matr[r][k]=x;k+=1\r\n r+=1\r\nx,y = map(int,input().split())\r\nx,y=(x-1)%3*3,(y-1)%3*3\r\ncase=0\r\nfor i in range(x,x+3):\r\n for j in range(y,y+3):\r\n if matr[i][j]=='.':case=1;matr[i][j]='!'\r\nif case==0:\r\n for i in range(9):\r\n for j in range(9):\r\n if matr[i][j]=='.':matr[i][j]='!'\r\nfor i,x in enumerate(matr):\r\n if i==3 or i==6:print()\r\n for j,y in enumerate(x):\r\n if j==3 or j==6:print(' ',end='')\r\n print(y,end='')\r\n print()", "dta = [[] for i in range(3)]\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n s = input().split()\r\n if len(s) == 0:\r\n dta += [[] for i in range(3)]\r\n s = input().split()\r\n for k in range(3):\r\n dta[-3 + k].append(list(s[k]))\r\n else:\r\n for k in range(3):\r\n dta[-3 + k].append(list(s[k]))\r\n\r\nn, m = [int(i) for i in input().split()]\r\nn -= 1\r\nm -= 1\r\nn %= 3\r\nm %= 3\r\n\r\nindex = n * 3 + m\r\n# print(index)\r\nflag = True\r\nfor i in range(3):\r\n for j in range(3):\r\n if dta[index][i][j] == '.':\r\n flag = False\r\n dta[index][i][j] = '!'\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n s = \"\"\r\n for k in range(3):\r\n # print(dta[i * 3 + k][j])\r\n s += ''.join(dta[i * 3 + k][j]) + ' '\r\n if flag:\r\n s = s.replace('.', '!')\r\n print(s)\r\n print('')", "a=[]\r\nfor i in range(11):\r\n b = input()\r\n a.append(b)\r\nr,c = [int(x) for x in input().split()]\r\nj=4*((r-1)%3)\r\ni=4*((c-1)%3)\r\nans = False\r\nfor c0 in range(3):\r\n for r0 in range(3):\r\n if a[j+r0][i+c0]==\".\":\r\n ans = True\r\n break\r\nif ans:\r\n for r0 in range(11):\r\n if r0==3 or r0==7:\r\n print()\r\n continue\r\n for c0 in range(11):\r\n if c0>=i and c0<=(i+2) and r0>=j and r0<=(j+2) and a[r0][c0]==\".\":\r\n print(\"!\",end=\"\")\r\n else:\r\n print(a[r0][c0],end=\"\")\r\n print()\r\n \r\nelse:\r\n \r\n for r0 in range(11):\r\n if r0==3 or r0==7:\r\n print()\r\n continue\r\n for c0 in range(11):\r\n if a[r0][c0]==\".\":\r\n print(\"!\",end=\"\")\r\n else:\r\n print(a[r0][c0],end=\"\")\r\n print()\r\n ", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ng = [list(input()[:-1]) for _ in range(11)]\r\na, b = map(int, input().split())\r\n\r\nx = a%3\r\ny = b%3\r\ns = {1: range(0, 3), 2: range(4, 7), 0: range(8, 11)}\r\n\r\nc = 0\r\nfor i in s[x]:\r\n for j in s[y]:\r\n if g[i][j] == '.':\r\n g[i][j] = '!'\r\n c = 1\r\n\r\nif c == 0:\r\n for i in range(11):\r\n if i not in [3, 7]:\r\n for j in range(11):\r\n if g[i][j] == '.':\r\n g[i][j] = '!'\r\n\r\nfor i in g:\r\n print(''.join(i))", "def color(x1, y1, x2, y2):\r\n\tk = 0\r\n\tfor i in range(x1, x2):\r\n\t\tfor j in range(y1, min(len(field[i]), y2 + 1)):\r\n\t\t\tif field[i][j] == '.':\r\n\t\t\t\tfield[i][j] = '!'\r\n\t\t\t\tk += 1\r\n\treturn k != 0\r\n\r\nfield = [list(input()) for i in range(11)]\r\nx, y = map(int, input().split())\r\nxg = x % 3 + 3 * (x % 3 == 0)\r\nyg = y % 3 + 3 * (y % 3 == 0)\r\nx2 = 4 * xg - 1\r\ny2 = 4 * yg - 1\r\nx1 = x2 - 3\r\ny1 = y2 - 3\r\nif not(color(x1, y1, x2, y2)):\r\n\tcolor(0, 0, 11, 10)\r\nfor i in range(len(field)):\r\n\tfor j in range(len(field[i])):\r\n\t\tprint(field[i][j], end = '')\r\n\tprint()", "'''\r\nst = '1.1 1.2 1.3\\n' \\\r\n '2.1 2.2 2.3\\n' \\\r\n '3.1 3.2 3.3\\n' \\\r\n '\\n' \\\r\n '4.1 4.2 4.3\\n' \\\r\n '5.1 5.2 5.3\\n' \\\r\n '6.1 6.2 6.3\\n' \\\r\n '\\n' \\\r\n '721 752 783\\n' \\\r\n '821 852 883\\n' \\\r\n '921 952 983\\n'\r\nxlast = 3\r\nylast = 6\r\n'''\r\n\r\ndef print_pole():\r\n s = ''\r\n for i in range(1, 10):\r\n sti = []\r\n for j in range(3):\r\n sti.append(''.join(pole[i][j]))\r\n s += ' '.join(sti) + '\\n'\r\n if (i == 3) or (i == 6):\r\n s += '\\n'\r\n print(s)\r\n\r\nst = ''\r\nfor i in range(11):\r\n st += input() + ' '\r\n#print(st)\r\nylast, xlast = map(int,input().split())\r\n\r\npole = [0]\r\npole = [0]*10\r\nL = st.split()\r\nk = 0\r\nfor i in range(1, 10):\r\n Li = []\r\n for j in range(3):\r\n Lij = list(L[k])\r\n k += 1\r\n Li.append(Lij)\r\n pole[i] = Li\r\n\r\ndef x0(x):\r\n if x % 3:\r\n return (x % 3) - 1\r\n else:\r\n return 2\r\n\r\ndef y0(y):\r\n if y % 3:\r\n return 1 + (y % 3 - 1) * 3\r\n else:\r\n return 7\r\n\r\nyl, xl = y0(ylast), x0(xlast)\r\nfree = False\r\nfor si in range(3):\r\n for i in range(3):\r\n if pole[yl + si][xl][i] == '.':\r\n pole[yl + si][xl][i] = '!'\r\n free = True\r\n\r\nif not free:\r\n for si in range(1, 10):\r\n for j in range(3):\r\n for k in range(3):\r\n if pole[si][j][k] == '.':\r\n pole[si][j][k] = '!'\r\n\r\n\r\n#print('free=', free)\r\nprint_pole()", "l=[]\r\nfor i in range(11):\r\n l.append(input())\r\nx,y=map(int,input().split())\r\nif x>=4 and x<=6:\r\n x-=3\r\nelif x>=7:\r\n x-=6\r\nif y>=4 and y<=6:\r\n y-=3\r\nelif y>=7:\r\n y-=6\r\nif x==1:\r\n p=0\r\nelif x==2:\r\n p=4\r\nelif x==3:\r\n p=8 \r\nif y==1:\r\n p2=0\r\nelif y==2:\r\n p2=4\r\nelif y==3:\r\n p2=8\r\ncom=0\r\nfor i in range(p,p+3):\r\n for j in range(p2,p2+3):\r\n if l[i][j]=='.':\r\n com+=1\r\nif com==0:\r\n for i in (0,1,2,4,5,6,8,9,10):\r\n if i ==4 or i==8:\r\n print()\r\n for j in range(11):\r\n if l[i][j]=='.':\r\n print(\"!\",end=\"\")\r\n else:\r\n print(l[i][j],end=\"\")\r\n print()\r\nelse:\r\n for i in (0,1,2,4,5,6,8,9,10):\r\n if i==4 or i==8:\r\n print()\r\n for j in range(11):\r\n if i>=p and i < p+3 and j >= p2 and j < p2+3:\r\n if l[i][j]=='.':\r\n print(\"!\",end=\"\")\r\n else:\r\n print(l[i][j],end=\"\")\r\n else:\r\n print(l[i][j],end=\"\")\r\n print()", "ul,um,ur,ml,mm,mr,ll,lm,lr=[],[],[],[],[],[],[],[],[]\r\nfor i in range(3):\r\n l=input().split()\r\n ul.append(l[0])\r\n um.append(l[1])\r\n ur.append(l[2])\r\n\r\ninput()\r\nfor i in range(3):\r\n l=input().split()\r\n ml.append(l[0])\r\n mm.append(l[1])\r\n mr.append(l[2])\r\ninput()\r\nfor i in range(3):\r\n l=input().split()\r\n ll.append(l[0])\r\n lm.append(l[1])\r\n lr.append(l[2])\r\nx,y=map(int,input().split())\r\n\r\nx=((x-1)%3)+1\r\ny=((y-1)%3)+1\r\nl=[]\r\nl.append([ul,um,ur])\r\nl.append([ml,mm,mr])\r\nl.append([ll,lm,lr])\r\nflag=0\r\nfor ele in l[x-1][y-1]:\r\n for ele2 in ele:\r\n if ele2=='.':\r\n flag=1\r\nfor i in range(3):\r\n for j in range(3):\r\n if l[x-1][y-1][i][j]=='.':\r\n l[x-1][y-1][i]=l[x-1][y-1][i][:j]+'!'+l[x-1][y-1][i][j+1:]\r\n#print(l)\r\nif flag==0:\r\n for i1 in range(3):\r\n for j1 in range(3):\r\n for i in range(3):\r\n for j in range(3):\r\n if l[i1][j1][i][j]=='.':\r\n l[i1][j1][i]=l[i1][j1][i][:j]+'!'+l[i1][j1][i][j+1:]\r\n#print(*l,sep='\\n') \r\n \r\nfor i in range(3):\r\n for j in range(3):\r\n print(l[i][0][j],l[i][1][j],l[i][2][j])\r\n print(\"\")\r\n\r\n\r\n", "M = []\nM.append(list(input().replace(' ','')))\nM.append(list(input().replace(' ','')))\nM.append(list(input().replace(' ','')))\ninput()\nM.append(list(input().replace(' ','')))\nM.append(list(input().replace(' ','')))\nM.append(list(input().replace(' ','')))\ninput()\nM.append(list(input().replace(' ','')))\nM.append(list(input().replace(' ','')))\nM.append(list(input().replace(' ','')))\n\ny,x = [int(x)-1 for x in input().split()]\n\nlx = 3*(x%3)\nly = 3*(y%3)\n\nfull = True\nfor x in range(3):\n for y in range(3):\n if M[ly+x][lx+y] == '.':\n M[ly+x][lx+y] = '!'\n full = False\n\n# God I hate this output formatting...\nif full:\n i = 0\n for m in M:\n s = ''.join(m).replace('.','!')\n print(s[:3],s[3:6],s[6:])\n i += 1\n if i == 3 or i == 6: print()\n\nelse:\n i = 0\n for m in M:\n s = ''.join(m)\n print(s[:3],s[3:6],s[6:])\n i += 1\n if i == 3 or i == 6: print()\n", "import sys\n\n\nclass XO:\n\n def __init__(self):\n self.state = []\n self.x = 0\n self.y = 0\n self.last_player = 0\n\n def add_line(self, line: str):\n state_line = []\n for n in range(9):\n pos = n // 3 + n\n char = line[pos]\n if char == 'x':\n state_line.append(1)\n elif char == 'o':\n state_line.append(2)\n else:\n state_line.append(0)\n self.state.append(state_line)\n\n def __str__(self):\n lines = []\n n = 0\n for state_line in self.state:\n if n == 3 or n == 6:\n lines.append(\"\")\n n += 1\n line = \"\"\n for pos in range(9):\n if pos == 3 or pos == 6:\n line += \" \"\n value = state_line[pos]\n if value == 3:\n line += \"!\"\n elif value == 2:\n line += \"o\"\n elif value == 1:\n line += \"x\"\n else:\n line += \".\"\n lines.append(line)\n return \"\\n\".join(lines)\n\n def set_xy(self, row, col):\n self.x = col - 1\n self.y = row - 1\n self.last_player = self.state[self.y][self.x]\n\n def mini_has_empty_cells(self, mini_x, mini_y):\n st_x = mini_x * 3\n st_y = mini_y * 3\n for y in range(3):\n for x in range(3):\n if self.state[st_y + y][st_x + x] == 0:\n return True\n return False\n\n def fill_mini(self, mini_x, mini_y):\n st_x = mini_x * 3\n st_y = mini_y * 3\n for y in range(3):\n for x in range(3):\n if self.state[st_y + y][st_x + x] == 0:\n self.state[st_y + y][st_x + x] = 3\n\n def fill_all(self):\n for y in range(9):\n for x in range(9):\n if self.state[y][x] == 0:\n self.state[y][x] = 3\n\n def process(self):\n mini_x = self.x % 3\n mini_y = self.y % 3\n if self.mini_has_empty_cells(mini_x, mini_y):\n self.fill_mini(mini_x, mini_y)\n else:\n self.fill_all()\n pass\n\n\nxo = XO()\nxo.add_line(input())\nxo.add_line(input())\nxo.add_line(input())\ninput()\nxo.add_line(input())\nxo.add_line(input())\nxo.add_line(input())\ninput()\nxo.add_line(input())\nxo.add_line(input())\nxo.add_line(input())\nxy = input().split(\" \")\nxo.set_xy(int(xy[0]), int(xy[1]))\nxo.process()\nprint(xo)\n", "a = []\r\nfor i in range(11):\r\n f = input()\r\n if i != 3 and i != 7:\r\n a.append(f[:3] + f[4:7] + f[8:])\r\nx, y = map(int, input().split())\r\nx1 = x % 3\r\ny1 = y % 3\r\nif x1 == 0:\r\n x1 = 3\r\nif y1 == 0:\r\n y1 = 3\r\nbl = False\r\nfor i in range(3 * (x1 - 1), 3 * x1):\r\n for j in range(3 * (y1 - 1), 3 * y1):\r\n if a[i][j] == \".\":\r\n bl = True\r\n a[i] = a[i][:j] + \"!\" + a[i][j + 1:]\r\nif bl:\r\n for i in range(9):\r\n s = \"\"\r\n for j in range(9):\r\n if j % 3 == 0 and j != 0:\r\n s += \" \"\r\n s += a[i][j]\r\n if i % 3 == 0 and i != 0:\r\n print()\r\n print(s)\r\nelse:\r\n for i in range(9):\r\n s = \"\"\r\n for j in range(9):\r\n if j % 3 == 0 and j != 0:\r\n s += \" \"\r\n if a[i][j] == \".\":\r\n s += \"!\"\r\n else:\r\n s += a[i][j]\r\n if i % 3 == 0 and i != 0:\r\n print()\r\n print(s)\r\n", "field = [ [ '.' for i in range(9) ] for j in range(9) ]\r\n\r\nfor l in range(3):\r\n for m in range(3):\r\n str = input().split(\" \")\r\n for j in range(3):\r\n for k in range(3):\r\n field[l*3 + m][j*3 + k] = str[j][k]\r\n temp = input()\r\n\r\nx,y = temp.split(\" \")\r\nx = (int(x)-1)%3\r\ny = (int(y)-1)%3\r\n\r\nflag = False\r\nfor i in range(x*3, x*3+3):\r\n for j in range(y*3, y*3+3):\r\n if(field[i][j] == '.'):\r\n flag = True\r\n field[i][j] = '!'\r\n\r\nif flag == False:\r\n for i in range(9):\r\n for j in range(9):\r\n if(field[i][j] == '.'):\r\n field[i][j] = '!'\r\n\r\nfor l in range(3):\r\n for m in range(3):\r\n for j in range(3):\r\n for k in range(3):\r\n print(field[l*3 + m][j*3 + k], end=\"\")\r\n print(\" \", end=\"\")\r\n print()\r\n print()\r\n\r\n\r\n", "board = []\r\nfor i in range(11):\r\n n = input()\r\n if n != \"\":\r\n board.append(n.split())\r\n\r\na, b = list(map(int, input().split()))\r\na -= 1\r\nb -= 1\r\ns = b\r\n\r\nnew_board = []\r\nfor i in range(9):\r\n new_board.append([])\r\n for j in range(3):\r\n for u in range(3):\r\n new_board[i].append(board[i][j][u])\r\n\r\nisit = 0\r\nfor a in range(a % 3 * 3, a % 3 * 3 + 3):\r\n for b in range(s % 3 * 3, s % 3 * 3 + 3):\r\n if new_board[a][b] == '.':\r\n isit = 1\r\n new_board[a][b] = \"!\"\r\nif isit == 0:\r\n for i in range(9):\r\n for j in range(9):\r\n if new_board[i][j] == '.':\r\n new_board[i][j] = '!'\r\nfor i in range(9):\r\n for j in range(9):\r\n print(new_board[i][j], end='')\r\n if j % 3 == 2:\r\n print(' ', end='') \r\n print()\r\n if i % 3 == 2:\r\n print()", "import sys\nsys.setrecursionlimit(1000000)\nread = sys.stdin.readline\n\nfield = [\"\" for _ in range(9)]\n\nfor i in range(3):\n for j in range(3):\n try:\n l, m, r = read().strip().split()\n except ValueError:\n l, m, r = read().strip().split()\n field[i*3] += l\n field[i*3+1] += m\n field[i*3+2] += r\n\nx, y = map(int, read().split())\nidx = (x-1)//3 * 3 + (y-1)//3\ninIdx = (x-1)%3 * 3 + (y-1)%3\n\nif '.' in field[inIdx]:\n field[inIdx] = field[inIdx].replace('.', '!')\nelse:\n for i in range(len(field)):\n field[i] = field[i].replace('.', '!')\n\nfor i in range(3):\n for j in range(3):\n print(field[i*3][j*3: j*3+3], field[i*3+1][j*3: j*3+3], field[i*3+2][j*3: j*3+3])\n if i in (0, 1,):\n print('')", "dy = 0\r\ndx = 0\r\nok = 0\r\nv = []\r\n\r\nfor i in range(11):\r\n\tx = list(''.join(input().split()))\r\n\tif (len(x) > 0):\r\n\t\tv.append(x)\r\n\r\ny, x = map(int, input().split())\r\n\r\nif (y%3 == 1): dy = 0\r\nelif (y%3 == 2): dy = 3\r\nelse: dy = 6\r\n\r\nif (x%3 == 1): dx = 0\r\nelif (x%3 == 2): dx = 3\r\nelse: dx = 6\r\n\r\nfor i in range(dy, dy+3):\r\n\tfor j in range(dx, dx+3):\r\n\t\tif (v[i][j] == '.'): ok = 1\r\n\r\nif (ok == 0):\r\n\tfor i in range(9):\r\n\t\tif (i > 0 and i%3 == 0): print()\r\n\t\tfor j in range(9):\r\n\t\t\tif (j > 0 and j%3 == 0): print(end = ' ')\r\n\t\t\tif (v[i][j] == '.'): print('!', end = '')\r\n\t\t\telse: print(v[i][j], end = '')\r\n\t\tprint()\r\n\texit(0)\r\n\r\nfor i in range(dy, dy+3):\r\n\tfor j in range(dx, dx+3):\r\n\t\tif (v[i][j] == '.'): v[i][j] = '!'\r\n\r\nfor i in range(9):\r\n\tif (i > 0 and i%3 == 0): print()\r\n\tfor j in range(9):\r\n\t\tif (j > 0 and j%3 == 0): print(end = ' ')\r\n\t\tprint(v[i][j], end = '')\r\n\tprint()\r\n\r\nexit(0)", "A = []\r\nfor i in range(9):\r\n A.append(list(\"\".join(input().split())))\r\n if i % 3 == 2 and i != 8:\r\n input()\r\nx, y = map(int, input().split())\r\nx, y = x - 1, y - 1\r\nx, y = x % 3 * 3, y % 3 * 3\r\nnum = 0\r\nfor i in range(x, x + 3):\r\n for j in range(y, y + 3):\r\n if A[i][j] == \".\":\r\n num += 1\r\n A[i][j] = \"!\"\r\nif num == 0:\r\n for i in range(9):\r\n for j in range(9):\r\n if A[i][j] == \".\":\r\n A[i][j] = \"!\"\r\nfor i in range(9):\r\n print(\"\".join(A[i][:3]), \"\".join(A[i][3:6]), \"\".join(A[i][6:]))\r\n if i % 3 == 2:\r\n print(\"\")\r\n\r\n\r\n \r\n", "import collections, math\r\n\r\nlocal = False\r\nif local:\r\n file = open(\"inputt.txt\", \"r\")\r\n\r\ndef inp():\r\n if local:\r\n return file.readline().rstrip()\r\n else:\r\n return input().rstrip()\r\n\r\ndef ints():\r\n return [int(_) for _ in inp().split()]\r\n\r\n\r\nfromTos = [(0,2), (3,5), (6,8)]\r\n\r\ngrid = []\r\n\r\nfor i in range(0, 9):\r\n if i%3==0 and i!=0:\r\n inp()\r\n row = inp()\r\n\r\n grid.append([])\r\n\r\n for colbig in row.split():\r\n grid[-1].append([])\r\n\r\n for sign in colbig:\r\n grid[-1][-1].append(sign)\r\n\r\nx, y = ints()\r\n\r\nx = (x-1)%3\r\ny = (y-1)%3\r\n\r\nfoundFree = False\r\n\r\nfor i in range(x*3, x*3+3):\r\n for k in range(0,3):\r\n val = grid[i][y][k]\r\n\r\n if val != 'x' and val != 'o':\r\n foundFree = True\r\n grid[i][y][k] = \"!\"\r\n\r\nif not foundFree:\r\n for i in range(0, 9):\r\n for j in range(0,3):\r\n for k in range(0,3):\r\n val = grid[i][j][k]\r\n\r\n if val != 'x' and val != 'o':\r\n grid[i][j][k] = \"!\"\r\n\r\nfor i in range(0, 3):\r\n row = \"\"\r\n for j in range(0, 3):\r\n row += \"\".join(grid[i][j])\r\n if j<2:\r\n row += \" \"\r\n \r\n print(row)\r\n\r\nprint(\"\")\r\nfor i in range(3, 6):\r\n row = \"\"\r\n for j in range(0, 3):\r\n row += \"\".join(grid[i][j])\r\n if j<2:\r\n row += \" \"\r\n print(row)\r\n\r\nprint(\"\")\r\nfor i in range(6, 9):\r\n row = \"\"\r\n for j in range(0, 3):\r\n row += \"\".join(grid[i][j])\r\n if j<2:\r\n row += \" \"\r\n\r\n print(row) \r\n\r\nprint(\"\")", "pole = [[], [], [], [], [], [], [], [], []]\r\nfor i in range(3):\r\n for k in range(3):\r\n a = input().split()\r\n pole[i * 3].append(a[0])\r\n pole[i * 3 + 1].append(a[1])\r\n pole[i * 3 + 2].append(a[2])\r\n k = input()\r\nk = list(map(int, k.split()))\r\ni1 = (k[0] - 1) % 3\r\ni2 = (k[1] - 1) % 3\r\nix = i1 * 3 + i2\r\nif '.' not in ''.join(pole[ix]):\r\n for i in range(9):\r\n for k in range(3):\r\n n = ''\r\n for l in list(pole[i][k]):\r\n if l == '.':\r\n n += '!'\r\n else:\r\n n += l\r\n pole[i][k] = n\r\nelse:\r\n for i in range(3):\r\n n = ''\r\n for l in list(pole[ix][i]):\r\n if l == '.':\r\n n += '!'\r\n else:\r\n n += l\r\n pole[ix][i] = n \r\nfor i in range(3):\r\n for k in range(3):\r\n print(pole[i * 3][k], pole[i * 3 + 1][k], pole[i * 3 + 2][k])\r\n print()\r\n ", "s=[]\r\nk1=[]\r\nk2=[]\r\nk3=[]\r\nk4=[]\r\nk5=[]\r\nk6=[]\r\nk7=[]\r\nk8=[]\r\nk9=[]\r\nf=0\r\n\r\nfor i in range(11):\r\n s.append(input())\r\n\r\nfor i in range(len(s)):\r\n if i!=3 and i!=7:\r\n t1, t2, t3 = s[i].split()\r\n if i < 3:\r\n k1.append(t1)\r\n k2.append(t2)\r\n k3.append(t3)\r\n elif i > 3 and i < 7:\r\n k4.append(t1)\r\n k5.append(t2)\r\n k6.append(t3)\r\n elif i>7:\r\n k7.append(t1)\r\n k8.append(t2)\r\n k9.append(t3)\r\n\r\ny,x=map(int,input().split())\r\n\r\nwhile y>3:\r\n y-=3\r\n\r\nwhile x>3:\r\n x-=3\r\n\r\nif y==1:\r\n if x==1:\r\n f=1\r\n if x==2:\r\n f=2\r\n if x==3:\r\n f=3\r\nif y==2:\r\n if x==1:\r\n f=4\r\n if x==2:\r\n f=5\r\n if x==3:\r\n f=6\r\nif y==3:\r\n if x==1:\r\n f=7\r\n if x==2:\r\n f=8\r\n if x==3:\r\n f=9\r\n\r\nk=0\r\nflag=0\r\nif f==1:\r\n for i in k1:\r\n k1[k]=i.replace('.','!')\r\n if '.' in i:\r\n flag=1\r\n k+=1\r\n\r\nif f==2:\r\n for i in k2:\r\n k2[k]=i.replace('.','!')\r\n if '.' in i:\r\n flag=1\r\n k+=1\r\n\r\nif f==3:\r\n for i in k3:\r\n k3[k]=i.replace('.','!')\r\n if '.' in i:\r\n flag=1\r\n k+=1\r\n\r\nif f==4:\r\n for i in k4:\r\n k4[k]=i.replace('.','!')\r\n if '.' in i:\r\n flag=1\r\n k+=1\r\n\r\nif f==5:\r\n for i in k5:\r\n k5[k]=i.replace('.','!')\r\n if '.' in i:\r\n flag=1\r\n k+=1\r\n\r\nif f==6:\r\n for i in k6:\r\n k6[k]=i.replace('.','!')\r\n if '.' in i:\r\n flag=1\r\n k+=1\r\n\r\nif f==7:\r\n for i in k7:\r\n k7[k]=i.replace('.','!')\r\n if '.' in i:\r\n flag=1\r\n k+=1\r\n\r\nif f==8:\r\n for i in k8:\r\n k8[k]=i.replace('.','!')\r\n if '.' in i:\r\n flag=1\r\n k+=1\r\n\r\nif f==9:\r\n for i in k9:\r\n k9[k]=i.replace('.','!')\r\n if '.' in i:\r\n flag=1\r\n k+=1\r\n\r\nif flag==0:\r\n for i in range(3):\r\n k1[i] = k1[i].replace('.','!')\r\n k2[i] = k2[i].replace('.', '!')\r\n k3[i] = k3[i].replace('.', '!')\r\n k4[i] = k4[i].replace('.', '!')\r\n k5[i] = k5[i].replace('.', '!')\r\n k6[i] = k6[i].replace('.', '!')\r\n k7[i] = k7[i].replace('.', '!')\r\n k8[i] = k8[i].replace('.', '!')\r\n k9[i] = k9[i].replace('.', '!')\r\n\r\nprint(k1[0],k2[0],k3[0],sep=' ')\r\nprint(k1[1],k2[1],k3[1],sep=' ')\r\nprint(k1[2],k2[2],k3[2],sep=' ')\r\nprint()\r\nprint(k4[0],k5[0],k6[0],sep=' ')\r\nprint(k4[1],k5[1],k6[1],sep=' ')\r\nprint(k4[2],k5[2],k6[2],sep=' ')\r\nprint()\r\nprint(k7[0],k8[0],k9[0],sep=' ')\r\nprint(k7[1],k8[1],k9[1],sep=' ')\r\nprint(k7[2],k8[2],k9[2],sep=' ')", "a = []\r\nfor i in range(11):\r\n if i == 3 or i == 7:\r\n input()\r\n else:\r\n x, y, z = map(str, input().split())\r\n a.append(list(x + y + z))\r\nx, y = map(int, input().split())\r\nif x % 3 == 0:\r\n u = 6\r\n d = 8\r\nelif x % 3 == 2:\r\n u = 3\r\n d = 5\r\nelse:\r\n u = 0\r\n d = 2\r\nif y % 3 == 0:\r\n l = 6\r\n r = 8\r\nelif y % 3 == 2:\r\n l = 3\r\n r = 5\r\nelse:\r\n l = 0\r\n r = 2\r\nempty = False\r\nfor i in range(u, d + 1):\r\n for j in range(l, r + 1):\r\n if a[i][j] == '.':\r\n empty = True\r\n a[i][j] = '!'\r\nif not empty:\r\n for i in range(9):\r\n for j in range(9):\r\n if a[i][j] == '.':\r\n a[i][j] = '!'\r\nfor i in range(9):\r\n if i == 3 or i == 6:\r\n print()\r\n print(''.join(map(str, a[i][0:3])), ''.join(map(str, a[i][3:6])), ''.join(map(str, a[i][6:9])))\r\n", "field = [[0] for i in range(11)]\r\nfor i in range(11):\r\n field[i] = input().replace(\" \", \"\")\r\nsave = field\r\nfield = []\r\nfor i in range(11):\r\n if(save[i] != \"\"):\r\n field.append([])\r\n for j in range(9):\r\n field[len(field) - 1].append(save[i][j])\r\nx, y = map(int, input().split())\r\nx, y = x - 1, y - 1\r\nx1 = x % 3 * 3 + 1\r\ny1 = y % 3 * 3 + 1\r\nmark = False\r\nfor i in range(-1, 2):\r\n for j in range(-1, 2):\r\n if(field[x1 + i][y1 + j] == \".\"):\r\n mark = True\r\n field[x1 + i][y1 + j] = \"!\"\r\nif not mark:\r\n for i in range(9):\r\n for j in range(9):\r\n if(field[i][j] == \".\"):\r\n field[i][j] = \"!\"\r\n \r\nfor i in range(9):\r\n for j in range(9):\r\n print(field[i][j], end=\"\")\r\n if((j + 1) % 3 == 0):\r\n print(end=\" \")\r\n if((i + 1) % 3 == 0):\r\n print()\r\n print()\r\n \r\n\r\n", "field = []\n\nfor i in range(3):\n for j in range(3):\n field.append(list(map(list, input().split())))\n\n if i != 2:\n input()\n\ny, x = map(int, input().split())\n\nx -= 1\ny -= 1\n\nf_x, f_y = x % 3, y % 3\n\nplaced_at_point = False\n\nfor i in range(f_y*3, f_y*3+3):\n for j in range(3):\n if field[i][f_x][j] == '.':\n field[i][f_x][j] = '!'\n placed_at_point = True\n\n\nif not placed_at_point:\n for i in range(9):\n for j in range(3):\n for k in range(3):\n if field[i][j][k] == '.':\n field[i][j][k] = '!'\n\nfor i in range(9):\n s = ''\n for j in field[i]:\n for k in j:\n s += k\n s += ' '\n print(s)\n if (i+1) % 3 == 0:\n print()", "a=[]\r\nfor i in range(11):\r\n mas=[]\r\n s=input().split()\r\n if not s:\r\n continue\r\n for l in s:\r\n for i in range(3):\r\n mas.append(l[i])\r\n a.append(mas)\r\ngo=True\r\nx,y=map(int,input().split())\r\nx=(x-1)%3\r\ny=(y-1)%3\r\nfor i in range(x*3,x*3+3):\r\n for k in range(y*3,y*3+3):\r\n if a[i][k]=='.':\r\n a[i][k]='!'\r\n go=False\r\nif go:\r\n for i in range(9):\r\n for k in range(9):\r\n if a[i][k]=='.':\r\n a[i][k]='!'\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(3):\r\n for c in range(3):\r\n print(a[i*3+j][k*3+c],end='')\r\n print(' ',sep='',end='')\r\n print()\r\n print()\r\n", "l=[[0]*9 for i in range(9)]\r\nfor i in range(11):\r\n s=input()\r\n if i%4!=3:\r\n for j in range(11):\r\n if j%4!=3:\r\n l[i-i//4][j-j//4]=s[j]\r\nb,a=map(int,input().split())\r\na=(a-1)%3\r\nb=(b-1)%3\r\nh=0\r\nfor i in range(3*b,3*(b+1)):\r\n for j in range(3*a,3*(a+1)):\r\n if l[i][j]=='.':\r\n h+=1\r\n l[i][j]='!'\r\nif h==0:\r\n for i in range(9):\r\n for j in range(9):\r\n if l[i][j]=='.':\r\n h+=1\r\n l[i][j]='!' \r\n\r\n\r\nfor i in range(9):\r\n if i%3==0 and i>0:\r\n print('')\r\n s=''\r\n for j in range(9):\r\n if j%3==0 and j>0:\r\n s+=' '\r\n s+=l[i][j]\r\n print(s)", "def get3x3():\n return [[0 for _ in range(3)] for _ in range(3)]\n\nmats=[[get3x3() for __ in range(3)] for _ in range(3)]\n\nfor i in range(11):\n lines=input().split()\n if i==3 or i==7:\n continue\n cnt=i\n if i>3:\n cnt-=1\n if i>7:\n cnt-=1\n for j in range(3):\n mats[cnt//3][j][cnt%3]=list(lines[j])\n\nx0,y0=map(int,input().split())\n\n\nx0-=1\ny0-=1\n\ncx=x0%3\ncy=y0%3\n\ndef check(cx,cy):\n for i in range(3):\n for j in range(3):\n if mats[cx][cy][i][j]=='.':\n return True\n return False\n\ndef mark(cx,cy):\n for i in range(3):\n for j in range(3):\n if mats[cx][cy][i][j]=='.':\n mats[cx][cy][i][j]='!'\nif check(cx,cy):\n mark(cx,cy)\nelse:\n for tx in range(3):\n for ty in range(3):\n mark(tx,ty)\n\n\n\nfor i in range(11):\n if i==3 or i==7:\n print()\n continue\n cnt=i\n if i>3:\n cnt-=1\n if i>7:\n cnt-=1\n for j in range(3):\n print(''.join(mats[cnt//3][j][cnt%3]),end='')\n if j<3:\n print(end=' ')\n print()\n\n", "import sys\r\nboard = [list(input().replace(\" \",\"\")) for i in range(11)]\r\ndel board[7]\r\ndel board[3]\r\ny,x=map(int,input().split())\r\ny-=1\r\nx-=1\r\nflag=True\r\npy=y%3\r\npx=x%3\r\nfor i in range(3):\r\n for j in range(3):\r\n if board[py*3+i][px*3+j]==\".\":\r\n flag=False\r\nif flag:\r\n for i in range(9):\r\n for j in range(9):\r\n if board[i][j]==\".\":\r\n board[i][j]=\"!\"\r\nelse:\r\n for i in range(3):\r\n for j in range(3):\r\n if board[py*3+i][px*3+j]==\".\":\r\n board[py*3+i][px*3+j]=\"!\"\r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(3):\r\n if k>0:\r\n print(\" \",end=\"\")\r\n for l in range(3):\r\n print(board[3*i+j][3*k+l],end=\"\")\r\n print(\"\")\r\n if i<2:\r\n print(\"\")", "R=input\r\ng=[list(R()) for _ in range(11)]\r\nr,c=map(int,R().split())\r\nr,c=(r-1)%3*4,(c-1)%3*4\r\nf,d='.!'\r\nfor i in range(9):\r\n s=g[r+i//3]\r\n if s[c+i%3]=='.':\r\n s[c+i%3]=f=d\r\nfor v in g:print(''.join(v).replace(f,d))", "l=[input() for _ in range(11)]\r\nx,y=map(int, input().split())\r\nx-=1\r\nx+=x//3\r\ny-=1\r\ny+=y//3\r\na,b=x%4*4,y%4*4\r\nf=1\r\nfor i in range(a,a+3):\r\n r=l[i][b:b+3].replace('.','!')\r\n if r!=l[i][b:b+3]:\r\n l[i]=l[i][:b]+r+l[i][b+3:]\r\n f=0\r\nif f:\r\n for i in range(11):\r\n l[i]=l[i].replace('.','!')\r\nprint(*l,sep='\\n')\r\n", "def please_die(x):\n if x % 3 == 0:\n align_x = 2\n elif x % 3 == 1:\n align_x = 0\n else:\n align_x = 1\n return align_x\n\nmas = []\ns = []\nss = ''\nfor i in range(11):\n nn = input()\n if nn != '':\n s += nn.split(' ')\n ss += nn.replace(' ', '')\n\nx, y = map(int, input().split())\n\nmas.append(s[0]+s[3]+s[6])\nmas.append(s[1]+s[4]+s[7])\nmas.append(s[2]+s[5]+s[8])\n\nmas.append(s[9]+s[12]+s[15])\nmas.append(s[10]+s[13]+s[16])\nmas.append(s[11]+s[14]+s[17])\n\nmas.append(s[18]+s[21]+s[24])\nmas.append(s[19]+s[22]+s[25])\nmas.append(s[20]+s[23]+s[26])\n\nalign_x = -1\nalign_y = -1\n\n\nalign_x = please_die(x)\n\nalign_y = please_die(y)\n\nwhat_a_square = align_x * 3 + align_y\nif '.' in mas[what_a_square]:\n j = 0\n for i in s:\n xxx = j // 9 + 1\n yyy = j % 9 + 1\n if please_die(xxx) == align_x and please_die(yyy) == align_y:\n print(i.replace('.', '!'), end=' ')\n else:\n print(i, end=' ')\n j += 1\n if j % 3 == 0:\n print()\n if j % 9 == 0:\n print()\nelse:\n #all\n j = 0\n for i in s:\n print(i.replace('.','!'), end=' ')\n j += 1\n if j % 3 == 0:\n print()\n if j % 9 == 0:\n print()\n", "def main():\n ls = []\n for i in range(11):\n l = list(filter(lambda c: c != ' ', input()))\n if l:\n ls.append(l)\n\n r, c = list(map(lambda c: int(c) - 1, input().split(' ')))\n\n flag = False\n cr, cc = r % 3, c % 3\n for i in range(cr * 3, cr * 3 + 3):\n for j in range(cc * 3, cc * 3 + 3):\n if ls[i][j] not in ['x', 'o']:\n ls[i][j] = '!'\n flag = True\n \n if not flag:\n for i in range(9):\n for j in range(9):\n if ls[i][j] not in ['x', 'o']:\n ls[i][j] = '!'\n\n for i in range(3):\n for j in range(3):\n l = ls[i * 3 + j]\n print(' '.join(map(lambda xx: ''.join(xx), [l[0:3], l[3:6], l[6:9]])))\n print('')\n\nmain()\n", "field = list(filter(lambda l: l is not None, [input().strip().replace(' ', '') if (i not in [3, 7]) else (input(), None)[1] for i in range(11)]))\ny, x = map(int, input().split())\n\nx -= 1\ny -= 1\n\nx = (x % 3)\ny = (y % 3)\n\nflag = False\nfor i in range(y*3, y*3 + 3):\n mut = list(field[i])\n for u in range(x*3, x*3 + 3):\n if mut[u] == '.':\n flag = True\n mut[u] = '!'\n field[i] = ''.join(mut)\n\nif not flag:\n for i in range(len(field)):\n field[i] = field[i].replace('.', '!')\n\nfor u in range(len(field)):\n if u in [3, 6]:\n print()\n i = field[u]\n print('{} {} {}'.format(i[:3], i[3:6], i[6:]))\n", "board = []\r\nfor i in range(11):\r\n a = input().replace(' ', '')\r\n if a != '':\r\n board.append([i for i in a])\r\ncheck = 1\r\ny, x = map(int, input().split())\r\nx -= 1\r\ny -= 1\r\nsign = board[y][x]\r\nfor i in range((y%3)*3, (y%3)*3 + 3):\r\n for j in range((x%3)*3, (x%3)*3 +3):\r\n if board[i][j] == '.':\r\n check = 0\r\n board[i][j] = '!'\r\nif check:\r\n for i in range(9):\r\n for j in range(9):\r\n if board[i][j] == '.':\r\n board[i][j] = '!'\r\nfor i in range(9):\r\n print(''.join(board[i][:3]), ''.join(board[i][3:6]), ''.join(board[i][6:]))\r\n if i%3 == 2:\r\n print()\r\n", "l=[input() for _ in range(11)]\r\nx,y=map(int, input().split())\r\nx-=1\r\nx+=x//3\r\ny-=1\r\ny+=y//3\r\na,b=x%4*4,y%4*4\r\nr=11\r\nfor i in range(a,a+3):\r\n s=l[i][b:b+3]\r\n if '.' in s:\r\n l[i],r=l[i][:b]+s.replace('.','!')+l[i][b+3:],0\r\nfor i in range(r):\r\n l[i]=l[i].replace('.','!')\r\nprint(*l,sep='\\n')\r\n", "matrix = []\r\nmatrix.append(''.join(input().split()))\r\nmatrix.append(''.join(input().split()))\r\nmatrix.append(''.join(input().split()))\r\ninput()\r\nmatrix.append(''.join(input().split()))\r\nmatrix.append(''.join(input().split()))\r\nmatrix.append(''.join(input().split()))\r\ninput()\r\nmatrix.append(''.join(input().split()))\r\nmatrix.append(''.join(input().split()))\r\nmatrix.append(''.join(input().split()))\r\nx, y = map(int, input().split())\r\nx -= 1\r\ny -= 1\r\nflag = True\r\nfor i in range(x % 3 * 3, x % 3 * 3 + 3):\r\n for j in range(y % 3 * 3, y % 3 * 3 + 3):\r\n if matrix[i][j] == '.':\r\n flag = False\r\n matrix[i] = matrix[i][:j] + '!' + matrix[i][j + 1:]\r\nif flag:\r\n for i in range(9):\r\n for j in range(9):\r\n if matrix[i][j] == '.':\r\n matrix[i] = matrix[i][:j] + '!' + matrix[i][j + 1:]\r\nfor i in range(3):\r\n print(matrix[i][:3], matrix[i][3:6], matrix[i][6:9])\r\nprint()\r\nfor i in range(3, 6):\r\n print(matrix[i][:3], matrix[i][3:6], matrix[i][6:9])\r\nprint()\r\nfor i in range(6, 9):\r\n print(matrix[i][:3], matrix[i][3:6], matrix[i][6:9])\r\n", "R=input\r\ng=[list(R()) for _ in range(11)]\r\nr,c=map(lambda x:(x-1)%3*4,map(int,R().split()))\r\nf,d='.!'\r\nfor i in range(9):\r\n v,e=g[r+i//3],c+i%3\r\n if v[e]<'o':v[e]=f=d\r\nfor v in g:print(''.join(v).replace(f,d))\r\n", "a = [[[['.'] * 3 for i in range(3)] for i in range(3)] for i in range(3)]\r\n\r\nfor i in range(3):\r\n s = input().split()\r\n for j in range(3):\r\n for h in range(3):\r\n ch = s[j][h]\r\n a[0][j][i][h] = ch\r\nx = input()\r\nfor i in range(3):\r\n s = input().split()\r\n for j in range(3):\r\n for h in range(3):\r\n ch = s[j][h]\r\n a[1][j][i][h] = ch\r\nx = input()\r\nfor i in range(3):\r\n s = input().split()\r\n for j in range(3):\r\n for h in range(3):\r\n ch = s[j][h]\r\n a[2][j][i][h] = ch\r\n\r\nx, y = map(int, input().split())\r\nx = x % 3 - 1\r\ny = y % 3 - 1\r\n\r\nfl = True\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n if a[x][y][i][j] == '.':\r\n fl = False\r\n a[x][y][i][j] = '!'\r\n\r\nif fl:\r\n for x in range(3):\r\n for y in range(3):\r\n for i in range(3):\r\n for j in range(3):\r\n if a[x][y][i][j] == '.':\r\n a[x][y][i][j] = '!'\r\n\r\nfor i in range(3):\r\n for j in range(3):\r\n print(*a[0][j][i], sep='', end=' ')\r\n print()\r\nprint()\r\nfor i in range(3):\r\n for j in range(3):\r\n print(*a[1][j][i], sep='', end=' ')\r\n print()\r\nprint()\r\nfor i in range(3):\r\n for j in range(3):\r\n print(*a[2][j][i], sep='', end=' ')\r\n print()\r\n", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n \r\nA = []\r\nfor i in range(11):\r\n s = input()\r\n A.append([*s])\r\n\r\n#print(A)\r\nx,y = ilele()\r\nif x<= 3:\r\n i= x-1\r\nelif x <= 6:\r\n i = x\r\nelse:\r\n i = x+1\r\nif y<= 3:\r\n j= y-1\r\nelif y <= 6:\r\n j = y\r\nelse:\r\n j = y+1\r\n\r\n#print(i,j)\r\nf = 0\r\nif 0 <=i <= 2:\r\n a = 0;b = 2\r\nelif 4<= i <= 6:\r\n a = 4;b= 6\r\nelse:\r\n a = 8;b = 10\r\nif 0 <=j <= 2:\r\n c = 0;d = 2\r\nelif 4<= j <= 6:\r\n c = 4;d= 6\r\nelse:\r\n c = 8;d = 10\r\n#print(a,c)\r\n \r\nk1 = i -a\r\nk2 = j -c\r\n#print(k1,k2)\r\n\r\nif k1 == 0:\r\n a = 0;b = 2\r\nelif k1 == 1:\r\n a = 4;b= 6\r\nelse:\r\n a = 8;b = 10\r\nif k2 == 0:\r\n c = 0;d = 2\r\nelif k2 == 1:\r\n c = 4;d= 6\r\nelse:\r\n c = 8;d = 10\r\n\r\n\r\n \r\nfor l in range(a,b+1):\r\n for m in range(c,d+1):\r\n if A[l][m] == '.':\r\n f = 1\r\n A[l][m] = '!'\r\nif f == 0:\r\n for i in range(len(A)):\r\n if A[i]:\r\n for j in range(len(A[0])):\r\n if A[i][j] == '.':\r\n A[i][j] = \"!\"\r\nfor i in A:\r\n if i:\r\n print(\"\".join(i))\r\n else:\r\n print()\r\n \r\n \r\n \r\n\r\n", "array = []\r\nt = []\r\nm = []\r\nl = []\r\ntop = [0,3]\r\nmid =[3,6]\r\ndown = [6,9]\r\ndic ={'tt':[1,1],'tm':[1,2],'td':[1,0],'mt':[2,1],'mm':[2,2],'md':[2,0],'dt':[0,1],'dm':[0,2],'dd':[0,0]}\r\ndic2 ={'t':[0,3],'m':[3,6],'d':[6,9]}\r\nfor run in range(2):\r\n for _ in range(3):\r\n next = input().split()\r\n arr = [list(x) for x in next]\r\n temp = []\r\n for i in range(3):\r\n temp = temp+arr[i]\r\n array.append(temp[::])\r\n input()\r\nfor _ in range(3):\r\n next = input().split()\r\n arr = [list(x) for x in next]\r\n temp = []\r\n for i in range(3):\r\n temp = temp+arr[i]\r\n array.append(temp[::])\r\na,b = map(lambda x:int(x)%3,input().split())\r\nposition = ''\r\nfor k,v in dic.items():\r\n if a == v[0] and b==v[1]:\r\n position = k\r\n break\r\nloop1 = dic2.get(position[0])\r\nloop2 = dic2.get(position[1])\r\ncheck = 1\r\nfor i in range(loop1[0],loop1[1]):\r\n for j in range(loop2[0],loop2[1]):\r\n if array[i][j] == '.':\r\n check = 0\r\n array[i][j] = '!'\r\nif check:\r\n for i in range(9):\r\n for j in range(9):\r\n if array[i][j] =='.':\r\n array[i][j] = '!'\r\nfor i in range(0,3):\r\n print(''.join(array[i][0:3]),''.join(array[i][3:6]),''.join(array[i][6:9]))\r\nprint('')\r\nfor i in range(3,6):\r\n print(''.join(array[i][0:3]),''.join(array[i][3:6]),''.join(array[i][6:9]))\r\nprint('')\r\nfor i in range(6,9):\r\n print(''.join(array[i][0:3]),''.join(array[i][3:6]),''.join(array[i][6:9]))\r\nprint('')\r\n\r\n\r\n\r\n", "import sys\nimport string\n# # For getting input from input.txt file\n# sys.stdin = open('input.txt', 'r')\n\n# # Printing the Output to output.txt file\n# sys.stdout = open('output.txt', 'w')\n\narr = list(input().split(' ') for a in range(0, 11))\n\nfor a in arr:\n\tif len(a) == 1:\n\t\tarr.remove(a)\n\nn, m = map(int, input().split(' '))\n\nn = (n - 1) % 3 * 3\n\nm = (m - 1) % 3 * 3\n\nok = False\n\nfor i in range(0, 3):\n\tif arr[n + i][m // 3].find('.') != -1:\n\t\tarr[n + i][m // 3] = arr[n + i][m // 3].replace('.', '!')\n\t\tok = True\n\narr.insert(3, '')\narr.insert(7, '')\n\nif ok:\n\tfor a in arr:\n\t\tprint(' '.join(a))\nelse:\n\tfor a in arr:\n\t\tprint(' '.join(a).replace('.', '!'))\n\n", "# x is the first player\n# even number of chips means it is the first player turn\n# odd number of chips means it is the second player turn\nfrom sys import stdin, stdout\n\nb = stdin.readlines()\n\nx, y = [int(z) for z in b[-1].strip().split()]\n\nm = [list(l) for l in b[:-1]]\n# get in which smaller board we have to play\npos_x, pos_y = (x - 1) % 3, (y - 1) % 3\n# print pos_x, pos_y\n\n# check if there are any free spots\nfree = 0\nfor i in range(4 * pos_x, 4 * pos_x + 3):\n for j in range(4 * pos_y, 4 * pos_y + 3):\n if m[i][j] == '.':\n free += 1\n m[i][j] = '!'\n\nif free == 0:\n for l in m:\n stdout.write(''.join(l).replace('.', '!'))\nelse:\n for l in m:\n stdout.write(''.join(l))\nstdout.write('\\n')", "l = []\r\n\r\nfor _ in range(11):\r\n s = input().replace(' ', '')\r\n if len(s):\r\n l.append(list(s))\r\n\r\nx, y = map(int, input().split())\r\n\r\nx -= 1\r\ny -= 1\r\n\r\nx %= 3\r\ny %= 3\r\n\r\nok = False\r\n\r\nfor i in range(x * 3, x * 3 + 3):\r\n for j in range(y * 3, y * 3 + 3):\r\n if l[i][j] == '.':\r\n ok = True\r\n l[i][j] = '!'\r\n\r\nif not ok:\r\n for i in range(9):\r\n for j in range(9):\r\n if l[i][j] == '.':\r\n l[i][j] = '!'\r\n\r\nfor i in range(9):\r\n for j in range(9):\r\n print(l[i][j], end='')\r\n if j % 3 == 2:\r\n print(' ', end='')\r\n print()\r\n if i % 3 == 2:\r\n print()\r\n", "l = []\r\nfor i in range(11):\r\n l.append(list(input()))\r\nx, y = [int(i) for i in input().split()]\r\nif x <= 3:\r\n x -= 1\r\nif y <= 3:\r\n y -= 1\r\nif x >= 7:\r\n x += 1\r\nif y >= 7:\r\n y += 1\r\n\r\nstatus = True\r\n\r\nif x % 4 == 0:\r\n if y % 4 == 0:\r\n for i in range(3):\r\n for j in range(3):\r\n if l[i][j] == '.':\r\n l[i][j] = '!'\r\n status = False\r\n elif y % 4 == 1:\r\n for i in range(3):\r\n for j in range(4,7):\r\n if l[i][j] == '.':\r\n l[i][j] = '!'\r\n status = False\r\n else:\r\n for i in range(3):\r\n for j in range(8,11):\r\n if l[i][j] == '.':\r\n l[i][j] = '!'\r\n status = False\r\nelif x % 4 == 1:\r\n if y % 4 == 0:\r\n for i in range(4,7):\r\n for j in range(3):\r\n if l[i][j] == '.':\r\n l[i][j] = '!'\r\n status = False\r\n elif y % 4 == 1:\r\n for i in range(4,7):\r\n for j in range(4,7):\r\n if l[i][j] == '.':\r\n l[i][j] = '!'\r\n status = False\r\n else:\r\n for i in range(4,7):\r\n for j in range(8,11):\r\n if l[i][j] == '.':\r\n l[i][j] = '!'\r\n status = False\r\nelse:\r\n if y % 4 == 0:\r\n for i in range(8,11):\r\n for j in range(3):\r\n if l[i][j] == '.':\r\n l[i][j] = '!'\r\n status = False\r\n elif y % 4 == 1:\r\n for i in range(8,11):\r\n for j in range(4,7):\r\n if l[i][j] == '.':\r\n l[i][j] = '!'\r\n status = False\r\n else:\r\n for i in range(8,11):\r\n for j in range(8,11):\r\n if l[i][j] == '.':\r\n l[i][j] = '!'\r\n status = False\r\n\r\nif status:\r\n for w in l:\r\n for i in range(len(w)):\r\n if w[i] == '.':\r\n w[i] = '!'\r\nfor w in l:\r\n print(''.join(w))\r\n# print(x,y)", "from math import ceil\r\n\r\ntable = []\r\nfor i in range(3):\r\n\tvar = []\r\n\tfor _ in range(3):\r\n\t\tvar.append(input().split())\r\n\ttable.append(var)\r\n\tif i != 2:\r\n\t\tinput()\r\ny, x = [int(x) for x in input().split()]\r\nx1 = (x % 3) - 1\r\ny1 = (y % 3) - 1\r\nfor i in range(3):\r\n\tif '.' in table[y1][i][x1]:\r\n\t\tfor j in range(3):\r\n\t\t\ttable[y1][j][x1] = table[y1][j][x1].replace('.', '!')\r\n\t\tbreak\r\nelse:\r\n\tfor i in range(3):\r\n\t\tfor j in range(3):\r\n\t\t\tfor k in range(3):\r\n\t\t\t\ttable[i][j][k] = table[i][j][k].replace('.', '!')\r\nfor x in table:\r\n\tfor y in x:\r\n\t\tprint(*y)\r\n\tprint()\r\n", "from sys import stdin, stdout\r\n\r\n\r\nmaps = []\r\nsze = 9 \r\n\r\nfor i in range(1, 10):\r\n maps.append(list(''.join(stdin.readline().strip().split())))\r\n \r\n if not i % 3 and i != 9:\r\n stdin.readline()\r\n\r\ns, c = map(int, stdin.readline().split())\r\n\r\nc -= 1\r\ns -= 1\r\n\r\nc %= 3\r\ns %= 3\r\n\r\nacc = c * 3\r\nass = s * 3\r\n\r\nlabel = 0\r\nfor i in range(ass, ass + 3):\r\n for j in range(acc, acc + 3):\r\n if maps[i][j] == '.':\r\n maps[i][j] = '!'\r\n label = 1\r\n\r\nif not label:\r\n for i in range(len(maps)):\r\n for j in range(len(maps[i])):\r\n if maps[i][j] == '.':\r\n maps[i][j] = '!'\r\n\r\nind = 1\r\nfor i in range(len(maps)):\r\n for j in range(len(maps[i])):\r\n stdout.write(maps[i][j])\r\n \r\n if not ind % 9:\r\n stdout.write('\\n')\r\n elif not ind % 3:\r\n stdout.write(' ')\r\n \r\n ind += 1\r\n \r\n if not (i + 1) % 3:\r\n stdout.write('\\n')", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ngrid = []\r\n\r\nfor z in range(3):\r\n for i in range(3):\r\n grid.append([x for x in input().strip('\\n') if x != ' '])\r\n\r\n useless = input()\r\n\r\na, b = map(int, useless.split())\r\n\r\nif (a % 3 == 0):\r\n a = 6\r\nelif (a%3 == 1):\r\n a = 0\r\nelse:\r\n a = 3\r\n\r\nif (b % 3 == 0):\r\n b = 6\r\nelif (b%3 == 1):\r\n b = 0\r\nelse:\r\n b = 3\r\n\r\ncount = 0\r\n\r\nfor i in range(a, a+3):\r\n for j in range(b, b+3):\r\n if (grid[i][j] == '.'):\r\n count += 1\r\n grid[i][j] = '!'\r\n\r\ndef printGrid():\r\n for i in range(9):\r\n grid[i].insert(3, ' ')\r\n grid[i].insert(7, ' ')\r\n for i in range(9):\r\n print(''.join(grid[i]))\r\n if (i % 3 == 2 and i != 8):\r\n print('')\r\n\r\nif (count != 0):\r\n printGrid()\r\n exit(0)\r\n\r\nfor i in range(9):\r\n for j in range(9):\r\n if (grid[i][j] == '.'):\r\n count += 1\r\n grid[i][j] = '!'\r\n\r\nprintGrid()\r\n", "import sys\r\na=[['...' for j in range(3)] for i in range(9)]\r\nl=0\r\nfor i in range(11):\r\n if i==3 or i==7:\r\n k=input()\r\n continue\r\n b=input().split()\r\n for i in range(len(b)):\r\n a[l][i]=b[i]\r\n l+=1\r\nx,y=map(int,input().split())\r\nx-=1\r\ny-=1\r\nx%=3\r\ny%=3\r\nf=0\r\nfor i in range(3*x,3*x+3):\r\n j=y\r\n for m in range(3):\r\n if a[i][j][m]=='.':\r\n f=1\r\n if m==0:\r\n a[i][j]='!'+a[i][j][1:]\r\n elif m==1:\r\n a[i][j]=a[i][j][0]+'!'+a[i][j][2]\r\n elif m==2:\r\n a[i][j]=a[i][j][0]+a[i][j][1]+'!'\r\nif not f:\r\n for i in range(9):\r\n for j in range(3):\r\n for m in range(3):\r\n if a[i][j][m]=='.':\r\n if m==0:\r\n a[i][j]='!'+a[i][j][1:]\r\n elif m==1:\r\n a[i][j]=a[i][j][0]+'!'+a[i][j][2]\r\n elif m==2:\r\n a[i][j]=a[i][j][0]+a[i][j][1]+'!'\r\nfor i in range(9):\r\n s=''\r\n for j in range(3):\r\n s+=a[i][j]+' '\r\n print(s)\r\n if i==2 or i==5:\r\n print()\r\n", "B = [list() for i in range(9)]\r\n\r\nfor i in range(0,9,3):\r\n for j in range(3):\r\n a,b,c = map(list,input().split())\r\n B[i].append(a)\r\n B[i+1].append(b)\r\n B[i+2].append(c)\r\n k = input()\r\n\r\nx,y = map(int, k.split())\r\n\r\nX,Y = (x-1)%3, (y-1)%3\r\nX *= 3\r\n\r\nf = 0\r\nfor i in range(3):\r\n for j in range(3):\r\n if B[X+Y][i][j] == '.':\r\n B[X+Y][i][j] = '!'\r\n f = 1\r\nif f == 0:\r\n for t in range(3):\r\n X = t*3\r\n for Y in range(3):\r\n for i in range(3):\r\n for j in range(3):\r\n if B[X+Y][i][j] == '.':\r\n B[X+Y][i][j] = '!'\r\n\r\nfor X in range(0,9,3):\r\n for i in range(3):\r\n print(' '.join([''.join(B[X][i]), ''.join(B[X+1][i]), ''.join(B[X+2][i])]))\r\n print()\r\n", "def f(x):\r\n\tx%=3\r\n\tif x==0:\r\n\t\treturn 3\r\n\treturn x\r\ndef g(x):\r\n\tif x==1:\r\n\t\treturn 0\r\n\telif x==2:\r\n\t\treturn 4\r\n\telse:\r\n\t\treturn 8\r\na=[]\r\nfor i in range(3):\r\n\ta.append(input())\r\nd=input()\r\na.append(11*' ')\r\nfor i in range(3):\r\n\ta.append(input())\r\nd=input()\r\na.append(11*' ')\r\nfor i in range(3):\r\n\ta.append(input())\r\nx,y=list(map(int,input().split()))\r\nx=f(x)\r\ny=f(y)\r\nx=g(x)\r\ny=g(y)\r\np=0\r\nfor i in range(x,x+3):\r\n\tfor j in range(y,y+3):\r\n\t\tif a[i][j]=='.':\r\n\t\t\ta[i]=a[i][:j]+'!'+a[i][j+1:]\r\n\t\t\tp=1\r\nif p:\r\n\tfor i in range(11):\r\n\t\tprint(a[i])\r\nelse:\r\n\tfor i in range(11):\r\n\t\tfor j in range(11):\r\n\t\t\tif a[i][j]=='.':\r\n\t\t\t\ta[i]=a[i][:j]+'!'+a[i][j+1:]\r\n\tfor i in range(11):\r\n\t\tprint(a[i])\r\n ", "z=[]\r\nfor i in range(11):\r\n if (i!=3 and i!=7):\r\n a,b,c=input().split()\r\n l=a+b+c\r\n z.append(l)\r\n else:\r\n p=input()\r\n\r\ny,x=map(int,input().split())\r\ny=(y-1)%3\r\nx=(x-1)%3\r\nflag=0\r\nfor i in range(y*3,y*3+3):\r\n for j in range(x*3,x*3+3):\r\n if z[i][j]=='.':\r\n flag=1\r\nif flag==1:\r\n for i in range(9):\r\n for j in range(9):\r\n if (i>=(y*3)) and (i<(y*3+3)) and (j>=(x*3)) and (j<(x*3+3)):\r\n if z[i][j]=='.':\r\n print('!',end='')\r\n else:\r\n print(z[i][j],end='')\r\n else:\r\n print(z[i][j],end='')\r\n if ((j+1)%3==0) and j!=8:\r\n print(' ',end='')\r\n if (j==8):\r\n print()\r\n if ((i+1)%3==0) and i!=8:\r\n print()\r\nelse:\r\n for i in range(9):\r\n for j in range(9):\r\n if z[i][j]=='.':\r\n print('!',end='')\r\n else:\r\n print(z[i][j],end='')\r\n if ((j+1)%3==0) and j!=8:\r\n print(' ',end='')\r\n if (j==8):\r\n print()\r\n if ((i+1)%3==0) and i!=8:\r\n print()\r\n \r\n" ]

[ "x = int(input())\r\nx = (x+1)//3\r\nprint(x//12, x%12)\r\n", "n=(int(input())+1)//3;print(n//12,n%12)", "# LUOGU_RID: 121460821\nn = int(input())\r\n\r\ninch = round(n / 3)\r\nfoot = inch // 12\r\ninch = inch - 12 * foot\r\n\r\nprint(\"{} {}\".format(foot,inch))", "n=int(input())\r\na=((n+1)//3)//12\r\nb=(n+1-a*36)//3\r\nprint(a,b)", "n=int(input())+1\r\nprint(n//36,int(n/3%12))", "from math import *\r\nn=int(input())\r\nx=round(n/3)\r\ny=x//12\r\nz=x-12*y\r\nprint(y,z)", "n = int(input())\n\nif n % 36 == 35:\n print((n + 1) // 36, 0)\nelse:\n feet = n // 36\n cm = n - feet * 36\n\n inches = cm // 3\n if cm % 3 == 2:\n inches += 1\n\n print(feet, inches)\n", "n=int(input())\r\nn+=1\r\nf = n//36\r\ni = (n%36)//3\r\nprint(f,i)", "#n = map(int, input().split())\r\nn = int(input())\r\nduim = n // 3\r\nif n - (duim*3) == 2:\r\n duim += 1\r\n\r\nfut = duim // 12\r\nduim = duim - (fut*12)\r\nprint(fut, duim)\r\n", "def solve():\r\n\tn = int(input())\r\n\tremainder = n % 3\r\n\tif remainder > 1:\r\n\t\tn += 1\r\n\telif remainder == 1:\r\n\t\tn -= 1\r\n\r\n\tprint(n // 36, (n - n // 36 * 36) // 3)\r\n\r\nsolve()", "n=int(input())\na=n//36\nb=round((n%36)/3)\nif b == 12:\n\tb-=12\n\ta+=1\nprint(str(a)+' '+str(b))", "n = int(input())/3\r\nft = int(n//12)\r\ninch = round(n%12)\r\nif inch == 12:\r\n inch = 0\r\n ft += 1\r\n \r\nprint(ft, inch)", "\"\"\"\nhttps://codeforces.com/problemset/problem/125/A\n\n\"\"\"\nINCHINCM = 3\nFOOTININCH=12\nFOOTINCM = FOOTININCH * INCHINCM\nlength = int(input())\n\nfeet, rest1 = divmod(length, FOOTINCM)\ninches, rest = divmod(rest1, INCHINCM)\ninches = inches + 1 if rest > 1 else inches\nfff, inches = divmod(inches, FOOTININCH)\n\nprint(feet + fff, inches)\n", "centimeters = int(input())\r\n\r\nfeet = centimeters // 36\r\nrem_centimeters1 = (centimeters - feet*12*3)\r\ninches = rem_centimeters1 // 3\r\nrem_centimeters2 = rem_centimeters1 - (inches*3)\r\n\r\nif rem_centimeters2 >= 1.5:\r\n inches += 1\r\n if inches == 12:\r\n feet += 1\r\n inches = 0\r\n\r\nprint(feet, inches)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = n//3 + (n%3 == 2)\r\nprint(x//12, x%12)\r\n", "x=(int(input())+1)//3\r\nprint(x//12,x%12)\r\n", "n = int(input())\r\ninches = round(n / 3)\r\nfeet = inches // 12\r\ninches = inches % 12\r\nprint(feet, inches)", "n=int(input())\r\nr=n//3\r\nif n%3==2:\r\n r+=1\r\nd=r//12\r\ne=r%12\r\nprint(d,e)\r\n", "import math\r\nimport sys\r\ndef Binary(n):\r\n s = bin(n)\r\n s1 = s[2:]\r\n return s1\r\ndef Decimal(n):\r\n return int(n,2)\r\n\r\ndef PowerOf(x,d):\r\n c=0\r\n while(x%d==0):\r\n c+=1\r\n x=x//d\r\n return c\r\n\r\n \r\n\r\nn=int(input())\r\nn+=1\r\nx=(n)//36\r\ny=(n%36)//3\r\nprint(str(x)+\" \"+str(y))\r\n", "N = int(input())\n\ndef roundI(inch):\n if inch<=1:\n return 0\n return 1\n\nfeet = int(N/36)\nfullinch = (N - (feet*36))//3\n\nfinalinch = fullinch + roundI(N-feet*36-fullinch*3)\nif finalinch == 12:\n feet += 1\n finalinch = 0\n \nprint(feet,finalinch)\n \t \t\t\t \t\t\t \t \t\t\t \t\t \t\t \t \t", "a=(int(input())+1)//3\r\nprint('%d %d'%(a//12,a%12))", "n = int(input())\r\nn = n // 3 + int(n % 3 > 1)\r\nprint(n // 12, n % 12)", "n = int(input()) + 1\nprint(n // 36, n % 36 // 3)\n", "n=int(input())\r\na=n//3\r\nb=n%3\r\nif b==2:\r\n a=a+1\r\np=a//12\r\nq=a%12\r\nprint(p,q)", "n = int(input())\r\nk = n//3 + (n%3==2)\r\nprint(k//12, k%12)", "n = int(input())\r\ninch = 0\r\nif(n%3==2):\r\n inch = (n//3+1)\r\nelse:\r\n inch = n//3\r\n\r\nprint(inch//12, inch%12)", "n = int(input())\r\nfeet = n//36\r\nn %= 36\r\ninch = n//3\r\nif(n%3 == 2):\r\n inch += 1\r\nif(inch==12):\r\n feet += 1\r\n inch =0\r\nprint(feet,inch)", "n = round(int(input())/3)\r\nprint(n//12, n%12)", "n=int(input())\r\na=(n+1)//36\r\nn-=36*a\r\nb=(n+1)//3\r\nprint(a,b)\r\n", "a,b=divmod(round(int(input())/3),12)\r\nprint(a,b)\r\n", "n = int(input())\r\nx = n // 3 + (n % 3 == 2)\r\nprint(x // 12, x % 12)", "n = int(input())\nif n%3==0:\n inc = n//3\nelif n%3==1:\n inc = n//3\nelse:\n inc = n//3 + 1\n\nfeet = inc//12\ninc = inc%12\nprint(feet, inc)\n \t\t\t\t\t \t \t \t\t \t \t\t\t \t \t\t\t\t", "n = int(input())\ninc = n//3\nrem = n%3\ninc += 1 if rem == 2 else 0\nft = inc//12\ninc = inc%12\nprint(ft, inc)\n \t \t\t\t\t\t \t\t\t \t \t \t\t \t\t\t\t\t \t\t", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\n\r\nd = int(round(n / float(3)))\r\nprint(int(d / 12), d % 12)\r\n ", "num = int(input())\ninches = num//3\nif num%3>=2:\n inches+=1\nprint(inches//12,\" \", inches%12)", "def dliny(number):\r\n return ((number + 1) // 3) // 12, ((number + 1) // 3) % 12\r\n\r\n\r\nprint(*dliny(int(input())))\r\n", "n=int(input())\r\ne=(n+1)//36\r\nn-=36*e\r\nprint(e,(n+1)//3)", "from math import ceil\r\na = int(input())\r\na/=3\r\nif a%1<0.5:\r\n a//=1\r\nelse:\r\n a=a//1+1\r\nprint(str(int(a//12))+' '+str(int(a%12)))", "n = int(input())\r\na = n // 36\r\nb = (n - a * 36) // 3\r\nn = n - 36 * a - 3 * b\r\nb += (n == 2)\r\nif b == 12:\r\n a, b = a + 1, 0\r\nprint(a, b)", "n=int(input())\r\nv=n//3\r\nv+=n%3==2\r\nb=v//12\r\nprint(v//12,v%12)", "cm = int(input())\ninches = cm // 3\nif cm % 3 == 2:\n inches += 1\nfeet = inches // 12\ninches %= 12\nprint(feet, inches)\n", "centimeters = int(input())\r\nmod = centimeters % 36\r\nif mod == 35:\r\n div = int(centimeters/36) + 1\r\n print(div, 0)\r\nelse:\r\n div = int(centimeters/36)\r\n newMod = mod % 3\r\n newDiv = int(mod/3)\r\n if newMod == 2:\r\n newDiv += 1\r\n else:\r\n pass\r\n print(div, newDiv)", "from itertools import permutations\n\n# Test_case = int(input())\nTest_case = 1\n\n\nfor test in range(Test_case):\n n = int(input())\n if n % 3 == 0:\n inc = n // 3\n print(inc // 12, inc % 12)\n elif n % 3 == 1:\n inc = n // 3\n print(inc // 12, inc % 12)\n else:\n inc = n // 3 + 1\n print(inc // 12, inc % 12)\n # a = []\n # n, m = map(int, input().split())\n # for i in range(n):\n # temp = []\n # s = input()\n # for j in range(m):\n # temp.append(s[j])\n # a.append(temp)\n # cnt = 0\n # for ii in range(n):\n # for jj in range(m):\n # if a[ii][jj] == 'W':\n # if ii\n #\n # # if a[max(ii - 1, 0)][max(jj - 1, 0)] == 'P':\n # # a[max(ii - 1, 0)][max(jj - 1, 0)] = '1'\n # # cnt += 1\n # # elif a[min(ii + 1, n - 1)][min(jj + 1 , n - 1)] == 'P':\n # # cnt += 1\n # # a[min(ii + 1, n - 1)][min(jj + 1, n - 1)] = '1'\n # # elif a[ii][min(jj + 1, m - 1)] == 'P':\n # # cnt += 1\n # # a[ii][min(jj + 1, m - 1)] = '1'\n # # elif a[ii][max(jj - 1, 0)] == 'P':\n # # cnt += 1\n # # a[ii][max(jj - 1, 0)] = '1'\n # print(cnt)\n \t\t\t \t\t\t \t \t\t \t\t\t \t \t", "from math import *\r\nif __name__ == '__main__':\r\n n=int(input())\r\n x=round(n/3)\r\n y=x//12\r\n z=x-12*y\r\n print(y,z)", "n = float(input())\r\ninch = int(n / 3 + 0.5)\r\nfeet = int(inch / 12)\r\nr = inch - 12 * feet\r\nprint(feet,\" \",r)", "n = int(input())\r\ninch = n//3\r\nif n%3 == 2: inch += 1\r\nfeet = inch//12\r\ninch = inch%12\r\nprint(feet,inch)", "n=int(input())\r\ni=int(n/3)+(n%3)-1\r\nif n%3==0:\r\n i+=1\r\nprint(i//12,\" \",i%12)\r\n", "import math\r\nn=int(input())\r\nb=round(n/3)\r\na=math.floor(b/12)\r\nb=b-a*12\r\nprint(a,b)", "def fi(n):\n # n in cm\n \n ft = n//36\n rem = n % 36\n ic = round(rem/3)\n if ic == 12:\n ft +=1 \n ic = 0\n \n return ft,ic\n \n return \n \n#main program\nn = int(input())\na,b = fi(n)\nprint(a,b)\n\t \t \t \t\t \t\t \t \t\t\t\t \t \t\t\t \t \t", "n = int(input())\r\ninches = n/3\r\ncm = n%3\r\nif (cm>1):\r\n inches+=1\r\nf = inches/12\r\ninches %= 12\r\nprint(int(f),\" \",int(inches))", "n = int(input())\r\nn = (n + 1) // 3\r\nprint(n // 12, n % 12)", "n=int(input())\r\nn+=1\r\nx = n//36\r\nn%=36\r\ny = n//3\r\nprint(x,y)", "from math import ceil, floor\r\n\r\nn = int(input())\r\nif n % 3 > 1:\r\n d = ceil(n / 3)\r\nelse:\r\n d = n // 3\r\nf = d // 12\r\nprint(f, d % 12)\r\n", "n = int(input())\r\nd = (n + 1)//3\r\nprint(d//12,d%12)\r\n", "l = int(input())\ni = round(l/3)\nf = i // 12\ni = i % 12\nprint(f,i)\n \t \t \t\t \t \t\t \t\t \t \t \t\t \t \t", "n = int(input())\r\na = n // 3\r\nb = 0\r\nif n % 3 == 2:\r\n a += 1\r\nif a >= 12:\r\n b = a // 12\r\n a = a % 12\r\nprint(b, a)\r\n", "n = int(int(input()) / 3 + 0.5)\r\nprint(n // 12,n % 12)", "\r\nn=int(input())\r\n\r\n\r\na = n//3\r\nb = n%3\r\nif b==2:\r\n a+=1\r\n\r\n\r\ns = a//12\r\n\r\ny = a%12\r\n\r\nprint(s,y)\r\n\r\n\r\n\r\n" ]

[ "s = input()\r\n\r\nif 'AB' in s and 'BA' in s:\r\n # Find the first occurrence of \"AB\" and the first occurrence of \"BA\" after the \"AB\"\r\n ab_index = s.find('AB')\r\n ba_index = s.find('BA', ab_index + 2)\r\n\r\n # Check if the substrings are non-overlapping\r\n if ba_index != -1 and ba_index != ab_index + 1:\r\n print('YES')\r\n else:\r\n # Find the first occurrence of \"BA\" and the first occurrence of \"AB\" after the \"BA\"\r\n ba_index = s.find('BA')\r\n ab_index = s.find('AB', ba_index + 2)\r\n\r\n # Check if the substrings are non-overlapping\r\n if ab_index != -1 and ab_index != ba_index + 1:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "string = input()\ncheck_ab = string.find(\"AB\")\ncheck_ba = string.find(\"BA\")\n\nif (check_ab != -1 and string.find(\"BA\", check_ab + 2) != -1) or (check_ba != -1 and string.find(\"AB\", check_ba + 2) != -1):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t\t \t \t \t\t \t\t \t\t\t \t\t \t\t", "s = input()\np = s.count('AB')\nq = s.count('BA')\nr = s.count('ABA')\nt = s.count('BAB')\nn = p+q-r-t\nif n >= 2 and p > 0 and q > 0:\n print('YES')\nelse:\n print('NO')\n \t\t \t \t \t\t \t\t\t\t \t\t\t\t\t\t\t \t\t\t \t\t", "s = input()\r\n\r\na = s.find(\"AB\")\r\nb = s[a + 2:].find(\"BA\")\r\nc = s.find(\"BA\")\r\nd = s[c + 2:].find(\"AB\")\r\n\r\nprint(\"YES\" if a >= 0 and b >= 0 or c >= 0 and d >= 0 else \"NO\")", "s = input()\r\n\r\nn = len(s)\r\n\r\ndef check(s, n):\r\n prev = None\r\n for i in range(n):\r\n if prev == None and i > 0 and s[i] == 'B' and s[i - 1] == 'A':\r\n prev = i\r\n if i < n - 1 and s[i] == 'B' and s[i + 1] == 'A' and prev != None and prev < i:\r\n return \"YES\"\r\n prev = None\r\n for i in range(n):\r\n if prev == None and i > 0 and s[i] == 'A' and s[i - 1] == 'B':\r\n prev = i\r\n if i < n - 1 and s[i] == 'A' and s[i + 1] == 'B' and prev != None and prev < i:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(check(s, n))", "s = input()\r\nb = True\r\nif 'AB' in s and 'BA' in s:\r\n if (('AB' in s) and (('BA' in s[:s.find('AB')]) or ('BA' in s[s.find('AB')+2:]))) or (('BA' in s) and (('AB' in s[:s.find('BA')]) or ('AB' in s[s.find('BA')+2:]))):\r\n print(\"YES\")\r\n b = False\r\nif b : print(\"NO\")", "def contains_ab_and_ba(s):\r\n if \"AB\" in s:\r\n if \"BA\" in s[s.index(\"AB\") + 2:]:\r\n return \"YES\"\r\n if \"BA\" in s:\r\n if \"AB\" in s[s.index(\"BA\") + 2:]:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\ns = input().strip()\r\nprint(contains_ab_and_ba(s))", "# LUOGU_RID: 134402526\ns=input()\na,b=[],[]\nfor i in range(len(s)-1):\n if s[i]=='A' and s[i+1]=='B':\n a.append(i)\n elif s[i]=='B' and s[i+1]=='A':\n b.append(i)\nfor i in a:\n for j in b:\n if abs(i-j)>1:\n print('YES')\n exit()\nprint('NO')", "a = input()\r\nab = []\r\nba = []\r\nfor i in range(len(a)-1):\r\n if a[i:i+2] == \"AB\":\r\n ab.append(i)\r\n if a[i:i+2] == \"BA\":\r\n ba.append(i)\r\nif len(ba) != 0 and len(ab) != 0:\r\n if ba[-1] - ab[0] > 1 or ab[-1] - ba[0] > 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "# Wadea #\r\n\r\ns = input()\r\nans = \"NO\"\r\nif \"AB\" in s:\r\n a = s.replace(\"AB\",\" \",1)\r\n if \"BA\" in a:\r\n ans = \"YES\"\r\n\r\nif \"BA\" in s:\r\n s = s.replace(\"BA\",\" \",1)\r\n if \"AB\" in s:\r\n ans = \"YES\"\r\nprint(ans) \r\n\r\n ", "s = input()\r\nc = False\r\n\r\ntry:\r\n if \"BA\" in s[s.index(\"AB\") + 2:]:\r\n c= True\r\n elif \"AB\" in s[s.index(\"BA\") + 2:]:\r\n c = True\r\nexcept :\r\n pass\r\n\r\nprint('YES' if c else 'NO')", "s = input().lower()+\"ghjkl\"\r\nab = 0\r\nba = 0\r\nab1 = s.find(\"ab\")+1\r\nba1 = s.replace(\"ab\", \"-\", 1).find(\"ba\")+1\r\nba2 = s.find(\"ba\")+1\r\nab2 = s.replace(\"ba\", \"-\", 1).find(\"ab\")+1\r\n\r\nif ab1*ba1+ba2*ab2 !=0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import deque\r\n\r\n'''\r\n\r\n 9XZER0\r\n\r\n'''\r\n\r\ndef intin():\r\n return int(input())\r\ndef listin():\r\n return [int(i) for i in input().split()]\r\ndef mapin():\r\n return map(int,input().split())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\r\n s = input()\r\n s_AB = s.find('AB')\r\n #print(s_AB)\r\n s_BA = s.find('BA', s_AB+2)\r\n #print(s_BA)\r\n\r\n r_AB = s.find('BA')\r\n #print(r_AB)\r\n r_BA = s.find('AB', r_AB+2)\r\n #print(r_BA)\r\n\r\n con = (s_AB!=-1 and s_BA!=-1) or (r_AB!=-1 and r_BA!=-1)\r\n\r\n if(con):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "s = input()\r\nif 'AB' in s:\r\n a1 = s.find('AB')\r\n if 'BA' in s[0:a1] or 'BA' in s[a1+2:]:\r\n print('YES')\r\n else:\r\n if 'BA' in s:\r\n a2 = s.find('BA')\r\n if 'AB' in s[0:a2] or 'AB' in s[a2 + 2:]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "\r\ns = input()\r\nyes = False\r\nfor i in range(len(s)-1):\r\n if s[i] == \"A\" and s[i+1] == \"B\":\r\n if \"BA\" in s[i+2:]:\r\n yes = True\r\n if \"BA\" in s[:i]:\r\n yes = True\r\nif not yes:\r\n print(\"NO\")\r\nelse:\r\n print('YES') \r\n", "str = input()\r\nab1 = str.find(\"AB\")\r\nba1 = str.rfind(\"BA\")\r\nab2 = str.rfind(\"AB\")\r\nba2 = str.find(\"BA\")\r\nif ab1 == -1 or ba1 == -1 or ab2 == -1 or ba2 == -1:\r\n print(\"NO\")\r\nelif abs(ab1 - ba1) > 1 or abs(ab2 - ba2) > 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\n\r\ndef foobar(string):\r\n ab = string.find('AB')\r\n ba = string.find('BA')\r\n if ab == -1 or ba == -1:\r\n return 'NO'\r\n if abs(ab - ba) < 2:\r\n ba2 = string.find('BA', ab+2)\r\n if ba2 != -1:\r\n return 'YES' \r\n ab2 = string.find('AB', ba+2)\r\n if ab2 != -1:\r\n return 'YES' \r\n\r\n if ba + 1 < ab or ab + 1 < ba:\r\n return 'YES'\r\n return 'NO'\r\n\r\nprint(foobar(s))", "def f(s):\r\n n=len(s)\r\n S=[]\r\n L=[]\r\n for i in range(n-1):\r\n if s[i]=='A' and s[i+1]=='B':\r\n S.append(i)\r\n elif s[i]=='B' and s[i+1]=='A':\r\n L.append(i)\r\n if L==[] or S==[]:\r\n return \"NO\"\r\n else:\r\n if abs(L[0]-S[0])>1 or abs(L[0]-S[-1])>1 or abs(L[-1]-S[0])>1 or abs(L[-1]-S[-1])>1:\r\n return \"YES\"\r\n return \"NO\"\r\nx=input()\r\nprint(f(x))", "s=input()\r\nif((abs(s.find('AB')-s.rfind('BA'))>1 or (abs(s.find('BA')-s.rfind('AB'))>1)) and s.find('AB')!=-1 and s.find('BA')!=-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\nab_index = s.find(\"AB\")\r\nif ab_index != -1:\r\n ba_index = s.find(\"BA\", ab_index + 2)\r\n if ba_index != -1:\r\n print(\"YES\")\r\n exit()\r\n\r\nba_index = s.find(\"BA\")\r\nif ba_index != -1:\r\n ab_index = s.find(\"AB\", ba_index + 2)\r\n if ab_index != -1:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n", "s = input()\r\n\r\ndef fun(s,ff,ss):\r\n i = 0\r\n FF,SS = False,False\r\n while i<len(s)-1:\r\n if s[i:i+2]==ff:\r\n FF = True\r\n break\r\n i+=1\r\n i+=2\r\n while i<len(s)-1:\r\n if s[i:i+2]==ss:\r\n SS = True\r\n i+=1\r\n\r\n return FF&SS\r\nif fun(s,\"AB\",\"BA\") or fun(s,\"BA\",\"AB\") :\r\n print(\"YES\")\r\nelse:\r\n print( \"NO\")\r\n", "a=input()\r\nn=a.split(\"AB\",1)\r\nr=a.split(\"BA\",1)\r\nif len(n)>1 and \"BA\" in n[1]:\r\n print (\"YES\")\r\nelif len(r)>1 and \"AB\" in r[1]:\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")", "s=input()\r\ni1=s.count(\"AB\")\r\ni2=s.count(\"BA\")\r\ni3=s.count(\"ABA\")\r\ni4=s.count(\"BAB\")\r\ni5=s.count(\"ABAB\")\r\ni6=s.count(\"BABA\")\r\nif i1==1 and i2==2 and i3==1 and i4==1 and i6==1:\r\n print(\"NO\")\r\nelif i1==2 and i2==1 and i3==1 and i4==1 and i5==1 :\r\n print(\"NO\")\r\nelif i1>1 and i2>1:\r\n print(\"YES\")\r\nelif i1==1 and i2>1:\r\n print(\"YES\")\r\nelif i1>1 and i2==1:\r\n print(\"YES\")\r\nelif i1==1 and i2==1 and i3==0 and i4==0:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "s = input()\r\n\r\na = s.find(\"AB\")\r\nb = s.find(\"BA\")\r\nc = s.rfind(\"AB\")\r\nd = s.rfind(\"BA\")\r\n\r\nif (a != -1 and b != -1 and (abs(a - d) > 1 or abs(b - c) > 1 )):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nx1 = s.find(\"AB\") # FIRST OCCURRENCE OF AB IS x1\r\nx2 = s.find(\"BA\", x1 + 2) # OCCURRENCE of BA FROM x1+2 POSITION\r\ny1 = s.find(\"BA\")\r\ny2 = s.find(\"AB\", y1 + 2)\r\n\r\nif (x1 != -1 and x2 != -1) or (y1 != -1 and y2 != -1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\na = s.count(\"AB\")\r\nb = s.count(\"BA\")\r\nc = s.count(\"ABA\")\r\nd = s.count(\"BAB\")\r\nif (a+b)-c-d > 1 and (a != 0 and b != 0):\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input();u=s.find('AB');v=s.find('BA')\nprint('YES'if(u+1and s.find('BA',u+2)+1)or(v+1and s.find('AB',v+2)+1)else'NO')\n\t\t \t \t\t\t\t\t\t \t \t\t\t \t\t\t\t\t \t", "string = input()\r\nflag = False\r\n\r\nfor i in range(len(string) - 1):\r\n if string[i:i+2] == \"AB\" and \"BA\" in string[i+2:]:\r\n flag = True\r\n break\r\n elif string[i:i+2] == \"BA\" and \"AB\" in string[i+2:]:\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from bisect import bisect_left\r\nfrom collections import Counter, defaultdict\r\nfrom functools import lru_cache\r\nimport sys\r\nimport threading\r\n\r\ndef main():\r\n s = input()\r\n n = len(s)\r\n\r\n @lru_cache(None)\r\n def dp(idx, ab_found, ba_found):\r\n if ab_found and ba_found:\r\n return True\r\n\r\n if idx >= n-1:\r\n return False\r\n \r\n cur = s[idx] + s[idx+1]\r\n if cur == \"AB\" and not ab_found:\r\n return dp(idx + 1, ab_found , ba_found) or dp(idx + 2, True, ba_found)\r\n\r\n elif cur == \"BA\" and not ba_found:\r\n return dp(idx + 1, ab_found,ba_found ) or dp(idx + 2, ab_found, True)\r\n\r\n else:\r\n return dp(idx + 1, ab_found, ba_found)\r\n\r\n if dp(0, False, False):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n sys.setrecursionlimit(1 << 30)\r\n threading.stack_size(1 << 27)\r\n\r\n main_thread = threading.Thread(target=main)\r\n main_thread.start()\r\n main_thread.join()", "\r\n\r\ndef __main__():\r\n s = input()\r\n AB = []\r\n BA = []\r\n\r\n for i in range(len(s) - 1):\r\n if(s[i] == 'A' and s[i + 1] == 'B'):\r\n AB.append(i)\r\n if (s[i] == 'B' and s[i + 1] == 'A'):\r\n BA.append(i)\r\n\r\n\r\n if(len(AB) == 0 or len(BA) == 0):\r\n print('NO')\r\n return\r\n\r\n if(AB[-1] - BA[0] > 1 or BA[-1] - AB[0] > 1):\r\n print('YES')\r\n return\r\n\r\n print('NO')\r\n return\r\n\r\n__main__()", "s = input()\r\na1, a2 = 0, 0\r\na3, a4 = 0, 0\r\na5, a6 = 0, 0\r\na7, a8 = 0, 0\r\nif 'AB' in s and 'BA' in s:\r\n for i in range(len(s)-1):\r\n if s[i] + s[i+1] == 'AB':\r\n a1, a2 = i, i+1\r\n break\r\n for i in range(len(s) - 1, 0, -1):\r\n if s[i-1] + s[i] == 'BA':\r\n a3, a4 = i-1, i\r\n break\r\n for i in range(len(s)-2, -1, -1):\r\n if s[i] + s[i+1] == 'AB':\r\n a5, a6 = i, i+1\r\n break\r\n for i in range(1, len(s)):\r\n if s[i-1] + s[i] == 'BA':\r\n a7, a8 = i-1, i\r\n break\r\n if a1 != a4 and a2 != a3 or a5 != a8 and a6 != a7:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nbul = 'NO'\r\nfor i in range(len(s)-2):\r\n if len(s) < 4:\r\n bul = 'NO'\r\n break\r\n if s[i:i+2] == 'AB':\r\n if s.find('BA', i+2, len(s)) != -1:\r\n bul = 'YES'\r\n break\r\n if s[i:i+2] == 'BA':\r\n if s.find('AB', i+2, len(s)) != -1:\r\n bul = 'YES'\r\n break\r\nprint(bul)", "def contains_AB_BA(s):\r\n # Search for \"AB\" in the string\r\n if \"AB\" in s:\r\n # Check if \"BA\" is present after the \"AB\"\r\n if \"BA\" in s[s.index(\"AB\") + 2:]:\r\n return \"YES\"\r\n \r\n # Search for \"BA\" in the string\r\n if \"BA\" in s:\r\n # Check if \"AB\" is present after the \"BA\"\r\n if \"AB\" in s[s.index(\"BA\") + 2:]:\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n\r\n# Read input string\r\ns = input().strip()\r\n\r\n# Check if the input string contains the required substrings\r\nresult = contains_AB_BA(s)\r\nprint(result)", "s = input()\r\n\r\n# Find the first occurrence of \"AB\"\r\nindex_ab = s.find(\"AB\")\r\n\r\n# Check if \"BA\" occurs after the first \"AB\"\r\nif index_ab != -1 and s.find(\"BA\", index_ab + 2) != -1:\r\n print(\"YES\")\r\nelse:\r\n # Find the first occurrence of \"BA\"\r\n index_ba = s.find(\"BA\")\r\n \r\n # Check if \"AB\" occurs after the first \"BA\"\r\n if index_ba != -1 and s.find(\"AB\", index_ba + 2) != -1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "ch = input()\r\nfound = False\r\n\r\n# Check for \"AB\" followed by \"BA\"\r\nif \"AB\" in ch and ch.index(\"AB\") < len(ch) - 1:\r\n index = ch.index(\"AB\") + 2\r\n if \"BA\" in ch[index:]:\r\n found = True\r\n\r\n# Check for \"BA\" followed by \"AB\"\r\nif \"BA\" in ch and ch.index(\"BA\") < len(ch) - 1:\r\n index = ch.index(\"BA\") + 2\r\n if \"AB\" in ch[index:]:\r\n found = True\r\n\r\nif found:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\na=s.count(\"AB\")\r\nb=s.count(\"BA\")\r\nc=s.count(\"ABA\")\r\nd=s.count(\"BAB\")\r\nprint([\"NO\",\"YES\"][(a+b)*(a!=0 and b!=0)-c-d>1])", "s=input()\r\nl=[]\r\nfor i in range(len(s)-1):\r\n l.append(s[i]+s[i+1])\r\nx1=[]\r\nx2=[]\r\nfor i in range(len(l)):\r\n if l[i]==\"AB\":\r\n x1.append(i)\r\n if l[i]==\"BA\":\r\n x2.append(i)\r\nif len(x1)==0 or len(x2)==0:\r\n print('NO')\r\nelse:\r\n if abs(x1[0]-x2[-1])!=1 or abs(x1[-1]-x2[0])!=1:\r\n print('YES')\r\n else:\r\n print('NO')", "#https://codeforces.com/problemset/problem/550/A\r\n\r\ns = input()\r\na_b, b_a = [x for x in range(len(s)) if s.startswith(\"AB\", x)], [x for x in range(len(s)) if s.startswith(\"BA\", x)]\r\ntry:\r\n min_ab, min_ba = min(a_b), min(b_a)\r\n max_ab, max_ba = max(a_b), max(b_a)\r\n if(abs(min_ab - max_ba) > 1 or abs(min_ba - max_ab) > 1):\r\n answer = \"YES\"\r\n else:\r\n answer = \"NO\"\r\nexcept:\r\n answer = \"NO\"\r\nprint(answer)", "s = input()\r\na = s.find('AB')\r\nb = s.find('BA', a+2)\r\nc = s.find('BA')\r\nd = s.find('AB', c+2)\r\n\r\nif (a != -1 and b != -1) or (c != -1 and d != -1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "string = input()\r\nfound = False\r\ni = 0\r\n\r\nwhile i < len(string) - 1:\r\n if string[i:i+2] == 'AB':\r\n # Check if there is 'BA' substring after 'AB'\r\n if 'BA' in string[i+2:]:\r\n found = True\r\n break\r\n elif string[i:i+2] == 'BA':\r\n # Check if there is 'AB' substring after 'BA'\r\n if 'AB' in string[i+2:]:\r\n found = True\r\n break\r\n\r\n i += 1\r\n\r\nprint(\"YES\" if found else \"NO\")\r\n", "a = input()\r\nif ('AB' in a and 'BA' in a[a.index('AB')+2:]) or ('BA' in a and 'AB' in a[a.index('BA')+2:]):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s=input()\r\na=s.count('AB')\r\nb=s.count('BA')\r\nif a==0 or b==0:\r\n print('NO')\r\nelif a==1 and b==1 and ('BAB' in s or 'ABA' in s):\r\n print('NO')\r\nelif a==1 and b==2 and ('BABA' in s):\r\n print('NO')\r\nelif a==2 and b==1 and ('ABAB' in s):\r\n print('NO')\r\nelse:\r\n print('YES')", "s = input()\r\nn, m = s.find('AB'), s.find('BA')\r\nni, mi = s.rfind('AB'), s.rfind('BA')\r\nprint('YES' if min(n, m, ni, mi) >= 0 and (abs(n - mi) > 1 or abs(m - ni) > 1) else 'NO')", "s = input()\n\n# Check if \"AB\" followed by \"BA\" or \"BA\" followed by \"AB\" exists in the string.\nif (\"AB\" in s and \"BA\" in s[s.index(\"AB\") + 2:]) or (\"BA\" in s and \"AB\" in s[s.index(\"BA\") + 2:]):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t \t\t\t\t \t \t \t\t\t\t\t \t \t", "word = input()\r\nab_pos = word.find('AB')\r\nba_pos = word.find('BA')\r\nif ab_pos != -1 and ba_pos != -1:\r\n if word.find('BA', ab_pos + 2) != -1:\r\n print(\"YES\")\r\n elif word.find('AB', ba_pos + 2) != -1:\r\n print('YES')\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print('NO')", "a=input()\r\nq=0\r\nif(\"AB\" in a):\r\n p=a.index(\"AB\")\r\n if(\"BA\" in a[p+2:]):\r\n q=1\r\nif(q==0):\r\n if(\"BA\" in a):\r\n p=a.index(\"BA\")\r\n if(\"AB\" in a[p+2:]):\r\n q=1\r\nif(q==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n ", "def ifexist(string, f, s):\r\n for i in range(1,len(string)):\r\n if string[i-1] + string[i] == f:\r\n for j in range(i+2, len(string)):\r\n if string[j-1] + string[j] == s:\r\n return True\r\n break\r\n return False\r\n\r\nif __name__ == '__main__':\r\n s=input()\r\n if ifexist(s, 'AB', 'BA') or ifexist(s, 'BA', 'AB'):\r\n print('YES')\r\n else:\r\n print('NO')", "s = input().strip()\r\n\r\nf1=f2=-1\r\n\r\nf = s.find(\"AB\")\r\n\r\nif f != -1:\r\n f1 = s.find(\"BA\",f+2)\r\n\r\nf = s.find(\"BA\")\r\n\r\nif f != -1:\r\n f2 = s.find(\"AB\",f+2)\r\n\r\nprint(\"YNEOS\" [f1 == f2 == -1 :: 2])\r\n", "\r\ndef checker():\r\n s = input()\r\n flag = {'AB': True, 'BA': True}\r\n\r\n def dp(idx, sub):\r\n for i in range(idx+1, len(s)):\r\n if s[i-1] + s[i] == sub:\r\n return True\r\n \r\n return False\r\n \r\n for i in range(1, len(s)):\r\n if (s[i] == 'A' and s[i-1] == 'B') and flag['AB']:\r\n if dp(i+1, 'AB'):\r\n print('YES')\r\n return\r\n flag['AB'] = False\r\n \r\n elif s[i] == 'B' and s[i-1] == 'A' and flag['BA']:\r\n if dp(i+1, 'BA'):\r\n print('YES')\r\n return\r\n flag['BA'] = False\r\n \r\n print('NO')\r\n\r\nchecker()", "a=input()\r\nm=1\r\nn=1\r\nif 'AB' in a:\r\n b=a[a.find('AB')+2:]\r\n if 'BA' in b:\r\n m=2\r\nif 'BA' in a:\r\n b=a[a.find('BA')+2:]\r\n if 'AB' in b:\r\n n=2\r\nif m==2 or n==2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\"\"\"\r\n author: Adham0 \r\n created: 03.08.2023 17:06:38\r\n ### Adham was here ###\r\n \r\n █████ ██████ ██ ██ █████ ███ ███\r\n ██ ██ ██ ██ ██ ██ ██ ██ ████ ████\r\n ███████ ██ ██ ███████ ███████ ██ ████ ██\r\n ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ \r\n ██ ██ ██████ ██ ██ ██ ██ ██ ██\r\n\"\"\"\r\n\r\ns = input()\r\n\r\nif \"BA\" not in s or \"AB\" not in s:\r\n print(\"NO\")\r\n exit()\r\n\r\npos = s.index(\"BA\")\r\nif \"AB\" in s[pos + 2:]:\r\n print(\"YES\")\r\n exit()\r\n\r\npos = s.index(\"AB\")\r\nif \"BA\" in s[pos + 2:]:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "n = input()\r\nn1 = n.find(\"AB\")\r\nn2 = n.find(\"BA\",n1+2)\r\nn3 = n.find(\"BA\")\r\nn4 = n.find(\"AB\",n3+2)\r\nif n1 >= 0 and n2 >=0:\r\n print(\"yes\")\r\nelif n3 >= 0 and n4 >=0:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "# 5 Two Substrings 13m https://codeforces.com/problemset/problem/1/A\r\n# O()t | O()s 03:31\r\n\r\ndef overlap(sub1, sub2):\r\n# print(sub1, sub2)\r\n for i in range(len(sub1)):\r\n for j in range(len(sub2)):\r\n# print(sub1[i], sub2[len(sub2) - j - 1], abs(sub1[i] - sub2[len(sub2) - j - 1]))\r\n if abs(sub1[i] - sub2[j]) > 1: return False \r\n return True\r\n \r\ndef two_substrings(string):\r\n# print(string)\r\n sub1, sub2 = [], []\r\n for i in range(len(string) - 1):\r\n if string[i] == \"A\" and string[i + 1] == \"B\":\r\n sub1.append(i)\r\n if string[i] == \"B\" and string[i + 1] == \"A\":\r\n sub2.append(i)\r\n if sub1 and sub2 and not overlap(sub1, sub2):\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n \r\nstring = input()\r\ntwo_substrings(string)\r\n\r\n# two_substrings(\"ABABA\") # = YES\r\n# two_substrings(\"ABAAB\") # = YES\r\n# two_substrings(\"ABA\") # = NO\r\n# two_substrings(\"BACFAB\") # = YES\r\n# two_substrings(\"AXBYBXA\") # = NO", "str = input()\r\n\r\nidx1 = str.find(\"AB\")\r\nidx2 = str.find(\"BA\", idx1 + 2)\r\n\r\nif idx1 != -1 and idx2 != -1 and abs(idx1 - idx2) >= 2:\r\n print(\"YES\")\r\nelse:\r\n idx2 = str.find(\"BA\")\r\n idx1 = str.find(\"AB\", idx2 + 2)\r\n\r\n if idx1 != -1 and idx2 != -1 and abs(idx1 - idx2) >= 2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def judge(string):\r\n # 如果字符串长度小于等于3，则直接返回'NO'\r\n if len(string) <= 3:\r\n return 'NO'\r\n\r\n # 找到AB和BA的索引\r\n AB_index = []\r\n BA_index = []\r\n for i in range(len(string) - 1):\r\n if string[i:i+2] == 'AB':\r\n AB_index.append(i)\r\n elif string[i:i+2] == 'BA':\r\n BA_index.append(i)\r\n\r\n # 检查AB和BA的索引是否有非重叠的部分\r\n for j in AB_index:\r\n for x in BA_index:\r\n if x <= j-2 or x >= j+2:\r\n return 'YES'\r\n \r\n return 'NO'\r\n\r\nstring = input()\r\nprint(judge(string))\r\n", "word=input()\r\nn1=[]\r\nn2=[]\r\nbool=False\r\nfor i in range(len(word)-1):\r\n if word[i]+word[i+1]==\"AB\":\r\n n1.append(i)\r\n if word[i]+word[i+1]==\"BA\":\r\n n2.append(i)\r\nfor j in n1:\r\n for m in n2:\r\n if abs(j-m)>=2:\r\n bool=True\r\n break \r\nif bool:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\n \n \nAB_POSITION = s.find(\"AB\")\n \nBA_POS= s.find(\"BA\")\n \nif AB_POSITION != -1 and BA_POS!= -1 and abs(AB_POSITION - BA_POS) > 1:#To check postion of AB and BA in string and substring is occuremore than 1 time\n print(\"YES\") #if AB found at start point and BA is found in last position of string s print yes \nelse:\n # Check if the positions of the substrings are reversed\n if BA_POS!= -1 and s.find(\"AB\", BA_POS+ 2) != -1:\n print(\"YES\")\n elif AB_POSITION != -1 and s.find(\"BA\", AB_POSITION + 2) != -1: #it finds the ba from string and increment ab postion by\n print(\"YES\")\n else:\n print(\"NO\")\n\t\t\t \t \t\t\t\t\t\t \t \t \t \t \t \t", "st = input()\ncontains_AB = 'AB' in st\ncontains_BA = 'BA' in st\n\nif (contains_AB and 'BA' in st[st.index('AB')+2:]) or (contains_BA and 'AB' in st[st.index('BA')+2:]):\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 itertools import combinations\r\ndef finding(test_str):\r\n ab = [];\r\n ba = [];\r\n i = test_str.find('AB');\r\n j = test_str.find('BA');\r\n\r\n while True:\r\n if(i != -1):\r\n ab.append(i);\r\n i = test_str.find('AB',i+1);\r\n elif j != -1:\r\n ba.append(j);\r\n j = test_str.find('BA',j+1)\r\n if(i == -1 and j == -1):\r\n break;\r\n for g in ab:\r\n for s in ba:\r\n if(g+1 != s and g!= s and g-1 != s):\r\n return 'YES';\r\n return 'NO';\r\n\r\nstr = input()\r\nprint(finding(str));\r\n\r\n", "word = input()\r\n\r\nif len(word) < 3:\r\n print('NO')\r\nelse:\r\n out = []\r\n for i in (('AB', 'BA'), ('BA', 'AB')):\r\n i1 = word.find(i[0])\r\n i2 = word.rfind(i[1])\r\n\r\n if -1 in (i1, i2):\r\n out.append(False)\r\n else:\r\n out.append(abs(i1 - i2) >= 2)\r\n\r\n print('YES' if any(out) else 'NO')\r\n", "str = input()\n\nif 'AB' in str and 'BA' in str[str.index('AB')+2:]:\n print(\"YES\")\nelif 'BA' in str and 'AB' in str[str.index('BA')+2:]:\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 \t\t\t\t\t \t \t\t\t\t\t \t \t\t\t\t\t\t \t", "def main():\n s = input().strip()\n ab = s.find(\"AB\")\n ba = s.find(\"BA\", ab + 2)\n if ba == -1:\n ba = s.find(\"BA\")\n ab = s.find(\"AB\", ba + 2)\n if ab != -1 and ba != -1:\n print(\"YES\")\n else:\n print(\"NO\")\n\nif __name__ == \"__main__\":\n main()\n", "\r\nif __name__=='__main__':\r\n s_arr = input()\r\n n_arr = []\r\n for i in s_arr:\r\n n_arr.append(i)\r\n # print(s_arr, n_arr)\r\n ab1 = 0\r\n ba1 = 0\r\n ab2=0\r\n ba2=0\r\n i = 0\r\n while 1:\r\n if i==len(n_arr)-1:\r\n break\r\n if n_arr[i]=='A' and n_arr[i+1]=='B':\r\n ab1=1\r\n i+=2\r\n break\r\n i+=1\r\n j = i\r\n while 1:\r\n if j>=len(n_arr)-1:\r\n break\r\n if n_arr[j]=='B' and n_arr[j+1]=='A':\r\n ba1=1\r\n break\r\n j+=1 \r\n i = 0\r\n while 1:\r\n if i==len(n_arr)-1:\r\n break\r\n if n_arr[i]=='B' and n_arr[i+1]=='A':\r\n ba2=1\r\n i+=2\r\n break\r\n i+=1\r\n j = i\r\n while 1:\r\n if j>=len(n_arr)-1:\r\n break\r\n if n_arr[j]=='A' and n_arr[j+1]=='B':\r\n ab2=1\r\n break\r\n j+=1 \r\n \r\n if ab1 and ba1:\r\n print(\"YES\")\r\n elif ab2 and ba2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s = input()\r\nab = set()\r\nba = set()\r\nfor i in range(1,len(s)):\r\n if s[i]=='B' and s[i-1] == 'A':\r\n ba.add(i-1)\r\n if s[i]=='A' and s[i-1] == 'B':\r\n ab.add(i-1)\r\nfor a in ab:\r\n for b in ba:\r\n if abs(a-b)>1:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "s = input()\r\nab = []\r\nba = []\r\nflag = 0\r\nfor i in range(len(s)-1):\r\n ss = s[i:i+2]\r\n if ss == 'AB':\r\n ab.append(i)\r\n elif ss == 'BA':\r\n ba.append(i)\r\nif min(len(ab),len(ba)) == 0:\r\n print('NO')\r\nelse:\r\n ans = 'NO'\r\n for i in ab:\r\n if flag == 1:\r\n break\r\n for j in ba:\r\n if abs(j-i)>1:\r\n ans = 'YES'\r\n flag = 1\r\n print(ans)\r\n", "def judge(string):\r\n if len(string)<=3:\r\n return 'NO'\r\n for i in range(len(string)):\r\n if string[i:i+2]=='AB':\r\n AB_index.append(i)\r\n elif string[i:i+2]=='BA':\r\n BA_index.append(i)\r\n for j in AB_index:\r\n if len([x for x in BA_index if x<=j-2 or x>=j+2])!=0:\r\n return 'YES'\r\n return 'NO'\r\n\r\nAB_index=[]\r\nBA_index=[]\r\nstring=input()\r\nprint(judge(string))", "string = input()\r\n \r\ndef find_substring(start, string, substring):\r\n for i in range(start, len(string)-1):\r\n if string[i: i+len(substring)] == substring:\r\n return i\r\n return -1\r\n\r\n\r\n\r\ndef solve(sub_input):\r\n\r\n\r\n index = find_substring(0, sub_input, 'AB')\r\n if index!=-1:\r\n index = find_substring(index + 2, sub_input, 'BA')\r\n if index!=-1:\r\n return 'YES'\r\n\r\n index = find_substring(0, sub_input, 'BA')\r\n if index != -1:\r\n index = find_substring(index + 2, sub_input, 'AB')\r\n if index != -1:\r\n return 'YES'\r\n\r\n return 'NO'\r\n \r\nprint(solve(string))", "string = input()\n\nif 'AB' in string and 'BA' in string[string.index('AB') + 2:]:\n print(\"YES\")\nelif 'BA' in string and 'AB' in string[string.index('BA') + 2:]:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t\t \t\t\t \t \t\t\t\t \t\t \t\t \t", "def contains_non_overlapping_AB_BA(s):\n # Check for \"AB\" followed by \"BA\"\n for i in range(len(s) - 1):\n if s[i:i + 2] == \"AB\" and \"BA\" in s[i + 2:]:\n return \"YES\"\n\n # Check for \"BA\" followed by \"AB\"\n for i in range(len(s) - 1):\n if s[i:i + 2] == \"BA\" and \"AB\" in s[i + 2:]:\n return \"YES\"\n\n return \"NO\"\n\n# Example usage:\ns = input().strip()\nresult = contains_non_overlapping_AB_BA(s)\nprint(result)\n\n\t \t\t\t \t \t\t\t\t\t\t \t \t\t\t\t \t\t\t", "from bisect import bisect_left\n\ndef solve():\n s = input()\n n = len(s)\n\n ab_inds, ba_inds = [], []\n for i in range(n-1):\n if s[i:i+2] == 'AB':\n ab_inds.append(i)\n elif s[i:i+2] == 'BA':\n ba_inds.append(i)\n len_ab, len_ba = len(ab_inds), len(ba_inds)\n if not ab_inds or not ba_inds:\n print('NO')\n return\n\n for i in ab_inds:\n j = bisect_left(ba_inds, i+2)\n if j < len_ba: \n print('YES')\n return \n \n for i in ba_inds:\n j = bisect_left(ab_inds, i+2)\n if j < len_ab: \n print('YES')\n return\n \n print('NO')\n return \n\nsolve()", "s = input()\r\nx = s.find('AB')\r\nb = s.find('BA')\r\nprint(\"YES\" if (x >=0 and s.find('BA', x+2) >= 0) or (b>=0 and s.find('AB', b+2) >= 0) else \"NO\")\r\n", "c=input()\r\nn,m=0,0\r\nfor i in range(len(c)-1):\r\n if c[i]+c[i+1]==\"AB\" and n==0:\r\n n+=1\r\n g=i+1\r\n if c[i]+c[i+1]==\"BA\" and m==0:\r\n m+=1\r\n gg=i+1\r\n if n:\r\n if c[i]+c[i+1]==\"BA\" and i!=g:\r\n print(\"YES\")\r\n break\r\n if m:\r\n if c[i]+c[i+1]==\"AB\" and i!=gg:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\nx=s.find(\"AB\")\ny=s.find(\"BA\",x+2)\ni=s.find(\"BA\")\nj=s.find(\"AB\",i+2)\nif x>-1 and y>-1:\n print(\"yes\")\nelif i>-1 and j>-1:\n print(\"yes\")\nelse:print(\"no\")\n\t \t\t\t \t\t\t \t\t \t \t \t \t\t\t \t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n STRING:str = input().rstrip()\r\n\r\n\r\n isExists:list[bool] = []\r\n for charL, charR in ((\"A\", \"B\"), (\"B\", \"A\")) :\r\n isExist:bool = False\r\n\r\n leftABIndex, rightBAIndex = -1, -1\r\n for i in range(0, len(STRING)-1) :\r\n if (STRING[i] == charL) and (STRING[i+1] == charR) :\r\n leftABIndex = i\r\n break\r\n for i in range(len(STRING)-1, 0, -1) :\r\n if (STRING[i] == charL) and (STRING[i-1] == charR) :\r\n rightBAIndex = i-1\r\n break\r\n\r\n if leftABIndex==-1 or rightBAIndex==-1 : isExist = False\r\n else : isExist = abs(leftABIndex-rightBAIndex)>=2\r\n isExists.append(isExist)\r\n\r\n\r\n print([\"NO\", \"YES\"][any(isExists)])\r\n\r\nmain()", "c = input()\r\nfound_ab = False\r\nfound_ba = False\r\n\r\n# Find the first occurrence of \"AB\"\r\nab_index = c.find(\"AB\")\r\nif ab_index != -1:\r\n # Find the first occurrence of \"BA\" after the \"AB\"\r\n ba_index = c.find(\"BA\", ab_index + 2)\r\n if ba_index != -1:\r\n found_ab = True\r\n found_ba = True\r\n\r\n# Find the first occurrence of \"BA\"\r\nba_index = c.find(\"BA\")\r\nif ba_index != -1:\r\n # Find the first occurrence of \"AB\" after the \"BA\"\r\n ab_index = c.find(\"AB\", ba_index + 2)\r\n if ab_index != -1:\r\n found_ab = True\r\n found_ba = True\r\n\r\nif found_ab and found_ba:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "z=input()\nu=z.find('AB')\nv=z.find('BA')\nprint('YES'if(u+1and z.find('BA',u+2)+1)or(v+1and z.find('AB',v+2)+1)else'NO')\n\t \t\t \t \t\t \t\t\t\t\t\t \t\t\t \t \t", "s = input()\r\nans = None\r\nif \"AB\" in s: \r\n s_ = s[0:s.index(\"AB\")] + 'XX' + s[s.index(\"AB\") + 2:]\r\n if \"BA\" in s_: ans = True; print(\"YES\")\r\n else: ans = False\r\nif not ans:\r\n if \"BA\" in s: \r\n s_ = s[0:s.index(\"BA\")] +'XX'+ s[s.index(\"BA\") + 2:]\r\n if \"AB\" in s_: ans = True; print(\"YES\")\r\n else: ans = False\r\nif not ans: print (\"NO\")\r\n", "s = input()\r\nAB, BA = set(), set()\r\nfor i in range(len(s)-1):\r\n if s[i] == 'A' and s[i+1] == 'B':\r\n AB.add(i)\r\n continue\r\n if s[i] == 'B' and s[i+1] == 'A':\r\n BA.add(i)\r\nif len(AB) == 0 or len(BA) == 0:\r\n print(\"NO\")\r\nelse:\r\n ans = \"NO\"\r\n found = False\r\n for ab in AB:\r\n if found: break\r\n for ba in BA:\r\n if ab+1 == ba or ab-1 == ba:\r\n continue\r\n else:\r\n found = True\r\n ans = \"YES\"\r\n break\r\n print(ans)", "def check(s):\r\n if \"AB\" in s:\r\n index_AB = s.index(\"AB\")\r\n if \"BA\" in s[index_AB + 2:]:\r\n return \"YES\"\r\n \r\n if \"BA\" in s:\r\n index_BA = s.index(\"BA\")\r\n if \"AB\" in s[index_BA + 2:]:\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n\r\nprint(check(input()))\r\n", "s=input()\r\nif not(s.count(\"AB\")) or not(s.count(\"BA\")):\r\n print(\"NO\")\r\nelif s.count(\"ABABA\") or s.count(\"BABAB\"):\r\n print(\"YES\")\r\nelse:\r\n final=\" \"\r\n for i in s:\r\n if (i==\"A\" or i==\"B\") and i!=final[-1]:\r\n final+=i\r\n else:\r\n final+=\" \"\r\n if (i==\"A\" or i==\"B\"):\r\n final+=i\r\n lis=list(filter(lambda x:x!=\"A\" and x!=\"B\" and x!=\" \",final.split()))\r\n ab=0;ba=0;extra=0\r\n for i in lis:\r\n if i==\"AB\":\r\n ab+=1\r\n elif i==\"BA\":\r\n ba+=1\r\n else:\r\n extra+=1\r\n if extra+min(1,ab)+min(ba,1)>1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "string = [char for char in input()]\r\nstorage = [\"\" for i in string]\r\ndef solve():\r\n for i in reversed(range(len(storage)-1)):\r\n storage[i] = storage[i+1]\r\n if string[i] == \"A\":\r\n if string[i+1] == \"B\":\r\n storage[i] = \"AB\"\r\n if i+2<len(storage)and (storage[i+2] == \"BA\" or storage[i+2] == \"either\"):\r\n return \"YES\"\r\n elif storage[i+1] == \"BA\":\r\n storage[i] = \"either\"\r\n if string[i] == \"B\":\r\n if string[i+1] == \"A\":\r\n storage[i] = \"BA\"\r\n if i+2<len(storage) and (storage[i+2] == \"AB\" or storage[i+2] == \"either\"): \r\n return \"YES\"\r\n elif storage[i+1] == \"AB\":\r\n storage[i] = \"either\"\r\n return \"NO\"\r\nprint(solve())", "s = input()\r\n\r\n# Find the first occurrence of \"AB\" and search for \"BA\" after it\r\nif \"AB\" in s and \"BA\" in s[s.index(\"AB\") + 2:]:\r\n print('YES')\r\n exit()\r\n\r\n# Find the first occurrence of \"BA\" and search for \"AB\" after it\r\nif \"BA\" in s and \"AB\" in s[s.index(\"BA\") + 2:]:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n", "s=input()\r\na=s.count(\"AB\")\r\nb=s.count(\"BA\")\r\nc=s.count(\"ABA\")\r\nd=s.count(\"BAB\")\r\n\r\nif a > 0 and b > 0 and (a * b) - c - d > 0: print(\"YES\")\r\nelse: print(\"NO\")", "def main():\r\n s = input()\r\n a = s.find('AB')\r\n b = s.find('BA', a+2)\r\n c = s.find('BA')\r\n d = s.find('AB', c+2)\r\n if (a!=-1 and b!=-1 or c!=-1 and d!=-1): print(\"YES\")\r\n else: print(\"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "s = input()\r\n\r\n# Search for the first occurrence of \"AB\" and look for \"BA\" after that index\r\nif 'AB' in s:\r\n index_AB = s.index('AB')\r\n if 'BA' in s[index_AB + 2:]:\r\n print('YES')\r\n exit()\r\n\r\n# Search for the first occurrence of \"BA\" and look for \"AB\" after that index\r\nif 'BA' in s:\r\n index_BA = s.index('BA')\r\n if 'AB' in s[index_BA + 2:]:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n", "s = input()\r\n\r\ndef contains_non_overlapping(s):\r\n ab_index = s.find('AB')\r\n if ab_index != -1 and s.find('BA', ab_index + 2) != -1:\r\n return 'YES'\r\n \r\n ba_index = s.find('BA')\r\n if ba_index != -1 and s.find('AB', ba_index + 2) != -1:\r\n return 'YES'\r\n \r\n return 'NO'\r\n\r\nprint(contains_non_overlapping(s))\r\n", "string=input()\r\na=string.find('AB')\r\nb=string.find('BA',a+2)\r\nc=string.find('BA')\r\nd=string.find('AB',c+2)\r\nif((a!=-1 and b!=-1) or (c!=-1 and d!=-1)):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "string = input()\r\n\r\ndef solve(sub_input):\r\n AB = []\r\n BA = []\r\n for i in range(len(sub_input) - 1):\r\n if sub_input[i: i + 2] == 'AB':\r\n AB.append([i, i + 1])\r\n elif sub_input[i: i + 2] == 'BA':\r\n BA.append([i, i + 1])\r\n if len(AB) == 0 or len(BA) == 0:\r\n return 'NO'\r\n flag = False\r\n for ab in AB:\r\n for ba in BA:\r\n if ab[1] < ba[0] or ab[0] > ba[1]:\r\n return 'YES'\r\n return 'NO'\r\n\r\nprint(solve(string))", "str=input()\r\nx1=str.find(\"AB\")\r\nx2=str.find(\"BA\",x1+2)\r\ny1=str.find(\"BA\")\r\ny2=str.find(\"AB\",y1+2)\r\nif (x1!=-1 and x2!=-1) or (y1!=-1 and y2!=-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "a=input()\r\nx=[]\r\ny=[]\r\nfor i in range(len(a)):\r\n if a[i:i+2]==\"AB\":\r\n x.append(i)\r\n elif a[i:i+2]==\"BA\":\r\n y.append(i)\r\nfor i in range(len(x)):\r\n for j in range(len(y)):\r\n if x[i]-y[j]>1 or x[i]-y[j]<-1:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n\r\n", "s = input().upper()\r\ni = 0\r\nab, ba,aba = 0,0,0\r\nwhile i<len(s)-1:\r\n if s[i:i+3] in [\"BAB\",\"ABA\"]:\r\n ab+=1\r\n ba+=1\r\n aba+=1\r\n i+=2\r\n elif s[i]==\"A\" and s[i+1]==\"B\":\r\n ab +=1\r\n i+=1\r\n elif s[i]==\"B\" and s[i+1]==\"A\":\r\n ba+=1\r\n i+=1\r\n i+=1\r\n if ab>0 and ba>0 and (not aba==ba==ab==1):\r\n print(\"YES\")\r\n break\r\nelse:print(\"NO\")", "# Wadea #\r\n \r\ns = list(input())\r\nss = s.copy()\r\nw = 0\r\nr = 0\r\nfor i in range(len(s)-1):\r\n if s[i] == \"A\" and s[i+1] == \"B\":\r\n s[i] = \" \"\r\n s[i+1] = \" \"\r\n s = \"\".join(s)\r\n if \"BA\" in s:\r\n print(\"YES\")\r\n r = 1\r\n w = 1\r\n break\r\nfor j in range(len(ss)-1):\r\n if ss[j] == \"B\" and ss[j+1] == \"A\" and r != 1:\r\n ss[j] = \" \"\r\n ss[j+1] = \" \"\r\n ss = \"\".join(ss)\r\n if \"AB\" in ss:\r\n print(\"YES\")\r\n w = 1\r\n break\r\nif w != 1:\r\n print(\"NO\")", "string = input()\r\n\r\nif 'ABBA' in string or 'BAAB' in string:\r\n print('YES')\r\nelse:\r\n flag = False\r\n \r\n if 'AB' in string:\r\n if 'BA' in string[string.index('AB') + 2:]:\r\n flag = True\r\n if 'BA' in string:\r\n if 'AB' in string[string.index('BA') + 2:]:\r\n flag = True\r\n \r\n print(('NO', 'YES')[flag])", "import re\n\ns = input()\nabs_pos = [m.start() for m in re.finditer('AB', s)]\nb_pos = [m.start() for m in re.finditer('BA', s)]\n\nfound = False\n\nfor num1 in abs_pos:\n for num2 in b_pos:\n if abs(num1 - num2) > 1:\n found = True\n break\n if found:\n break\n\nif found:\n print('YES')\nelse:\n print('NO')\n\n \t \t\t \t \t\t \t \t \t\t\t \t \t \t\t \t \t", "import sys\r\ndef AB(a, i):\r\n k1 = False\r\n while i < len(a):\r\n if a[i:i+2] == ['A', 'B']:\r\n k1 = True\r\n a[i] = '/'\r\n a[i+1] = '/'\r\n break\r\n i += 1\r\n i = 0\r\n return k1\r\n\r\ndef BA(a, i):\r\n k = False\r\n while i < len(a):\r\n if a[i:i+2] == ['B', 'A']:\r\n k = True\r\n a[i] = '/'\r\n a[i+1] = '/'\r\n break\r\n i += 1\r\n i = 0\r\n return k\r\n\r\nb = input()\r\na = list(b)\r\nc = list(b)\r\nf = 0\r\nf1 = 0\r\ni = 0\r\nf1 = AB(a, i)\r\nf = BA(a, i)\r\nif f1 == f == True:\r\n print('YES')\r\n sys.exit()\r\nelse:\r\n a = c\r\n f = BA(a, i)\r\n f1 = AB(a, i)\r\n if f1 == f == True:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "def check_substrings(s):\r\n # Check if \"AB\" and \"BA\" exist in the string, non-overlapping\r\n if \"AB\" in s and \"BA\" in s[s.index(\"AB\")+2:]:\r\n return \"YES\"\r\n if \"BA\" in s and \"AB\" in s[s.index(\"BA\")+2:]:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n# Read the input string\r\ns = input()\r\n\r\n# Call the function to check substrings\r\nresult = check_substrings(s)\r\n\r\n# Print the result\r\nprint(result)\r\n", "s=input()\nn=len(s)\nx=s.find(\"AB\")\ny=s.find(\"BA\")\nif x!=-1 and y!=-1:\n p_=s[x+2:].find(\"BA\")\n p=s[y+2:].find(\"AB\")\n if p_!=-1 or p!=-1:print(\"YES\")\n else: print(\"NO\")\nelse:print(\"NO\")", "string = input()\r\nfound_ab = False\r\nfound_ba = False\r\nab_indices = []\r\nba_indices = []\r\n\r\nfor i in range(len(string) - 1):\r\n if string[i:i+2] == \"AB\":\r\n found_ab = True\r\n ab_indices.append(i)\r\n if string[i:i+2] == \"BA\":\r\n found_ba = True\r\n ba_indices.append(i)\r\n\r\nnon_overlapping = False\r\nfor ab_index in ab_indices:\r\n for ba_index in ba_indices:\r\n if abs(ab_index - ba_index) > 1:\r\n non_overlapping = True\r\n break\r\n\r\n if non_overlapping:\r\n break\r\n\r\nif found_ab and found_ba and non_overlapping:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\"\"\"\r\n author: Adham0 \r\n created: 03.08.2023 00:01:16\r\n ### Adham was here ###\r\n \r\n █████ ██████ ██ ██ █████ ███ ███\r\n ██ ██ ██ ██ ██ ██ ██ ██ ████ ████\r\n ███████ ██ ██ ███████ ███████ ██ ████ ██\r\n ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ \r\n ██ ██ ██████ ██ ██ ██ ██ ██ ██\r\n\"\"\"\r\n\r\ns = input()\r\n\r\nl1 = float('inf') ; r1 = -100\r\nl2 = float('inf') ; r2 = -100\r\n\r\ni = 0\r\nwhile i < len(s) - 1:\r\n if s[i] == 'A' and s[i + 1] == 'B':\r\n l1 = min(l1, i)\r\n r1 = max(r1, i)\r\n elif s[i] == 'B' and s[i + 1] == 'A':\r\n l2 = min(l2, i)\r\n r2 = max(r2, i)\r\n i += 1\r\n \r\nr1 -= 1\r\nr2 -= 1\r\n\r\nif r1 > l2 or r2 > l1:\r\n print('YES')\r\nelse:\r\n print('NO')", "s = input()\r\nv = []\r\nw = []\r\nfor i in range(len(s) - 1):\r\n if s[i:i+2] == 'AB':\r\n v.append(i)\r\n elif s[i:i+2] == 'BA':\r\n w.append(i)\r\nif len(v) * len(w) == 0:\r\n print(\"NO\")\r\nelse:\r\n if len(v) + len(w) >= 4:\r\n print(\"YES\")\r\n elif len(v) == 1 == len(w):\r\n print(\"NO\" if abs(v[0] - w[0]) == 1 else \"YES\")\r\n elif len(v) == 2:\r\n print(\"NO\" if v[1] - v[0] == 2 else \"YES\")\r\n else:\r\n print(\"NO\" if w[1] - w[0] == 2 else \"YES\")\r\n", "s = input()\r\n\r\nfab = s.find(\"AB\")\r\nlab = s.rfind(\"AB\")\r\nfba = s.find(\"BA\")\r\nlba = s.rfind(\"BA\")\r\n\r\nif fab != -1 and lba != -1 and lba - fab > 1:\r\n print(\"YES\")\r\nelif fba != -1 and lab != -1 and lab - fba > 1:\r\n print(\"YES\")\r\nelse: print(\"NO\")", " \r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n#print = lambda x: sys.stdout.write(str(x) + \"\\n\")\r\n \r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\n#SLMII = lambda: sorted(LMII())\r\n\r\ns = input()\r\nn = len(s)\r\n\r\ndef isWordInStr(s, word):\r\n m = len(word)\r\n n = len(s)\r\n for k in range(n-m+1):\r\n for i in range(m):\r\n if s[k+i] != word[i]:\r\n break\r\n else:\r\n return k+m\r\n \r\n return -1\r\n \r\npos1 = isWordInStr(s, 'AB')\r\npos2 = isWordInStr(s, 'BA')\r\n\r\nfABBA = fBAAB = False\r\nif pos1 != -1 and isWordInStr(s[pos1:], 'BA') != -1:\r\n fABBA = True\r\nif pos2 != -1 and isWordInStr(s[pos2:], 'AB') != -1:\r\n fBAAB = True\r\n \r\nprint('YES' if fABBA or fBAAB else 'NO')\r\n \r\n \r\n", "a = input()\r\nt = False\r\nt1 = False\r\ni = 1\r\nwhile i < len(a):\r\n if t1 and a[i - 1] + a[i] == \"BA\":\r\n t = True\r\n if a[i - 1] + a[i] == \"AB\" and not t1:\r\n t1 = True\r\n i += 1\r\n i += 1\r\nt1 = False\r\ni = 1\r\nwhile i < len(a):\r\n if t1 and a[i - 1] + a[i] == \"AB\":\r\n t = True\r\n if a[i - 1] + a[i] == \"BA\" and not t1:\r\n t1 = True\r\n i += 1\r\n i += 1\r\nprint(\"YES\" if t else \"NO\")\r\n", "s = input()\r\nl1,l2 = [],[]\r\nfor i in range(1,len(s)):\r\n if s[i-1]=='A' and s[i]=='B':\r\n l1.append(i-1)\r\n if s[i-1]=='B' and s[i]=='A':\r\n l2.append(i-1)\r\n\r\nif l1==[] or l2==[]: print('NO')\r\nelse:\r\n x,y,f = l2[0],l2[len(l2)-1],0\r\n for i in l1:\r\n if abs(i-x)>1 or abs(i-y)>1:\r\n print('YES'); f=1; break\r\n \r\n if not f: print('NO')", "s = input()\r\nla, ra, lb, rb = s.find(\"AB\"), s.rfind(\"AB\"), s.find(\"BA\"), s.rfind(\"BA\")\r\nprint([\"NO\", \"YES\"][ra >= 0 and lb >= 0 and ra - lb >= 2 or rb >= 0 and la >= 0 and rb - la >= 2])\r\n\r\n", "def f(s):\r\n n=len(s)\r\n x=\"kl\"\r\n y=\"j\"\r\n z=\"k\"\r\n a=\"a\"\r\n for i in range(n-1):\r\n if s[i]==\"A\" and s[i+1]==\"B\":\r\n x=i\r\n for i in range(n-1):\r\n if s[i]==\"B\" and s[i+1]==\"A\":\r\n y=i\r\n for i in range(n-2,-1,-1):\r\n if s[i]==\"A\" and s[i+1]==\"B\":\r\n z=i\r\n for i in range(n-2,-1,-1):\r\n if s[i]==\"B\" and s[i+1]==\"A\":\r\n a=i\r\n if type(x)==int and type(a)==int:\r\n if abs(x-a)>1:\r\n return \"YES\"\r\n if type(y)==int and type(z)==int:\r\n if abs(y-z)>1:\r\n return \"YES\"\r\n return \"NO\"\r\nx=input()\r\nprint(f(x))\r\n", "s=input()\r\nn=len(s)\r\nA=\"AB\"\r\nB=\"BA\"\r\nsign=0\r\ncount=0\r\nindex=n\r\nfor i in range(n):\r\n if s[i]!=A[count]:\r\n count=0\r\n if s[i]==A[count]:\r\n count+=1\r\n if count==2:\r\n index=i+1\r\n break\r\ncount=0\r\nfor i in range(index,n):\r\n if s[i]!=B[count]:\r\n count=0\r\n if s[i]==B[count]:\r\n count+=1\r\n if count==2:\r\n sign=1\r\n break\r\n else:\r\n count=0\r\nif sign:\r\n print(\"YES\")\r\nelse:\r\n sign=0\r\n count=0\r\n index=n\r\n for i in range(n):\r\n if s[i]!=B[count]:\r\n count +=0\r\n if s[i]==B[count]:\r\n count+=1\r\n if count==2:\r\n index=i+1\r\n break\r\n else:\r\n count = 0\r\n count=0\r\n for i in range(index,n):\r\n if s[i]!=A[count]:\r\n count +=0\r\n if s[i]==A[count]:\r\n count+=1\r\n if count==2:\r\n sign=1\r\n break\r\n else:\r\n count = 0\r\n if sign:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n", "import sys\r\nfrom math import *\r\n# from pprint import pprint as pprint\r\n# from sympy.ntheory.modular import crt\r\nimport heapq\r\nfrom copy import *\r\nfrom collections import *\r\nimport functools\r\nfrom itertools import *\r\nfrom math import sqrt, ceil\r\nimport threading\r\nimport cmath\r\nimport time\r\nimport re\r\n# fin = sys.stdin.read().strip()\r\n\r\ndef solve():\r\n s = input()\r\n ab = []\r\n ba = []\r\n for i in range(len(s) - 1):\r\n if s[i] == 'A' and s[i + 1] == 'B':\r\n ab.append(i)\r\n elif s[i] == 'B' and s[i + 1] == 'A':\r\n ba.append(i)\r\n if not ab or not ba:\r\n print(\"NO\")\r\n return\r\n\r\n if abs(ab[0] - ba[-1]) > 1 or abs(ab[-1] - ba[0]) > 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n # t = int(input())\r\n # for _ in range(t):\r\n # solve()\r\n solve()\r\n", "s = input()\r\na = s.count(\"AB\")\r\nb = s.count(\"BA\")\r\ncn = s.count(\"ABA\") + s.count(\"BAB\")\r\nprint([\"NO\", \"YES\"][(a + b) * (a != 0 and b != 0) - cn > 1])", "def matcher(s):\r\n patterns = ['AB', 'BA']\r\n for p in [patterns, patterns[::-1]]:\r\n one = s.find(p[0])\r\n sec = s.find(p[1], one + 2)\r\n if is_valid(one, sec): return True\r\n return False\r\n\r\ndef is_valid(first, sec):\r\n if first == -1 or sec == -1: return False\r\n return abs(first - sec) > 1\r\n\r\ns = input()\r\nprint('YES' if matcher(s) else 'NO')", "a = input()\r\n\r\n# Find the first occurrence of \"AB\"\r\nab_index = a.find(\"AB\")\r\nif ab_index != -1:\r\n # Check if \"BA\" occurs after the \"AB\" substring\r\n if \"BA\" in a[ab_index + 2:]:\r\n print(\"YES\")\r\n exit()\r\n\r\n# Find the first occurrence of \"BA\"\r\nba_index = a.find(\"BA\")\r\nif ba_index != -1:\r\n # Check if \"AB\" occurs after the \"BA\" substring\r\n if \"AB\" in a[ba_index + 2:]:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n", "s = input()\r\nab = s.find('AB')\r\nba1 = s.find('BA',ab+2)\r\nba = s.find('BA')\r\nab1 = s.find('AB',ba+2)\r\n\r\nif (ab != -1 and ba1 != -1) or (ba != -1 and ab1 != -1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nprint('YES'\r\n if ('AB' in s\r\n and 'BA' in s.replace('AB', '-', 1))\r\n or ('BA' in s\r\n and 'AB' in s.replace('BA', '-', 1))\r\n else 'NO')\r\n", "a=input()\r\nb=[]\r\nc=[]\r\nfor d in range(len(a)-1):\r\n if a[d:d+2]==\"AB\":b.append(d)\r\n elif a[d:d+2]==\"BA\":c.append(d)\r\nif len(b)==0 or len(c)==0:print(\"NO\")\r\nelif abs(min(b)-max(c))>1 or abs(max(b)-min(c))>1:print('YES')\r\nelse:print(\"NO\")", "def resolve(input_str: str):\r\n if 'AB' in input_str and 'BA' in input_str[input_str.index('AB')+2:]:\r\n print(\"YES\")\r\n elif 'BA' in input_str and 'AB' in input_str[input_str.index('BA')+2:]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\ndata = input().strip()\r\nresolve(data)\r\n", "s = str(input())\ntab = s.count(\"AB\")\ntba = s.count(\"BA\")\nflag = 1 if tab > 0 and tba > 0 and (tab+tba-s.count(\"ABA\")-s.count(\"BAB\") >= 2) else 0\nprint(\"YES\" if flag else \"NO\")\n \t \t\t\t\t \t\t\t\t \t \t \t\t \t \t\t", "def f(s):\r\n if 'AB' in s:\r\n k = s.index('AB')\r\n k += 2\r\n s = s[k:]\r\n if 'BA' in s:\r\n return True\r\n return False\r\n\r\n\r\ndef g(s):\r\n if 'BA' in s:\r\n k = s.index('BA')\r\n k += 2\r\n s = s[k:]\r\n if 'AB' in s:\r\n return True\r\n return False\r\n\r\n\r\ns = input()\r\nif f(s) or g(s):\r\n print('YES')\r\nelse:\r\n print('NO')", "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\nu = [[65, 66], [66, 65]]\r\nans = \"NO\"\r\nfor _ in range(2):\r\n i, j = 0, 0\r\n while i < 2 and j < len(s) - 1:\r\n x, y = u[i]\r\n if s[j] == x and s[j + 1] == y:\r\n i += 1\r\n j += 1\r\n j += 1\r\n if i == 2:\r\n ans = \"YES\"\r\n break\r\n u[0], u[1] = u[1], u[0]\r\nprint(ans)", "s = \"ABCBA\"\n\n\ndef solve(s):\n i = 0\n ba = False\n ab = False\n\n while i < len(s) - 1:\n if not ba and s[i] == 'B' and s[i + 1] == 'A':\n ba = True\n i += 2\n continue\n\n if not ab and s[i] == 'A' and s[i + 1] == 'B':\n ab = True\n i += 2\n continue\n\n i += 1\n\n if ab and ba:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\ndef find_ab(s):\n i = 0\n while i < len(s) - 1:\n if s[i] == 'A' and s[i + 1] == 'B':\n return i\n i += 1\n return -1\n\n\ndef find_ba(s):\n i = 0\n while i < len(s) - 1:\n if s[i] == 'B' and s[i + 1] == 'A':\n return i\n i += 1\n return -1\n\n\ndef _solve(s):\n idx1 = find_ab(s)\n if idx1 == -1:\n res1 = -1\n else:\n res1 = find_ba(s[idx1 + 2:])\n\n idx2 = find_ba(s)\n\n if idx2 == -1:\n res2 = -1\n else:\n res2 = find_ab(s[idx2 + 2:])\n\n if res1 == -1 and res2 == -1:\n print(\"NO\")\n else:\n print(\"YES\")\n\n\nif __name__ == '__main__':\n s = input()\n _solve(s)\n\n\n", "st = input().strip()\r\nab = st.find(\"AB\")\r\nba = st.find(\"BA\")\r\nans = False\r\nif ab != -1:\r\n if ab + 2 < len(st):\r\n temp_ba = st[ab+2:].find(\"BA\")\r\n\r\n if temp_ba != -1:\r\n ans = True\r\n\r\nif ba != -1:\r\n if ba + 2 < len(st):\r\n temp_ab = st[ba+2:].find(\"AB\")\r\n\r\n if temp_ab != -1:\r\n ans = True\r\n \r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=input()\nn=len(s)\nab=0\nba=0\naba=0\nbab=0\ni=0\nwhile i < n-1:\n\t#print(i)\n\tif s[i]==\"A\" and s[i+1]==\"B\":\n\t\tif i<n-2 and s[i+2]==\"A\":\n\t\t\taba+=1\n\t\t\ti+=1\n\t\telse:\n\t\t\tab+=1\n\t\ti+=1\n\telif s[i]==\"B\" and s[i+1]==\"A\":\n\t\tif i<n-2 and s[i+2]==\"B\":\n\t\t\tbab+=1\n\t\t\ti+=1\n\t\telse:\n\t\t\tba+=1\n\t\ti+=1\n\ti+=1\n#print(ab,ba, aba,bab)\nif ab+ba==0:\n\tif (aba>1 or bab>1) or (aba>0 and bab>0):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\nelif ab==0 or ba==0:\n\tif aba>0 or bab>0:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\nelse:\n\tprint(\"YES\")", "string = input()\r\nstring_len = len(string)\r\ns_ab = []\r\ns_ba = []\r\nfor i in range(string_len-1):\r\n s_t = string[i:2+i]\r\n if s_t == 'AB': \r\n s_ab.append(i + i+1)\r\n elif s_t == 'BA':\r\n s_ba.append(i + i+1)\r\n \r\nif len(s_ab) == 0 or len(s_ba) == 0:\r\n print('NO')\r\nelse:\r\n ans = (max(s_ab) - min(s_ba) > 2) or (max(s_ba) - min(s_ab) > 2)\r\n print('YES' if ans else 'NO')", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n s = input()\r\n if ('BA' in s[s.find('AB') + 2:] or 'AB' in s[s.find('BA') + 2:]) and 'BA' in s and 'AB' in s:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "s=input()\r\ns=s+'000'\r\ns='0'+s\r\nab=False\r\nba=False\r\nconsecab=False\r\nconsecba=False\r\ncurstart=None\r\ncurlength=0\r\nfor i in range(1,len(s)-3):\r\n if s[i]!='B' and s[i+1]=='A' and s[i+2]=='B' and s[i+3]!='A':\r\n ab=True\r\n if s[i]!='A' and s[i+1]=='B' and s[i+2]=='A' and s[i+3]!='B':\r\n ba=True\r\n if s[i]=='A' and s[i+1]=='B':\r\n consecab=True\r\n if s[i]=='B' and s[i+1]=='A':\r\n consecba=True\r\n if (s[i-1]=='A' and s[i]=='B') or (s[i-1]=='B' and s[i]=='A'):\r\n curlength+=1\r\n else:\r\n if curlength>=5:\r\n break\r\n elif s[i]=='A' or s[i]=='B':\r\n curlength=1\r\n else:\r\n curlength=0\r\nif (ab and consecba) or (ba and consecab) or (ab and ba) or curlength>=5:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\nfrom collections import Counter\r\nfrom collections import defaultdict as ddc\r\n\r\ndef li(): return list(map(int,input().split()))\r\n\r\ndef nt(): return int(input())\r\n\r\ndef st(): return input()\r\n\r\n#------------------------------------------------------------------------\r\n\r\nyes=\"YES\"\r\nno=\"NO\"\r\neven=\"EVEN\"\r\nodd=\"ODD\"\r\nmod=998244353\r\n\r\n#------------------------------------------------------------------------\r\n \r\n\r\ndef prefix(L):\r\n size=len(L)\r\n for i in range(size-1):\r\n L[i+1]=L[i]+L[i+1]\r\n return L\r\n\r\ndef exponentiation(bas, exp, mod):\r\n t = 1\r\n while(exp > 0): \r\n \r\n if (exp % 2 != 0):\r\n t = (t * bas) % mod\r\n \r\n bas = (bas * bas) % mod \r\n exp //= 2\r\n return t % mod\r\n\r\ndef binlist(x):\r\n L=[0]*21\r\n temp=bin(x)\r\n temp=temp[2:]\r\n x=len(temp)\r\n indexL=[]\r\n for i in range(x-1,-1,-1):\r\n if temp[i]=='1':\r\n L[x-i]=1\r\n indexL.append(x-i)\r\n return L\r\n \r\ndef binlisttoint(L):\r\n x=0\r\n for i in range(1,21):\r\n if L[i]=='1':\r\n x+=2**(i-1)\r\n return x\r\n#------------------------------------------------------------------------ \r\n\r\n#for _ in range(int(input())):\r\nstring=input()\r\na=string.find('AB')\r\nb=string.find('BA',a+2)\r\nc=string.find('BA')\r\nd=string.find('AB',c+2)\r\nif((a!=-1 and b!=-1) or (c!=-1 and d!=-1)):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a = []\r\nb = []\r\ndef sol(s):\r\n for i in range(0, len(s) - 1):\r\n if s[i: i + 2] == \"AB\":\r\n a.append(i)\r\n elif s[i: i + 2] == \"BA\":\r\n b.append(i)\r\ns = input().strip()\r\nsol(s)\r\n\r\nfor i in a:\r\n for j in b:\r\n if j != i + 1 and i != j + 1:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\") ", "s = input() \r\nsAB = s.find(\"AB\")\r\nsBA = s.find(\"BA\")\r\n \r\nif sAB != -1 and sBA != -1 and abs(sAB - sBA) > 1:\r\n print(\"YES\")\r\nelse:\r\n # Find the first occurrence of \"AB\" and search for \"BA\" after that position\r\n\tif \"AB\" in s and \"BA\" in s[s.index(\"AB\") + 2:]:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\n\t# Find the first occurrence of \"BA\" and search for \"AB\" after that position\r\n\tif \"BA\" in s and \"AB\" in s[s.index(\"BA\") + 2:]:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\n\telse:\r\n\t\tprint(\"NO\")", "s = input().strip()\r\n\r\nf = s.find(\"AB\")\r\nf1 = -1\r\nf2 = -1\r\n\r\nif f != -1:\r\n f1 = s.find(\"BA\",f+2)\r\n\r\nf = s.find(\"BA\")\r\n\r\nif f != -1:\r\n f2 = s.find(\"AB\",f+2)\r\n\r\nif f1 != -1 or f2 != -1 : print(\"YES\")\r\nelse: print(\"NO\")", "s = input()\r\n\r\nindex_ab = s.find(\"AB\")\r\nindex_ba = s.find(\"BA\", index_ab + 2)\r\n\r\nindex_ba_2 = s.find(\"BA\")\r\nindex_ab_2 = s.find(\"AB\", index_ba_2 + 2)\r\n\r\nif index_ab != -1 and index_ba != -1:\r\n print(\"YES\")\r\nelif index_ab_2 != -1 and index_ba_2 != -1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def check_substrings(s):\r\n # Check if \"AB\" and \"BA\" exist in the string, non-overlapping\r\n index_AB = s.find(\"AB\")\r\n if index_AB != -1 and s.find(\"BA\", index_AB + 2) != -1 and s.find(\"BA\", index_AB + 2) != index_AB + 1:\r\n return \"YES\"\r\n\r\n index_BA = s.find(\"BA\")\r\n if index_BA != -1 and s.find(\"AB\", index_BA + 2) != -1 and s.find(\"AB\", index_BA + 2) != index_BA + 1:\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\n# Example usage\r\ns = input()\r\nresult = check_substrings(s)\r\nprint(result)\r\n", "s = input()\r\n\r\nidx1 = s.find(\"AB\")\r\nidx2 = -1\r\nif idx1 != -1:\r\n idx2 = s.find(\"BA\", idx1+2)\r\n\r\nidx3 = s.find(\"BA\")\r\nidx4 = -1\r\nif idx3 != -1:\r\n idx4 = s.find(\"AB\", idx3+2)\r\n\r\nif idx4 != -1 or idx2 != -1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#yousef\r\na=input()\r\nif \"AB\" in a and \"BA\" in a.replace(\"AB\",\"aa\",1) or \"BA\" in a and \"AB\" in a.replace(\"BA\",\"aa\",1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "import sys, threading\ninput = sys.stdin.readline\nfrom collections import defaultdict\ninput = sys.stdin.readline\n\ndef main():\n s = input().strip()\n # A = set()\n # B = set()\n n= len(s)\n cur = None\n found = []\n look_for = [\"AB\", \"BA\"]\n last_AB = []\n last_BA = []\n for i in range(n-1):\n if s[i]+s[i+1] in \"AB\":\n last_AB.append(i)\n if last_BA and last_BA[0] != i-1:\n print(\"YES\")\n break\n elif s[i]+s[i+1] in \"BA\":\n last_BA.append(i)\n if last_AB and last_AB[0] != i-1:\n print(\"YES\")\n break\n else:\n print(\"NO\")\n\n \n\n \n \n\n\n\n\n# Set the stack size\nthreading.stack_size(1 << 27)\n\n# Create and start the main thread\nmain_thread = threading.Thread(target=main)\nmain_thread.start()\n\n# Wait for the main thread to complete\nmain_thread.join()\n", "s = input()\r\n\r\nif len(s) < 4:\r\n print(\"NO\")\r\nelse:\r\n found = False\r\n for i in range(len(s)-1):\r\n if s[i:i+2] == \"AB\":\r\n if \"BA\" in s[i+2:]:\r\n found = True\r\n break\r\n elif s[i:i+2] == \"BA\":\r\n if \"AB\" in s[i+2:]:\r\n found = True\r\n break\r\n\r\n if found:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "s=input()\r\nn=len(s)\r\ni=0\r\nab=False\r\nba=False\r\naba=False\r\nlast=-1\r\nwhile(i<n-1):\r\n # print(s[i:i+3])\r\n if i+3<n and (s[i:i+3:]=='ABA' or s[i:i+3]=='BAB') and aba==False:\r\n aba=True\r\n i+=3\r\n continue\r\n if s[i]=='A' and ab==False:\r\n if s[i+1]=='B':\r\n ab=True\r\n i+=2\r\n continue\r\n if s[i]=='B' and ba==False:\r\n if s[i+1]=='A':\r\n ba=True\r\n i+=2\r\n continue\r\n i+=1\r\nprint(\"YES\" if (ab and ba) or (aba and ba) or (aba and ab) else \"NO\")\r\n", "s=input()\r\nu=s.find('AB')\r\nv=s.find('BA')\r\nprint('YES'if(u+1 and s.find('BA',u+2)+1)or(v+1 and s.find('AB',v+2)+1)else'NO')", "# ho jaana accept \r\ns=input()\r\nn=len(s)\r\nct1=0\r\nct11=0\r\nct2=0\r\nn1=0\r\nn2=0\r\nfor i in range(n-1):\r\n if s[i]==\"A\" and s[i+1]==\"B\":\r\n ct1+=1\r\n n1=i+2\r\n break\r\nif ct1==1:\r\n for j in range(n1,n-1):\r\n if s[j]==\"B\" and s[j+1]==\"A\":\r\n ct2+=1\r\n break\r\nfor i1 in range(n-1):\r\n if s[i1]==\"B\" and s[i1+1]==\"A\":\r\n ct11+=1\r\n n2=i1+2\r\n break\r\nif ct11==1:\r\n for j1 in range(n2,n-1):\r\n if s[j1]==\"A\" and s[j1+1]==\"B\":\r\n ct2+=1\r\n break \r\nif ct2>=1:\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")", "x= input()\r\ns1= x.find('AB')\r\ns2= x.find('BA', s1+2)\r\ns3= x.find('BA')\r\ns4= x.find('AB', s3+2)\r\n\r\nif s1 != -1 and s2 != -1:\r\n print(\"YES\")\r\nelif s3 != -1 and s4 != -1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=str(input());a=s.count(\"AB\");b=s.count(\"BA\");c=s.count(\"ABA\");d=s.count(\"BAB\")\r\nif (a!=0 and b!=0) and a+b-c-d>1:print(\"YES\")\r\nelse:print(\"NO\")", "s = input()\r\n\r\nfirst_ab = s.find(\"AB\")\r\n\r\nfirst_ba = s.find(\"BA\")\r\n\r\nsecond_ab = s.rfind(\"AB\")\r\n\r\nsecond_ba = s.rfind(\"BA\")\r\n\r\nif (first_ab != -1 and second_ba != -1 and abs(first_ab - second_ba) > 1) or (first_ba != -1 and second_ab != -1 and abs(first_ba - second_ab) > 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "str = input()\r\n\r\n# Index of the first occurrence of \"AB\" and \"BA\"\r\nfirst_index_ab = str.find(\"AB\")\r\nfirst_index_ba = str.find(\"BA\")\r\n\r\n# Index of the last occurrence of \"AB\" and \"BA\"\r\nlast_index_ab = str.rfind(\"AB\")\r\nlast_index_ba = str.rfind(\"BA\")\r\n\r\n# Check if any of the `first_index_ + 1`\r\n# is not equal to any of the `last_index_`\r\nif (first_index_ab != -1) and (first_index_ba != -1) \\\r\n and (first_index_ab+1 < last_index_ba or first_index_ba+1 < last_index_ab):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\r\nn = len(s)\r\nif \"AB\" not in s or \"BA\" not in s:\r\n print(\"NO\")\r\n exit(0)\r\nstart = s.index(\"AB\") + 2\r\nflag = False\r\nfor i in range(start, n - 1):\r\n if s[i:i + 2] == \"BA\":\r\n flag = True\r\n break\r\nif flag:\r\n print(\"YES\")\r\n exit(0)\r\nstart = s.index(\"BA\") + 2\r\nflag = False\r\nfor i in range(start, n - 1):\r\n if s[i:i + 2] == \"AB\":\r\n flag = True\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=str(input())\r\nl1,l2=[],[]\r\noverlap=True\r\nfor i in range(1,len(s)):\r\n pair=s[i-1]+s[i]\r\n if pair==\"AB\":\r\n l1.append([i-1,i])\r\n if l2 and l2[0][1]<i-1:\r\n overlap=False\r\n break\r\n if pair==\"BA\":\r\n l2.append([i-1,i])\r\n if l1 and l1[0][1]<i-1:\r\n overlap=False\r\n break\r\nprint(\"YES\" if not overlap else \"NO\")", "s = input()\r\nif s.find('AB') != -1 and s.find('BA') != -1:\r\n i = s.find('AB') + 2\r\n if i < len(s):\r\n if s[i:].find('BA') != -1:\r\n print('YES')\r\n exit()\r\n i = s.find('BA') + 2\r\n if i < len(s):\r\n if s[i:].find('AB') != -1:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "s = input()\r\n\r\nind1 = s.find(\"AB\")\r\n\r\nind2 = s.find(\"BA\", ind1+(ind1>=0)*2)\r\n\r\nif not(ind1 == -1 or ind2 == -1):\r\n print(\"YES\")\r\n\r\n quit()\r\n\r\n\r\nind1 = s.find(\"BA\")\r\n\r\nind2 = s.find(\"AB\", ind1+(ind1>=0)*2)\r\n\r\nif not(ind1 == -1 or ind2 == -1):\r\n print(\"YES\")\r\n\r\n quit()\r\n \r\nprint(\"NO\")", "s = input().casefold()\r\nfound = False\r\n\r\n# Check if \"AB\" followed by \"BA\" exists\r\nfor i in range(len(s) - 1):\r\n if s[i:i+2] == 'ab' and 'ba' in s[i+2:]:\r\n found = True\r\n break\r\n\r\n# If not found, check if \"BA\" followed by \"AB\" exists\r\nif not found:\r\n for i in range(len(s) - 1):\r\n if s[i:i+2] == 'ba' and 'ab' in s[i+2:]:\r\n found = True\r\n break\r\n\r\nif found:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "S = input()\n\nAB1, AB2 = S.find(\"AB\"), S.rfind(\"AB\")\nBA1, BA2 = S.find(\"BA\"), S.rfind(\"BA\")\n\nprint(\"YES\" if AB1 != -1 and BA1 != -1 and (AB1 <= BA2-2 or BA1 <= AB2-2) else \"NO\")", "s = input()\n\n# Search for \"AB\" and \"BA\" from left to right\nif \"AB\" in s and s[s.index(\"AB\") + 2:].find(\"BA\") != -1:\n print(\"YES\")\n# Search for \"BA\" and \"AB\" from left to right\nelif \"BA\" in s and s[s.index(\"BA\") + 2:].find(\"AB\") != -1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t\t\t\t\t \t\t \t \t\t\t\t \t", "s = str(input())\r\na = s.count(\"AB\")\r\nb = s.count(\"BA\")\r\n\r\nc = s.count(\"ABA\")\r\nd = s.count(\"BAB\")\r\n\r\nif (a+b) * (a != 0 and b != 0) - c - d > 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a = input().lower()\r\n\r\n# Find the first occurrence of \"AB\" and search for \"BA\" after it\r\nif \"ab\" in a and \"ba\" in a[a.index(\"ab\") + 2:]:\r\n print(\"YES\")\r\n exit()\r\n\r\n# Find the first occurrence of \"BA\" and search for \"AB\" after it\r\nif \"ba\" in a and \"ab\" in a[a.index(\"ba\") + 2:]:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n", "s = input()\r\nans = 'NO'\r\nfirst_AB = s.find('AB')\r\nif first_AB != -1 and 'BA' in s[first_AB+2:]:\r\n ans = 'YES'\r\nelse:\r\n first_BA = s.find('BA')\r\n if first_BA != -1 and 'AB' in s[first_BA+2:]:\r\n ans = 'YES'\r\nprint(ans)\r\n", "s=input()\na=s.count(\"AB\")\nb=s.count(\"BA\")\nc=s.count(\"ABA\")\nd=s.count(\"BAB\")\nprint([\"NO\",\"YES\"][(a+b)*(a!=0 and b!=0)-c-d>1])\n\t\t \t \t\t\t\t \t\t\t\t\t \t\t \t\t", "s = input()\r\nfound = False\r\n\r\n# Check for non-overlapping \"AB\" and \"BA\" substrings\r\nif \"AB\" in s:\r\n index = s.index(\"AB\")\r\n if \"BA\" in s[index + 2:]:\r\n found = True\r\n\r\nif not found and \"BA\" in s:\r\n index = s.index(\"BA\")\r\n if \"AB\" in s[index + 2:]:\r\n found = True\r\n\r\nif found:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def ab(word: str) -> bool:\r\n return len(word)>1 and \"AB\" in word\r\ndef ba(word: str) -> bool:\r\n return len(word)>1 and \"BA\" in word\r\n\r\ns = input()\r\ntry:\r\n abi = s.index(\"AB\")\r\n bai = s.index(\"BA\")\r\nexcept:\r\n print(\"NO\")\r\n exit()\r\n\r\nif len(s) < 4:\r\n print(\"NO\")\r\n exit()\r\n\r\nif abs(abi-bai) == 1:\r\n if ba(s[:abi]) or ba(s[abi+2:]) or ab(s[:bai]) or ab(s[bai+2:]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "s=str(input())\r\nn=len(s)\r\nl1,l2=[i for i in range(n-1)if s[i:i+2]==\"AB\"],[i for i in range(n-1)if s[i:i+2]==\"BA\"]\r\nprint(\"YES\" if any(abs(i-j)>=2 for i in l1 for j in l2) else \"NO\")", "a = input()\r\nsetAB= []\r\nsetBA= []\r\nflag = True\r\nfor i in range(0,len(a)-1):\r\n if(a[i:i+2]=='AB'):\r\n setAB.append(i)\r\n if(a[i:i+2]=='BA'):\r\n setBA.append(i)\r\nif(len(setAB)==0 or len(setBA)==0):\r\n print(\"No\")\r\n quit()\r\n\r\nfor i in setAB:\r\n for j in setBA:\r\n if(j!=i-1 and j!=i+1):\r\n print(\"Yes\")\r\n quit()\r\nprint(\"No\")\r\n\r\n\r\n", "def main():\r\n\ts = input()\r\n\r\n\tab = []\r\n\tba = []\r\n\tfor i in range(len(s)-1):\r\n\t\tif s[i:i+2]==\"AB\":\r\n\t\t\tif any(abs(x-i)>1 for x in ba):\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\treturn\r\n\t\t\tab.append(i)\r\n\t\telif s[i:i+2]==\"BA\":\r\n\t\t\tif any(abs(x-i)>1 for x in ab):\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\treturn\r\n\t\t\tba.append(i)\r\n\tprint(\"NO\")\r\nmain()\r\n", "def contains_AB_and_BA(s):\r\n if \"AB\" in s and \"BA\" in s[s.index(\"AB\")+2:]:\r\n return True\r\n if \"BA\" in s and \"AB\" in s[s.index(\"BA\")+2:]:\r\n return True\r\n return False\r\ns = input()\r\nif contains_AB_and_BA(s):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "text = list(input())\r\nlength = len(text) \r\nba = []\r\nab = []\r\nfor index in range(1 , length) :\r\n if text[index] + text[index - 1] == \"BA\" :\r\n ba.append(index)\r\n elif text[index] + text[index - 1] == \"AB\" :\r\n ab.append(index)\r\n \r\nif ba and ab :\r\n for i in ba :\r\n for j in ab :\r\n if abs(i - j) > 1 :\r\n quit(print(\"YES\")) \r\nprint(\"NO\")", "s = input() \nsAB = s.find(\"AB\")\nsBA = s.find(\"BA\")\n \nif sAB != -1 and sBA != -1 and abs(sAB - sBA) > 1:\n print(\"YES\")\nelse:\n\tif \"AB\" in s and \"BA\" in s[s.index(\"AB\") + 2:]:\n\t\tprint(\"YES\")\n\t\texit()\n\tif \"BA\" in s and \"AB\" in s[s.index(\"BA\") + 2:]:\n\t\tprint(\"YES\")\n\t\texit()\n\telse:\n\t\tprint(\"NO\")\n\t\t \t \t\t\t \t\t\t \t \t \t \t", "s = input()\r\na = s.find('AB')\r\nb = s.find('BA')\r\nif a >= 0 and s.find('BA', a+2) > 0:\r\n print('YES')\r\nelif b >= 0 and s.find('AB', b+2) > 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "def has(s, s2):\r\n i = 0\r\n for i in range(len(s)-1):\r\n if s[i:i+2] == s2:\r\n return True\r\n return False\r\n\r\nt = input()\r\n# s = time.time()\r\ni = 0\r\nres = \"NO\"\r\nABchecked = False\r\nBAchecked = False\r\nfor i in range(len(t)-1):\r\n if not ABchecked and t[i:i+2]=='AB':\r\n ABchecked = True\r\n if has(t[i+2:], 'BA'):\r\n res = \"YES\"\r\n break\r\n if not BAchecked and t[i:i+2]=='BA':\r\n BAchecked = True\r\n if has(t[i+2:], 'AB'):\r\n res = \"YES\"\r\n break\r\nprint(res)", "s = input()\r\ns1 = s.find('AB') + 1\r\ns2 = s.find('BA') + 1\r\ns3 = s.find('BA', s1 + 1) + 1\r\ns4 = s.find('AB', s2 + 1) + 1\r\nif (s1 != 0 and s3 != 0) or (s2 != 0 and s4 != 0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n#print(s1, s2, s3)\r\n", "st = input()\n\nif 'AB' in st and 'BA' in st[st.index('AB')+2:]:\n print(\"YES\")\nelif 'BA' in st and 'AB' in st[st.index('BA')+2:]:\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", "\"\"\"\r\n author: Adham0 \r\n created: 03.08.2023 17:05:28\r\n ### Adham was here ###\r\n \r\n █████ ██████ ██ ██ █████ ███ ███\r\n ██ ██ ██ ██ ██ ██ ██ ██ ████ ████\r\n ███████ ██ ██ ███████ ███████ ██ ████ ██\r\n ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ \r\n ██ ██ ██████ ██ ██ ██ ██ ██ ██\r\n\"\"\"\r\n\r\ns = input()\r\n\r\nif \"BA\" not in s or \"AB\" not in s:\r\n print(\"NO\")\r\n exit()\r\n\r\npos = s.find(\"BA\")\r\nif \"AB\" in s[pos + 2:]:\r\n print(\"YES\")\r\n exit()\r\n\r\npos = s.find(\"AB\")\r\nif \"BA\" in s[pos + 2:]:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "s = input().strip()\r\n\r\nif 'AB' in s and 'BA' in s[s.index('AB')+2:]:\r\n print('YES')\r\nelif 'BA' in s and 'AB' in s[s.index('BA')+2:]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nif s.count('AB') + s.count('BA') - s.count('ABA') - s.count('BAB') - 1 and s.find('AB') + 1 and s.find('BA') + 1:print(\"YES\")\r\nelse:print(\"NO\")", "s = input()\r\nans = []\r\nl = False\r\nflag = 0\r\nfor i in range(len(s)-1):\r\n if not l:\r\n if s[i] == \"A\" and s[i+1] == \"B\":\r\n ans.append((i,i+1))\r\n l = True\r\n else:\r\n if s[i] == \"B\" and s[i+1] == \"A\":\r\n if ans and ans[-1][1] != i:\r\n ans.append((i,i+1))\r\n flag = 1\r\n break\r\nl = False\r\nans = []\r\nfor i in range(len(s)-1):\r\n if not l:\r\n if s[i] == \"B\" and s[i+1] == \"A\":\r\n ans.append((i,i+1))\r\n l = True\r\n else:\r\n if s[i] == \"A\" and s[i+1] == \"B\":\r\n if ans and ans[-1][1] != i:\r\n ans.append((i,i+1))\r\n flag = 1\r\n break \r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n\r\n \r\n", "s = input()\r\nab_found = False\r\nba_found = False\r\n\r\n# Find the first occurrence of \"AB\"\r\nx1 = s.find(\"AB\")\r\nif x1 != -1:\r\n # Find the occurrence of \"BA\" after the first \"AB\"\r\n x2 = s.find(\"BA\", x1 + 2)\r\n if x2 != -1:\r\n ab_found = True\r\n\r\n# Find the first occurrence of \"BA\"\r\ny1 = s.find(\"BA\")\r\nif y1 != -1:\r\n # Find the occurrence of \"AB\" after the first \"BA\"\r\n y2 = s.find(\"AB\", y1 + 2)\r\n if y2 != -1:\r\n ba_found = True\r\n\r\n# Check if either \"AB\" followed by \"BA\" or \"BA\" followed by \"AB\" is found\r\nif ab_found or ba_found:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s = input()\n\nfirst_ab, first_ba, last_ab, last_ba = -1, -1, -1, -1\nfor i in range(len(s) - 1):\n if s[i] == 'A' and s[i + 1] == 'B':\n if first_ab == -1:\n first_ab = i\n last_ab = i\n if s[i] == 'B' and s[i + 1] == 'A':\n if first_ba == -1:\n first_ba = i\n last_ba = i\nif first_ab == -1 or first_ba == -1:\n print(\"NO\")\nelse:\n if last_ba > first_ab + 1 or last_ab > first_ba + 1:\n print(\"YES\")\n else:\n print(\"NO\")\n", "s = input()\n\n\nAB_POSITION = s.find(\"AB\")\n\nba_pos = s.find(\"BA\")\n\nif AB_POSITION != -1 and ba_pos != -1 and abs(AB_POSITION - ba_pos) > 1:\n print(\"YES\")\nelse:\n # Check if the positions of the substrings are reversed\n if ba_pos != -1 and s.find(\"AB\", ba_pos + 2) != -1:\n print(\"YES\")\n elif AB_POSITION != -1 and s.find(\"BA\", AB_POSITION + 2) != -1:\n print(\"YES\")\n else:\n print(\"NO\")\n\n \t \t\t\t\t \t\t \t \t\t\t\t \t\t\t\t\t \t\t \t", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nS = input()\r\nN = len(S)\r\nINF = float('inf')\r\nab,ba=INF,INF\r\nans = 'NO'\r\nfor i in range(N-1):\r\n if S[i:i+2]=='AB':\r\n ab = min(ab, i)\r\n if ba!=INF and i-ba>=2:\r\n ans = 'YES'\r\n break\r\n elif S[i:i+2]=='BA':\r\n ba = min(ba, i)\r\n if ab!=INF and i-ab>=2:\r\n ans = 'YES'\r\n break\r\n \r\nprint(ans)\r\n \r\n \r\n ", "def containsTwoSubstrings(s):\n ab_index = s.find(\"AB\")\n \n if ab_index != -1:\n ba_index = s.find(\"BA\", ab_index + 2)\n \n if ba_index != -1:\n return \"YES\"\n \n ba_index = s.find(\"BA\")\n \n if ba_index != -1:\n ab_index = s.find(\"AB\", ba_index + 2)\n \n if ab_index != -1:\n return \"YES\"\n \n return \"NO\"\n\ns = input()\nresult = containsTwoSubstrings(s)\nprint(result)\n\n\t \t\t\t \t \t\t \t \t\t \t", "def has_non_overlapping_AB_BA(s):\n if \"AB\" in s:\n s1 = s.replace(\"AB\", \"--\", 1)\n if \"BA\" in s1:\n return \"YES\"\n if \"BA\" in s:\n s2 = s.replace(\"BA\", \"--\", 1)\n if \"AB\" in s2:\n return \"YES\"\n return \"NO\"\n\n# Input\ns = input()\n\n# Output\nprint(has_non_overlapping_AB_BA(s))\n\n\t \t \t\t \t\t \t\t\t \t\t \t \t \t \t\t\t", "# Read the input string\ns = input()\n\n# Find the first occurrence of \"AB\" and search for \"BA\" after that position\nif \"AB\" in s and \"BA\" in s[s.index(\"AB\") + 2:]:\n print(\"YES\")\n exit()\n\n# Find the first occurrence of \"BA\" and search for \"AB\" after that position\nif \"BA\" in s and \"AB\" in s[s.index(\"BA\") + 2:]:\n print(\"YES\")\n exit()\n\n# If none of the conditions are true, print \"NO\"\nprint(\"NO\")\n\n \t\t \t \t\t \t \t\t", "from bisect import bisect\nimport math\nfrom collections import defaultdict\n\n\n\n \ndef solve():\n s = input()\n dpa = [False for _ in s]\n dpb = [False for _ in s]\n\n for i in range(len(s) - 2, -1, -1):\n if s[i] == 'A' and s[i + 1] == 'B':\n dpa[i] = True\n if i + 2 < len(s) and dpb[i + 2]:\n print(\"YES\")\n return\n\n if s[i] == 'B' and s[i + 1] == 'A':\n dpb[i] = True\n if i + 2 < len(s) and dpa[i + 2]:\n print(\"YES\")\n return\n \n dpa[i] = dpa[i] or dpa[i + 1]\n dpb[i] = dpb[i] or dpb[i + 1]\n\n print(\"NO\")\n\ntc = 1 # int(input())\n\nfor i in range(tc):\n solve()" ]

[ "import math as mt \nimport sys,string\ninput=sys.stdin.readline\nprint=sys.stdout.write\nimport random\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nt=I()\nd=defaultdict(str)\nml=0\np=0\nfor _ in range(t):\n s=input().split()\n w=s[0]\n x=list(map(int,s[1::]))\n for i in range(1,len(x)):\n r=d[x[i]-1]\n if(len(r)<len(w)):\n d[x[i]-1]=w\n ml=max(ml,len(w)+x[-1]-1)\nans=\"a\"*ml\nans=list(ans)\n#print(d)\np=-1\nz=sorted(list(d.keys()))\nfor i in z:\n if(i+len(d[i])>p):\n if(i>=p):\n for j in range(i,i+len(d[i])):\n ans[j]=d[i][j-i]\n else:\n leave=p-i\n f=max(i,p)\n #print(ans,\"@\",d[i],p,d[i][leave::])\n for j in range(leave,len(d[i])):\n ans[f]=d[i][j]\n f+=1\n #print(ans,\"*\")\n p=i+len(d[i])\n \nfor i in ans:\n print(i)\n \n" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef slide_min(n, k, a):\r\n ans, s = [], []\r\n j = 0\r\n for i in range(n):\r\n ai = a[i]\r\n while len(s) ^ j and a[s[-1]] >= ai:\r\n s.pop()\r\n s.append(i)\r\n while len(s) ^ j and s[j] + k <= i:\r\n j += 1\r\n if i + 1 >= k:\r\n ans.append(a[s[j]])\r\n return ans\r\n\r\nn, c = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\nb = slide_min(n, c, a)\r\ndp = [0] * (n + 1)\r\nfor i in range(c, n + 1):\r\n dp[i] = max(dp[i - 1], dp[i - c] + b[i - c])\r\nans = s - dp[n]\r\nprint(ans)", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\nclass SegmentTree:\r\n def __init__(self, data, default=0, func=max):\r\n \"\"\"initialize the segment tree with data\"\"\"\r\n self._default = default\r\n self._func = func\r\n self._len = len(data)\r\n self._size = _size = 1 << (self._len - 1).bit_length()\r\n\r\n self.data = [default] * (2 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n\r\n def __delitem__(self, idx):\r\n self[idx] = self._default\r\n\r\n def __getitem__(self, idx):\r\n return self.data[idx + self._size]\r\n\r\n def __setitem__(self, idx, value):\r\n idx += self._size\r\n self.data[idx] = value\r\n idx >>= 1\r\n while idx:\r\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\r\n idx >>= 1\r\n\r\n def __len__(self):\r\n return self._len\r\n\r\n def query(self, start, stop):\r\n \"\"\"func of data[start, stop)\"\"\"\r\n start += self._size\r\n stop += self._size\r\n\r\n res_left = res_right = self._default\r\n while start < stop:\r\n if start & 1:\r\n res_left = self._func(res_left, self.data[start])\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n res_right = self._func(self.data[stop], res_right)\r\n start >>= 1\r\n stop >>= 1\r\n\r\n return self._func(res_left, res_right)\r\n\r\n def __repr__(self):\r\n return \"SegmentTree({0})\".format(self.data)\r\n \r\ndef process(A, k):\r\n n = len(A)\r\n S = [0]\r\n for x in A:\r\n S.append(S[-1]+x)\r\n S1 = SegmentTree(data=A, func=min, default=float('inf'))\r\n d = [float('inf') for i in range(n+1)]\r\n d[0] = 0 \r\n for i in range(1, n+1):\r\n op1 = A[i-1]+d[i-1]\r\n if i >= k:\r\n op2 = S[i]-S[i-k]-S1.query(i-k, i)+d[i-k]\r\n d[i] = min(op1, op2)\r\n else:\r\n d[i] = op1\r\n sys.stdout.write(f'{d[-1]}\\n')\r\n return \r\n\r\nn, k = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nprocess(A, k)\r\n ", "\r\nfrom heapq import heappop, heappush\r\nn,c=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nif c>n:\r\n print(sum(arr))\r\n exit()\r\ns=0\r\nb=[0]*n\r\nh=[]\r\nfor i in range(n):\r\n s=s+arr[i]-arr[i-c] if i>=c else s+arr[i]\r\n heappush(h,(arr[i],i))\r\n if i<c-1:\r\n b[i]=s\r\n else :\r\n while h and h[0][1]<i-c+1:\r\n heappop(h)\r\n v1=b[i-1]+arr[i]\r\n v2=b[i-c]+s-h[0][0]\r\n b[i]=min(v1,v2)\r\nprint(b[-1])", "def queries(l,r):\r\n mini =float(\"inf\")\r\n while l<=r:\r\n if l %2 ==1:\r\n mini =min(mini,sgn_tree[l])\r\n l+=1\r\n if r % 2==0:\r\n mini =min(mini,sgn_tree[r])\r\n r-=1\r\n l =l>>1\r\n r =r>>1\r\n return mini\r\n\r\n\r\nn,c=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nsgn_tree=[0 for i in range(2*n)]\r\nsgn_tree[n:] =arr\r\nfor i in range(n-1,0,-1):\r\n sgn_tree[i] =min(sgn_tree[2*i],sgn_tree[2*i+1])\r\ndp=[0 for i in range(n)]\r\nfor i in range(n):\r\n if i-c>=-1:\r\n dp[i] =max(dp[i-c] +queries(n+i-c+1,n+i),dp[i-1])\r\ns=sum(arr)\r\nprint(s -dp[n-1])", "str=input().split()\r\nn=int(str[0])\r\nlen=int(str[1])\r\na=[]\r\nQ=[]\r\nF=[]\r\nfor i in range(0,n+1):\r\n\ta.append(0)\r\n\tQ.append(0)\r\n\tF.append(0)\r\nsum=0\r\nh=1\r\nt=0\r\nstr=input().split()\r\nfor i in range(1,n+1):\r\n\ta[i]=int(str[i-1])\r\n\tsum+=a[i]\r\n\t#print (sum)\r\n\twhile h<=t and Q[h]<=i-len:\r\n\t\th=h+1\r\n\twhile h<=t and a[i]<=a[Q[t]]:\r\n\t\tt=t-1\r\n\tt=t+1;Q[t]=i;\r\n\tif (i<len) :\r\n\t\tF[i]=0\r\n\telse :\r\n\t\tF[i]=F[i-len]+a[Q[h]]\r\n\tF[i]=max(F[i],F[i-1])\r\n\t\t\r\nprint (sum-F[n])\r\n", "n, c = map (int, input ().split ())\r\na = [0] + list (map (int, input ().split ()))\r\nif c <= 1 : print (0); exit (0)\r\ndp = [0] * (n + 5); stk_val = [0] * (n + 5); stk_id = [0] * (n + 5)\r\nhead, tail = 1, 0\r\npre = [0] * (n + 5)\r\nfor i in range (1, n + 1) :\r\n pre[i] = pre[i - 1] + a[i]\r\n while head <= tail and stk_id[head] + c <= i : head += 1\r\n while head <= tail and stk_val[tail] >= a[i] : tail -= 1\r\n tail += 1; stk_id[tail] = i; stk_val[tail] = a[i]\r\n dp[i] = dp[i - 1] + a[i]\r\n if i >= c: dp[i] = min (dp[i], dp[i - c] + pre[i] - pre[i - c] - stk_val[head])\r\nprint (dp[n])\r\n", "from heapq import *\r\n\r\nn, c = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nif c > n:\r\n\tprint(sum(a))\r\n\texit()\r\n\r\nb = [0] * n\r\ns = 0\r\nh = []\r\nfor i in range(n):\r\n\ts = s + a[i] - a[i-c] if i + 1 > c else s + a[i]\r\n\theappush(h, (a[i],i))\t\r\n\tif i + 1 < c:\r\n\t\tb[i] = s\r\n\telse:\r\n\t\twhile h[0][1] <= i-c:\r\n\t\t\theappop(h)\r\n\t\tv1 = b[i-1] + a[i]\t\t\t\r\n\t\tv2 = b[i-c] + s - h[0][0]\r\n\t\tb[i] = min(v1, v2)\r\n\t\r\nprint(b[-1])", "from heapq import *\r\nf = lambda: map(int, input().split())\r\nn, c = f()\r\na = list(f()) + [0] * c\r\nb = [0] * (n + c)\r\ns = 0\r\nh = [(0, -1)]\r\nfor i in range(n):\r\n s += a[i] - a[i - c]\r\n heappush(h, (a[i], i))\r\n while h[0][1] <= i - c: heappop(h)\r\n b[i] = min(b[i - 1] + a[i], b[i - c] + s - h[0][0])\r\nprint(b[n - 1])", "class SegTree:\n def __init__(self, init_val, ide_ele, segfunc):\n self.n = len(init_val)\n self.num = 2**(self.n-1).bit_length()\n self.ide_ele = ide_ele\n self.segfunc = segfunc\n self.seg = [ide_ele]*2*self.num\n # set_val\n for i in range(self.n):\n self.seg[i+self.num] = init_val[i]\n # built\n for i in range(self.num-1, 0, -1):\n self.seg[i] = self.segfunc(self.seg[2*i], self.seg[2*i+1])\n\n def add(self, k, x):\n k += self.num\n self.seg[k] += x\n while k:\n k = k >> 1\n self.seg[k] = self.segfunc(self.seg[2*k], self.seg[2*k+1])\n\n def query(self, l, r):\n if r <= l:\n return self.ide_ele\n l += self.num\n r += self.num\n lres = self.ide_ele\n rres = self.ide_ele\n while l < r:\n if r & 1:\n r -= 1\n rres = self.segfunc(self.seg[r], rres)\n if l & 1:\n lres = self.segfunc(lres, self.seg[l])\n l += 1\n l = l >> 1\n r = r >> 1\n res = self.segfunc(lres, rres)\n return res\n\n def __str__(self): # for debug\n arr = [self.query(i,i+1) for i in range(self.n)]\n return str(arr)\n\nINF = 10**18\n\ndef main():\n\n n, k = map(int, input().split())\n A = list(map(int, input().split()))\n\n if k > n:\n print(sum(A))\n exit()\n if k == n:\n print(sum(A)-min(A))\n exit()\n\n res = []\n from collections import deque\n d = deque([])\n for i in range(n):\n while d:\n if d[0] <= i-k:\n d.popleft()\n else:\n break\n while d:\n if A[d[-1]] > A[i]:\n d.pop()\n else:\n break\n d.append(i)\n if i-k+1 >= 0:\n res.append(A[d[0]])\n #print(res)\n seg = SegTree(res, -INF, max)\n for i in range(len(res)):\n t = max(0, seg.query(0, i-k+1))\n seg.add(i, t)\n #print(seg)\n print(sum(A)-seg.query(0, seg.n))\n\nif __name__ == '__main__':\n main()\n" ]

[ "n=int(input())\nl=[int(x) for x in input().split()]\ncur_idx=0\ncur_val=max(0,(l[0]-1)//n+1)\nfor i in range(n):\n val = max(0,(l[i]-i-1)//n+1)\n if(val<cur_val):\n cur_val=val\n cur_idx=i\nprint(cur_idx+1)\n\t\t \t\t \t \t\t\t \t\t \t\t \t \t \t", "import math\n\nn = int(input())\nq = [int(x) for x in input().split()]\nans = [math.ceil((x-i)/n) for i, x in enumerate(q)]\nprint(ans.index(min(ans))+1)\n\t\t \t \t \t\t\t\t \t \t \t \t\t\t\t\t", "import collections, math, sys\nn = int(input())\na = list(map(int, input().split()))\n\n# binsearch\n\n# 6\n# 5 2 6 5 7 4\n\nnew_arr = []\nfor i, v in enumerate(a):\n\n l, r = 0, 10**9 + 2\n while l < r:\n m = l+(r-l)//2\n if (i + m * n) >= v:\n r = m\n else:\n l = m + 1\n new_arr.append(i + l * n)\n\n# now find the index of the minimum\nprint(new_arr.index(min(new_arr))+1)", "import math\r\nn, a, m, res = int(input()), [*(map(int,input().split()))], 10e9,-1\r\nk = [ math.ceil((ai-i)/n) for i,ai in enumerate(a) ]\r\nprint(k.index(min(k))+1)", "n=int(input())\na=list(map(int,input().split()))\np=min(a)//n*n\nb=p\nfor i in range(n):\n a[i]-=p\n \nfor i in range(2*n):\n if a[i%n]<=i:\n print(i%n+1)\n exit()\n\t \t \t\t \t\t\t\t\t \t \t \t \t\t\t\t \t\t", "a = [0] * (int(1e5)+10)\r\nans = 0\r\nmin_diff = float('inf')\r\n\r\nn = int(input())\r\nqueue = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n a[i+1] = queue[i]\r\n diff = (a[i+1] - (i+1) + n) // n\r\n if min_diff > diff:\r\n min_diff = diff\r\n ans = i+1\r\nprint(ans)", "n=int(input())\r\na=[int(e) for e in input().split()]\r\nimin=0\r\nymin=10**18\r\nfor i in range(n):\r\n y=a[i]+(i-a[i]%n)%n\r\n if y<ymin:\r\n ymin=y\r\n imin=i\r\nprint(imin+1)", "n = int(input())\nq = [int(x) for x in input().split()]\nearliest = min(q)\nidx = earliest%n\nwhile q[idx] - earliest > 0:\n earliest += 1\n idx = (idx+1)%n\nprint(idx+1)", "import math\n\nINF = int(1e9) + 90\n\nn = int(input())\nv = list(map(int, input().split()))\n\nmn = INF\nind = -1\n\nfor i in range(n):\n t = n\n need = max(0, v[i] - i)\n need = math.ceil(need / t)\n if mn > need:\n ind = i + 1\n mn = need\n\nprint(ind)\n\n\t \t\t \t\t \t\t\t\t \t \t \t\t\t \t\t", "from math import ceil\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nmi = float('inf')\r\nind = 0\r\nfor i in range(n):\r\n d = max(0,a[i]-i)\r\n d = ceil(d/n)\r\n if mi>d:\r\n mi = d\r\n ind = i\r\nprint(ind+1)\r\n", "import math\ndef error(*n):\n print(\"[Err]\",end=\" \")\n for i in n:\n print(i,end=\" \")\n print()\n\nn = [int(i) for i in input().split()]\nif type(n) == list:\n n = n[0]\n\nent = [int(i) for i in input().split()]\n\ndec = min(ent)\npos = dec%n\n\nif ent[pos]-dec<=0:\n print(pos+1)\nelse:\n while 1:\n dec+=1\n pos=(pos+1)%n\n if ent[pos]-dec<=0:\n print(pos+1)\n break\n\n \t \t\t\t \t \t\t\t\t \t\t \t\t \t\t\t\t", "import math\r\n \r\narr = [] \r\nn = int(input())\r\n \r\nqueue = list(map(int, input().split()))\r\n \r\nfor i in range(n): \r\n mid = math.ceil((queue[i] - i)/n)\r\n arr.append(mid)\r\n \r\nans = min(arr)\r\nprint((arr.index(ans)+1))" ]

[ "n,q= map(int, input().split())\r\nparent=[-1]+[int(x) -1 for x in input().split()]\r\nstart=[0]*n\r\nend=[1]*n\r\nsize=[1]*n\r\npath=[0]*n\r\nfor i in range(n-1, 0, -1):\r\n size[parent[i]]+=size[i]\r\nfor v in range(1, n):\r\n start[v]=end[parent[v]]\r\n end[v]=start[v]+1\r\n end[parent[v]]+=size[v]\r\n path[start[v]]=v\r\nfor j in range(q):\r\n u, k=[int(x) -1 for x in input().split()]\r\n if k >= size[u]:\r\n print (\"-1\")\r\n \r\n else:\r\n print(path[start[u]+k]+1)\r\n", "# input = open('input.txt').readline\r\n\r\nn, q = map(int, input().split())\r\nchildren = [[] for i in range(n)]\r\nsize = [0]*n\r\nfor i, p in enumerate(map(int, input().split()), 1):\r\n\tchildren[p-1].append(i)\r\n\r\nsize = [1]*n\r\ndfs = []\r\nindex_to_rank = [0]*n\r\n\r\ndef traverse():\r\n\tvisited = [False] * n\r\n\tstack = [(0, None)]\r\n\twhile stack:\r\n\t\ti, parent = stack[-1]\r\n\t\tif visited[i]:\r\n\t\t\tstack.pop()\r\n\t\t\tif parent is not None:\r\n\t\t\t\tsize[parent] += size[i]\r\n\r\n\t\telse:\r\n\t\t\tvisited[i] = True\r\n\t\t\tindex_to_rank[i] = len(dfs)\r\n\t\t\tdfs.append(i)\r\n\t\t\tfor j in reversed(children[i]):\r\n\t\t\t\tstack.append((j, i))\r\n\r\nanswer = []\r\ndef answer_queries():\r\n\tfor i in range(q):\r\n\t\tu, k = map(int, input().split())\r\n\t\tindex = u-1\r\n\t\tif size[index] < k:\r\n\t\t\tprint(-1)\r\n\t\telse:\r\n\t\t\tprint(dfs[index_to_rank[index]+k-1]+1)\r\n\r\ntraverse()\r\nanswer_queries()\r\nprint('\\n'.join(map(str, answer)))", "n, q = map(int,input().split())\r\nofficers = map(int,input().split())\r\n\r\ns = [[] for _ in range(n)]\r\nc = [1] * n\r\nb = [0] * n\r\n\r\nfor i,v in enumerate(officers):\r\n\ts[v-1].append(i+1)\r\n\r\ntraversal = []\r\ndef dfs():\r\n\tstack = [0]\r\n\twhile stack:\r\n\t\tn = stack.pop()\r\n\t\ttraversal.append(n)\r\n\t\tfor child in reversed(s[n]):\r\n\t\t\tstack.append(child)\r\ndfs()\r\n\r\nfor i in range(n):\r\n\tb[traversal[i]] = i\r\n\r\nfor i in range(n-1,-1,-1):\r\n\tfor child in s[i]:\r\n\t\tc[i] += c[child]\r\n# print(c)\r\nanswer = []\r\nfor _ in range(q):\r\n\tu, k = map(int,input().split())\r\n\tstart = b[u-1]\r\n\tif k <= c[u-1]:\r\n\t\tanswer.append((str(traversal[start+k-1]+1)))\r\n\t\t# print(traversal[start+k-1]+1)\r\n\telse:\r\n\t\tanswer.append(\"-1\")\r\nprint('\\n'.join(answer))\r\n", "import sys\r\nfrom bisect import bisect_left,bisect_right\r\nfrom collections import defaultdict as dd\r\nfrom collections import deque, Counter\r\nfrom heapq import heappop,heappush,heapify,merge\r\nfrom itertools import permutations, accumulate, product\r\nfrom math import gcd,sqrt,ceil\r\ntoBin=lambda x:bin(x).replace(\"0b\",\"\")\r\nI=lambda:map(int,input().split())\r\ninf=float(\"inf\");DIRS=[[1,0],[-1,0],[0,1],[0,-1]];CHARS=\"abcdefghijklmnopqrstuvwxyz\";MOD=10**9+7\r\n###### Fill out N to calculate combinations#####################\r\n# N=300010;fac=[1]*N;invfac=[1]*N\r\n# for i in range(2,N):fac[i]=fac[i-1]*i%MOD\r\n# invfac[N-1]=pow(fac[N-1],MOD-2,MOD)\r\n# for i in range(N-1)[::-1]:invfac[i]=invfac[i+1]*(i+1)%MOD\r\n# def c(i,j):return 0 if i<j else fac[i]*invfac[j]*invfac[i-j]\r\n###############################################################\r\ninput=sys.stdin.readline\r\n\r\nclass UnionFind:\r\n def __init__(self,n):self.p=list(range(n));self.rank=[0]*n\r\n def find(self,x):\r\n if x!=self.p[x]:self.p[x]=self.find(self.p[x])\r\n return self.p[x]\r\n def union(self,x, y):\r\n px,py=self.find(x),self.find(y)\r\n if px==py:return 0\r\n self.p[py]=px\r\n self.rank[px]+=self.rank[py]\r\n return 1\r\n\r\nfrom types import GeneratorType\r\ndef cache(f,queue=[]):\r\n def wrappedfunc(*args,**kwargs):\r\n if queue:return f(*args, **kwargs)\r\n else:\r\n to = f(*args,**kwargs)\r\n while True:\r\n if isinstance(to,GeneratorType):queue.append(to);to = next(to)\r\n else:\r\n if not queue:break\r\n queue.pop()\r\n if not queue:break\r\n to=queue[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\ndef query(x,y):\r\n print(\"?\",x,y,flush=True)\r\n return int(input())\r\n\r\n# DP,BS,Greedy,Graph,Contribution,IE,Game,Reverse simulation\r\ndef main():\r\n \"\"\"\r\n map: pi:[(ki,index)]\r\n start 1530m, TLE at T2 28:22, runtime with pypy64 - 40m, TLE at 56m..without sorting, last attempt TLE\r\n \"\"\"\r\n n,q=I();G={i:[] for i in range(n)};A=list(I());s=[0]*(n+1);e=[0]*(n+1)\r\n for i in range(1,n):G[A[i-1]-1].append(i)\r\n st=[(0,True)];L=[];i=0\r\n while st:\r\n node,keep=st.pop()\r\n if not keep:e[node]=i;continue\r\n L.append(node)\r\n s[node]=i;st.append((node,False))\r\n i+=1\r\n for neigh in G[node][::-1]:\r\n st.append((neigh,True))\r\n for i in range(q):\r\n p,k=I();p-=1;k-=1\r\n if e[p]-s[p]-1<k:print(-1)\r\n else:print(L[s[p]+k]+1)\r\n\r\n###### Comment this out for Python 3 + imports at the top #####\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n###### Uncomment this for Python 3 (for deep recursion) ######\r\n# from sys import stdin, setrecursionlimit\r\n# import threading\r\n# from collections import defaultdict as dd\r\n# setrecursionlimit(5*10**5);input=stdin.buffer.readline;I=lambda:map(int,input().split())\r\n# threading.stack_size(10**8)\r\n# t = threading.Thread(target=main)\r\n# t.start()\r\n# t.join()", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt,factorial,pi,inf\r\nfrom collections import deque,defaultdict\r\nfrom bisect import bisect,bisect_left\r\nfrom itertools import permutations as per\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\n')\r\nL=lambda:list(R())\r\nP=lambda x:stdout.write(str(x)+'\\n')\r\nnCr=lambda x,y:(f[x]*inv((f[y]*f[x-y])%N))%N\r\n\r\nn,m=R()\r\na=L()\r\nv=[[] for i in range(n)]\r\nfor i in range(n-2,-1,-1):\r\n\tv[a[i]-1]+=i+1,\r\ns=[]\r\nstk=[0]\r\n#print(v)\r\nwhile stk:\r\n\tp=stk.pop()\r\n\ts+=p,\r\n\tfor i in v[p]:\r\n\t\tstk+=i,\r\nval=[1]*n\r\n#print(s)\r\nfor i in s[1:][::-1]:\r\n\tval[a[i-1]-1]+=val[i]\r\n#print(val)\r\nind=[0]*n\r\nfor i in range(n):\r\n\tind[s[i]]=i\r\nfor i in range(m):\r\n\tx,y=R()\r\n\tif val[x-1]<y:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(s[ind[x-1]+y-1]+1)", "import sys\r\ninput = sys.stdin.readline\r\nfrom heapq import *\r\n\r\ndef main():\r\n n, q = map(int, input().split())\r\n edges = [[] for _ in range(n)]\r\n P = list(map(int, input().split()))\r\n for i, p in enumerate(P, 1):\r\n edges[p - 1].append(i)\r\n for i in range(n):\r\n edges[i].sort(reverse = True)\r\n query = [[] for _ in range(n)]\r\n ans = [-1] * q\r\n for i in range(q):\r\n u, k = map(int, input().split())\r\n query[u - 1].append((i, k))\r\n fin = [False] * n\r\n dic = {}\r\n ind = 0\r\n stack = [(0, 0), (0, 1)]\r\n while stack:\r\n pos, t = stack.pop()\r\n if t == 0:\r\n fin[pos] = True\r\n else:\r\n for i, k in query[pos]:\r\n if ind + k not in dic:\r\n dic[ind + k] = []\r\n dic[ind + k].append((i, pos))\r\n ind += 1\r\n if ind in dic:\r\n for i, bpos in dic[ind]:\r\n if not fin[bpos]:\r\n ans[i] = pos + 1\r\n for npos in edges[pos]:\r\n stack.append((npos, 0))\r\n stack.append((npos, 1))\r\n print(*ans, sep=\"\\n\")\r\n \r\n \r\nfor _ in range(1):\r\n main()", "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,q=ris()\r\np=ris()\r\n\r\nadj=[[] for _ in range(n+1)]\r\nfor u,up in enum(p):\r\n adj[up].append(2+u)\r\n\r\np=[0,0]+p\r\n\r\npath=[0]\r\nstart=[0]*(n+1)\r\nstk=[1]\r\nwhile stk:\r\n u=stk.pop()\r\n start[u]=len(path)\r\n path.append(u)\r\n for v in reversed(adj[u]):\r\n stk.append(v)\r\n\r\nsize=[0]*(n+1)\r\nfor i in range(n,1,-1):\r\n size[p[i]]+=1+size[i]\r\n\r\nfor _ in range(q):\r\n u,k=ris()\r\n k-=1\r\n if size[u]<k:\r\n print(-1)\r\n else:\r\n print(path[start[u]+k])\r\n", "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\nclass DfsEulerOrder:\r\n def __init__(self, dct, root=0):\r\n # 模板：dfs序与欧拉序，支持在线区间修改树上边，并且实时查询任意两点树上距离\r\n n = len(dct)\r\n self.start = [-1] * n # 每个原始节点的dfs序号开始点也是node_to_order\r\n self.end = [-1] * n # 每个原始节点的dfs序号结束点\r\n self.parent = [-1] * n # 每个原始节点的父节点\r\n self.order_to_node = [-1] * n # 每个dfs序号对应的原始节点编号\r\n self.build(dct, root)\r\n return\r\n\r\n def build(self, dct, root):\r\n # 生成dfs序与欧拉序相关信息\r\n order = 0\r\n stack = [[root, -1]]\r\n while stack:\r\n i, fa = stack.pop()\r\n if i >= 0:\r\n self.start[i] = order\r\n self.order_to_node[order] = i\r\n self.end[i] = order\r\n order += 1\r\n stack.append([~i, fa])\r\n for j in dct[i]:\r\n if j != fa: # 注意访问顺序可以进行调整，比如字典序正序逆序\r\n self.parent[j] = i\r\n stack.append([j, i])\r\n else:\r\n i = ~i\r\n if self.parent[i] != -1:\r\n self.end[self.parent[i]] = self.end[i]\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, q = ac.read_list_ints()\r\n dct = [[] for _ in range(n)]\r\n p = ac.read_list_ints_minus_one()\r\n for i in range(n-1):\r\n dct[p[i]].append(i+1)\r\n for i in range(n):\r\n dct[i].reverse()\r\n dfs = DfsEulerOrder(dct)\r\n for _ in range(q):\r\n u, k = ac.read_list_ints()\r\n u -= 1\r\n x = dfs.start[u]\r\n if n-x < k or dfs.start[dfs.order_to_node[x+k-1]] > dfs.end[u]:\r\n ac.st(-1)\r\n else:\r\n ac.st(dfs.order_to_node[x+k-1] + 1)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,Q = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nP = [[] for _ in range(N)]\r\nfor i in range(1,N):\r\n u = i\r\n v = A[i-1]-1\r\n P[u].append(v)\r\n P[v].append(u)\r\n\r\nB = []\r\ncnt = [0]*N\r\nv = [(0,-1,0),(0,-1,1)]\r\nwhile v:\r\n i,p,t = v.pop()\r\n if t==1:\r\n B.append(i+1)\r\n \r\n for j in P[i][::-1]:\r\n if j==p:continue\r\n v.append((j,i,0))\r\n v.append((j,i,1))\r\n else:\r\n cur = 1\r\n for j in P[i]:\r\n if j==p:continue\r\n cur+=cnt[j]\r\n cnt[i] = cur\r\n \r\nlib = {}\r\nfor i in range(N):\r\n lib[B[i]] = i\r\n\r\n#print(B)\r\nfor _ in range(Q):\r\n u,k = map(int, input().split())\r\n if k>cnt[u-1]:\r\n print(-1)\r\n continue\r\n \r\n idx = lib[u]+k-1\r\n print(B[idx])\r\n \r\n", "n, q = [int(x) for x in input().split(\" \")]\nparent = [-1] + [int(x) - 1 for x in input().split(\" \")]\nstart = [0] * n\npath = [0] * n\nend = [1] * n\nsize = [1] * n\n\nfor i in range(n - 1, 0, -1):\n size[parent[i]] += size[i]\n\nfor v in range(1, n):\n start[v] = end[parent[v]]\n end[v] = start[v] + 1\n end[parent[v]] += size[v]\n path[start[v]] = v\n\nfor j in range(q):\n u, k = [int(x) - 1 for x in input().split(\" \")]\n print(-1 if k >= size[u] else path[start[u] + k] + 1)\n\n \t\t \t\t\t\t \t \t\t \t\t \t\t\t \t", "from collections import deque as dq\r\n\r\ndef dfs(G, s, ix, preorder):\r\n n = len(G)\r\n\r\n visited = [False for _ in range(n)]\r\n\r\n q = dq([[s, False]])\r\n \r\n while len(q) != 0:\r\n top, flag = q.pop()\r\n\r\n if flag:\r\n ix[top][1] = len(preorder)\r\n continue\r\n if visited[top]:\r\n continue\r\n visited[top] = True\r\n ix[top][0] = len(preorder)\r\n preorder.append(top)\r\n q.append([top, True])\r\n \r\n for i in G[top]:\r\n if not visited[i]:\r\n q.append([i, False])\r\n\r\nn, q = input().split(\" \")\r\nn = int(n)\r\nq = int(q)\r\n\r\nG = [ [] for _ in range(n) ]\r\n\r\nl = input().split(\" \")\r\nfor i in range(n-2, -1, -1):\r\n v = int(l[i])-1\r\n G[v].append(i+1)\r\n\r\npreorder = []\r\nix = [[0,0] for _ in range(n)]\r\n\r\ndfs(G, 0, ix, preorder)\r\n\r\nfor i in range(q):\r\n v, k = input().split(\" \")\r\n v = int(v)-1\r\n k = int(k)-1\r\n a, b = ix[v]\r\n if b-a <= k:\r\n print(\"-1\")\r\n else:\r\n print(preorder[a+k]+1)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\nimport random\r\nfrom bisect import bisect_right, bisect_left\r\nfrom itertools import product, permutations, combinations, combinations_with_replacement \r\nfrom collections import deque, defaultdict, Counter\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache, reduce\r\ninf = float('inf')\r\ndef error(*args, sep=' ', end='\\n'):\r\n print(*args, sep=sep, end=end, file=sys.stderr)\r\n# mod = 1000000007\r\n# mod = 998244353\r\nDIR = [(0, 1), (0, -1), (1, 0), (-1, 0)]\r\n\r\nfrom types import GeneratorType\r\n# 再帰用デコレータ\r\n# yieldにするのを忘れないこと\r\n# 参考: https://github.com/cheran-senthil/PyRival/blob/master/pyrival/misc/bootstrap.py\r\n\r\ndef antirec(func, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return func(*args, **kwargs)\r\n to = func(*args, **kwargs)\r\n while True:\r\n if isinstance(to, GeneratorType):\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n# ----------------------- #\r\n\r\nn, q = map(int, input().split())\r\nP = list(map(int, input().split()))\r\nG = [[] for _ in range(n)]\r\nfor i, p in enumerate(P, 1):\r\n p -= 1\r\n G[i].append(p)\r\n G[p].append(i)\r\nfor i in range(n):\r\n G[i].sort()\r\nUK = [list(map(lambda x: int(x)-1, input().split())) for i in range(q)]\r\nquery = defaultdict(list)\r\nfor i in range(q):\r\n u, k = UK[i]\r\n query[u].append((k, i))\r\n\r\nans = [-1] * q\r\nseen = defaultdict(list)\r\nt = 0\r\nsize = [0] * n\r\n\r\n@antirec\r\ndef dfs_size(v, p=-1):\r\n size[v] = 1\r\n for x in G[v]:\r\n if x == p: continue\r\n yield dfs_size(x, v)\r\n size[v] += size[x]\r\n yield\r\n\r\n@antirec\r\ndef dfs(v, p=-1):\r\n global t\r\n for k, i in query[v]:\r\n seen[t+k].append(i)\r\n for i in seen[t]:\r\n ans[i] = v + 1\r\n for x in G[v]:\r\n if x == p: continue\r\n t += 1\r\n yield dfs(x, v)\r\n yield\r\ndfs_size(0)\r\ndfs(0)\r\n\r\nfor i in range(q):\r\n u, k = UK[i]\r\n if size[u] <= k:\r\n ans[i] = -1\r\n\r\nprint('\\n'.join(map(str, ans)))\r\n", "n,q=map(int,input().split())\r\np=[-1]+[int(s)-1 for s in input().split()]\r\no=[0]*n\r\nl=[0]*n\r\ns=[1]*n\r\nv=[1]*n\r\nfor i in range(n-1,0,-1):\r\n s[p[i]] += s[i]\r\nfor i in range(1,n):\r\n l[i]=v[p[i]]\r\n v[p[i]] += s[i]\r\n o[l[i]]=i\r\n v[i]=l[i]+1\r\nres=[0]*q\r\nfor i in range(q):\r\n u,k=map(int,input().split())\r\n u-=1\r\n k-=1\r\n res[i]=str(o[l[u]+k]+1 if k < s[u] else -1)\r\nprint('\\n'.join(res))\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\nn,q=map(int,input().split())\r\npapa=list(map(int,input().split()))\r\nstatus=[[-1,-1] for i in range(n+1)]\r\ngraph={i:[] for i in range(1,n+1)}\r\nfor i in range(len(papa)):\r\n\tgraph[papa[i]].append(i+2)\r\nfor i in graph:\r\n\tgraph[i]=sorted(graph[i],reverse=True)\r\nstack=[1]\r\nl=[]\r\nwhile stack:\r\n\tx=stack[-1]\r\n\tif len(graph[x])==0:\r\n\t\tstatus[x][1]=len(l)\r\n\t\tif status[x][0]==-1:\r\n\t\t\tl.append(x)\r\n\t\t\tstatus[x][0]=status[x][1]\r\n\t\tstack.pop()\r\n\telse:\r\n\t\tif status[x][0]==-1:\r\n\t\t\tstatus[x][0]=len(l)\r\n\t\t\tl.append(x)\r\n\t\tstack.append(graph[x].pop())\r\n# print(l)\r\n# print(status)\r\nfor i in range(q):\r\n\tu,k=map(int,input().split())\r\n\tk-=1\r\n\tt=status[u][1]-status[u][0]\r\n\tif t==0:\r\n\t\tif k==0:\r\n\t\t\tprint(u)\r\n\t\telse:\r\n\t\t\tprint(-1)\r\n\telse:\r\n\t\tif k>=t:\r\n\t\t\tprint(-1)\r\n\t\telse:\r\n\t\t\tprint(l[status[u][0]+k])\r\n", "from collections import defaultdict\n\nn, q = [int(i) for i in input().split()]\n\nGraph = defaultdict(list)\n\np = [int(i) for i in input().split()]\n\nfor i in range(n - 1):\n Graph[p[i] - 1].append(i + 1)\n\nt = -1\ntin = [0] * n; tout = [0] * n\n\nord = []\n\nstack = [0]\nwhile len(stack) > 0:\n v = stack[len(stack) - 1]\n stack.pop()\n\n t += 1\n tin[v] = tout[v] = t\n\n ord.append(v)\n\n for i in reversed(Graph[v]):\n stack.append(i)\n\nfor i in reversed(ord):\n if len(Graph[i]) > 0: tout[i] = tout[Graph[i][len(Graph[i]) - 1]]\n\nfor i in range(q):\n u, k = [int(i) for i in input().split()]\n\n if tout[u - 1] - tin[u - 1] + 1 >= k:\n print(ord[tin[u - 1] + k - 1] + 1)\n else:\n print(-1)", "from sys import stdin\r\nimport bisect\r\ninput=stdin.readline\r\nn,q=map(int,input().split())\r\nt=[[] for i in range(n)]\r\np=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n t[p[i]-1].append(i+1)\r\n t[i+1].append(p[i]-1)\r\nfor i in range(n):\r\n t[i].sort(reverse=True)\r\n# dfs\r\nvis=[]\r\nque=[(-1,0)]\r\ncnt=0\r\np=[-1]+p\r\nfor i in range(1,n):\r\n p[i]-=1\r\nwhile que:\r\n par,ver=que.pop()\r\n vis.append(ver)\r\n for to in t[ver]:\r\n if par!=to:\r\n que.append((ver,to))\r\nsize=[1]*n\r\nfor i in vis[1:][::-1]:\r\n size[p[i]]+=size[i]\r\nidx=[-1]*n\r\nfor i in range(n):\r\n idx[vis[i]]=i\r\nfor _ in range(q):\r\n u,k=map(int,input().split())\r\n if size[u-1]<k:\r\n print(-1)\r\n else:\r\n print(vis[idx[u-1]+k-1]+1)", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nn,q=map(int,input().split())\r\np=[-1]+list(map(lambda x:int(x)-1,input().split()))\r\nedge=[[] for i in range(n)]\r\nfor i in range(1,n):\r\n edge[i].append(p[i])\r\n edge[p[i]].append(i)\r\n\r\nres=[]\r\nsize=[1]*n\r\ntodo=[(0,-1)]\r\nwhile todo:\r\n v,p=todo.pop()\r\n if v>=0:\r\n res.append(v)\r\n edge[v].sort(reverse=True)\r\n for u in edge[v]:\r\n if u!=p:\r\n todo.append((~u,v))\r\n todo.append((u,v))\r\n else:\r\n v=~v\r\n size[p]+=size[v]\r\n\r\ninvres=[0]*n\r\nfor i in range(n):\r\n invres[res[i]]=i\r\nfor _ in range(q):\r\n u,k=map(int,input().split())\r\n u-=1\r\n if size[u]<k:\r\n print(-1)\r\n else:\r\n print(res[invres[u]+k-1]+1)", "n, q = map(int, input().split())\r\npar = [int(v)-1 for v in input().split()]\r\nchs = [[] for i in range(n)]\r\nfor i, p in enumerate(par):\r\n chs[p].append(i+1)\r\nvis = [0 for _ in range(n)]\r\nbel = [1 for _ in range(n)]\r\nstack = [0]\r\norder = [0]\r\nwhile stack:\r\n v = stack[-1]\r\n if len(chs[v]) == vis[v]:\r\n if v != 0:\r\n bel[par[v-1]] += bel[v]\r\n stack.pop()\r\n continue\r\n ch = chs[v][vis[v]]\r\n vis[v] += 1\r\n order.append(ch)\r\n stack.append(ch)\r\nFST = {}\r\nfor i, c in enumerate(order):\r\n FST[c] = i\r\nout = []\r\nfor _ in range(q):\r\n u, k = map(lambda x: int(x) - 1, input().split())\r\n if k >= bel[u]:\r\n out.append(-1)\r\n else:\r\n out.append(order[FST[u] + k] + 1)\r\nprint('\\n'.join(map(str, out)))", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef topological_sort(G, n):\r\n seen = [0] * n\r\n childs = [0] * n\r\n ts = []\r\n for i in range(n):\r\n if seen[i]:\r\n continue\r\n Q = [(~i, None), (i, None)]\r\n while Q:\r\n u, p = Q.pop()\r\n if u >= 0:\r\n seen[u] = 1\r\n ts.append(u)\r\n for v in G[u][::-1]:\r\n if seen[v] == 2:\r\n continue\r\n elif seen[v] == 0:\r\n Q.append((~v, u))\r\n Q.append((v, u))\r\n else:\r\n u = ~u\r\n if p is not None:\r\n childs[p] += childs[u] + 1\r\n seen[u] = 2\r\n\r\n return ts, childs\r\n\r\n\r\ndef solution(n, m, p, q):\r\n G = [[] for _ in range(n)]\r\n for i in range(len(p)):\r\n u, v = i + 1, p[i]\r\n G[u].append(v)\r\n G[v].append(u)\r\n ts, ch = topological_sort(G, n)\r\n pos = dict()\r\n for i in range(len(ts)):\r\n pos.setdefault(ts[i] + 1, i)\r\n\r\n res = []\r\n for u, k in q:\r\n if k - 1 <= ch[u - 1]:\r\n idx = pos[u] + k - 1\r\n if idx < len(ts):\r\n res.append(ts[idx] + 1)\r\n else:\r\n res.append(-1)\r\n else:\r\n res.append(-1)\r\n\r\n return \"\\n\".join(map(str, res))\r\n\r\n\r\nn, m = [int(i) for i in input().split()]\r\np = [int(i) - 1 for i in input().split()]\r\nq = []\r\nfor i in range(m):\r\n q.append([int(i) for i in input().split()])\r\n\r\nprint(solution(n, m, p, q))\r\n", "def main():\r\n n, q = read_ints()\r\n pseq = read_ints()\r\n queries = [read_ints() for _ in range(q)]\r\n\r\n tree = [[] for _ in range(n+1)]\r\n for i, e in enumerate(pseq, start=2):\r\n tree[i].append(e)\r\n tree[e].append(i)\r\n\r\n queue = [1]\r\n level = {1: 0}\r\n for node in queue:\r\n for child in tree[node]:\r\n if child not in level:\r\n level[child] = level[node] + 1\r\n queue.append(child)\r\n\r\n stack = [1]\r\n visited = [False] * (n+1)\r\n visited[1] = True\r\n\r\n dfs_order = []\r\n while stack:\r\n node = stack.pop()\r\n dfs_order.append(node)\r\n for child in sorted(tree[node], reverse=True):\r\n if not visited[child]:\r\n stack.append(child)\r\n visited[child] = True\r\n\r\n dfs_pos = [-1] * (n + 1)\r\n for i, node in enumerate(dfs_order):\r\n dfs_pos[node] = i\r\n\r\n dp = [-1] * (n + 1)\r\n\r\n for node in reversed(dfs_order):\r\n if dp[node] == -1:\r\n dp[node] = 1\r\n for child in tree[node]:\r\n if level[child] > level[node]:\r\n dp[node] += dp[child]\r\n\r\n for u, k in queries:\r\n if dp[u] < k:\r\n print(-1)\r\n else:\r\n print(dfs_order[dfs_pos[u] + k - 1])\r\n\r\n\r\ndef input(): return next(test).strip()\r\ndef read_ints(): return [int(c) for c in input().split()]\r\ndef print_lines(lst): print('\\n'.join(map(str, lst)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n import sys\r\n from os import environ as env\r\n if 'COMPUTERNAME' in env and 'L2A6HRI' in env['COMPUTERNAME']:\r\n sys.stdout = open('out.txt', 'w')\r\n sys.stdin = open('in.txt', 'r')\r\n\r\n test = iter(sys.stdin.readlines())\r\n\r\n main()\r\n", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nimport sys\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\n\r\nn, Q = mp()\r\nd = defaultdict(list)\r\nl = li()\r\nfor i, ele in enumerate(l):\r\n d[i+2].append(ele)\r\n d[ele].append(i+2)\r\nfor i in d:\r\n d[i].sort(reverse=True)\r\nstack = [1]\r\nx = []\r\nle = 0\r\nans = []\r\nsub = defaultdict(lambda: 1)\r\nv = defaultdict(int)\r\nocc = defaultdict(lambda: -1)\r\nwhile stack:\r\n a = stack[-1]\r\n if not v[a]:\r\n occ[a] = le\r\n x.append(a)\r\n le += 1\r\n v[a] = 1\r\n f = 0\r\n for i in d[a]:\r\n if a - 2 >= 0:\r\n if i == l[a-2]:\r\n continue\r\n if not v[i]:\r\n stack.append(i)\r\n f = 1\r\n if f == 0:\r\n if stack:\r\n a = stack.pop()\r\n if a > 1:\r\n sub[l[a-2]] += sub[a]\r\nfor i in range(Q):\r\n a, b = mp()\r\n if b > sub[a]:\r\n ans.append(-1)\r\n else:\r\n ans.append(x[occ[a]+b-1])\r\nprint(*ans, sep='\\n')\r\n", "# https://codeforces.com/contest/1006\n\nimport sys\nfrom collections import deque\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\n\ndef solve_case():\n n, q = map(int, input().split())\n p = list(map(int, input().split()))\n\n direct_subordinates = [[] for _ in range(n + 1)]\n for officer, direct_superior in enumerate(p, 2):\n direct_subordinates[direct_superior] += [officer]\n\n order = [0] * (n + 1)\n start = [0] * (n + 1)\n finish = [0] * (n + 1)\n\n stack = deque([(1, True)])\n i = 1\n while stack:\n officer, go_down = stack.pop()\n if not go_down:\n finish[officer] = i\n continue\n order[i] = officer\n start[officer] = i\n i += 1\n stack.append((officer, False))\n for direct_subordinate in sorted(direct_subordinates[officer], reverse=True):\n stack.append((direct_subordinate, True))\n\n for _ in range(q):\n u, k = map(int, input().split())\n if start[u] + k - 1 < finish[u]:\n print(order[start[u] + k - 1])\n else:\n print(-1)\n\n\nsolve_case()\n", "import sys\r\ninput = sys.stdin.readline\r\nn,q = map(int,input().split())\r\npi = list(map(int,input().split()))\r\ntree = {i:[] for i in range(1,n+1)}\r\nfor i in range(n-1):\r\n tree[pi[i]].append(i+2)\r\nfor i in tree:\r\n tree[i] = list(sorted(tree[i]))\r\narr = []\r\nstack = [1]\r\nvisited = set()\r\ncount = [1 for i in range(n+1)]\r\nwhile stack:\r\n root = stack[-1]\r\n if root in visited:\r\n for i in tree[root]:\r\n count[root]+=count[i]\r\n stack.pop()\r\n else:\r\n visited.add(root)\r\n arr.append(root)\r\n d = []\r\n for i in tree[root]:\r\n d.append(i)\r\n stack+=d[::-1]\r\nind = {arr[i]:i for i in range(n)}\r\nfor i in range(q):\r\n u,k = map(int,input().split())\r\n if count[u]<k:\r\n print(-1)\r\n else:\r\n print(arr[ind[u]+k-1])", "n,q=map(int,input().split())\r\npa=list(map(int,input().split()))\r\ndicc={}\r\nfor i in range(n-1):\r\n dicc[pa[i]]=dicc.get(pa[i],[])+[i+2]\r\nfrom collections import deque\r\nstartend=[[0,0] for _ in range(n+1)]\r\nstartend[1]=[1,n]\r\nans1=[0]\r\nque=deque([1])\r\nvisited=set([])\r\nleng=1\r\nwhile que:\r\n temp=que.popleft()\r\n ans1.append(temp)\r\n startend[temp][0]=leng\r\n visited.add(temp)\r\n if temp in dicc:\r\n for x in dicc[temp][::-1]:\r\n que.appendleft(x)\r\n else:\r\n startend[temp][1]=leng\r\n while pa[temp-2]!=1:\r\n temp=pa[temp-2]\r\n if set(dicc[temp]).issubset(visited):\r\n startend[temp][1]=leng\r\n else:\r\n break\r\n leng+=1\r\nfor i in range(q):\r\n u,k=map(int,input().split())\r\n if k<=startend[u][1]-startend[u][0]+1:\r\n print(ans1[k-1+startend[u][0]])\r\n else:\r\n print(-1)", "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\n# sys.setrecursionlimit(5*10**6)\r\n\r\ndef main():\r\n\tans = []\r\n\tn, q= read(); par = [0, 0]+read()\r\n\tadj = defaultdict(list)\r\n\tfor i in range(2, n+1):\r\n\t\tadj[par[i]].append(i)\r\n\tfor i in adj:adj[i].sort(reverse = True)\r\n\tord_arr = []\r\n\torder = defaultdict(int)\r\n\tstk = [1]\r\n\twhile stk:\r\n\t\tnode = stk.pop()\r\n\t\tord_arr.append(node)\r\n\t\torder[node] = len(ord_arr)\r\n\t\tfor child in adj[node]:\r\n\t\t\tif child != par[node]:\r\n\t\t\t\tstk.append(child)\r\n\t# print(ord_arr)\r\n\t# print(order)\r\n\tsub_tree = defaultdict(int)\r\n\tfor i in range(n, 0, -1):\r\n\t\tsub_tree[i] += 1\r\n\t\tsub_tree[par[i]] += sub_tree[i]\r\n\t# print(sub_tree)\r\n\r\n\tfor i in range(q):\r\n\t\tu, v = read()\r\n\t\tif sub_tree[u] < v:\r\n\t\t\tans.append(str(-1))\r\n\t\telse:\r\n\t\t\tans.append(str(ord_arr[order[u]-1 + v - 1]))\r\n\tprint((\"\\n\").join(ans))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nc1, c2, c3, c4 = map(int, input().split())\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\n\r\nz = c2/c1\r\ns1, s2 = 0, 0\r\nfor i in a:\r\n if i > z:\r\n s1 += c2\r\n else:\r\n s1 += c1*i\r\n\r\nfor i in b:\r\n if i > z:\r\n s2 += c2\r\n else:\r\n s2 += c1*i\r\n\r\n\r\nprint(min(c4, min(s1, c3) + min(s2, c3)))", "c1, c2, c3, c4 = map(int, input().split())\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nsum1 = 0\r\nfor i in range(n):\r\n sum1 += min(a[i] * c1, c2)\r\nsum2 = 0\r\nfor i in range(m):\r\n sum2 += min(b[i] * c1, c2)\r\nprint(min(c4, 2 * c3, c3 + sum1, c3 + sum2, sum1 + sum2))", "c1, c2, c3, c4 = map(int, input().split())\r\nn, m = map(int, input().split())\r\nlst1 = list(map(int, input().split()))\r\nlst2 = list(map(int, input().split()))\r\nbuss = 0\r\nfor i in lst1:\r\n buss += min(c1 * i, c2)\r\nbuss = min(buss, c3)\r\n\r\ntr = 0\r\nfor i in lst2:\r\n tr += min(c1 * i, c2)\r\ntr = min(tr, c3)\r\n\r\nprint(min(c4, buss + tr))\r\n", "s = input().split()\r\na, b, c, d = int(s[0]), int(s[1]), int(s[2]), int(s[3])\r\ns = input().split()\r\nn, m = int(s[0]), int(s[1])\r\ns = input().split()\r\nt = input().split()\r\nSans = 0\r\nTans = 0\r\n\r\nfor i in range(n):\r\n Sans += min(int(s[i]) * a, b)\r\nfor i in range(m):\r\n Tans += min(int(t[i]) * a, b)\r\n\r\nans = min(d, min(Sans, c) + min(Tans, c))\r\n\r\nprint(ans)", "c1,c2,c3,c4=map(int,input().split())\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ns=[]\r\ns0=0\r\nfor i in range(n):\r\n s.append(min(a[i]*c1,c2))\r\n s0+=s[i]\r\ns1=[]\r\ns10=0\r\nfor i in range(m):\r\n s1.append(min(b[i]*c1,c2))\r\n s10+=s1[i]\r\nprint(min((min(s0,c3)+min(s10,c3)),c4))", "# t = int(input())\n# l = set([])\n# for i in range(t):\n# strs = input().split(\" \")\n# for i in range(int(strs[0]), int(strs[1])+1,1):\n# l.add(i)\n\n# print(len(l))\n\nc = list(map(int, input().split(' ')))\nc1 = c [0]\nc2 = c [1]\nc3 = c [2]\nc4 = c [3]\n\ninput()\n\nbusRides = list(map(int, input().split(' ')))\ntroRides = list(map(int, input().split(' ')))\n\nbusSum = 0 \n\nfor rides in busRides:\n busSum += min(c2,rides*c1)\nbusMin = min(c3,busSum)\n\ntroSum = 0 \n\nfor rides in troRides:\n troSum += min(c2,rides*c1)\ntroMin = min(c3,troSum)\nprint(min(c4,troMin+busMin))\n\n\n\n\t\t \t \t \t \t\t \t\t\t \t\t \t \t", "c1, c2 ,c3 ,c4 = input().split()\nc1, c2, c3, c4 = int(c1), int(c2), int(c3), int(c4)\n\nsizebus, sizetra = input().split()\nsizebus, sizetra = int(sizebus), int(sizetra)\n\narrbus = input().split()\narrbus = [int(x) for x in arrbus]\n\narrtra = input().split()\narrtra = [int(x) for x in arrtra]\n\nsoma = 0\nsomabus = 0\nsomatra = 0\n\nfor i in range(sizebus):\n somabus += arrbus[i] * c1\n if(arrbus[i] * c1 < c2):\n continue\n else:\n somabus -= arrbus[i] * c1\n somabus += c2\n \nsomabus = min(somabus, c3)\n'''\n1 3 7 19\n2 3\n2 5\n4 4 4\n\n4 3 2 1\n1 3\n798\n1 2 3\n\n100 100 8 100\n3 5\n7 94 12\n100 1 47 0 42\n\n'''\nfor i in range(sizetra):\n somatra += arrtra[i] * c1\n if(arrtra[i] * c1 < c2):\n continue\n else:\n somatra -= arrtra[i] * c1\n somatra += c2\n \nsomatra = min(somatra, c3)\n \nsoma = min(c4, somabus + somatra)\n\nprint(soma)\n\t\t\t \t\t\t\t\t \t\t \t \t\t \t \t\t\t\t\t\t \t", "import sys;\n\nc1, c2, c3, c4 = map(int, sys.stdin.readline().split(' '));\nnbBuses, nbTrolleys = map(int, sys.stdin.readline().split(' '));\n\nbuses = map(int, sys.stdin.readline().split(' '));\ntrolleys = map(int, sys.stdin.readline().split(' '));\n\nminBusesCost = 0;\nfor nbRide in buses:\n\tminBusesCost += min(c2, nbRide * c1);\n\nminTrolleysCost = 0;\nfor nbRide in trolleys:\n\tminTrolleysCost += min(c2, nbRide * c1);\n\n# print(c1, c2, c3, c4, minBusesCost, minTrolleysCost);\n\nminCost = min(\n\tc4,\n\tmin(\n\t\tc3,\n\t\tminBusesCost\n\t) +\n\tmin(\n\t\tc3,\n\t\tminTrolleysCost\n\t)\n);\nprint(minCost);", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import fsum, sqrt, gcd, ceil, factorial\r\nfrom operator import add\r\n\r\ninf = float('inf')\r\n# input = sys.stdin.readline\r\nflush = lambda : sys.stdout.flush\r\ncomb = lambda x , y : (factorial(x) // factorial(y)) // factorial(x - y) \r\n\r\n\r\n#inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda : input()\r\nii = lambda : int(input())\r\nr = lambda : map(int, input().split())\r\nrr = lambda : list(r())\r\n\r\n\r\na , b, c , d = r()\r\nn , k = r()\r\narr = rr()\r\nbrr = rr()\r\n\r\ncost = 0\r\nfor i in range(n):\r\n cost += min(arr[i] * a , b)\r\n\r\ncost = min(cost , c)\r\n\r\ncost2 = 0\r\nfor i in range(k):\r\n cost2 += min(brr[i] * a , b)\r\n\r\ncost2 = min(cost2 , c)\r\n\r\n\r\nprint(min(cost + cost2 , d))", "def readln(): return tuple(map(int, input().split()))\n\nc = readln()\nn, m = readln()\na = readln()\nb = readln()\n\nva = min(sum([min(c[1], c[0] * _) for _ in a]), c[2])\nvb = min(sum([min(c[1], c[0] * _) for _ in b]), c[2])\n\nprint(min(va + vb, c[3]))\n", "c = [int(x) for x in input().split()]\r\nn, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nbu = min(c[2], sum(min(c[1], c[0] * ai) for ai in a))\r\ntr = min(c[2], sum(min(c[1], c[0] * bi) for bi in b))\r\nprint(min(c[3], bu + tr))\r\n", "c1, c2, c3, c4 = map(int, input().split())\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ncur1 = 0\r\nfor i in a:\r\n cur1 += min(i * c1, c2)\r\n \r\ncur2 = 0\r\nfor i in b:\r\n cur2 += min(i * c1, c2)\r\n\r\nansw = min(cur1 + cur2, c3 + cur2, cur1 + c3, 2 * c3)\r\nprint(min(answ, c4))\r\n\r\n", "\r\nc1,c2,c3,c4 = map(int,input().split())\r\nn,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc=0\r\nfor i in range(n):\r\n if a[i]*c1 < c2:\r\n c += a[i] * c1\r\n else:\r\n c += c2\r\nif c3 < c:\r\n c = c3\r\nx=0\r\nfor i in range(m):\r\n if b[i]*c1 < c2 :\r\n x += b[i] * c1\r\n else:\r\n x += c2\r\nif c3 < x:\r\n x = c3\r\nprint(min(c+x, c4))\r\n\r\n\r\n", "a,b,c,d=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\nbusao,bonde=input().split()\r\nbusao=int(busao)\r\nbonde=int(bonde)\r\nbusvet=input().split()\r\nbovet=input().split()\r\nfor x in range(busao):\r\n busvet[x]=int(busvet[x])\r\nfor x in range(bonde):\r\n bovet[x]=int(bovet[x])\r\nx=0\r\ny=0\r\nfor i in range(busao):\r\n x=x+min(busvet[i]*a,b)\r\nfor i in range(bonde):\r\n y=y+min(bovet[i]*a,b)\r\nresultado=min(d,(min(c,x)+min(c,y)))\r\nprint(resultado)\r\n", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nc1,c2,c3,c4=rinput()\r\nn,m=rinput()\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\ns=0\r\nfor i in range(len(a)):\r\n s+=min(c2,c1*a[i])\r\n \r\ns1=min(c3,s)\r\n\r\nl=0\r\nfor i in range(len(b)):\r\n l+=min(c2,c1*b[i])\r\n \r\nl1=min(c3,l)\r\n\r\nprint(min(c4,s1+l1))", "c1,c2,c3,c4=map(int,input().split())\n\nn,m=map(int,input().split())\nB=list(map(int,input().split()))\n\nT=list(map(int,input().split()))\n\nif(sum(B)==0):\n C=0\n for item in T:\n if(item*c1>c2):\n C+=c2\n else:\n C+=item*c1\n print(min((C,c4,c3)))\n\nelif(sum(T)==0):\n C=0\n for item in B:\n if(item*c1>c2):\n C+=c2\n else:\n C+=item*c1\n print(min((C,c4,c3)))\n\nelse:\n A=0\n for item in T:\n if(item*c1>c2):\n A+=c2\n else:\n A+=item*c1\n Q=0\n for item in B:\n if(item*c1>c2):\n Q+=c2\n else:\n Q+=item*c1\n print(min((A+Q,c3+c3,c4,A+c3,Q+c3)))\n \n", "c1,c2,c3,c4 = map(int,input().split())\r\nn,m = map(int,input().split())\r\nbus = [int(i) for i in input().split()]\r\ntrol = [int(i) for i in input().split()]\r\ndef solve(arr):\r\n res = 0\r\n for i in range(len(arr)):\r\n res += min(c2,c1*arr[i])\r\n return min(res,c3)\r\nprint(min(c4,solve(bus)+solve(trol)))", "c1,c2,c3,c4=map(int,input().split())\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans=0\r\nfor i in range(0,len(a)):\r\n ans+=min(c2,a[i]*c1)\r\nans=min(ans,c3)\r\nans1=0\r\nfor i in range(0,len(b)):\r\n ans1+=min(c2,b[i]*c1)\r\nans1=min(c3,ans1)\r\nprint(min(c4,ans1+ans))\r\n ", "c1,c2,c3,c4 = map(int, input().split())\r\nn,m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nsuma = sum(min(c1*x, c2) for x in a)\r\nsumb = sum(min(c1*x, c2) for x in b)\r\nprint(min(min(suma,c3) + min(sumb, c3), c4))\r\n", "c1,c2,c3,c4=map(int,input().split())\r\nn,m=map(int,input().split())\r\nn1=list(map(int,input().split()))\r\nm1=list(map(int,input().split()))\r\ns1=0\r\nr=[]\r\nfor i in range(n):\r\n\tif((n1[i]*c1)>(c2)):\r\n\t\ts1=s1+c2\r\n\telse:\r\n\t\ts1=s1+n1[i]*c1\r\nr.append(s1+c3)\r\ns2=0\r\nfor i in range(m):\r\n\tif((m1[i]*c1)>(c2)):\r\n\t\ts2=s2+c2\r\n\telse:\r\n\t\ts2=s2+m1[i]*c1\r\nr.append(s2+c3)\r\nr.append(s1+s2)\r\nr.append(2*c3)\r\nr.append(c4)\r\nprint(min(r))", "\r\na,b,c,d = input().split()\r\na,b,c,d = int(a), int(b), int(c), int(d)\r\nn,m = input().split()\r\nn,m = int(n), int(m)\r\nnums1 = list(map(int, input().split()))\r\nnums2 = list(map(int, input().split()))\r\nnums1.sort(reverse=True)\r\nnums2.sort(reverse=True)\r\n\r\nm1 = 0\r\nfor i in nums1:\r\n if i*a < b:\r\n m1+=i*a\r\n else:\r\n m1+=b\r\nm2 = b*len(nums1)\r\nm3 = c\r\nl1 = [m1,m2,m3]\r\nm5 = 0\r\nfor i in nums2:\r\n if i*a < b:\r\n m5+=i*a\r\n else:\r\n m5+=b\r\nm6 = b*len(nums2)\r\nm7 = c\r\n\r\nl2 = [m5,m6,m7]\r\nres = float('inf')\r\nfor i in l1:\r\n for j in l2:\r\n res = min(res, i+j)\r\nres = min(res, d)\r\nprint(res)", "c = list(map(int, input().split()))\n\nn, m = map(int, input().split())\n\np, q = list(map(int, input().split())), list(map(int, input().split()))\n\nprint(min(c[3], min(c[2], sum(min(c[0] * i, c[1]) for i in p)) + min(c[2], sum(min(c[0] * i, c[1]) for i in q)))) \n\n\n\n# Made By Mostafa_Khaled", "entrada = input().split()\naux = input()\n\nbuses = input().split()\ncarros = input().split()\n\nc1 = int(entrada[0])\nc2 = int(entrada[1])\nc3 = int(entrada[2])\nc4 = int(entrada[3])\n\nbuses = [int(valor) for valor in buses]\ncarros = [int(valor) for valor in carros]\n\nbuses.sort()\ncarros.sort()\n\nprecoBuses = 0\nfor valor in buses:\n precoBuses += c1*valor\n\nprecoCarro = 0\nfor valor in carros:\n precoCarro += c1*valor\n\nif(buses[-1]*c1 > c2):\n precoBuses = 0\n for valor in buses:\n if(valor*c1 < c2):\n precoBuses += valor*c1\n else:\n precoBuses += c2\n\nif(carros[-1]*c1 > c2):\n precoCarro = 0\n for valor in carros:\n if(valor*c1 < c2):\n precoCarro += valor*c1\n else:\n precoCarro += c2\n\nif(precoBuses > c3):\n precoBuses = c3\n\nif(precoCarro > c3):\n precoCarro = c3\n\nif(precoCarro + precoBuses > c4):\n print(c4)\nelse:\n print(precoCarro + precoBuses)\n\t\t\t\t \t\t\t \t\t\t \t\t\t\t\t\t \t\t\t\t\t \t\t", "x = input().split()\r\nc1 = int(x[0])\r\nc2 = int(x[1])\r\nc3 = int(x[2])\r\nc4 = int(x[3])\r\nx = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\na = []\r\nb = []\r\np1 = []\r\np2 = []\r\nx = input().split()\r\nfor i in range(n):\r\n tmp = int(x[i])\r\n a.append(tmp)\r\nx = input().split() \r\nfor i in range(m):\r\n tmp = int(x[i])\r\n b.append(tmp)\r\nfor i in range(len(a)):\r\n p1.append(min(c2, c1*a[i]))\r\nfor i in range(len(b)):\r\n p2.append(min(c2, c1*b[i]))\r\nPa = min(sum(p1), c3)\r\nPb = min(sum(p2), c3)\r\nP = min(Pa+Pb, c4)\r\nprint(P)", "a,b,c,d=map(int,input().split())\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nxx=0\r\nfor i in range(n):\r\n u=min(a*l[i],b)\r\n xx=xx+u\r\nxx=min(xx,c)\r\nyy=0\r\nfor i in range(m):\r\n u=min(a*x[i],b)\r\n yy=yy+u\r\nyy=min(yy,c)\r\nz=xx+yy\r\nprint(min(d,z))\r\n", "def p(f):\r\n r=0\r\n for x in f:\r\n if x*a>b:\r\n r+=b\r\n else:\r\n r+=x*a\r\n return r\r\n\r\nscan=lambda:map(int,input().split())\r\na,b,c,d=scan()\r\nn,m=scan()\r\nf=list(scan())\r\ng=list(scan())\r\nr1=p(f)\r\nif r1>c:\r\n r1=c\r\nr2=p(g)\r\nif r2>c:\r\n r2=c\r\nr=r1+r2\r\nif r>d:\r\n r=d\r\nprint(r)", "c = list(map(int,input().split()))\nn,m = map(int,input().split())\nb = list(map(int,input().split()))\nt = list(map(int,input().split()))\nd = 0\nfor x in b:\n\tif (x * c[0]) <= c[1]:d += x * c[0]\n\telse:d += c[1]\nif d > c[2] :d = c[2]\nf = 0\nfor x in t:\n\tif (x * c[0]) < c[1]:f += x *c[0]\n\telse:f += c[1]\nif f > c[2] :f = c[2]\nif (d + f) < c[3]:print(d + f)\nelse:print(c[3])", "c1, c2, c3, c4 = map(int, input().split())\r\nn, m = map(int, input().split())\r\nbus = list(map(int, input().split()))\r\ntrol = list(map(int, input().split()))\r\n\r\nmbus = [0] * n\r\nmtrol = [0] * m\r\n\r\nfor i in range (n):\r\n mbus[i] = min(bus[i] * c1, c2)\r\nsbus = min(sum(mbus), c3)\r\n\r\nfor i in range (m):\r\n mtrol[i] = min(trol[i] * c1, c2)\r\nstrol = min(sum(mtrol), c3)\r\n\r\nres = min(sbus + strol, c4)\r\n\r\nprint(res)", "def findLess(l,c1,c2,c3):\n ans=0\n for i in l:\n ans+=min(c2,i*c1)\n return min(ans,c3)\nc1,c2,c3,c4=map(int,input().split())\ninput()\nl1=list(map(int,input().split()))\nl2=list(map(int,input().split()))\nans4=c4\nans1=findLess(l1,c1,c2,c3)\nans2=findLess(l2,c1,c2,c3)\nprint(str(min(c4,ans2+ans1)),end=\"\")\n\n\n\n\t\t \t\t \t \t \t\t \t\t \t \t \t \t", "c1,c2,c3,c4=list(map(int,input().split()))\r\nn,m=list(map(int,input().split()))\r\nbus=list(map(int,input().split()))\r\ntro=list(map(int,input().split()))\r\nx1,x2,x3=0,0,0\r\nfor item in bus:\r\n if item*c1>c2:\r\n x1+=c2\r\n else:\r\n x1+=item*c1\r\n\r\nfor item in tro:\r\n if item*c1>c2:\r\n x2+=c2\r\n else:\r\n x2+=item*c1\r\nx3=min(x1,c3)+min(x2,c3)\r\nif c4<x3:\r\n print(c4)\r\nelse:\r\n print(x3)\r\n\r\n\r\n\r\n", "from math import floor\nc1, c2, c3, c4 = map(int, input().split())\nn, m = map(int, input().split())\n# TODO worth doing a test it analysis\nbus = [int(x) for x in input().split()]\ntrol = [int(x) for x in input().split()]\n\n\nthres = floor(c2/c1)\n\n## calculate bus side\nbus_res = 0\nfor v in bus:\n if v>thres:\n bus_res += c2\n else:\n bus_res += (v * c1)\n\nbus = min(c3, bus_res)\n\n\ntrol_res = 0\nfor v in trol:\n if v>thres:\n trol_res += c2\n else:\n trol_res += (v * c1)\n\ntrol = min(c3, trol_res)\n\nprint(min((bus + trol), c4))\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,d=list(map(int,input().split()))\nn,m=list(map(int,input().split()))\ns=u=0\np=list(map(int,input().split()))\nq=list(map(int,input().split()))\nfor i in range(n):\n\ts=s+min(b,a*p[i])\nfor i in range(m):\n\tu=u+min(b,a*q[i])\n\nprint(min(d,min(s,c)+min(u,c)))\n\n\n\n", "c1, c2, c3, c4 = map(int, input().split())\r\n\r\nn, m = map(int, input().split())\r\n\r\nbus = list(map(int, input().split()))\r\n\r\np = c2 // c1\r\nfor idx in range(n):\r\n if bus[idx] > 0:\r\n if bus[idx] > p:\r\n bus[idx] = c2\r\n else:\r\n bus[idx] = bus[idx] * c1\r\n\r\nb_total = min(sum(bus), c3)\r\n\r\ntrol = list(map(int, input().split()))\r\n\r\nfor idx in range(m):\r\n if trol[idx] > 0:\r\n if trol[idx] > p:\r\n trol[idx] = c2\r\n else:\r\n trol[idx] = trol[idx] * c1\r\nt_total = min(sum(trol), c3)\r\n\r\nprint(min(b_total + t_total, c4))", "# if max(buses) + max(trolleys) > c4: print(c4)\n\nc1, c2, c3, c4 = map(int, input().split())\nn, m = map(int, input().split())\nbuses = list(map(int, input().split()))\ntrolleys = list(map(int, input().split()))\n\nbus_cost_c2 = 0\nfor bus_count in buses:\n bus_cost_c2 += min(bus_count * c1, c2)\n\ntrolley_cost_c2 = 0\nfor trolley_count in trolleys:\n trolley_cost_c2 += min(trolley_count * c1, c2)\n\nbus_cost_c3 = min(bus_cost_c2, c3)\ntrolley_cost_c3 = min(trolley_cost_c2, c3)\n\nprint(min(bus_cost_c3 + trolley_cost_c3, c4))\n", "# LUOGU_RID: 101541065\n(c1, c2, c3, c4), _, a, b = [[*(map(int, s.split()))] for s in open(0)]\r\nprint(min(min(c3, sum(min(a * c1, c2) for a in a)) +\r\n min(c3, sum(min(b * c1, c2) for b in b)), c4))\r\n", "c=list(map(int,input().split()))[:4]\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))[:n]\r\nb=list(map(int,input().split()))[:m]\r\n\r\nd=0\r\ny=0\r\nfor i in range(n):\r\n \r\n x=0\r\n q=0\r\n q+=a[i]*c[0] \r\n x=min(q,c[1])\r\n y+=x \r\n\r\nd=min(c[2],y)\r\ng=0\r\ne=0\r\nfor j in range(m):\r\n x=0\r\n q=0\r\n q+=b[j]*c[0] \r\n x=min(q,c[1])\r\n e+=x\r\ng=min(c[2],e)\r\nprint(min(c[3],d+g))", "import sys\r\ninput=sys.stdin.readline\r\nl=input().split()\r\nc1=int(l[0])\r\nc2=int(l[1])\r\nc3=int(l[2])\r\nc4=int(l[3])\r\nl=input().split()\r\nn=int(l[0])\r\nm=int(l[1])\r\nl=input().split()\r\nai=[int(i) for i in l]\r\nl=input().split()\r\nbi=[int(i) for i in l]\r\nmaxa=c4\r\nsumi=0\r\nfor i in ai:\r\n sumi+=min(i*c1,c2)\r\nsumi=min(sumi,c3)\r\nsumi1=0\r\nfor i in bi:\r\n sumi1+=min(i*c1,c2)\r\nsumi1=min(sumi1,c3)\r\nprint(min(maxa,sumi+sumi1))\r\n", "def inputi():\r\n\ta = input().split(\" \")\r\n\treturn [int(i) for i in a]\r\n\t\r\nc1,c2,c3,c4 = inputi()\r\nn,m = inputi()\r\na=inputi()\r\nb=inputi()\r\nsumn = 0\r\nsumm = 0\r\nfor i in a:\r\n\tif c1*i<c2:\r\n\t\tsumn=sumn+c1*i\r\n\telse:\r\n\t\tsumn=sumn+c2\r\nif sumn > c3:\r\n\tsumn=c3\r\nfor i in b:\r\n\tif c1*i<c2:\r\n\t\tsumm=summ+c1*i\r\n\telse:\r\n\t\tsumm=summ+c2\r\nif summ > c3:\r\n\tsumm=c3\r\nif sumn + summ > c4:\r\n\tprint(c4)\r\nelse:\r\n\tprint(sumn+summ)\r\n", "c1,c2,c3,c4=map(int,input().split())\r\nn,m=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\na=0\r\nfor i in range(n):\r\n a+=min(c1*b[i],c2)\r\nans=min(a,c3)\r\nb=0\r\nfor i in range(m):\r\n b+=min(c1*t[i],c2)\r\nans+=min(b,c3)\r\nprint(min(ans,c4))", "R = lambda :map(int,input().split())\na1,a2,a3,a4 = R()\nn,m = R()\nb1 = list(map(lambda x: min(int(x)*a1,a2),input().split()))\nb2 = list(map(lambda x: min(int(x)*a1,a2),input().split()))\nprint(min(min(sum(b1),a3)+min(sum(b2),a3),a4))", "a,b,c,d = map(int,input().split())\r\nbu,tr = map(int,input().split())\r\nbl = list(map(int,input().split()))\r\ntl = list(map(int,input().split()))\r\nt = 0\r\nto = 0\r\nfor x in bl:\r\n if a*x > b: to += b\r\n else: to += a*x\r\nif to >= c: to = c\r\np1 = to\r\nto = 0\r\nfor x in tl:\r\n if a*x > b: to += b\r\n else: to += a*x\r\nif to >= c: to = c\r\nto += p1\r\nif to > d:\r\n to = d\r\nprint(to)", "import math\r\nimport string\r\n\r\ndef main_function():\r\n c_1, c_2, c_3, c_4 = [int(i) for i in input().split(\" \")]\r\n n, m = [int(i) for i in input().split(\" \")]\r\n a_n = [int(i) for i in input().split(\" \")]\r\n a_m = [int(i) for i in input().split(\" \")]\r\n cost_bus = 0\r\n cost_trolley = 0\r\n for i in a_n:\r\n cost_bus += min(i * c_1, c_2)\r\n for i in a_m:\r\n cost_trolley += min(i * c_1, c_2)\r\n cost_bus = min(cost_bus, c_3)\r\n cost_trolley = min(cost_trolley, c_3)\r\n min_cost = min(c_4, cost_bus + cost_trolley)\r\n print(min_cost)\r\n\r\n\r\nmain_function()\r\n", "#PublicTransport:\r\n\r\ncosts = input().split(\" \")\r\ncosts = [int(x) for x in costs]\r\ndata = input().split(\" \")\r\ntotalBuses = int(data[0])\r\ntotalTrolleys = int(data[1])\r\nbuses = input().split(\" \")\r\ntrolleys = input().split(\" \")\r\nbuses = [int(x) for x in buses]\r\ntrolleys = [int(x) for x in trolleys]\r\n\r\npossibleCosts = [0,0,0,0]\r\n\r\ntotalBusTravels = sum(buses)\r\ntotalTrolleysTravels = sum(trolleys)\r\n\r\ncost = [0,0]\r\n#Buses\r\nfor busCost in buses:\r\n\tif busCost*costs[0] > costs[1]:\r\n\t\tcost[0] += costs[1]\r\n\telse:\r\n\t\tcost[0] += busCost*costs[0]\r\nif cost[0] > costs[2]:\r\n\tcost[0] = costs[2]\r\n# Trolleys\r\nfor trolleyCost in trolleys:\r\n\tif trolleyCost*costs[0] > costs[1]:\r\n\t\tcost[1] += costs[1]\r\n\telse:\r\n\t\tcost[1] += trolleyCost*costs[0]\r\nif cost[1] > costs[2]:\r\n\tcost[1] = costs[2]\r\n\r\nif cost[0]+cost[1] > costs[3]:\r\n\tprint(costs[3])\r\nelse:\r\n\tprint(cost[0]+cost[1])\r\n\r\n", "I = lambda: map(int, input().split())\r\n\r\nc1, c2, c3, c4 = I()\r\nI()\r\nA = [min(a*c1,c2) for a in I()]\r\nB = [min(b*c1,c2) for b in I()]\r\n\r\nprint(min(min(c3,sum(A))+min(c3,sum(B)), c4))", "a,b,c,d=map(int,input().split())\nn,m=map(int,input().split())\n\ns,ans=0,0\n\nbus=list(map(int,input().split()))\ntr=list(map(int,input().split()))\n\nfor i in bus:\n\ts=s+min(b,a*i)\n\t\nfor i in tr:\n\tans=ans+min(b,a*i)\n\nprint(min(d,min(s,c)+min(ans,c)))\n\n\n\n\n\t \t\t \t\t\t \t\t \t \t\t \t \t \t\t", "import collections\r\nimport math\r\nimport sys\r\nneed_two = 0\r\ndef main():\r\n c = list(map(int, input().split()))\r\n n, m = map(int, input().split())\r\n nn = list(map(int, input().split()))\r\n mm = list(map(int, input().split()))\r\n ans = c[3]\r\n ans_n = c[2]\r\n s_n = 0\r\n for x in nn:\r\n s_n += min(x * c[0], c[1])\r\n ans_n = min(s_n, ans_n)\r\n\r\n ans_m = c[2]\r\n\r\n s_m = 0\r\n for x in mm:\r\n s_m += min(x * c[0], c[1])\r\n ans_m = min(s_m, ans_m)\r\n\r\n print(min(ans, ans_n + ans_m))\r\n\r\nif __name__ == \"__main__\":\r\n t = 1 # int(input())\r\n while t > 0:\r\n main()\r\n t -= 1\r\n", "c = list(map(int, input().split()))\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nsa = sum(a)*c[0]\r\nsb = sum(b)*c[0]\r\n\r\nfor i in a:\r\n sa = min(sa, sa - i*c[0] + c[1])\r\nfor i in b:\r\n sb = min(sb, sb - i*c[0] + c[1])\r\nprint(min(sa + sb, sa + c[2], sb + c[2], c[2] + c[2], c[3]))\r\n", "c1,c2,c3,c4=map(int, input().split())\r\nn,m=map(int, input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nmn1,mn2=0,0\r\nfor i in range(n):\r\n if(a[i]<c2//c1+1):\r\n mn1+=c1*a[i]\r\n else:\r\n mn1+=c2\r\nfor i in range(m):\r\n if(b[i]<c2//c1+1):\r\n mn2+=c1*b[i]\r\n else:\r\n mn2+=c2\r\nprint(min(c4,2*c3,mn1+c3,mn2+c3,mn1+mn2))", "import sys\r\nfor line in sys.stdin:\r\n cost = 0\r\n c1,c2,c3,c4 = [int(x) for x in line.split()]\r\n line = next(sys.stdin)\r\n n, m = [int(x) for x in line.split()]\r\n line = next(sys.stdin)\r\n a = [int(x) for x in line.split()]\r\n line = next(sys.stdin)\r\n b = [int(x) for x in line.split()]\r\n cost1 = 0\r\n for x in a:\r\n cost1 += min(x * c1, c2)\r\n cost1 = min(cost1, c3)\r\n \r\n cost2 = 0\r\n for x in b:\r\n cost2 += min(x * c1, c2)\r\n cost2 = min(cost2, c3)\r\n cost = min(c4, cost1 + cost2)\r\n print(cost)\r\n", "a,b,c,d=input().split()\na=int(a)\nb=int(b)\nc=int(c)\nd=int(d)\nbusao,bonde=input().split()\nbusao=int(busao)\nbonde=int(bonde)\nbusvet=input().split()\nbovet=input().split()\nfor x in range(busao):\n busvet[x]=int(busvet[x])\nfor x in range(bonde):\n bovet[x]=int(bovet[x])\nx=0\ny=0\nfor i in range(busao):\n x=x+min(busvet[i]*a,b)\nfor i in range(bonde):\n y=y+min(bovet[i]*a,b)\nresultado=min(d,(min(c,x)+min(c,y)))\nprint(resultado)\n \t \t\t\t \t \t\t\t\t \t \t \t \t", "c = [int(x) for x in input().split()]\r\nn, m = (int(x) for x in input().split())\r\na = b = 0\r\nfor x in input().split():\r\n\tx = int(x)\r\n\ta += min(x * c[0], c[1])\r\nfor x in input().split():\r\n\tx = int(x)\r\n\tb += min(x * c[0], c[1])\r\nprint(min(c[3], min(c[2], a) + min(c[2], b)))", "I = lambda: map(int, input().split())\r\n\r\nc1, c2, c3, c4 = I()\r\nI()\r\nx = sum(min(a*c1,c2) for a in I())\r\ny = sum(min(b*c1,c2) for b in I())\r\n\r\nprint(min(min(c3,x)+min(c3,y), c4))", "\"\"\"\nhttps://codeforces.com/problemset/problem/355/B\n\"\"\"\n\n\nc1, c2, c3, c4 = [int(x) for x in input().split()]\nn, m = [int(x) for x in input().split()]\nbus = [int(x) for x in input().split()]\ntrolleys = [int(x) for x in input().split()]\ncb, tb = 0, 0\nfor v in bus:\n if c2 < v * c1:\n cb += c2\n else:\n cb += v * c1\nfor v in trolleys:\n if c2 < v * c1:\n tb += c2\n else:\n tb += v * c1\n\nprice = min(c4, cb + tb, cb + c3, c3 + tb, c3 + c3)\nprint(price)\n", "c1,c2,c3,c4 = map(int ,input().split())\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\nans = c4\r\nans1 = c3\r\nans2 = c3\r\ns1 = sum(a)\r\ns2 = sum(b)\r\nk = 0\r\nfor i in range(n):\r\n k+=min(c2,a[i]*c1)\r\nans1 = min(ans1,k)\r\nk = 0\r\nfor i in range(m):\r\n k+=min(c2,b[i]*c1)\r\nans2 = min(ans2,k)\r\nprint(min(ans1 + ans2,ans))\r\n", "a,b,c,d = map(int, input().split())\r\nn, m = map(int, input().split())\r\nt = list(map(int, input().split()))\r\nh = list(map(int, input().split()))\r\nv = []\r\nw = []\r\nfor i in t:\r\n v.append(min(a*i, b))\r\nfor i in h:\r\n w.append(min(a*i,b))\r\nt = min(c,sum(v))\r\nh = min(c,sum(w))\r\nprint(min(d,t+h))", "c1, c2 ,c3 ,c4 = input().split()\r\nc1, c2, c3, c4 = int(c1), int(c2), int(c3), int(c4)\r\n\r\nsizebus, sizetra = input().split()\r\nsizebus, sizetra = int(sizebus), int(sizetra)\r\n\r\narrbus = input().split()\r\narrbus = [int(x) for x in arrbus]\r\n\r\narrtra = input().split()\r\narrtra = [int(x) for x in arrtra]\r\n\r\nsoma = 0\r\nsomabus = 0\r\nsomatra = 0\r\n\r\nfor i in range(sizebus):\r\n somabus += arrbus[i] * c1\r\n if(arrbus[i] * c1 < c2):\r\n continue\r\n else:\r\n somabus -= arrbus[i] * c1\r\n somabus += c2\r\n \r\nsomabus = min(somabus, c3)\r\n'''\r\n1 3 7 19\r\n2 3\r\n2 5\r\n4 4 4\r\n\r\n4 3 2 1\r\n1 3\r\n798\r\n1 2 3\r\n\r\n100 100 8 100\r\n3 5\r\n7 94 12\r\n100 1 47 0 42\r\n\r\n'''\r\nfor i in range(sizetra):\r\n somatra += arrtra[i] * c1\r\n if(arrtra[i] * c1 < c2):\r\n continue\r\n else:\r\n somatra -= arrtra[i] * c1\r\n somatra += c2\r\n \r\nsomatra = min(somatra, c3)\r\n \r\nsoma = min(c4, somabus + somatra)\r\n\r\nprint(soma)", "c = [int(x) for x in input().split()]\r\nn, m = map(int, input().split())\r\na, b = 0, 0\r\nfor i in list(map(int, input().split())):\r\n\ta += min(i * c[0], c[1])\r\nfor i in list(map(int, input().split())):\r\n\tb += min(i * c[0], c[1])\r\nprint(min(c[3], min(c[2], a) + min(c[2], b)))\r\n", "import sys\r\n\r\n# input\r\nline_id = 0\r\nfor line in sys.stdin:\r\n line_id = line_id + 1\r\n line_data = line.split()\r\n\r\n if line_id <= 2:\r\n if line_id == 1:\r\n c1 = int(line_data[0])\r\n c2 = int(line_data[1])\r\n c3 = int(line_data[2])\r\n c4 = int(line_data[3])\r\n else:\r\n cnt_bus = int(line_data[0])\r\n cnt_tro = int(line_data[1])\r\n else:\r\n if line_id == 3:\r\n cnt_bus_took = [0]\r\n for data_str in line_data:\r\n cnt_bus_took.append(int(data_str))\r\n else:\r\n cnt_tro_took = [0]\r\n for data_str in line_data:\r\n cnt_tro_took.append(int(data_str))\r\n\r\n# calc min cost for bus\r\ncost_bus = 0\r\nfor bus_id in range(cnt_bus + 1):\r\n cost_bus = cost_bus + min(c1 * cnt_bus_took[bus_id], c2)\r\ncost_bus = min(c3, cost_bus)\r\n\r\n# calc min cost for tro\r\ncost_tro = 0\r\nfor tro_id in range(cnt_tro + 1):\r\n cost_tro = cost_tro + min(c1 * cnt_tro_took[tro_id], c2)\r\ncost_tro = min(c3, cost_tro)\r\n\r\n# calc min cost for all (bus and tro)\r\ncost_all = min(c4, cost_bus + cost_tro)\r\nprint(cost_all)\r\n", "c1,c2,c3 ,c4 = map(int,input().split())\r\nn , m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nans1 = 0\r\nans2 = 0\r\nfor i in a:\r\n ans1 += min(c1 * i,c2)\r\nans1 = min(ans1, c3)\r\nfor i in b:\r\n ans2 += min(c1 * i,c2)\r\nans2 = min(ans2, c3)\r\nans = min(ans1 + ans2, c4)\r\nprint(ans)", "#Read\nticket_one,ticket_two,ticket_three,ticket_four = [int(x) for x in input().split()]\nbuses, trolleys = [int(x) for x in input().split()]\nbus = [int(x) for x in input().split()]\ntrolley = [int(x) for x in input().split()]\n\n#Variables\nminimum_bus_cost = 0\nminimum_trolley_cost = 0\n\n#Buses\nfor b in bus:\n\tcost_ticket_one = b*ticket_one\n\tminimum_bus_cost += min(cost_ticket_one,ticket_two)\n\nminimum_bus_cost = min(minimum_bus_cost,ticket_three)\n\n#Trolleys\nfor t in trolley:\n\tcost_ticket_one = t*ticket_one\n\tminimum_trolley_cost += min(cost_ticket_one,ticket_two)\n\nminimum_trolley_cost = min(minimum_trolley_cost,ticket_three)\n\ntotal = minimum_bus_cost + minimum_trolley_cost\nbest_value = min(total,ticket_four)\nprint (best_value)\n\n\n \t\t \t\t \t\t\t\t\t\t\t\t \t\t \t \t \t \t \t", "t_costs = [int(x) for x in input().split(' ')]\nnum_tp = [int(x) for x in input().split(' ')]\n\nnum_buses = [int(x) for x in input().split(' ')]\nnum_trolleys = [int(x) for x in input().split(' ')]\n\n\ndef calculate_spent(t_costs, num_tp, num_buses, num_trolleys):\n bus = 0\n trolley = 0\n\n for i in num_buses:\n bus += min(t_costs[0] * i, t_costs[1])\n \n bus = min(bus, t_costs[2])\n\n for j in num_trolleys:\n trolley += min(t_costs[0] * j, t_costs[1])\n \n trolley = min(trolley, t_costs[2])\n\n cost = min((bus+trolley), t_costs[3])\n print(cost)\n\n\ncalculate_spent(t_costs, num_tp, num_buses, num_trolleys)", "def fun(arr,c1,c2):\r\n\tans=0\r\n\tfor x in arr:\r\n\t\tans=min(c2,x*c1)+ans\r\n\treturn ans\r\nc1,c2,c3,c4=map(int,input().split())\r\nn,m=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\nf=min(fun(b,c1,c2),c3)\r\ng=min(fun(t,c1,c2),c3)\r\nh=min(c4,(f+g))\r\nprint(h)", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\ndef min_val_for_a_transport(arr, c1, c2):\r\n sumValue = 0\r\n for i in arr:\r\n sumValue += min(c1*i, c2)\r\n return sumValue\r\n \r\nc1, c2, c3, c4 = get_ints()\r\nn, m = get_ints()\r\nbusses = get_list()\r\ntrolleys = get_list()\r\n\r\nmin_val_busses = min(c3, min_val_for_a_transport(busses, c1, c2))\r\nmin_val_trolleys = min(c3, min_val_for_a_transport(trolleys, c1, c2))\r\n\r\nprint(min(c4, min_val_busses + min_val_trolleys))\r\n\r\n", "def main():\n c1, c2, c3, c4 = map(int, input().split())\n input()\n aa = list(map(int, input().split()))\n bb = list(map(int, input().split()))\n t = c2 // c1\n c5, c6 = (sum(c1 * x if x <= t else c2 for x in l) for l in (aa, bb))\n print(min(c3 * 2, c3 + c5, c3 + c6, c5 + c6, c4))\n\n\nif __name__ == '__main__':\n main()\n" ]

[ "n = int(input())\r\na = list()\r\nx1, x2 = map(int, input().split())\r\nfor i in range(n):\r\n k, b = map(int, input().split())\r\n y1 = k * x1 + b\r\n y2 = k * x2 + b\r\n a.append((y1, y2))\r\na.sort()\r\nfl = 'NO'\r\ny1m = a[0][0]\r\ny2m = a[0][1]\r\nfor y1, y2 in a:\r\n if y2 < y2m:\r\n fl = 'YES'\r\n else:\r\n y2m = max(y2m, y2)\r\nprint(fl)\r\n \r\n \r\n ", "n = int(input())\npoints = []\nflag = False\nx1, x2 = map(int, input().split())\nfor i in range(n):\n a, b = map(int, input().split())\n points.append((a, b))\n\n\np = []\n\nfor i in range(n):\n p.append((points[i][0] * x1 + points[i][1], points[i][0] * x2 + points[i][1]))\n\np.sort()\nfor i in range(n - 1):\n if p[i][0] != p[i + 1][0]:\n if p[i][1] > p[i + 1][1]:\n flag = True\nif flag:\n print('YES')\nelse:\n print('NO')", "\r\nn = int(input())\r\nb = [0 for i in range(n)]\r\nk = [0 for i in range(n)]\r\nx1, x2 = (int(x) for x in input().split())\r\nfor i in range(n):\r\n k[i], b[i] = (int(x) for x in input().split())\r\n\r\ny1 = [ x1 * k[i] + b[i] for i in range(n)]\r\ny2 = [ x2 * k[i] + b[i] for i in range(n)]\r\n\r\ny3 = [ (y1[i], y2[i], i) for i in range(n)]\r\ny3.sort()\r\nr1 = [0 for i in range(n)]\r\nfor i in range(n):\r\n r1[y3[i][-1]] = i\r\n\r\ny4 = [ (y2[i], r1[i], i) for i in range(n)]\r\ny4.sort()\r\nr2 = [0 for i in range(n)]\r\nfor i in range(n):\r\n r2[y4[i][-1]] = i\r\n\r\nans = 0\r\nfor i in range(n):\r\n if r1[i] < r2[i]:\r\n ans = 1\r\n break\r\n#print(y1)\r\n#print(y2)\r\n#print(y3)\r\n#print(y4)\r\n#print(r1)\r\n#print(r2)\r\n\r\nif ans:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "from collections import defaultdict\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nx1, x2 = map(int, input().split())\r\nd = defaultdict(lambda : [])\r\nfor _ in range(n):\r\n k, b = map(int, input().split())\r\n u, v = k * x1 + b, k * x2 + b\r\n d[u].append(v)\r\nans = \"NO\"\r\ninf = pow(10, 15) + 1\r\nla = -inf\r\nfor u in sorted(d.keys()):\r\n for v in sorted(d[u]):\r\n if not la <= v:\r\n ans = \"YES\"\r\n break\r\n la = v\r\n if ans == \"YES\":\r\n break\r\nprint(ans)", "n = int(input())\nx1, x2 = map(int,input().split())\ns = []\n\nfor _ in range(n):\n m, b = map(int,input().split())\n s.append([x1*m+b, x2*m+b])\n \ns.sort()\n \nfor i in range(1,n):\n if s[i-1][1]>s[i][1]: \n print('YES')\n exit()\nprint('NO')\n\t\t\t \t\t\t \t\t \t\t\t\t\t \t\t\t \t\t", "n = int(input())\n\nx1,x2 = map(float,input().split())\n\narr = []\n\nfor i in range(n):\n p,q = map(float,input().split())\n r1 = p * x1 + q\n r2 = p * x2 + q\n arr.append((r1,r2))\n\narr = sorted(arr)\n\nflag = False\n\nfor i in range(n-1):\n if arr[i][0] < arr[i+1][0] and arr[i][1] > arr[i+1][1]:\n flag = True\n break\n\nif flag:\n print('YES')\nelse:\n print('NO')\n", "def cross(l1, l2, x2):\n return l2[0] * x2 + l2[1] < l1[0] * x2 + l1[1]\n\n\nif __name__ == '__main__':\n n = int(input())\n x1, x2 = map(int, input().split())\n data = [tuple(map(int, input().split())) for i in range(n)]\n\n data = list(sorted(data, key=lambda x: (x[0] * x1 + x[1], x[0] * x2 + x[1])))\n for i in range(len(data) - 1):\n if cross(data[i], data[i + 1], x2):\n print('YES')\n exit(0)\n\n print('NO')\n", "n = int(input())\r\nx1, x2 = map(int, input().split())\r\nres = [0] * n\r\nfor i in range(n):\r\n k, b = map(int, input().split())\r\n res[i] = [k * x1 + b, k * x2 + b]\r\nres.sort()\r\nfor i in range(n):\r\n res[i][0], res[i][1] = res[i][1], res[i][0]\r\nst = -1\r\nfor i in range(n):\r\n if i + 1 != n and res[i] == res[i+1] and st == -1:\r\n st = i\r\n if st != -1 and res[i] != res[i-1]:\r\n res[st:i].sort()\r\n st = -1\r\nfor i in range(1, n):\r\n if res[i][0] < res[i-1][0]:\r\n print('yes')\r\n break\r\nelse:\r\n print('no')\r\n", "def equation(k, x, b):\r\n return k * x + b\r\n \r\nnum = int(input())\r\nans = []\r\nx1, x2 = map(int, input().split())\r\n\r\nfor i in range(0,num):\r\n k, b = map(int, input().split())\r\n ans.append((equation(k, x1, b), equation(k, x2, b)))\r\n \r\nans.sort() \r\n\r\nfor i in range(1, num):\r\n if (ans[i][0] > ans[i - 1][0] and ans[i][1] < ans[i - 1][1]) or (ans[i - 1][0] < ans[i][0] and ans[i - 1][1] > ans[i][1]):\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "n=int(input())\r\nx1,x2=map(int,input().split(\" \"))\r\n\r\nliste=[]\r\nfor test in range(n):\r\n k,b=map(int,input().split(\" \"))\r\n liste.append((k*x1+b,k*x2+b))\r\nliste.sort()\r\n\r\n\r\nflag=0\r\ni=1\r\nwhile i<n:\r\n if liste[i][1]<liste[i-1][1]:\r\n flag=1\r\n break\r\n\r\n i+=1\r\n\r\nprint(['NO','YES'][flag])", "k = []\r\n\r\nx = int(input())\r\nc, d = map(int, input().split(' '))\r\nfor i in range(x):\r\n a, b = map(int, input().split(' '))\r\n k.append([c*a+b, d*a+b])\r\n\r\nk.sort()\r\nfor i in range(len(k)-1):\r\n if k[i+1][1] < k[i][1]:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")\r\n", "import sys\nimport time\nimport math\nfrom collections import defaultdict\nfrom functools import lru_cache\n\nINF = 10 ** 18 + 3\nEPS = 1e-10\nMAX_CACHE = 10 ** 9\n\n\n# Decorators\ndef time_it(function, output=sys.stderr):\n def wrapped(*args, **kwargs):\n start = time.time()\n res = function(*args, **kwargs)\n elapsed_time = time.time() - start\n print('\"%s\" took %f ms' % (function.__name__, elapsed_time * 1000),\n file=output)\n return res\n\n return wrapped\n\n\n@time_it\ndef main():\n n = int(input())\n x1, x2 = map(int, input().split())\n funcs = []\n for _ in range(n):\n k, b = map(int, input().split())\n funcs.append(lambda x, k=k, b=b: k * x + b)\n\n comp = lambda x: lambda i: funcs[i](x)\n sorted1 = sorted(range(n), key=comp(x1 + EPS))\n sorted2 = sorted(range(n), key=comp(x2 - EPS))\n print(\"Yes\" if sorted1 != sorted2 else \"No\")\n\n\ndef set_input(file):\n global input\n input = lambda: file.readline().strip()\n\n\ndef set_output(file):\n global print\n local_print = print\n\n def print(*args, **kwargs):\n kwargs[\"file\"] = kwargs.get(\"file\", file)\n return local_print(*args, **kwargs)\n\n\nif __name__ == '__main__':\n set_input(open(\"input.txt\", \"r\") if \"MINE\" in sys.argv else sys.stdin)\n set_output(sys.stdout)\n main()\n", "\ndef solve(n, x1, x2, kb):\n kb.sort(key=lambda p: (p[0]*x1+p[1], p[0]*x2+p[1])) # tri par valeurs de y en x=x1 et x=x2\n lasty2 = None\n for k,b in kb:\n y2 = k*x2+b\n if lasty2 is not None and y2<lasty2: return True \n lasty2 = y2\n return False\n\nn = int(input())\nx1, x2 = [int(_) for _ in input().split()]\nkb = []\nfor i in range(n):\n kb.append(tuple(int(_) for _ in input().split()))\nprint(\"Yes\" if solve(n, x1, x2, kb) else \"No\")\n \n", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nx1, x2 = map(int, input().split())\nleft = []\nright = []\nfor i in range(n):\n k, b = map(int, input().split())\n y1 = k*x1 + b\n y2 = k*x2 + b\n left.append((y1, y2, i))\n right.append((y2, y1, i))\nleft.sort()\nright.sort()\nsame = True\nfor i in range(n):\n if left[i][2] != right[i][2]:\n same = False\n break\nif same:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "n = int(input())\nx1, x2 = map(int, input().split())\nps = [map(int, input().split()) for _ in range(n)]\nys = [0] * n\nfor i, (k, b) in enumerate(ps):\n ys[i] = k * x1 + b, k * x2 + b\nys.sort()\nmax_y = -float('inf')\nok = False\nfor y1, y2 in ys:\n if y2 < max_y:\n ok = True\n break\n max_y = max(max_y, y2)\nprint('YES' if ok else 'NO')\n", "n = int(input())\n\nx1, x2 = map(int, input().split())\n\ny_range = []\n\nfor _ in range(n):\n k, b = map(int, input().split())\n # as x1 < x2\n y_range.append((x1 * k + b, x2 * k + b))\ny_range.sort(key=lambda x: (x[0], x[1]))\n# print(y_range)\nno = True\nfor i in range(n-1):\n if y_range[i][1] > y_range[i+1][1]:\n no = False\n break\nif no:\n print('NO')\nelse:\n print('YES')\n \t\t \t \t \t \t\t\t \t \t\t\t\t \t\t \t\t", "n = int(input())\r\nx1,x2 = map(int,input().split())\r\narr = []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n arr.append([a*x1 + b, a*x2 + b])\r\narr.sort()\r\nx = [i[1] for i in arr]\r\nif(sorted(x) == x):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "from sys import stdin\n\nn = int(stdin.readline())\nx1,x2 = map(int,stdin.readline().split())\nys = []\n\nfor i in range(n):\n m,b = map(int,stdin.readline().split())\n ys.append([x1*m+b,x2*m+b])\n\nys.sort()\n\nintersect = False\nfor i in range(1,n):\n if ys[i-1][1] > ys[i][1]:\n intersect = True\nif intersect:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t \t\t \t \t\t \t \t \t\t \t\t\t", "n=int(input())\r\nx1, x2=[int(k) for k in input().split()]\r\nw=[]\r\neta=[]\r\nfor j in range(n):\r\n w.append([int(k) for k in input().split()])\r\n eta.append([w[-1][0]*x1+w[-1][1], w[-1][0]*x2+w[-1][1]])\r\neta.sort()\r\nlast=[-10**100, -10**100]\r\nrho=[]\r\nfor j in range(1, n):\r\n if eta[j][0]!=eta[j-1][0]:\r\n if eta[j][1]<eta[j-1][1]:\r\n print(\"YES\")\r\n break\r\n else:\r\n rho.append([x for x in eta[j]])\r\n else:\r\n if eta[j][1]>eta[j-1][1]:\r\n rho.append([x for x in eta[j]])\r\n else:\r\n if eta[j][1]<last[1]:\r\n print(\"YES\")\r\n break\r\n if eta[j][0]>last[0]:\r\n last=[x for x in eta[j]]\r\nelse:\r\n print(\"NO\")\r\n ", "def main():\n n = int(input())\n x1, x2 = map(int, input().split())\n res = []\n for _ in range(n):\n k, b = map(int, input().split())\n res.append((k * x1 + b, k * x2 + b))\n res.sort()\n print((\"NO\", \"YES\")[any(y1[1] > y2[1] for y1, y2 in zip(res, res[1:]))])\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\nR = lambda : map(int, input().split())\n\nx1,x2 = R()\nb = []\n\nV = lambda k,x,b : k*x+b\n\nfor _ in range(n):\n ki,bi = R()\n v1 = V(ki,x1,bi)\n v2 = V(ki,x2,bi)\n b.append((v1,v2))\n\nb = sorted(b)\n\nfor i in range(n-1):\n if b[i+1][1] < b[i][1]:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n\n\n\n", "n = int(input())\r\na = input().split(\" \")\r\nx1 = int(a[0])\r\nx2 = int(a[1])\r\ncoor1 = []\r\ncoor2 = []\r\neps = 0.000000001\r\nfor i in range(n):\r\n a = input().split(\" \")\r\n k = int(a[0])\r\n b = int(a[1])\r\n coor1.append((k*(x1+eps) + b, i))\r\n coor2.append((k*(x2-eps) + b, i))\r\n#print(coor1)\r\n#print(coor2)\r\ncoor1.sort()\r\ncoor2.sort()\r\n#print(coor1)\r\n#print(coor2)\r\ns = \"NO\"\r\nfor i in range(len(coor1)):\r\n if (coor1[i][1] != coor2[i][1]):\r\n s = \"YES\"\r\nprint(s)\r\n \r\n", "ada=False\nn=input()\napapun=input().split()\nx1=int(apapun[0])\nx2=int(apapun[1])\n\ny=[]\nfor i in range(int(n)):\n\twhatevs=''\n\twhatevs=input().split()\n\ty.append([(int(whatevs[0])*x1+int(whatevs[1])),(int(whatevs[0])*x2+int(whatevs[1]))])\n# sorted(y, key=y[0][0])\ny=sorted(y, key = lambda x: (x[0], x[1]))\n\nfor i in range(1, len(y)):\n\tif(y[i][1]<y[i-1][1]):\n\t\tada=True\n\t\tbreak\n\nif(ada):\n\tprint('YES')\nelse:\n\tprint('NO')", "def rline():\n return [int(i) for i in input().split()]\n\nN = int(input())\nL, R = rline()\nl = [rline() for i in range(N)]\n\natL = []\natR = []\n\nfor i in range(N):\n k, b = l[i]\n atL.append((k*L + b, k, i))\n atR.append((k*R + b, -k, i))\n\natL.sort()\natR.sort()\natL = [i[2] for i in atL]\natR = [i[2] for i in atR]\n\nprint([\"YES\", \"NO\"][atL == atR])\n", "n = int(input())\r\nx1, x2 = map(int, input().split(\" \"))\r\n\r\ndef intercepts(k, b):\r\n y1 = k*x1+b\r\n y2 = k*x2+b\r\n return [y1, y2]\r\n\r\ninter=[]\r\nfor i in range (n):\r\n k, b = map(int, input().split(\" \"))\r\n inter += [intercepts(k, b)]\r\n\r\ninter.sort()\r\nright=[]\r\n\r\nfor i in range (n):\r\n intercept = inter[i]\r\n right += [intercept[1]]\r\n \r\nright2=[]\r\nfor thing in right:\r\n right2+=[thing]\r\nright.sort()\r\n\r\nif right == right2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na, b = map(int, input().split())\r\nd = sorted([(a*i +j, b*i+j) for i, j in [list(map(int, input().split())) for _ in range(n)]])\r\nfor i in range(1, n):\r\n if d[i][0] > d[i - 1][0] and d[i][1] < d[i - 1][1]:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "n = int(input())\nx1, x2 = [ int(i) for i in input().split() ] # : |\n\nfuncs = []\n\nm = 0\n\nL = []\nR = []\n\nfor i in range(n):\n\tk = input()\n\tb = int(k.split()[1])\n\tk = int(k.split()[0])\n\n\tL.append((k * x1 + b, k, i))\n\tR.append((k * x2 + b, -k, i))\n\nL.sort()\nR.sort()\n\nL = [i[2] for i in L]\nR = [i[2] for i in R]\n\nprint(['YES', 'NO'][L == R])\n", "import sys\r\nimport collections\r\nimport math\r\n\r\nif __name__ == \"__main__\" :\r\n points = []\r\n n = int(sys.stdin.readline())\r\n [x1, x2] = [int(i) for i in sys.stdin.readline().split()]\r\n for x in range(n):\r\n [k, b] = [int(i) for i in sys.stdin.readline().split()]\r\n points.append((k * x1 + b, k * x2 + b))\r\n\r\n points.sort(key = lambda x: (x[0], x[1]))\r\n flag = False\r\n for i in range(1, n):\r\n if points[i-1][1] > points[i][1]:\r\n flag = True\r\n break\r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "l=[]\r\nn=int(input())\r\nx1,x2=list(map(int,input().split()))\r\nfor _ in range(n):\r\n m,c=list(map(int,input().split()))\r\n l.append([m*x1+c,m*x2+c])\r\nl=sorted(l)\r\nfor i in range(1,len(l)):\r\n if l[i][1]<l[i-1][1]:\r\n print(\"yes\")\r\n exit(0)\r\nprint(\"No\")\r\n \r\n", "n=int(input())\r\nx1,x2 = map(int,input().split())\r\ns=[]\r\nfor _ in range(n):\r\n m,b = map(int,input().split())\r\n s.append([x1*m+b,x2*m+b])\r\n \r\ns.sort()\r\n\r\nfor i in range(1,n):\r\n if s[i-1][1]>s[i][1]: \r\n print('YES')\r\n exit()\r\nprint('NO')\r\n \t\t\t", "import sys\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\ndef solve(x1, x2, lines):\n def f1(t):\n k, b = t\n return k*x1 + b, k\n\n def f2(t):\n k, b = t\n return k*x2 + b, -k\n\n lines.sort(key=f1)\n lines2 = sorted(lines, key=f2)\n return lines == lines2\n\n\ndef pl(line):\n k, b = map(int, line.split())\n return k, b\n\n\ndef main():\n n = int(input())\n x1, x2 = map(int, input().split())\n lines = [pl(input()) for _ in range(n)]\n print('NO' if solve(x1, x2, lines) else 'YES')\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(test):\n i, o = test\n with patchio(i) as r:\n main()\n if r.getvalue() == o:\n print(\"OK\\n\")\n else:\n print(f\"Expected:\\n{o}Got:\\n{r.getvalue()}\")\n\ndef test():\n for i, t in enumerate(tests):\n print(f\"TEST {i}\")\n do_test(t)\n\ntests = [\n(\"\"\"\\\n4\n1 2\n1 2\n1 0\n0 1\n0 2\n\"\"\",\"\"\"\\\nNO\n\"\"\"),\n(\"\"\"\\\n2\n1 3\n1 0\n-1 3\n\"\"\", \"\"\"\\\nYES\n\"\"\"),\n(\"\"\"\\\n2\n1 3\n1 0\n0 2\"\"\", \"\"\"\\\nYES\n\"\"\"),\n(\"\"\"\\\n2\n1 3\n1 0\n0 3\n\"\"\", \"\"\"\\\nNO\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', action='store_true')\n args = parser.parse_args()\n test() if args.test else main()\n", "n = int(input())\r\nx1, x2 = map(int, input().split())\r\nx1 += 10**-8\r\nx2 -= 10**-8\r\nlines = []\r\nfor i in range(n):\r\n lines.append(list(map(int, input().split())))\r\n\r\nord_left = []\r\nord_right = []\r\nfor i in range(n):\r\n ord_left.append(lines[i][0] * x1 + lines[i][1])\r\n ord_right.append(lines[i][0] * x2 + lines[i][1])\r\n\r\n\r\nenum_l = list(range(n))\r\nenum_r = list(range(n))\r\nenum_l.sort(key=lambda ord: ord_left[ord])\r\nenum_r.sort(key=lambda ord: ord_right[ord])\r\n\r\n\r\n\r\nif enum_l == enum_r:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n# for i in range(len(ord_right)):\r\n# line = ord_left[i][0]\r\n", "import sys\r\ninput=sys.stdin.buffer.readline\r\nn=int(input())\r\nl,r=map(int,input().split())\r\nly=[];ry=[]\r\nfor i in range(n):\r\n k,m=map(int,input().split())\r\n ly.append([k*(l+10**(-8))+m,i])\r\n ry.append([k*(r-10**(-8))+m,i])\r\nly.sort(key=lambda x:(x[0],x[1]))\r\nry.sort(key=lambda x:(x[0],x[1]))\r\nfor i in range(n):\r\n if ly[i][1]!=ry[i][1]:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n = int(input()) \nx1, x2 = map(int, input().split())\n\nlista = []\nfor i in range(n):\n ki,bi = map(int, input().split())\n result = (ki*x1+bi, ki*x2+bi)\n lista.append(result)\n\nnew_lista = sorted(lista)\n\ndef func(value):\n if value:\n if value > 0:\n return 1\n else:\n return -1\n return value\n \nfor i in range(1,len(new_lista)):\n if((func(new_lista[i][0]-new_lista[i-1][0])) * func(new_lista[i][1]-new_lista[i-1][1])) < 0:\n print('YES')\n exit()\nprint('NO')\n\t\t \t\t \t\t \t\t\t \t \t \t \t\t", "from sys import stdin\r\ndef entryPoint(m,c):\r\n global x1\r\n return m*x1 + c\r\nsize,lines = int(input()),[]\r\nx1,x2 = map(int,input().split())\r\nfor l in stdin.readlines():\r\n m,c = map(int,l.split())\r\n lines.append((entryPoint(m,c),m,c))\r\nlines.sort()\r\nfor x in range(size-1):\r\n # the gradients should not be the same\r\n if lines[x][1] != lines[x+1][1]:\r\n intersection = (lines[x+1][2]-lines[x][2])/(lines[x][1]-lines[x+1][1])\r\n if intersection > x1 and intersection < x2:\r\n print('YES');exit()\r\nprint('NO')", "n = int(input())\r\nx1, x2 = map(int, input().split())\r\nleft = [[0, 0, 0]] * n\r\nright = [[0, 0, 0]] * n\r\nfor i in range(n):\r\n k, b = map(int, input().split())\r\n left[i] = [k * x1 + b, k, i]\r\n right[i] = [k * x2 + b, -k, i]\r\nleft.sort()\r\nright.sort()\r\nans = \"No\"\r\nfor i in range(n):\r\n if left[i][2] != right[i][2]:\r\n ans = \"Yes\"\r\nprint(ans)\r\n", "# n = int(input())\r\n# s = input().strip()\r\n# a = [int(tmp) for tmp in input().split()]\r\nimport sys\r\n\r\nn = int(input())\r\nx1, x2 = [int(tmp) for tmp in input().split()]\r\nk = []\r\nb = []\r\nkek = 0\r\nlel = 0\r\nfor i in range(n):\r\n tmpk, tmpb = [int(tmp) for tmp in input().split()]\r\n k.append(tmpk)\r\n b.append(tmpb)\r\nup = [[0] * 3 for i in range(n)]\r\ndown = [[0] * 3 for i in range(n)]\r\nfor i in range(n):\r\n up[i][0] = k[i] * x1 + b[i]\r\n up[i][1] = k[i] * x2 + b[i]\r\n up[i][2] = i\r\n down[i][0] = k[i] * x2 + b[i]\r\n down[i][1] = k[i] * x1 + b[i]\r\n down[i][2] = i\r\nup.sort()\r\ndown.sort()\r\nfor i in range(n):\r\n if up[i][2] != down[i][2]:\r\n print('yes')\r\n sys.exit()\r\nprint('no')", "n=int(input())\r\ndone=False\r\na,b=map(int,input().split())\r\na+=1/4000000\r\nb-=1/4000000\r\nlol=[]\r\nwow=[]\r\nfor i in range(n):\r\n k,c=map(int,input().split())\r\n lol.append([k*a+c,i])\r\n wow.append([k*b+c,i])\r\nwow.sort()\r\nlol.sort()\r\nfor i in range(n):\r\n if lol[i][1]!=wow[i][1]:\r\n print('YES')\r\n done=True\r\n break\r\nif not done:\r\n print('NO')", "import sys\ndef main():\n\tn = int(input())\n\tx1, x2 = map(int, input().split())\n\ts = []\n\tfor _ in range(n):\n\t\tk, b = map(int, sys.stdin.readline().split())\n\t\ts += [[k*x1+b, k*x2+b]]\n\ts.sort()\n\tfor i in range(1,n):\n\t\tif s[i][1] < s[i-1][1]:\n\t\t\tprint(\"YES\")\n\t\t\treturn\n\tprint(\"NO\")\nmain()\n", "n=int(input())\r\nl,r=map(int,input().split())\r\ni=0\r\ns=[]\r\nwhile i<n:\r\n\tk,b=map(int,input().split())\r\n\ts.append([l*k+b,r*k+b])\r\n\ti+=1\r\ns.sort()\r\n\r\ny=0\r\ni=1\r\nwhile i<n:\r\n\tif s[i-1][1]>s[i][1]:y=1\r\n\ti+=1\r\nprint([\"NO\",\"YES\"][y])\r\n", "n = int(input())\r\nx1, x2 = map(float, input().split())\r\nx1 += 1e-10\r\nx2 -= 1e-10\r\nlines = [tuple(map(float, input().split())) for _ in range(n)]\r\nl1 = sorted((k * x1 + b, i) for i, (k, b) in enumerate(lines))\r\nl2 = sorted((k * x2 + b, i) for i, (k, b) in enumerate(lines))\r\nif [i for x, i in l1] == [i for x, i in l2]:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "\"\"\"\nCodeforces Round #329 (Div. 2)\n\nProblem 593 B. Anton and Lines\n\n@author yamaton\n@date 2015-11-04\n\"\"\"\n\nimport itertools as it\nimport functools\nimport operator\nimport collections\nimport math\nimport sys\n\n\nEPSILON = 0.0000001\n\ndef solve(x1, x2, kbs):\n at_x1 = [k*(x1 + EPSILON) + b for (k, b) in kbs]\n at_x2 = [k*(x2 - EPSILON) + b for (k, b) in kbs]\n order1 = [i for i, _ in sorted(enumerate(at_x1), key=operator.itemgetter(1))]\n print_stderr('at_x1:', at_x1)\n print_stderr('at_x2:', at_x2)\n return any(at_x2[i] > at_x2[j] for (i, j) in zip(order1, order1[1:]))\n\n\ndef print_stderr(*args, **kwargs):\n print(*args, file=sys.stderr, **kwargs)\n\n\ndef tf_to_yn(tf):\n return 'YES' if tf else 'NO'\n\n\ndef main():\n n = int(input())\n [x1, x2] = [int(i) for i in input().strip().split()]\n kbs = [tuple(int(i) for i in input().strip().split()) for _ in range(n)]\n result = solve(x1, x2, kbs)\n print(tf_to_yn(result))\n\n\nif __name__ == '__main__':\n main()\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef check(li):\r\n cnt = 0\r\n n = len(li)\r\n\r\n a = [0]*n\r\n for i in range(n - 1, -1, -1):\r\n if li[i] == \"h\":\r\n cnt += 1\r\n a[i] = cnt\r\n \r\n ret = 0\r\n for i in range(n):\r\n if li[i] == \"s\":\r\n ret += a[i]\r\n \r\n return ret\r\n\r\n\r\ndef cmp(x):\r\n hs = x.count(\"h\")\r\n ss = len(x) - hs\r\n\r\n return ss / len(x)\r\n\r\n\r\nn = int(input())\r\nli = []\r\n\r\n\r\nfor i in range(n):\r\n a = list(input().strip())\r\n li.append(a)\r\n\r\nli.sort(key=lambda x: -cmp(x))\r\n\r\nret = []\r\nfor x in li:\r\n ret.extend(x)\r\n\r\n\r\nans = check(ret)\r\n\r\nprint(ans)", "import sys \r\ninput = sys.stdin.buffer.readline \r\nimport functools\r\n\r\ndef compare(a, b):\r\n n1, d1 = a \r\n n2, d2= b \r\n if n1*d2 <= n2*d1:\r\n return 1\r\n return -1\r\n \r\ndef process(A):\r\n L = []\r\n answer = 0 \r\n S = 0\r\n H = 0\r\n for ti in A:\r\n total_s =0\r\n total_h = 0 \r\n for c in ti:\r\n if c=='s':\r\n total_s+=1 \r\n else:\r\n total_h+=1 \r\n L.append((total_s, total_h))\r\n S+=total_s \r\n H+=total_h\r\n for c in ti:\r\n if c=='s':\r\n answer+=total_h \r\n else:\r\n total_h-=1 \r\n L = sorted(L, key=functools.cmp_to_key(compare))\r\n for a, b in L:\r\n H-=b \r\n answer+=a*H \r\n S-=a \r\n print(answer)\r\n return \r\n \r\nn = int(input())\r\nA = []\r\nfor i in range(n):\r\n ti = input().decode().strip()\r\n A.append(ti)\r\nprocess(A)", "n = int(input())\r\na = []\r\nallh = 0\r\nfor i in range(n):\r\n x = input()\r\n sz = 0\r\n h = 0\r\n for c in x:\r\n if c == 'h':\r\n h += 1\r\n sz += 1\r\n allh += h\r\n a.append([h/sz, x])\r\n\r\na.sort()\r\nans = 0\r\n#print(allh)\r\nfor score, x in a:\r\n for c in x:\r\n if c == 's':\r\n ans += allh\r\n else:\r\n allh -= 1\r\nprint(ans)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nLOGN = 20\r\nINF = 10 ** 9 + 5\r\nMOD = 10 ** 9 + 7\r\n# ============================ START OF MY CODE ============================\r\nfrom functools import cmp_to_key\r\n\r\ndef solve():\r\n n = int(input())\r\n ts = [input() for _ in range(n)]\r\n A = [(t.count('s'), t.count('h'), i) for i, t in enumerate(ts)]\r\n A.sort(key=lambda a: a[1] / (a[0] + 0.000001))\r\n s = \"\".join(ts[a[2]] for a in A)\r\n ans = curS = 0\r\n for c in s:\r\n if c == 's': curS += 1\r\n else: ans += curS\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "import heapq\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nh = []\r\ninf = pow(10, 9) + 1\r\nans = 0\r\nfor _ in range(n):\r\n t = list(input().rstrip())\r\n c = [0] * 2\r\n x = 0\r\n for i in t:\r\n c[i & 1] += 1\r\n if not i & 1:\r\n ans += c[1]\r\n if not c[0]:\r\n heapq.heappush(h, (0, c[1], c[0]))\r\n elif not c[1]:\r\n heapq.heappush(h, (inf, c[1], c[0]))\r\n else:\r\n heapq.heappush(h, (c[0] / c[1], c[1], c[0]))\r\nc = 0\r\nwhile h:\r\n _, u, v = heapq.heappop(h)\r\n ans += c * v\r\n c += u\r\nprint(ans)", "import sys\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\nclass STR():\r\n def __init__(self, x, y):\r\n self.s = x\r\n self.h = y\r\n\r\n def __gt__(self, other):\r\n ss, sh = self.s, self.h\r\n os, oh = other.s, other.h\r\n return oh*ss <= os*sh\r\n\r\n\r\nn = int(input())\r\nans = 0\r\nque = []\r\nfor i in range(n):\r\n S = list(input())\r\n L = len(S)\r\n ccnt = 0\r\n hcnt = 0\r\n for j in range(L - 1, -1, -1):\r\n if S[j] == \"h\":\r\n hcnt += 1\r\n else:\r\n ccnt += 1\r\n ans += hcnt\r\n que.append(STR(ccnt, hcnt))\r\nque.sort(reverse=True)\r\nccnt, hcnt = 0, 0\r\nfor v in que:\r\n nows, nowh = v.s, v.h\r\n ans += nows*hcnt\r\n hcnt += nowh\r\nprint(ans)\r\n", "import functools\r\nli=[]\r\ndef cmp(a,b):\r\n if (a.count('s')/len(a))<(b.count('s')/len(b)) :\r\n return 1\r\n else:\r\n return -1\r\nfor _ in range(int(input())):\r\n s = input()\r\n li.append(s)\r\nli = sorted(li,key = functools.cmp_to_key(cmp))\r\nli = ''.join(li)\r\nc=ans=0\r\nfor i in li:\r\n if i=='s':\r\n c+=1\r\n else:\r\n ans+=c\r\nprint(ans) ", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef my_sort(a,b):\r\n t1 = a[0]*b[1]\r\n t2 = b[0]*a[1]\r\n if t1>t2:\r\n return 1\r\n elif t1<t2:\r\n return -1\r\n return 0\r\n \r\n\r\nfrom functools import cmp_to_key\r\nN = int(input())\r\nS = []\r\nB = []\r\nfor _ in range(N):\r\n S.append(input())\r\n B.append((S[-1].count('s'), S[-1].count('h'),S[-1]))\r\n\r\nA = sorted(B,key=cmp_to_key(my_sort), reverse=True)\r\n#print(A)\r\n\r\nans = 0\r\ncs=0\r\nfor a,b,s in A:\r\n for c in s:\r\n if c=='s':\r\n cs+=1\r\n else:\r\n ans+=cs\r\nprint(ans)", "n=int(input())\r\nans=0\r\ndata=[ input() for i in range(n)]\r\nfor s in data:\r\n cnt=0\r\n for c in s:\r\n if c=='s':cnt+=1\r\n else:ans+=cnt\r\n\r\n\r\na=list(map(lambda x:(x.count('s'),x.count('h')),data))\r\nb=[]\r\ncnt=0\r\nfor x in a:\r\n if x[1]==0:\r\n cnt+=x[0]\r\n else:b.append(x)\r\n\r\na=b\r\na.sort(key=lambda x:-x[0]/x[1])\r\n\r\nfor x in a:\r\n ans+=cnt*x[1]\r\n cnt+=x[0]\r\n\r\nprint(ans)", "\n\"\"\"\nhttps://codeforces.com/contest/922/problem/D\n\"\"\"\nimport sys\nfrom functools import cmp_to_key\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\nprintf = lambda d: sys.stdout.write(str(d) + \"\\n\")\n\nn = int(input())\nl = []\nfor i in range(n):\n l.append(input())\n\n\ndef cnt(c1):\n cnt = 0\n ans = 0\n for c in c1:\n if c == \"s\":\n cnt += 1\n else:\n ans += cnt\n return ans\n\n\ndef cmp(a, b): # TODO 需要深刻理解 比较函数\n # print(a, b, cnt(a+b), cnt(b+a))\n if cnt(a+b) > cnt(b+a): # 越大的方法，越靠前，返回-1\n return -1\n else:\n return 1\n\n\nl.sort(key=cmp_to_key(cmp))\nprint(cnt(\"\".join(l)))\n\n\"\"\"\n4\nssh\nhs\ns\nhhhs\n\n\"\"\"", "n=int(input())\na=[]\nfor i in range(n):\n b=input()\n a.append([b.count(\"h\")/len(b),b])\na.sort()\nb=\"\"\nfor i in range(n):\n b=b+a[i][1]\nc=0\ns=0\nfor i in range(len(b)):\n if b[i]==\"s\":\n c=c+1\n if b[i]==\"h\":\n s=s+c\nprint(s)\n \t \t \t \t \t\t \t\t \t\t\t\t \t \t\t\t", "from typing import List\r\nfrom collections import deque, Counter\r\nfrom bisect import *\r\nimport heapq\r\nfrom functools import cmp_to_key\r\n\r\n\r\ndef main():\r\n n, arr = int(input()), []\r\n ans = 0\r\n for _ in range(n):\r\n s, val = input(), 0\r\n for it in s:\r\n if it == \"s\":\r\n val += 1\r\n else:\r\n ans += val\r\n tmp = Counter(s)\r\n arr.append((tmp[\"s\"], tmp[\"h\"]))\r\n arr = sorted(\r\n arr, key=cmp_to_key(lambda x, y: -1 if x[0] * y[1] > x[1] * y[0] else 1)\r\n )\r\n pre = 0\r\n for x, y in arr:\r\n ans += y * pre\r\n pre += x\r\n print(ans)\r\n\r\n\r\nmain()", "n = int(input())\r\nscripts = []\r\ntotal = 0\r\nfor _ in range(n):\r\n x = input()\r\n i = 0\r\n for y in x:\r\n if y == \"h\":\r\n i += 1\r\n scripts.append( [i/len(x),x] )\r\n total += i\r\n\r\nscripts.sort()\r\n\r\nconcat = \"\"\r\nfor x in scripts:\r\n concat += x[1]\r\nloudness = 0\r\nfor a in concat:\r\n if a == \"s\":\r\n loudness += total\r\n else:\r\n total -= 1\r\n\r\nprint(loudness)", "import re\n\nclass Str:\n def __init__(self, str):\n self.str = str\n self.pos = []\n for i in re.finditer('h', self.str):\n self.pos.append(i.regs[0][0])\n def __lt__(self, other):\n return len(other.pos)*len(self.str) > len(self.pos)*len(other.str)\n\nn = int(input())\nstrs = []\n\nfor i in range(n):\n strs.append(Str(input()))\nstrs.sort()\n\nans = 0\ncount = 0\n\nfor str in strs:\n for char in str.str:\n if(char == 's'):\n count = count + 1\n else:\n ans += count\n\nprint(ans)\n\t \t\t\t \t \t \t \t \t\t\t \t\t\t\t", "n = int(input())\r\n\r\nl = []\r\nfor i in range(n):\r\n l.append(input())\r\n\r\nl.sort(key = lambda s: -(s.count(\"s\")/(s.count(\"h\") + 10e-8)))\r\ns = \"\".join(l)\r\n\r\ncount = 0\r\nl = [0] * len(s)\r\n\r\nfor i in range(len(s)):\r\n if(s[i] == \"s\"):\r\n count += 1\r\n l[i] = count\r\n\r\ncount = 0\r\nfor i in range(1, len(s)):\r\n if(s[i] == \"h\"):\r\n count += l[i - 1]\r\n\r\nprint(count)", "n = int(input())\r\nweights = []\r\ntotal_s = 0\r\ntotal_h = 0\r\nfor i in range(n):\r\n string = input()\r\n length = len(string)\r\n s_num = 0\r\n total_s += string.count('s')\r\n total_h += string.count('h')\r\n for char in string:\r\n if char == \"s\":\r\n s_num += 1\r\n weights.append([s_num/length, string])\r\n\r\nweights.sort(reverse=True)\r\n\r\nfinalanswer = 0\r\nfor list in weights:\r\n for char in list[1]:\r\n if char == 's':\r\n finalanswer += total_h\r\n total_s -= 1\r\n elif char == \"h\":\r\n total_h -= 1\r\n\r\nprint(finalanswer)", "from functools import cmp_to_key\r\ndef cmp(a, b):\r\n n, m = a + b, b + a\r\n s = 0\r\n ans1 = 0\r\n ans2 = 0\r\n for i in range(len(n)):\r\n if(n[i] == \"s\"):\r\n s += 1\r\n else:\r\n ans1 += s\r\n s = 0\r\n for i in range(len(m)):\r\n if(m[i] == \"s\"):\r\n s += 1\r\n else:\r\n ans2 += s\r\n if(ans1 > ans2):\r\n return -1\r\n else:\r\n return 1\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(input())\r\narr.sort(key = cmp_to_key(cmp))\r\ns = 0\r\nans = 0\r\nfor i in arr:\r\n for j in i:\r\n if(j == \"s\"):\r\n s += 1\r\n else:\r\n ans += s\r\nprint(ans)" ]

[ "s = input()\r\nalpha = input()\r\nk = int(input())\r\nsubs = sorted(s[i:] for i in range(len(s)))\r\nprev = ''\r\nans = 0\r\nfor j in subs:\r\n uni = False\r\n bad = 0\r\n for i in range(len(j)):\r\n if i >= len(prev) or prev[i] != j[i]:\r\n uni = True\r\n if alpha[ord(j[i])-ord('a')] == '0':\r\n bad += 1\r\n if bad > k:\r\n break\r\n if uni:\r\n ans += 1\r\n prev = j \r\nprint(ans)", "s = input()\r\na = list(map(int, input()))\r\nk = int(input())\r\nn = len(s)\r\nf = lambda x: ord(x) - ord('a')\r\n\r\nsub = sorted(s[i:] for i in range(n))\r\nlast = ''\r\nans = 0\r\n\r\nfor cur in sub:\r\n ct = flag = 0\r\n for i, x in enumerate(cur):\r\n ct += 1 - a[f(x)]\r\n if ct > k: break\r\n flag |= i >= len(last) or cur[i] != last[i]\r\n ans += flag\r\n last = cur\r\n\r\nprint(ans)", "# import random\r\nimport sys\r\n\r\n# import itertools\r\n# import math\r\n# import os\r\n# from bisect import bisect, bisect_left\r\n# from collections import *\r\n# from functools import reduce\r\n# from heapq import heapify, heappop, heappush\r\n# from io import BytesIO, IOBase\r\n# from string import *\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\n# endregion fastio\r\n\r\n# # region interactive\r\n# def printQry(a, b) -> None:\r\n# sa = str(a)\r\n# sb = str(b)\r\n# print(f\"? {sa} {sb}\", flush = True)\r\n\r\n# def printAns(ans) -> None:\r\n# s = str(ans)\r\n# print(f\"! {s}\", flush = True)\r\n# # endregion interactive\r\n\r\n# # region dfsconvert\r\n# from types import GeneratorType\r\n# def bootstrap(f, stack=[]):\r\n# def wrappedfunc(*args, **kwargs):\r\n# if stack:\r\n# return f(*args, **kwargs)\r\n# else:\r\n# to = f(*args, **kwargs)\r\n# while True:\r\n# if type(to) is GeneratorType:\r\n# stack.append(to)\r\n# to = next(to)\r\n# else:\r\n# stack.pop()\r\n# if not stack:\r\n# break\r\n# to = stack[-1].send(to)\r\n# return to\r\n# return wrappedfunc\r\n# # endregion dfsconvert\r\n\r\n'''\r\n# Rabin-Karp rolling hash\r\n# 1028 ms\r\nMOD1 = 998244353\r\nMOD2 = 10 ** 9 + 7\r\n\r\ndef solve() -> None:\r\n s = input()\r\n t = list(map(int, list(input())))\r\n k = sint()\r\n ans = set()\r\n b1 = 27\r\n b2 = 13331\r\n for i in range(len(s)):\r\n cnt = 0\r\n hash1 = hash2 = 0\r\n for j in range(i, len(s)):\r\n cnt += t[ord(s[j]) - 97] ^ 1\r\n if cnt > k: break\r\n # hash1 = (hash1 * b + (ord(s[j]) - 96)) % MOD1\r\n # hash2 = (hash2 * b + (ord(s[j]) - 96)) % MOD2\r\n hash1 = (hash1 * b1 + (ord(s[j]) - 96)) % MOD2\r\n hash2 = (hash2 * b2 + (ord(s[j]) - 96)) % MOD2\r\n ans.add((hash1, hash2))\r\n print(len(ans))\r\n'''\r\n\r\n'''\r\n# Trie\r\n# TLE\r\nclass TrieNode:\r\n def __init__(self, val):\r\n self.map = dict()\r\n\r\ndef solve() -> None:\r\n s = input()\r\n t = list(map(int, list(input())))\r\n k = sint()\r\n root = TrieNode(0)\r\n ans = 0\r\n for i in range(len(s)):\r\n cnt = 0\r\n node = root\r\n for j in range(i, len(s)):\r\n c = s[j]\r\n cnt += t[ord(c) - 97] ^ 1\r\n if cnt > k: break\r\n if c not in node.map:\r\n node.map[c] = TrieNode(0)\r\n ans += 1\r\n node = node.map[c]\r\n print(ans)\r\n'''\r\n\r\ndef solve() -> None:\r\n s = input()\r\n t = list(map(int, list(input())))\r\n k = sint()\r\n subs = sorted(s[i:] for i in range(len(s)))\r\n ans = 0\r\n pre = \"\"\r\n for cur in subs:\r\n valid = False\r\n cnt = 0\r\n for i in range(len(cur)):\r\n cnt += t[ord(cur[i]) - 97] ^ 1\r\n if cnt > k: break\r\n if i >= len(pre) or cur[i] != pre[i]:\r\n valid = True\r\n if valid: ans += 1\r\n pre = cur\r\n print(ans)\r\n\r\nsolve()", "t = input()\r\nalpha = input()\r\nx = int(input())\r\nsubs = sorted(t[p:] for p in range(len(t)))\r\nprev = ''\r\nans = 0\r\nfor q in subs:\r\n uni = False\r\n bad = 0\r\n for p in range(len(q)):\r\n if p >= len(prev) or prev[p] != q[p]:\r\n uni = True\r\n if alpha[ord(q[p])-ord('a')] == '0':\r\n bad += 1\r\n if bad > x:\r\n break\r\n if uni:\r\n ans += 1\r\n prev = q \r\nprint(ans)", "s=input()\r\nalpha=input()\r\nk=int(input())\r\nsubs=sorted(s[i:] \r\nfor i in range(len(s)))\r\nprev=''\r\nans=0\r\nfor j in subs:\r\n uni=False\r\n bad=0\r\n for i in range(len(j)):\r\n if(i >= len(prev) or prev[i] != j[i]):\r\n uni=True\r\n if(alpha[ord(j[i])-ord('a')] == '0'):\r\n bad+=1\r\n if(bad > k):\r\n break\r\n if(uni):\r\n ans+=1\r\n prev=j \r\nprint(ans)", "s = input()\r\nalpha = input()\r\nk = int(input())\r\n\r\nSuffix = sorted([s[i:] for i in range(len(s))])\r\n\r\nanswer = 0\r\n\r\nbefore = ''\r\n\r\nfor s in Suffix:\r\n\r\n bad = 0\r\n differ = 0\r\n\r\n for i in range(len(s)):\r\n \r\n if i >= len(before) or before[i] != s[i]:\r\n \r\n differ = 1\r\n\r\n if alpha[ord(s[i]) - ord('a')] == '0':\r\n \r\n bad += 1\r\n\r\n if bad > k:\r\n\r\n break\r\n\r\n else:\r\n \r\n if differ == 1:\r\n\r\n answer += 1 \r\n \r\n before = s\r\n\r\nprint(answer)", "p = input()\r\nal = input()\r\nk = int(input())\r\nsubs = sorted(p[i:] for i in range(len(p)))\r\nprev = ''\r\nan = 0\r\nfor j in subs:\r\n uni = False\r\n b = 0\r\n for i in range(len(j)):\r\n if i >= len(prev) or prev[i] != j[i]:\r\n uni = True\r\n if al[ord(j[i])-ord('a')] == '0':\r\n b += 1\r\n if b > k:\r\n break\r\n if uni:\r\n an += 1\r\n prev = j \r\nprint(an)" ]

[ "from sys import stdin, stdout\r\n\r\nwords = ['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 = stdin.readline().strip()\r\nf = stdin.readline().strip()\r\nans = -1\r\nd = {}\r\n\r\nfor v in s:\r\n if v in d:\r\n d[v] += 1\r\n else:\r\n d[v] = 1\r\n \r\n \r\nfor i in range(min(len(s), len(f))):\r\n if f[i] in d and d[f[i]]:\r\n d[f[i]] -= 1\r\n else:\r\n break\r\n \r\n for v in words:\r\n if v in d and d[v] and (i == len(f) - 1 or v > f[i + 1]):\r\n ans = i\r\n break\r\n\r\nif ans == -1 and max(list(s)) > f[0]:\r\n s = sorted(list(s))\r\n first = ''\r\n \r\n for i in range(len(s)):\r\n if s[i] > f[0]:\r\n first += s[i]\r\n s[i] = '_'\r\n break\r\n \r\n first += ''.join(sorted(list(s))[1:])\r\nelif ans == -1:\r\n first = '-1'\r\nelse:\r\n s = sorted(list(s))\r\n d = {}\r\n first = ''\r\n \r\n for i in range(ans + 1):\r\n first += f[i]\r\n \r\n if f[i] in d:\r\n d[f[i]] += 1\r\n else:\r\n d[f[i]] = 1\r\n \r\n \r\n for i in range(len(s)):\r\n \r\n if s[i] in d and d[s[i]]:\r\n d[s[i]] -= 1\r\n s[i] = '_'\r\n\r\n \r\n for i in range(len(s)):\r\n if s[i] != '_' and (ans + 1 == len(f) or s[i] > f[ans + 1]):\r\n first += s[i]\r\n s[i] = '_'\r\n break\r\n \r\n for i in range(len(s)):\r\n if s[i] != '_':\r\n first += s[i]\r\n\r\nstdout.write(first)" ]

[ "n,a,b=map(int,input().split(' '))\r\nz=(((a+b)%n)+n)%n\r\nif(z==0):\r\n print(n)\r\nelse:\r\n print(z)", "n,a,b=map(int,input().split())\r\na1=a+b-1\r\na2=a1%n+1\r\nprint(a2)", "n,a,b=list(map(int,input().split()))\r\nres = (a+b-1)%n\r\nprint(res+1)\r\n \r\n", "n, a, b = map(int, input().split(\" \"))\n\nout = (a+b)%n\n\nif out == 0:\n print(n)\nelse:\n print(out)\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-21 16:58:20\nLastEditTime: 2021-11-21 17:18:45\nDescription: Round House\nFilePath: CF659A.py\n'''\n\n\ndef func():\n n, a, b = map(int, input().strip().split())\n if b < 0:\n b = n + b % n\n if (a + b) % n == 0:\n print(n)\n else:\n print((a + b) % n)\n\n\nif __name__ == '__main__':\n func()\n ", "def go_to(starts,ends,numbers):\r\n\treturn ((starts%numbers)+(ends%numbers))%numbers\r\n\t\r\nn = input().split()\r\nk = go_to(int(n[1]),int(n[2]),int(n[0]))\r\nif k == 0:\r\n\tprint(int(n[0]))\r\nelse:\r\n\tprint(k)", "n,a,b=map(int,input().split())\r\nans = (a+b)%n\r\nif ans :\r\n print(ans)\r\nelse :\r\n print(n)", "l1 = [int(x) for x in input().split()]\r\nn,a,b = l1[0],l1[1],l1[2]\r\n\r\nfinal = (a+b)%n\r\nif final==0:\r\n print(n)\r\nelse:\r\n print(final)", "n, a, b = map(int, input().split())\r\n\r\nif b < 0:\r\n # Add n to b before taking the modulo\r\n b += n\r\n\r\n# Calculate the final entrance\r\nk = (a + b - 1) % n + 1\r\n\r\nprint(k)\r\n", "n, a, b = map(int, input().split())\r\n\r\nif (a+b % n) % n:\r\n print((a+b % n) % n)\r\nelse:\r\n print(n)\r\n", "n, a, b = map(int, input().split())\r\nresult = (a + b) % n\r\nprint(result if result != 0 else n)", "n,a,b=[int(x) for x in input().split()]\r\nres=a+b+100*n \r\nif res%n==0:\r\n print(n)\r\nelse:\r\n print(res%n)", "s=input()\ninp=s.split(\" \")\nn=int(inp[0])\na=int(inp[1])\nb=int(inp[2])\na+=b\na%=n\nif(a==0):\n\ta=n\nprint(a)\n\n", "n,a,b=map(int,input().split())\r\nd=((a+b%n)%n)\r\nif d==0:\r\n d=n\r\nprint(d)", "n, a, b = map(int, input().split())\r\narr = list(range(1, n+1))*2\r\n# print(arr)\r\nif b < 0:\r\n print()\r\n b = n - b % n\r\n\r\n arr = arr[::-1]\r\n ind = arr.index(a)\r\n ans = arr[arr.index(a)+b]\r\n\r\nelse:\r\n b = b % n\r\n ind = arr.index(a)\r\n ans = arr[arr.index(a)+b]\r\n\r\nprint(ans)\r\n\r\n\r\n", "n, a, b = map(int, input().split())\r\nval = abs(a+b%n) % n if (abs(a+b%n) % n) > 0 else n\r\nprint(val)", "input_list=input().split()\r\nprint(((int(input_list[1])+int(input_list[2]))%int(input_list[0])+int(input_list[0])-1)%int(input_list[0])+1)", "n,a,b = map(int,input().split())\r\n\r\nx = ((a-1+b)%n+n)%n+1\r\nprint(x)", "n, a, b = map(int, input().split())\r\nif (n+a+b)%n == 0: print(n)\r\nelse: print((n+a+b)%n)", "\r\nrow = input().split()\r\n\r\nn = int(row[0])\r\na = int(row[1])\r\nb = int(row[2])\r\n\r\nif b == 0 : print(a)\r\nelif b < 0:\r\n rem = abs(b) % n\r\n if (a - rem) == 0: print(n)\r\n elif (a - rem ) > 0: print(a - rem)\r\n else: print (n - (rem - a))\r\nelse:\r\n rem = b % n\r\n if rem+a > n: print((rem+a) % n)\r\n else: print(rem + a)\r\n", "n, a, b = map(int, input().split())\r\n\r\nif b > 0:\r\n b %= n\r\n res = a + b\r\n\r\n if res > n:\r\n res -= n\r\nelse:\r\n b = abs(b) % n\r\n res = a - b\r\n\r\n if res < 1:\r\n res += n\r\n\r\nprint(res)\r\n", "def main():\n n, a, b = map(int, input().split())\n m = list(range(1, n + 1)) * 120\n print(m[(a - 1) + b])\n \n\n \nif __name__ == '__main__':\n # t = int(input())\n # while t > 0:\n # t -= 1\n # main()\n main()", "x=list(map(int, input().split()))\r\nimport math\r\nn=x[0]\r\na=x[1]\r\nb=x[2]\r\nif abs(b)%n==0:\r\n print(a)\r\nelse:\r\n if b>0:\r\n p=math.floor(abs(b)/n)\r\n q=p*n\r\n q1=b-q\r\n r=a+q1\r\n if r>n:\r\n r=r-n\r\n else:\r\n p=math.floor(abs(b)/n)\r\n q=p*n\r\n q1=abs(b)-q\r\n r1=n-q1\r\n r=a+r1\r\n #print(q1)\r\n if r>n:\r\n r=r-n\r\n print(r)", "\n\nn, a, b = map(int,input().split())\n\nIASBUDFBAS = []\n\nfor i in range(1,n+1):\n IASBUDFBAS.append(i)\n\n\nif b <= 0:\n clockwise = False\nelse:\n clockwise = True\n\naosdbouasdnad = abs(b)\nstart = IASBUDFBAS.index(a)\n\nfor i in range(aosdbouasdnad):\n if clockwise:\n if start == n-1:\n start = 0\n else:\n start += 1\n else:\n if start == 0:\n start = n-1\n else:\n start -= 1\n\nprint(IASBUDFBAS[start])\n\n\t\t\t \t\t \t\t \t\t\t\t\t \t \t\t \t \t", "a,c,b=map(int,input().split())\r\ni=c-1\r\nif b>=0:\r\n ans=(i+b)%a\r\n print(ans+1)\r\nelse:\r\n ans= (i+b)%a\r\n print(ans+1)", "n,a,b = map(int, input().split()); print((a-1+b)%n +1)", "x,y,z=map(int,input().split())\r\nprint((y+z-1)%x+1)", "nab = list(map(int, input().split()))\r\nif (nab[1] + nab[2]) % nab[0] == 0:\r\n\tprint(nab[0])\r\nelse:\r\n\tprint((nab[1] + nab[2]) % nab[0])", "n=input().split()\r\na,b,c=int(n[0]),int(n[1]),int(n[2])\r\nif((b%a+c%a)%a==0):\r\n\tprint(a)\r\nelse:\r\n\tprint((b%a+c%a)%a)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, a, b = map(int, input().split())\r\na -= 1\r\nans = (a + b) % n + 1\r\nprint(ans)", "n,a,b=map(int,input().split())\r\nb=b%n\r\nif b==0:\r\n print(a)\r\nelif b<0:\r\n if (a+b)>=1:\r\n print(a+b)\r\n else:\r\n print(n+a+b)\r\n \r\n \r\nelse:\r\n if (a+b)<=n:\r\n print(a+b)\r\n else:\r\n print(a+b-n)\r\n ", "a,b,c = map(int, input().split())\narr = [int(x) for x in range(1, a+1)]\nb = b-1\nif c<0:\n for i in range(abs(c)):\n if b == 0:\n b = len(arr)-1\n else:\n b = b-1\nelse:\n for i in range(abs(c)):\n if b == len(arr)-1:\n b = 0\n else:\n b = b+1\nprint(arr[b])\n \t\t \t \t\t \t\t\t\t \t \t", "n, a, b = map(int, input().split())\r\nif b >= 0:\r\n while b != 0:\r\n a += 1\r\n b -= 1\r\n if a > n:\r\n a = 1\r\n print(a)\r\nelse:\r\n while b != 0:\r\n a -= 1\r\n b += 1\r\n if a < 1:\r\n a = n\r\n print(a)", "n, m, b = map(int, input().split())\nwhile b != 0:\n m += 1 if b > 0 else -1\n m = 1 if m > n else m\n m = n if m < 1 else m\n b += 1 if b < 0 else -1\n\nprint(m)\n\n", "n,a,b = map(int,input().split())\nprint((a-1+b)%n + 1)\n\t \t \t \t \t \t\t\t\t \t\t\t \t\t \t \t", "n, a, b = (int(x) for x in input().split())\na -= 1\nprint((a + b) % n + 1)\n", "z=list(map(int,input().split()))\r\nz[2]%=z[0]\r\nprint(['%d'%(z[2]+z[1]),'%d'%((z[2]+z[1])%z[0])][(z[2]+z[1])>z[0]])\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jan 18 11:35:48 2019\r\n\r\n@author: KIIT\r\n\"\"\"\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nif __name__ == '__main__':\r\n a = list(map(int, input().rstrip().split()))\r\n n,c,b=a[0],a[1],a[2]\r\n x=[]\r\n for i in range(1,n+1):\r\n x.append(i)\r\n if(b<0):\r\n b=-b\r\n x=x[::-1]\r\n #print(x)\r\n j=x.index(c)\r\n #print(j,x[j])\r\n for i in range(0,b):\r\n j=j+1\r\n #print(j)\r\n if(j==len(x)):\r\n j=0\r\n #print(x[j])\r\n continue\r\n \r\n \r\n \r\n #print(j,x[j])\r\n print(x[j])", "n,x,y=map(int,input().split(' '))\r\nres=((x+y)%n+n)%n;\r\nif(res==0):\r\n print(n)\r\nelse:\r\n print(res)", "from dis import dis\n\n\nn,a,b = map(int,input().split())\ndist =n + a +b \ndist = dist%n\n\nprint(dist if dist else n)", "h=input().split(' ')\r\nn=int(h[0]);m=int(h[1]);k=int(h[2]);\r\nprint ((m+k+2000*n-1)%n+1)", "# ----rgkbitw----\r\n# 4.10.2017\r\nn,a,b=map(int,input().split())\r\na-=1\r\nprint((a+b)%n+1)\r\n", "n,a,b=map(int,input().split())\n\nprint((a+b-1)%n+1)\n\n\n\n# Made By Mostafa_Khaled", "n, a, b, = [int(x) for x in input().split()]\nif b < 0:\n if abs(b) > n:\n b = - (abs(b) % n)\n b = n + b\nif (a + b) % n == 0:\n print(n)\nelse:\n print((a + b) % n)\n", "n, a, b = [int(x) for x in (input().split())]\r\nk = (a + b) % n\r\nif k == 0:\r\n\tk = n\r\nprint(k)", "(n, a, b) = map(int, input().split())\r\nk = (a + b) % n\r\nprint(k if k != 0 else n)", "n, a, b = map(int, input().split())\r\nb %= n\r\n\r\nprint(((a + b) % n) if (a + b) % n != 0 else n)", "n, a, b = map(int, input().split())\r\nprint(((a+b-1) % n + n) % n+1)", "n,a,b=map(int,input().split())\r\nz=(n+b)%n\r\nans=(a+z)%n\r\nprint(n if ans==0 else ans)", "i = input()\r\ni=i.split(' ')\r\nn=int(i[0])\r\na=int(i[1])\r\nb=int(i[2])\r\n# for i in range(30):\r\na= (a+b)%n\r\nif(a==0):\r\n print(n)\r\nelse:\r\n print(a)\r\n# i=i+i[-1:-len(i)-1:-1]\r\n# print(i)\r\n", "n, a, b = map(int, input().split())\r\nif abs(n) == abs(b):\r\n print(a)\r\n exit()\r\nbruh = a + b\r\nif bruh%n == 0:\r\n print(n)\r\nelse:\r\n print(bruh%n)", "__author__ = 'Esfandiar'\nn,a,b = map(int,input().split())\nif b >=0:\n if (a+b) % n == 0:\n print(n)\n else:\n print((a+b) % n)\nelse:\n b*=-1\n yy=a-b\n if yy <=0:\n b-=a\n print(n-(b % n))\n else:\n print(yy)\n\n", "# Version 18.0\ndef main() -> None:\n # 2023-09-07 13:13:06\n a,b,c = mi()\n p((b+c-1)%a+1)\n \nif __name__ == \"__main__\":\n import os, sys, math, itertools\n from collections import deque, defaultdict, OrderedDict, Counter\n from bisect import bisect, bisect_left, bisect_right, insort\n from heapq import heapify, heappush, heappop, nsmallest, nlargest, heapreplace, heappushpop\n ii, si = lambda : int(input()), lambda:input() \n mi, msi = lambda : map(int,input().strip().split(\" \")), lambda:map(str,input().strip().split(\" \")) \n li,lsi = lambda:list(mi()), lambda:list(msi())\n out, export = [], lambda:print('\\n'.join(map(str, out)), end='')\n p, pp = lambda x : out.append(x), lambda array : p(' '.join(map(str,array)))\n try : exec('from hq import *\\nline = [cmdIO(),main(),export(),GEN()]\\nfor l in line : l')\n except ( FileNotFoundError, ModuleNotFoundError ) : main(); export()\n \t \t \t \t \t \t\t \t\t\t\t \t\t\t", "import collections\r\nn,a,b=map(int,input().split())\r\nd = collections.deque([i for i in range(1,n+1)])\r\nif(b<0):\r\n d.rotate(abs(b))\r\nelse:\r\n d.rotate(-1*b)\r\nprint(d[a-1])\r\n", "n,a,b=(int(x) for x in input().split())\r\nx=((n+b+a)%n)\r\nif x==0:\r\n x=n\r\nprint(x)", "n,a,b=map(int,input().split(' '))\r\ny=a+b\r\nwhile 1:\r\n if b==0:\r\n print (a)\r\n break\r\n elif y<=0:\r\n y+=n\r\n elif y>n:\r\n y-=n\r\n else :\r\n print (y)\r\n break\r\n \r\n \r\n \r\n", "n, a, b = map(int, input().split())\r\nans = 0\r\nif b == 0:\r\n print(a)\r\nelif b < 0:\r\n for i in range(-b):\r\n if a > 0:\r\n a-=1\r\n if a == 0:\r\n a = n\r\n print(a)\r\nelse:\r\n for i in range(b):\r\n if a <= n:\r\n a+=1\r\n if a == n+1:\r\n a = 1\r\n print(a)", "n,a,k=map(int,input().split())\r\nif (a+k)%n==0:\r\n print(n)\r\nelse:\r\n print((a+k)%n)\r\n", "#codeforces659A\r\ngi = lambda : list(map(int,input().strip().split()))\r\nn, a, b = gi()\r\nprint((a-1+b+n)%n+1)", "n, a, b = [int(i) for i in input().split()]\r\nans = (a + b%n) % n\r\nif ans == 0:\r\n print (n)\r\nelse:\r\n print (ans)", "n, a, b = map(int, input().strip().split())\nprint(((a+b-1)%n)+1)", "n , a, b = map(int, input().split())\n\nif b >= 0:\n ans = (a + b % n) % n\n if ans == 0:\n print(n)\n else:\n print(ans)\nelse:\n ans = (a + (n - abs(b) % n)) % n\n if ans == 0:\n print(n)\n else:\n print(ans)\n", "[n,a,b]=list(map(int,input().split(\" \")))\r\nx=abs(b)%n\r\nres=a+x if b>=0 else n+a-x\r\nprint(res%n) if res%n!=0 else print(n)", "#coding:utf-8\r\n\r\nliste = input().split()\r\nn = int(liste[0])\r\na = int(liste[1])\r\nb = int(liste[2])\r\nif (a+b)%n == 0 :\r\n\tprint(n)\r\nelse :\r\n\tprint((a+b)%n)", "n, a, b = map(int, input().split())\r\nres = (a + b) % n\r\nprint(n if res == 0 else res)", "n, a, b = list(map(int, input().split()))\nif (a + b + n) % n == 0:\n print(n)\nelse:\n print((a + b + n) % n)\n", "old_list = input().split()\r\nnew_list = [int(i) for i in old_list]\r\na = new_list[0]\r\nb = new_list[1]\r\nc = new_list[2]\r\noutput = b\r\nposition = (b+c)%a\r\nif position == 0:\r\n position = a\r\nprint(position)\r\n", "n,a,b = map(int,input().split(\" \"))\r\nres = a + b\r\nif res < 0:\r\n res += n\r\nres = res % n\r\nif res == 0:\r\n print(n)\r\nelse:\r\n print(res)", "# cook your dish here\r\nnn=list(map(int,input().rstrip().split()))\r\n#print(-3%6)\r\nn=nn[0]\r\na=nn[1]\r\nb=nn[2]\r\nnumm=(a+b)%n\r\nif numm==0:\r\n print(n)\r\nelse:\r\n print(numm)\r\n#print()", "n, a, b = map(int, input().split())\r\nans = (a + b + n - 1) % n + 1\r\nprint(ans)", "class CodeforcesTask659ASolution:\n def __init__(self):\n self.result = ''\n self.n_a_b = []\n\n def read_input(self):\n self.n_a_b = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n k = sum(self.n_a_b[1:]) % self.n_a_b[0]\n if not k:\n k = self.n_a_b[0]\n self.result = str(k)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask659ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n , a , b = map(int,input().split())\r\nif b>=0:\r\n\tk = a+b\r\nelse:\r\n\tk = n + (a+b)\t\r\nif k%n==0:\r\n\tprint(n)\r\nelse:print(k%n)\t\t", "def f(l):\r\n n,a,b = l #n=circle, a=start, b=steps\r\n return 1+(a+b-1)%n\r\n\r\nl = list(map(int,input().split()))\r\nprint(f(l))\r\n", "n,a,b=map(int,input().split())\r\nif(b>0):\r\n b=round(b%n)\r\n if(a+b>n):\r\n print(a+b-n)\r\n else:\r\n print(a+b)\r\nelif(b==0):\r\n print(a)\r\nelse:\r\n b=round(abs(b)%n)\r\n if(b-a<0):\r\n print(a-b)\r\n elif(a-b==0):\r\n print(n)\r\n else:\r\n print(n-(b-a))", "n,a,b=map(int,input().split())\r\nif(b>0): \r\n if((a+b)%n==0):\r\n print(n)\r\n else:\r\n print((a+b)%n)\r\nelse:\r\n b*=-1\r\n b%=n\r\n if(b<a):\r\n print(a-b)\r\n elif(a==b and a==1):\r\n print(n)\r\n else:\r\n print(n-b+a)", "n,a,b=map(int,input().split())\r\ns=(a+b)%n\r\nif s==0:\r\n print(n)\r\nelse:\r\n print(s)\r\n", "import math,sys\nfrom collections import Counter, defaultdict, deque\nfrom sys import stdin, stdout\ninput = stdin.readline\nlili=lambda:list(map(int,sys.stdin.readlines()))\nli = lambda:list(map(int,input().split()))\n#for deque append(),pop(),appendleft(),popleft(),count()\nI=lambda:int(input())\nS=lambda:input()\n\nn,a,b=li()\nk=a\nif(b<=0):\n b=abs(b)\n for i in range(0,b):\n k=k-1\n if(k==0):\n k=n\nelse:\n for i in range(0,b):\n k+=1\n if(k==n+1):\n k=1\nprint(k)\n\n \n\n", "def main_function():\r\n n, a, b = [int(i) for i in input().split(\" \")]\r\n m = abs(b) % n\r\n if b == 0:\r\n return a\r\n elif b > 0:\r\n b = b % n\r\n if a + b <= n:\r\n return a + b\r\n else:\r\n return a + b - n\r\n else:\r\n if a - m >= 1:\r\n return a - m\r\n else:\r\n return a - m + n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "n,a,b=map(int,input().split())\r\nif b<0:\r\n if abs(b)-a==0:\r\n print(n)\r\n else:\r\n print(n-(abs(b)-a)%n)\r\nelse:\r\n if (a+b)%n==0:\r\n print(n)\r\n else:\r\n print((a+b)%n)", "n,a,b=map(int,input().split())\r\nb_=abs(b)%n\r\nif b>0:\r\n ans=a+b_\r\nelse:\r\n ans=a-b_\r\nans=ans%n\r\nif ans==0:\r\n ans=n\r\nprint(ans)\r\n", "a,b,c=map(int,input().split())\r\nprint(a if (b+c)%a==0 else (b+c)%a)", "n, a, b = map(int, input().split())\r\nAnswer = (a + b % n + n) % n\r\nif Answer == 0:\r\n Answer = n\r\nprint(Answer)", "a, b, c = map(int, input().split())\r\n\r\n\r\n \r\n# mod function will get position\r\noutput = (b + c) % a\r\nif output == 0:\r\n output = a\r\n \r\nprint(output)", "n, a, b = map(int, input().split())\r\n\r\nif (a + (b % n)) % n != 0:\r\n\tprint((a + (b % n)) % n)\r\n\r\nelse:\r\n\tprint(n)", "n, a, b = list(map(int, input().split()))\r\nprint((((a-1+b) % n+n) % n+1))", "def solved(n,a,b):\r\n return (a + b - 1) % n + 1\r\nif __name__ == '__main__':\r\n n,a,b = map(int,input().split())\r\n print(solved(n,a,b))", "n, a, b = map(int, input().split())\r\ngates = list(range(1, n+1))\r\n\r\na = a+b\r\nprint(gates[(a%n)-1])", "\r\nI = lambda: map(int, input().split())\r\nINT = lambda: int(input())\r\n\r\n##T = INT()\r\nT = 1\r\nfor _ in range(T):\r\n## n = INT()\r\n n, a, b = I()\r\n s = a + b\r\n print(s % n + n*(s % n == 0))\r\n \r\n", "def main():\r\n n, a, b = map(int, input().split())\r\n if b == 0:\r\n print(a)\r\n else:\r\n print(((a - 1 + b) % n + n) % n + 1)\r\n \r\nif __name__ == '__main__':\r\n main()", "n,a,b = map(int, input().split())\r\na-=1\r\nprint((a+b)%n+1)", "n, a, b = map(int, input().split())\r\nif b < 0:\r\n for x in range(abs(b)):\r\n if a != 1:\r\n a -= 1\r\n else:\r\n a = n\r\nelif b >= 0:\r\n for y in range(b):\r\n if a == n:\r\n a = 1\r\n else:\r\n a += 1\r\n\r\nprint(a)\r\n", "n,a,b = map(int,input().split())\nret = (a+b)%n\nif ret == 0:\n ret = n\nprint(ret)\n", "n , a ,b = input().split()\nn=int (n)\na=int (a)\nb=int (b)\nprint((a-1 +b )%n +1 )\n\n \t \t\t \t\t \t\t \t \t\t\t", "n,a,b=input().split()\nenterances=list(range(1,int(n)+1))\n\ndef upper_bound(nums, target):\n l, r = 0, len(nums) - 1\n while l <= r:\n mid = l + (r - l) // 2\n if nums[mid] >= target:\n r = mid - 1\n else:\n l = mid + 1\n return l\n\nprint(enterances[(upper_bound(enterances,int(a))+int(b))%int(n)])\n", "n,a,b=map(int,input().split())\r\n\r\nd=a+b\r\n\r\nif(d>n):\r\n for i in range(10000):\r\n d-=n\r\n if(d<=n):\r\n print(d)\r\n break\r\nelif(d<1):\r\n for i in range(10000):\r\n d+=n\r\n if(d>=1):\r\n print(d)\r\n break\r\nelse:\r\n print(d)\r\n", "a1 = input().split()\r\na = [int(a1[i]) for i in range(len(a1))]\r\nn = a[2] % a[0] + a[1]\r\nprint(n % a[0]) if n % a[0] != 0 else print(a[0])", "n, a, b = [int(a) for a in input().split(' ')]\r\nnums = [1, n] + list(reversed([i for i in range(2, n)]))\r\ns_i = nums.index(a)\r\n\r\nif b == 0:\r\n print(nums[s_i])\r\nelse:\r\n r = abs(b)%len(nums)\r\n p = b>0\r\n d=0\r\n if p:\r\n d=-1\r\n else:\r\n d=1\r\n while r>0:\r\n s_i += d\r\n if s_i > len(nums)-1:\r\n s_i =0\r\n elif s_i < 0:\r\n s_i = len(nums)-1\r\n r-=1\r\n print(nums[s_i])\r\n", "n, a, b = list(map(int, input().split()))\r\nk = (a + b) % n\r\nif k == 0:\r\n print(n)\r\nelse:\r\n print(k)\r\n", "n,a,b=map(int,input().split())\r\naa=abs(b)%n\r\nif b<0 and aa>a: ans=n-aa+a\r\nelif b<0: ans=a-aa\r\nelif aa>n-a: ans=aa-n+a\r\nelse: ans=aa+a\r\nprint([ans,n][ans==0])", "n, a, b = map(int, input().split())\r\nans = (a + b + 1000 * n) % n\r\nif(ans == 0):\r\n ans = n\r\nprint(ans)", "'''input\n3 2 -100\n'''\nn, a, b = map(int, input().split())\nprint((a + b % n) if a + b % n <= n else (a + b % n) % n)", "n, a, b = map(int, input().split())\r\nprint([(a + b%n)%n, (a+b%n)][(a + b%n)%n == 0])\r\n", "n, a, b = [int(j) for j in (input().split())]\r\nk = (a % n + b % n) % n\r\nif k == 0:\r\n\tk = n\r\nprint(k)", "from posixpath import split\r\n\r\n\r\nn, a, b = (int(i) for i in input().split())\r\n\r\nentrance = []\r\n\r\nfor i in range(1, n+1):\r\n entrance.append(i)\r\n\r\nstart_point = a-1\r\nendpoint = start_point\r\n\r\nwhile b != 0:\r\n if b > 0:\r\n endpoint += 1\r\n if endpoint > n - 1:\r\n endpoint = 0\r\n b -= 1\r\n elif b < 0:\r\n endpoint -= 1\r\n if endpoint < 0:\r\n endpoint = n - 1\r\n b += 1\r\n\r\nprint(entrance[endpoint])\r\n\r\n\r\n", "\n\n\n\nn,a,b=map(int,input().split())\nif b<0:\n for i in range(-b):\n a-=1\n if not a:a=n\n print(a)\nelse:\n for i in range(b):a=(a%n)+1\n print(a)\n\n", "n,a,b = map(int,input().split())\nres = a+b\nif res<0:\n r = (-res)%n\n if r==0:\n print(n)\n else:\n print(n-r)\nelif res==0:\n print(n)\nelse:\n r = res%n\n if r==0:\n print(n)\n else:\n print(r)\n", "n, a, b = map(int, input().split())\r\nprint((a-1+b)%n+1)\r\n", "n, a, b = list(map(int, list(input().split())))\r\nm = (a + b + n) % n\r\nif m == 0:\r\n print(n)\r\nelse:\r\n print(m)\r\n\r\n", "n, a, b = map(int, input().split())\r\nprint(((a-1+b)%n+n)%n + 1)\r\n", "n,i,j=map(int,input().split())\r\ncount=1\r\nif j>0:\r\n while(count<=j):\r\n if i>=n:\r\n i=1\r\n else:\r\n i+=1\r\n count+=1\r\n print(i)\r\nelse:\r\n while(count<=abs(j)):\r\n if i<=1:\r\n i=n\r\n else:\r\n i-=1\r\n count+=1\r\n print(i)\r\n\r\n\r\n", "n,a,b=list(map(int,input().split()))\r\nc=b%n\r\nif c>=0:\r\n\tf=a+c\r\n\tif f>n:\r\n\t\tprint(f-n)\r\n\telse:\r\n\t\tprint(f)\r\nelse:\r\n\td=n+b\r\n\tf=a+d\r\n\tif f>n:\r\n\t\tprint(f-n)\r\n\telse:\r\n\t\tprint(f)", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/24 13:57\r\n\r\n\"\"\"\r\n\r\nn, a, b = map(int, input().split())\r\n\r\nans = (a + b - 1 + n * abs(b)) % n + 1\r\nprint(ans)\r\n\r\n\r\n", "n, a, b = map(int, input().split())\r\nif (b < 0):\r\n bp, ans = abs(b), a - abs(b) % n\r\n\r\n if (ans== 0):\r\n print(n)\r\n elif (ans < 0):\r\n print(n + ans)\r\n else:\r\n print(ans)\r\nelse:\r\n if ((b + a) % n != 0):\r\n print((b + a) % n)\r\n else:\r\n print(n)\r\n", "n,m,t=map(int,input().split())\r\nprint((m+t-1)%n+1)", "n, a, b = map(int, input().split())\r\n\r\nif b < 0:\r\n\ti = abs(b) % n\r\n\tj = a\r\n\twhile i > 0:\r\n\t\tif j == 0:\r\n\t\t\tj = n\r\n\t\tj -= 1\r\n\t\ti -= 1\r\n\t\t\r\n\tif j == 0:\r\n\t\tj = n\r\n\tprint(j)\r\nelse:\r\n\ti = b % n\r\n\tj = a\r\n\twhile i > 0:\r\n\t\tif j == n + 1:\r\n\t\t\tj = 1\r\n\t\tj += 1\r\n\t\ti -= 1\r\n\t\r\n\tif j == n + 1:\r\n\t\tj = 1\r\n\tprint(j)\r\n\t", "n,a,b=map(int,input().split())\r\nif b>=0:\r\n\tx=a+b\r\nelse:\r\n\tx=n+(a+b)\r\nprint(n if x%n==0 else x%n)", "n, a, b = map(int, input().split())\r\nprint((a-1+b) % n + 1)", "n, a, b = map(int, input().split() )\nprint((a-1+b+n) % n + 1)\n", "n,a,b = map(int, input().split())\r\n\r\nx=((a+b)%n)\r\nif x==0:\r\n x = n\r\nprint(x)", "n,a,b=map(int,input().split())\r\nr=(a+b-1)\r\nf=r%n+1\r\nprint(f)\r\n", "n , a , b = map(int,input().split())\r\nans = (a+b) % n\r\nif ans != 0:\r\n print(abs(ans))\r\nelse:\r\n print(n)", "import math\r\nn,a,b=[int(i) for i in input().split()]\r\nl=list(range(1,n+1))\r\nl=l*2000\r\nif(b>=0):\r\n d=l.index(a)\r\n d=d+b\r\n print(l[d])\r\nelse:\r\n l=l[::-1]\r\n d=l.index(a)\r\n d=d+abs(b)\r\n print(l[d])", "n,a,b = map(int,input().split())\r\nprint(n if (a+b)%n==0 else (a+b)%n)", "# example input \"6 2 -5\"\r\n# input(): read the line \"6 2 -5\"\r\n# split(): split the line by spaces into list [\"6\", \"2\", \"-5\"]\r\n# [int(s) ... ]: list comprehension, convert the strings to integers\r\n# [\"6\", \"2\", \"-5\"] => [6, 2, -5]\r\n# n, a, b = [6, 2, -5]: unpack the list and assign values to the variables\r\nn, a, b = [int(s) for s in input().split()]\r\n\r\n# it is more convinient to deal with indices starting with 0\r\nr = (a - 1 + b) % n\r\nif r < 0:\r\n r += n\r\n# add 1 back so the indices start with 1\r\nprint(r + 1)", "a, b, c=map(int, input().split())\r\ns=[i for i in range(1, a+1)]\r\nprint(s[(b-1+c)%(a)])\r\n \r\n\r\n", "n , a , b = map(int,input().split())\r\nfor f in range(abs(b)):\r\n if b > 0 :\r\n a += 1\r\n if a == n + 1 : a = 1\r\n else :\r\n a -= 1\r\n if a == 0 : a = n\r\nprint(a)\r\n", "n,a,b=map(int,input().split())\r\nk=n*n+a+b\r\nif k%n==0:\r\n print(n)\r\nelse:\r\n print(k%n)", "n,a,b=map(int,input().split())\r\nloc=(a+b)%n\r\nif loc==0:\r\n\tloc=n\r\nprint(loc)\r\n", "n,a,b=map(int,input().split())\r\nprint((a+b-1)%n+1)", "n,a,b=[int(x) for x in input().split()]\r\nif b==0:\r\n print(a)\r\nelif b>0:\r\n c=a+b%n\r\n if c>n:\r\n print(c-n)\r\n else:\r\n print(c)\r\nelse:\r\n c=a-abs(b)%n\r\n if c<=0:\r\n print(n+c)\r\n else:\r\n print(c)\r\n", "n, a, b = [int(i) for i in input().split()]\r\nk = (a + b) % n\r\nif k == 0: k = n\r\nprint(k)", "n, a, b = map(int, input().split())\r\nfor i in range(abs(b)):\r\n a += -1 * int(b < 0) + int(b > 0)\r\n if a == n + 1:\r\n a = 1\r\n if a == 0:\r\n a = n\r\nprint(a)\r\n\r\n\r\n\r\n", "def f(l,start,step):\r\n n=start+step\r\n if n>=l:\r\n n=n%l\r\n while n<0:\r\n n=l+n\r\n return n+1\r\n \r\nif __name__=='__main__':\r\n a,b,c=map(int,input().split())\r\n print(f(a,b-1,c))", "a,b,c = [int(i) for i in input().split()]\r\nif c < 0 :\r\n\tc = -c\r\n\tc = c%a\r\n\tc = -c\r\n\tc = c+b\r\n\tc = abs(c+a)%a\r\n\tif c == 0:\r\n\t\tc = a\r\n\tprint(c)\r\nelse:\r\n\tb = b+c\r\n\tb = b%a\r\n\tif b == 0 :\r\n\t\tb = a\r\n\tprint(b)\r\n", "n,a,b=map(int,input().strip().split())\r\nres=(a+b)%n \r\nif res==0:\r\n print(n)\r\nelse:\r\n print(res)", "def dom(n, a, b):\r\n if b >= 0:\r\n if (a + b) % n == 0:\r\n return n\r\n else:\r\n return (a + b) % n\r\n else:\r\n b = - b\r\n if a > b:\r\n return a - b\r\n else:\r\n if (b - a) % n == 0:\r\n return n\r\n else:\r\n return n - (b - a) % n\r\n\r\n\r\nN, A, B = [int(i) for i in input().split()]\r\nprint(dom(N, A, B))", "from sys import stdin,stdout\r\n#n=int(stdin.readline().strip())\r\na,b,c=map(int,stdin.readline().strip().split())\r\nb-=1\r\nc=(b+c)%a\r\nprint(c+1)\r\n#s=list(map(int,stdin.readline().strip().split()))\r\n", "nab = input().split()\r\nn, a, b = int(nab[0]), int(nab[1]), int(nab[2])\r\n\r\nif( ((a + b) % n) == 0):\r\n print(n)\r\nelse:\r\n print((a + b) % n)", "n, a, b = map(int, input().split())\r\nmodulo = abs(b) % n\r\nif b < 0:\r\n if modulo == 0: \r\n print(a)\r\n else:\r\n ans = a + n - (abs(b) % n)\r\n print(ans if ans <= n else ans % n)\r\nelse:\r\n ans = a + (abs(b) % n)\r\n print(ans if ans <= n else ans % n)", "x=list(map(int,input().split()))\r\nn=x[0]\r\na=x[1]\r\nb=x[2]\r\nprint(((a-1+b)% n + n) % n + 1)", "n, a, b = list(map(int, input().split()))\r\n\r\na -= 1\r\na += b\r\na %= n\r\na+=1\r\n\r\n\r\nprint(a)\r\n", "def main():\r\n n, a, b = map(int, input().strip().split())\r\n p = (a + b) % n\r\n print(p if p != 0 else n)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n , a , b = map(int,input().split())\nif b>=0:\n\tk = a+b\nelse:\n\tk = n + (a+b)\t\nif k%n==0:\n\tprint(n)\nelse:print(k%n)\t\t", "n, a, b = [int(i) for i in input().split()]\r\n\r\na += b\r\na %= n\r\nif a == 0:\r\n a = n\r\nprint(a)", "n, a, b = map(int, input().split())\r\na = a - 1\r\na = (a + b) % n\r\nif (a < 0):\r\n\ta = a + n\r\nprint(a + 1)", "def solve(n, a, b):\r\n if b == 0:\r\n return a\r\n elif b < 0:\r\n mod = abs(b)%n\r\n end = a - (mod)\r\n if end <=0:\r\n return n - abs(end)\r\n else:\r\n return end\r\n else:\r\n mod = b % n\r\n end = a + mod\r\n if end > n:\r\n return end - n\r\n else:\r\n return end\r\nn, a, b = map(int, input().split())\r\nprint(solve(n, a, b))\r\n", "n,a,b=list(map(int,input().split()))\r\nc=abs(b)\r\n\r\nwhile c>0:\r\n\tif b<0:\r\n\t\ta-=1\r\n\t\tif a==0:\r\n\t\t\ta=n\r\n\telse:\r\n\t\ta+=1\r\n\t\tif a==n+1:\r\n\t\t\ta=1\r\n\tc-=1\r\nprint(a)", "n,a,b =map(int , input().split())\r\nprint((a+b-1)%n+1)", "[n, a, b] = list(map(int, input().split(\" \")))\nb = b % n\na = (a + b)%n\nprint(a if a > 0 else n)\n", "n, a, b = [int(x) for x in input().split()]\r\nif b > 0:\r\n i = 1\r\nelse:\r\n i = -1\r\nb = abs(b)\r\n\r\nwhile b != 0:\r\n a += i\r\n if a > n:\r\n a -= n\r\n if a < 1:\r\n a += n\r\n b -= 1\r\n\r\nprint(a)", "\nn, a, b = map(int,input().split())\n\nhouses = []\n\nfor i in range(1,n+1):\n houses.append(i)\n\n\nloops = abs(b)\nstart = houses.index(a)\n\nif b <= 0:\n clockwise = False\nelse:\n clockwise = True\n\nfor i in range(loops):\n if clockwise:\n if start == n-1:\n start = 0\n else:\n start += 1\n else:\n if start == 0:\n start = n-1\n else:\n start -= 1\n\nprint(houses[start])\n\n\t\t\t \t\t \t \t \t \t \t\t \t \t\t", "import math\r\nn,a,b = map(int,input().split())\r\nif b>=0:\r\n print((b+a-1)%n+1)\r\nelse:\r\n nn = int(math.ceil(abs(a+b-1)/n))*n\r\n print((nn+a+b-1)%n+1)", "n,a,b=list(map(int,input().split()))\r\nprint((a+b-1)%n+1)\r\n", "l=list(map(int,input().split()));x=sum(l)%l[0]\r\nprint(x if x else l[0])", "n,a,b=list(map(int,input().split()))\r\nprint((a+b)%n if (a+b)%n !=0 else n)", "def house(n, a, b):\n return ((a-1) + b) % n + 1\n\n\ndef main():\n n, a, b = readinti()\n print(house(n, a, b))\n\n##########\n\nimport sys\n\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\nif __name__ == '__main__':\n main()\n", "n,a,b=[int(i) for i in input().split()]\r\nentrance=(a+b)%n\r\nif (entrance==0):\r\n\tentrance=n\r\nprint(entrance)", "n, a, b = map(int, input().split())\r\na -= 1\r\nif b < 0:\r\n b = n - (abs(b) % n)\r\nelse:\r\n b %= n\r\nprint((a + b) % n + 1)\r\n", "n, a, b = [int(i) for i in input().split()]\r\n\r\nc = a+b\r\nif c>n:\r\n\tk = c % n\r\nelif c<1:\r\n\tif abs(c)<=n:\r\n\t\tk = n + c\r\n\telse:\r\n\t\tk = n - (abs(c) % n)\r\nelse:\r\n\tk = c\r\n\r\nif k==0:\r\n\tk = n\r\nprint(k)", "a,b,c=map(int,input().split())\r\nsum=b+c\r\ncount=2*a\r\nx=sum%count\r\nd=x%a\r\nif(d==0):\r\n print(a)\r\nelse:\r\n print(d)\r\n", "from math import sqrt\r\n\r\n# remainder cycle\r\ndef cycle(x,n):\r\n return((x%n)+n)%n\r\n\r\ndef solve():\r\n return\r\n\r\n\r\nif __name__=='__main__':\r\n n,a,b=map(int,input().split())\r\n print(cycle(a+b,n) if cycle(a+b,n) else n)\r\n\r\n\r\n\r\n", "a,b,c= map(int,input().split())\r\nz = b+c\r\nif z>=0:\r\n\tif z%a==0:print(a)\r\n\telse:print(z%a)\r\nelse:\r\n\tprint(a-(abs(z)%a))", "n , k , x = map(int , input().split())\r\narr = list(range(1 , n+1))\r\n\r\nif x<0: arr = arr[::-1]\r\nx = abs(x)\r\n\r\n\r\n# print(arr)\r\n\r\npos = arr.index(k)\r\n# print(\"pos\" , pos)\r\nprint(arr[(pos + x )%n ])", "n,a,b=map(int,input().split())\r\nwhile(b):\r\n if b>0:\r\n if a<n:\r\n a+=1\r\n else:\r\n a=1\r\n b-=1\r\n else:\r\n if a>1:\r\n a-=1\r\n else:\r\n a=n\r\n b+=1\r\nprint(a)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, a, b = map(int, input().split())\r\nprint((a+b)%n if (a+b)%n != 0 else n)", "n, a, b = map(int, input().split(' '))\r\nflag = 0\r\ndirection = 0\r\nif(b<0):\r\n b = -b\r\n direction = 1\r\nfor i in range(b):\r\n if(direction == 0):\r\n a += 1\r\n if(a > n):\r\n a = 1\r\n if(direction == 1 ):\r\n a -= 1\r\n if(a < 1):\r\n a = n\r\nprint(a)", "n,s,d=map(int,input().split())\r\nif d>=0:\r\n d=d\r\n for i in range(d):\r\n s+=1\r\n if s>n:\r\n s=1\r\nelse:\r\n d=0-d\r\n for j in range(d):\r\n s-=1\r\n if s==0:\r\n s=n\r\nprint(s)", "n,a,b=map(int,input().split())\r\n \r\nres=(a-1+b+1000*n)%n+1\r\n \r\nprint(res)", "from sys import stdin\r\nn, a, b = map(int,stdin.readline().split())\r\nprint(1 + (a + b - 1) % n)", "n, a, b = [ int (num) for num in input().split() ]\r\n\r\nr = abs((a+b)%n)\r\nres = r if r != 0 else n\r\n\r\nprint(res)", "count , start , walk = map(int,input().split())\r\nwhile walk > count : walk -= count\r\nwhile walk < 0 : walk += count\r\nres = start + walk\r\nprint(res if res <= count else res - count) ", "n, a, b = [int(x) for x in input().split()]\r\n\r\na -= 1\r\na = (a + b) % n\r\na += 1\r\nprint(a)\r\n", "n,a,b=map(int,input().split())\r\nl=[]\r\nfor i in range(1,n+1):\r\n\tl.append(i)\r\nif b<0:\r\n\tt=a-1\r\n\ty=b+t\r\n\tp=y%n\r\n\tprint(l[p])\r\nelse:\r\n\tt=n-a\r\n\ty=b-t\r\n\tp=(y%n)-1\r\n\tprint(l[p])", "n, a, b = map(int,input().split())\r\na += b\r\na %= n\r\nprint(n if a==0 else a)", "n,a,b = map(int,input().split())\r\nprint(((a-1+b)%(n+n))%n+1)", "n, a, b = map(int, input().split())\r\nans = (n+a%n+b%n)%n\r\nprint(ans if ans!=0 else n)", "\r\n#start the code from here\r\nn,m,b=map(int,input().split())\r\nb=b%n\r\nif b+m>=0:\r\n\te=abs(m+b)%n\r\nelse:\r\n\te=abs(n+b+m)%n\r\n\r\nif e==0:\r\n\tprint(n)\r\nelse:\r\n\tprint(e)", "n,a,b=map(int,input().split())\r\nb=b%n\r\nsum=0\r\nif b<0:\r\n sum=a+b+n\r\nelse:\r\n sum=a+b\r\n\r\nif sum%n==0:\r\n print(n)\r\nelse:\r\n print(sum%n)", "inp = [int(i) for i in input().split()]\r\nn = inp[0]\r\na = inp[1]\r\nb = inp[2]\r\n\r\nresult = (a + b) % n\r\nif result == 0: result = n\r\nprint(result)\r\n", "# full logic before coding\r\n\r\n# notc = int(input())\r\n\r\n# for i in range(notc):\r\nn, a, b = map(int, input().split())\r\n\r\nsign = 0 \r\nif b < 0:\r\n sign = -1\r\nelse:\r\n sign = 1\r\n\r\nb = abs(b) % n\r\n\r\nif sign == -1:\r\n b = n - b\r\n\r\nk = (a + b) % n\r\nif k == 0:\r\n k = n\r\n\r\nprint(k)", "n, a , b = [int(x) for x in input().split()]\r\nb %= n\r\na += b\r\nif a > n:\r\n a -= n\r\nelif a < 1:\r\n a += n\r\nprint(a)", "n, a, b = map(int,input().split())\nfor i in range(abs(b)):\n if n == 1:\n break\n elif b >=0:\n if n == a:\n a=0\n a+=1\n if a == n and i != abs(b)-1:\n a=0\n elif b < 0:\n if a == 1:\n a = n+1\n a-=1\n if a==1 and i !=abs(b)-1 :\n a=n+1\nfor i in range(100):\n if abs(a) > n:\n a = a-n\n else:\n break\nprint(abs(a))", "a,b,c=map(int,input().split())\r\nprint((b+c-1)%a+1)", "n, a, b = [int(x) for x in input().split(' ')]\r\n\r\nans = (a + b) % n\r\nif ans == 0:\r\n ans = n\r\n\r\nprint(ans)", "n,a,b=list(input().split(' '))\r\nn=int(n)\r\na=int(a)\r\nb=int(b)\r\n\r\nresult=((a+b)%n+n)%n\r\nif result==0:\r\n print(n)\r\nelse:\r\n print(result)\r\n", "n,m,p=map(int,input().split())\r\nr=((m+p%n)%n)\r\nif r==0:\r\n r=n\r\nprint(r)", "\r\nn,a,b = list(map(int,input().split()))\r\n\r\nans = (n+a+b)%n;\r\n\r\nif ans == 0:\r\n print(n)\r\nelse:\r\n print(ans)", "n,a,b=input().split()\nprint(((int(a)+int(b))%int(n)+int(n)-1)%int(n)+1)", "n,a,b=map(int,input().split())\r\nif b<0:\r\n\tb=abs(b)\r\n\tif b<a:\r\n\t\tprint(a-b)\r\n\telse:\r\n\t\tb=b-a\r\n\t\tt=b%n\r\n\t\tprint(n-t)\r\nelse:\r\n\tif b<n-a:\r\n\t\tprint(a+b)\r\n\telse:\r\n\t\tb=b-(n-a)\r\n\t\tt=b%n\r\n\t\tif t==0:\r\n\t\t\tt=n\r\n\t\tprint(t)", "k = [int(i) for i in input().split()]\r\nl = 0\r\nif (k[2] + k[1]) % k[0] == 0:\r\n l = k[0]\r\nprint((k[2] + k[1]) % k[0] + l)", "n,a,b=map(int,input().split())\r\nprint(((a+b)%n+n-1)%n+1)", "n ,a , b = map(int,input().split())\r\n\r\nans = (a + b ) % n\r\n#print(ans)\r\n\r\nif ans == 0 :\r\n print(n)\r\nelse:\r\n print(ans)\r\n", "# testing\r\n\r\nn, a, b = map(int, input().split())\r\n\r\nif(b*-1==b):\r\n x = abs((((n+b)%n)+a)%n)\r\nelse:\r\n x = abs(((b%n)+a)%n)\r\n\r\nif x == 0:\r\n print(n)\r\nelse:\r\n print(x)", "n, a, b = map(int, input().split())\r\n\r\nx = (a+b) % n\r\n\r\nif x == 0:\r\n print(n)\r\nelse:\r\n print(x)", "n, a, b = map(int, input().split())\n\nif b < 0:\n b += 200 * n\n\nans = (a + b) % n\nif ans == 0:\n ans = n\nprint(ans)\n", "st=[int(i) for i in input().split(\" \")]\r\nn=st[0]\r\na=st[1]\r\nb=st[2]\r\nprint(((a-1+b)%n+n)%n+1)\r\n", "#vasya round\r\n\r\nn,a,b = list(map(int,input().split()))\r\nb1=b\r\nb = (abs(b))%n\r\nif(b1<0):\r\n b= n-b\r\nx=a+b\r\nif(x>n):\r\n print(x-n)\r\nelse:\r\n print(x)", "y=input()\r\ny=y.split()\r\nn=int(y[0])\r\na=int(y[1])\r\nb=int(y[2])\r\n\r\nresult=(a+b)%n\r\nresult=result+n\r\nresult=result%n\r\nif result==0:\r\n result=n\r\nprint(result) \r\n", "n, a, b = map(int, input().split())\r\nb = b % n\r\nans = a+b\r\nif abs(ans) > n:\r\n print(ans-n)\r\nelse:\r\n print(ans)", "n,a,b=map(int,input().split())\r\nif (n+a+b)%n==0:\r\n print(n)\r\nelse:\r\n print((n+a+b)%n)", "n,a,b=map(int,input().split())\r\nif b>0:\r\n\tif (a+b)%n==0:\r\n\t\tprint(n)\r\n\telse:\r\n\t\tprint((a+b)%n)\r\nelif b<0:\r\n\tif (n+a+b)%n==0:\r\n\t\tprint(n)\r\n\telse:\r\n\t\tprint((n+a+b)%n)\r\nelse:\r\n\tprint(a)\r\n\r\n", "def main():\r\n number_of_entrances, his_entrance, length_of_walk = [int(x) for x in input().split()]\r\n ans = (his_entrance + (length_of_walk % number_of_entrances)) % number_of_entrances\r\n if ans == 0:\r\n ans = number_of_entrances\r\n print(ans)\r\n\r\n\r\nmain()\r\n", "n, a, b = (int(i) for i in input().split())\nres = (((a - 1) + b) % n) + 1\nprint(res)\n", "n,a,b = [int(x) for x in input().split()]\r\n\r\nans = (a%n + b%n) % n\r\nif ans == 0:\r\n\tprint(n)\r\nelse:\r\n\tprint(ans)", "m = input().split(' ')\r\nn = int(m[0])\r\na = int(m[1])\r\nb = int(m[2])\r\nk = (a + b) % n\r\nif k == 0:\r\n k = n\r\nprint(k)", "n,x,y=map(int,input().split(' '))\r\nif((x+y)%n ==0 ):\r\n print(n)\r\nelse:\r\n print ((x+y)%n)\r\n \r\n", "a,b,c=list(map(int,input().split()))\r\nd=b+c \r\nif d<0:\r\n\tprint((-d//a+((-d)%a!=0))*a+d if (-d//a+((-d)%a!=0))*a+d!=0 else a )\r\nelse:\r\n\tprint(d%a if d%a!=0 else a)", "n,a,b=list(map(int,input().split()))\r\nk=a+b\r\nl=k%n\r\nif l==0:\r\n print (n)\r\nelse:\r\n print (l)\r\n", "num_entrances, start, movement = map(int, input().split())\r\nend = (start + movement) % num_entrances\r\nif end < 1:\r\n end = num_entrances - end\r\nprint(end)\r\n", "#%% \r\nins = list(map(int, input().split(\" \")))\r\n\r\nval = (ins[1] + ins[2]) % ins[0] \r\nif val: print(val)\r\nelse: print(ins[0])\r\n# %%\r\n", "n,a,k=map(int,input().split())\r\nif k<0:\r\n\tk=abs(k)\r\n\tif k<=a-1:print(a-k)\r\n\telse:\r\n\t\tk-=(a-1)\r\n\t\tk=k%n\r\n\t\tprint([n-k+1,1][k==0])\r\nelse:\r\n\tk=abs(k)\r\n\tif k<=n-a:print(a+k)\r\n\telse:\r\n\t\tk-=(n-a)\r\n\t\tk=k%n\r\n\t\tprint([k,n][k==0])", "n, a, b = list(map(int, input().split()))\r\nif ((a + b) % n == 0):\r\n print(n)\r\nelse:\r\n print((a + b) % n)" ]

[ "n, M = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\na.append(0)\r\na.append(M)\r\na.sort()\r\non = 0\r\nfor i in range(1, len(a), 2):\r\n on += a[i] - a[i-1]\r\nh = on \r\ns = 0\r\nfor i in range(2, len(a), 2):\r\n s += a[i-1] - a[i-2] \r\n t = on - s \r\n h = max(h, s + M-a[i-1]-t - 1) \r\nprint(h)", "n,m=map(int,input().split())\r\nnums=[0]+[int(x) for x in input().split()]+[m]\r\nx=[]\r\nfor i in range(n+1):\r\n x.append(nums[i+1]-nums[i])\r\nflag=[True,False][n%2]\r\ntot=0\r\nfor i in range(n+1):\r\n if i%2==0:\r\n tot+=x[i]\r\ndark=0\r\nlight=0\r\nmx=0\r\nnums.reverse()\r\nif flag:\r\n x.reverse()\r\n for i in range(n+1):\r\n if i%2==0:\r\n if x[i]>1:\r\n if nums[i + 1] - nums[i] > 1:\r\n temp = -light + dark - 1\r\n if temp > mx:\r\n mx = temp\r\n light+=x[i]\r\n else:\r\n dark+=x[i]\r\n if x[i]>1:\r\n temp=-light+dark-1\r\n if temp>mx:\r\n mx=temp\r\nelse:\r\n x.reverse()\r\n for i in range(n+1):\r\n if i % 2 == 1:\r\n if x[i]> 1:\r\n if nums[i + 1] - nums[i] > 1:\r\n temp = -light + dark - 1\r\n if temp > mx:\r\n mx = temp\r\n light += x[i]\r\n else:\r\n dark += x[i]\r\n if x[i]> 1:\r\n temp = -light + dark - 1\r\n if temp > mx:\r\n mx = temp\r\nprint(tot+mx)\r\n\r\n\r\n", "n,m = [int(x) for x in input().split()]\r\nl = [0]\r\nfor x in input().split():\r\n l.append(int(x))\r\nl.append(m)\r\nspan = []\r\nma = 0\r\nremain_even = 0\r\nfor i in range(1,len(l)):\r\n temp = l[i]-l[i-1]\r\n span.append(temp)\r\n if i%2 == 1:\r\n ma += temp\r\n else:\r\n remain_even += temp\r\nremain_odd = ma\r\nnow = 0\r\nfor i in range(len(span)):\r\n if i%2 == 0:\r\n temp = now +remain_even+span[i]-1\r\n remain_odd -= span[i]\r\n now += span[i]\r\n else:\r\n temp = now + remain_odd -1\r\n remain_even -= span[i]\r\n if temp > ma:\r\n ma = temp\r\nprint(ma)", "n,M=map(int,input().split())\r\nlist1=[0]+[int(x) for x in input().split()] +[M]\r\nT=L1=0\r\nfor i in range(1,n+2,2):\r\n T+=list1[i]-list1[i-1]\r\n s=T\r\nfor i in range(2,n+2,2):\r\n L1+=list1[i-1]-list1[i-2]\r\n if list1[i]-list1[i-1]>1:\r\n L2=T-L1\r\n k=L1+M-list1[i-1]-L2-1\r\n s=max(k,s)\r\nprint(s)", "length, d = list(map(int, input().split(' ')))\r\nl = [0] + list(map(int, input().split(' '))) + [d] \r\n\r\na, b, c = [0], [0], []\r\nfor i in range(1,len(l)):\r\n if i % 2:\r\n b.append(b[i-1]+l[i]-l[i-1])\r\n else:\r\n b.append(b[i-1])\r\n a.append(l[i]-b[i])\r\n\r\nfor i in range(1,len(l)-1):\r\n if l[i] - l[i-1] > 1 or l[i+1] - l[i] > 1:\r\n d = a[-1] - a[i] + b[i] - 1\r\n c.append(d)\r\nc.append(b[-1])\r\nprint(max(c))", "n,M=[int(a) for a in input().split()]\r\na_list=[int(b) for b in input().split()]+[M]\r\n#a_list长度为n+1\r\n\r\nd_list=[a_list[0]]\r\nd_list+=[a_list[j+1]-a_list[j] for j in range(n)]\r\nd_list+=[0]*(n+1-2*int((n+1)/2))\r\n#d_list长度为不小于n+1的最小偶数\r\n\r\ntotal=0\r\nvalue=0\r\ndelta=0\r\nfor j in range(len(d_list)-1,0,-2):\r\n if d_list[j]>1 or d_list[j-1]>1:\r\n delta=max(total-2*value+d_list[j]-1,delta)\r\n total+=d_list[j]+d_list[j-1]\r\n value+=d_list[j-1]\r\nprint(value+delta)\r\n", "n, m = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\na.insert(0,0)\r\nans = 0\r\nl = [0 for i in range(n + 1)]\r\nloff = [0 for i in range(n + 3)]\r\nsum = [0 for i in range(n + 1)]\r\nsum[0] = a[1] - a[0]\r\na.append(m)\r\nfor i in range(n, -1, -1):\r\n l[i] = a[i+1] - a[i]\r\n if i % 2 != 0:\r\n loff[i] = loff[i + 2] + l[i]\r\nfor i in range(2, n + 1, 2):\r\n sum[i] = sum[i-2] +l[i]\r\nans = sum[n - 1] + sum[n]\r\nfor i in range(n + 1):\r\n if l[i] == 1:\r\n continue\r\n if i % 2 == 0:\r\n if ans < sum[i] - l[i] + 1 +loff[i + 1]:\r\n ans = sum[i] - l[i] + 1 + loff[i + 1]\r\n elif ans < sum[i - 1] + loff[i] -1:\r\n ans = sum[i - 1] + loff[i] -1\r\nprint(ans)", "n,M=map(int,input().split())\r\na=[0]+[int(x) for x in input().split()]+[M]\r\ntotal=s=time=0\r\nfor i in range(1,len(a),2):\r\n total+=a[i]-a[i-1]\r\ntime=total\r\nfor i in range(2,len(a),2):\r\n s+= a[i-1]-a[i-2]\r\n if a[i]-a[i-1]>1:\r\n t=total-s\r\n time=max(time,s+M-a[i-1]-t-1)\r\nprint(time)", "n,m=map(int,input().split())\r\ns=[0]+[int(x) for x in input().split()]+[m]\r\n\r\nt0=0\r\nfor i in range(1,len(s),2):\r\n t0+=s[i]-s[i-1] \r\ntmax=t0\r\n\r\ntime=0\r\nfor i in range(1,len(s)-1,2):\r\n time+=s[i]-s[i-1]\r\n if s[i]-s[i-1]>1 or s[i+1]-s[i]>1:\r\n ti=m-s[i]-t0+2*time-1\r\n tmax=max(tmax,ti)\r\n\r\nif len(s)%2==1 and s[-1]-s[-2]>1:\r\n t1=t0+1\r\n tamx=max(tmax,t1)\r\n\r\nprint(tmax)", "listt=[int(x) for x in input().split()]\r\nn=listt[0]\r\nm=listt[1]\r\nlight=[int(x) for x in input().split()]\r\nl=[[light[0],1]]\r\nfor i in range(len(light)-1):\r\n l.append([light[i+1]-light[i],i%2])\r\nif l[-1][-1]==0:\r\n l.append([m-light[-1],1])\r\nelse:\r\n l.append([m-light[-1],0])\r\nflip=[]\r\nre=0\r\nfor i in range(len(l)-1,0,-1):\r\n if l[i][1]==0:\r\n re+=l[i][0]\r\n else:\r\n re-=l[i][0]\r\n flip.append(re)\r\nflip=flip[::-1]\r\ntime=[]\r\nk=0\r\nfor i in range(len(l)):\r\n k+=l[i][1]*l[i][0]\r\ntime.append(k)\r\nfor i in range(len(l)-1):\r\n if l[i][1]==1:\r\n time.append(k+flip[i]-1)\r\n else:\r\n time.append(k+flip[i]+l[i][0]-1)\r\nprint(max(time))", "n,M=map(int,input().split())\r\na=[0]+[int(i) for i in input().split()]+[M]\r\ndark=[]\r\nbright=[]\r\nfor i in range(n+1,0,-1):\r\n if i%2==0:\r\n dark.append(a[i]-a[i-1])\r\n else:\r\n bright.append(a[i]-a[i-1])\r\nbright.reverse()\r\nsum_dark=[]\r\nsum_bright=[]\r\ne=0\r\nf=0\r\nfor i in range(len(bright)):\r\n e+=bright[i]\r\n sum_bright.append(e)\r\nfor i in range(len(dark)):\r\n f+=dark[i]\r\n sum_dark.append(f)\r\nb=[] \r\nfor i in range(len(sum_dark)):\r\n b.append(sum_dark[i]+sum_bright[(n+1)//2-i-1]-1)\r\nb.append(sum_bright[-1])\r\nprint(max(b)) ", "n,M=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nA.insert(0,0)\r\nB=[0]\r\nb=0\r\nfor i in range(1,n+2):\r\n if i==n+1:\r\n if i%2==1:\r\n b+=M-A[-1]\r\n elif i%2==1:\r\n b+=A[i]-A[i-1]\r\n B.append(b)\r\nC=[B[n+1]]\r\nfor i in range(1,n+1):\r\n if i%2==1:\r\n c=B[i]+M-A[i]-(B[n+1]-B[i])-1\r\n else:\r\n c=B[i]+M-A[i]-(B[n+1]-B[i])+A[i]-A[i-1]-1\r\n C.append(c)\r\nprint(max(C))\r\n ", "n, M = map(int, input().split())\r\na0 = [0] + [int(x) for x in input().split()] + [M]\r\ntime = []\r\n\r\ntime0 = afterclosetime = beforeopentime = 0\r\nopentime = {}\r\nclosetime = {0: 0}\r\nfor i in range(1, n + 2, 2):\r\n time0 += a0[i] - a0[i - 1]\r\n opentime[i] = a0[i] - a0[i - 1]\r\nfor i in range(2, n + 2, 2):\r\n afterclosetime += a0[i] - a0[i - 1]\r\n closetime[i] = a0[i] - a0[i - 1]\r\ntime.append(time0)\r\n\r\nfor p in range(1, n + 1):\r\n time1 = 0\r\n if p % 2 == 0:\r\n beforeopentime += opentime[p - 1]\r\n afterclosetime -= closetime[p]\r\n time1 = beforeopentime + closetime[p] + afterclosetime - 1\r\n else:\r\n time1 = beforeopentime + opentime[p] + afterclosetime - 1\r\n\r\n time.append(time1)\r\n\r\nprint(max(time))\r\n", "m,l=map(int, input().split())\r\nli=[0]+[int(i) for i in input().split()]+[l]\r\n\r\nc,d=0,0\r\nfor j in range(1,m+2,2):\r\n c+=li[j]-li[j-1]\r\nlit=[c]\r\nfor k in range(2,m+2,2):\r\n d+=li[k-1]-li[k-2]\r\n if li[k]>=li[k-1]+2:\r\n lit.append(d+l-li[k-1]-c+d-1)\r\nprint(max(lit))", "n, M = map(int, input().split())\r\na = [0]\r\na.extend([int(x) for x in input().split()])\r\nif n % 2 == 0:\r\n a.append(M)\r\n n += 1\r\na.append(M)\r\nt = m = 0\r\nfor i in range(n, 0, -2):\r\n if (a[i + 1] - a[i] > 1) or (a[i] - a[i - 1] > 1):\r\n d = M - 2 * t - a[i] - 1\r\n if d > m:\r\n m = d\r\n t += a[i] - a[i - 1]\r\nprint(m + t)\r\n", "n,m=map(int, input().split())\r\na=[int(i) for i in input().split()]\r\n\r\nb=[0]*(n+1) #记录(n+1)段长度\r\nfor i in range(n+1):\r\n if i==0:\r\n b[i]=a[i]\r\n elif i==n:\r\n b[i]=m-a[i-1]\r\n else:\r\n b[i]=a[i]-a[i-1]\r\n\r\nc=[0]*(n+1) #记录在某一个段中灯开关，1开0关\r\ntemp=1\r\nfor i in range(n+1):\r\n c[i]=temp\r\n temp^=1\r\n\r\ndp=[0]*(n+1) #第x段结束后亮灯总时长\r\ndp[0]=b[0]\r\nfor i in range(1,n+1):\r\n dp[i]=dp[i-1]+b[i]*c[i]\r\n\r\nout=[0]*(n+1)\r\nfor i in range(0,n):\r\n if b[i]>1:\r\n if c[i]==1:\r\n out[i]=dp[i]-1+m-a[i]-(dp[n]-dp[i])\r\n elif c[i]==0:\r\n out[i]=dp[i]-1+b[i]+m-a[i]-(dp[n]-dp[i])\r\nx=dp[n-1]+b[-1]-1\r\nout.append(x)\r\nout.append(dp[n])\r\n\r\nprint(max(out))", "import sys\r\n\r\n\r\ndef II(): return int(sys.stdin.readline())\r\ndef LI(): return [int(num) for num in sys.stdin.readline().split()]\r\ndef SI(): return sys.stdin.readline().rstrip()\r\n\r\n\r\nn, M = LI()\r\na = [0] + LI() + [M]\r\n\r\n# print(a)\r\n\r\nlight = 1\r\nlamp_is_lit = 0\r\nlamp_is_off = 0\r\nfor ind in range(n + 1):\r\n if light:\r\n light = 0\r\n lamp_is_lit += a[ind + 1] - a[ind]\r\n else:\r\n light = 1\r\n lamp_is_off += a[ind + 1] - a[ind]\r\n\r\n# print(lamp_is_lit)\r\n# print(lamp_is_off)\r\n\r\nans = 0\r\nlight = 1\r\nlocal_lamp_is_lit = 0\r\nlocal_lamp_is_off = 0\r\nfor ind in range(n + 1):\r\n if light:\r\n light = 0\r\n local_lamp_is_lit += a[ind + 1] - a[ind]\r\n else:\r\n light = 1\r\n local_lamp_is_off += a[ind + 1] - a[ind]\r\n\r\n if not light:\r\n ans = max(ans,\r\n (a[ind + 1] - 1 - a[ind]) +\r\n (local_lamp_is_lit - (a[ind + 1] - a[ind])) +\r\n (lamp_is_off - local_lamp_is_off))\r\n else:\r\n # print(a[ind + 1] - (a[ind] + 1), local_lamp_is_lit, lamp_is_off - (local_lamp_is_off - (a[ind + 1] - a[ind])))\r\n ans = max(ans,\r\n (a[ind + 1] - (a[ind] + 1)) +\r\n local_lamp_is_lit +\r\n (lamp_is_off - local_lamp_is_off))\r\n\r\n # print(local_lamp_is_lit, local_lamp_is_off)\r\nprint(max(ans, lamp_is_lit))", "f=1\r\nn, M = map(int, input().split())\r\na=[0]+[int(x) for x in input().split()]+[M]\r\n\r\nb=[0]*(n+2)\r\nfor i in range(1,n+2):\r\n b[i]=b[i-1]+f*(a[i]-a[i-1])\r\n f^=1\r\n\r\nans=b[n+1]#untouched\r\nfor i in range (1,n+2):\r\n if(a[i]-a[i-1]>1):\r\n if i&1:\r\n pass\r\n else:\r\n ans=max(ans,b[i]+a[i]-a[i-1]-1+M-a[i]-(b[n+1]-b[i]))\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nL.append(0)\r\nL.append(m)\r\nL.sort()\r\nA=[]\r\nB=[]\r\nfor i in range(0,(len(L)-len(L)%2)//2):\r\n A.append(L[2*i+1]-L[2*i])\r\n if 2*i+2>=len(L):\r\n break\r\n B.append(L[2*i+2]-L[2*i+1])\r\nk=sum(A)\r\nb=sum(B)\r\nfor i in range(0,(len(L)-len(L)%2)//2):\r\n if i == 0:\r\n b=b+A[0]-1\r\n k=max(k,b)\r\n else:\r\n b=b-B[i-1]+A[i]\r\n k=max(k,b)\r\nprint(k)", "n, M = map(int, input().split())\r\na = [0]+[int(x) for x in input().split()]+[M]\r\nb = [0]*(n+2)\r\nfor i in range(n, -1, -1):\r\n b[i] = b[i+1]+(a[i+1]-a[i])*(not i & 1)\r\nans = b[0]\r\ntmp = 0\r\nfor i in range(n+1):\r\n if a[i+1] > a[i] + 1:\r\n tmp = max(tmp, ans+M-a[i+1]-2*b[i+1]-1+(a[i+1]-a[i])*(i & 1))\r\nprint(max(ans, tmp))\r\n", "n, M = map(int, input().split())\r\na = [0] + [int(i) for i in input().split()]\r\na.append(M)\r\non = [0]\r\nfor i in range(1, n+2, 2):\r\n on.append(on[-1] + a[i] - a[i-1])\r\nans = []\r\nfor i in range(1, n+2, 2):\r\n ans.append(2*on[(i+1)//2] + M - a[i] - on[-1])\r\nans.append(on[-1]+1)\r\nprint(max(ans)-1)", "n,m=map(int,input().split())\r\ns=[0]\r\ns=s+list(map(int,input().split()))\r\ns=s+[m]\r\na=[0]\r\nfor x in range(0,n+1):\r\n a.append(s[x+1]-s[x])\r\nl=0\r\nr=0\r\np=1\r\ns=0\r\nwhile(p<=n+1):\r\n if(p%2==0):\r\n r+=a[p]\r\n p+=1\r\nwhile(l<=n):\r\n l+=1\r\n if(l%2==0):\r\n continue\r\n r=r+a[l]-a[l-1]\r\n if(l!=1 and l!=(n+1) and l!=n and a[l]==1 and a[l+1]==1):\r\n continue\r\n if(l!=n+1):\r\n s=max(s,r-1)\r\n else:\r\n s=max(s,r)\r\nprint(s)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 26 15:35:19 2021\r\n\r\n@author: DELL\r\n\"\"\"\r\nm=input().split()\r\na=[0]+list(map(int,input().split()))\r\na=a+[int(m[1])]\r\ns=1\r\nh=len(a)\r\nj=k=0\r\nwhile k<=h-2:\r\n j+=a[k+1]-a[k]\r\n k+=2\r\npossible={j}\r\nif h%2==0:\r\n a+=[int(m[1])]\r\n h+=1\r\nev={} \r\ne1=e2=i=0\r\nwhile i<h:\r\n if i%2==0:\r\n e1+=a[i]\r\n ev[i]=e1\r\n i+=1\r\n else:\r\n e2+=a[i]\r\n ev[i]=e2\r\n i+=1\r\nt=0\r\nwhile t<h-1:\r\n if a[t+1]-a[t]<2:\r\n t+=1\r\n else:\r\n p=a[t+1]-a[t]-1\r\n if t==0:\r\n p+=ev[h-1]-ev[h-2]\r\n elif t==h-2:\r\n p+=ev[h-2]-ev[h-3]\r\n elif t%2==0:\r\n p+=ev[t-1]-ev[t-2]+ev[h-1]-ev[t]-ev[h-2]+ev[t-1]\r\n else:\r\n p+=ev[t]-ev[t-1]+ev[h-1]-ev[t+1]-ev[h-2]+ev[t]\r\n \r\n possible.add(p)\r\n t+=1\r\n\r\nprint(max(possible))", "n, m = map(int, input().split())\r\na = [0] + [int(x) for x in input().split()] + [m]\r\ntotal = final = s = 0\r\nfor i in range(1, len(a), 2):\r\n total += a[i] - a[i-1]\r\nfinal = total\r\nfor i in range(2, len(a), 2):\r\n s += a[i-1] - a[i-2]\r\n if a[i] > a[i-1] + 1:\r\n t = total -s\r\n final = max(final, s + m-a[i-1]- t - 1)\r\nprint(final)", "n,M=[int(x) for x in input().split()]\r\nki=[int(x) for x in input().split()]\r\nb=[0]*(n+1)\r\na=[0]*(n+1)\r\ns=set()\r\nki.append(0)\r\nfor i in range(n):\r\n if i%2==0:\r\n b[i]=b[i-1]+ki[i]-ki[i-1]\r\n else:\r\n b[i]=b[i-1]\r\nif n%2==0:\r\n b[n]=M-ki[n-1]+b[n-1]\r\nelse:\r\n b[n]=b[n-1]\r\nki[-1]=M\r\nfor i in range(n+1):\r\n a[i]=ki[i]-b[i]\r\nfor i in range(n-1):\r\n x=b[i]+a[n]-a[i+1]+ki[i+1]-ki[i]-1\r\n s.add(x)\r\ns.add(b[n])\r\nif n%2==1:\r\n s.add(b[n]+M-1-ki[-2])\r\nprint(max(s))\r\n", "n, M = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.append(0); a.append(M); a.sort()\r\n\r\nopen_sum = 0\r\nopen_time = []\r\nfor i in range(1,len(a),2):\r\n open_sum = open_sum + (a[i] - a[i-1])\r\n open_time.append(open_sum)\r\nmax_sum = open_sum\r\n\r\nif n % 2 == 1:\r\n for j in range(1,len(a),2):\r\n if a[j+1] - a[j] > 1:\r\n new_sum = open_time[int((j-1)/2)] + (M - a[j]) - (open_sum - open_time[int((j-1)/2)]) -1\r\n max_sum = max(max_sum,new_sum)\r\nelse:\r\n for j in range(2,len(a),2):\r\n if a[j] - a[j-1] > 1:\r\n new_sum = open_time[int((j-2)/2)] + (M - a[j-1]) - (open_sum - open_time[int((j-2)/2)]) -1\r\n max_sum = max(max_sum,new_sum)\r\n\r\nprint(max_sum)", "n,m=[int(x) for x in input().split()]\r\na=[0]+[int(x) for x in input().split()]+[m]\r\nlit=[0]\r\ns=0\r\nfor i in range(1,n+2):\r\n if i%2==1:\r\n s+=a[i]-a[i-1]\r\n lit.append(s)\r\nfor i in range(1,n+2):\r\n if a[i]-a[i-1]>1:\r\n s=max(s,lit[i-1]+a[i]-a[i-1]-1+m-a[i]-lit[n+1]+lit[i])\r\nprint(s)\r\n", "n, M = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.insert(0, 0)\r\na.append(M)\r\nx = [[0,0] for i in range(n+2)] # when use *,it's seen as the same address\r\nfor i in range(n+1, 0, -1):\r\n\ta[i] -= a[i-1]\r\n\tx[i-1][i%2] = x[i][i%2] + a[i]\r\n\tx[i-1][not (i%2)] = x[i][not (i%2)]\r\nMax = x[0][1]\r\nfor i in range(1, n+2):\r\n\tif a[i] != 1:\r\n\t\tSum = (x[0][1] - x[i-1][1]) + x[i][0] + a[i] - 1\r\n\t\tMax = max(Max, Sum)\t\r\nprint(Max)\r\n", "n, m = map(int, input().split())\r\n\r\nprogram = [0] + [int(x) for x in input().split()] + [m]\r\n \r\nlamp_off = 0\r\nlamp_on = 0\r\nfinal = 0\r\n\r\nfor i in range(1, n+2):\r\n if i % 2 == 0:\r\n lamp_off = lamp_off + (program[i] - program[i-1])\r\n else:\r\n lamp_on = lamp_on + (program[i] - program[i-1])\r\nmaximum = lamp_on\r\n\r\nfor i in range(1, n+1, 2):\r\n final = final + (program[i] - program[i-1])\r\n if ((program[i] - program[i-1] > 1) or (program[i+1] - program[i] > 1)):\r\n maximum = max(maximum, final-1 + lamp_off)\r\n lamp_off = lamp_off - (program[i+1] - program[i])\r\n\r\nprint(maximum)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,M = map(int, input().split())\r\nA = [0]+list(map(int, input().split()))+[M]\r\n\r\n#print(A)\r\n\r\nevns,odds = [0],[0]\r\nfor i in range(1,N+2):\r\n evns.append(evns[-1])\r\n odds.append(odds[-1])\r\n \r\n if i%2:\r\n evns[i]+=A[i]-A[i-1]\r\n else:\r\n odds[i]+=A[i]-A[i-1]\r\n \r\ndef cal(i,cur):\r\n tmp = 0\r\n if i%2:\r\n tmp+=evns[i-1]\r\n tmp+=cur-A[i-1]\r\n tmp+=odds[-1]-odds[i]\r\n else:\r\n tmp+=evns[i-1]\r\n tmp+=A[i]-cur\r\n tmp+=odds[-1]-odds[i]\r\n \r\n return tmp\r\n \r\n\r\nans = evns[-1]\r\nfor i in range(1,N+2):\r\n if A[i]-A[i-1]==1:continue\r\n a = A[i-1]+1\r\n b = A[i]-1\r\n tmp = max(cal(i, a), cal(i, b))\r\n ans = max(ans, tmp)\r\n #print(i,tmp,a,b)\r\nprint(ans)\r\n \r\n \r\n", "m,n = map(int,input().split())\r\nlist1 = [0] + list(map(int,input().split())) + [n]\r\nlight = []\r\ndark = []\r\nflag = 1\r\nfor i in range(len(list1)-1):\r\n dark.append(list1[i+1]-list1[i])if flag == 0else light.append(list1[i+1]-list1[i])\r\n flag ^=1\r\nmaxplan = max(light[0] -1 + sum(dark),sum(light[:len(dark)]) + dark[-1]-1,sum(light))\r\nsum1 = sum(dark)\r\nfor i in range(1,len(dark)):\r\n sum1 = sum1 + light[i-1] - dark[i-1]\r\n plan =sum1 + max(light[i],dark[i-1])-1\r\n if plan > maxplan:\r\n maxplan = plan\r\nprint(maxplan)", "n,m=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nd.append(0)\r\nd.append(m)\r\nd.sort()\r\nflag=1\r\ni=1\r\np=len(d)\r\nguan=0\r\nkai=0\r\nkai2=0\r\nguan2=0\r\nwhile i!=p:\r\n if flag:\r\n kai+=d[i]-d[i-1]\r\n flag=0\r\n else:\r\n guan+=d[i]-d[i-1]\r\n flag=1\r\n i+=1\r\nmax_=kai\r\nflag=1\r\ni=1 \r\nwhile i!=p:\r\n if flag:\r\n kai-=d[i]-d[i-1]\r\n else:\r\n guan-=d[i]-d[i-1]\r\n temp = kai2 + d[i] - d[i - 1] - 1 + guan\r\n if temp > max_ and d[i] - d[i - 1]!=1:\r\n max_ = temp\r\n if flag:\r\n kai2+=d[i]-d[i-1]\r\n flag=0\r\n else:\r\n guan2+=d[i]-d[i-1]\r\n flag=1\r\n i+=1 \r\nprint(max_) ", "n,m=map(int,input().split())\r\ns=[0]+list(map(int,input().split()))+[m]\r\nss=set(s)\r\ntot=0\r\ndd={0:0}\r\nfor x in range(len(s)//2):\r\n tot+=s[2*x+1]-s[2*x]\r\n dd[s[2*x+1]-1],dd[s[2*x+1]+1]=tot-1,tot\r\n if 2*x+2<=len(s)-1:\r\n dd[s[2 * x + 2] - 1], dd[s[2 * x + 2] + 1]=tot,tot+1\r\nmax=int(tot)\r\nfor y in range(1,n+1):\r\n if s[y]-1 not in ss:\r\n if 2*dd[s[y]-1]+m-(s[y]-1)-tot>max:\r\n max=2*dd[s[y]-1]+m-(s[y]-1)-tot\r\n if s[y]+1 not in ss:\r\n if 2*dd[s[y]+1]+m-(s[y]+1)-tot>max:\r\n max=2*dd[s[y]+1]+m-(s[y]+1)-tot\r\nprint(max)", "f = 1 # to mark turned on or turned off\r\nn, M = map(int, input().split())\r\na = [0] + [int(x) for x in input().split()] + [M]\r\n\r\n# b[i]: the total time when the lamp is lit for the ith program\r\nb = [0]*(n+2)\r\nfor i in range(1, n+1):\r\n b[i] = b[i-1] + f*(a[i] - a[i-1])\r\n f ^= 1 # change 0 to 1, or vice versa\r\n\r\n# add the value for the last program, because it wasn't added in the loop above\r\nb[n+1] = b[n] + f*(M - a[n])\r\n\r\n# if no program is added, time lit = the last value\r\nans = b[n+1]\r\n\r\nfor i in range(1, n+2):\r\n # if the duration is more than 1, make changes\r\n if ((a[i] - a[i-1]) > 1):\r\n # if i is odd (the light is currently lit)\r\n if i & 1:\r\n ans = max(ans, b[i] + (M - a[i]) - (b[n+1] - b[i]) - 1)\r\n # else, the light is currently turned off\r\n else:\r\n ans = max(ans, b[i] + (M - a[i]) - (b[n+1] - b[i]) - 1 + a[i] - a[i-1])\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\na=[0]+[int(x) for x in input().split()]+[m]\r\ntot=tot1=0\r\nfor i in range(1,len(a),2):\r\n tot+=a[i]-a[i-1]\r\nans=tot\r\nfor i in range(2,len(a),2):\r\n tot1+=a[i-1]-a[i-2]\r\n if a[i]-a[i-1]>1:\r\n ans=max(ans,tot1+m-a[i-1]-(tot-tot1)-1)\r\nprint(ans)", "n,M=map(int,input().split())\r\n*a,=map(int,input().split());a=[0]+a+[M];n+=2\r\nb=[0]*n\r\nfor i in range(1,n):\r\n b[i]=b[i-1]+(a[i]-a[i-1])*(1+(-1)**(i+1))//2\r\ns=b[n-1]\r\nfor j in range(1,n):\r\n c=b[j-1]+a[n-1]-b[n-1]+b[j]-a[j-1]-1\r\n s=max(s,c)\r\nprint(s)", "n,M=map(int,input().split())\r\na=[0]+[int(x) for x in input().split()]+[M]\r\ntot=ans=s=0\r\nfor i in range(1,len(a),2):\r\n tot+=a[i]-a[i-1]\r\nans=tot\r\nfor i in range(2,len(a),2):\r\n s+=a[i-1]-a[i-2]\r\n if a[i]>a[i-1]+1:\r\n t=tot-s\r\n ans=max(ans,s+M-a[i-1]-t-1)\r\nprint(ans)", "n, M = map(int, input().split())\nli = list(map(int, input().split()))\n\nli.append(M)\n\norig = li[0]\na = [li[0]]\nfor i in range(1, len(li)):\n a.append(li[i] - li[i - 1])\n if i % 2 == 0:\n orig += li[i] - li[i - 1]\n\n# print(a)\n# print(orig)\ninc = 0\nincm = 0\nif len(a) % 2 == 0:\n a.append(0)\nfor i in range(len(a) // 2 - 1, -1, -1):\n inc = inc - a[2 * i + 2] + a[2 * i + 1]\n # print(\"inc\", inc)\n if not (a[2 * i + 2] == a[2 * i + 1] == 1) and inc > incm:\n incm = inc\n\nif incm > 1:\n print(orig + incm - 1)\nelse:\n print(orig)\n", "a,b=(input().split())\r\nc=input().split()\r\nlong=0\r\nlong1=0\r\nlist1=int(c[0])\r\ndict1={}\r\nif int(a)%2==0:\r\n for i in range(int(a)):\r\n long+=int(c[i])*(-1)**(i)\r\n dict1[i]=long\r\n long+=int(b)\r\n dict1[int(a)]=long\r\n Long=[long]\r\n for i in range(0,int(a),2):\r\n long1=dict1[i]*2+int(b)-1-int(c[i])-long\r\n Long.append(long1)\r\nelse:\r\n for i in range(int(a)):\r\n long+=int(c[i])*(-1)**(i)\r\n dict1[i]=long\r\n Long=[long]\r\n for i in range(0,int(a)+1,2):\r\n long1=dict1[i]*2+int(b)-1-int(c[i])-long\r\n Long.append(long1)\r\nprint(max(Long))", "n, M = (int(x) for x in input().split())\r\nk1, k0 = [], []\r\nt0 = 0; i = 1\r\ntm = 0; tc = 0\r\nfor t in [int(x) for x in input().split()] + [M]:\r\n k1.append(t - t0) if i % 2 else k0.append(t - t0)\r\n t0 = t; i += 1\r\ntt = sum(k1); s = n % 2\r\nfor i in range(2, n + 2):\r\n if s: tc += k0[-(i // 2)]\r\n else: tc -= k1[-(i // 2)]\r\n s = not s\r\n if tc > tm: tm = tc\r\nif tm > 1: tt += tm - 1\r\nprint(tt)", "n,m=map(int,input().split())\r\na=[0]+list(map(int,input().split()))+[m]\r\nb={}\r\nd=0\r\nfor i in range(1,n+2):\r\n b[i]=a[i]-a[i-1]\r\nfor i in range(1,n+1):\r\n if b[i]==1 and b[i+1]==1:\r\n b[i]=0\r\n b[i+1]=0\r\n d=d+1\r\nc=list(b.values())\r\nwhile 0 in c:\r\n c.remove(0)\r\nif c:\r\n p=len(c)\r\n w=0\r\n for i in range(0,p,2):\r\n w=w+c[i]\r\n if p%2==1:\r\n u=0\r\n k=0\r\n for i in range(2,p,2):\r\n u=u+c[p-i]-c[p-i+1]\r\n k=max([u,k])\r\n else:\r\n u=c[p-1]\r\n k=u\r\n for i in range(2,p,2):\r\n u=u+c[p-i-1]-c[p-i]\r\n k=max([u,k])\r\n if k>0:\r\n w=w+k-1\r\n print(w+d)\r\nelse:\r\n print(d)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.insert(0,0)\r\na.append(m)\r\ntime=[]\r\nfor i in range(len(a)-1):\r\n time.append(a[i+1]-a[i])\r\nmaximun=0\r\nb=0\r\ntot_pre=0\r\ntot_all=0\r\nfor i in range(n+1):\r\n if (n-i)%2==0:\r\n temp=a[n+1-i]-1\r\n if temp>a[n-i]:\r\n change=(tot_all-tot_pre)-tot_pre-1\r\n if change>maximun:\r\n maximun=change\r\n b=temp\r\n tot_pre+=time[n-i]\r\n tot_all+=time[n-i]\r\n else:\r\n temp=a[n-i]+1\r\n if temp<a[n-i+1]:\r\n change=(tot_all-tot_pre)-tot_pre+time[n-i]-1\r\n if change>maximun:\r\n maximun=change\r\n b=temp\r\n tot_all+=time[n-i]\r\nprint(tot_pre+maximun)", "n,m=map(int, input().split())\r\na=[0]+[int(i) for i in input().split()]+[m]\r\nb,c=0,0\r\nfor x in range(1,len(a),2):\r\n b+=a[x]-a[x-1]\r\nd=[b]\r\nfor k in range(2,len(a),2):\r\n c+=a[k-1]-a[k-2]\r\n if a[k]>a[k-1]+1:\r\n l=c+m-a[k-1]-(b-c)-1\r\n d.append(l)\r\nprint(max(d))", "#7_6.py\r\n#CF1000B: Light It Up, greedy, 1500\r\n#https://codeforces.com/problemset/problem/1000/B\r\nn, M = map(int, input().split())\r\na = [0] + list(map(int, input().split())) + [M]\r\n\r\n# a0=0 a1 a2 ... an M=a_n+1\r\n# ci = ai-a_i-1 1<=i<=n+1\r\n# bi = \\Sigma(j<=i,j为奇数)cj\r\n# 只要ci>1即可拆解ci，取其中的最大区间ci-1\r\n# 然后计算此前的奇数项之和和此后的偶数项之和\r\n\r\nf = 1\r\nb = [0] * (n+2)\r\nfor i in range(1, n+2):\r\n b[i] = b[i-1] + f*(a[i]-a[i-1])\r\n f ^= 1 # ^是按位异或操作，与1异或，把0变成1，把1变成0\r\n\r\nans = b[n+1]\r\nfor i in range(1,n+2):\r\n if (a[i] - a[i-1] >1):#拆解ci\r\n if i&1: #本身为奇数项\r\n ans = max(ans, b[i] - 1 + (M-a[i]-(b[n+1]-b[i])))\r\n else: #本身为偶数项\r\n ans = max(ans, b[i] + (a[i]-a[i-1]-1) + (M-a[i]-(b[n+1]-b[i])))\r\n\r\nprint(ans)", "t = 1\r\nn,M = map(int,input().split())\r\na = [0] + [int(x) for x in input().split()] + [M]\r\nb = [0]*(n+2)\r\nfor i in range(1,n+1):\r\n b[i] = b[i-1] + t*(a[i]-a[i-1])\r\n t ^= 1\r\nb[n+1] = b[n] + t*(M-a[n])\r\np = b[n+1]\r\nfor i in range(1,n+2):\r\n if (a[i]-a[i-1]>1):\r\n if i&1:\r\n p = max(p,b[i]+M-a[i]-(b[n+1]-b[i])-1)\r\n else:\r\n p = max(p,b[i]+a[i]-a[i-1]-1+M-a[i]-(b[n+1]-b[i]))\r\nprint(p)", "n, M = map(int, input().split())\r\na = [0] + [int(x) for x in input().split()] + [M]\r\nanswer = []\r\ntotallit = infrontlit = 0\r\nfor i in range(1, len(a), 2):\r\n totallit += a[i] - a[i - 1]\r\nanswer.append(totallit)\r\nfor i in range(2, len(a), 2):\r\n infrontlit += a[i - 1] - a[i - 2]\r\n behindlit = totallit - infrontlit\r\n if a[i] - a[i - 1] > 1:\r\n behinddark = M - a[i - 1] - behindlit\r\n afterlit = infrontlit + behinddark - 1\r\n answer.append(afterlit)\r\nprint(max(answer))", "n,m=map(int,input().split())\r\na=[0]+list(map(int,input().split()))+[m]\r\nr=0;q=0;s1=0;s2=0\r\nfor i in range(1,n+2,2):\r\n s1+=a[i]-a[i-1]\r\ns2=s1\r\ns=0\r\nfor i in range(2,n+2,2):\r\n s+=a[i-1]-a[i-2]\r\n if a[i]-a[i-1]>1:\r\n s2=max(s2,m+2*s-s1-1-a[i-1])#后面一长串即在关闭后下一个时刻立刻反转状态\r\nprint(s2)", "n, M = map(int, input().split())\r\na = [0] + list(map(int, input().split())) + [M]\r\nins = []\r\nnaga = [[-1, 0]]\r\np = 1\r\nlighted = 0\r\nfor i in range(1, n + 2):\r\n ins.append((a[i] - a[i - 1]) * p)\r\n if p == 1:\r\n lighted += (a[i] - a[i - 1])\r\n p = -p\r\nfor i in range(0, n + 1):\r\n j = n - i\r\n naga.append([j, naga[i][1] + ins[j]])\r\nnaga = sorted(naga, key=lambda o: o[1])\r\nfor i in range(n + 1):\r\n if a[naga[i][0]] - a[naga[i][0] - 1] > 1 or a[naga[i][0] + 1] - a[naga[i][0]] > 1:\r\n lighted += max(-naga[i][1] - 1, 0)\r\n break\r\nprint(lighted)", "n, m = [int(t) for t in input().split()]\r\na = [0] + [int(t) for t in input().split()] + [m]\r\non, off = [0], [0]\r\nfor i in range(n + 1):\r\n if i % 2 == 0:\r\n on.append(on[-1] + a[i + 1] - a[i])\r\n off.append(off[-1])\r\n else:\r\n on.append(on[-1])\r\n off.append(off[-1] + a[i + 1] - a[i])\r\n\r\ntime = on[-1]\r\nfor i in range(1, n + 1):\r\n if a[i] - a[i - 1] - 1 or a[i + 1] - a[i] - 1:\r\n time = max(time, on[i] + off[-1] - off[i] - 1)\r\n\r\nprint(time)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.append(m)\r\non=[l[0]]\r\noff=[0]\r\np=-1\r\nfor i in range(1,n+1):\r\n\tif p==1:\r\n\t\ton.append(on[i-1]+l[i]-l[i-1])\r\n\t\toff.append(off[i-1])\r\n\telse:\r\n\t\toff.append(off[i-1]+l[i]-l[i-1])\r\n\t\ton.append(on[i-1])\r\n\tp=-p\r\nans=on[n]\r\nfor i in range(0,n):\r\n\tans=max(ans,on[i]-1+off[n]-off[i])\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nl=[0]+list(map(int,input().split()))+[m]\r\ntime=0\r\nl1=[]\r\noutput=[]\r\nfor i in range(1,n+2,2) :\r\n time+=l[i]-l[i-1]\r\n l1.append(time)\r\nfor i in range(len(l1)) :\r\n t1=l1[i]-1+l[-1]-l[2*i+1]-(l1[-1]-l1[i])\r\n t2=l1[i]+l[-1]-l[2*i+1]-(l1[-1]-l1[i])-1\r\n output.append(max(t1,t2,l1[-1]))\r\noutput.sort()\r\nprint(output[-1])", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, M = map(int, input().split())\r\nw = [0] + list(map(int, input().split())) + [M]\r\na, b = 0, 0\r\nfor i in range(n+1):\r\n if i % 2:\r\n b += w[i+1]-w[i]\r\n else:\r\n a += w[i+1]-w[i]\r\nc = a\r\na1, b1 = 0, 0\r\nfor i in range(n+1):\r\n if i % 2:\r\n b -= w[i + 1] - w[i]\r\n if w[i+1] - w[i] == 1:\r\n b1 += w[i + 1] - w[i]\r\n continue\r\n c = max(c, a1 + w[i+1] - w[i] - 1 + b)\r\n b1 += w[i + 1] - w[i]\r\n else:\r\n a -= w[i + 1] - w[i]\r\n if w[i+1] - w[i] == 1:\r\n a1 += w[i + 1] - w[i]\r\n continue\r\n c = max(c, a1 + w[i + 1] - w[i] - 1 + b)\r\n a1 += w[i + 1] - w[i]\r\nprint(c)", "n,m=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\na.append(m)\r\na.insert(0,0)\r\nb=[0 for i in range(n+2)]\r\nfor i in range(1,n+2):\r\n if i%2!=0:\r\n b[i]+=a[i]-a[i-1]+b[i-1]\r\n else:\r\n b[i]=b[i-1]\r\nans=b[n+1]\r\nfor i in range(n+1):\r\n ans=max(ans,b[i]+a[i+1]-a[i]-1+m-a[i+1]-(b[n+1]-b[i+1]))\r\nprint(ans)", "n, m = map(int, input().split())\r\nl = [0] + list(map(int, input().split()))+[m]\r\non = []\r\noff = []\r\nfor i in range(n+1):\r\n l[i] = l[i+1]-l[i]\r\n if i % 2 == 0:\r\n on.append(l[i])\r\n off.append(0)\r\n else:\r\n on.append(0)\r\n off.append(l[i])\r\nfor i in range(1, n+1):\r\n on[i] += on[i-1]\r\n off[i] += off[i-1]\r\nmaxans = on[-1]\r\nfor i in range(n+1):\r\n if l[i] > 1:\r\n maxans = max(maxans, on[i//2*2]-1+off[-1]-off[i//2*2])\r\nprint(maxans)\r\n", "n,m = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\nb = [0]*(n+1)\r\nb[0] = a[0]\r\nfor i in range(1,n):\r\n if i%2 == 1:\r\n b[i] = b[i-1]\r\n else:\r\n b[i] = b[i-1]+a[i]-a[i-1]\r\nif n%2 == 0:\r\n b[n] = b[n-1]+m-a[n-1]\r\nelse:\r\n b[n] = b[n-1]\r\ntime = []\r\ntime.append(b[n])\r\nfor i in range(1,n):\r\n x = b[i-1]+a[i]-a[i-1]-1+m-a[i]-b[n]+b[i]\r\n time.append(x)\r\ny = a[0]-1+m-a[0]-b[n]+b[0]\r\ntime.append(y)\r\nz = b[n-1]+m-a[n-1]-1\r\ntime.append(z)\r\nprint(max(time))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 26 21:02:44 2021\r\n\r\n@author: cheehong\r\n\"\"\"\r\nn,M=map(int, input().split())\r\na=list(map(int, input().split()))\r\na+=[M]\r\na.insert(0, 0)\r\nb=[0]*(n+2)\r\nk=2\r\ntotalon=b[1]=a[1]\r\nwhile k<n+2:\r\n if k%2!=0:\r\n totalon+=a[k]-a[k-1]\r\n b[k]=totalon\r\n else:\r\n b[k]=b[k-1]\r\n k+=1\r\ntotal=b[n+1]\r\nk=1\r\nwhile k<n+2:\r\n if a[k]-a[k-1]>1:\r\n if k%2!=0:\r\n total=max(total,b[k]+M-a[k]-(b[n+1]-b[k])-1 )\r\n else:\r\n total=max(total,b[k]+M-a[k]-(b[n+1]-b[k])+a[k]-a[k-1]-1)\r\n k+=1\r\nprint(total)", "n,m=map(int,input().split())\r\ntimes=[0]+list(map(int,input().split()))+[m]\r\na=to=s=0\r\nfor i in range(1,len(times),2):\r\n to+=times[i]-times[i-1]\r\na=to\r\nfor i in range(2,len(times),2):\r\n s+=times[i-1]-times[i-2]\r\n if times[i]>times[i-1]+1:\r\n t=to-s\r\n a=max(a,s+m-times[i-1]-t-1)\r\nprint(a)", "n,m=map(int,input().split())\r\ntime,ist=0,[0]+[int(x) for x in input().split()]+[m]\r\nfor a in range(1,n+1,2):\r\n time+=ist[a+1]-ist[a]\r\ndic={0:time+ist[1]-ist[0]-1}\r\nfor b in range(1,n+1):\r\n dic[b]=dic[b-1]+[0,ist[b+1]+ist[b-1]-2*ist[b]][b%2==0]\r\nprint(max({m-time}|set(dic.values())))", "n,M = map(int,input().split())\r\na = [0] + list(map(int,input().split())) + [M]\r\ndelta = [a[i+1] - a[i] for i in range(n+1)]\r\n\r\nsign = 2 * (n & 1) - 1\r\nans = 0\r\ntemp = 0\r\n\r\nfor i in range(n,-1,-1):\r\n temp += sign * delta[i]\r\n sign = -sign\r\n if delta[i] > 1:\r\n ans = max(ans,2*(temp+sign))\r\n\r\nprint((M+ans-temp) // 2)\r\n\r\n\r\n", "A = lambda: map(int, input().split())\r\nn, m = A()\r\nlist1 = [0, *A(), m]\r\nlist_total_before = [x-y for x,y in zip(list1[1:],list1)]\r\nans = sum(list_total_before[::2])\r\ntotal_time = ans\r\ns = 0\r\nfor a in range(2,len(list1),2):\r\n s += list1[a - 1] - list1[a - 2]\r\n if list1[a] > list1[a - 1] + 1:\r\n t = total_time - s\r\n ans = max(ans, s + m - list1[a - 1] - t - 1)\r\nprint(ans)\r\n# A = lambda: map(int, input().split())\r\n# n, m = A()\r\n# list1 = [0, *A(), m]\r\n# choice_list = []\r\n# ans_list = []\r\n# total_before = 0\r\n#\r\n# if len(list1) % 2 == 0:\r\n# for i in range(len(list1)):\r\n# if i % 2 == 0:\r\n# total = list1[i+1] - list1[i]\r\n# total_before += total\r\n# if list1[i+1]+1 not in list1:\r\n# choice_list.append(list1[i+1]+1)\r\n# if list1[i+1]-1 not in list1:\r\n# choice_list.append(list1[i+1]-1)\r\n# ans_list.append(total_before)\r\n# for i in choice_list:\r\n# total_after = 0\r\n# list2 = list1[:]\r\n# list2.append(i)\r\n# list2.sort()\r\n# for j in range(len(list2)):\r\n# if j == len(list2) - 1:\r\n# break\r\n# if j % 2 == 0:\r\n# total1 = list2[j + 1] - list2[j]\r\n# total_after += total1\r\n# ans_list.append(total_after)\r\n#\r\n# else:\r\n# for i in range(len(list1)):\r\n# if i == len(list1) - 1:\r\n# break\r\n# if i % 2 == 0:\r\n# total = list1[i+1]-list1[i]\r\n# total_before += total\r\n# if list1[i + 1] + 1 not in list1:\r\n# choice_list.append(list1[i + 1] + 1)\r\n# if list1[i + 1] - 1 not in list1:\r\n# choice_list.append(list1[i + 1] - 1)\r\n# ans_list.append(total_before)\r\n# for i in choice_list:\r\n# total_after = 0\r\n# list2 = list1[:]\r\n# list2.append(i)\r\n# list2.sort()\r\n# for j in range(len(list2)):\r\n# if j % 2 == 0:\r\n# sum1 = list2[j + 1] - list2[j]\r\n# total_after += sum1\r\n# ans_list.append(total_after)\r\n# print(max(ans_list))\r\n\r\n\r\n\r\n", "m,n=map(int,input().split())\r\na=[0]+[int(x) for x in input().split()]+[n]\r\ns=k=t=0\r\nfor i in range(1,len(a),2):\r\n ti=a[i]-a[i-1]\r\n t+=ti\r\ns=t\r\nfor i in range(2,len(a),2):\r\n k+=a[i-1]-a[i-2]\r\n if a[i]>a[i-1]+1:\r\n ki=t-k\r\n s=max(s,k+n-a[i-1]-1-ki)\r\nprint(s)", "#罗景轩2300012610\r\nn, M = map(int, input().split())\r\nA = [0] + list(map(int, input().split())) + [M]\r\nB = [0] *(n + 2)\r\nf = 1\r\n\r\nfor i in range(1, n + 2):\r\n B[i] = B[i - 1] + f *(A[i] - A[i - 1])\r\n f ^= 1\r\nans = B[n + 1]\r\n\r\nfor i in range(1, n + 2):\r\n if A[i] - A[i - 1] > 1:\r\n if i & 1:\r\n pass\r\n else:\r\n ans = max(ans , B[i] - A[i - 1] - 1 + M - (B[n + 1] - B[i]))\r\nprint(ans)", "n, M = map(int, input().split())\r\nprog_init = [0]+list(map(int, input().split()))+[M]###个数为n+2\r\ninterval = []\r\nfor i in range(0, n+1):\r\n\tinterval.append(prog_init[i+1]-prog_init[i])\r\nlist_1 = [0] + [-1]*(n+1)\r\nfor i in range(1, n+2):\r\n\tif i%2 == 1:\r\n\t\tlist_1[i] = list_1[i-1]+interval[i-1]\r\n\telse:\r\n\t\tlist_1[i] = list_1[i-1]\r\ninterval_reversed = interval[-1::-1]\r\nif n%2 == 1:\r\n\tsign = 0\r\nelse:\r\n\tsign = 1\r\ntotal_pos = list_1[-1]\r\nlist_neg = [0] + [-1]*(n+1)\r\nfor i in range(1, n+2):\r\n\tif i%2 == sign:\r\n\t\tlist_neg[i] = list_neg[i-1]\r\n\telse:\r\n\t\tlist_neg[i] = list_neg[i-1]+interval_reversed[i-1]\r\nlist_neg.reverse()\r\nlist_record = [total_pos]\r\nfor i in range(0, n+1, 2):\r\n\tif prog_init[i+1]-prog_init[i] == 1:\r\n\t\tcontinue\r\n\ttime_to_record = list_1[i+1]-1+list_neg[i+1]\r\n\tlist_record.append(time_to_record)\r\nfor i in range(1, n+1, 2):\r\n\tif prog_init[i+1]-prog_init[i] == 1:\r\n\t\tcontinue\r\n\ttime_to_record = list_1[i]+list_neg[i]-1\r\n\tlist_record.append(time_to_record)\r\noutput = max(list_record)\r\nprint(output)\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split()) \r\na = [0] + [int(x) for x in input().split()] + [m] \r\ntot = ans = s = 0 \r\nfor i in range(1, len(a), 2): \r\n tot += a[i] - a[i-1] \r\nans = tot #总开灯时间 \r\nfor i in range(2, len(a), 2): \r\n s += a[i-1] - a[i-2] \r\n if a[i] > a[i-1] + 1:\r\n t = tot -s\r\n ans = max(ans, s + m-a[i-1]-t - 1)\r\nprint(ans)", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr.append(m)\r\non_time=[0]*(n+1)\r\non_time[n]=0\r\nfor i in range(n-1,-1,-1):\r\n if i%2:\r\n on_time[i]=on_time[i+1]+arr[i+1]-arr[i]\r\n else:\r\n on_time[i]=on_time[i+1]\r\nMax=max(0,-1+m-arr[0]-2*on_time[0])\r\nfor i in range(1,n):\r\n tmp=0\r\n if i%2:\r\n tmp=arr[i]-arr[i-1]-1\r\n else:\r\n tmp=-1\r\n tmp+=m-arr[i]-on_time[i]-on_time[i]\r\n Max=max(tmp,Max)\r\nprint(arr[0]+on_time[0]+Max)", "n, M = map(int, input().split())\r\nt0 = t1 = t = 0\r\ns =[0] + [int(x) for x in input().split()] + [M]\r\nfor i in range(1,len(s),2):\r\n t0 += s[i] - s[i-1]\r\n ans = t0\r\nfor i in range(2,len(s),2):\r\n t1 += s[i-1] - s[i-2]\r\n if s[i] > s[i-1] + 1:\r\n t = t0 - t1\r\n t2 = M - s[i-1] -t -1\r\n ans = max(ans, t1 + t2)\r\nprint(ans)", "n,m=(int(x) for x in input().split())\r\ns=[0]+[int(x) for x in input().split()]+[m]\r\nans=ont=tot=0\r\nfor i in range(1,n+2,2):\r\n tot+=s[i]-s[i-1]\r\nans=tot \r\nfor i in range(2,n+2,2):\r\n ont+=s[i-1]-s[i-2]\r\n if s[i]-s[i-1]>1:\r\n new=ont+m-s[i-1]-(tot-ont)-1\r\n ans=max(ans,new)\r\nprint(ans)\r\n ", "n,m=map(int,input().split())\na=[0]+[int(x) for x in input().split()]+[m]\nb=[0]*(n+2)#每个点的开灯时间\nf=1#判断开关\nfor i in range(1,n+2):\n b[i]=b[i-1]+f*(a[i]-a[i-1])\n f^=1#异或运算，把1变0，0变1,这样就实现了交替\nans=b[n+1]\n\nfor i in range(1,n+2):\n if a[i]-a[i-1]>1:#可以改变灯的程序\n if i%2:#这个有数学公式可寻，见平板上的笔记（计概）\n ans=max(ans,b[i]+m-a[i]-1-(b[n+1]-b[i]))\n else:\n ans=max(ans,b[i]+a[i]-a[i-1]-1+m-a[i]-(b[n+1]-b[i]))\n\nprint(ans)", "n,M=[int(i) for i in input().split()]\r\na=[0]+[int(i) for i in input().split()]\r\na.append(M)\r\nb=[a[i+1]-a[i] for i in range(1,n+1,2)]\r\nx=0\r\nt=l=sum(b)\r\nfor i in range(len(b)):\r\n if b[i]!=1:\r\n m=2*t-1-M+a[2*i+1]\r\n x=max(m,x)\r\n t=t-b[i]\r\nprint(M-l+x)", "n,M = map(int,input().split())\r\nai = list(map(int,input().split()))\r\nif len(ai)%2 ==0:\r\n ai.append(M)\r\nprot = {}\r\nttn = 0\r\nprot[ai[0]] = ai[0]\r\nfor x in range(1,len(ai)):\r\n if x%2 ==1:\r\n prot[ai[x]] = prot[ai[x-1]]\r\n else:\r\n prot[ai[x]] = (prot[ai[x-1]]+ai[x]-ai[x-1])\r\nallt = set()\r\nallt.add(prot[ai[-1]])\r\n\r\nfor y in range(len(ai)-1):\r\n if ai[y]+1>=M or ai[y]+1 == ai[y+1]:\r\n continue\r\n else:\r\n if y%2 ==0:\r\n pt = prot[ai[y]]+(M-ai[y]-1)-(prot[ai[-1]]-prot[ai[y]])\r\n allt.add(pt)\r\n else:\r\n pt = prot[ai[y-1]]+1 + (M-ai[y]-1)-(prot[ai[-1]]-prot[ai[y]]-1)\r\n allt.add(pt)\r\nif ai[-1]+1<=M:\r\n pt = prot[ai[-1]]+M-ai[-1]-1\r\n allt.add(pt)\r\nprint(max(allt))", "n,M = map(int, input().split())\r\na = [0] + [int(x) for x in input().split()] + [M]\r\ntot = on = pre = 0\r\nfor i in range(1,len(a),2):\r\n tot += a[i]-a[i-1]\r\non = tot\r\nfor j in range(2,len(a),2):\r\n pre += a[j-1]-a[j-2]\r\n if a[j]>a[j-1]+1:\r\n t = tot - pre\r\n on = max(on,pre+M-a[j-1]-t-1)\r\nprint(on)", "n, m = map(int, input().split())\r\nls = [0] + list(map(int, input().split())) + [m]\r\non = off = 0\r\nadd = [0]\r\nif n % 2:\r\n for i in range(n // 2 + 1):\r\n on += ls[2*i + 1] - ls[2*i]\r\n off += ls[2*i + 2] - ls[2*i + 1]\r\n raw_on = on\r\n for i in range(n // 2 + 1):\r\n on -= ls[2*i + 1] - ls[2*i]\r\n if ls[2*i + 2] - ls[2*i + 1] > 1:\r\n add.append(off - on - 1)\r\n off -= ls[2*i + 2] - ls[2*i + 1]\r\nelse:\r\n on = ls[1]\r\n for i in range(n // 2):\r\n on += ls[2*i + 3] - ls[2*i + 2]\r\n off += ls[2*i + 2] - ls[2*i + 1]\r\n raw_on = on\r\n for i in range(n // 2):\r\n on -= ls[2*i + 1] - ls[2*i]\r\n if ls[2*i + 2] - ls[2*i + 1] > 1:\r\n add.append(off - on - 1)\r\n off -= ls[2*i + 2] - ls[2*i + 1]\r\nprint(raw_on + max(add))", "n , M = map(int, input().split())\r\nlis = [0] + [int(x) for x in input().split()] + [M]\r\nlighti = 0\r\nluda = [0]*(n+2)\r\n\r\nfor i in range(1,n+2,2):\r\n lighti += lis[i] - lis[i-1]\r\n luda[i] = lighti\r\n \r\nfor j in range(1,n+1,2):\r\n if lis[j+1] - lis[j] > 1:\r\n afterpenetrate = 2*luda[j] - 1 + M - lis[j] -luda[i] \r\n if afterpenetrate > lighti:\r\n lighti = afterpenetrate\r\n \r\nprint(lighti)", "\"\"\"\r\nparameter input\r\n\"\"\"\r\nn, M = map(int, input().split())\r\nprog_init = [0]+list(map(int, input().split()))+[M]###load critical points\r\ninterval = []\r\nfor i in range(0, n+1):\r\n ###calculate the intercal between critical points\r\n interval.append(prog_init[i+1]-prog_init[i])\r\n\"\"\"\r\nlist_1 records the light-up time to the left of each critical point\r\n\"\"\"\r\nlist_1 = [0] + [-1]*(n+1)\r\nfor i in range(1, n+2):\r\n\tif i%2 == 1:\r\n\t\tlist_1[i] = list_1[i-1]+interval[i-1]\r\n\telse:\r\n\t\tlist_1[i] = list_1[i-1]\r\ntotal_pos = list_1[-1]###total_pos is the light-up time of the initial program\r\n\"\"\"\r\nlist_neg records the light-off time to the right of each critical point\r\n\"\"\"\r\nlist_neg = [0] + [-1]*(n+1)\r\ninterval_reversed = interval[-1::-1]\r\n###sign marks lights's status in the last interval\r\nif n%2 == 1:\r\n\tsign = 0\r\nelse:\r\n\tsign = 1\r\nfor i in range(1, n+2):\r\n\tif i%2 == sign:\r\n\t\tlist_neg[i] = list_neg[i-1]\r\n\telse:\r\n\t\tlist_neg[i] = list_neg[i-1]+interval_reversed[i-1]\r\nlist_neg.reverse()\r\n\"\"\"\r\nlist_record records the max light-up time\r\nafter the operation with n each operatable interval\r\n\"\"\"\r\nlist_record = [total_pos]\r\nfor i in range(0, n+1, 2):\r\n\tif prog_init[i+1]-prog_init[i] == 1:\r\n\t\tcontinue\r\n\ttime_to_record = list_1[i+1]-1+list_neg[i+1]\r\n\tlist_record.append(time_to_record)\r\nfor i in range(1, n+1, 2):\r\n\tif prog_init[i+1]-prog_init[i] == 1:\r\n\t\tcontinue\r\n\ttime_to_record = list_1[i]+list_neg[i]-1\r\n\tlist_record.append(time_to_record)\r\noutput = max(list_record)\r\n\"\"\"\r\noutput\r\n\"\"\"\r\nprint(output)\r\n\r\n\r\n\r\n\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Oct 23 11:39:39 2022\n\n@author: calvinzhu\n\"\"\"\n\n\n\n\n\nn,m = [int(x) for x in input().split(\" \")]\n\nswitch = [int(x) for x in input().split(\" \")]+[0]+[m]\nswitch.sort()\n\nmaxtime = 0\nontime = 0\nbefore = 0\n\nfor i in range(1,len(switch),2):\n ontime += switch[i] - switch[i-1]\nmaxtime = ontime\n\nfor i in range(2,len(switch),2):\n before += switch[i-1] - switch[i-2]\n if switch[i]>switch[i-1]+1:\n after = ontime - before\n maxtime = max(maxtime, before+m-switch[i-1]-after-1)\n \nprint(maxtime)\n \n \n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Oct 16 16:27:20 2022\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\nn,M=map(int, input().split())\r\narray=list(map(int, input().split()))\r\ngap=[array[0]]\r\nfor i in range(n-1):\r\n gap.append(array[i+1]-array[i])\r\ngap.append(M-array[-1])\r\ngap_1=gap[::2]\r\ngap_2=gap[1::2]\r\nsumming_1=[gap_1[0]]\r\nfor i in range(len(gap_1)-1):\r\n summing_1.append(summing_1[i]+gap_1[i+1])\r\nsumming_2=[gap_2[0]]\r\nfor i in range(len(gap_2)-1):\r\n summing_2.append(summing_2[i]+gap_2[i+1])\r\nt=max(summing_1[-1],summing_1[0]+summing_2[-1]-1)\r\nfor j in range(1,len(gap_2)):\r\n t=max(t, summing_1[j]+summing_2[-1]-summing_2[j-1]-1)\r\nprint(t)", "f = 1\r\nn, M = map(int,input().split())\r\na=[0]+list(map(int, input().split()))+[M]\r\nb=[0]*(n+2)\r\nfor i in range(1,n+1):\r\n b[i]=b[i-1]+f*(a[i]-a[i-1])\r\n f^=1\r\nb[n+1]=b[n]+f*(M-a[n])\r\nc=b[n+1]\r\nfor i in range(1,n+2):\r\n if a[i]-a[i-1]>1:\r\n if i%2:\r\n c=max(c,b[i]+M-a[i]-(a[n+1]-b[i])-1)\r\n else:\r\n c=max(c,b[i]+a[i]-a[i-1]-1+M-a[i]-(b[n+1]-b[i]))\r\nprint(c)", "n,M=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.append(0);a.append(M);a.sort()\r\np=[0]*(n+2);q=[0]*(n+2);r=[0]*(n+2)\r\nfor i in range(1,n+2):\r\n if i%2==1:\r\n r[i]=r[i-1]+a[i]-a[i-1]\r\n else:r[i]=r[i-1]\r\n if q[i-1]==0:\r\n if i%2==1:\r\n p[i]=p[i-1]+a[i]-a[i-1]\r\n elif a[i]-a[i-1]>1:\r\n p[i]=p[i-1]+a[i]-a[i-1]-1;q[i]=1\r\n else:p[i]=p[i-1]\r\n else:\r\n if i%2==0:\r\n p[i]=p[i-1]+a[i]-a[i-1];q[i]=1\r\n else:\r\n w=r[i]\r\n t=r[i-1]+a[i]-a[i-1]-1\r\n f=p[i-1]\r\n p[i]=max(w,t,f)\r\n if w>t and w>f:pass\r\n else:q[i]=1 \r\nprint(p[n+1])", "n,M = map(int,input().split())\r\na = [0] + [int(x) for x in input().split()] + [M]\r\nt = s = 0\r\nfor i in range(1,n+2,2):\r\n t += a[i]-a[i-1]\r\nans = t\r\nfor j in range(2,n+2,2):\r\n s += a[j-1]-a[j-2]\r\n time = t-s\r\n ans = max(ans, M-a[j-1]+s-1-time)\r\nprint(ans)", "n,M=map(int,input().split())\r\ncheck=[0 for _ in range(n+1)]\r\nfor _ in range(1,n+1,2):\r\n check[_]=1\r\ncheck=list(reversed(check))\r\nans,on,off=0,0,0\r\nlst=[M]+list(map(int,input().split()))+[0]\r\nlst.sort(reverse=True)\r\nfor i in range(n+1):\r\n x,y=off-on-1,off-on+lst[i]-lst[i+1]-1\r\n if check[i]==0:\r\n ans=max(ans,x)\r\n on+=(y-x)\r\n elif check[i]==1:\r\n ans=max(ans,y)\r\n off+=(y-x)\r\nprint(on+ans)", "n,m = [int(x) for x in input().split(\" \")]\r\nali = [0]+[int(x) for x in input().split(\" \")]+[m]\r\nup = 0\r\nfor i in range(0,n,2):\r\n up += ali[i+1]-ali[i]\r\nif n%2 == 0:\r\n up += ali[n+1]- ali[n]\r\noff = m -up\r\nmaxi = up\r\nlup = 0\r\nrof = off\r\nfor k in range(1,n+1,2):\r\n lup = lup + ali[k] - ali[k-1]\r\n if ali[k]-ali[k-1] != 1 or ali[k+1]-ali[k] != 1:\r\n h = lup+rof-1\r\n if h>maxi:\r\n maxi = h\r\n rof = rof - ali[k + 1] + ali[k]\r\nprint(maxi)", "n,m=map(int,input().split())\r\nswi=[0]+list(map(int,input().split()))+[m]\r\non=0\r\nfor i in range(1,n+2,2):\r\n on+=swi[i]-swi[i-1]\r\non_bef=0\r\nalt=0\r\ntim=0\r\nfor j in range(2,n+2,2):\r\n on_bef+=swi[j-1]-swi[j-2]\r\n alt=2*on_bef-swi[j-1]-1+m-on\r\n tim=max(on,alt,tim)\r\nprint(tim)", "#import sys\r\n#input = sys.stdin.readline\r\nimport heapq\r\nt = 1\r\nfor i in range(t):\r\n n,m = map(int, input().split())\r\n a = [int(i) for i in input().split()]\r\n a.append(m)\r\n on = [0]\r\n off = [0]\r\n b = [a[n - i] for i in range(n+1)]\r\n b.append(0)\r\n for i in range(n + 1):\r\n if i % 2 == 0:\r\n x = on[-1]\r\n y = off[-1]\r\n on.append(y + b[i] - b[i + 1])\r\n off.append(x )\r\n else:\r\n x = on[-1]\r\n y = off[-1]\r\n on.append(y + b[i] - b[i + 1])\r\n off.append(x)\r\n on.reverse()\r\n off.reverse()\r\n b.reverse()\r\n #print(on,off,b)\r\n ans = on[0]\r\n bestpoint = -1\r\n pred = [0]\r\n for i in range(n+1):\r\n if i % 2 == 0:\r\n pred.append(pred[-1] + b[i + 1] - b[i])\r\n else:\r\n pred.append(pred[-1])\r\n #print(pred)\r\n for i in range(n + 1):\r\n #print(b[i])\r\n if b[i + 1] - b[i] > 1:\r\n point = b[i] + 1\r\n tryans = pred[i]\r\n if i % 2 == 0:\r\n tryans += point - b[i]\r\n tryans += on[i+1]\r\n else:\r\n tryans += b[i + 1] - point + off[i + 1]\r\n #print(point,tryans)\r\n if tryans > ans:\r\n ans = tryans\r\n bestpoint = point\r\n point = b[i + 1] - 1\r\n tryans = pred[i]\r\n if i % 2 == 0:\r\n tryans += point - b[i]\r\n tryans += on[i+1]\r\n else:\r\n tryans += b[i + 1] - point + off[i + 1]\r\n #print(point,tryans)\r\n if tryans > ans:\r\n ans = tryans\r\n bestpoint = point\r\n print(ans)\r\n \r\n \r\n ", "def lol(x):\r\n s = 0\r\n for i in range(0,len(x) - 1,2):\r\n s += x[i + 1] - x[i]\r\n return s\r\n\r\nn, m = [int(i) for i in input().split()]\r\nl = [0] + [int(i) for i in input().split()] + [m]\r\nc = tot = lol(l)\r\nt = 0\r\nfor i in range(1,n + 1,2):\r\n t += l[i] - l[i - 1]\r\n if l[i] - l[i - 1] == l[i + 1] - l[i] == 1: continue\r\n k = tot - t\r\n y = t - 1 + m - l[i] - k\r\n c = max(y,c)\r\nprint(c)", "n,M=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.append(0)\r\na.append(M)\r\na.sort()\r\nl=[]\r\nfor i in range(0,len(a)-1,1) :\r\n l.append(a[i+1]-a[i])\r\nlight=0\r\nfor i in range(0,-(-len(l)//2),1) :\r\n light=light+l[2*i]\r\nif len(l)%2==0 :\r\n l.append(0)\r\ndelta=0\r\ns=[]\r\nfor j in range(0,len(l)-1,2) :\r\n delta=delta-l[-j-1]+l[-j-2]\r\n s.append(delta)\r\ns.sort()\r\nif s[-1]>0 :\r\n print(light + s[-1] - 1)\r\nelse :\r\n print(light)", "n,e=map(int,input().split( ))\r\na=[0]+[int(x) for x in input().split( )]+[e]\r\nb=[0]*(n+2)\r\n#储存每个ai前的时间，并且同时记录下原程序的时间\r\nf=1#为了后面方便在分别遍历到奇数和偶数时的不同取值\r\nfor i in range(1,n+2):\r\n b[i]=b[i-1]+f*(a[i]-a[i-1])\r\n f^=1\r\n#由于后面记录的开灯时间比前面只会大不会小\r\nans=b[n+1]\r\n#开始进行插入操作，由分析可知在 关灯时间点+1 的时间点插入是最可能得到最大值的，所以只需要管在关灯时间操作就行\r\nfor j in range(1,n+2):\r\n if a[j]-a[j-1]>1:\r\n if j&1:#如果j是奇数的意思\r\n pass\r\n else:\r\n ans=max(ans,b[j-1]+a[j]-a[j-1]-1+e-a[j]-(b[n+1]-b[j]))\r\n\r\nprint(ans)", "n,m=map(int,input().split())\r\nn+=1\r\nlist1=list(map(int,input().split()))\r\nlist1.append(m)\r\ndict1={0:list1[0]}\r\ndict2={n-1:0}\r\nfor i in range(1,n):\r\n if i%2==1:\r\n dict1[i]=dict1[i-1]\r\n else:\r\n dict1[i]=dict1[i-1]+list1[i]-list1[i-1]\r\nfor i in range(n-2,-1,-1):\r\n if i%2==0:\r\n dict2[i]=dict2[i+1]+list1[i+1]-list1[i]\r\n else:\r\n dict2[i]=dict2[i+1]\r\na=dict1[n-1]\r\nfor x in range(n-1):\r\n if list1[x+1]-list1[x]>1:\r\n if x%2==0:\r\n b=dict1[x]+dict2[x+1]+list1[x+1]-list1[x]-1\r\n else:\r\n b=dict1[x]+dict2[x+1]+1\r\n a=max(a,b)\r\nprint(a)", "def light_time(L,M):\r\n '''L is the triger listbetween 0 and M,len=n,\r\n i=the ith operation,i=1,2...n+1'''\r\n l=[0]+L\r\n n=len(L)\r\n time=[0]\r\n for i in range(1,n,2):\r\n time+=[time[i-1]+l[i]-l[i-1]]*2\r\n if n%2==0:\r\n return time+[time[n]+M-l[n]]\r\n else:\r\n return time+[time[n-1]+l[n]-l[n-1]]*2\r\n\r\n\r\ndef inser(i,time,A):\r\n 'A=[0,ai,M],time is the result of light_time'\r\n 'i=the ith operation,i=1,2...n+1'\r\n if A[i]-A[i-1]==1:\r\n return 0\r\n else:\r\n if i%2==0:\r\n x=time[i]+A[i]-A[i-1]-1+A[n+1]-A[i]-(time[n+1]-time[i]) \r\n else:\r\n x=time[i]-1+A[n+1]-A[i]-(time[n+1]-time[i])\r\n return x\r\n\r\nif __name__=='__main__':\r\n n,M=(int(j) for j in input().split())\r\n La=[int(j) for j in input().split()]\r\n timelist=light_time(La,M)\r\n A=[0]+La+[M]\r\n x=timelist[n+1]\r\n for i in range(1,n+2):\r\n xx=inser(i,timelist,A)\r\n if xx>x:\r\n x=xx\r\n print(x)\r\n \r\n ", "n,m=map(int,input().split())\r\nlis=[0]+list(map(int,input().split()))+[m]\r\nans,a=0,0\r\nfor i in range(n+1):\r\n if i%2==0:\r\n ans+=lis[i+1]-lis[i]\r\nmaxi=ans\r\nfor i in range(n+1):\r\n if i%2==0:\r\n a+=lis[i+1]-lis[i]\r\n b=maxi-a\r\n ans=max(ans,a+m-lis[i+1]-b-1)\r\nprint(ans)", "n, M = map(int, input().split())\nprog_init = list(map(int, input().split()))\nprog_init.insert(0, 0)\nprog_init.append(M)###个数为n+2\ninterval = []\nfor i in range(0, n+1):\n\tinterval.append(prog_init[i+1]-prog_init[i])\nlist_1 = [0] + [-1]*(n+1)\nfor i in range(1, n+2):\n\tif i%2 == 1:\n\t\tlist_1[i] = list_1[i-1]+interval[i-1]\n\telse:\n\t\tlist_1[i] = list_1[i-1]\ninterval_reversed = interval[-1::-1]\nif n%2 == 1:\n\tsign = 0\nelse:\n\tsign = 1\ntotal_pos = list_1[-1]\nlist_neg = [0] + [-1]*(n+1)\nfor i in range(1, n+2):\n\tif i%2 == sign:\n\t\tlist_neg[i] = list_neg[i-1]\n\telse:\n\t\tlist_neg[i] = list_neg[i-1]+interval_reversed[i-1]\nlist_neg.reverse()\nlist_record = [total_pos]\nfor i in range(0, n+1, 2):\n\tif prog_init[i+1]-prog_init[i] == 1:\n\t\tcontinue\n\ttime_to_record = list_1[i+1]-1+list_neg[i+1]\n\tlist_record.append(time_to_record)\nfor i in range(1, n+1, 2):\n\tif prog_init[i+1]-prog_init[i] == 1:\n\t\tcontinue\n\ttime_to_record = list_1[i]+list_neg[i]-1\n\tlist_record.append(time_to_record)\noutput = max(list_record)\nprint(output)\n\n\n\n\n", "n,M=map(int,input().split())\r\ns=[0]+[int(x) for x in input().split()]+[M]\r\ndd=[0]\r\nnumber=0\r\nnn=0\r\nnnn=0\r\nfor i in range(1,n+2):\r\n if i%2==0:\r\n number+=0\r\n else:\r\n number+=s[i]-s[i-1]\r\n dd.append(number)\r\nmax1=dd[n+1]\r\nfor i in range(1,n+2):\r\n if s[i]-s[i-1]>1:\r\n if dd[i]!=dd[i-1]:\r\n nn=dd[i]-1+M-s[i]-dd[n+1]+dd[i]\r\n else:\r\n nnn=dd[i]-s[i-1]-1+M-dd[n+1]+dd[i]\r\n max1=max(max1,nn,nnn)\r\nprint(int(max1))", "n, m = map(int, input().split())\r\narr = [0]+[int(x) for x in input().split()]+[m]\r\nt = [[], []]\r\nfor i in range(n+1):\r\n t[i % 2].append(arr[i+1]-arr[i])\r\nans = sum(t[0])\r\nif n % 2 == 0:\r\n t[1].append(0)\r\nt[0].append(0)\r\nt[1].append(0)\r\nx = n//2+1\r\nfor i in range(x-2, -1, -1):\r\n t[0][i] += t[0][i+1]\r\n t[1][i] += t[1][i+1]\r\nfor i in range(x):\r\n ans = max(ans, t[0][0]-t[0][i+1]-1+t[1][i])\r\nprint(ans)", "n,M = map(int,input().split())\r\na = [0] + [int(x) for x in input().split()] + [M]\r\ntot = ans = s = 0\r\nfor i in range(1,len(a),2):\r\n tot += a[i] - a[i-1]\r\nans = tot\r\nfor i in range(2,len(a),2):\r\n s += a[i-1] - a[i-2]\r\n if a[i] > a[i-1] + 1:\r\n t = tot - s\r\n ans = max(ans,s+M-a[i-1]-t-1)\r\nprint(ans)", "n, m = map(int, input().split())\na = [0] + list(map(int, input().split())) + [m]\ns, pre = [], []\nfor i in range(1, n + 2):\n s.append(a[i] - a[i - 1])\n\npre.append(s[0])\nfor i in range(1, n + 1):\n pre.append(pre[i - 1] if i % 2 == 1 else s[i] + pre[i - 1])\n\nOpen, Close = [0 for _ in range(n + 1)], [0 for _ in range(n + 1)]\nOpen[n], Close[n] = s[n], 0\nfor i in range(n - 1, 0, -1):\n Open[i] = Close[i + 1] + s[i]\n Close[i] = Open[i + 1]\nres = pre[n]\nfor i in range(0, n + 1):\n t = s[i] - 1 + (pre[i - 1] if i > 0 else 0) + (Close[i + 1] if i + 1 <= n else 0)\n res = max(res, t)\nprint(res)", "n,m = map(int,input().split())\r\nl = [0] + list(map(int,input().split())) + [m]\r\nb = [0]*(n+2)\r\nfor i in range(1,n+2):\r\n\tif i%2:\r\n\t\tb[i] = b[i-1] + l[i] - l[i-1]\r\n\telse:\r\n\t\tb[i] = b[i-1]\r\nt = b[n+1]\r\nfor i in range(1,len(l)):\r\n\tif l[i] - l[i-1] > 1:\r\n\t\tt = max(t,b[i-1] + b[i] + m - l[i-1] - b[n+1] - 1)\r\nprint(t)", "n,m = (int(i) for i in input().split(' '))\r\na =[0] + [int(i) for i in input().split(' ')] + [m]\r\n\r\nlenth = [0]*(n+1) #记录原来程序中每一段亮灯的长度\r\nfor i in range(n+1):\r\n lenth[i] = a[i+1] - a[i]\r\n \r\noutput =[] #记录最终开灯总时间\r\n#不插入的情况\r\ntime = 0\r\nfor i in range(0,n+1,2):\r\n time += lenth[i]\r\noutput.append(time)\r\n\r\nb = [0]*(n+2) \r\ntime = 0 #记录到第i次操作时亮灯时长\r\nfor i in range(1,n+2):\r\n if i % 2 == 1:\r\n time += lenth[i-1]\r\n b[i] = time\r\n else:\r\n b[i] = b[i-1]\r\n\r\nfor i in range(n+1):\r\n if lenth[i] > 1:\r\n time = b[i] + (lenth[i]-1) + (m - a[i+1]) - (b[n+1]-b[i+1])\r\n output.append(time)\r\n else:\r\n output.append(0)\r\nprint(max(output))", "\r\nn , m = map(int , input().split())\r\ns = list(map(int , input().split()))\r\ns.append(m)\r\nt = (n + 1) * [0]\r\nt[0] = s[0]\r\nfor i in range(1 , n+1):\r\n if i % 2 == 0:\r\n t[i] = t[i - 2] + (s[i] - s[i - 1])\r\n if i % 2 != 0:\r\n t[i] = t[i - 1]\r\nans = t[n]\r\nfor i in range(0 , n , 2):\r\n ans = max(ans , t[i] - 1 + m - s[i] - t[n] + t[i])\r\nprint(ans)\r\n", "n, M = map(int, input().split())\r\na = [0]\r\na.extend([int(x) for x in input().split()])\r\nif n % 2 == 0:\r\n a.append(M)\r\n n += 1\r\na.append(M)\r\nton = maxDelta = 0\r\nfor i in range(n, 0, -2):\r\n if (a[i+1]-a[i] > 1) or (a[i]-a[i-1] > 1):\r\n Delta = M-2*ton-a[i]-1\r\n if Delta > maxDelta:\r\n maxDelta = Delta\r\n ton += a[i]-a[i-1]\r\nprint(maxDelta+ton)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 26 16:54:13 2021\r\n\r\n@author: DELL\r\n\"\"\"\r\n\r\nn,m = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\na.append(m) # last time\r\na.append(0) # fir time:a[-1]\r\nl = [0,0] # store time\r\nt = [0,0] # on and off\r\n\r\nfor i in range(n+1):\r\n t[i%2] += a[i] - a[i-1]\r\n l.append(t[i%2])\r\n\r\nmaxi = t[0]\r\nfor i in range(2,n+3):\r\n ans = 0\r\n if l[i] <= 1:\r\n continue\r\n else:\r\n ans += l[i] - l[i-2] - 1 # itself\r\n ans += l[(i-1)//2 *2] # before\r\n ans += t[1] - l[(i-1)//2 *2 +1] # after\r\n if ans > maxi:\r\n maxi = ans\r\n mi = i\r\n\r\nprint(maxi)\r\n", "n,M=map(int,input().split())\r\na=[0]+list(map(int,input().split()))+[M]\r\ntime=0\r\ntotal=0\r\nfor i in range(0,n+1,2):\r\n total+=a[i+1]-a[i]\r\nans=total\r\nfor i in range(0,n+1):\r\n if a[i+1]-a[i]>1:\r\n if i%2==0:\r\n ans=max(ans,time+a[i+1]-a[i]-1+M-a[i+1]-(total-time-a[i+1]+a[i]))\r\n if i%2==1:\r\n ans=max(ans,time+a[i+1]-a[i]-1+M-a[i+1]-(total-time))\r\n time+=(a[i+1]-a[i])*(i%2==0)\r\nprint(ans)", "n,m=map(int,input().split())\r\ns= [0]+[int(x) for x in input().split()]+[m] \r\nans0= a = 0 \r\nlst = [0]\r\nfor i in range(1,n+2,2): \r\n ans0 += s[i] - s[i-1] \r\nfor i in range(2,n+2,2): \r\n a += s[i-1]-s[i-2] \r\n if s[i]-s[i-1]>= 2: \r\n lst.append(a+m-s[i-1]-ans0+a-1) \r\nprint(max(ans0,max(lst)))\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.append(m),a.append(0),a.sort()\r\nlen=list()\r\nsum1=list()\r\nsum2=list()\r\nans=0\r\nlen.append(0),sum1.append(0),sum2.append(0)\r\nfor i in range(1,n+2):\r\n len.append(a[i]-a[i-1])\r\n if i%2==1:\r\n ans+=len[i]\r\nfor i in range(1,n+2):\r\n if i%2==1:\r\n sum1.append(sum1[i-1]+len[i])\r\n sum2.append(sum2[i-1])\r\n else:\r\n sum1.append(sum1[i-1])\r\n sum2.append(sum2[i-1]+len[i])\r\nfor i in range(1,n+2):\r\n if len[i]==1:\r\n continue\r\n cnt=sum1[i-1]+len[i]-1+sum2[n+1]-sum2[i]\r\n ans=max(ans,cnt)\r\nprint(ans)\r\n", "n, M = map(int, input().split(' '))\r\na = [0] + list(map(int, input().split(' '))) + [M]\r\nb = [0] * (n + 2)\r\n\r\n# 构造在每个循环中在1/0之间交替变化的变量\r\nf = 1\r\n# 用递推算出b[1]~b[n + 1]\r\nfor i in range(1, n + 2):\r\n b[i] = b[i - 1] + f * (a[i] - a[i - 1])\r\n f = 1 - f\r\nmaximum = b[n + 1]\r\nfor i in range(1, n + 2):\r\n if a[i] - a[i - 1] > 1:\r\n if i&1:\r\n duration = b[i] + M - a[i] - (b[n + 1]- b[i]) - 1\r\n else:\r\n duration = b[i] + M - a[i] - (b[n + 1] - b[i]) + (a[i] - a[i - 1]) - 1\r\n if duration > maximum:\r\n maximum = duration\r\nprint(maximum)", "n,M=map(int,input().split())\r\na=[0]+[int(n) for n in input().split()]+[M]\r\nf=[0,1]\r\nb=[0]\r\nSUM,ans=0,0\r\nfor i in range(1,n+2):\r\n SUM+=f[i%2]*(a[i]-a[i-1])\r\n b.append(SUM)\r\nfor j in range(1,n+2):\r\n c=2*b[j]+M-b[n+1]-a[j]-1\r\n ans=max(b[n+1],c,ans)\r\nprint(ans)", "n, m = map(int, input().split())\r\na = [0] + list(map(int, input().split())) + [m]\r\nlight = [0] * (n + 2)\r\nfor i in range(1, n + 2):\r\n light[i] = light[i - 1] + (1 - (-1) ** i) * (a[i] - a[i - 1]) // 2\r\nans = light[n + 1]\r\nfor i in range(1, n + 2):\r\n if a[i] - a[i - 1] > 1:\r\n ans = max(ans, light[i - 1] + m - light[n + 1] + light[i] - a[i - 1] - 1)\r\nprint(ans)", "[n,m]=[int(x) for x in input().split()]\r\nl=list(int(x) for x in input().split())\r\nl.append(0)\r\nl.append(m)\r\nl.sort()\r\nlength=len(l)\r\nb=[0]\r\ns=0\r\nfor i in range(1,n+2,2):\r\n s+=l[i]-l[i-1]\r\n b.append(s)\r\n if i!=m:\r\n b.append(s)\r\nfor j in range(n+1):\r\n s1=0\r\n if j%2==0 and l[j+1]-l[j] != 1:\r\n s1=b[j]-(b[-1]-b[j+1])+m-l[j+1]-1\r\n elif j%2==1 and l[j+1]-l[j] != 1:\r\n s1=b[j]-(b[-1]-b[j+1])+m-l[j+1]+l[j+1]-l[j]-1\r\n if s1>=s:\r\n s=s1\r\nprint(s)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 26 16:54:29 2021\r\n\r\n@author: Boush\r\n\"\"\"\r\n\r\nn,m = map(int,input().split())\r\ni = list(map(int,input().split()))\r\na = [0];a.extend(i);a.append(m)\r\nt = []\r\nfor i in range(len(a)-1):\r\n t.append(a[i+1]-a[i])\r\n\r\ndelta = []\r\nif len(t) % 2 == 0:index = 0\r\nelse:index = 1\r\nwhile index < len(t):\r\n if index == 0:\r\n delta.append(t[-1-index]-1)\r\n elif index == 1:\r\n delta.append(t[-1-index]-t[-index]-1)\r\n else:\r\n delta.append(t[-1-index]-t[-index]+delta[-1])\r\n index += 2\r\ndelta.append(0)\r\n\r\nsum_time = 0\r\nfor i in range(0,len(t),2):\r\n sum_time += t[i]\r\nprint (max(delta) + sum_time)", "import re\r\nn,M = map(int, input().split())\r\nprogram = list(map(int, input().split()))\r\nlight_dict= {}\r\nlight, dark = 0,0#记录总亮和总暗\r\n#贪婪算法\r\n#计算在没有加入新的数字之前，灯开启和关闭的时间\r\nfor i in range(n):\r\n if i == 0:\r\n light_dict[str(0)+'light'] = program[i]\r\n light += program[i]\r\n elif i % 2 ==0:\r\n light_dict[str(program[i-1])+'light'] = program[i]-program[i-1]\r\n light += program[i]-program[i-1]\r\n elif i%2 != 0:\r\n light_dict[str(program[i-1])+'dark'] = program[i]-program[i-1]\r\n dark += program[i]-program[i-1]\r\nif n%2 == 0:\r\n light_dict[str(program[n-1])+'light'] = M - program[n-1]\r\n light += M - program[n-1]\r\nelse:\r\n light_dict[str(program[n-1])+'dark'] = M - program[n-1]\r\n dark += M - program[n-1]\r\n#计算加入新的数字或者不加入之后，灯开启和关闭的时间\r\n#找一个点，这个点之后dark-light最大\r\n#这样一个点一定位于dark区，并且就在一个dark的开头\r\nmaxi = 0\r\nmid_dark, mid_light = 0,0\r\nsign_dark, sign_light = 0,0\r\nsign = 0\r\nfor item in light_dict.keys():\r\n if 'light' in item:\r\n mid_light += light_dict[item]\r\n if 'dark' in item:\r\n if (dark - mid_dark - 1) - (light - mid_light) > maxi:\r\n maxi = (dark - mid_dark - 1) - (light - mid_light)\r\n sign = int(re.search(\"\\d+\", item).group())+1#标记加入点的位置\r\n sign_dark = mid_dark#标记加入点之前dark的时间\r\n sign_light = mid_light#标记加入点之前light的时间\r\n mid_dark += light_dict[item]\r\n#转换亮暗\r\nif sign == 0:#如果dark一直比light小，不用加入点\r\n print(light)\r\nelse:\r\n print(sign_light + dark - sign_dark - 1)\r\n \r\n \r\n\r\n\r\n", "n, m = map(int,input().split())\r\nlst = [0]\r\nlst += [int(x) for x in input().split()]\r\nif n % 2 == 0:\r\n lst.append(m)\r\n n += 1\r\nlst.append(m)\r\n\r\ntotal_on = 0\r\nmaxDelta = 0\r\n\r\nfor i in range(n,0,-2):\r\n if lst[i+1] - lst[i] > 1 or lst[i]-lst[i-1] > 1:\r\n Delta = m - 2*total_on - lst[i] - 1\r\n if Delta > maxDelta:\r\n maxDelta = Delta\r\n total_on += lst[i] - lst[i-1]\r\n\r\nans = total_on + maxDelta\r\nprint(ans)", "n,m = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nlength = [a[0]]\r\na.append(m)\r\nfor i in range(n):\r\n length.append(a[i+1]-a[i])\r\n\r\nsume = [length[0]]+[0]*100005\r\nsumo = [0,length[1]]+[0]*100005\r\nssume = length[0]\r\nssumo = length[1]\r\nfor i in range(2,n+1):\r\n if i%2:\r\n sumo[i] = length[i] + sumo[i-2]\r\n ssumo += length[i]\r\n else:\r\n sume[i] = length[i] + sume[i-2]\r\n ssume += length[i]\r\nans = ssume\r\nfor i in range(n+1):\r\n if length[i]>1:\r\n if i%2:\r\n ans = max(ans,sume[i-1]+length[i]-1+ssumo-sumo[i])\r\n else:\r\n if i == 0:\r\n ans = max(ans,sume[i]-1+ssumo)\r\n else:\r\n ans = max(ans,sume[i]-1+ssumo-sumo[i-1])\r\n\r\nprint(ans)", "n, M = map(int, input().split())\r\na = [0]\r\na.extend([int(x) for x in input().split()])\r\nif n % 2 == 0:\r\n a.append(M)\r\n n += 1\r\na.append(M)\r\nb = [0]*(n+1)\r\nfor i in range(n+1):\r\n b[i] = a[i+1]-a[i]\r\nton = maxDelta = 0\r\nfor i in range(n, 0, -2):\r\n if (b[i] > 1) or (b[i-1] > 1):\r\n maxDelta = max(M-2*ton-a[i]-1, maxDelta)\r\n ton += b[i-1]\r\nprint(maxDelta+ton)\r\n", "n,m=map(int,input().split())\r\nt=[0]+list(map(int,input().split()))+[m]\r\nl=[]\r\nopentime=0\r\nfor i in range(n+1):\r\n l.append(t[i+1]-t[i])\r\n if i%2==0:\r\n opentime+=t[i+1]-t[i]\r\nif n%2==1:\r\n l.reverse()\r\n res=0\r\n ans=0\r\n for i in range(n+1):\r\n if i%2==0:\r\n res+=l[i]\r\n else:\r\n res-=l[i]\r\n ans=max(ans,res)\r\n if ans==0:print(opentime)\r\n else:print(ans-1+opentime)\r\nelse:\r\n l.reverse()\r\n res=0\r\n ans=0\r\n for i in range(n+1):\r\n if i%2==0:\r\n res-=l[i]\r\n else:\r\n res+=l[i]\r\n ans=max(ans,res)\r\n if ans==0:print(opentime)\r\n else:print(ans-1+opentime)", "import math\r\nn,m=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nl.append(m)\r\nl.insert(0,0)\r\nde=[(l[i+1]-l[i])*pow(-1,i) for i in range(n+1)]\r\ninsum=0;rsum=0\r\nmn=float(\"inf\")\r\nmnpl=-1\r\nfor i in range(n,-1,-1):\r\n insum=de[i]+insum\r\n rsum+=max(0,de[i])\r\n if insum<mn :\r\n mnpl=i\r\n mn=insum\r\n rmn=rsum\r\nif mn>=0 :\r\n print(rsum)\r\nelse :\r\n print(rsum-mn-1)", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc.insert(0,0);c.append(b)\r\nd=[c[i+1]-c[i] for i in range(a+1)]\r\nm=sum(d[0::2])\r\nif a%2 == 1:\r\n j=c[a+1]-c[a]-1\r\n if j > 0:\r\n m+=j\r\n n=m\r\n for i in range(0,a-1,2):\r\n g=c[a-1-i]*2-c[a-2-i]-c[a-i]\r\n m+=g\r\n if m > n:\r\n n=m\r\nelse:\r\n n=m\r\n m-=1\r\n for i in range(0,a,2):\r\n g=c[a-i]*2-c[a-1-i]-c[a-i+1]\r\n m+=g\r\n if m > n:\r\n n=m\r\nprint(n)", "n,M=[int(x) for x in input().split()]\r\na=[0]+[int(x) for x in input().split()]+[M]\r\n\r\ntime_on=time_after=y=0\r\nfor i in range(1,len(a),2):\r\n time_on+=a[i]-a[i-1]\r\nmax_on=time_on\r\nfor i in range(2,len(a),2):\r\n time_after+=a[i-1]-a[i-2]\r\n if a[i]>a[i-1]+1:\r\n time_before=time_on-time_after\r\n max_on=max(max_on,time_after+M-a[i-1]-time_before-1)\r\nprint(max_on)\r\n", "n, m = map(int, input().split())\r\na = [0] + [int(x) for x in input().split()] + [m]\r\n\r\nb = [0]*(n+2)\r\nf = 1\r\nfor i in range(1,n+2):\r\n b[i] = b[i-1] + f*(a[i] - a[i-1])\r\n f ^= 1\r\n\r\nans = b[n+1]\r\nfor i in range(1,n+2):\r\n if a[i] - a[i-1] > 1:\r\n ans = max(ans, b[i-1] + a[i]-a[i-1]-1 + m-a[i]-(b[n+1]-b[i]))\r\nprint(ans)", "n, M = [int(i) for i in input().split()]\r\na = [0] + [int(i) for i in input().split()] + [M]\r\nlit = [0]* (n + 2)\r\n\r\nsw = 1\r\nfor i in range(1, n + 2):\r\n lit[i] = lit[i - 1] + sw * (a[i] - a[i - 1])\r\n sw = abs(sw - 1)\r\n\r\nans = lit[-1]\r\nfor i in range(1, n + 2):\r\n temp = 0\r\n if i % 2 == 1:\r\n temp = lit[i] - 1 + M - a[i] - (lit[-1] - lit[i])\r\n else:\r\n temp = lit[i] + a[i] - a[i - 1] - 1 + M - a[i] - (lit[-1] - lit[i])\r\n ans = max(ans, temp)\r\nprint(ans)", "n, M = (map(int, input().split()))\r\nplaces = [0] + [int(x) for x in input().split()] + [M]\r\nopenlenth = {}\r\na = []\r\ncloselenth = {}\r\ntimes = []\r\ntime0 = 0\r\nlenth1 = 0\r\nbeforeon = 0\r\nafterclose = 0\r\n\r\nfor i in range(1, n+2, 2):\r\n lenth0 = 0\r\n lenth0 += places[i] - places[i-1]\r\n lenth1 += lenth0\r\n openlenth[i] = lenth0\r\ntimes.append(lenth1)\r\nfor i in range(2, n+2, 2):\r\n lenth0 = 0\r\n lenth0 += places[i] - places[i-1]\r\n afterclose += lenth0\r\n closelenth[i] = lenth0\r\n\r\nfor k in range(1, n+1):\r\n time1 = 0\r\n if k % 2 == 0:\r\n afterclose -= closelenth[k]\r\n else:\r\n beforeon += openlenth[k]\r\n time1 = beforeon + afterclose - 1\r\n times.append(time1)\r\n\r\nprint(max(times))\r\n", "# LUOGU_RID: 136199920\nn, m = map(int, input().split())\r\nlst = [0] + list(map(int, input().split())) + [m]\r\ndiff = []\r\nfor i in range(n + 1):\r\n diff.append(lst[i + 1] - lst[i])\r\n\r\ncnt = sum(diff[: : 2])\r\npre = 0\r\nnxt_odd = sum(diff[1: : 2])\r\nfor i in range(len(diff)):\r\n if diff[i] - 1:\r\n if i % 2:\r\n cnt = max(cnt, pre - 1 + nxt_odd)\r\n else:\r\n cnt = max(cnt, pre + diff[i] - 1 + nxt_odd)\r\n if i % 2:\r\n nxt_odd -= diff[i]\r\n else:\r\n pre += diff[i]\r\n\r\nprint(cnt)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 24 15:58:18 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\nl=[0]+[int(i) for i in input().split()]+[m]\r\ns,ans=0,[0]*(n+2)\r\nfor i in range(1,n+2):\r\n if s==0:\r\n ans[i]=ans[i-1]+l[i]-l[i-1]\r\n s=1\r\n else:\r\n ans[i]=ans[i-1]\r\n s=0\r\nnum=ans[n+1]\r\nfor i in range(1,n+2):\r\n if l[i]-l[i-1]>1 and i&1==0:\r\n num=max(num,ans[i]+m-l[i]-(ans[n+1]-ans[i])+l[i]-l[i-1]-1)\r\nprint(num)", "n,m = map(int,input().split())\r\nx = [0] + list(map(int,input().split())) + [m]\r\ny = [0]*(n+2)\r\nfor i in range(1,n+2):\r\n if i%2 == 1:\r\n y[i] = y[i-1] + x[i] - x[i-1]\r\n else:\r\n y[i] = y[i-1]\r\nans = y[n+1]\r\nfor i in range(1,n+1,2):\r\n if x[i]-x[i-1] > 1 or x[i+1] - x[i] > 1:\r\n ans = max(ans,y[i-1]+m-x[i]-(y[n+1]-y[i])+y[i]-y[i-1]-1)\r\nprint(ans)", "n,M = map(int,input().split())\r\nhi = 1\r\na = [0] +[int(x) for x in input().split()] + [M]\r\n\r\nb = [0]*(n+2)\r\n\r\nfor i in range(1,n+2):\r\n b[i] = b[i-1] + hi*(a[i]-a[i-1])\r\n hi ^= 1\r\n\r\nans = b[n+1]\r\n\r\nfor i in range(1,n+2):\r\n if (a[i]-a[i-1]>1):\r\n if i&1:\r\n pass\r\n else:\r\n ans = max(ans,b[i]+a[i]-a[i-1]-1+M-a[i]-(b[n+1]-b[i]))\r\n\r\nprint(ans)", "def solve():\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n lamps = [0] + a + [m]\r\n dist = [0 for _ in range(len(lamps))]\r\n on_sum = [0 for _ in range(len(lamps))]\r\n back_sum = [0 for _ in range(len(lamps))]\r\n\r\n flag = True\r\n for i in range(1, n + 2):\r\n dist[i] = lamps[i] - lamps[i - 1]\r\n on_sum[i] = on_sum[i - 1] + flag * dist[i]\r\n flag = not flag\r\n\r\n on_off_total = [0, 0]\r\n flag = False\r\n for i in range(n + 1, 0, -1):\r\n on_off_total[flag] += dist[i]\r\n back_sum[i] = on_off_total[flag]\r\n flag = not flag\r\n\r\n max_sum = back_sum[1]\r\n for i in range(1, n + 1):\r\n max_sum = max(max_sum, on_sum[i] - 1 + back_sum[i + 1])\r\n\r\n print(max_sum)\r\nsolve()", "n,M=map(int,input().split())\r\na=[0]+[int(x) for x in input().split()]+[M]\r\nb=[0]*(n+2)\r\nfor i in range(1,n+2):\r\n b[i]=b[i-1]+(a[i]-a[i-1])*(((-1)**(i+1)+1)//2)\r\nans=b[n+1]\r\nfor i in range(1,n+2):\r\n if a[i]-a[i-1]==1:\r\n continue\r\n ans=max(ans,b[i-1]+a[i]-a[i-1]-1+a[n+1]-a[i]-(b[n+1]-b[i]))\r\nprint(ans)", "n , M =map(int,input().split())\r\nm = [i for i in map(int,input().split())]\r\nm.insert(0,0)\r\nm.append(M)\r\ntime = []\r\nop = [m[i] - m[i-1] for i in range(1,len(m),2)]\r\ned = [m[i] - m[i-1] for i in range(2,len(m),2)]\r\nt0 =sum(op)\r\ntime.append(t0)\r\nt = op[0] - 1 +sum(ed[0:])\r\ntime.append(t)\r\nfor i in range(3,len(m)):\r\n if i%2 !=0:\r\n t+=op[i//2] - ed[i//2-1]\r\n time.append(t) \r\nprint(max(time))", "n,m=map(int,input().split())\r\na=[0]+list(map(int,input().split()))+[m]\r\ntime=[a[i+1]-a[i] for i in range(n+1)]\r\non=[0]*(n//2+1)\r\non[0]=time[0]\r\noff=[0]*((n+1)//2)\r\noff[-1]=time[n-1+n%2]\r\nfor i in range(1,n//2+1):\r\n on[i]=on[i-1]+time[2*i]\r\nfor j in range((n+1)//2-2,-1,-1):\r\n off[j]=off[j+1]+time[2*j+1]\r\nans=0\r\nfor i in range((n+1)//2):\r\n ans=max(ans,on[i]+off[i]-1)\r\nprint(max(ans,on[-1]))", "# -*- coding: utf-8 -*-\r\n\r\nn,m=map(int,input().split())\r\ns=list(map(int,input().split()))\r\ns.append(0)\r\ns.append(m)\r\ns.sort()\r\nsum1=[]\r\nsum1n=0\r\nsum2=[]\r\nsum2n=0\r\nflag=True\r\nfor j in range(len(s)-1,0,-1):\r\n if flag:\r\n sum1n=sum1n+s[j]-s[j-1]\r\n sum1.append(sum1n)\r\n flag=False\r\n else:\r\n sum2n=sum2n+s[j]-s[j-1]\r\n sum2.append(sum2n)\r\n flag=True\r\n\r\nacc=[0]*len(s)\r\n\r\nif n%2!=0:\r\n msum=sum2n\r\n sum2.insert(0, 0)\r\n for i in range(len(sum1)):\r\n if (sum1[i]>sum2[i]+1):\r\n msum=max((sum1[i]-sum2[i]+sum2[-1]-1),msum)\r\nelse:\r\n msum=sum1n\r\n for i in range(len(sum2)):\r\n if (sum2[i]>sum1[i]+1):\r\n msum=max((sum2[i]-sum1[i]+sum1[-1]-1),msum) \r\nprint(msum)", "n, M = map(int, input().split())\r\nlt = [0] + [int(x) for x in input().split()] + [M]\r\ntl_t = pr_t = 0 # tl_t means \"total time\"; pr_t means \"previous time\"\r\nfor i in range(1, len(lt), 2):\r\n tl_t += lt[i] - lt[i-1]\r\nlst_t = tl_t # lst_t means \"longest time\"\r\nfor i in range(2, len(lt), 2):\r\n pr_t += lt[i-1] - lt[i-2]\r\n if lt[i] - lt[i-1] > 1:\r\n ler_t = tl_t - pr_t # ler_t means \"later time\"\r\n lst_t = max(lst_t, pr_t + M - lt[i-1] - ler_t - 1)\r\nprint(lst_t)", "n,M = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nmy_lst = [lst[0]] + [lst[i]-lst[i-1] for i in range(1,n)] + [M-lst[-1]]\r\n\r\nodd_lst = [0]*(n+1)\r\neven_lst = [0]*(n+1)\r\neven_lst[0],even_lst[1] = my_lst[0],my_lst[0]\r\nodd_lst[1] = my_lst[1]\r\nfor k in range(2,n+1):\r\n if k % 2 == 0:\r\n even_lst[k] = even_lst[k-2] + my_lst[k]\r\n odd_lst[k] = odd_lst[k-1]\r\n else:\r\n odd_lst[k] = odd_lst[k-2] + my_lst[k]\r\n even_lst[k] = even_lst[k-1]\r\n\r\nodd_total = sum(my_lst[1::2])\r\nmax_time = sum(my_lst[::2])\r\nfor x in range(n+1):\r\n if x % 2 == 0:\r\n max_time = max(max_time,even_lst[x]-1+odd_total-odd_lst[x])\r\n else:\r\n max_time = max(max_time,even_lst[x-1]+odd_total-odd_lst[x-2]-1)\r\nprint(max_time)", "n,M=map(int,input().split())\r\na=[0]+[int(n) for n in input().split()]+[M]\r\nb=[0]\r\nSUM,time=0,0\r\nfor i in range(1,n+2):\r\n SUM+=(i%2)*(a[i]-a[i-1])\r\n b.append(SUM)\r\nfor j in range(1,n+2):\r\n c=2*b[j]+M-b[n+1]-a[j]-1\r\n time=max(b[n+1],c,time)\r\nprint(time)", "f = 1 #switch\r\nn, M = map(int, input().split())\r\na = [0] + [int(x) for x in input().split()] + [M]\r\n \r\nb = [0]*(n+2)\r\n\r\nfor i in range(1,n+2):\r\n b[i] = b[i-1] + f*(a[i]-a[i-1])\r\n f ^= 1 #0->1 or 1->0\r\n \r\nans = b[n+1] #untouched\r\n\r\nfor i in range(1,n+2):\r\n if (a[i]-a[i-1]>1):\r\n if i&1:\r\n # ans = max(ans, b[i]+M-a[i]-(b[n+1]-b[i])-1)\r\n pass\r\n else:\r\n ans = max(ans, b[i]+a[i]-a[i-1]-1+M-a[i]-(b[n+1]-b[i]))\r\n\r\nprint(ans)", "n, m = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\nl = [0] * (n + 2)\r\nflag = True\r\nans = 0\r\n\r\nfor i in range(1, n + 1):\r\n l[i] = l[i - 1] + (flag) * (a[i] - a[i - 1])\r\n flag = not flag\r\n\r\nl[n + 1] = l[n] + (flag) * (m - a[n])\r\nans = l[n + 1]\r\n\r\nfor i in range(1, n + 1):\r\n ans = max(ans, l[i] + m - a[i] - (l[n + 1] - l[i]) - 1)\r\n\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nlist1=[0]+list(map(int,input().split()))\r\n\r\nlist1[0]=[0,0]\r\nlist1[1]=[list1[1],list1[1]]\r\nfor x in range(2,n+1) :\r\n list1[x]=[list1[x],list1[x]-list1[x-1][0]+list1[x-2][1]]\r\n\r\nif n%2==0 :\r\n all=list1[n-1][1]+(m-list1[n][0])\r\nelse :\r\n all=list1[n][1]\r\ni=1\r\nmaxn=all\r\n\r\nwhile i <n :\r\n if (max(list1[i][0]-list1[i-1][0],list1[i+1][0]-list1[i][0])>1) and ((2*list1[i][1]-1+m-list1[i][0]-all)>maxn):\r\n maxn=2*list1[i][1]-1+m-list1[i][0]-all\r\n i+=2\r\n\r\nif i==n and max(list1[i][0]-list1[i-1][0],m-list1[i][0])>1 and (2*list1[i][1]-1+m-list1[i][0]-all)>maxn:\r\n maxn=2*list1[i][1]-1+m-list1[i][0]-all\r\n\r\nprint(maxn)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, t = map(int, input().split())\r\noper = [0] + list(map(int, input().split())) + [t]\r\nbefore = [0] * (n+2)\r\nafter = [0] * (n+2)\r\nfor i in range(n+1):\r\n before[i+1] = ((i+1) % 2) * (oper[i+1]-oper[i]) + before[i]\r\nfor i in range(n+1, 0, -1):\r\n after[i-1] = t - oper[i] - after[i] + oper[i] - oper[i-1]\r\n\r\ntmp = [before[n+1]]\r\nfor i in range(n+1):\r\n lighton = (i+1) % 2\r\n if oper[i+1] == oper[i]:\r\n continue\r\n if lighton:\r\n tmp.append(before[i] + after[i+1] + oper[i+1] - oper[i] - 1)\r\n else:\r\n tmp.append(before[i] + t - oper[i+1] - after[i+1] + oper[i+1] - oper[i] - 1)\r\nprint(max(tmp))\r\n", "n,M=map(int,input().split())\r\nt=[0]+[int(x) for x in input().split()]+[M]\r\non=[]\r\noff=[]\r\nfor i in range(len(t)-1):\r\n a=t[i+1]-t[i]\r\n if i % 2 == 0:\r\n on.append(a)\r\n else:\r\n off.append(a)\r\nk=0\r\not=sum(on)\r\notm=0\r\noftm=sum(off)\r\nfor k in range(len(off)):\r\n otm += on[k]\r\n ot=max(otm+oftm-1, ot)\r\n oftm -= off[k]\r\nprint(ot)", "def max(s,mm):\r\n global M\r\n global m\r\n global l\r\n l+=s[0]\r\n m.append(l)\r\n for i in range(1,len(s),2):\r\n if i+1<=len(s)-1:\r\n l+=s[i+1]-s[i]\r\n m.append(l)\r\n else:\r\n l+=M-s[i]\r\n m.append(l)\r\n mm.append(l)\r\n\r\nn,M=[int(x) for x in input().split()]\r\ns=[int(x) for x in input().split()]\r\nm=[]\r\nl=0\r\nmm=[]\r\nmax(s,mm)\r\nfor i in range(0,n,2):\r\n t=M+2*m[int(i/2)]-s[i]-m[-1]-1\r\n mm.append(t)\r\nmm.sort()\r\nprint(mm[-1])", "n,M = map(int,input().split())\r\nlamp = [0] + list(map(int,input().split())) + [M]\r\nturn_on = turn_off = 0\r\na = []\r\nb = []\r\n\r\nfor i in range(1,n + 2,2):\r\n turn_on += lamp[i] - lamp[i - 1]\r\n a.append(turn_on)\r\n\r\nfor i in range(n,0,-2):\r\n turn_off += lamp[i + n % 2]- lamp[i - 1 + n % 2]\r\n b.append(turn_off)\r\nb.reverse()\r\nif n % 2 == 0:\r\n b.append(0)\r\n\r\nmax = a[-1]\r\nfor i in range(2,n+2,2):\r\n if lamp[i] - lamp[i - 1] != 1:\r\n if max < a[i//2 - 1] + b[i//2 - 1] - 1:\r\n max = a[i//2 - 1] + b[i//2 - 1] - 1\r\nprint(max)", "n,m = map(int, input().split())\r\na = [int(_) for _ in ['0']+input().split()+[str(m)]] # 补上前后的 0 和 m \r\nmax_time = 0\r\nt = [0]\r\ni = 0\r\nwhile i <= n:\r\n tt = a[i+1] - a[i] # t[i] = 到a[i]时已经亮灯的时间，t[0] = 0\r\n t.append(tt+t[-1])\r\n t.append(t[-1]) # t[1] = t[2] = a[1] - a[0];t[3] = t[4] = a[3] - a[2] + a[1] -1[0]\r\n max_time += tt\r\n i += 2\r\n# 提取原先开灯时长\r\n\r\nfor i in range(n+1):\r\n ttt = a[i+1]-a[i]\r\n later_off = m-a[i+1]-(t[n+1]-t[i])\r\n # m-a[i+1]为之后的所有时间，t[n+1]-t[i]为之后的所有开灯时间\r\n # 相减得到之后所有的关灯时间\r\n if ttt == 1: # 无法插入操作\r\n continue\r\n # i 为奇数，此为关灯区间，要开尽可能多就在区间最前面开\r\n # i 为偶数，此为开灯区间，要关尽可能少就在区间最后面关\r\n # 所以不论奇数偶数，此区间改动后最多就是 ttt-1 的时长亮灯\r\n else: \r\n max_time = max(t[i] + later_off + ttt-1 , max_time)\r\nprint(max_time)", "n,m = [int(x) for x in input().split()]\r\na = [0]+[int(x) for x in input().split()]+[m]\r\n#light black light black\r\nlight = [0]\r\nfor i in range(1,n+2):\r\n if i%2 == 0:\r\n light.append(light[-1])\r\n else:\r\n light.append(light[-1]+a[i]-a[i-1])\r\nmaxn = light[-1]\r\nfor i in range(1,n+2):#在第i-1个区间（i个开关前）增加开关\r\n tot = a[i]-a[i-1]-1+light[i-1]+(a[n+1]-a[i]-(light[n+1]-light[i]))\r\n maxn = max(maxn,tot)\r\nprint(maxn)", "n, m = map(int, input().split())\r\na = list(map(int, input().split())) + [m]\r\npart = [a[0]]\r\nfor i in range(1, n + 1):\r\n part.append(a[i] - a[i - 1])\r\n if i % 2 == 0:\r\n a[0] += part[-1]\r\nlightdark = [[a[0], m - a[0]]] + [[0, 0] for i in range(n)]\r\nfor i in range(1, n + 1):\r\n if i % 2 != 0:\r\n lightdark[i][0] = lightdark[i - 1][0] - part[i - 1]\r\n lightdark[i][1] = lightdark[i - 1][1]\r\n else:\r\n lightdark[i][0] = lightdark[i - 1][0]\r\n lightdark[i][1] = lightdark[i - 1][1] - part[i - 1]\r\nbetter = [0] * (n + 1)\r\nfor i in range(n + 1):\r\n if part[i] == 1:\r\n continue\r\n if i % 2 == 0:\r\n differ = lightdark[i][1] + part[i] - 1 - lightdark[i][0]\r\n better[i] = differ if differ > 0 else 0\r\n else:\r\n differ = lightdark[i][1] - 1 - lightdark[i][0]\r\n better[i] = differ if differ > 0 else 0\r\nprint(max(better) + a[0])", "f=1\r\nn,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\na=[0]+x+[m]\r\nb=[0]*(n+2)\r\nfor i in range(1,n+2):\r\n b[i]=b[i-1]+f*(a[i]-a[i-1])\r\n f^=1\r\nans=b[n+1]\r\nfor i in range(1,n+2):\r\n if (a[i]-a[i-1]>1):\r\n if i&1:\r\n pass\r\n else:\r\n ans=max(ans,b[i]+a[i]-a[i-1]-1+m-a[i]-(b[n+1]-b[i]))\r\nprint(ans)", "n, M = map(int, input().split())\r\nop = list(map(int, input().split()))\r\nswitch = 1\r\ntime = [0] * (n+2)\r\n\r\nop.append(0)\r\nop.sort()\r\n\r\nfor i in range(1, n+1):\r\n time[i] += time[i-1] + switch*(op[i]-op[i-1])\r\n switch = 1 - switch\r\n\r\ntime[n+1] = time[n] + switch * (M-op[n])\r\nmaxHour = time[n+1]\r\n\r\nfor i in range(1, n+1):\r\n maxHour = max(maxHour, time[i]+M-op[i]-(time[n+1]-time[i])-1)\r\n\r\nprint(maxHour)", "R=lambda:map(int,input().split());a,b=R();A=[0]+[*R()]+[b];B=[0]\r\nfor i in range(a+1):\r\n B+=[B[-1]]\r\n if i%2==0:B[-1]+=A[i+1]-A[i]\r\nprint(max([2*B[-1]-b+1]+[2*B[i]-A[i]for i in range(1,a+1)])+b-B[-1]-1)", "n,m=map(int,input().split())\r\nl=[0]\r\ng=[0]\r\nl.extend(map(int,input().split()))\r\nl.append(m)\r\nk=[l[2*i+1]-l[2*i] for i in range(n//2+1)]\r\ng.extend([l[2*i]-l[2*i-1] for i in range(1,((n//2+2)if n%2==1 else (n//2+1)))])\r\ns=sum(k)\r\nsm=m-s-1\r\nfor i in range(n//2+1):\r\n if k[i]!=1:\r\n sm+=k[i]-g[i]\r\n if sm>s:\r\n s=sm\r\n continue\r\n if g[i]!=1:\r\n sm+=k[i]-g[i]\r\n if sm>s:\r\n s=sm\r\nprint(s)", "n, m = map(int, input().split())\r\na = [0] + list(map(int, input().split())) + [m]\r\ns = []\r\nt = 0\r\nfor i in range(0, n + 1, 2):\r\n\tt += a[i + 1] - a[i]\r\n\ts.append(t)\r\nt = s[-1]\r\nfor i in range(n//2 + 1):\r\n\tb = a[2 * i + 1]\r\n\tif (b + 1 < m and b + 1 != a[2 * i + 2]) or (b - 1 > 0 and b - 1 != a[2 * i]):\r\n\t\tt = max(t, m - b + 2 * s[i] - s[-1] - 1)\r\n\r\nprint(t)\r\n", "from itertools import*\r\nR=lambda:map(int,input().split())\r\nn,m=R()\r\na=[0,*R()]+[m]*(n%2+1)\r\nd=[x-y for x,y in zip(a[1:],a)]\r\nprint(sum(d[::2])+max(0,max(accumulate(d[i-1]-d[i]for i\r\nin range(n+n%2,0,-2)))-1))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 21 16:33:10 2023\r\n\r\n@author: GaoMingze 2300011427\r\n\"\"\"\r\nn,M=map(int,input().split())\r\nnum=[0]+list(map(int,input().split()))+[M]\r\nok=0\r\nfor i in range(1,n+2,2):\r\n ok+=num[i]-num[i-1]\r\nans=ok\r\ns=0\r\nfor i in range(2,n+2,2):\r\n s+=num[i-1]-num[i-2]\r\n if num[i]-num[i-1]>1:\r\n ans=max(ans,M+2*s-ok-1-num[i-1])\r\nprint(ans)\r\n \r\n \r\n\r\n", "\r\n\r\n\r\n\r\n\r\nfrom itertools import*\r\nR=lambda:map(int,input().split())\r\nn,m=R()\r\na=[0,*R(),m,m]\r\nd=[x-y for x,y in zip(a[1:],a)]\r\nprint(sum(d[::2])+max(1,*accumulate(d[i-1]-d[i]for i in range(n+n%2,0,-2)))-1)\r\n", "n,m=map(int, input().split())\r\nbulbs=[int(x)for x in input().split()]\r\nbulbs=[0]+bulbs+[m]\r\non,off,deta,ans=[],[],[],[]\r\nfor i in range(0,n+1):\r\n deta.append(bulbs[i+1]-bulbs[i])\r\nfor i in range(0,n+1,2):\r\n on.append(deta[i])\r\nfor i in range(1,n+1,2):\r\n off.append(deta[i])\r\nfor i in range(1,len(on)):\r\n on[i]+=on[i-1]\r\nfor i in range(len(off)-1,0,-1):\r\n off[i-1]+=off[i]\r\n#print(on)\r\n#print(off)\r\nfor i in range(min(len(on),len(off))):\r\n ans.append(on[i]+off[i]-1)\r\nans.append(on[-1])\r\nprint(max(ans))", "n,m=map(int, input().split())\r\na=[0]+list(map(int, input().split()))\r\nb=[0]*(n+2)\r\nfor i in range(1,n+1):\r\n if i%2!=0:\r\n b[i]=b[i-1]+a[i]-a[i-1]\r\n else:\r\n b[i]=b[i-1]\r\nif n%2!=0:\r\n b[n+1]=b[n]\r\nelse:\r\n b[n+1]=m-a[n]+b[n]\r\nc=max(b[i]-1+m-a[i]-(b[n+1]-b[i]) for i in range(1,n+1)) \r\nprint(max(c,b[n+1]))", "n, m = map(int, input().split())\r\nlst = [0]\r\nfor a in input().split(): \r\n lst.append(int(a))\r\nlst.append(m)\r\na = [0 for _ in range(n+2)] #on\r\nb = [0 for _ in range(n+2)] #off\r\nfor i in range(1, n+2):\r\n if i % 2 == 0:\r\n a[i] = a[i-1]\r\n b[i] = b[i-1] + lst[i] - lst[i-1]\r\n else:\r\n a[i] = a[i-1] + lst[i] - lst[i-1]\r\n b[i] = b[i-1]\r\n\r\nans = a[n+1]\r\nfor i in range(n+2):\r\n if i == 0:\r\n if lst[i] + 1 != lst[i+1]:\r\n ans1 = 1 + b[n+1] - b[i+1]\r\n if ans1 > ans:\r\n ans = ans1\r\n elif i == n+1:\r\n if lst[i] - 1 != lst[i-1]:\r\n ans1 = a[i] + 2*((i+1)%2) -1\r\n else:\r\n if lst[i] + 1 != lst[i+1] or lst[i] - 1 != lst[i-1]:\r\n ans1 = a[i] + b[n+1] - b[i] + 2*((i+1)%2) -1\r\n if ans1 > ans:\r\n ans = ans1\r\n \r\n\r\nprint(ans)", "n,m=map(int,input().split())\r\ninp=[0,*[int(x) for x in input().split()],m]\r\np=[inp[x]-inp[x-1] for x in range(1,n+2)]\r\na=m-sum(p[::2])\r\nans=m-a\r\nfor i in range(1,n+1,2):\r\n a+=p[i-1]\r\n if p[i]>1:\r\n if a-1>ans:\r\n ans=a-1\r\n a-=p[i]\r\nprint(ans)", "n,M = map(int,input().split())\r\na = [0,*map(int,input().split()),M]\r\nb = [0]\r\n\r\nfor i in range(1,n+2):\r\n b.append(b[i-1] + (a[i]-a[i-1])*(i&1))\r\nans = b[n+1]\r\nfor i in range(1,n+2):\r\n if a[i]-a[i-1] > 1:\r\n x = M - a[i] - (b[n+1]-b[i])\r\n y = -1 if i&1 == 1 else -1+a[i]-a[i-1]\r\n ans = max(ans , b[i]+ x + y)\r\nprint(ans)", "n, M = map(int, input().split())\r\nass = [0] + list(map(int, input().split())) + [M]\r\n\r\nresult = 0\r\np = 0\r\nq = sum(ass[2*k + 1] - ass[2*k] for k in range(int(n/2) + 1))\r\nfor i in range(1, len(ass)):\r\n l = ass[i] - ass[i - 1]\r\n if l > 1:\r\n result = max(result, p + M - ass[i] - q + max(1, l - 1))\r\n if i % 2:\r\n p += l\r\n q -= l\r\nprint(max(p, result))\r\n", "n,M=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.append(0)\r\na.append(M)\r\na.sort()\r\nl=[]\r\nfor i in range(0,len(a)-1,1) :\r\n l.append(a[i+1]-a[i])\r\nlight=0\r\nfor i in range(0,-(-len(l)//2),1) :\r\n light=light+l[2*i]\r\nif len(l)%2==0 :\r\n l.append(0)\r\n delta=0\r\n s=[]\r\n for j in range(0,len(l)-1,2) :\r\n delta=delta-l[-j-1]+l[-j-2]\r\n s.append(delta)\r\n s.sort()\r\n print(light+s[-1]-1)\r\nelse :\r\n delta = 0\r\n s = []\r\n for j in range(0, len(l) - 1, 2):\r\n delta = delta - l[-j - 1] + l[-j - 2]\r\n s.append(delta)\r\n s.sort()\r\n if s[-1]>0 :\r\n print(light + s[-1] - 1)\r\n else :\r\n print(light)", "n,M=[int(x) for x in input().split()]\r\nmmts=[0]+list(map(int,input().split()))+[M,M,M,M]\r\ngaps=[]\r\ntime=[0]*(n+2)\r\nfor x in range(1,n+5):\r\n gaps.append(mmts[x]-mmts[x-1])\r\nnolights=sum(gaps[0:n+4:2]) #no lights\r\nstart=0\r\nendO=sum(gaps[1:n+2:2])\r\nendE=sum(gaps[0:n+2:2])\r\nfor i in range(n+2):\r\n if i%2==0:\r\n endE -= gaps[i]\r\n if gaps[i]!=1:\r\n time[i]=start+gaps[i]-1+endO\r\n else:\r\n time[i]=start+1+endE\r\n start+=gaps[i]\r\n else:\r\n endO -= gaps[i]\r\n if gaps[i]!=1:\r\n time[i]=start+gaps[i]-1+endO\r\n else:\r\n time[i]=start+endE\r\nprint(max(max(time),nolights))", "n,m=map(int, input().split())\r\na,b,t=[0]+[int(i) for i in input('').split()]+[m],[],[]\r\nfor i in range(n+1):\r\n b.append((a[i+1]-a[i])*((-1)**i))\r\nt0,c,d=sum(b[::2]),b.copy(),0\r\nfor i in range(1,n-2,2):\r\n if c[i]+c[i+1]==0:\r\n del b[i-d]\r\n del b[i-d]\r\n d+=2\r\nfor i in range(n+1):\r\n t.append(-sum(b[i:])-1)\r\nprint(t0+max(t+[0]))", "n, M = map(int, input().split())\nm = [0]\nm += map(int, input().split())\nm += [M]\nb = [0]\ns, i = 1, 1\nwhile i <= n + 1:\n c = b[i-1] + s * (m[i] - m[i-1])\n b.append(c)\n if s == 1:\n s = 0\n else:\n s = 1\n i += 1\nans = b[n+1]; i = 1\nwhile i <= n:\n ans = max(ans, b[i]-1+M-m[i]-(b[n+1]-b[i]))\n i += 1\nprint(ans)\n\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[a[0]]+[a[i]-a[i-1] for i in range(1,n)]\r\nb.append(m-a[-1])\r\nd=sum(b[::2])\r\no=0\r\nx=sum(b[1::2])\r\nfor j in range(n+1):\r\n if j%2==1:\r\n o+=b[j-1]\r\n x-=b[j]\r\n if b[j]==1:\r\n continue\r\n s=o+b[j]-1+x\r\n if s>d:\r\n d=s\r\nprint(d)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Oct 15 16:59:45 2023\r\n\r\n@author: zinc 2300012115\r\n\"\"\"\r\nn,M = map(int,input().split())\r\na = [0] + [int(x) for x in input().split()] + [M]\r\n#直接利用index对2取余数进行标记\r\nintervals = [0]*(n+1)\r\nintervals[0] = a[1]-a[0]\r\nfor i in range(3,n+2,2):\r\n intervals[i-1] = intervals[i-3] + a[i] - a[i-1]\r\nif (n+1)%2 == 0:\r\n intervals[-1] = a[-1] - a[-2]\r\n for j in range(-3,-(n+2),-2):\r\n intervals[j] = intervals[j+2] + a[j] - a[j-1]\r\nelse:\r\n intervals[-2] = a[-2] - a[-3]\r\n for k in range(-4,-(n+2),-2):\r\n intervals[k] = intervals[k+2] + a[k] - a[k-1]\r\nans = intervals[(n+1)%2-2]\r\nintervals.append(0)\r\nfor l in range(0,n+1):\r\n if a[l+1] - a[l] > 1:\r\n if (l+1)%2 == 0 :\r\n ans = max(intervals[l-1] + intervals[l] - 1 , ans)\r\n else:\r\n ans = max(intervals[l] + intervals[l+1] - 1 , ans)\r\n else:\r\n pass\r\nprint(ans)", "state = [0, 0]\nn, M = map(int, input().split())\ninput_li = list(map(int, input().split()))\nstate.extend(input_li)\nstate.append(M)\n\nblack = [0] * (n + 10)\nwhite = [0] * (n + 10)\n\nnow = 1 if n % 2 == 0 else 0\nfor i in range(n + 1, 0, -1):\n black[i] = black[i + 1]\n white[i] = white[i + 1]\n if now == 1: black[i] += state[i + 1] - state[i]\n else: white[i] += state[i + 1] - state[i]\n now = 0 if now == 1 else 1\n\nres = black[1]\nfor i in range(2, n + 3):\n if state[i] - state[i - 1] == 1: continue\n ans = white[i] + black[1] - black[i - 1] + state[i] - state[i - 1] - 1\n res = ans if ans > res else res\n\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\nL=list(map(int,input().split()))\r\nL.insert(0,0)\r\nL.append(M)\r\non=[]\r\ni=1\r\nwhile i<=len(L)-1:\r\n\ton.append(L[i]-L[i-1])\r\n\ti+=2\r\n\t\r\ny=sum(on)\r\nbright=[]\r\nif len(L)%2==0:\r\n\tx=y-1\r\n\tbright.append(y)\r\nelif len(L)%2==1:\r\n\tx=y+L[-1]-L[-2]-1\r\n\tbright.append(x)\r\nfor k in range(len(on)-1):\r\n\tj=len(on)-1-k\r\n\tx=x-2*on[j]+L[2*j+1]-L[2*j-1]\r\n\tbright.append(x)\r\n\r\nprint(str(max(bright)))" ]

[ "# METO Bot 0.9.9\na,b,c,m=1,2,4,10**9+9\nn=int(input())\nfor i in range(1,n//2):\n\tc=c*a%m\n\tb=(b+c)%m\n\ta=(2*a+3)%m\nprint((b*b+1)*2%m)\n\n\t\t\t \t\t\t \t\t \t \t \t\t", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a, b, c, mod = 2, 2, 4, 1000000009\r\n while n > 2:\r\n a = (a << 1) % mod\r\n c = c * (a - 3) % mod\r\n b = (b + c) % mod\r\n n -= 2\r\n print((b * b + 1) * 2 % mod)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "a,b,c=1,2,4\r\nmodulo=10**9+9\r\nn=int(input())\r\nfor i in range(1,n//2):\r\n\tc=c*a%modulo\r\n\tb=(b+c)%modulo\r\n\ta=(2*a+3)%modulo\r\nprint((b*b+1)*2%modulo)", "n=int(input())\r\nz=8\r\ny=[]\r\nfor i in range(n//2-1):\r\n y.append((z-3)%1000000009)\r\n z*=2\r\n z%=1000000009\r\nif n==2:\r\n print(10)\r\nelse:\r\n a=4\r\n for i in range(n//2,2,-1):\r\n a*=y[i-3]\r\n a+=4\r\n a%=1000000009\r\n a+=2\r\n print(2*(a**2+1)%1000000009)", "n=int(input())\nn=n//2\nif n==1:\n\tprint(10)\n\texit(0)\nans=2\nA=1\nB=1\nfor i in range(n-1):\n\tans=(ans+4*B)%1000000009\n\tA=(A*2+3)%1000000009\n\tB=B*A%1000000009\nprint(2*(ans*ans+1)%1000000009)\n\t \t\t \t \t \t \t\t\t \t \t", "n=int(input())\r\nn=n//2\r\nif n==1:\r\n\tprint(10)\r\n\texit(0)\r\nans=2\r\nA=1\r\nB=1\r\nfor i in range(n-1):\r\n\tans=(ans+4*B)%1000000009\r\n\tA=(A*2+3)%1000000009\r\n\tB=B*A%1000000009\r\nprint(2*(ans*ans+1)%1000000009)", "a,b,c,m=1,2,4,10**9+9\r\nn=int(input())\r\nfor i in range(1,n//2):\r\n\tc=c*a%m\r\n\tb=(b+c)%m\r\n\ta=(2*a+3)%m\r\nprint((b*b+1)*2%m)" ]

[ "n, k = [int(_) for _ in input().split()]\r\na = input()\r\n\r\n\r\ndef next_free(x):\r\n x += 1\r\n while x < n and a[x] == '1':\r\n x += 1\r\n return x\r\n\r\n\r\nl = next_free(-1)\r\nr = -1\r\n\r\n\r\nk += 1\r\nfor _ in range(k):\r\n r = next_free(r)\r\ni = l\r\ndis = max(i-l, r-i)\r\nnext_i = next_free(i)\r\nwhile True:\r\n cur_dis = max(i-l, r-i)\r\n next_dis = max(next_i - l, r - next_i)\r\n\r\n if cur_dis <= next_dis:\r\n break\r\n i = next_i\r\n dis = min(dis, next_dis)\r\n next_i = next_free(i)\r\n\r\n\r\nwhile True:\r\n r = next_free(r)\r\n if r >= n:\r\n break\r\n l = next_free(l)\r\n if i < l:\r\n i = l\r\n prev_dis = max(i-l, r-i)\r\n dis = min(dis, prev_dis)\r\n m = next_free(i)\r\n while m <= r:\r\n cur_dis = max(m-l, r-m)\r\n if cur_dis >= prev_dis:\r\n break\r\n prev_dis = cur_dis\r\n i = m\r\n dis = min(dis, cur_dis)\r\n m = next_free(m)\r\n\r\nprint(dis)\r\n\r\n\r\n# binary search the ANSWER!!\r\n# choose an answer and check if it works\r\n# array [i] keeps track of how many zeros are before it", "q, v = map(int, input().split())\r\nlista = input()\r\n\r\nlivres = []\r\nfor i in range(len(lista)):\r\n if lista[i] == '0':\r\n livres.append(i)\r\n\r\ne = 0\r\nf = 0\r\nd = v\r\n\r\nmenor = q\r\nmaior = 0\r\nwhile d < len(livres):\r\n while max(abs(livres[f] - livres[e]), abs(livres[d] - livres[f])) > max(abs(livres[f + 1] - livres[e]), abs(livres[d] - livres[f + 1])):\r\n f += 1\r\n\r\n maior = max(abs(livres[f] - livres[e]), abs(livres[d] - livres[f]))\r\n menor = min(menor, maior)\r\n\r\n e += 1\r\n d += 1\r\n\r\nprint(menor)", "n, k = map(int, input().split())\r\ns = input()\r\nnums = [i for i in range(n) if s[i] == \"0\"]\r\nans = n\r\ny = k\r\n\r\nfor x in range(len(nums) - k):\r\n target = (nums[x] + nums[y]) // 2\r\n temp = x\r\n while nums[temp] < target:\r\n temp += 1\r\n \r\n dl = nums[temp] - nums[x]\r\n dr = nums[y] - nums[temp]\r\n dl2 = nums[temp - 1] - nums[x]\r\n dr2 = nums[y] - nums[temp - 1]\r\n aux1 = max(dl, dr)\r\n aux2 = max(dl2, dr2)\r\n ans = min(ans, aux1, aux2)\r\n y += 1\r\n\r\nprint(ans)", "q, v = map(int, input().split())\nlista = input()\n\nlivres = []\nfor i in range(len(lista)):\n if lista[i] == '0':\n livres.append(i)\n\ne = 0\nf = 0\nd = v\n\nmenor = q\nmaior = 0\nwhile d < len(livres):\n while max(abs(livres[f] - livres[e]), abs(livres[d] - livres[f])) > max(abs(livres[f + 1] - livres[e]), abs(livres[d] - livres[f + 1])):\n f += 1\n\n maior = max(abs(livres[f] - livres[e]), abs(livres[d] - livres[f]))\n menor = min(menor, maior)\n\n e += 1\n d += 1\n\nprint(menor)\n\t\t \t\t \t\t\t\t\t\t \t\t \t\t \t \t\t\t\t\t", "n, k = map(int, input().split())\ns = input()\nlivres = [i for i in range(n) if s[i] == \"0\"]\nresposta = n\nj = k\n\nfor i in range(len(livres) - k):\n mid = (livres[i] + livres[j]) // 2\n c = i\n while livres[c] < mid:\n c += 1\n \n dl = livres[c] - livres[i]\n dr = livres[j] - livres[c]\n dl2 = livres[c - 1] - livres[i]\n dr2 = livres[j] - livres[c - 1]\n auxiliar1 = max(dl, dr)\n auxiliar2 = max(dl2, dr2)\n resposta = min(resposta, auxiliar1, auxiliar2)\n j += 1\n\nprint(resposta)\n\t \t \t \t \t\t \t \t \t\t \t\t", "n, k = map(int, input().split())\r\nt = [i for i, v in enumerate(input()) if v == '0']\r\ns, i = n, 0\r\na, b = t[:2]\r\nfor l, r in zip(t, t[k:]):\r\n while max(r - a, a - l) > max(r - b, b - l): \r\n i += 1\r\n a, b = t[i:i + 2]\r\n s = min(s, max(r - a, a - l))\r\nprint(s)", "def closestToCenter(A,l,r,c,mid):\n if l > r:\n return c\n m = (l + r) // 2\n elem = A[m]\n if abs(elem-mid) < abs(c-mid):\n closest = elem\n else:\n closest = c\n if elem < mid:\n return closestToCenter(A,m+1,r,closest,mid)\n elif elem > mid:\n return closestToCenter(A,l,m-1,closest,mid)\n else:\n return elem\n\ndef calcMaxDist(A,l,r,c):\n return max(abs(c-A[l]),abs(c-A[r]))\n\nn,k = list(map(int,input().split()))\nroomStr = input()\nX = []\nfor i in range(n):\n if roomStr[i] == \"0\":\n X.append(i)\nl = 0\nr = k\ndistCow = 10**5\nwhile r <= len(X) - 1:\n mid = (X[l] + X[r])/2\n closest = closestToCenter(X,l,r,X[r],mid)\n maxDist = calcMaxDist(X,l,r,closest)\n if maxDist < distCow: distCow = maxDist\n l += 1\n r += 1\nprint(distCow)\n\n\t\t \t \t \t\t\t\t \t \t\t \t \t\t\t", "def value(x):\r\n global l, r, livres\r\n return max(abs(livres[l] - livres[x]), abs(livres[r] - livres[x]))\r\n\r\nn, k = [int(x) for x in input().split()]\r\nvagas = input()\r\n\r\nlivres = []\r\nfor i in range(n):\r\n if vagas[i] == '0':\r\n livres.append(i)\r\n\r\nl = f = 0\r\nr = k\r\nmenor = value(0)\r\n\r\nwhile r < len(livres): \r\n while value(f) > value(f+1):\r\n f += 1\r\n menor = min(menor, value(f))\r\n l += 1\r\n r += 1\r\n\r\nprint(menor)\r\n\r\n\r\n", "n, k = map(int, input().split())\nt = [i for i, v in enumerate(input()) if v == '0']\ns, m = n, 0\nf = lambda m: max(r - t[m], t[m] - l)\nfor l, r in zip(t, t[k:]):\n while f(m) > f(m + 1): m += 1\n s = min(s, f(m))\nprint(s)\n \t\t \t \t\t \t \t\t \t", "from sys import stdin\r\nfrom collections import deque\r\nfrom bisect import *\r\n\r\ninput = lambda: stdin.buffer.readline().decode().strip()\r\nn, k = map(int, input().split())\r\ns, que, ans, st, en = input(), [], 10 ** 5, 0, 0\r\n\r\nfor i in range(n):\r\n if s[i] == '0':\r\n que.append(i)\r\n en += 1\r\n\r\n if en - st == k + 1:\r\n med = (que[st] + que[-1]) / 2\r\n l, r = bisect_right(que, med, st, en) - 1, bisect_left(que, med, st, en)\r\n ans = min(ans, que[-1] - que[l], que[r] - que[st])\r\n st += 1\r\n\r\nprint(ans)\r\n", "quartos, quant_vacas = map(int, input().split())\r\nentrada = input()\r\nlista_disp = []\r\nfor i in range(quartos):\r\n if entrada[i] == '0':\r\n lista_disp.append(i)\r\n\r\ne = f = 0\r\nd = quant_vacas\r\nmenor = 99999999999999999\r\nwhile d < len(lista_disp):\r\n prox1 = abs(lista_disp[d] - lista_disp[f + 1])\r\n prox2 = abs(lista_disp[e] - lista_disp[f + 1])\r\n atual1 = abs(lista_disp[d] - lista_disp[f]) \r\n atual2 = abs(lista_disp[e] - lista_disp[f])\r\n menor = min(menor, max(atual1, atual2))\r\n if max(prox1, prox2) < max(atual1, atual2):\r\n f += 1\r\n else:\r\n e += 1\r\n d += 1\r\n\r\nprint(menor)", "\r\ndef main():\r\n n,k = map(int, input().split())\r\n cowLocations = input()\r\n #n,k = 7,2\r\n #cowLocations = \"0100100\"\r\n whereIsCow = []\r\n for i in range(len(cowLocations)):\r\n if cowLocations[i] == '0':\r\n whereIsCow.append(i)\r\n i = 0\r\n j = k\r\n fJohn = 0\r\n wic = len(whereIsCow)\r\n #print(whereIsCow)\r\n smallest = 1000000\r\n while i < wic and j < wic and fJohn < wic:\r\n maxDist = max(whereIsCow[j]-whereIsCow[fJohn],\r\n whereIsCow[fJohn]-whereIsCow[i])\r\n #print(maxDist)\r\n while fJohn <= j and max(whereIsCow[j]-whereIsCow[fJohn+1],\r\n whereIsCow[fJohn+1]-whereIsCow[i]) < maxDist:\r\n fJohn += 1\r\n maxDist = max(whereIsCow[j]-whereIsCow[fJohn],\r\n whereIsCow[fJohn]-whereIsCow[i])\r\n if maxDist < smallest:\r\n smallest = maxDist\r\n j += 1\r\n i += 1\r\n print(smallest)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n \r\n\r\n", "n, k = [int(x) for x in input().split()]\r\nvagas = input()\r\nfirst0 = -1\r\nlast0 = -1\r\nfor i in range(n):\r\n if vagas[i] == '0':\r\n if first0 == -1:\r\n first0 = i\r\n last0 = i\r\n\r\nvagas = vagas[first0:last0+1]\r\nocupado = [int(x) for x in vagas]\r\nn = len(ocupado)\r\n\r\nl = 0\r\ntog = 0\r\nr = 0\r\nnextr = 0\r\n\r\ncowcount = 0\r\n\r\nfor i in range(1,n):\r\n if not ocupado[i]:\r\n cowcount += 1\r\n if cowcount == k:\r\n r = i\r\n break\r\n\r\ndef findNext(i):\r\n for j in range(i+1, n):\r\n if not ocupado[j]:\r\n return j\r\n return -1\r\n\r\nnextl = findNext(l)\r\nnextr = findNext(r)\r\n\r\nmenor = r - tog\r\nwhile tog < n-1:\r\n tog += 1\r\n while ocupado[tog]:\r\n tog += 1\r\n \r\n while max(tog - l, r - tog) > max(tog - nextl, nextr - tog) and nextr != -1:\r\n l = nextl\r\n r = nextr\r\n nextl = findNext(l)\r\n nextr = findNext(r)\r\n\r\n menor = min(max(tog - l, r - tog), menor)\r\n\r\nprint(menor)\r\n\r\n", "from sys import stdin\r\nfrom collections import deque\r\nfrom bisect import *\r\n\r\ninput = lambda: stdin.buffer.readline().decode().strip()\r\nn, k = map(int, input().split())\r\ns, que, ans = input(), deque(), 10 ** 5\r\n\r\nfor i in range(n):\r\n if s[i] == '0':\r\n que.append(i)\r\n\r\n if len(que) == k + 1:\r\n med = (que[0] + que[-1]) / 2\r\n l, r = bisect_right(que, med) - 1, bisect_left(que, med)\r\n ans = min(ans, que[-1] - que[l], que[r] - que[0])\r\n que.popleft()\r\n\r\nprint(ans)\r\n", "import sys\r\nr=sys.stdin.readline\r\nn,k=map(int,r().split())\r\nrooms=list(r().strip())\r\ndef nextRoom(i):\r\n i+=1\r\n while i<n and rooms[i]=='1':\r\n i+=1\r\n return i\r\nl=nextRoom(-1)\r\nr,m=l,l\r\nans=sys.maxsize\r\nfor i in range(k):\r\n r=nextRoom(r)\r\nwhile r<n:\r\n while max(m-l,r-m)>max(nextRoom(m)-l,r-nextRoom(m)):\r\n m=nextRoom(m)\r\n ans=min(ans,max(m-l,r-m))\r\n l,r=nextRoom(l),nextRoom(r)\r\nprint(ans)", "n, k = [int(x) for x in input().split()]\ns = input()\nnums = []\nans = n\nx = 0\ny = k\n\nfor i in range(n):\n if s[i] == \"0\": nums.append(i)\n\n\nwhile y < len(nums):\n temp = 0\n l = x\n r = y\n\n while l <= r:\n target = (nums[x] + nums[y]) // 2\n mid = (l + r) // 2\n if nums[mid] >= target:\n temp = mid\n r = mid - 1\n\n else:\n l = mid + 1\n if temp == 0:\n ans = min(ans, nums[y] - nums[temp])\n \n else:\n dl = nums[temp] - nums[x]\n dr = nums[y] - nums[temp]\n dl2 = nums[temp - 1] - nums[x]\n dr2 = nums[y] - nums[temp - 1]\n aux1 = max(dl,dr)\n aux2 = max(dl2, dr2)\n ans = min(ans, aux1,aux2)\n x += 1\n y += 1\n\nprint(ans)\n\t\t\t\t\t \t\t\t \t\t\t\t \t \t \t", "n,v = map(int,input().split(\" \"))\nquartos = input()\nquartos_livres = []\n\nfor i in range(len(quartos)):\n if quartos[i] == \"0\":\n quartos_livres.append(i)\n\nf = 0\ne = 0\nd = v\nmelhor = float('inf')\nwhile d < len(quartos_livres):\n if f + 1 >= len(quartos_livres): break\n novo_valor_esq = abs(quartos_livres[e]-(quartos_livres[f+1]))\n novo_valor_dir = abs(quartos_livres[d] - (quartos_livres[f + 1]))\n\n atual_valor_esq = abs(quartos_livres[e] - quartos_livres[f])\n atual_valor_dir = abs(quartos_livres[d] - quartos_livres[f])\n\n novo_maior_valor = max(novo_valor_dir,novo_valor_esq)\n atual_maior_valor = max(atual_valor_dir,atual_valor_esq)\n\n if novo_maior_valor < atual_maior_valor:\n melhor = min(novo_maior_valor, melhor)\n f += 1\n else:\n melhor = min(atual_maior_valor, melhor)\n e += 1\n d += 1\n\n\nprint(melhor)\n\n \t \t\t\t \t\t\t\t \t\t \t\t\t\t \t\t \t\t \t\t", "res = 1e9\ndef next(i):\n i += 1\n while(i < N and S[i] == '1'):\n i += 1\n return i\nN, K = map(int, input().split())\nS = input()\nl = next(-1)\nm = l\nr = l\nfor j in range(K):\n r = next(r)\nwhile(r < N):\n while(max(m - l, r - m) > max(next(m) - l, r - next(m))):\n m = next(m)\n res = min(res, max(m - l, r - m))\n l = next(l)\n r = next(r)\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", "res = 1e9\r\n\r\ndef next(i):\r\n i += 1\r\n while(i < N and S[i] == '1'):\r\n i += 1\r\n return i\r\n\r\n\r\nN, K = map(int, input().split())\r\nS = input()\r\nl = next(-1)\r\nm = l\r\nr = l\r\nfor j in range(K):\r\n r = next(r)\r\nwhile(r < N):\r\n while(max(m - l, r - m) > max(next(m) - l, r - next(m))):\r\n m = next(m)\r\n res = min(res, max(m - l, r - m))\r\n l = next(l)\r\n r = next(r)\r\nprint(res)", "n, k = [int(_) for _ in input().split()]\r\na = input()\r\n\r\nk += 1\r\n# size of n+1\r\nf = [0] * (n+1)\r\n\r\nf[1] = int(a[0] == '0')\r\nfor i in range(2, n+1):\r\n f[i] = f[i-1] + int(a[i-1] == '0')\r\n\r\n# print(f)\r\n\r\n\r\ndef check(dis):\r\n for i in range(n):\r\n if a[i] == '0':\r\n left = max(i-dis, 0)\r\n right = min(i+dis, n-1)\r\n total = f[right+1] - f[left]\r\n # print(total)\r\n if total >= k:\r\n return True\r\n return False\r\n\r\n\r\nl = 1\r\nr = n - 1\r\nwhile l < r:\r\n mid = (l + r) // 2\r\n # print(mid)\r\n if check(mid):\r\n # print(True)\r\n r = mid\r\n else:\r\n # print(False)\r\n l = mid + 1\r\nprint(l)\r\n\r\n\r\n# binary search the ANSWER!!\r\n# choose an answer and check if it works\r\n# array [i] keeps track of how many zeros are before it", "res = 1e9\r\ndef next(i):\r\n i+=1\r\n while(i < n and s[i] == '1'):\r\n i+=1\r\n return i\r\n\r\nn,k = list(map(int, input().split()))\r\ns = input()\r\nl = next(-1)\r\nm = l\r\nr = l\r\nfor i in range(k):\r\n r = next(r)\r\n \r\nwhile(r < n):\r\n while(max(m - l, r - m) > max(next(m) - l, r - next(m))):\r\n m = next(m)\r\n res = min(res, max(m - l, r - m))\r\n l = next(l)\r\n r = next(r)\r\nprint(res)\r\n", "n, k = [int(_) for _ in input().split()]\r\na = input()\r\nk += 1\r\n# size of n+1\r\nf = [0] * (n+1)\r\n \r\nf[1]=int(a[0]=='0')\r\nfor i in range(1,n+1):\r\n f[i]=f[i-1]+int(a[i-1]=='0')\r\n \r\n#sprint(f)\r\ndef check(dis):\r\n for i in range(n):\r\n if a[i]=='0':\r\n left=max(i-dis,0)\r\n right=min(i+dis,n-1)\r\n if f[right+1]-f[left]>=k:return True\r\n return False\r\nl=1\r\nr=n\r\nans=n\r\nwhile l<=r:\r\n mid=(l + r)// 2\r\n # print(mid)\r\n if check(mid):\r\n # print(True)\r\n ans=min(ans,mid)\r\n r=mid-1\r\n \r\n else:\r\n # print(False)\r\n l=mid+1\r\nprint(ans)\r\n \r\n \r\n", "n,k=map(int,input().split())\r\na=list(map(int,input()))\r\nm=l=s=0; ans=1000000\r\nfor r in range(0,n):\r\n m+=a[r] \r\n if r-l-m<k or a[r]: continue\r\n while r-l-m>k or a[l]: m-=a[l];l+=1\r\n while True:\r\n if a[s]==0: ans=min(ans,max(r-s,s-l))\r\n if r-s<s-l and a[s]==0: break\r\n s+=1\r\nprint(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,K = map(int, input().split())\r\nA = [int(c) for c in input()]\r\nsums = [0]\r\nfor a in A:\r\n if a==0:\r\n a=1\r\n else:\r\n a=0\r\n sums.append(sums[-1]+a)\r\n \r\ndef check(idx, m):\r\n l=max(0,idx-m-1)\r\n r=min(idx+m,N)\r\n \r\n t = sums[r]-sums[l]\r\n if t>=K+1:\r\n return True\r\n return False\r\n \r\n#print(sums)\r\n\r\nans = float('inf')\r\nfor i in range(N):\r\n if A[i]==1:continue\r\n l,r=0,N\r\n while l+1<r:\r\n m = (l+r)//2\r\n if check(i+1, m):\r\n r=m\r\n else:\r\n l=m\r\n #print(i+1,r)\r\n ans = min(ans, r)\r\nprint(ans)\r\n\r\n", "ans = 1000000000\r\nn, k = [int(i) for i in input().split()]\r\ns = input()\r\nl = len(s)\r\nd = [k // 2, (k + 1) // 2]\r\nnearl = [0] * n\r\nnearr = [0] * n\r\nlast = 1000000000\r\nfor i in range(n):\r\n if s[i] == '0':\r\n last = i\r\n nearl[i] = last\r\nfor i in range(n - 1, -1, -1):\r\n if s[i] == '0':\r\n last = i\r\n nearr[i] = last\r\nfor i in d:\r\n itl = 0\r\n nf = 0\r\n itr = 0\r\n while s[itl] == '1':\r\n itl += 1\r\n cnt = 0\r\n nf = itl\r\n while cnt < i:\r\n cnt += 1\r\n nf += 1\r\n while s[nf] == '1':\r\n nf += 1\r\n cnt = 0\r\n itr = nf\r\n while cnt < k - i:\r\n cnt += 1\r\n itr += 1\r\n while s[itr] == '1':\r\n itr += 1\r\n while True:\r\n pos = (itr + itl) // 2\r\n pos1 = nearl[pos]\r\n ans = min(ans, max(pos1 - itl, itr - pos1))\r\n pos1 = nearr[pos]\r\n ans = min(ans, max(pos1 - itl, itr - pos1))\r\n itr += 1\r\n while itr < l and s[itr] == '1':\r\n itr += 1\r\n if itr == l:\r\n break\r\n itl += 1\r\n while s[itl] == '1':\r\n itl += 1\r\nprint(ans)", "n, k = [int(x) for x in input().split()]\nS = [0]*n + [x == '0' for x in input()] + [0]*n\ndist = [n] * n\nj, D = 1, S[n]\nfor i in range(n):\n while D < k + 1 and j < n:\n D += S[n + i - j] + S[n + i + j]\n j += 1\n j -= 1\n if S[n + i]: dist[i] = j\n D -= (S[n + i - j] + S[n + i - j + 1])\nprint(min(dist))\n" ]

[ "#519A\r\nvalW = 0\r\nvalB = 0\r\nfor _ in range(8):\r\n a = input()\r\n for i in range(8) :\r\n if a[i] == 'Q':\r\n valW = valW + 9\r\n elif a[i] == 'R' :\r\n valW = valW + 5\r\n elif a[i] == 'B' :\r\n valW = valW + 3\r\n elif a[i] == 'N' :\r\n valW = valW + 3\r\n elif a[i] == 'P' :\r\n valW = valW + 1\r\n elif a[i] == 'K' :\r\n valW = valW + 0\r\n elif a[i] == 'q':\r\n valB = valB + 9\r\n elif a[i] == 'r' :\r\n valB = valB + 5\r\n elif a[i] == 'b' :\r\n valB = valB + 3\r\n elif a[i] == 'n' :\r\n valB = valB + 3\r\n elif a[i] == 'p' :\r\n valB = valB + 1\r\n elif a[i] == 'k' :\r\n valB = valB + 0\r\nif valW == valB :\r\n print('Draw')\r\nelif valW > valB :\r\n print('White')\r\nelse :\r\n print('Black')\r\n#print(valW, valB)\r\n#96 112\r\n", "power = {\r\n 'q' : 9,\r\n 'r' : 5,\r\n 'b' : 3,\r\n 'n' : 3,\r\n 'p' : 1,\r\n 'k' : 0}\r\nsw = 0\r\nsb = 0\r\nfor i in range(8):\r\n l = input()\r\n for w in l:\r\n if w == '.':\r\n continue\r\n\r\n if w.islower():\r\n sb += power[w]\r\n else:\r\n sw += power[w.lower()]\r\n\r\nif sw > sb:\r\n print('White')\r\nelif sw == sb:\r\n print('Draw')\r\nelse:\r\n print('Black')\r\n", "d={'r':5,'b': 3,'n':3,'q':9,'p':1}\r\np=0\r\nfor _ in range(8):\r\n for i in input():\r\n p+=d.get(i.lower(),0)*(-1+2*i.isupper())\r\nprint('White' if p>0 else ['Black','Draw'][not p])", "white={\"Q\",\"R\",\"B\",\"N\",\"P\"}\r\nblack={\"q\",\"r\",\"b\",\"n\",\"p\"}\r\nwval={\"Q\":9,\"R\":5,\"B\":3,\"N\":3,\"P\":1}\r\nbval={\"q\":9,\"r\":5,\"b\":3,\"n\":3,\"p\":1}\r\ns_black=0\r\ns_white=0\r\nfor inhg in range(0,8):\r\n s=input()\r\n for i in range(0,8):\r\n j=s[i]\r\n if s[i]in white:\r\n s_white+=wval[j]\r\n if s[i] in black:\r\n s_black+=bval[j]\r\nif s_black > s_white:\r\n print(\"Black\")\r\nelif s_black == s_white:\r\n print(\"Draw\")\r\nelse:\r\n print(\"White\")", "i = [input() for _ in range(8)]\nbp = {'q': 9, 'r': 5, 'b': 3, 'n':3, 'p': 1}\nwp = {'Q': 9, 'R': 5, 'B': 3, 'N':3, 'P': 1}\nblack, white = 0, 0\nfor row in i:\n for piece in row:\n if piece in bp.keys():\n black += bp[piece]\n elif piece in wp.keys():\n white += wp[piece]\n\nif white == black:\n print('Draw')\nelse:\n print('White' if white > black else 'Black')", "w=b=0\r\nfor i in range(8):\r\n s=input()\r\n for j in s:\r\n if j!=\".\":\r\n if j==\"p\":\r\n b+=1\r\n elif j==\"n\":\r\n b+=3\r\n elif j==\"b\":\r\n b+=3\r\n elif j==\"r\":\r\n b+=5\r\n elif j==\"q\":\r\n b+=9\r\n elif j==\"P\":\r\n w+=1\r\n elif j==\"N\":\r\n w+=3\r\n elif j==\"B\":\r\n w+=3\r\n elif j==\"R\":\r\n w+=5\r\n elif j==\"Q\":\r\n w+=9\r\nif w<b:\r\n print(\"Black\")\r\nelif w==b:\r\n print(\"Draw\")\r\nelse :\r\n print(\"White\")", "from collections import Counter\r\nt = 8\r\nmas = [ ]\r\nwhile t:\r\n s = input()\r\n mas += [s]\r\n t -= 1\r\nWhite = 0\r\nBlack = 0\r\nfor i in range(8):\r\n p = Counter(mas[i])\r\n White += ((p['Q'] * 9) + (p['R'] * 5) + (p['B'] * 3) + (p['N'] * 3) + (p['P']))\r\n Black += ((p['q'] * 9) + (p['r'] * 5) + (p['b'] * 3) + (p['n'] * 3) + (p['p']))\r\nif White > Black:\r\n print('White')\r\nelif White < Black:\r\n print('Black')\r\nelse:\r\n print('Draw')\r\n", "s1 = str(input())\r\ns2 = str(input())\r\ns3 = str(input())\r\ns4 = str(input())\r\ns5 = str(input())\r\ns6 = str(input())\r\ns7 = str(input())\r\ns8 = str(input())\r\nsetsr = s1+s2+s3+s4+s5+s6+s7+s8\r\nqw = setsr.count(\"Q\")\r\nrw = setsr.count(\"R\")\r\nbw = setsr.count(\"B\")\r\nnw = setsr.count(\"N\")\r\npw = setsr.count(\"P\")\r\nqb = setsr.count(\"q\")\r\nrb = setsr.count(\"r\")\r\nbb = setsr.count(\"b\")\r\nnb = setsr.count(\"n\")\r\npb = setsr.count(\"p\")\r\nqw *= 9\r\nrw *= 5\r\nbw *= 3\r\nnw *= 3\r\nqb *= 9\r\nrb *= 5\r\nbb *= 3\r\nnb *= 3\r\nsumf = qw+rw+bw+nw+pw\r\nsums = qb+rb+bb+nb+pb\r\nif sumf > sums:\r\n print(\"White\")\r\nelif sums > sumf:\r\n print(\"Black\")\r\nelif sums == sumf:\r\n print(\"Draw\")", "a = []\r\nfor i in range(8):\r\n a.append(input())\r\nd1 = 0\r\nd2 = 0\r\nfor i in a:\r\n for k in i:\r\n if(k == 'Q'):\r\n d1 = d1 + 9\r\n elif k == 'q':\r\n d2 = d2 + 9\r\n elif k == 'R':\r\n d1 = d1 + 5\r\n elif k == 'r':\r\n d2 = d2 + 5\r\n elif k == 'B':\r\n d1 = d1 + 3\r\n elif k == 'b':\r\n d2 = d2 + 3\r\n elif k == 'N':\r\n d1 = d1 + 3\r\n elif k == 'n':\r\n d2 = d2 + 3\r\n elif k == 'P':\r\n d1 = d1 + 1\r\n elif k == 'p':\r\n d2 = d2 + 1\r\nif d1 == d2:\r\n print(\"Draw\")\r\nelif d1 > d2:\r\n print(\"White\")\r\nelse:\r\n print(\"Black\")", "# LUOGU_RID: 101573839\ns = ''.join([*open(0)])\r\na = 0\r\na += s.count('Q') * 9\r\na += s.count('R') * 5\r\na += s.count('B') * 3\r\na += s.count('N') * 3\r\na += s.count('P') * 1\r\nb = 0\r\nb += s.count('q') * 9\r\nb += s.count('r') * 5\r\nb += s.count('b') * 3\r\nb += s.count('n') * 3\r\nb += s.count('p') * 1\r\nprint('White' if a > b else 'Draw' if a == b else 'Black')", "d={'q':9,'r':5,'b':3,'n':3,'p':1,'k':0} # dictionary of pieces and their values\ns=0\ns2=0\nfor i in range(8):\n t=input()\n s+=sum([d[x] for x in t if x.islower()])\n s2+=sum([d[x.lower()] for x in t if x.isupper()])\nif s>s2:\n print('Black')\nelif s<s2:\n print('White')\nelse:\n print('Draw')\n", "def chess():\n white_score = 0\n black_score = 0\n for i in range(8):\n a = input()\n for j in range(8):\n if a[j] == 'Q':\n white_score += 9\n elif a[j] == 'R':\n white_score += 5\n elif a[j] == 'B' or a[j] == 'N':\n white_score += 3\n elif a[j] == 'P':\n white_score += 1\n elif a[j] == 'q':\n black_score += 9\n elif a[j] == 'r':\n black_score += 5\n elif a[j] == 'b' or a[j] == 'n':\n black_score += 3\n elif a[j] == 'p':\n black_score += 1\n if white_score > black_score:\n print('White')\n elif black_score > white_score:\n print('Black')\n else:\n print('Draw')\n\nchess()\n\n\n", "b, w = 0, 0\r\n\r\nfor _ in range(8):\r\n for c in list(input()):\r\n b += sum([int(v[1]) for v in [\"q9\", \"r5\", \"b3\", \"n3\", \"p1\"] if v[0] == c])\r\n w += sum([int(v[1]) for v in [\"Q9\", \"R5\", \"B3\", \"N3\", \"P1\"] if v[0] == c])\r\n\r\nif b>w:\r\n print(\"Black\")\r\nelif b<w:\r\n print(\"White\")\r\nelse:\r\n print(\"Draw\")", "a = \"\"\r\nfor i in range(8):\r\n a += input()\r\n \r\n\r\n\r\nnums = []\r\n\r\nb = a.count(\"Q\")\r\nnums.append(b * 9)\r\n\r\nd = a.count(\"R\")\r\nnums.append(d * 5)\r\n\r\ne = a.count(\"B\")\r\nnums.append(e * 3)\r\n\r\nr = a.count(\"N\")\r\nnums.append(r * 3)\r\n\r\nw = a.count(\"P\")\r\nnums.append(w * 1)\r\n\r\nnums1 = []\r\n\r\nB = a.count(\"q\")\r\nnums1.append(B * 9)\r\n\r\nD = a.count(\"r\")\r\nnums1.append(D * 5)\r\n\r\nE = a.count(\"b\")\r\nnums1.append(E * 3)\r\n\r\nR = a.count(\"n\")\r\nnums1.append(R * 3)\r\n\r\nW = a.count(\"p\")\r\nnums1.append(W * 1)\r\n\r\nif (sum(nums) > sum(nums1)):\r\n print(\"White\")\r\nelif (sum(nums1) > sum(nums)):\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")\r\n", "white=0\nblack=0\n\nfor i in range(8):\n case = input()\n white += (case.count('Q')*9)+(case.count('R')*5)+(case.count('B')*3)+(case.count('N')*3)+(case.count('P')*1)\n black += (case.count('q')*9)+(case.count('r')*5)+(case.count('b')*3)+(case.count('n')*3)+(case.count('p')*1)\nif white>black:\n print(\"White\")\nelif white <black :\n print(\"Black\")\nelse:\n print(\"Draw\")", "my_dict = {\r\n 'q' : 9,\r\n 'r' : 5,\r\n 'b' : 3,\r\n 'n' : 3,\r\n 'p' : 1,\r\n 'k' : 0\r\n}\r\n\r\nls = []\r\nfor i in range(8):\r\n ls.append(input())\r\n\r\nscore_w = 0\r\nscore_b = 0\r\n\r\nfor i in ls:\r\n for j in i:\r\n if j != '.':\r\n if j.isupper():\r\n score_w += my_dict[j.lower()]\r\n else :\r\n score_b += my_dict[j]\r\n\r\nif score_w == score_b:\r\n print('Draw')\r\nelif score_w > score_b:\r\n print('White')\r\nelse:\r\n print('Black')\r\n", "ot = ('Black', 'White', 'Draw')\r\nd = [['q',9],['r',5],['b',3],['n',3],['p',1],\\\r\n ['Q',-9],['R',-5],['B',-3],['N',-3],['P',-1]]\r\nsm = 0\r\nd_s = {'q', 'r', 'b', 'n', 'p','Q', 'R', 'B', 'N', 'P'}\r\nfor i in range(8):\r\n a = input()\r\n for j in a:\r\n if j in d_s:\r\n for k in d:\r\n if j == k[0]:\r\n sm += k[1]\r\n break\r\n\r\n\r\n\r\n\r\n\r\nif sm > 0:\r\n otv = ot[0]\r\nelif sm < 0:\r\n otv = ot[1]\r\nelse:\r\n otv = ot[2]\r\nprint(otv)", "white= 0\r\nblack= 0\r\nfor _ in range(8):\r\n s= input()\r\n for x in s:\r\n if x == 'Q':\r\n white += 9\r\n elif x == 'R':\r\n white += 5\r\n elif x == 'N' or x == 'B':\r\n white += 3\r\n elif x == 'P':\r\n white += 1\r\n elif x == 'q':\r\n black += 9\r\n elif x == 'r':\r\n black += 5\r\n elif x == 'n' or x == 'b':\r\n black += 3\r\n elif x == 'p':\r\n black += 1\r\n\r\nif black == white:\r\n print('Draw')\r\nelif white>black:\r\n print('White')\r\nelse:\r\n print('Black')", "white=0\r\nblack=0\r\nfor i in range(8):\r\n l=input()\r\n for i in l:\r\n if i==\"P\":\r\n white+=1\r\n if i==\"N\":\r\n white+=3\r\n if i==\"B\":\r\n white+=3\r\n if i==\"R\":\r\n white+=5\r\n if i==\"Q\":\r\n white+=9\r\n if i==\"p\":\r\n black+=1\r\n if i==\"n\":\r\n black+=3\r\n if i==\"b\":\r\n black+=3\r\n if i==\"r\":\r\n black+=5\r\n if i==\"q\":\r\n black+=9\r\nif white>black:\r\n print(\"White\")\r\nelif black>white:\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")\r\n \r\n\r\n", "white = []\r\nblack = []\r\nfor _ in range(8):\r\n s = input()\r\n dictionary = {\r\n \"Q\" : 9,\r\n \"R\" : 5,\r\n \"B\" : 3,\r\n \"N\" : 3,\r\n \"P\" :1,\r\n \".\" : 0,\r\n \"K\" : 0,\r\n \"k\" : 0,\r\n \"q\" : 0,\r\n \"r\" : 0,\r\n \"b\" : 0,\r\n \"p\" : 0,\r\n \"n\" : 0\r\n }\r\n\r\n dictionary1 = {\r\n \"q\" : 9,\r\n \"r\" : 5,\r\n \"b\" : 3,\r\n \"n\" : 3,\r\n \"p\" :1,\r\n \".\" : 0,\r\n \"K\" : 0,\r\n \"k\" : 0,\r\n \"Q\" : 0,\r\n \"R\" : 0,\r\n \"B\" : 0,\r\n \"P\" : 0,\r\n \"N\" : 0\r\n }\r\n for i in s:\r\n white.append(dictionary.get(i))\r\n black.append(dictionary1.get(i))\r\nif sum(white) == sum(black):\r\n print(\"Draw\")\r\nelse:\r\n print(\"White\" if sum(white) > sum(black) else \"Black\")", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip()\r\n s1, s2 = 0, 0\r\n d = dict(zip('qrbnp', (9, 5, 3, 3, 1)))\r\n for i in inp:\r\n if i.lower() in d:\r\n if i.isupper(): s1 += d[i.lower()]\r\n else: s2 += d[i.lower()]\r\n return 'Draw' if s1 == s2 else ('Black', 'White')[s1 > s2]\r\n\r\nprint(main())\r\n", "board=[]\r\nwhite=0\r\nblack=0\r\nfor i in range(8):\r\n inp=[]\r\n inpu=(str(input()))\r\n for i in inpu:\r\n inp.append(i)\r\n \r\n \r\n for j in range(8):\r\n if inp[j]==\"Q\":\r\n white+=9\r\n elif inp[j]==\"q\":\r\n black+=9\r\n elif inp[j]==\"R\":\r\n white+=5\r\n elif inp[j]==\"r\":\r\n black+=5\r\n elif inp[j]==\"N\":\r\n white+=3\r\n elif inp[j]==\"n\":\r\n black+=3\r\n elif inp[j]==\"B\":\r\n white+=3\r\n elif inp[j]==\"b\":\r\n black+=3\r\n elif inp[j]==\"P\":\r\n white+=1\r\n elif inp[j]==\"p\":\r\n black+=1\r\n \r\nif white>black:\r\n print(\"White\")\r\nelif black>white:\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")", "BlackAlph = \"qrbnpk\"\r\nWhiteAlph = \"QRBNPK\"\r\nvalues = [9, 5, 3, 3, 1, 0]\r\n\r\nblackValue, whiteValue = 0, 0\r\nfor i in range(8):\r\n s = input()\r\n\r\n for c in s:\r\n if c in BlackAlph:\r\n blackValue += values[BlackAlph.index(c)]\r\n\r\n if c in WhiteAlph:\r\n whiteValue += values[WhiteAlph.index(c)]\r\n\r\nif whiteValue > blackValue:\r\n print(\"White\")\r\nelif whiteValue == blackValue:\r\n print(\"Draw\")\r\nelse:\r\n print(\"Black\")\r\n", "field = []\nfor i in range(8):\n field.append(input())\n\ndef calc(field):\n\n score = {\n 'k': 0,\n '.': 0,\n 'p': 1,\n 'b': 3,\n 'n': 3,\n 'r': 5,\n 'q': 9,\n }\n\n w = 0\n b = 0\n\n for row in field:\n for r in row:\n if r.isupper():\n w += score[r.lower()] \n else:\n b += score[r]\n\n if w > b:\n return 'White'\n elif b > w:\n return 'Black'\n else:\n return 'Draw'\n\nprint(calc(field))\n", "dif=0\r\nl=[]\r\nfor _ in range(8):\r\n S=input()\r\n for j in range(8):\r\n if(S[j]=='q'):\r\n dif-=9\r\n if(S[j]=='r'):\r\n dif-=5\r\n if(S[j]=='b'):\r\n dif-=3\r\n if(S[j]=='n'):\r\n dif-=3\r\n if(S[j]=='p'):\r\n dif-=1\r\n if(S[j]=='Q'):\r\n dif+=9\r\n if(S[j]=='R'):\r\n dif+=5\r\n if(S[j]=='B'):\r\n dif+=3\r\n if(S[j]=='N'):\r\n dif+=3\r\n if(S[j]=='P'):\r\n dif+=1\r\nif(dif>0):\r\n print(\"White\")\r\nelif(dif<0):\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")\r\n ", "count = [0,0]\r\n\r\nfor x in range(8):\r\n\ts = input()\r\n\ti = 0\r\n\tfor y in s:\r\n\t\tif(y == '.'):\r\n\t\t\tcontinue\r\n\t\telif(y.islower()):\r\n\t\t\ti = 1\r\n\t\telse:\r\n\t\t\ti = 0\r\n\t\ty = y.casefold()\r\n\r\n\t\tpieces = ['q','r','b','n','p']\r\n\t\tvalue = [9,5,3,3,1]\r\n\t\tfor z in range(5):\r\n\t\t\tif(y == pieces[z]):\r\n\t\t\t\tcount[i] += value[z]\r\n\r\n\r\nif(count[0] > count[1]):\r\n\tprint(\"White\")\r\nelif(count[0] == count[1]):\r\n\tprint(\"Draw\")\r\nelse:\r\n\tprint(\"Black\")\r\n\r\n", "d={\"Q\":9,\"q\":9,\"R\":5,\"r\":5,\"B\":3,\"b\":3,\"N\":3,\"n\":3,\"p\":1,\"P\":1,\"K\":0,\"k\":0}\r\nb=0\r\nw=0\r\nfor i in range(8):\r\n k=input()\r\n for j in k:\r\n if j==\".\":\r\n pass\r\n elif j.isupper():\r\n w+=d[j]\r\n elif j.islower():\r\n b+=d[j]\r\nif b>w:\r\n print(\"Black\")\r\nelif w>b:\r\n print(\"White\")\r\nelse:\r\n print(\"Draw\")\r\n \r\n \r\n \r\n", "figures = {\r\n 'q': 9,\r\n 'r': 5,\r\n 'b': 3,\r\n 'n': 3,\r\n 'p': 1,\r\n 'k': 0,\r\n}\r\n\r\nwhite = []\r\nblack = []\r\nfor i in range(8):\r\n line = input()\r\n for j in line:\r\n if j != '.':\r\n if j.islower():\r\n black.append(figures.get(j))\r\n else:\r\n white.append(figures.get(j.lower()))\r\n else:\r\n continue\r\nif sum(white) == sum(black):\r\n print('Draw')\r\nelif sum(white) > sum(black):\r\n print('White')\r\nelse:\r\n print('Black')", "equality = 0\r\nchess_figure = dict(q=9, r=5, b=3, n=3, p=1,k=0)\r\n\r\nfor _ in range(8):\r\n\tfor i in input():\r\n\t\tif i == \".\":\r\n\t\t\tcontinue\r\n\t\telif i.isupper():\r\n\t\t\tequality += chess_figure[i.lower()]\r\n\t\telse:\r\n\t\t\tequality -= chess_figure[i]\t\t\r\n\t\t\t\r\nif equality > 0: print(\"White\")\r\nelif equality == 0: print(\"Draw\")\r\nelse: print(\"Black\")", "n = 8\r\n\r\nrows = []\r\n\r\nfor i in range(n):\r\n\r\n rows.append(input().rstrip())\r\nw, b = 0, 0\r\nfor i in range(n):\r\n for j in range(n):\r\n e = rows[i][j]\r\n if e == 'Q':\r\n w += 9\r\n elif e == 'R':\r\n w += 5\r\n elif e == 'B':\r\n w += 3\r\n elif e == 'N':\r\n w += 3\r\n elif e == 'P':\r\n w += 1\r\n if e == 'q':\r\n b += 9\r\n elif e == 'r':\r\n b += 5\r\n elif e == 'b':\r\n b += 3\r\n elif e == 'n':\r\n b += 3\r\n elif e == 'p':\r\n b += 1\r\n\r\nif w > b:\r\n print(\"White\")\r\nelif b > w:\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")\r\n", "w=b=0\r\nfor i in range(8):\r\n\ts=input()\r\n\tw+=(s.count(\"Q\")*9+s.count(\"R\")*5+s.count(\"B\")*3+s.count(\"N\")*3+s.count(\"P\")*1)\r\n\tb+=(s.count(\"q\")*9+s.count(\"r\")*5+s.count(\"b\")*3+s.count(\"n\")*3+s.count(\"p\")*1)\r\n\t\r\nif w>b:\r\n\tprint(\"White\")\r\nelif b>w:\r\n\tprint(\"Black\")\r\nelse:\r\n\tprint(\"Draw\")", "d = {\r\n 'k':0, 'K':0,\r\n 'q':9, 'Q':9,\r\n 'r':5, 'R':5,\r\n 'b':3, 'B':3,\r\n 'n':3, 'N':3,\r\n 'p':1, 'P':1,\r\n }\r\nb=w=0\r\nfor i in range(8):\r\n t = input()\r\n for j in range(8):\r\n if t[j].islower(): b+=d[t[j]]\r\n elif t[j].isupper(): w+=d[t[j]]\r\nif w>b: print('White')\r\nelif b>w: print('Black')\r\nelse: print('Draw')", "counts = {}\r\npoints = {\r\n 'Q': 9,\r\n 'R': 5,\r\n 'B': 3,\r\n 'N': 3,\r\n 'P': 1,\r\n 'K': 0\r\n}\r\nwhite = 0\r\nblack = 0\r\nfor _ in range(8):\r\n string = input()\r\n for i in range(8):\r\n if string[i] == '.':\r\n pass\r\n elif string[i].islower():\r\n black += points[string[i].upper()]\r\n else:\r\n white += points[string[i]]\r\nif white > black:\r\n print('White')\r\nelif black > white:\r\n print('Black')\r\nelse:\r\n print('Draw')", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nweights = {\"Q\": 9, \"R\": 5, \"B\": 3, \"N\": 3, \"P\": 1, \"K\": 0, '.': 0}\r\n\r\ndata = [input().rstrip() for _ in range(8)]\r\n\r\nf = 0\r\ns = 0\r\n\r\nfor i in data:\r\n for j in i:\r\n if j.islower():\r\n s += weights[j.upper()]\r\n else:\r\n f += weights[j]\r\n\r\nif f == s:\r\n print(\"Draw\")\r\nelse:\r\n print(\"White\" if f > s else \"Black\")", "d=dict(zip('qrbnp',[9,5,3,3,1]))\r\na=''.join([input()for _ in[0]*8])\r\nb=sum(a.count(x)*d[x]for x in 'qrbnp')\r\nw=sum(a.count(x)*d[x.lower()]for x in 'QRBNP'if x in a)\r\nprint([['White','Black'][b>w],'Draw'][w==b])\r\n", "# A. A and B and Chess\r\n\r\nweights = {\r\n 'q': 9,\r\n 'r': 5,\r\n 'b': 3,\r\n 'n': 3,\r\n 'p': 1,\r\n 'k': 0\r\n}\r\n\r\nwhite, black = 0, 0\r\n\r\nfor _ in range(8):\r\n row = input()\r\n for ch in row:\r\n if ch != '.':\r\n current = weights[ch.lower()]\r\n if ch.islower():\r\n black += current\r\n else:\r\n white += current\r\n\r\nif white > black:\r\n print(\"White\")\r\nelif black > white:\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")\r\n", "'''\r\n\r\n\r\n'''\r\nb = {\r\n 'q':9,\r\n 'r':5, \r\n 'b':3,\r\n 'n':3,\r\n 'p':1, \r\n 'k':0,\r\n}\r\nw = {\r\n 'Q':9,\r\n 'R':5, \r\n 'B':3,\r\n 'N':3,\r\n 'P':1, \r\n 'K':0,\r\n}\r\n\r\n\r\nl = []\r\nwcnt = 0\r\nbcnt = 0\r\nfor XD in range(8):\r\n l.append(list(input()))\r\n# print(l)\r\nfor i in l:\r\n for j in i:\r\n if(j != '.'):\r\n try:\r\n bcnt+=b[j]\r\n except:\r\n wcnt+=w[j]\r\nif(wcnt == bcnt):\r\n print(\"Draw\")\r\nelif(wcnt>bcnt):\r\n print('White')\r\nelse:\r\n print('Black')\r\n \r\n \r\n ", "import math\r\ns=0\r\np=0\r\nfor i in range(8):\r\n b=input()\r\n for i in range(8):\r\n if(b[i]=='Q'):\r\n s=s+9\r\n if (b[i] == 'R'):\r\n s=s+5\r\n if (b[i] == 'B'):\r\n s=s+3\r\n if (b[i] == 'N'):\r\n s=s+3\r\n if (b[i] == 'P'):\r\n s=s+1\r\n if (b[i] == 'K'):\r\n s=s+0\r\n if (b[i] == 'q'):\r\n p=p+9\r\n if (b[i] == 'r'):\r\n p=p+5\r\n if (b[i] == 'b'):\r\n p=p+3\r\n if (b[i] == 'n'):\r\n p=p+3\r\n if (b[i] == 'p'):\r\n p=p+1\r\n if (b[i] == 'k'):\r\n p=p+0\r\nif(s>p):\r\n print(\"White\")\r\nelif(p>s):\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")", "data1 = ['Q', 9,'R', 5,'B', 3,'N', 3,'P', 1,'K', 0]\r\ndata2 = ['q', 9,'r', 5,'b', 3,'n', 3,'p', 1,'k', 0]\r\n\r\ndata = [input(),input(),input(),input(),input(),input(),input(),input()]\r\n\r\nsum1, sum2 = 0, 0\r\n\r\nfor i in range(len(data)):\r\n for p in data[i]:\r\n if p == '.':\r\n continue\r\n if p in data1:\r\n sum1 += data1[data1.index(p)+1]\r\n if p in data2:\r\n sum2 += data2[data2.index(p)+1]\r\n\r\nif sum1==sum2:\r\n print('Draw')\r\nelif sum1>sum2:\r\n print('White')\r\nelse:\r\n print('Black')", "d={'q':9,'r':5,'b':3,'n':3,'p':1,'k':0}\na,b=0,0\nfor _ in range(8):\n for i in input():\n if i!='.':\n if i.isupper():\n a+=d[i.lower()]\n else:b+=d[i]\nif(a==b):print('Draw')\nelse: print('White' if a>b else 'Black')", "white, black = 0, 0 \r\nfor _ in range(8):\r\n zeile = input()\r\n for c in zeile:\r\n if c=='Q': white+=9\r\n elif c == 'q': black +=9\r\n elif c=='R': white+=5\r\n elif c=='r': black +=5\r\n elif c=='B' or c=='N': white+=3\r\n elif c=='b' or c=='n': black+=3\r\n elif c=='P': white+=1\r\n elif c=='p': black+=1\r\n \r\nif white > black:\r\n print('White')\r\nelif white < black:\r\n print('Black')\r\nelse:\r\n print('Draw')", "v=8\r\nl=[]\r\nh=0\r\ns1=0\r\ns2=0\r\nqq='q'\r\nQQ='Q'\r\nrr='r'\r\nRR='R'\r\nbb='b'\r\nBB='B'\r\nnn='n'\r\nNN='N'\r\npp='p'\r\nPP='P'\r\nKK='K'\r\nkk='k'\r\nfor i in range (v):\r\n f=input()\r\n for h in f:\r\n l.append (h)\r\n if h=='r':\r\n s1+=5\r\n if h=='R':\r\n s2+=5\r\n if h=='q':\r\n s1+=9\r\n if h=='Q':\r\n s2+=9\r\n if h=='b':\r\n s1+=3\r\n if h=='B':\r\n s2+=3\r\n if h=='n':\r\n s1+=3\r\n if h=='N':\r\n s2+=3\r\n if h=='p':\r\n s1+=1\r\n if h=='P':\r\n s2+=1\r\n if h=='k':\r\n s1+=0\r\n if h=='K':\r\n s2+=0\r\nif s1>s2:\r\n print(\"Black\")\r\nelif s1<s2:\r\n print (\"White\")\r\nelif s1==s2:\r\n print(\"Draw\")\r\n\r\n\r\n", "if __name__ == \"__main__\":\r\n\tbook = {\r\n\r\n\t\t'p': 1,\r\n\t\t'P': 1,\r\n\t\t'q': 9,\r\n\t\t'Q': 9,\r\n\t\t'r': 5,\r\n\t\t'R': 5,\r\n\t\t'b': 3,\r\n\t\t'B': 3,\r\n\t\t'n': 3,\r\n\t\t'N': 3,\r\n\t\t'K': 0\r\n\t}\r\n\r\n\ttotal_white = total_black = 0\r\n\tfor T in range(8):\r\n\t\tstring = input()\r\n\r\n\t\tfor s in string:\r\n\t\t\tif s in book:\r\n\t\t\t\tif s == '.':\r\n\t\t\t\t\tcontinue\r\n\t\t\t\telif s.islower():\r\n\t\t\t\t\ttotal_black += book[s]\r\n\t\t\t\telse:\r\n\t\t\t\t\ttotal_white += book[s]\r\n\r\n\r\n\tif total_black > total_white:\r\n\t\tprint('Black')\r\n\telif total_white > total_black:\r\n\t\tprint('White')\r\n\telse:\r\n\t\tprint('Draw')\r\n\r\n", "dictionaryA = {\"Q\": 9, \"R\": 5, \"B\": 3, \"N\": 3, \"P\": 1, \"K\":0}\ndictionaryB = {\"q\": 9, \"r\": 5, \"b\": 3, \"n\": 3, \"p\": 1, \"k\":0}\nwhite = 0\nblack = 0\nfor _ in range(8):\n arr_temp = list(input())\n for i in range (len(arr_temp)):\n if arr_temp[i] in dictionaryA:\n white += dictionaryA[arr_temp[i]]\n elif arr_temp[i] in dictionaryB:\n black += dictionaryB[arr_temp[i]]\n\nif(white > black):\n print(\"White\")\nelif(black > white):\n print(\"Black\")\nelse:\n print(\"Draw\")\n \t\t \t \t\t \t\t\t\t\t \t\t\t \t \t\t \t", "flag = 8\r\nwhite = 0\r\nblack = 0\r\nA = {'q':9,'r':5,'b':3,'n':3,'p':1,'k':0}\r\nB = {'Q':9,'R':5,'B':3,'N':3,'P':1,'K':0}\r\nwhile(flag):\r\n l = [x for x in input() if x!='.']\r\n l = l[:8]\r\n for i in l:\r\n if(i.isupper()):\r\n white+=B[i]\r\n else:\r\n black+=A[i]\r\n flag-=1\r\nif(white > black):\r\n print(\"White\")\r\nelif(white < black):\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")", "sum0 = 0\r\nsum1 = 0\r\nfor j in range(8):\r\n x = list(input())\r\n for i in range(8):\r\n if x[i] == \"Q\":\r\n sum0 += 9\r\n elif x[i] == \"R\":\r\n sum0 += 5\r\n elif x[i] == \"B\" or x[i] == \"N\":\r\n sum0 += 3\r\n elif x[i] == \"P\":\r\n sum0 += 1\r\n elif x[i] == \"q\":\r\n sum1 += 9\r\n elif x[i] == \"r\":\r\n sum1 += 5\r\n elif x[i] == \"b\" or x[i] == \"n\":\r\n sum1 += 3\r\n elif x[i] == \"p\":\r\n sum1 += 1\r\nif sum0 > sum1:\r\n print(\"White\")\r\nelif sum0 < sum1:\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")", "weights = {\"Q\":9, \"R\":5, \"B\":3, \"N\":3, \"P\":1}\nblack = 0\nwhite = 0\nfor i in range(8):\n row = input()\n for j in row:\n\n if j.isupper() and j!=\"K\":\n white += weights[j]\n\n elif j.islower() and j!=\"k\":\n black += weights[j.upper()]\n\nif white>black: print(\"White\")\nelif black>white: print(\"Black\")\nelse: print(\"Draw\")\n", "input_str = ''\r\n\r\nfor i in range(8):\r\n input_str += str(input())\r\n\r\nwhite = 0\r\nwhite += input_str.count('Q')*9\r\nwhite += input_str.count('R')*5\r\nwhite += input_str.count('B')*3\r\nwhite += input_str.count('N')*3\r\nwhite += input_str.count('P')*1\r\n\r\nblack = 0\r\nblack += input_str.count('q')*9\r\nblack += input_str.count('r')*5\r\nblack += input_str.count('b')*3\r\nblack += input_str.count('n')*3\r\nblack += input_str.count('p')*1\r\n\r\nif white > black:\r\n print('White')\r\n\r\nif white < black:\r\n print('Black')\r\n\r\nif white == black:\r\n print('Draw')\r\n", "w = [['q',9],['r',5],['b',3],['n',3],['p',1],['k',0]]\r\nb = [['Q',9],['R',5],['B',3],['N',3],['P',1],['K',0]]\r\nwhite = 0\r\nblack = 0\r\nfor _ in range(8):\r\n s = input()\r\n for i in s:\r\n if i == 'q':\r\n white += w[0][1]\r\n elif i == 'r':\r\n white += w[1][1]\r\n elif i == 'b':\r\n white += w[2][1]\r\n elif i == 'n':\r\n white += w[3][1]\r\n elif i == 'p':\r\n white += w[4][1]\r\n elif i == 'Q':\r\n black += b[0][1]\r\n elif i == 'R':\r\n black += b[1][1]\r\n elif i == 'B':\r\n black += b[2][1]\r\n elif i == 'N':\r\n black += b[3][1]\r\n elif i == 'P':\r\n black += b[4][1]\r\nif black == white:\r\n print('Draw')\r\nelif black > white:\r\n print('White')\r\nelse:\r\n print('Black')", "s=\"\"\r\nfor __ in range(8):\r\n s+=str(input())\r\nwhite=s.count(\"Q\")*9+s.count(\"R\")*5+s.count(\"N\")*3+s.count(\"B\")*3+s.count(\"P\")\r\nbalk=s.count(\"q\")*9+s.count(\"r\")*5+s.count(\"n\")*3+s.count(\"b\")*3+s.count(\"p\")\r\nif white==balk:print(\"Draw\")\r\nelif white>balk:print(\"White\")\r\nelse:print(\"Black\")", "lst=[]\r\ndt = {'Q':9, 'R':5, 'B':3, 'N':3, 'P':1, 'K':0}\r\na,b = 0,0\r\n\r\nfor i in range(8):\r\n lst.append(input())\r\n\r\nfor i in range(8):\r\n for j in range(8):\r\n if lst[i][j].isupper() and lst[i][j] in dt.keys():\r\n a += dt[lst[i][j]]\r\n \r\n elif lst[i][j].islower() and lst[i][j].upper() in dt.keys() :\r\n b += dt[lst[i][j].upper()]\r\n \r\nif a>b:\r\n print(\"White\")\r\nelif a==b:\r\n print(\"Draw\")\r\nelse:\r\n print(\"Black\")", "e=[]\r\nd=[]\r\nfor i in range(8):\r\n a=input()\r\n for i in range(8):\r\n if a[i].isalpha() == True:\r\n if (a[i].islower()) == True:\r\n e.append(a[i])\r\n else:\r\n d.append(a[i].lower())\r\nw = 0\r\nb = 0\r\nfor i in e:\r\n if i == 'p':\r\n b+=1\r\n elif i == 'q':\r\n b+=9\r\n elif i == 'k':\r\n b+=0\r\n elif i == 'r':\r\n b+=5\r\n elif i == 'b':\r\n b+=3\r\n else:\r\n b+=3\r\nfor i in d:\r\n if i == 'p':\r\n w+=1\r\n elif i == 'q':\r\n w+=9\r\n elif i == 'k':\r\n w+=0\r\n elif i == 'r':\r\n w+=5\r\n elif i == 'b':\r\n w+=3\r\n else:\r\n w+=3\r\nif w>b:\r\n print('White')\r\nelif b>w:\r\n print('Black')\r\nelse:\r\n print('Draw')\r\n", "D = {'Q':9,'R':5,'B':3,'N':3,'P':1,'K':0,'q':9,'r':5,'b':3,'n':3,'p':1,'k':0,}\r\nS = [str(input()) for i in range(8)]\r\nw = 0\r\nb = 0\r\nfor s in S:\r\n for c in s:\r\n if c == '.':\r\n continue\r\n if c.isupper():\r\n w += D[c]\r\n if c.islower():\r\n b += D[c]\r\nif w > b:\r\n print('White')\r\nelif w == b:\r\n print('Draw')\r\nelse:\r\n print('Black')\r\n", "lst = []\r\nsub = []\r\nfor _ in range(8):\r\n s = input()\r\n lst.append(s)\r\nfor l in lst:\r\n for t in l:\r\n if t != '.':\r\n sub.append(t)\r\nbl = ['Q','R','B','N','P','K']\r\nwh = ['q', 'r', 'b', 'n', 'p', 'k']\r\npoint = [9,5,3,3,1,0]\r\nblack = 0\r\nwhit = 0\r\nfor i in range(6):\r\n black += (sub.count(bl[i]))*point[i]\r\n whit += (sub.count(wh[i]))*point[i]\r\nif black > whit:\r\n print('White')\r\nelif black < whit:\r\n print('Black')\r\nelse:\r\n print('Draw')\r\n", "def main():\r\n n, m = 8, 8\r\n arr = [input() for _ in range(n)]\r\n\r\n weight_white, weight_black = 0, 0\r\n for i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == \"q\":\r\n weight_black += 9\r\n elif arr[i][j] == \"Q\":\r\n weight_white += 9\r\n elif arr[i][j] == \"r\":\r\n weight_black += 5\r\n elif arr[i][j] == \"R\":\r\n weight_white += 5\r\n elif arr[i][j] == \"b\":\r\n weight_black += 3\r\n elif arr[i][j] == \"B\":\r\n weight_white += 3\r\n elif arr[i][j] == \"n\":\r\n weight_black += 3\r\n elif arr[i][j] == \"N\":\r\n weight_white += 3\r\n elif arr[i][j] == \"p\":\r\n weight_black += 1\r\n elif arr[i][j] == \"P\":\r\n weight_white += 1\r\n\r\n if weight_white > weight_black:\r\n print(\"White\")\r\n elif weight_white < weight_black:\r\n print(\"Black\")\r\n else:\r\n print(\"Draw\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "chess=\"\"\r\nfor i in range(8):\r\n ch=input()\r\n chess+=ch+\"\\n\"\r\n\r\n\r\nchess=chess.replace(\".\",\"\")\r\n\r\nq=chess.count(\"Q\")\r\n\r\np=chess.count(\"P\")\r\n\r\nn=chess.count(\"N\")\r\n\r\nr=chess.count(\"R\")\r\n\r\nb=chess.count(\"B\")\r\n\r\n\r\nqq=chess.count(\"q\")\r\n\r\npp=chess.count(\"p\")\r\n\r\nnn=chess.count(\"n\")\r\n\r\nrr=chess.count(\"r\")\r\n\r\nbb=chess.count(\"b\")\r\n\r\nwhite=q*9+r*5+b*3+p+n*3 \r\n\r\nblack=qq*9+rr*5+bb*3+pp+nn*3 \r\n \r\nif white>black:print(\"White\")\r\nelif black>white:print(\"Black\")\r\nelse:print(\"Draw\")\r\n", "board = [[c for c in input()] for _ in range(8)]\nvalue = {\n \"q\": 9,\n \"r\": 5,\n \"b\": 3,\n \"n\": 3,\n \"p\": 1,\n \"k\": 0,\n}\ndiff = 0\nfor r in range(8):\n for c in range(8):\n v = board[r][c]\n if v != \".\":\n cur = 1 if v.isupper() else -1\n cur *= value[v.lower()]\n diff += cur\nres = \"Draw\" if diff == 0 else \"White\" if diff > 0 else \"Black\"\nprint(res)\n", "w=0\r\nb=0\r\nfor i in range(8):\r\n s=input()\r\n for i in s:\r\n if(i=='Q'):\r\n w=w+9\r\n if(i=='B'):\r\n w=w+3\r\n if(i=='R'):\r\n w=w+5\r\n if(i=='N'):\r\n w=w+3\r\n if(i=='P'):\r\n w=w+1\r\n if(i=='q'):\r\n b=b+9\r\n if(i=='b'):\r\n b=b+3\r\n if(i=='r'):\r\n b=b+5\r\n if(i=='n'):\r\n b=b+3\r\n if(i=='p'):\r\n b=b+1\r\nif(b>w):\r\n print(\"Black\")\r\nelif(b==w):\r\n print(\"Draw\")\r\nelse:\r\n print(\"White\")\r\n", "if __name__=='__main__':\r\n \r\n weights = {}\r\n \r\n weights['Q'] = 9\r\n weights['R'] = 5\r\n weights['B'] = 3\r\n weights['N'] = 3\r\n weights['P'] = 1\r\n weights['K'] = 0\r\n \r\n weights['q'] = 9\r\n weights['r'] = 5\r\n weights['b'] = 3\r\n weights['n'] = 3\r\n weights['p'] = 1\r\n weights['k'] = 0\r\n \r\n sum_black = 0\r\n sum_white = 0\r\n \r\n for _ in range(8):\r\n line = input()\r\n for c in line:\r\n if c!='.':\r\n if c.islower():\r\n sum_black+=weights[c]\r\n else:\r\n sum_white+=weights[c]\r\n if sum_black>sum_white:\r\n print(\"Black\")\r\n elif sum_black<sum_white:\r\n print(\"White\")\r\n else:\r\n print(\"Draw\")\r\n ", "def calc(list):\n\tsum = 0\n\tfor i in list:\n\t\tif i == 'Q' or i == 'q': sum += 9\n\t\telif i == 'R' or i == 'r': sum += 5\n\t\telif i == 'B' or i == 'b': sum += 3\n\t\telif i == 'N' or i == 'n': sum += 3\n\t\telif i == 'P' or i == 'p': sum += 1\n\treturn sum\n\nteamW, teamB = [], []\nfor _ in range(8):\n\trow = input()\n\tfor i in row:\n\t\tif i >= 'A' and i <= 'Z': teamW.append(i)\n\t\tif i >= 'a' and i <= 'z': teamB.append(i)\nwhite, black = calc(teamW), calc(teamB)\nif white > black: print('White')\nelif black > white: print('Black')\nelse: print('Draw')\n \t \t \t \t\t\t \t\t \t \t \t\t\t\t \t\t \t", "# LUOGU_RID: 113554366\na=''\r\nfor i in range(8):\r\n a+=input()\r\ns1=a.count('Q')*9+a.count('R')*5+a.count('B')*3+a.count('N')*3+a.count('P')\r\ns2=a.count('q')*9+a.count('r')*5+a.count('b')*3+a.count('n')*3+a.count('p')\r\nif s1>s2:\r\n print('White')\r\nelif s1==s2:\r\n print('Draw')\r\nelse:\r\n print('Black')", "w=0\r\nb=0\r\nm=[input() for i in range(8)]\r\nfor line in m:\r\n for p in line:\r\n if p==\"Q\":\r\n w+=9\r\n elif p==\"R\":\r\n w+=5\r\n elif p==\"B\" or p==\"N\":\r\n w+=3\r\n elif p==\"P\":\r\n w+=1\r\n if p==\"q\":\r\n b+=9\r\n elif p==\"r\":\r\n b+=5\r\n elif p==\"b\" or p==\"n\":\r\n b+=3\r\n elif p==\"p\":\r\n b+=1\r\nif w>b:\r\n print(\"White\")\r\nelif b>w:\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")\r\n \r\n", "from collections import Counter\r\nstring = ['Q', 'R', 'B', 'N', 'P']\r\nnumber = [9, 5, 3, 3, 1]\r\nt = 8\r\nWhite = 0\r\nBlack = 0\r\nwhile t:\r\n s = input()\r\n p = Counter(s)\r\n for i in range(5):\r\n White += (p[string[i]] * number[i])\r\n Black += (p[string[i]. lower()] * number[i])\r\n t -= 1\r\nif White > Black:\r\n print('White')\r\nelif White < Black:\r\n print('Black')\r\nelse:\r\n print('Draw')\r\n", "w = {'Q': 9, 'R': 5, 'B': 3, 'N': 3, 'P': 1, 'K': 0}\r\nb = {'q': 9, 'r': 5, 'b': 3, 'n': 3, 'p': 1, 'k': 0}\r\nwhite = black = 0\r\nfor _ in range(8):\r\n row = input()\r\n for c in row:\r\n if c in w:\r\n white += w[c]\r\n elif c in b:\r\n black += b[c]\r\nif white > black:\r\n print('White')\r\nelif black > white:\r\n print('Black')\r\nelse:\r\n print('Draw')", "s, cnt, k, kk = [0, 0], [0] * 256, ['q', 'r', 'b', 'n', 'p', 'k'], [9, 5, 3, 3, 1, 0]\r\nfor x in range(len(k)): cnt[ord(k[x])], cnt[ord(k[x]) - 32] = kk[x], kk[x]\r\nfor u in range(8):\r\n ss = input()\r\n for x in ss:\r\n if x != '.' and ord(x) < 91: s[0] += cnt[ord(x)]\r\n elif x != '.' and ord(x) > 96: s[1] += cnt[ord(x)]\r\nprint(\"Draw\") if s[0] == s[1] else (print(\"White\") if s[0] > s[1] else print(\"Black\"))", "d = {\"q\": 9, \"r\": 5, \"b\": 3, \"n\": 3, \"p\": 1}\r\n\r\nb = 0\r\nc = 0\r\nfor _ in range(8):\r\n a = input()\r\n for p in a:\r\n if p == '.':\r\n continue\r\n if p.lower() == \"k\":\r\n continue\r\n if p.upper() == p:\r\n c += d[p.lower()]\r\n continue\r\n b += d[p]\r\nprint(\"Draw\" if b == c else \"White\" if c > b else \"Black\")", "a = []\r\nfor i in range(8):\r\n c = []\r\n b = str(input())\r\n for j in b:\r\n c.append(j)\r\n a.append(c)\r\n \r\nblack = 0\r\nwhite = 0\r\n \r\nfor q in a:\r\n for w in q:\r\n if w != \".\":\r\n if str(w).islower() == True:\r\n weights = {\"q\" : 9 ,\"r\" :5 ,\"b\" : 3 ,\"n\" : 3 ,\"p\" : 1 ,\"k\" : 0}\r\n black += weights[w]\r\n \r\n elif str(w).isupper() == True: \r\n weights = {\"Q\" : 9 ,\"R\" :5 ,\"B\" : 3 ,\"N\" : 3 ,\"P\" : 1 ,\"K\" : 0}\r\n white += weights[w]\r\n \r\n else:\r\n pass\r\n \r\nif black > white:\r\n print(\"Black\")\r\n \r\nelif black == white:\r\n print(\"Draw\")\r\n \r\nelif white > black: \r\n print(\"White\") ", "d = dict(q=9, Q=-9, r=5, R=-5, b=3, B=-3, n=3, N=-3, p=1, P=-1)\r\nf=0\r\nfor i in range(8):\r\n s=input()\r\n for j in s:\r\n if j in d:\r\n f += d[j]\r\nprint(['Draw', 'Black', 'White'][(f > 0) - (f < 0)])", "white = 0\r\nblack = 0\r\nfor _ in range(8):\r\n x = input().split()\r\n lis = [char for char in x[0] if char.isalpha()]\r\n for i in lis:\r\n if (i == 'Q'):\r\n white+=9\r\n if(i == 'q'):\r\n black+=9\r\n if (i == 'R'):\r\n white+=5\r\n if(i == 'r'):\r\n black+=5\r\n if (i == 'B'):\r\n white+=3\r\n if(i == 'b'):\r\n black+=3\r\n if (i == 'N'):\r\n white+=3\r\n if(i == 'n'):\r\n black+=3\r\n if (i == 'P'):\r\n white+=1\r\n if(i == 'p'):\r\n black+=1\r\nif(white > black):\r\n print(\"White\")\r\nelif(black > white):\r\n print('Black')\r\nelse:\r\n print(\"Draw\")", "w = 0\r\nb = 0\r\nfor i in range(8):\r\n s = input()\r\n w += s.count(\"Q\") * 9\r\n b += s.count(\"q\") * 9\r\n w += s.count(\"R\") * 5\r\n b += s.count(\"r\") * 5\r\n w += s.count(\"B\") * 3\r\n b += s.count(\"b\") * 3\r\n w += s.count(\"N\") * 3\r\n b += s.count(\"n\") * 3\r\n w += s.count(\"P\") \r\n b += s.count(\"p\")\r\nif w > b:\r\n print(\"White\")\r\nelif w < b:\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")", "maindict = {'q':9, 'r':5, 'b':3, 'n':3, 'p':1, 'k':0}\r\nallinputs = [input() for i in range(8)]\r\n\r\ndef weightage(maindict, allinputs):\r\n longstring = ''.join(allinputs)\r\n finalstring = longstring.replace('.', '')\r\n black = [i for i in finalstring if i.islower()]\r\n white = [*map(lambda x: x.lower(), [i for i in finalstring if i.isupper()])]\r\n black_value = [*map(lambda x: maindict[x], black)]\r\n white_value = [*map(lambda x: maindict[x], white)]\r\n if sum(black_value) == sum(white_value):\r\n print('Draw')\r\n elif sum(black_value) > sum(white_value):\r\n print('Black')\r\n else:\r\n print('White')\r\n \r\n \r\nweightage(maindict, allinputs)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Aug 22 15:48:35 2021\r\n\r\n@author: rupert\r\n\"\"\"\r\n\r\nimport sys\r\nsysinput = sys.stdin.readline\r\n#sysinput = input\r\n############ ---- Input Functions ---- ############\r\ndef readint():\r\n return(int(sysinput()))\r\ndef readlst():\r\n return(list(map(int,sysinput().split())))\r\ndef readchlst():\r\n s = sysinput()\r\n lst = list(s[:])\r\n try:\r\n lst.remove('\\n')\r\n finally:\r\n return(lst)\r\ndef readintlst():\r\n return(list(map(int,sysinput().split())))\r\n\r\ndef weight(c):\r\n WorB = c.isupper()\r\n w = weightdict[c.upper()]\r\n return WorB, w\r\n\r\nweightdict = dict({'Q': 9, 'R': 5, 'B': 3, 'N': 3, 'P': 1, 'K':0})\r\nwhite = 0 #True\r\nblack = 0 #False\r\nfor i in range(8):\r\n s = readchlst()\r\n for j in range(8):\r\n if s[j] != '.':\r\n w = weight(s[j]) #output: WorB, weight\r\n white += w[0]*w[1]\r\n black += (1-w[0])*w[1]\r\n \r\n#print(white, black) \r\nif white > black:\r\n print('White')\r\nelif black > white:\r\n print('Black')\r\nelif black == white:\r\n print('Draw')", "l = {'q':9,'r':5,'b':3,'n':3,'p':1,'Q':-9,'R':-5,'B':-3,'N':-3,'P':-1,'.':0,'k':0,'K':0}\r\n\r\nw = [l[x] for i in range(8) for x in input()]\r\ns = sum(w)\r\nprint(\"Black\" if s > 0 else \"White\" if s < 0 else \"Draw\")", "solve = {\"Q\":9, \"R\":5 , \"B\":3, \"N\":3, \"P\":1}\r\n\r\ns = ''\r\no = 0\r\nq = 0 \r\nfor x in range(0, 8):\r\n a = input()\r\n for x in a:\r\n if(x=='.' or x=='K' or x== \"k\"):\r\n continue\r\n else:\r\n s += x\r\nfor x in s:\r\n if(ord(x) >= 65 and ord(x)<=90):\r\n o += solve[x]\r\n else:\r\n q += solve[x.upper()]\r\n\r\nif(o>q): print('White')\r\n\r\nelif(q>o): print('Black')\r\n\r\nelse: print('Draw')\r\n \r\n \r\n", "def weight(lst):\n sum = 0\n for x in lst:\n if x == 'Q' or x == 'q': sum += 9\n elif x == 'R' or x == 'r': sum += 5\n elif x == 'B' or x == 'b': sum += 3\n elif x == 'N' or x == 'n': sum += 3\n elif x == 'P' or x == 'p': sum += 1\n # elif x == 'K' or x == 'k': sum += 0\n return sum\n\nW, B = [], []\nfor _ in range(8):\n s = input()\n for i in s:\n if i.isupper(): W.append(i)\n elif i.islower(): B.append(i)\n \nweight_W = weight(W)\nweight_B = weight(B)\nif weight_W > weight_B: print(\"White\")\nelif weight_W < weight_B: print(\"Black\")\nelse: print(\"Draw\")\n \t \t \t\t\t \t \t\t \t\t\t\t \t \t\t", "W = 0\nB = 0\nfor x in range(0,8):\n a = input()\n for y in a:\n if y == 'Q':\n W = W + 9 \n elif y == 'R':\n W = W + 5 \n elif y == 'B':\n W = W + 3\n elif y == 'N':\n W = W + 3\n elif y == 'P':\n W = W + 1\n elif y == 'q':\n B = B + 9\n elif y == 'r':\n B = B + 5\n elif y == 'b':\n B = B + 3\n elif y == 'n':\n B = B + 3\n elif y == 'p':\n B = B + 1\n else:\n pass \nif B>W:\n print('Black')\nelif B<W:\n print('White')\nelse:\n print('Draw')\n\t\t \t\t \t\t\t \t\t\t \t\t \t \t\t \t\t \t", "values = {'Q': 9, 'R': 5, 'B': 3, 'N': 3, 'P': 1}\r\nboard = \"\"\r\nfor _ in range(8):\r\n rank = input()\r\n board += rank\r\n\r\nblack, white = 0, 0\r\nfor s in board:\r\n if s.islower():\r\n black += values.get(s.upper(), 0)\r\n else:\r\n white += values.get(s, 0)\r\n\r\nif white > black:\r\n print(\"White\")\r\nelif black > white:\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")\r\n", "i = 0\r\nwhite_power = 0\r\nblack_power = 0\r\npower_of_chess = {'Q':9, 'R':5, 'B':3, 'N':3, 'P':1, 'K':0, 'q':9, 'r':5, 'b':3, 'n':3, 'p':1, 'k':0}\r\nwhile i < 8:\r\n\tfigure_location = input()\r\n\tfor chess_figure in figure_location:\r\n\t\tif chess_figure != '.':\r\n\t\t\tif chess_figure.isupper() == True:\r\n\t\t\t\twhite_power += power_of_chess[chess_figure]\r\n\t\t\telse:\r\n\t\t\t\tblack_power += power_of_chess[chess_figure]\r\n\ti += 1\r\nif white_power > black_power:\r\n\tprint('White')\r\nelif black_power > white_power:\r\n\tprint('Black')\r\nelse:\r\n\tprint('Draw')", "white = 0\r\nblack = 0\r\n\r\nj = 0\r\nwhile j < 8:\r\n for i in list(input()):\r\n if i == \"Q\":\r\n white += 9\r\n elif i == \"q\":\r\n black += 9\r\n elif i == \"R\":\r\n white += 5\r\n elif i == \"r\":\r\n black += 5\r\n elif i == \"N\" or i == \"B\":\r\n white += 3\r\n elif i == \"n\" or i == \"b\":\r\n black += 3\r\n elif i == \"P\":\r\n white += 1\r\n elif i == \"p\":\r\n black += 1\r\n else:\r\n continue\r\n j += 1\r\n\r\nif white < black:\r\n print(\"Black\")\r\nelif white > black:\r\n print(\"White\")\r\nelse:\r\n print(\"Draw\")", "whites, blacks = 0, 0\r\nboard = \"\"\r\nfor i in range(8):\r\n board += input()\r\n\r\nvals = {\"q\": 9, \"r\": 5, \"b\" : 3, \"n\" : 3, \"p\" : 1}\r\nfor f in \"qrbnp\":\r\n blacks += board.count(f) * vals[f]\r\nfor f in \"qrbnp\".upper():\r\n whites += board.count(f) * vals[f.lower()]\r\n\r\nif whites > blacks:\r\n print(\"White\")\r\nelif whites == blacks:\r\n print(\"Draw\")\r\nelse:\r\n print(\"Black\")\r\n", "white = 0\r\nblack = 0\r\nfor _ in range(8):\r\n t = input()\r\n for i in t:\r\n if i.isupper(): #'q', 'r', 'b', 'n', 'p', 'k''\r\n if i == 'Q':\r\n white += 9\r\n elif i == 'R':\r\n white += 5\r\n elif i == 'B':\r\n white += 3\r\n elif i == 'N':\r\n white += 3\r\n elif i == 'P':\r\n white += 1\r\n elif i.islower():\r\n if i == 'q':\r\n black += 9\r\n elif i == 'r':\r\n black += 5\r\n elif i == 'b':\r\n black += 3\r\n elif i == 'n':\r\n black += 3\r\n elif i == 'p':\r\n black += 1\r\nif white > black:\r\n print(\"White\")\r\nelif black > white:\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")\r\n", "c1=c2=0\r\nfor i in range(8):\r\n\ts=list(input())\r\n\tfor i in s:\r\n\t\tif i==\"N\" or i==\"B\":\r\n\t\t\tc1+=3\r\n\t\telif i==\"Q\":\r\n\t\t\tc1+=9\r\n\t\telif i==\"R\":\r\n\t\t \tc1+=5\r\n\t\telif i==\"P\":\r\n\t\t\tc1+=1\r\n\t\telif i==\"n\" or i==\"b\":\r\n\t\t\tc2+=3\r\n\t\telif i==\"q\":\r\n\t\t\tc2+=9\r\n\t\telif i==\"r\":\r\n\t\t \tc2+=5\r\n\t\telif i==\"p\":\r\n\t\t\tc2+=1\r\n# print(c1,c2)\r\nif c1>c2:\r\n\tprint(\"White\")\r\nelif c1==c2:\r\n\tprint(\"Draw\")\r\nelse:\r\n\tprint(\"Black\")", "\r\ndef is_there_odd(s):\r\n for i in range(len(s)):\r\n if not i % 2:\r\n if int(s[i]) % 2:\r\n return True\r\n return False\r\n\r\ndef is_there_even(s):\r\n for i in range(len(s)):\r\n if i % 2:\r\n if not int(s[i]) % 2:\r\n return True\r\n return False\r\n\r\n\r\ndef main_function():\r\n dict = {\"q\": 9, \"r\": 5, \"b\": 3, \"n\": 3, \"p\": 1}\r\n white = 0\r\n black = 0\r\n for i in range(8):\r\n s = input()\r\n for i in s:\r\n if i.lower() in dict:\r\n if i.islower():\r\n black += dict[i.lower()]\r\n else:\r\n white += dict[i.lower()]\r\n if white > black:\r\n return \"White\"\r\n elif black > white:\r\n return \"Black\"\r\n else:\r\n return \"Draw\"\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())\r\n\r\n\r\n\r\n\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n b = 0\r\n w = 0\r\n for s in wtf:\r\n for p in s:\r\n if p == 'p':\r\n b += 1\r\n elif p == 'P':\r\n w += 1\r\n elif p == 'n' or p == 'b':\r\n b += 3\r\n elif p == 'N' or p == 'B':\r\n w += 3\r\n elif p == 'r':\r\n b += 5\r\n elif p == 'R':\r\n w += 5\r\n elif p == 'q':\r\n b += 9\r\n elif p == 'Q':\r\n w += 9\r\n if w > b:\r\n print('White')\r\n elif w < b:\r\n print('Black')\r\n else:\r\n print('Draw')\r\n", "w=0\r\nbl=0\r\nfor xx in range(8):\r\n b=list(input())\r\n if 'Q' in b:\r\n w+=9*b.count('Q')\r\n if 'R' in b:\r\n w+=5*b.count('R')\r\n if 'B' in b:\r\n w+=3*b.count('B')\r\n if 'N' in b:\r\n w+=3*b.count('N')\r\n if 'P' in b:\r\n w+=1*b.count('P')\r\n if 'q' in b:\r\n bl+=9*b.count('q')\r\n if 'r' in b:\r\n bl+=5*b.count('r')\r\n if 'b' in b:\r\n bl+=3*b.count('b')\r\n if 'n' in b:\r\n bl+=3*b.count('n')\r\n if 'p' in b:\r\n bl+=1*b.count('p')\r\nif w>bl:\r\n print('White')\r\nelif w==bl:\r\n print('Draw')\r\nelse:\r\n print('Black')\r\n ", "from bisect import bisect_right\r\nimport math\r\nfrom queue import PriorityQueue\r\nfrom sys import stdin, stdout\r\nimport collections\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n a = [str_input() for i in range(8)]\r\n points = dict()\r\n points['p'] = 1\r\n points['n'] = 3\r\n points['b'] = 3\r\n points['r'] = 5\r\n points['k'] = 0\r\n points['q'] = 9\r\n wsum = 0\r\n bsum = 0\r\n for i in range(8):\r\n for j in range(8):\r\n if a[i][j] != '.':\r\n if str.isupper(a[i][j]):\r\n wsum += points[a[i][j].lower()]\r\n else:\r\n bsum += points[a[i][j]]\r\n if wsum > bsum:\r\n print(f\"White\\n\")\r\n elif bsum > wsum:\r\n print(f\"Black\\n\")\r\n else:\r\n print(f\"Draw\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "d,f=dict(q=9,Q=-9,r=5,R=-5,b=3,B=-3,n=3,N=-3,p=1,P=-1),0\r\nfor i in range(8):\r\n s=input()\r\n for j in s:\r\n if j in d:f+=d[j]\r\nprint(['Draw','Black','White'][(f>0)-(f<0)])", "# Bismillah\r\n# In the name of GOD\r\n\r\nweights = {'K': 0, 'P': 1, 'N': 3, 'B': 3, 'R': 5, 'Q': 9, 'k': 0, 'p': -1, 'n': -3, 'b': -3, 'r': -5, 'q': -9, '.': 0}\r\n\r\ntotal = 0\r\ns = ''\r\nfor _ in range(8):\r\n\ts += input()\r\nfor i in range(64):\r\n\ttotal += weights[s[i]]\r\n\r\nif total > 0:\r\n\tprint('White')\r\nelif total < 0:\r\n\tprint('Black')\r\nelse:\r\n\tprint('Draw')\r\n", "dc = {'q': 9, 'r': 5, 'b' : 3, 'n' : 3, \"p\": 1, \"k\": 0}\r\n\r\nlst = [w.rstrip().replace(\".\",\"\") for w in open(0).readlines()]\r\npieces = \"\".join(lst)\r\nwh = 0\r\nfor x in pieces:\r\n if x in dc: wh -= dc[x]\r\n else: wh += dc[x.lower()]\r\nif wh == 0: print(\"Draw\")\r\nelif wh > 0: print(\"White\")\r\nelse: print(\"Black\")", "white = 0\r\nblack = 0\r\nfor _ in range(8):\r\n\tfor i in input():\r\n\t\tif (i == \"Q\"):\r\n\t\t\twhite += 9\r\n\t\telif (i == \"R\"):\r\n\t\t\twhite += 5\r\n\t\telif (i == \"B\"):\r\n\t\t\twhite += 3\r\n\t\telif (i == \"N\"):\r\n\t\t\twhite += 3\r\n\t\telif (i == \"P\"):\r\n\t\t\twhite += 1\r\n\t\r\n\t\telif (i == \"q\"):\r\n\t\t\tblack += 9\r\n\t\telif (i == \"r\"):\r\n\t\t\tblack += 5\r\n\t\telif (i == \"b\"):\r\n\t\t\tblack += 3\r\n\t\telif (i == \"n\"):\r\n\t\t\tblack += 3\r\n\t\telif (i == \"p\"):\r\n\t\t\tblack += 1\r\nif (white > black):\r\n\tprint(\"White\")\r\nelif (white < black):\r\n\tprint(\"Black\")\r\nelse: print(\"Draw\")", "def solve(arr, d):\r\n\tb_count = w_count = 0\r\n\tfor i in range(8):\r\n\t\tfor j in range(8):\r\n\t\t\tif arr[i][j] != '.':\r\n\t\t\t\tif arr[i][j].isupper():\r\n\r\n\t\t\t\t\tw_count += d[arr[i][j].lower()]\r\n\t\t\t\telse:\r\n\t\t\t\t\tb_count += d[arr[i][j].lower()]\r\n\r\n\tif b_count > w_count:\r\n\t\treturn \"Black\"\r\n\tif w_count > b_count:\r\n\t\treturn \"White\"\r\n\treturn \"Draw\"\r\n\r\narr = []\r\nfor _ in range(8):\r\n\ttemp = input()\r\n\tarr.append(temp)\r\nd = {\r\n\t'q': 9,\r\n\t'r': 5,\r\n\t'b': 3,\r\n\t'n': 3,\r\n\t'p': 1,\r\n\t'k': 0\r\n}\r\n\r\nprint(solve(arr, d))", "from collections import Counter\r\nw,b=0,0\r\nfor x in range(8):\r\n\ta=Counter(input())\r\n\tfor y in a.keys():\r\n\t\tif y.isupper():\r\n\t\t\tif y==\"Q\":\r\n\t\t\t\tw+=(9*a[\"Q\"])\r\n\t\t\telif y==\"R\":\r\n\t\t\t\tw+=(5*a[\"R\"])\r\n\t\t\telif y==\"B\":\r\n\t\t\t\tw+=(3*a[\"B\"])\r\n\t\t\telif y==\"N\":\r\n\t\t\t\tw+=(3*a[\"N\"])\r\n\t\t\telif y==\"P\":\r\n\t\t\t\tw+=(1*a[\"P\"])\r\n\t\telif y.islower():\r\n\t\t\tif y==\"q\":\r\n\t\t\t\tb+=(9*a[\"q\"])\r\n\t\t\telif y==\"r\":\r\n\t\t\t\tb+=(5*a[\"r\"])\r\n\t\t\telif y==\"b\":\r\n\t\t\t\tb+=(3*a[\"b\"])\r\n\t\t\telif y==\"n\":\r\n\t\t\t\tb+=(3*a[\"n\"])\r\n\t\t\telif y==\"p\":\r\n\t\t\t\tb+=(1*a[\"p\"])\r\nif w>b:\r\n\tprint(\"White\")\r\nelif w<b:\r\n\tprint(\"Black\")\r\nelse:\r\n\tprint(\"Draw\")", "black = {'q':9, 'r':5, 'b':3, 'n':3, 'p':1, 'k':0}\r\nwhite = {'Q':9, 'R':5, 'B':3, 'N':3, 'P':1, 'K':0}\r\nb = 0\r\nw = 0\r\ndoska = ''.join([input() for _ in range(8)])\r\nfor i in doska:\r\n if i in black:\r\n b += black[i]\r\n elif i in white:\r\n w += white[i]\r\nif b == w:\r\n print(\"Draw\") \r\nelse:\r\n print([\"White\", \"Black\"][b > w])", "d = {\"Q\": 9, \"R\": 5, \"B\": 3, \"N\": 3, \"P\": 1, \"K\": 0, \"q\": -9, \"r\": -5, \"b\": -3, \"n\": -3, \"p\": -1, \"k\": 0, \".\": 0}\r\nans = 0\r\nfor i in range(8):\r\n lst = input()\r\n for i in lst:\r\n ans += d[i]\r\nif ans > 0:\r\n print(\"White\")\r\nelif ans < 0:\r\n print(\"Black\")\r\nelse:\r\n print(\"Draw\")", "d = {'q': 9, 'r': 5, 'b': 3, 'n': 3, 'p': 1, 'k': 0}\r\nw = 0\r\nb = 0\r\nfor i in range(8):\r\n a = input()\r\n for j in range(8):\r\n if a[j] != '.':\r\n if a[j].isupper():\r\n w += d[a[j].lower()]\r\n else:\r\n b += d[a[j]]\r\nif w > b:\r\n print('White')\r\nelif w == b:\r\n print('Draw')\r\nelse:\r\n print('Black')\r\n", "x = {'q':9,'r':5,'b':3,'n':3,'p':1,'k':0,'.':0}\r\ny = {i.upper():-v for i,v in x.items()}\r\nz = {**x,**y}\r\n \r\ns = sum(z[v] for _r in range(8) for v in input())\r\nprint('White' if s<0 else 'Black' if s>0 else 'Draw')", "s1=0\r\ns2=0\r\nd={'Q':9,'R':5,'B':3,'N':3,'P':1,'K':0}\r\nfor _ in range(8):\r\n\ts=input()\r\n\tfor i in s:\r\n\t\tif i!='.':\r\n\t\t\tif i==i.upper():\r\n\t\t\t\ts1+=d[i]\r\n\t\t\telse:\r\n\t\t\t\ts2+=d[i.upper()]\r\nif s1>s2: print('White')\r\nelif s1<s2: print('Black')\r\nelse: print('Draw')", "arr2=[] #list used to store the data as a matrix\r\nwhite=['Q',9,'R',5,'B',3,'N',3,'P',1,'K',0] #weight\r\nblack=['q',9,'r',5,'b',3,'n',3,'p',1,'k',0] #weight\r\ntotal1=0 #white's point\r\ntotal2=0 #black's point\r\nfor i in range(8): #taking input of matrix\r\n y=str(input(\"\"))\r\n arr2.append(y)\r\nfor j in range(8): #checking each element\r\n for k in range(8):\r\n if arr2[j][k] in white: #for white\r\n ind=white.index(arr2[j][k]) #collecting the index\r\n total1+=white[ind+1] #extracting the weight by index+1\r\n if arr2[j][k] in black: #for black\r\n ind=black.index(arr2[j][k])\r\n total2+=black[ind+1]\r\n#checking score who win\r\nif(total1>total2):\r\n print(\"White\")\r\nif(total1<total2):\r\n print(\"Black\")\r\nif(total1==total2):\r\n print(\"Draw\")\r\n", "A=['P',1,'N',3,'B',3,'R',5,'Q',9]\r\nB=['p',1,'n',3,'b',3,'r',5,'q',9]\r\na1=[str(i)for i in input().split()]\r\na2=[str(i)for i in input().split()]\r\na3=[str(i)for i in input().split()]\r\na4=[str(i)for i in input().split()]\r\na5=[str(i)for i in input().split()]\r\na6=[str(i)for i in input().split()]\r\na7=[str(i)for i in input().split()]\r\na8=[str(i)for i in input().split()]\r\nb=a1+a2+a3+a4+a5+a6+a7+a8\r\nk1,k2=0,0\r\nfor i in range(8):\r\n for j in range(8):\r\n if b[i][j] in A:\r\n k1+=A[A.index(b[i][j])+1]\r\n elif b[i][j] in B:\r\n k2+=B[B.index(b[i][j])+1]\r\nif k1==k2:\r\n print('Draw')\r\nelif k1>k2:\r\n print('White')\r\nelse:\r\n print('Black')\r\n\r\n\r\n", "ves_white=0\r\nves_black=0\r\n\r\nfor i in range(8):\r\n n=input()\r\n for i in n:\r\n if i=='Q':\r\n ves_white+=9\r\n \r\n elif i=='R':\r\n ves_white+=5\r\n \r\n elif i=='B' or i=='N':\r\n ves_white+=3\r\n \r\n elif i=='P':\r\n ves_white+=1\r\n \r\n elif i=='q':\r\n ves_black+=9\r\n \r\n elif i=='r':\r\n ves_black+=5\r\n \r\n elif i=='b' or i=='n':\r\n ves_black+=3\r\n \r\n elif i=='p':\r\n ves_black+=1\r\n\r\n\r\nif ves_black>ves_white:\r\n print('Black')\r\n\r\nelif ves_white>ves_black:\r\n print('White')\r\n\r\nelse:\r\n print('Draw')" ]

[ "def main():\n c, hr, hb, wr, wb = map(int, input().split())\n ans = 0\n for i in range(10**6 + 1):\n if i * wr <= c:\n ans = max(ans, i * hr + ((c - i * wr) // wb) * hb)\n if i * wb <= c:\n ans = max(ans, i * hb + ((c - i * wb) // wr) * hr)\n print(ans)\n\n\n\n\n\nmain()", "__author__ = 'trunghieu11'\r\n\r\ndef calc(n, h1, h2, w1, w2):\r\n answer = 0\r\n len = n // w1\r\n for i in range(0, min(len, 100000) + 1):\r\n answer = max(answer, i * h1 + (n - i * w1) // w2 * h2)\r\n return answer\r\n\r\nn, hR, hB, wR, wB = map(int, input().split())\r\nprint(max(calc(n, hR, hB, wR, wB), calc(n, hB, hR, wB, wR)))", "import math\r\n\r\nc, hr, hb, wr, wb = map(int, input().split())\r\ns = int(math.sqrt(c))\r\nans = 0\r\nfor i in range(s):\r\n if c >= i * wr:\r\n ans = max(ans, hr * i + (c - i * wr) // wb * hb)\r\n if c >= i * wb:\r\n ans = max(ans, hb * i + (c - i * wb) // wr * hr)\r\n\r\nprint(ans)", "c, hr, hb, wr, wb = [int(x) for x in input().split()]\r\nbest = 0\r\nif hb * wr < hr * wb:\r\n hr, hb, wr, wb = hb, hr, wb, wr\r\nk = c // wb\r\nfor i in range(100000):\r\n m = (c - k * wb) // wr\r\n best = max(best, k * hb + m * hr)\r\n delta = c - k * wb - m * wr\r\n t = 1\r\n if wr > delta:\r\n t = (wr - delta + wb - 1) // wb\r\n k -= t\r\n if k < 0:\r\n break\r\nprint(best)\r\n", "a, b, c, d, e = list(map(int, input().split(' ')))\r\ncheck = int(a**0.5)\r\n\r\n#red candy\r\n#height b\r\n#weight d\r\n\r\n#blue candy\r\n#height c\r\n#weight e\r\n\r\nans = 0\r\nfor red in range(check+1):\r\n blue = (a-d*red)//(e)\r\n if blue >= 0:\r\n ans = max(ans, red*b+blue*c)\r\n\r\nfor blue in range(check+1):\r\n red = (a-e*blue)//(d)\r\n if red >= 0:\r\n ans = max(ans, red*b+blue*c)\r\n\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\r\n#max_grams = 10 \r\n#weight_r = 3 \r\n#joy_r = 5 \r\n#weight_b = 2 \r\n#joy_b = 3\r\n\r\n\r\ndef max_joy(max_grams, weight_r, joy_r, weight_b, joy_b, jollies, memoiser): \r\n if max_grams < 0: \r\n return 0\r\n \r\n if max_grams == 0: \r\n return jollies\r\n \r\n if (str(max_grams) in memoiser): \r\n if jollies >= memoiser[str(max_grams)]: \r\n return 0\r\n \r\n memoiser[str(max_grams)] = jollies\r\n \r\n \r\n res1 = max_joy(max_grams - weight_r, weight_r, joy_r, weight_b, joy_b, jollies + joy_r, memoiser) \r\n res2 = max_joy(max_grams - weight_b, weight_r, joy_r, weight_b, joy_b, jollies + joy_b, memoiser) \r\n \r\n return max(res1, res2)\r\n\r\ndef main(): \r\n # max_grams, weight_r, joy_r, weight_b, joy_b = [int(x) for x in input().split()]\r\n max_grams = 982068341 \r\n weight_r = 55 \r\n joy_r = 57 \r\n weight_b = 106 \r\n joy_b = 109\r\n memoiser = {}\r\n jollies = 0\r\n res = max_joy(max_grams, weight_r, joy_r, weight_b, joy_b, jollies, memoiser)\r\n print(res)\r\n\r\n#main()\r\n\r\nimport math\r\nc,x,y,a,b = map(int,input().split())\r\nlim = int(math.sqrt(c))\r\nans = 0\r\nfor i in range(lim):\r\n if(c>=i*a):\r\n ans = max(ans,x*i+(c-i*a)//b*y)\r\n if(c>=i*b):\r\n ans = max(ans,y*i+(c-i*b)//a*x)\r\nprint(ans)" ]

[ "fristNum,secondNum=map(int,input().split())\r\nlistNum=list(map(int,input().split()))\r\ncounts=0\r\nfor i in range(fristNum):\r\n if(listNum[i]+secondNum <= 5):\r\n counts+=1\r\nprint(counts//3)\r\n \r\n", "n=input().split()\r\np=input().split()\r\nk=int(n[1])\r\nx=int(n[0])\r\na=0\r\no=0\r\nif k>5:\r\n o=0\r\nelse:\r\n for i in p:\r\n i=int(i)\r\n if k+i<=5:\r\n a+=1\r\n if a==3:\r\n o+=1\r\n a-=3\r\nprint(o)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(l)):\r\n a=5-l[i]\r\n if a>=k:\r\n c+=1\r\nprint(c//3)", "n,k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nfor i in range(n):\r\n arr[i] = (5-arr[i])-k\r\nans = 0\r\nfor i in range(n):\r\n if arr[i] >=0:\r\n ans += 1\r\nprint(ans//3)\r\n \r\n ", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\nfor i in range(len(b)):\r\n b[i] += a[1]\r\n\r\nc = 0\r\nfor i in b:\r\n if i <= 5:\r\n c+=1\r\n\r\nprint(c//3)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nre=5-k\r\nc=0\r\nfor i in l:\r\n if(i <= re):\r\n c+=1\r\nprint(c//3)", "n, k = map(int, input().split())\r\nans = 0\r\nfor el in input().split():\r\n if 5 - int(el) >= k:\r\n ans += 1\r\nprint(ans // 3)", "c=0\r\nn=0\r\nx,m=map(int,input().split())\r\nb=list(map(int,input().split()))\r\nfor i in b:\r\n if i+m<=5:\r\n c+=1\r\n if c%3==0:\r\n n+=1\r\nprint(n)", "import sys\r\n\r\na, b = map(int, sys.stdin.readline().split())\r\nl = list(map(int, sys.stdin.readline().split()))\r\nk = 0\r\nfor i in range(a):\r\n l[i] += b\r\n if l[i] <= 5:\r\n k += 1\r\nprint(k // 3)", "n,k=map(int,input().split())\r\n*a,=map(int,input().split())\r\nprint(sum(1 for i in a if i<=5-k)//3)", "import math\r\nimport random\r\nfrom collections import Counter, deque\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport heapq\r\nfrom copy import deepcopy\r\nimport itertools\r\nimport datetime\r\n\r\n\r\ndef S():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef IS():\r\n return sys.stdin.readline().replace('\\n', '')\r\n\r\n\r\ndef main():\r\n n, k = I()\r\n z = I()\r\n count = 0\r\n for i in range(n):\r\n if z[i] + k <= 5:\r\n count += 1\r\n print(count // 3)\r\n\r\n\r\nif __name__ == '__main__':\r\n #for _ in range(II()):\r\n #main()\r\n main()", "a,b=map(int,input().split(' '))\r\n\r\nlst= list(map(int, input().split(\" \")))\r\n \r\ncount =0\r\n\r\nfor i in range(len(lst)):\r\n lst[i]+=b\r\n if lst[i]<=5:\r\n count+=1\r\n\r\nprint(count//3)\r\n \r\n ", "n,k=map(int,input().split())\r\nli=list(map(int,input().split()))\r\ncount=0\r\nfor i in li:\r\n if i<=5-k:\r\n count+=1\r\nprint(count//3)", "# B. Напитки\r\n#\r\n# n = int(input())\r\n# s = input().split()\r\n# s = [int(x) for x in s]\r\n# r = sum(s) / n\r\n# print(r)\r\n\r\nn, k = map(int, input().split())\r\ns = input().split()\r\ns = [int(x) for x in s]\r\nb = []\r\nfor i in s:\r\n if i + k <= 5:\r\n b.append(i)\r\nprint(len(b) // 3)", "n, k = map(int, input().split(' '))\ninp = map(int, input().split(' '))\nadd_turns = map(lambda x: x + k, inp)\nsatisfied = filter(lambda x: x <= 5, add_turns)\nn_teams = len(list(satisfied)) // 3\nprint(n_teams)\n", "n, k = map(int, input().split())\r\nc = 0\r\nfor i in map(int, input().split()): \r\n if (i + k <= 5): c += 1\r\nprint(c//3)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nnew = []\r\nfor i in arr:\r\n if i+k <= 5 :\r\n new.append(i)\r\ncount = len(new)//3\r\nprint(count)", "n,c=map(int,input().split())\r\nstudents=list(map(int,input().split()))\r\ncount=0\r\nfor i in students:\r\n sub=(5-c)\r\n if(sub>=i):\r\n count+=1\r\nans=count//3\r\nprint(ans)", "n,m=map(int,input().split())\ncount=0\nl=list(map(int,input().split()))\nfor i in range(n):\n l[i]=l[i]+m\nfor i in range(n):\n if l[i]<=5:\n count+=1\ns=count//3\nprint(s)\n \t\t\t\t \t\t\t\t \t \t \t \t\t \t \t\t\t\t", "a,s=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nfor t in range(len(d)):\r\n d[t]=d[t]+s\r\nd.sort()\r\nq=0\r\nfor f in d:\r\n if f<=5:q=q+1\r\nprint(q//3)\r\n ", "n, k = map(int, input().split())\r\nparticipations = list(map(int, input().split()))\r\neligible_count = sum(1 for p in participations if p <= 5 - k)\r\nmax_teams = eligible_count // 3\r\nprint(max_teams)\r\n", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n if((5-i)>=b):\r\n c+=1\r\nif(c>=2):\r\n print(c//3)\r\nelse:\r\n print(0)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if 5 - a[i] >= k:\r\n count += 1\r\n\r\nprint(count // 3)\r\n\r\n", "n,k = map(int, input().split())\r\ns = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i] + k > 5:\r\n s[i] = -1\r\n else:\r\n count += 1\r\nprint(count // 3)\r\n", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\ny1 = []\r\nfor i in y:\r\n if i <= 5 - k:\r\n y1.append(i)\r\nprint(len(y1)//3)\r\n", "x,y=map(int,input().split())\r\nz=list(map(int,input().split()))\r\ns=0\r\nfor i in z:\r\n if i+y<6:\r\n s+=1\r\nprint(s//3)", "import math\r\n \r\nnum = input()\r\nnum = num.split(\" \")\r\nk = int(num[1])\r\n\r\narr = input()\r\narr = arr.split(\" \")\r\ncount = 0\r\n\r\nj = 0\r\ncountPeople = 0\r\nwhile j < len(arr):\r\n\tif int(arr[j]) + k <= 5:\r\n\t\tcountPeople += 1\r\n\t\r\n\tarr.remove(arr[j])\r\n\r\n\tif countPeople == 3:\r\n\t\tcountPeople = 0\r\n\t\tcount += 1\r\n\t\r\n \r\nprint(count)", "n=input().split(' ')\r\nc=0\r\nm=input().split(' ')\r\nfor i in range(int(n[0])):\r\n if int(m[i])+int(n[1])<=5:\r\n c+=1\r\nprint(c//3)", "import sys\r\ndef I(): return int(sys.stdin.readline().rstrip())\r\ndef LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\r\ndef MI(): return map(int, sys.stdin.readline().rstrip().split())\r\ndef SI(): return sys.stdin.readline().rstrip()\r\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\r\n\r\ndef main():\r\n n,k = MI()\r\n a = LI()\r\n\r\n a.sort()\r\n count = 0\r\n for i in range(n):\r\n if a[i] + k <= 5:\r\n count += 1\r\n print(count//3)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\r\nx,y = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\ntemp = lst.copy()\r\n\r\nfor k in lst:\r\n if k > 5-y:\r\n temp.remove(k)\r\n\r\nprint(len(temp)//3)\r\n", "n,k=map(int,input().split())\nlst=list(map(int,input().split()))\nctr=0\nfor num in lst:\n if 5-num>=k: ctr+=1\nprint(ctr//3)", "nk = list(map(int, input().split()))\r\nn = nk[0]\r\nk = nk[1]\r\ncount = 0\r\ny = list(map(int, input().split()))\r\nfor i in y:\r\n if k + i <= 5:\r\n count += 1\r\nprint(count // 3)\r\n", "n,k = map(int,input().split(\" \"))\r\ny = list(map(int,input().split(\" \")))\r\ny.sort()\r\nteams = 0\r\ni = 0\r\nwhile i < n :\r\n if y[i] + k <= 5:\r\n teams += 1\r\n i += 1\r\nprint(teams//3)", "# URL: https://codeforces.com/problemset/problem/432/A\n\nimport io\nimport os\nimport sys\n\ninput_buffer = io.BytesIO(os.read(0, os.fstat(0).st_size))\ninp = lambda: input_buffer.readline().rstrip(b\"\\n\").rstrip(b\"\\r\")\nout = sys.stdout.write\n\nn, k = map(int, inp().split())\nans = 0\nfor y in map(int, inp().split()):\n ans += y + k <= 5\nans //= 3\nout(f\"{ans}\")\n", "i=lambda:map(int,input().split())\r\nn,k=i()\r\na=i()\r\na=list(map(lambda x:x+k,a))\r\ncount=0\r\nfor i in range(len(a)):\r\n if a[i]<=5:\r\n count+=1\r\nprint(int(count/3)) \r\n ", "P=lambda:map(int,input().split())\r\n_,k=P()\r\nprint(sum(x<=5-k for x in P())//3)", "n,k=map(int,input().split())\r\ny=tuple(map(int,input().split()))\r\na=[]\r\nfor i in range(n):\r\n if y[i]+k<=5:\r\n a.append(i)\r\nx=len(a)\r\nb=x//3\r\nprint(b)", "i=input().split()\r\nx=input().split()\r\nl=0\r\nfor d in x:\r\n if int(d) <= 5-int(i[1]):\r\n l+=1\r\nprint(l//3)", "#Choosing Teams\r\n\r\nnStudents, k_times = map(int,input().split())\r\n\r\nsPCount = list(5 - int(x) for x in input().split())\r\n\r\n#checking the k_times in the list\r\ncount = 0\r\nResult = 0\r\nfor value in sPCount:\r\n\tif value >= k_times:\r\n\t\tcount = count + 1\r\n\r\n\tif count == 3:\r\n\t\tResult = Result+1\r\n\t\tcount = 0\r\nprint(Result)\r\n\r\n ", "# CHAT GPT SOLUTION!!!!\nn, k = map(int, input().split())\nprint(sum(1 for x in sorted(map(int, input().split()), reverse=True) if x <= 5 - k) // 3)\n", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n if l[i]<= (5-k):\r\n count = count + 1\r\nprint(count//3)", "a , b = map(int,input().split())\nl = list(map(int,input().split()))\nl.sort()\nb = 5 - b\nv = 0\nfor i in l:\n if i<=b:\n v += 1\nprint(v//3)\n \t \t\t \t\t \t\t\t \t\t\t\t \t\t\t \t\t \t", "a,b = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nk = []\r\nfor x in range(len(c)):\r\n if c[x]+b<=5:\r\n k.append(c[x])\r\nprint(len(k)//3)", "a,b=input().split(' ')\r\na=int(a)\r\nb=int(b)\r\nlist1=list(input().split(' '))\r\nlist1=[int(x) for x in list1]\r\ncount=0\r\nfor i in list1:\r\n if((5-i)>=b):\r\n count=count+1\r\nprint(count//3)\r\n", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\na = [i for i in s if (i + k) <= 5]\r\nprint(len(a) // 3)", "n_students, k_times = map(int, input().split())\nstudents = list(map(int, input().split()))\nstudents.sort()\nstudents = [student for student in students if student <= 5 - k_times]\nprint(len(students) // 3)\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = 0\r\nfor val in arr:\r\n if 5 - val >= k:\r\n ans += 1\r\nprint(ans // 3)", "import sys\r\nimport math\r\n\r\nINF = float('inf')\r\nMOD = 1000000007\r\n\r\ndef read_int() -> int:\r\n return int(sys.stdin.readline().strip())\r\ndef read_str() -> str:\r\n return sys.stdin.readline().strip()\r\ndef read_list() -> list:\r\n return list(map(int, sys.stdin.readline().split()))\r\ndef read_map() -> map:\r\n return map(int, sys.stdin.readline().split())\r\ndef write(data) -> None:\r\n sys.stdout.write(str(data) + \"\\n\")\r\n sys.stdout.flush()\r\ndef write_list(arr:list, sep=\" \") -> None:\r\n for i in arr:\r\n sys.stdout.write(str(i) + sep)\r\n sys.stdout.write(\"\\n\")\r\n sys.stdout.flush()\r\n \r\nn,k = read_map()\r\nd = read_list()\r\n\r\nok=0\r\nfor i in d:\r\n if i+k<=5:\r\n ok+=1\r\n\r\nwrite(str(ok//3))", "n,k = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\nc = 0\r\nfor i in lis:\r\n if k+i <= 5:\r\n c += 1\r\nprint(c//3)", "\r\ndef solve():\r\n n, k = map(int, input().split())\r\n y = list(map(int, input().split(maxsplit=n)))\r\n persons = list(filter(lambda x: x + k <= 5, y))\r\n return len(persons) // 3\r\n\r\n\r\nprint(solve())\r\n", "n,k = map(int,input().split(' '))\r\ny = list(map(int, input().split(' ')))\r\nans=0\r\nfor i in range(n):\r\n if y[i] <= 5-k:\r\n ans += 1\r\n\r\n\r\nprint(ans//3)", "n, k = map(int, input().split())\r\n\r\nlist1 = list(map(int, input().split()))\r\nset1 = []\r\nlist2 = []\r\nfor i in range(len(list1)):\r\n if(list1[i]+k<=5):\r\n list2.append(list1[i])\r\n if(len(list2)==3):\r\n set1.append(list2)\r\n list2 = []\r\nprint(len(set1))", "n, k = map(int, input().split())\r\nkids = [int(kid)+k for kid in input().split()]\r\nflt = 0\r\nfor kid in kids:\r\n if kid <= 5:\r\n flt += 1\r\nprint(flt//3)", "n,k = [int(x) for x in input().split()]\r\nx = [int(x) for x in input().split()]\r\ns=[]\r\nfor i in x:\r\n if i+k<=5:\r\n s.append(i)\r\n else:\r\n continue\r\nprint(int(len(s)/3))", "n,k=map(int,input().split(\" \"))\r\ny=list(map(int,input().split(\" \")))\r\nct=0\r\nfor i in y:\r\n if i+k <=5:\r\n ct=ct+1\r\n \r\n \r\nprint(ct//3)\r\n\t \t \r\n", "e,n=map(int, input().split())\r\nl=list(map(int, input().split(' ')))\r\ncount=0\r\nfor x in l:\r\n c=x+n\r\n if c<=5:count+=1\r\nprint(count//3)\r\n\r\n", "n , k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\nc, k = 0, 5 - k\r\nfor i in y:\r\n if i <= k:\r\n c += 1\r\nprint(int(c / 3))", "n, b = map(int, input().split())\r\nx = list(map(int, input().split()))\r\ncount = 0\r\nfor i in x:\r\n if 5 - i >= b:\r\n count += 1\r\n\r\nprint(count//3)", "[n,k] = list(map(int,input().split(' ')))\r\narr = list(map(int,input().split(' ')))\r\n\r\narr.sort()\r\ncount = 0\r\n\r\nfor i in range(0,n,3):\r\n\r\n if n >= i + 3:\r\n \r\n for ii in range(i,i+3):\r\n \r\n if arr[ii] + k > 5: \r\n break\r\n \r\n if ii == (i + 2):\r\n count += 1\r\n \r\nprint(count)", "n,k=map(int,input().split())\r\nll=list(map(int,input().split()))\r\nll.sort()\r\ncount,x=0,0\r\nfor i in ll:\r\n if i+k<6:\r\n x+=1\r\n if x==3:\r\n count+=1\r\n x=0\r\n else:\r\n break\r\nprint(count)\r\n", "a,b=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nc=0\r\nfor i in range(0,len(s)):\r\n s[i]=s[i]+b\r\n if(s[i]<=5):\r\n c=c+1\r\n \r\nprint(c//3)\r\n", "n, k = map(int, input().split())\ny = list(map(int, input().split()))\ny.sort()\nres, s = 0, []\nfor i in y:\n if i >= 5:\n break\n elif len(s) < 3:\n s.append(i)\n if len(s) == 3:\n if max(s) + k <= 5:\n res += 1\n s = []\nprint(res)\n", "n, k = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nprint(sum(1 if 5 - i >= k else 0 for i in c) // 3)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount = 0\r\nfor x in a:\r\n if x <= (5-k):\r\n count += 1\r\nprint(count // 3)", "import sys\r\nn,k=map(int,sys.stdin.readline().split())\r\nc=0\r\nfor i in map(int,sys.stdin.readline().split()):\r\n if i+k<=5:\r\n c+=1\r\nprint(c//3)\r\n", "a=int(input().split()[-1])\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in b:\r\n if i+a<=5:\r\n c+=1\r\nprint(c//3)", "# for _ in range(int(input())):\r\n# n = int(input())\r\n# l = [i*2 for i in range(1, n, 2)]\r\n# r = [i for i in range(1, n, 2)]\r\n# left, right = sum(l), sum(r)\r\n# diff = abs(left-right)\r\n# if diff % 2 != 0:\r\n# print('NO')\r\n# continue\r\n# half_n = n // 2\r\n# part = diff // half_n\r\n# rem = diff % half_n\r\n# if left > right:\r\n# for i in range(half_n):\r\n# r[i] += part\r\n# r[half_n-1] += rem\r\n# elif right > left:\r\n# for i in range(half_n):\r\n# l[i] += part\r\n# l[half_n-1] += rem\r\n# print('YES')\r\n# ans = map(str, l+r)\r\n# print(' '.join(ans))\r\n\r\n\r\nn, k = map(int, input().split())\r\narr = len([1 for i in input().split() if int(i)+k <= 5])\r\nprint(arr//3)", "n, k = map(int, input().split())\r\nusers = map(int, input().split())\r\nusers = list(filter(lambda x: x + k <= 5, users))\r\nprint(len(users) // 3)", "n, k = [int(x) for x in input().split()]\r\ncandidates = [5 - int(i) for i in input().split()]\r\nm = 0\r\nfor i in range(n):\r\n if candidates[i] >= k:\r\n m += 1\r\nfin = int(m//3)\r\nprint(fin)", "from math import ceil\r\n\r\ndef lstStrRd():\r\n return list(input())\r\ndef intRd():\r\n return int(input())\r\n\r\n\r\ndef lstRd():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn, k = lstRd()\r\n\r\n\r\na = sorted(lstRd())\r\n\r\nres = 0\r\nfor i in range(0, n-2, 3):\r\n if max(a[i], a[i+1], a[i+2]) + k > 5:\r\n\r\n break\r\n res += 1\r\nprint(res)\r\n\r\n", "n, k = map(int, input().split(' '))\r\n*l, = map(int, input().split(' '))\r\ns = 0\r\n\r\nfor i in l:\r\n if 5 - i >= k:\r\n s += 1\r\n\r\nprint(s // 3)\r\n", "l1=(list(map(int,input().split(' '))))\r\nl2=(list(map(int,input().split(' '))))\r\ns=[]\r\np=0\r\nfor i in range(l1[0]):\r\n\tm=(5-l2[i]-l1[1])\r\n\tif m>=0:p+=1;s.append(m)\r\nprint(len(s)//3)\r\n", "a, b = map(int, input().split())\r\nret = []\r\nret += map(int, input().split())\r\nc, p = 0, 0\r\nfor i in range(a):\r\n ret[i] += b\r\n if ret[i] <= 5:\r\n c += 1\r\n if c == 3:\r\n p += 1\r\n c = 0\r\nprint(p)\r\n", "a=input()\r\nb=input()\r\nq=0\r\na1, b1=a.split()\r\na1=int(a1)\r\nb1=int(b1)\r\nb=b.split()\r\nfor j in range(len(b)):\r\n b[j]=int(b[j])\r\nv=5-b1\r\nfor i in range(len(b)):\r\n if b[i]<=v:\r\n q+=1\r\no=q//3\r\nprint(o)\r\n", "def main(): \r\n \r\n n, k, *a = map(int, open(0).read().split())\r\n b = [x for x in a if x<=5-k]\r\n print(len(b) // 3)\r\n\r\n\r\nmain()", "n, c = map(int, input().split())\r\n\r\nparticipated = map(int, input().split())\r\n\r\nans = sum(1 for p in participated if 5 - p >= c) // 3\r\nprint(ans)", "n, k=map(int, input().split())\r\nread=list(map(int, input().split()))\r\ni=0\r\ncount=0\r\nfor i in range(len(read)):\r\n while (i<len(read) and read[i]+k<=5):\r\n read.remove(read[i])\r\n count+=1\r\nprint(int(count/3))\r\n\r\n", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\ncount = 0\r\nrequirements = 5 - k\r\nfor i in range(len(y)):\r\n if y[i] <= requirements:\r\n count += 1\r\nif count < 3:\r\n print(0)\r\nelse:\r\n print(count//3)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nteam = [i for i in arr if i+k <= 5]\r\nprint(len(team)//3)", "v,v1=map(int,input().split())\r\nv2=list(map(int,input().split()))\r\nv3=[]\r\nfor i in v2: \r\n if i+v1 <= 5:\r\n v3.append(i)\r\nprint(len(v3)//3) ", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(0,n):\r\n if l[i]<=5-k:\r\n s+=1\r\nprint(s//3)", "def check(i, ma):\r\n try:\r\n if li[i]>ma:\r\n li.pop(i)\r\n check(i, ma)\r\n except IndexError:\r\n pass\r\n \r\nn, k = [int(x) for x in input().split()]\r\nli, ma = [int(x) for x in input().split()], 5-k\r\nfor i in range(len(li)):\r\n check(i, ma)\r\nprint(len(li)//3)", "n, k = map(int, input().split())\r\n\r\nx = list(map(int, input().split()))\r\nx.sort()\r\n\r\n\r\nteams = 0\r\n\r\nmembers = 0\r\n\r\nfor i in range(n):\r\n\r\n if x[i] + k <= 5:\r\n\r\n members += 1\r\n\r\n else: break\r\n\r\n if members == 3: \r\n members = 0\r\n teams += 1\r\n\r\nprint(teams)", "a , b = map(int,input().split())\r\nl = sorted(list(map(int,input().split()))) \r\ncounter = 0\r\nfor i in range(2,a,3) : \r\n if ((l[i] + b) <= 5) : \r\n counter += 1 \r\nprint(counter)\r\n\r\n", "n, k = map(int,input().split())\r\nscore = list(map(int,input().split(' ')))\r\nres=0\r\nfor i in score:\r\n if i <= 5-k:\r\n res+=1\r\nprint(res//3)", "n,k= map(int, input().split())\r\nlist = [int(x) for x in input().split()]\r\n\r\nfor i in range(len(list)):\r\n list[i]+=k\r\n\r\ncnt=0\r\nfor i in range(len(list)):\r\n if list[i]<=5:\r\n cnt+=1\r\n\r\nprint(int(cnt/3))", "n,k = map(int,input().split())\r\ns = list(map(int,input().split()))\r\ncount = 0\r\nfor i in s:\r\n if(5-i>=k):count+=1\r\nprint(count//3)", "def solve(n, k, l):\r\n return sum([i+k <= 5 for i in l])//3\r\n \r\nn, k = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nprint(solve(n, k, l))\r\n", "n,k=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nprint(sum(x<=5-k for x in l)//3)", "n,k = map(int,input().split())\r\ny = input().split()\r\ncnt = 0\r\nfor i in y:\r\n i = int(i)\r\n if 5 - i >= k:\r\n cnt += 1\r\nprint(cnt//3)", "liste1=list(map(int,input().split()))\r\nliste2=list(map(int,input().split()))\r\nmembre=0\r\nfor element in liste2:\r\n if element+liste1[1]<=5:\r\n membre+=1\r\nprint(membre//3)", "n, k = map(int, input().split())\r\nparticipations = list(map(int, input().split()))\r\n\r\n# Count the number of students who are eligible to participate\r\neligible_count = sum(1 for p in participations if 5 - p >= k)\r\n\r\n# Divide the number of eligible students by 3 to get the maximum number of teams\r\nmax_teams = eligible_count // 3\r\n\r\nprint(max_teams)\r\n", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nlst = []\r\nc = 0\r\nfor i in range(len(l)):\r\n lst.append(l[i]+k)\r\nfor i in range(len(l)):\r\n if lst[i]<=5:\r\n c+=1 \r\nprint(c//3)", "a = list(map(int , input().split()))\r\nb = list(map(int , input().split()))\r\ntotal = 0\r\nfor i in range(a[0]):\r\n if 5 - b[i] >= a[1]:\r\n total += 1\r\nprint(total // 3)", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nfor i in range(len(arr)):\r\n arr[i]+=k\r\n\r\nless_five = 0\r\nfor ele in arr:\r\n if ele <=5:\r\n less_five+=1\r\nprint(less_five//3)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n a[i]=5-a[i]\r\na.sort()\r\ncount=0\r\nfor i in range(n):\r\n if a[i]>=k:\r\n count+=1\r\nprint(count//3)\r\n \r\n", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ngroup = 0\r\nfor i in s:\r\n if i+k<6:\r\n group += 1\r\nprint(group//3)\r\n", "n,k = map(int,input().split())\r\ncounts = list(map(int,input().split()))\r\nteammates = []\r\nnum1 = 0\r\nfor x in counts:\r\n if x < 5:\r\n teammates.append(x)\r\n num1 += 1\r\n\r\ndef team():\r\n num2 = 0\r\n for i in teammates:\r\n if (5-i) >= k:\r\n num2 += 1\r\n print(int(num2//3))\r\n \r\nif num1 % 3 == 0:\r\n team()\r\n\r\nelif num1 % 3 == 1:\r\n max_count = max(teammates)\r\n teammates.remove(max_count)\r\n team()\r\n \r\nelif num1 % 3 == 2:\r\n max_count = max(teammates)\r\n teammates.remove(max_count)\r\n max_count = max(teammates)\r\n teammates.remove(max_count)\r\n team()", "n, k = map(int, input().split())\r\nnumber_of_times = input().split()\r\nnumber_of_times = [int(num) for num in number_of_times]\r\navailable_studens = 0\r\nfor number in number_of_times:\r\n if number + k <= 5:\r\n available_studens += 1\r\nprint(int(available_studens/3))", "def main():\r\n n, k = [int(i) for i in input().split()]\r\n team = [int(i) for i in input().split()]\r\n # Loop and compute\r\n count = 0\r\n for member in team:\r\n tmp = member + k\r\n if tmp <= 5:\r\n count += 1\r\n print(count // 3)\r\n \r\n\r\nmain()", "result=0\r\nnum=input()\r\nn=int(num.split()[0])\r\nk=int(num.split()[1])\r\ns=input()\r\nl=list(map(int,s.split()))\r\nl.sort()\r\nfor i in range(0,n):\r\n\tif l[i]+k<=5:\r\n\t\tresult+=1\r\n\telse:\r\n\t\tbreak\r\nprint(result//3)", "nk = input().split(' ')\r\nparti = input().split(' ')\r\nn = int(nk[0])\r\nk = int(nk[-1])\r\nminimum = 5 - k\r\ncount = teams = 0\r\nfor i in range(n):\r\n if (int(parti[i]) <= minimum):\r\n count += 1\r\n if (count == 3):\r\n teams += 1\r\n count = 0\r\n\r\nprint(teams)", "n,k=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nres=0\r\nfor i in ar:\r\n if i+k<=5:\r\n res+=1\r\nprint(res//3)", "# len(str(n)) == len(set(str(n))) - проверка, явяляются ли все цифры в числе различными\n\n\na, b = map(int, input().split())\nspisok = [int(x) for x in input().split()]\ncounter = 0\nfor i in spisok:\n if i <= (5 - b):\n counter += 1\nprint(int(counter / 3))\n", "n, k = map(int, input().split())\r\npartecipants = map(int, input().split())\r\nwinners = [x for x in partecipants if x+k < 6]\r\nprint(len(winners)//3)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\np=2\r\nt=0\r\nfor i in range(int((len(l)/3//1))):\r\n if 5-l[p]>=k:\r\n t+=1\r\n p+=3\r\nprint(t)", "n, k = map(int, input().split())\r\n\r\nnums = list(map(int, input().split()))\r\noutput = 0\r\nfor item in nums:\r\n if 5 - item >= k:\r\n output += 1\r\n \r\nprint(output//3)", "n, k = map(int, input().split())\r\nmas = sorted(list(map(int, input().split())))\r\nc = 0\r\nfor i in range(len(mas)):\r\n if (i + 1) % 3 == 0 and mas[i] + k <= 5:\r\n c += 1\r\n\r\nprint(c)", "#************************ বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n#بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ *********************\r\n\r\n#********************************************* Bismillahir Rahmanir Rahim\r\n\r\n#************************************************************************\r\n\r\n # PROBLEM :A. Choosing Teams\r\n # SOLUTATOIN....\r\n\r\n#************************************************************************\r\n\r\nn,k=map(int,(input().split()))\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor m in l:\r\n if m+k<=5:\r\n s+=1\r\nprint(s//3)", "# Created by vbslc on 22-03-2023 and solved on 25-03-2023.\r\n# https://codeforces.com/problemset/problem/432/A\r\n\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncount = 0\r\nfor x in arr:\r\n if x + k <= 5:\r\n count += 1\r\nprint(count // 3)", " \nn,k = map(int, input().split())\nl = input().split()\nl = [int(i) for i in l]\ncount = 0\nfor _ in l:\n if _ + k <= 5:\n count += 1\n \n\nprint(count//3)\n \t\t \t\t\t\t \t\t\t\t \t\t \t \t \t", "n,k = map(int,input().split())\r\ny = list(map(int,input().split()))\r\n\r\nans = 0\r\nfor i in y:\r\n if 5 - i >= k:\r\n ans+=1\r\nprint(ans//3)", "n, k = map(int, input().split())\ntoes = list(map(int,input().split()))\nfor i in range(n-1,0,-1):\n if (5-toes[i]) < k:\n toes.remove(toes[i])\n\nprint(len(toes)//3)", "def solve(n,k,arr):\r\n arr=sorted(arr)\r\n t=0\r\n for i in range(0,n,3):\r\n if i+1<n and i+2<n:\r\n pl1=arr[i]+k\r\n pl2=arr[i+1]+k\r\n pl3=arr[i+2]+k\r\n if pl1<=5 and pl2<=5 and pl3<=5:\r\n t+=1\r\n return t\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nprint(solve(n,k,arr))", "n,k = list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\n\r\nc=0\r\nfor i in range(0,len(l)):\r\n if l[i]+k <=5:\r\n c +=1\r\n\r\nprint(c//3)\r\n", "n,k = map(int, input().split())\nl = list(map(int , input().split()))\n\nc = 0\nfor i in l:\n if i+k <= 5:\n c += 1\n\nprint(c//3)\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", "n, k = [int(x) for x in input().split()]\r\nplayer_data = [int(x) for x in input().split()]\r\nplayer = 0\r\n\r\n\r\nif 1 <= n <= 2000 and 1 <= k <= 5:\r\n for x in range(len(player_data)):\r\n player_data [x] += k - 1\r\n for x in player_data:\r\n if 0 <= x < 5:\r\n player += 1\r\n print(player // 3)", "n,k=input().split()\nn,k=int(n),int(k)\nl=list(input().split())\nfor i in range(n):\n\tl[i]=int(l[i])\nc=0\nx=5-k\nfor i in l:\n\tif i<=x:\n\t\tc+=1\nprint(c//3)", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\npcnt=0\r\ntcnt=0\r\nfor i in arr:\r\n if i+m<=5:\r\n pcnt+=1 \r\n if pcnt==3:\r\n tcnt+=1 \r\n pcnt=0\r\nprint(tcnt)\r\n", "n, k = map(int, input().split())\r\nd = 0\r\na = input()\r\ns = list(map(int, a.split()))\r\nfor i in range(n):\r\n if s[i] + k > 5:\r\n d = d\r\n else:\r\n d = d + 1\r\nprint(d//3)", "m,n= map(int, input().split())\r\nlist_1= [int(m) for m in input().split()]\r\nlist_2= []\r\n\r\nfor i in list_1:\r\n list_2.append(i+n)\r\n\r\ncounter= 0\r\nfor i in list_2:\r\n if i<=5:\r\n counter+= 1\r\nprint(counter//3)", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ns1 = []\r\nfor i in s:\r\n if 5 - i >= k:\r\n s1.append(i)\r\nprint(len(s1) // 3)", "n, k = map(int, input().split())\r\narr= list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\nfor i in arr:\r\n if 5-i >= k:\r\n count += 1\r\n\r\nans= count // 3\r\n\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n\r\ns = 0\r\nfor i in range(n):\r\n if l[i] <= 5 - k:\r\n s += 1\r\n\r\nprint(s // 3)", "n, k = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\n\r\ncount = 0\r\nfor number in numbers:\r\n if number + k <= 5:\r\n count += 1\r\nprint(count // 3)\r\n", "n, k=map(int, input(\"\").split())\r\ny=list(map(int, input(\"\").split()))[:n]\r\nc=0\r\nfor i in y:\r\n if i<=(5-k):\r\n c+=1\r\n\r\nprint(c//3)", "n, k =[int(a) for a in input().split()]\r\ny_n = [int(a) for a in input().split()]\r\ny_n = [a+k for a in y_n]\r\ncount = 0\r\nfor a in y_n:\r\n if(a <= 5):\r\n count += 1\r\nprint(count//3) \r\n \r\n ", "a,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl1=[]\r\nfor i in l:\r\n if 5-i >=b:\r\n l1.append(i)\r\nprint(len(l1)//3)", "x , y = map(int,input().split())\na = list(map(int,input().split()))\na.sort()\ny = 5 - y\ncount = 0\nfor i in a:\n if i<=y:\n count += 1\nprint(count//3)\n \t \t \t\t \t\t \t\t \t \t", "n, k = map(int, input().split())\r\nparList = list(map(int, input().split()))\r\n\r\nteams = 0\r\ncount = 0\r\nfor i in parList:\r\n if (i + k) <= 5:\r\n count += 1\r\n if count == 3:\r\n teams += 1\r\n count = 0\r\n\r\nprint(teams)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nprint(int(sum(1 for i in arr if 5 - i >= k) / 3))", "k = int(input()[-1])\r\nms = [i for i in input(' ').split(' ') if int(i)+k <=5]\r\nprint(int(len(ms)/3))", "n, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\n\r\nresult = 0\r\n\r\nfor i in lst:\r\n if i <= 5 - k:\r\n result += 1\r\n\r\nprint(result // 3)", "import sys\r\nfrom os import path\r\nimport sys\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return int(input())\r\n\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return list(s[:len(s) - 1])\r\n\r\n\r\ndef invr():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n n, k = invr()\r\n c = inlt()\r\n total = 0\r\n for elem in c:\r\n if elem - 5 + k <= 0:\r\n total += 1\r\n print(total//3)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n if (path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n main()\r\n", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\n\r\nteams = 0\r\nfor i in range(n):\r\n if 5 - y[i] >= k:\r\n teams += 1\r\n\r\nprint(teams // 3)\r\n", "n,k = map(int,input().split())\r\n\r\nar = list(map(int,input().split()))\r\n\r\nnbp = 0\r\nnbt = 0\r\nfor i in range(n): \r\n if ar[i] + k <= 5: \r\n nbp += 1\r\n \r\nprint(nbp // 3)", "n,k=map(int,input().split())\r\nqualified=n\r\ntimes_participated=list(map(int,input().split()))\r\nfor i in range(0,n):\r\n qualified-=(1 if(times_participated[i]+k>5)else 0)\r\nprint(qualified//3)", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\n\r\nplayes = 0\r\n\r\nfor i in s:\r\n if i + k <= 5:\r\n playes += 1\r\n\r\nprint(playes // 3)\r\n\r\n", "nk=input().split()\r\nn=int(nk[0])\r\nk=int(nk[1])\r\nzgvari = 5-k\r\njam=0\r\nmon = input().split()\r\nfor i in mon :\r\n if int(i)<=zgvari:\r\n jam+=1\r\nprint(jam//3)", "n, k = [int(i) for i in input().split()]\r\ny = [5-int(i) >= k for i in input().split()]\r\n\r\nprint(sum(y)//3)\r\n", "def choosing_teams(arr,n,k):\n temp = [i+k for i in arr]\n another = [i for i in temp if i<=5]\n val = len(another)//3\n return val\n \n\nn,k = map(int,input().split())\narr =[int(x) for x in input().split()]\nans = choosing_teams(arr,n,k)\nprint(ans)\n \t \t \t \t\t\t \t \t\t\t\t \t\t \t\t", "n,k=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nw=[]\r\nfor a1 in a:\r\n if a1<=5-k:\r\n w.append(a1)\r\nprint(len(w)//3)", "n, k = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\nf = []\r\nfor i in range(len(d)):\r\n if d[i] <= 5 - k:\r\n f.append(d[i])\r\nprint(len(f) // 3)", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nvalid = 0\r\nfor a in A:\r\n if 5-a >= k:\r\n valid += 1\r\nprint(valid//3)\r\n", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n if y[i] + k <= 5:\r\n cnt += 1\r\n\r\neligible = sorted(range(n), key=lambda i: y[i], reverse=True)[:cnt]\r\n\r\nteams = 0\r\nwhile len(eligible) >= 3:\r\n eligible = eligible[3:]\r\n teams += 1\r\n\r\nprint(teams)\r\n", "_, k = map(int, input().split())\nprint(sum(int(x) + k <= 5 for x in input().split()) // 3)", "n,k=list(map(int,input().strip().split()))\r\ny=list(map(int,input().strip().split()))\r\ncnt=0\r\nfor i in range(n):\r\n if y[i]+k<6:\r\n cnt+=1\r\nprint(cnt//3)", "\r\nn, k = [int(j) for j in input().split()]\r\narr = [int(j) for j in input().split()]\r\ns = sum(1 for j in arr if j <= (5 - k))\r\nprint(s // 3)\r\n\r\n\r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nc = 0\nfor i in range(n):\n if 5 - a[i] >= k:\n c += 1\nprint(int(c / 3))\n\n# while n != 0:\n# n -= 1\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 Choosing_Teams():\r\n n,k = invr()\r\n sequence = inlt()\r\n\r\n number_of_players_available = 0\r\n for times_participated in sequence:\r\n remaining_chances = 5 - times_participated\r\n \r\n if remaining_chances >= k:\r\n number_of_players_available += 1 \r\n\r\n print(number_of_players_available//3)\r\n return \r\n\r\nChoosing_Teams()", "import sys\r\n \r\ndef get_numbers():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\nn,k = get_numbers()\r\nparticipations = list(get_numbers())\r\n\r\nnum = 0\r\nfor part in participations:\r\n if part <= 5 - k:\r\n num += 1\r\n\r\nprint(num//3)", "a881 , b1 = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\nlis.sort()\r\nb1= 5 - b1\r\nc = 0\r\nfor i in lis:\r\n if i<=b1:\r\n c += 1\r\nprint(c//3)", "n,m = tuple(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n):\r\n a[i] += m\r\n if(a[i] <= 5):\r\n ans += 1\r\nprint(ans//3)", "a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nx = 0\r\nfor i in range(a):\r\n if c[i] < 5 and c[i] + b <= 5:\r\n x += 1\r\nprint(x//3)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\np=[]\r\nfor i in a:\r\n i=5-i\r\n if i>=k:\r\n p.append(i)\r\nif len(p)>=3:\r\n print(len(p)//3)\r\nelse:\r\n print(0)\r\n", "n, k = map(int, input().split())\r\nparticipations = list(map(int, input().split()))\r\n\r\n# Count how many people can still participate k more times \r\ncan_participate_k_more_times = 0\r\nfor p in participations:\r\n if p <= 5 - k:\r\n can_participate_k_more_times += 1\r\n\r\n# Each team needs 3 people \r\nmax_teams = can_participate_k_more_times // 3\r\n\r\nprint(max_teams)", "n,k=map(int,input().split())\r\nperson=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n if person[i]+k<=5:\r\n c=c+1\r\nprint(c//3)", "x = input()\r\ny = input()\r\nn = int(x.split()[1])\r\nm = y.split()\r\nh = 0\r\nfor i in m:\r\n if int(i) + n <= 5:\r\n h += 1\r\nt = h // 3\r\nprint(t)\r\n", "n,k=map(int,input().split())\na=list(map(int,input().split()))\nl=[]\nfor i in range(n):\n\tif 5-a[i]>=k:\n\t\tl.append(a[i])\nprint(len(l)//3)\n \t \t\t \t\t \t\t \t\t\t\t \t \t\t \t", "n,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\ny = list(map(int, input().split()))\r\nzero,one, two, three, four = 0,0,0,0,0\r\nfor i in y:\r\n if i==0:\r\n zero+=1\r\n elif i==1:\r\n one+=1\r\n elif i==2:\r\n two+=1\r\n elif i==3:\r\n three+=1\r\n elif i==4:\r\n four+=1\r\nif k==5:\r\n print(zero//3)\r\nelif k==4:\r\n print((zero+one)//3)\r\nelif k==3:\r\n print((zero+one+two)//3)\r\nelif k==2:\r\n print((zero+one+two+three)//3)\r\nelif k==1:\r\n print((zero+one+two+three+four)//3)", "def main(k, arr):\r\n n = 0\r\n\r\n for i in range(len(arr)):\r\n if arr[i] + k <= 5:\r\n n += 1\r\n\r\n return n // 3\r\n\r\nif __name__ == \"__main__\":\r\n _, k = map(int, input().split())\r\n\r\n arr = list(map(int, input().split()))\r\n\r\n print(main(k, arr))", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nn,k = li()\r\nl = li()\r\n\r\nfreq = [0] * n\r\nans = 0\r\nfor i in range(n):\r\n if 5 - l[i] < k or freq[i]:\r\n continue\r\n x = 1\r\n freq[i] = 1\r\n for j in range(n):\r\n if x == 3:\r\n break\r\n if 5 - l[j] >= k and not freq[j]:\r\n x += 1\r\n freq[j] = 1\r\n if x == 3:\r\n ans += 1\r\nprint(ans)", "n, k = map(int, input().split(' '))\r\n*y, = map(int, input().split(' '))\r\nans = 0\r\nfor i in y:\r\n if 5 - k >= i:\r\n ans += 1\r\nprint(ans // 3)\r\n", "#432A Choosing Teams\r\nn,k=(int(x) for x in input().split())\r\ny=[int(x) for x in input().split()]\r\nc=0\r\nfor i in y:\r\n if i+k<=5:\r\n c+=1\r\nprint(int(c/3))", "s = list(map(int, input().split()))\r\ndat = list(map(int, input().split()))\r\n\r\nnum = 0\r\nfor i in dat:\r\n if i <= 5-s[1]:\r\n num += 1\r\n\r\nprint(num//3)", "x,y = list(map(int,input().split()))\r\nl= list(map(int,input().split()))\r\nl.sort()\r\nif len(l)<3:\r\n print(0)\r\nelse:\r\n count=0\r\n team_size=0\r\n for i in range(len(l)):\r\n if 5-l[i]>=y:\r\n team_size += 1\r\n if team_size == 3:\r\n count+=1\r\n team_size =0\r\n print(count)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=0\r\nfor i in a:\r\n\tif i<=5-k:\r\n\t\tb+=1\r\nprint(b//3)", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n l[i] = 5 - l[i]\r\na = 0\r\nfor i in l:\r\n if(i >= k):\r\n a += 1\r\nprint(a // 3)\r\n", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=input().split()\r\nlst=[int(x) for x in c ]\r\nlst1=[val for val in lst if val+b<=5]\r\nprint(int(len(lst1)/3))", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in range(k):\r\n n-=l.count(5-i)\r\nprint(n//3)", "a,b = [int(x) for x in input().split()]\r\ntotal_part = [int(x) for x in input().split()]\r\ncount = 0\r\nfor i in total_part:\r\n if b+i<=5:\r\n count += 1\r\nprint(count//3)", "n,k = map(int,input().split())\r\ns = list(map(int,input().split()))\r\na =[]\r\ns.sort(reverse=True)\r\n\r\n\r\nfor i in range(n):\r\n if s[i]<=5-k:\r\n a.append(s[i])\r\n\r\nprint(len(a)//3)", "n, k = map(int, input().split())\r\ny = [int(_) for _ in input().split()]\r\ncnt = len([1 for i in y if 5 - i >= k])\r\nans = cnt // 3\r\nprint(ans)\r\n", "n, k = input().split()\ny = input().split()\nteams = 0\nout = 0\nfor i in range(int(n)) :\n if int(y[i]) + int(k) <= 5 :\n teams += 1\nout = teams//3\nprint(out)\n\t\t \t\t \t\t\t\t\t\t\t \t \t \t \t \t", "m, n = [int(x) for x in input().split()];\r\nff = list(map(int, input().split(' ')));\r\ndef check_group(group, n):\r\n c = 0;\r\n for i in group:\r\n if i + n > 5:\r\n c += 1;\r\n if c == 0:\r\n return True\r\n else:\r\n return False\r\nff = sorted([i for i in ff if i < 5]);\r\ncv = [];\r\nf = 0;\r\ns = 3;\r\nfor _ in range(len(ff) // 3):\r\n add_ff = ff[f:s];\r\n f += 3;\r\n s += 3;\r\n cv.append(add_ff);\r\ncc = 0;\r\nfor i in range(len(cv)):\r\n if check_group(cv[i], n):\r\n cc += 1;\r\nprint(cc)", "n, k = list(map(int, input().split()))\r\nvalues = list(map(int, input().split()))\r\n\r\ntotal = 0\r\nfor x in values:\r\n if 5 - x >= k:\r\n total += 1\r\n \r\nprint(total//3)", "import sys\r\n\r\ninputs = \"\".join(sys.stdin.readlines()).strip().split('\\n')\r\n# inputs = [int(x) for x in \"\".join(sys.stdin.readlines()).strip().split()[1:]]\r\n# print(inputs)\r\nk = int(inputs[0].split()[1])\r\nnum = [int(i) for i in inputs[1].split() if int(i)+k <= 5]\r\n# print(num)\r\nprint(int(len(num)/3))", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ncount=0\r\nfor x in arr:\r\n if x>5-k:\r\n continue\r\n count+=1\r\nprint(count//3)", "\r\nget_integers = lambda: map(int, input().split())\r\n\r\n\r\nn, k = get_integers()\r\n\r\n\r\nresult = sum(x <= 5 - k for x in get_integers()) // 3\r\nprint(result)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if a[i]<=5-k:\r\n ans+=1\r\nprint(ans//3)", "n , k = [ int(_) for _ in input().split() ]\r\nk = 6 - k\r\nl = [ int(_) for _ in input().split() ]\r\nl.sort()\r\ns = 0 \r\ni = 0\r\nwhile( i < n ):\r\n if l[i] < k :\r\n s+=1\r\n i+=1\r\nprint( s//3 )", "n,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\n\r\ns = input().split()\r\ncnt=0\r\nfor i in s:\r\n if int(i)+k <=5:\r\n cnt+=1\r\n\r\nprint(cnt//3)", "arr1=input()\r\narr1=arr1.split(' ')\r\nn=int(arr1[0])\r\nk=int(arr1[1])\r\narr2=input()\r\narr2=arr2.split(' ')\r\ntot=0\r\nfor i in range(n):\r\n if int(arr2[i])+k<=5:\r\n tot+=1\r\nprint(int(tot/3))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor x in a:\r\n if k + x <= 5:\r\n cnt += 1\r\n\r\nprint(cnt // 3)\r\n", "p=lambda:map(int,input().split())\r\n_,k=p()\r\nprint(sum(x<=5-k for x in p())//3)\r\n", "n, k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n if a[i] + k <= 5:\r\n count+=1\r\nif count < 3:\r\n print(0)\r\nelse:\r\n print(count//3)", "num1, num2 = map(int, input().split())\r\n\r\nlist1 = list(map(int, input().split()))\r\n\r\nlist2=sorted(list1)\r\ncount = 0\r\n\r\nfor i in range(2, len(list2),3):\r\n if 5-list2[i]>=num2:\r\n count+=1\r\nprint(count)", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\nglobal star_\r\nglobal l\r\n\r\n\r\ndef checker(m):\r\n if m in l:\r\n return False\r\n else:\r\n return True\r\n\r\n\r\ndef main():\r\n players, wins_needed = map(int, input().rstrip().split())\r\n global star_\r\n star_ = 6 - wins_needed\r\n global l\r\n l = [x for x in range(star_, 6)]\r\n list_ = list(filter(checker, list(map(int, input().rstrip().split()))))\r\n length_ = len(list_)\r\n ans = length_ // 3\r\n output(str(ans))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "import sys\r\nnum = sys.stdin.readline().strip().split()\r\nlst = sys.stdin.readline().strip().split()\r\n# print(lst)\r\nmaxi = 5 - int(num[1])\r\n# print(maxi)\r\ncount = 0\r\nfor i in lst:\r\n if int(i) <= maxi:\r\n count += 1\r\nprint(int(count/3))\r\n", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nammount = input().split()\r\nc = 0\r\nfor i in range(len(ammount)):\r\n ammount[i] = int(ammount[i])\r\n if ammount[i] + k <= 5:\r\n c += 1\r\nc //= 3\r\nprint(c)\r\n\r\n ", "n, k = map(int, input().split())\r\narr = sorted(map(int, input().split()))\r\nprint(sum((5-arr[i]) >= k for i in range(n)) //3)", "n,k = map(int, input().split())\n\narr = list(map(lambda a: int(a)+k, input().split()))\n\n\nt=0\nfor i in arr:\n\tif(i<=5):\n\t\tt+=1\n\nprint(int(t/3))", "n,k=map(int,input().strip().split())\r\nli=list(map(int,input().strip().split()))\r\nli.sort()\r\nans=0\r\ni=0\r\nwhile i+2<n:\r\n if li[i+2]+k<=5:\r\n ans+=1\r\n else:\r\n break\r\n i+=3\r\n\r\nprint(ans)\r\n", "n,p=input().split()\r\np=int(p)\r\nlst=[]\r\nlst = input().split()\r\nq=0\r\n\r\nfor i in range(len(lst)):\r\n lst[i]=int(lst[i])\r\n if (5-lst[i])>=p:\r\n q=q+1;\r\n\r\nprint(q//3)", "n, k = [int(i) for i in input().split()]\nnum = [int(i)+k for i in input().split()]\nc = 0\nfor i in num:\n if i<=5:\n c+=1\nprint(c//3)", "inp=lambda:map(int,input().split())\r\nl,k=inp()\r\nprint(sum(i<=5-k for i in inp())//3)", "# A Choosing teams\r\nn,k = tuple(input().split())\r\nn,k = int(n), int(k)\r\n\r\nlista = input().split()\r\nlista = [int(i) for i in lista]\r\n\r\ndif = 5 - k\r\n\r\nok = []\r\nfor num in lista:\r\n if num <=dif:\r\n ok.append(num)\r\n \r\nprint(int(len(ok)/3))", "def team_formation(n, k, skills):\r\n qualified_players = sum(1 for skill in skills if skill <= 5 - k)\r\n \r\n max_teams = qualified_players // 3\r\n \r\n return max_teams\r\n\r\nn, k = map(int, input().split())\r\nskills = list(map(int, input().split()))\r\n\r\nresult = team_formation(n, k, skills)\r\nprint(result)\r\n", "a, b = map(int, input().split())\r\nf = list(map(int, input().split()))\r\nf = [f[i] + b for i in range(a)]\r\nr = 0\r\nfor _ in range(a):\r\n if f[_] <= 5:\r\n r+=1\r\n#print(*f)\r\nprint(r//3)", "n,k =map(int,input().split())\r\nx=list(map(int,input().split()))\r\nc=0 ; q=[]\r\nfor i in range(n):\r\n if len(x) <3:\r\n break\r\n q.append(min(x)) ; x.remove(min(x));q.append(min(x)) ; x.remove(min(x));q.append(min(x)) ; x.remove(min(x))\r\n a=abs(max(q)+k)\r\n if a<=5:\r\n c+=1\r\n q.clear()\r\nprint(c)", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\n\nmemElg = 0\nfor i in arr:\n if(i + k <= 5):\n memElg += 1\n\nprint(memElg // 3)", "#432A\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nf=5-k;l2=[]\r\nfor i in l:\r\n if i<=f:\r\n l2.append(i)\r\nans=len(l2)//3\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nb = list()\r\nfor i in a:\r\n b.append(i+k)\r\nc = 0\r\n# print(a, b)\r\nfor i in range(2, n, 3):\r\n if(b[i]<=5):\r\n c += 1\r\n else:\r\n break\r\nprint(c)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(len(a)):\r\n if(a[i]+k<=5):\r\n d.append(a[i])\r\nprint(len(d)//3)\r\n\r\n", "n, k = map(int, input().split())\r\np = list(map(int, input().split(' ')))\r\npossible = 0\r\n\r\nif n < 3:\r\n print(0)\r\nelse:\r\n for elem in p:\r\n if elem + k <= 5:\r\n possible += 1\r\n\r\n ans = possible // 3\r\n print(ans)\r\n", "x, y = input().split()\r\nn = int(x)\r\nk = int(y) \r\nwho_can_take_part = 0\r\nno_of_teams = 0\r\nx = list(map(int,input().split()))\r\ny = []\r\nfor i in range(n):\r\n y.append(x[i]+k)\r\nfor i in range(n):\r\n if y[i]<6:\r\n who_can_take_part += 1\r\nno_of_teams = who_can_take_part//3\r\nprint(no_of_teams) \r\n\r\n\r\n ", "n, k = map(int, input().split())\r\nli = sorted(list(map(int,input().split())))\r\n\r\nk = (5 - k)\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n if li[i] > k:\r\n break\r\n cnt += 1\r\n\r\nprint(cnt//3)", "import math\r\nx = input()\r\narray = []\r\ncounter = 0\r\nfor count in range(0, len(x), 1):\r\n if x[count] == \" \":\r\n a = int(x[:count])\r\n b = int(x[count + 1:])\r\nd = input()\r\nnum = \"\"\r\nfor count in range(0, len(d), 1):\r\n if d[count] != \" \":\r\n num = num + d[count]\r\n else:\r\n array.append(int(num))\r\n num = \"\"\r\narray.append(int(num))\r\narray = sorted(array)\r\nmin = 5 - b\r\nfor c in range(0, a, 1):\r\n if array[c] <= min:\r\n counter += 1\r\nprint(math.floor(counter / 3))", "n, k = map(int, input().split())\r\nparticipations = list(map(int, input().split()))\r\n\r\nvalid_participants = sum(1 for p in participations if 5 - p >= k)\r\n\r\nmax_teams = valid_participants // 3\r\n\r\nprint(max_teams)\r\n", "x,y=map(int,input().split())\nl=list(map(int,input().split()))\nm=0\nfor i in range(len(l)):\n if(l[i]<5):\n if(5-l[i]>=y):\n m=m+1 \nif(m>=3):\n print(m//3)\nelse:\n print(0)\n\t\t \t \t \t\t\t \t \t\t\t \t \t \t", "def main():\r\n\tn, k = map(int, input().split())\r\n\ty = [int(x) for x in input().split()]\r\n\tcount = 0\r\n\tfor i in y:\r\n\t\tif 5 - i >= k:\r\n\t\t\tcount += 1\r\n\tprint(count // 3)\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()\r\n", "n,k = (map(int,input().split()))\r\nl =list(map(int,input().split()))\r\nl1=[]\r\nfor i in range(len(l)):\r\n if l[i]<=(5-k):\r\n l1.append(l[i])\r\n# print(l1)\r\nprint(len(l1)//3)\r\n", "a,s=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nz1=0\r\nfor i in x:\r\n if i+s<=5:\r\n z1+=1\r\nprint(z1//3)", "def choosing_teams():\r\n def addition(p):\r\n return p + k\r\n n, k = list(map(int, input().split(\" \")))\r\n participated = list(map(int, input().split(\" \")))\r\n participated = list(map(addition, participated))\r\n valid_people = 0\r\n for participants in participated:\r\n valid_people += participants <= 5\r\n print(valid_people // 3)\r\n\r\n\r\nchoosing_teams()\r\n", "n,k = map(int,input().split())\r\nsList = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n if sList[i]+k <= 5:\r\n count += 1\r\nprint(count//3)\r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\ncnt = 0\nfor x in a:\n if 5 - x >= k:\n cnt += 1\nprint(cnt // 3)", "n, k = map(int,input().split())\r\n\r\ny = list(map(int, input().split()))\r\n\r\ns = 0\r\n\r\nfor i in range(n):\r\n if y[i-1]<=(5-k):\r\n s+=1\r\n else:\r\n s+=0\r\n\r\nprint(s//3)", "def max_teams(n, k, participations):\r\n max_teams = 0\r\n\r\n for i in range(n):\r\n if participations[i] + k <= 5:\r\n max_teams += 1\r\n\r\n return max_teams // 3 # Делим на 3, так как каждая команда состоит из 3 человек\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n participations = list(map(int, input().split()))\r\n\r\n result = max_teams(n, k, participations)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\nkol = 0\r\nkom = 0\r\nfor x in y:\r\n if 5 - x >= k:\r\n kol += 1\r\nkom = kol // 3\r\nprint(kom)", "s = input().split()\r\nn = int(s[0])\r\nk = int(s[1])\r\nl = input().split()\r\nc = 0\r\nfor i in l:\r\n if int(i) <= (5-k):\r\n c+=1\r\nprint(c//3)", "n , k = map(int,input().split(\" \"))\r\nmembers = list(map(int,input().split(\" \")))\r\nresult = []\r\nteams = 0\r\nfor i in members :\r\n if i + k <= 5:\r\n result.append(i)\r\nhehe = len(result)\r\nwhile hehe >=3 :\r\n if hehe -3 >= 0:\r\n teams +=1\r\n hehe -=3\r\n else : \r\n break\r\nprint(teams)", "from sys import stdin\r\nrln=stdin.buffer.readline\r\nrl=lambda:rln().rstrip(b'\\r\\n').rstrip(b'\\n')\r\nri=lambda:int(rln())\r\nrif=lambda:[*map(int,rln().split())]\r\nrt=lambda:rl().decode()\r\nrtf=lambda:rln().decode().split()\r\ninf=float('inf')\r\ndir4=[(-1,0),(0,1),(1,0),(0,-1)]\r\ndir8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\nYES,NO,Yes,No,yes,no='YES','NO','Yes','No','yes','no'\r\n\r\nn,k=rif()\r\na=rif()\r\nm=sum(x<=5-k for x in a)\r\nprint(m//3)\r\n", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nres = 0 \r\n\r\nfor i in a:\r\n if 5-i>=k:\r\n res+=1\r\n\r\nprint(int(res/3))\r\n", "n , k = input().split()\r\ns = list(map(int, input().split()))\r\nplayer = 0\r\nfor i in range(0,len(s)):\r\n if (int(s[i])+int(k))<=5:\r\n player+=1\r\n\r\n\r\nprint(int(player/3))", "n,k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\n \r\nres = 0\r\ncnt = 0\r\nfor i in arr:\r\n if 5 - i - k >= 0:\r\n cnt += 1\r\n if cnt == 3:\r\n cnt = 0\r\n res += 1\r\nprint(res)", "a=map(int,input().split())\r\nb,c=a\r\nd=map(int,input().split())\r\ncount=0\r\nfor i in d:\r\n if (5-c)>=i:\r\n count+=1\r\nteams=0\r\nwhile count>=3:\r\n count-=3\r\n teams+=1\r\nprint(teams)", "x,y=list(map(int,input().split()))\nlst=list(map(int,input().split()))\nlst.sort()\ny=5-y\nc=0\nfor i in lst:\n\tif i<=y:\n\t\tc+=1\nprint(c//3)\n \t \t\t \t\t\t\t\t \t\t \t\t \t \t \t\t", "n, k = map(int, input().split())\r\nparticipations = list(map(int, input().split()))\r\n\r\n\r\neligible_participants = sum(1 for p in participations if p <= 5 - k)\r\n\r\n\r\nmax_teams = eligible_participants // 3\r\n\r\nprint(max_teams)\r\n", "n,k=map(int,input().split())\r\na=map(int,input().split())\r\nprint(len([i for i in a if i <= 5-k])//3)", "x,y = map(int,input().split())\r\nz = map(int,input().split())\r\nc = 0\r\ny1 = 5 - y\r\n\r\nfor i in z:\r\n if i <= y1:\r\n c += 1\r\n \r\n\r\nprint(c//3)", "n,k=map(int, input().split())\r\na=list(map(int, input().split()))\r\nd =[];p=5-k;j=0\r\nfor i in range(len(a)):\r\n\tif a[i] <= p: d.append(a[i])\r\n\tif len(d) == 3:\r\n\t\tj+= 1\r\n\t\td=[]\r\nprint(j)", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\nt = 0\r\nfor i in range(6-k):\r\n\tt+=y.count(i)\r\nt//=3\r\nprint(t)", "n, k = map(int, input().split())\nparticipations = list(map(int, input().split()))\n\navailable_teams = 0\n\nfor i in range(n):\n if participations[i] <= (5 - k):\n available_teams += 1\n\nmax_teams = available_teams // 3\nprint(max_teams)\n", "n, k = [int(i) for i in input().split()]\r\ns = [int(i) for i in input().split()]\r\nc = 5-k\r\ncount = 0\r\np = 0\r\nfor i in range(n):\r\n if s[i]<=c:\r\n count+=1\r\n if count == 3:\r\n p+=1\r\n count = 0\r\nprint(p)", "n,k=map(int,input().split())\r\nc=0\r\na=[int(i) for i in input().split()]\r\nfor i in a:\r\n if i+k<6:\r\n c=c+1\r\nprint(c//3)\r\n", "n, k = [int(i) for i in input().split()]\r\nprint(len([i for i in [int(i) for i in input().split()] if i + k <= 5]) // 3)", "n, k = input().split()\r\nparticipated = input().split()\r\nmaximum = 5\r\nresult = []\r\nfor i in participated:\r\n if int(i) + int(k) <= 5:\r\n result += i\r\n \r\nresult = len(result) / 3\r\nprint(int(result))", "\r\n\r\nn, k = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\ncount = 0\r\n\r\nfor num in nums:\r\n if num <= 5 - k:\r\n count += 1\r\nprint(count//3)", "z=[int(i) for i in input().split()]\r\nn=z[0]\r\nk=z[1]\r\na=[int(i) for i in input().split()]\r\nc=[]\r\nfor i in a:\r\n c.append(i+k)\r\nfor i in c:\r\n if i>5:\r\n f=c.index(i)\r\n c[f]=0\r\nj=[]\r\nfor i in c:\r\n if i>=1:\r\n j.append(i)\r\nif len(j)//3>=1:\r\n print(len(j)//3)\r\nelse:\r\n print(0)", "from math import log10\r\nfrom math import ceil\r\nimport sys\r\nimport heapq as h\r\nfrom collections import deque\r\nfrom itertools import accumulate\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 riaset(): return set(map(int, sys.stdin.readline().split()))\r\ndef ws(s): sys.stdout.write(s)\r\ndef wi(n): sys.stdout.write(str(n) + ' ')\r\ndef wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\\n')\r\n #--------------------Solution------------------------\r\nn,k=ria()\r\nlst = ria()\r\naywa = []\r\nfor i in lst:\r\n if i+k<=5:\r\n aywa.append(i)\r\nprint(len(aywa)//3)", "from sys import stdin\r\nn,k = map(int,stdin.readline().split())\r\na = list(map(int,stdin.readline().split()))\r\ncount = 0\r\nfor x in a:\r\n count += (x<6-k)\r\nprint(count//3)", "n,k = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\neligible = 0\r\nfor i in x:\r\n if i+k <= 5:\r\n eligible += 1\r\nprint(eligible//3)\r\n", "n, k = input().split(' ')\r\nk = int(k)\r\nparticipants = list(map(int, input().split(' ')))\r\nvalidTeamCount = 0\r\ncurrentValidParticipants = 0\r\nfor participant in participants:\r\n if participant + k <= 5:\r\n currentValidParticipants += 1\r\n if currentValidParticipants == 3:\r\n currentValidParticipants = 0\r\n validTeamCount += 1\r\nprint(validTeamCount)", "n,k = map(int, input().split())\r\n\r\narr=[int(i) for i in input().split()]\r\narr.sort()\r\nn=n-n%3\r\n#print(arr, n)\r\ncou=0\r\nfor i in range(0,n,3):\r\n if (max(arr[i],arr[i+1],arr[i+2])<=5-k):\r\n cou+=1 \r\n\r\nprint(cou)", "a = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nc = []\r\nfor i in b:\r\n i += a[1]\r\n c.append(i)\r\nre = 0\r\nfor n in c:\r\n if n < 6:\r\n re += 1\r\nprint(re // 3)", "def teams(n,k,times):\r\n c = 0\r\n for each in times:\r\n if 5-each>=k:\r\n c+=1\r\n return c//3\r\nn,k = map(int,input().split())\r\ntimes = list(map(int,input().split()))\r\nprint(teams(n,k,times))", "a,b = map(int,input().split())\r\ns = input().split()\r\nfor i in range(len(s)):\r\n s[i] = int(s[i])\r\ni = 0\r\n\r\nwhile i < a:\r\n if (s[i]+b)>5:\r\n s.pop(i)\r\n i-=1\r\n a-=1\r\n i+=1\r\n\r\n\r\nprint(len(s)//3)", "a=list(map(int,input().split()))\r\nn=a[0]\r\nk=a[-1]\r\ns=list(map(int,input().split()))\r\ns.sort()\r\nl=[]\r\nsum=0\r\ncount=0\r\n\r\nfor i in range(len(s)):\r\n if s[i]<5:\r\n if (5-s[i])>=k:\r\n count+=1\r\nif count>=3:\r\n print(count//3)\r\nelse:\r\n print(\"0\")\r\n\r\n\r\n", "n,k=map(int,input().split())\nc=0\narr=map(int,input().split())\nfor i in arr:\n p=k+i\n if(p<=5):\n c=c+1\nprint(c//3) \n \n \n\t\t \t\t \t\t\t \t\t \t\t\t\t \t \t\t \t\t", "a = input()\r\nn = int(a.split()[0])\r\nk = int(a.split()[1])\r\ns = input()\r\nb = 0\r\nfor i in range(n):\r\n if 5 - int(s.split()[i]) >= k:\r\n b = b + 1\r\nprint(int(b / 3))\r\n \r\n", "n, k= map(int, input().split())\r\ny= list(map(int, input().split()))\r\ny= sorted(y)\r\nu= 0\r\n\r\nfor i in range(2, n, 3):\r\n if 5- y[i] >= k:\r\n u += 1\r\n else:\r\n break\r\n\r\nprint(u)", "n,k=map(int,input().split())\r\narr=map(int,input().split())\r\nc=0\r\nfor i in arr:\r\n if i<=(5-k):\r\n c+=1\r\nprint(c//3)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\ni=0\r\nwhile i<n-2:\r\n if l[i+2]+k<=5:\r\n c+=1\r\n i+=3\r\n else:\r\n break\r\nprint(c)\r\n", "n,m=list(map(int,input().split(\" \")))\r\nl=list(map(int,input().split(\" \")))\r\nc=0\r\nfor i in range(n):\r\n if(m<=5-l[i]):\r\n c+=1\r\n\r\nprint(c//3)", "'''// Problem: A. Choosing Teams\r\n// Contest: Codeforces - Codeforces Round #246 (Div. 2)\r\n// URL: https://codeforces.com/problemset/problem/432/A\r\n// Memory Limit: 256 MB\r\n// Time Limit: 1000 ms\r\n// \r\n// Powered by CP Editor (https://cpeditor.org)'''\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(l)):\r\n\tif(5-l[i]>=k):\r\n\t\tc+=1\r\nprint(c//3)\r\n\r\n\t\r\n\r\n", "n,k=[int(x) for x in input().split()]\r\nl1=[]\r\nl1.append(input().split())\r\n\r\nl1[0].sort()\r\n\r\na=0\r\nfor i in range(n):\r\n if int(l1[0][i])+k<6:\r\n a=a+1\r\nprint(a//3)", "n,k = map(int, input().split())\r\np = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in p:\r\n if i + k <= 5:\r\n cnt += 1\r\n\r\nans = cnt // 3\r\nprint(ans)", "n=list(map(int,input().split()))\r\nk=list(map(int,input().split()))[:n[0]]\r\nc=sum( 1 for i in k if 5-i>=n[1])\r\nprint(c//3)\r\n \r\n ", "a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nd = 0\r\n\r\nfor i in range(a):\r\n if(c[i] + b < 6):\r\n d += 1\r\nprint(d // 3)", "n, k=[int(x) for x in input().split()]\r\ny=list(map(int, input().split()))\r\ny.sort()\r\nc=0\r\ni=2\r\nwhile i<n and abs(y[i]-5)>=k:\r\n if abs(y[i]-5)>=k:\r\n c=c+1\r\n i=i+3\r\n else:\r\n i=i+1\r\nprint(c)", "a,b=map(int,input().split())\r\nn=list(map(int,input().split()))\r\nc=0\r\nfor i in n:\r\n if i<=5-b:\r\n c+=1\r\nprint(c//3)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nlim = 5 - k\r\ncnt = 0\r\nfor i in range(n):\r\n if arr[i] <= lim:\r\n cnt += 1\r\nprint(cnt // 3)\r\n ", "\n# for t in range(int(input())):\nn,k=map(int,input().split())\nl=list(map(int,input().split()))\nl.sort()\nk=5-k\nc=0\nfor i in range(len(l)):\n if l[i]<=k:\n c+=1\nprint(c//3)\n \t\t \t\t \t \t \t \t \t \t \t \t\t", "# Ahmed Abdelrazik\r\n\r\nn,k = map(int, input().split())\r\n\r\nW = map(int,input().split())\r\n\r\nson = 0\r\nfor q in W:\r\n if q+k <=5: son+=1\r\nprint(son//3)", "n, k = map(int, input().split())\r\nparticipation = list(map(int, input().split()))\r\n\r\ncount_eligible = sum(1 for p in participation if 5 - p >= k)\r\n\r\nmax_teams = min(count_eligible // 3, n // 3)\r\nprint(max_teams)", "n, k = [int(e) for e in input().split()]\r\nstudents = sorted([int(e) for e in input().split() if int(e) <= 5-k])\r\nprint(len(students) // 3)", "k,n=map(int,input().split())\nlst=list(map(int,input().split()))\nc=0\nfor i in range(len(lst)):\n lst[i]=lst[i]+n \nfor i in range(len(lst)):\n if lst[i]<=5:\n c+=1 \ns=c//3 \nprint(s)\n \n \t \t \t \t\t\t\t \t\t \t \t \t\t\t\t\t\t\t", "import sys\r\nn,k=map(int,sys.stdin.readline().split())\r\nc=0\r\nfor i in map(int,sys.stdin.readline().split()):\r\n c+=1 if i+k<=5 else 0\r\nprint(c//3)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nelegible_students = 0\r\nk -= 5\r\nk *= -1\r\nfor i in a:\r\n if(i <= k):\r\n elegible_students += 1\r\nprint(elegible_students//3)", "n,k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\n\r\nres = 0\r\nfor i in arr:\r\n\tif 5-i >=k:\r\n\t\tres+=1\r\nprint(res//3)", "n , k = list(map(int,input().split()))\r\n\r\nnums = list(map(int,input().split()))\r\nteams = []\r\nfor n in (nums):\r\n if n+k <= 5:\r\n teams.append(n)\r\n \r\nprint(len(teams)//3)\r\n\r\n \r\n \r\n \r\n \r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Mar 30 19:53:23 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn,k=map(int,input().split())\r\ny=list(map(int,input().split()))\r\ns=0\r\nfor i in range(6):\r\n if i+k<=5:\r\n s=s+y.count(i)\r\n\r\nprint(s//3)\r\n", "u,h=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nd.sort()\r\np=0\r\nfor i in range(2,u,3):\r\n if 5-d[i]>=h:\r\n p+=1\r\nprint(p) ", "n, k = map(int,input().split())\r\na = [int(i) for i in input().split()]\r\nx = 0\r\nfor i in a:\r\n if i+k<=5:\r\n x+=1\r\n \r\nprint(x//3)\r\n\r\n \r\n ", "n, k = map(int, input().split(\" \"))\r\nvalid = 0\r\nlst = list(map(int, input().split(\" \")))\r\nfor i in range(n):\r\n if lst[i]+k <= 5:\r\n valid += 1\r\nprint(int(valid/3))\r\n", "str1 = input().split()\r\nstr2 = input().split()\r\nk = int(str1[1])\r\ncount = 0;\r\nfor i in range(0, int(str1[0])):\r\n if 5 - int(str2[i]) >= k:\r\n count += 1;\r\nprint(count // 3)", "import math\r\nn_ = input().split()\r\nk = int(n_[1])\r\nn = input().split()\r\nfor i in range(len(n)):\r\n n[i] = int(n[i])\r\ntotal = 0\r\nfor i in n:\r\n if i + k <= 5:\r\n total += 1\r\n\r\nprint(total // 3)", "n, k = map(int, input().split())\nlimit = 5-k\na = [int(x) for x in input().split()]\ntotal = 0\nfor i in a:\n if i<=limit:\n total +=1\nprint(total//3)\n", "n,k=input().split()\nx=input().split()\n \nn,k=int(n),int(k)\nfor j in range(len(x)):\n\tx[j]=int(x[j])\ncount=0\nx.sort()\nfor i in range(len(x)):\n\tif x[i]<=5-k:\n\t\tcount +=1\nprint(int(count/3))\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\ny = list(map(int, input().split(\" \")))\r\n\r\nNone_count = 0\r\n\r\nfor i in range(n):\r\n y[i] += k\r\n\r\nfor i in range(n):\r\n if y[i] > 5:\r\n y[i] = None\r\n None_count += 1\r\n\r\nprint((len(y) - None_count)//3)\r\n\r\n", "# 432A\r\nn, k = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\n# check for eligibility\r\nlst = []\r\nfor i in range(len(a)):\r\n if 5-a[i] >= k:\r\n lst.append(a[i])\r\n \r\n# print out the result \r\nprint(len(lst)//3)", "n,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nj=0\r\nfor i in lst:\r\n if 5-i >= k:\r\n j+=1\r\nprint(j//3)", "n, k = list(map(int, input().split()))\r\nlist = list(map(int, input().split()))\r\ns = 0\r\nfor i in list:\r\n if i+k <= 5:\r\n s+=1\r\nprint(s//3)", "n, k = [int(i) for i in input().split()]\r\n\r\na = [int(i) for i in input().split() if int(i) <= 5-k]\r\nprint(len(a) // 3)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=[0]*6\r\nfor e in a: c[e]+=1\r\nprint(sum(c[:6-k])//3)", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nc = 0\r\nfor i in l:\r\n if i<= 5-k:\r\n c = c+1\r\nprint(c//3)", "fristNum,secondNum=map(int,input().split())\r\nlistNum=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(fristNum):\r\n if(listNum[i]+secondNum <= 5):\r\n count+=1\r\nprint(count//3)\r\n \r\n", "nk=input ()\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\nl4=[]\r\nl1=nk.split(\" \")\r\nfor l in l1:\r\n l2.append(int(l))\r\nn=input ()\r\nl1.clear()\r\nl1=n.split (\" \")\r\nfor i in l1:\r\n l3.append(int(i))\r\nfor i in range (0,int(len(l3))) : \r\n l4.append(l3[i]+l2[1])\r\ncount=0\r\nfor i in l4:\r\n if i <=5:\r\n count+=1\r\nprint (int(count/3)) ", "#https://codeforces.com/problemset/problem/432/A\r\nn,k=map(int,input().split())\r\n\r\narr=[int(element) for element in input().split()][:n]\r\n#print(arr)\r\nx=5-k\r\narr1=[]\r\nfor i in arr:\r\n if i<=x:\r\n arr1.append(i)\r\n\r\nprint(len(arr1)//3)", "n,k = list(map(int,input().split()))\r\npeople = list(map(int,input().split()))\r\npeople = [i+k for i in people]\r\nc = 0\r\nfor i in people:\r\n if i <= 5:\r\n c += 1\r\nprint(c//3)", "# def is_prime(n):\r\n# for i in range(2,n):\r\n# if (n%i) == 0:\r\n# return False\r\n# return True\r\ndef read_int_array():\r\n return [int(i) for i in input().split(\" \")]\r\ndef read_string_array():\r\n return [i for i in input().split(\" \")]\r\n\r\nn,k = read_int_array()\r\nnumbers = read_int_array()\r\npartc = []\r\nfor number in numbers:\r\n if 5-number >=k:\r\n partc.append(number)\r\nprint(len(partc)//3)", "i = 5 - (int(input()[-1]))\r\nk = list(map(int, input().split()))\r\nl = 0\r\nfor x in k:\r\n if x<=i:\r\n l+=1\r\n\r\nprint(l//3)", "n, k = map(int,input().split())\r\nnums = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if nums[i]+k <= 5:\r\n ans += 1\r\nprint(ans//3)", "n, k = map(int, input().split())\r\nnumbers = list(map(int, input().split()))\r\nli=[]\r\ncounter=0\r\nfor item in numbers:\r\n item+=k\r\n li.append(item)\r\n\r\nfor item in li:\r\n if item<=5:\r\n counter+=1\r\nprint(counter//3)", "r=input().split(\" \")\r\nk=input().split(\" \")\r\nm=0\r\nfor fi in k:\r\n if 5-int(fi)>=int(r[1]):\r\n m=m+1\r\nprint(m//3)", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nc=0\r\nsh=list(map(int, input().split(' ')[:n]))\r\nfor p in sh:\r\n if p+k<=5:\r\n c+=1\r\nprint(c//3)\r\n", "n, k = map(int, input().split())\r\npersons = map(int, input().split())\r\nteam_members = 0\r\n\r\nfor person in persons:\r\n if person <= 5 - k:\r\n team_members += 1\r\nprint(team_members // 3)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\nn, k = list(map(int, input().split()))\r\n\r\np = list(map(int, input().split()))\r\n\r\nc = 0\r\n\r\nfor e in p:\r\n if 5 - e >= k:\r\n c += 1\r\n\r\nprint(str(c // 3) + \"\\n\")\r\n", "n, k = map(int, input().split())\ny = map(int, input().split())\ncounter = 0\nfor i in y:\n\tif (5 - i) >= k:\n\t\tcounter += 1\nprint(counter//3)", "n,k=map(int,input().split())\r\nstudents=list(map(int,input().split()))\r\ncount=0\r\nl=[]\r\nfor i in students:\r\n if abs(i-5)>=k:\r\n l.append(i)\r\ncount=len(l)//3\r\nprint(count)\r\n\r\n", "import math\r\nn,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\ny = input().split()\r\ncount = 0\r\nfor i in range(0,len(y)):\r\n y[i] = int(y[i])\r\n if (5-y[i]) >= k:\r\n count += 1\r\nprint(math.floor(count/3))", "n, k = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(n):\r\n if (y[i]+k) < 6:\r\n cnt += 1\r\nprint(cnt//3)", "n,k=map(int,input().split())\r\nar=list(map(int,input().split()))\r\ncnt=0\r\nfor i in range(n):\r\n if ar[i]+k<=5:\r\n cnt+=1\r\nprint(cnt//3)", "n, k = map(int,input().split())\r\nl = list(map(int,input().strip().split()))\r\nc = 0\r\nfor i in l:\r\n if 5-k >=i:\r\n c+=1\r\nprint (c//3)\r\n\r\n", "########################################################################\r\n\"#######################################################################\"\r\n########################################################################\r\n\"Author = Fasih_ur_Rehman\"\r\n \r\n#| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\r\n\"| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\"\r\n#| <> <> <> <> <> <> <> <> <> ####\r\n\"_________ ____ _____ ___ __ __ \"\r\n#| \\ / \\/ / \\ |\\ \\ | \\ | \\ ####\r\n\"| ▓▓█████▓ /▓█████\\ ▓▓▓▓▓▓\\| | ███ | ██ | ██ ####\"\r\n#| ▓▓_____ ▓▓__| ▓▓ ██___\\██| | ▓▓▓ | ▓▓__| ▓▓ ####\r\n\"| ██ \\ ▓▓ ▓▓ \\██ \\ | ███ | ▓▓ ▓▓ ####\"\r\n#| ▓▓▓████▓ ████████ \\▓▓▓▓▓▓\\ | ▓▓▓ | ████████ ####\r\n\"| ██ ▓▓ | ▓▓ \\__| ██| | ███ | ▓▓ | ▓▓ ####\"\r\n#| ▓▓ ▓▓ | ▓▓ \\██ ██| | ▓▓▓ | ▓▓ | ▓▓ ####\r\n\"\\_██ ██ \\██ \\▓▓▓▓▓▓/ \\_███ \\_██ \\_██ ####\"\r\n\r\n#| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\r\n\"| <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" <>\"\" ####\"\r\n#| <> <> <> <> <> <> <> <> <> ####\r\n\r\n\"#######################################################################\" \r\n######################################################################## \r\n\"#######################################################################\" \r\na,b = map(int,input().split())\r\nx = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(a):\r\n if 5-x[i]>=b:\r\n c+=1\r\nprint(c//3)", "from operator import contains\r\nfrom tabnanny import check\r\n\r\n\r\n# ?--------------------------------------------------------- I WANNA BE THE GUY -----------------------------------\r\n\r\n\"\"\" n = input()\r\n\r\ninput_string = input()\r\nuser_list1 = input_string.split()\r\n\r\nfor i in range(len(user_list1)):\r\n user_list1[i] = int(user_list1[i])\r\n\r\ninput_string = input()\r\nuser_list2 = input_string.split()\r\n\r\nfor i in range(len(user_list2)):\r\n user_list2[i] = int(user_list2[i])\r\n\r\ntotal_levels = user_list1 + user_list2\r\n\r\ni = 0\r\ntotal_list = []\r\nwhile i < int(n):\r\n total_list.append(i + 1)\r\n i = i + 1\r\n\r\ncheck=True\r\nfor item in total_list:\r\n if item not in total_levels:\r\n check=False\r\n break \r\n\r\nif check :\r\n print(\"I become the guy.\")\r\n\r\nelse:\r\n print('Oh, my keyboard!') \"\"\"\r\n\r\n# ?--------------------------------------------------------- I WANNA BE THE GUY -----------------------------------\r\n\"\"\" \r\nteams_list = []\r\ni = 0\r\nj = 0\r\ns = 0\r\nn = input()\r\n\r\nwhile i < int(n):\r\n input_string = input()\r\n input_list = input_string.split()\r\n\r\n for item in range(len(input_list)):\r\n input_list[item] = int(input_list[item])\r\n\r\n teams_list.append(input_list)\r\n i = i + 1\r\n j=0\r\n while j < i:\r\n if teams_list[j][0] == input_list[1]:\r\n s = s + 1\r\n if teams_list[j][1] == input_list[0]:\r\n s = s + 1\r\n j = j + 1\r\n\r\n\r\nprint(s) \"\"\"\r\n\r\n# ?--------------------------------------------------------- CHOOSING TEAMS -----------------------------------\r\n\r\nraw_input = input()\r\nn,k=map(int,raw_input.split())\r\ns = 0\r\n\r\ninput_string = input()\r\ninput_list = input_string.split()\r\nqualified_list = []\r\n\r\nfor item in range(len(input_list)):\r\n input_list[item] = int(input_list[item])\r\n\r\nfor item in input_list:\r\n if item + k <= 5:\r\n qualified_list.append(item)\r\n\r\ns = int(len(qualified_list) / 3)\r\nprint(s)\r\n", "c = list(map(int, input().split()))\na = c[0]\nb = c[1]\nL1 = list(map(int, input().split()))\nans = 0\nfor i in L1:\n if i+b-5<=0:\n ans+=1\nprint(ans//3)\n", "from collections import Counter\r\nn, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nc = Counter(lst)\r\na = sum(va for ki, va in c.items() if ki + k <= 5)\r\nprint(a // 3)", "a, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nd = 0\r\nfor i in range(len(c)):\r\n if c[i] + b <= 5:\r\n d += 1\r\nprint(d // 3)", "a, b = map(int, input().split())\r\nq = list(map(int, input().split()))\r\nc = 0\r\nfor i in q:\r\n if 5 - i >= b:\r\n c += 1\r\nprint(c // 3)", "# Read input values\r\nn, k = map(int, input().split())\r\nparticipation_counts = list(map(int, input().split()))\r\n\r\n# Initialize a variable to keep track of the number of teams that can be formed\r\nteams_count = 0\r\n\r\n# Count the number of students who have participated fewer than (5 - k) times\r\nfor count in participation_counts:\r\n if 5 - count >= k:\r\n teams_count += 1\r\n\r\n# Calculate the number of teams that can be formed\r\nteams_count //= 3\r\n\r\n# Print the result\r\nprint(teams_count)\r\n", "n,k = map(int,input().split())\r\npart = list(map(int,input().split()))\r\npart.sort()\r\nteam = []\r\nfor i in part:\r\n if i + k <= 5:\r\n team.append(i)\r\nif len(team) >= 3: \r\n print(len(team) // 3)\r\nelse:\r\n print(0)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor x in range(5-k+1):\r\n ans+=a.count(x)\r\nprint(ans//3)", "a = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nb = input()\r\nb = b.split()\r\nb = [int(y) for y in b]\r\nk = 0\r\nfor i in b:\r\n if i + a[1] <= 5:\r\n k += 1\r\nprint(int(k/3))", "n, k = map(int, input().split())\r\ny = input().split()\r\na = []\r\nfor m in y:\r\n a.append(int(m))\r\n\r\n\r\nc=0\r\nu=0\r\nfor i in range(len(a)):\r\n if a[i] + k <= 5:\r\n c+=1\r\n\r\n if c % 3 == 0:\r\n u+=1\r\n\r\n\r\nprint(u)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if((k+a[i])<=5):\r\n count+=1\r\nprint(count//3)\r\n ", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\ni=0\r\nf=True\r\nwhile True and len(arr)>2:\r\n for x in range(3):\r\n if 5-arr[x]<k:\r\n f=False\r\n if f:\r\n i+=1\r\n arr.pop(0),arr.pop(0),arr.pop(0)\r\nprint(i)\r\n", "data = input().split()\nstd_times = input().split()\n\nN, K = int(data[0]), int(data[1])\nstd_times = sorted(list(map(int, std_times)))\nteams = 0\ni = 0\nwhile i < N :\n if std_times[i] + K <= 5:\n teams += 1\n i += 1\n\nprint(teams//3)\n\t \t\t \t\t \t\t\t \t \t \t\t \t\t \t\t", "a=[int(x) for x in input().split()]\nx=[int(y)for y in input().split()]\nteams=0\nfor i in range(a[0]//3):\n l=[]\n for i in range(3):\n l.append(min(x))\n x.remove(min(x))\n if 5-max(l)>=a[1]:\n teams+=1\nprint(teams)\n", "n, k = map(int, input().split())\r\ny = len([int(x) for x in input().split() if int(x) <= (5-k)])\r\nprint(y//3)", "a,b=map(int,input().split())\r\nlst=list(map(int,input().split()))[:a]\r\nc=0\r\nfor i in lst:\r\n if(i+b <=5):\r\n c+=1\r\nprint(c//3)", "n,k=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nfor i in range(0,n):\r\n l1[i]+=k\r\nc=0\r\nans=0\r\nfor i in range(0,n):\r\n if(l1[i]<=5):\r\n c+=1\r\n if(c==3):\r\n ans+=1\r\n c=0\r\nprint(ans)", "l=int(input().split()[1])\r\nprint(sum(y<=5-l for y in map(int,input().split()))//3)\r\n", "n, k = map(int, input().split())\r\nparticipations = list(map(int, input().split()))\r\neligible_students = sum(5 - p >= k for p in participations)\r\nmax_teams = eligible_students // 3\r\nprint(max_teams)\r\n", "n,k=map(int,input().split())\r\nteam=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if i<=5-k:\r\n team+=1\r\nteam//=3\r\nprint(team)", "# cook your dish here\na , b = map(int,input().split())\nl = list(map(int,input().split()))\nl.sort()\nb = 5 - b\ncount = 0\nfor i in l:\n if i<=b:\n count += 1\nprint(count//3)\n\t \t \t\t \t\t \t \t\t\t\t \t \t \t \t", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\n\r\n\r\na = 5-k\r\ns = []\r\nj = 0\r\nfor j in range(0, n):\r\n \r\n if y[j]<=a:\r\n s.append(y[j])\r\n\r\n\r\nresult = len(s)//3\r\nprint(result)", "n,k=map(int, input().split())\r\nc=input().split()\r\nb=[]\r\ns=0\r\nfor i in range(n):\r\n b.append(k+(int(c[i])))\r\nfor i in range(n):\r\n if b[i]<=5:\r\n s+=1\r\nprint(s//3) ", "# @name: Choosing Teams\r\n# @author: AbrarShakhi\r\n# @link: https://codeforces.com/problemset/problem/432/A\r\n\r\n\r\nn, k = map(int, input().split())\r\nprint(len([i for i in list(map(int, input().split())) if (5 - i >= k)])//3)", "def countOfMax(items, highest, arr):\r\n count = 0\r\n for i in arr:\r\n if (i + highest) <= 5:\r\n count += 1\r\n print(count//3)\r\n\r\nif __name__ == \"__main__\":\r\n items, highest = map(int, input().split(\" \"))\r\n arr = list(map(int, input().split(\" \")))\r\n countOfMax(items, highest, arr)\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\ntemp=5-k\r\nc=0\r\nfor i in list1:\r\n if i<=temp:\r\n c+=1 \r\nprint(c//3)", "from io import BytesIO\r\nfrom os import fstat, read\r\nfrom sys import stdout\r\nfrom math import sqrt\r\n\r\ndef fast_input(file_no = 0):\r\n byte_stream = BytesIO(read(file_no, fstat(file_no).st_size))\r\n return byte_stream\r\n\r\n\r\n#fi = open(PATH_INPUT, \"r\")\r\n#io_byte_input = fast_input(fi.fileno())\r\nio_byte_input = fast_input()\r\n#fi.close()\r\nf_input = lambda: io_byte_input.readline().decode().strip()\r\n\r\ndef f_print(*output, sep = \"\\n\"):\r\n for i in output:\r\n stdout.write(str(i) + sep)\r\n #if sep != \"\\n\":\r\n # stdout.write(\"\\n\")\r\n\r\nn, k = map(int, f_input().split())\r\ntimes = list(map(int, f_input().split()))\r\neligible = 0\r\nfor i in range(n):\r\n times[i] = 5 - times[i]\r\n if times[i] >= k:\r\n eligible += 1\r\nf_print(eligible // 3)\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\ny=[int(s) for s in input().split()]\r\ncount=0\r\nfor i in range(n):\r\n if 5-y[i]>=k:\r\n count+=1\r\nprint(count//3)\r\n", "n=list(map(int,input().split()))\r\nk=list(map(int,input().split()))[:n[0]]\r\nc=0\r\nfor i in range(len(k)):\r\n if 5-k[i]>=n[1]:\r\n c+=1\r\nprint(c//3)\r\n \r\n ", "a , p = map(int,input().split())\nl = list(map(int,input().split()))\nl.sort()\np = 5 - p\ncount = 0\nfor i in l:\n if i<=p:\n count += 1\nprint(count//3)\n\t\t\t \t\t \t\t \t\t\t \t \t \t", "[m, n] = list(map(int, input().split()))\n\nnums = list(map(int, input().split()))\ncounts = 0 \nfor num in nums:\n if num + n <= 5:\n counts += 1\nprint(counts // 3)\n\t\t \t \t\t \t\t\t \t\t\t\t\t\t\t", "n,k = map(int,input().split())\r\nar = list(map(int,input().split()))\r\nc = 0\r\nfor i in ar:\r\n if (i+k) <= 5:\r\n c += 1\r\nif c < 3:\r\n print(0)\r\nelse:\r\n print(c // 3)", "o=lambda:map(int,input().split())\r\n_,k=o()\r\nprint(sum(x<=5-k for x in o())//3)\r\n", "def main():\n n, k = [int(i) for i in input().split()]\n y = [int(i) for i in input().split()]\n count_capable = 0\n for pl in y:\n if pl + k <= 5:\n count_capable += 1\n print(count_capable // 3)\n\nmain()\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n if a[i]<=(5-k):\r\n l.append(a[i])\r\nprint(len(l)//3)", "n, k = map(int, input().split())\r\ny = input().split()\r\nif k > 0:\r\n n -= y.count('5')\r\nif k > 1:\r\n n -= y.count('4')\r\nif k > 2:\r\n n -= y.count('3')\r\nif k > 3:\r\n n -= y.count('2')\r\nif k > 4:\r\n n -= y.count('1')\r\nprint(n//3)", "n, k = (int(i) for i in input().split())\ny = (int(i) for i in input().split())\nres = sum(i + k <= 5 for i in y) // 3\nprint(res)\n", "n, k = map(int, input().split(' '))\r\narr = list(map(int, input().split(' ')))\r\nc = 0\r\nfor i in arr:\r\n if (5-i) >= k:\r\n c += 1\r\nprint(c//3)", "n,k = map(int,input().split())\r\n\r\na = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(len(a)):\r\n num = (5-a[i])//k\r\n if num >0:\r\n res+=1\r\n\r\nprint(res//3)", "n,k=map(int,input().split())\r\nspis=list(map(int,input().split()))\r\nkolvo=len(spis)\r\nfor i in spis:\r\n if i>=(6-k):\r\n kolvo-=1\r\nprint(kolvo//3)\r\n", "input1 = input().split()\r\nn=int(input1[0])\r\nk=int(input1[1])\r\ninput2=input().split()\r\ncount=0\r\nfor i in range (n):\r\n if int(input2[i])<=(5-k):\r\n count +=1\r\n\r\nteams=count//3\r\nprint(teams)", "n,k = map(int,input().split())\r\narr = map(int,input().split())\r\nl = list(arr)\r\ncount = 0\r\nfor i in range(len(l)):\r\n if(5 - l[i] >= k):\r\n count += 1\r\nprint(count // 3)", "n, k = [int(i) for i in input().split()]\r\na = sorted([int(i) for i in input().split()])\r\n\r\ncount = 0\r\n\r\nfor c in a:\r\n if c <= (5-k):\r\n count += 1\r\n\r\nprint(count // 3)\r\n", "\r\nn, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\n\r\n\r\nteams = 0\r\n\r\n\r\nfor i in range(n):\r\n remaining_participations = 5 - y[i] # Calculate remaining participations allowed\r\n if remaining_participations >= k:\r\n teams += 1\r\n\r\n\r\nprint(teams // 3) \r\n", "n, k = [int(i) for i in input().split()]\r\nli = [int(i) for i in input().split()]\r\ncnt = 0\r\nfor i in range(len(li)):\r\n if li[i] + k <= 5:\r\n cnt += 1\r\nprint(cnt // 3)\r\n", "#https://codeforces.com/problemset/problem/432/A\r\n\r\n(n, k) = (int(x) for x in input().split(' '))\r\npossible_students = [int(x) for x in input().split(' ') if(int(x) <= (5 - k))]\r\nprint(len(possible_students)//3)", "print((lambda k,l:len([x for x in l if x<6-k])//3)(int(input()[-1]),map(int,input().split())))", "n, k = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\ncount = 0\r\nfor i in lst:\r\n if i <= 5 - k:\r\n count += 1\r\nprint(count // 3)", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nl=input().split()\r\nfor i,e in enumerate(l):\r\n l[i]=int(e)\r\n\r\nll=[]\r\nfor e in l:\r\n ll.append(e+k)\r\nj=0\r\nfor i in ll:\r\n if i<=5:\r\n j+=1\r\nprint(j//3)\r\n", "m,n=map(int,input().split())\nl=list(map(int,input().split()))\nc=0\nfor i in range(len(l)):\n l[i]=l[i]+n\nfor i in range(len(l)):\n if l[i]<=5:\n c+=1\ns=c//3\nprint(s)\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\na=list(map(int,input().split()))\r\ncon=0\r\nfor i in range(len(a)):\r\n if 5-a[i]>=k:\r\n con+=1\r\nprint(con//3) \r\n\r\n", "## Programmer: Omar Medhat Aly\n## Date Submitted : 12.08.2022\n## I've got some help from cpp programmers\n\n\"\"\"\nn : the range or the number of availabe inputs that we can enter [that represents the number of examined members]\nk : number of times that a memebr participated in the Championship\nwhere a member can at most 5 times participate ,so k + no.member participates <= 5\nNotice that each team should only have 3 members \n\"\"\"\nn,k = map(int,input().split())\ny = list(map(int,input().split()))\ncounter = 0\nfor i in range(n):\n if k + y[i] <= 5 :\n counter += 1\n\nprint(int(counter // 3))\n \t\t\t\t\t \t\t \t\t \t \t \t \t\t\t\t \t\t \t", "n, k = list(map(int, input().split()))\nl = list(map(int, input().split()))\nl.sort()\na = 3\nb = 5\n\nres = [i for i in l if 5 - k >= i]\n\nprint(len(res) // 3)\n", "n, k = map(int, input().split())\nsumma = 0\nfor i in list(map(int, input().split())):\n if 5 - i >= k:\n summa += 1\nprint(summa // 3)\n", "j=0\r\nn,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nfor i in a:\r\n if i <= 5-k:\r\n j+=1\r\nprint(j//3)\r\n", "n,k=map(int,input().split())\na=list(map(int,input().split()))\nm=n\nfor i in range(m):\n if a[i]>5-k:\n n-=1\nprint(n//3)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na=list(filter(lambda x:x<=5-k,a))\r\nprint(len(a)//3)", "a=list(map(int,input().strip().split()))\r\nb=list(map(int,input().strip().split()))\r\nn=a[0]\r\nk=a[1]\r\ncount=0\r\nfor i in b:\r\n if i<=5-k:\r\n count=count+1\r\nprint(count//3)", "n,k = map(int,input().split())\r\nchel = [int(i) for i in (input().split())]\r\nsostav = []\r\nfor i in range(len(chel)):\r\n if chel[i] + k <= 5:\r\n sostav.append(chel[i])\r\nprint(len(sostav)//3)", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\n\r\ns = 0\r\nfor i in a:\r\n if 5-i >= k:\r\n s += 1\r\n\r\nprint(s//3)\r\n", "n,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nvar=n%3\r\nif var!=0:\r\n if var==1:\r\n lst.pop()\r\n count=0\r\n y=(5-k)\r\n for i in range(0,len(lst),3):\r\n x=lst[:i+3]\r\n if y>=max(x):\r\n count+=1\r\n print(count)\r\n else:\r\n lst.pop()\r\n lst.pop()\r\n count=0\r\n y=(5-k)\r\n for i in range(0,len(lst),3):\r\n x=lst[:i+3]\r\n if y>=max(x):\r\n count+=1\r\n print(count)\r\nelse:\r\n count=0\r\n y=(5-k)\r\n for i in range(0,len(lst),3):\r\n x=lst[:i+3]\r\n if y>=max(x):\r\n count+=1\r\n print(count)\r\n\r\n", "n , k = input().split()\r\nx = input().split()\r\ncount = 0\r\ncounter = 0\r\nfor i in x:\r\n if(int(i) + int(k) <= 5):\r\n count+=1\r\n\r\ncounter = count // 3\r\nprint(counter)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in (a):\r\n if i + m <=5:\r\n s+=1\r\nprint(s//3)\r\n", "n,k=map(int,input().split());l=list(map(int,input().split()));l=sorted(l);c=0\r\nfor i in range(n):\r\n if (5-l[i])>=k: c+=1\r\nprint(c//3)", "n, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nres = 0\r\ncurr = 0\r\n\r\nfor i in lst:\r\n if 5-i >= k:\r\n curr += 1\r\n\r\n if curr == 3:\r\n res += 1\r\n curr = 0 \r\nprint(res)", "\"\"\"\nA. Choosing Teams: greedy, implementation, sortings\n\ntime limit per test: 1 second\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\nThe Saratov State University Olympiad Programmers Training Center (SSU OPTC) has n students.\nFor each student you know the number of times he/she has participated in the ACM ICPC world programming championship.\nAccording to the ACM ICPC rules, each person can participate in the world championship at most 5 times.\nThe head of the SSU OPTC is recently gathering teams to participate in the world championship.\nEach team must consist of exactly three people, at that, any person cannot be a member of two or more teams.\nWhat maximum number of teams can the head make if he wants each team to participate in the world championship with the same members at least k times?\n\nInput\nThe first line contains two integers, n and k (1 ≤ n ≤ 2000; 1 ≤ k ≤ 5).\nThe next line contains n integers: y1, y2,..., yn (0 ≤ yi ≤ 5), where yi shows the number of times the i-th person participated in the ACM ICPC world championship.\n\nOutput\nPrint a single number — the answer to the problem.\n\"\"\"\n\ndef choosing_teams():\n n, k = map(int, input().split(' '))\n y = list(map(int, input().split(' ')))\n c = 0\n for i in y:\n if i + k <= 5:\n c += 1\n print(c // 3)\n\nif __name__ == '__main__':\n choosing_teams()", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nteams=0\r\nfor i in l:\r\n if(i+k<=5):\r\n teams+=1\r\nprint(teams//3)\r\n \r\n \r\n \r\n ", "n,w=list(map(int,input().split()))\ny=list(map(int,input().split()))\ny.sort()\nw=5-w\nc=0\nfor i in y:\n\tif i<=w:\n\t\tc+=1\nprint(c//3)\n\t \t \t\t \t\t \t\t \t \t\t\t \t\t", "n,k=map(int,input().split())\r\nparticipation=list(map(int,input().split()))\r\neligible_participants=sum(1 for p in participation if 5 - p >=k)\r\nmax_teams=eligible_participants //3\r\nprint(max_teams)", "n,k=map(int,input().split())\r\nd=list(map(int,input().split()))\r\nc=0\r\nfor i in d:\r\n if 5-i>=k:\r\n c+=1\r\nprint(c//3)", "n,k=map(int,input().split())\r\nlistx=list(map(int,input().split()))\r\ncntr=0\r\nfor m in listx:\r\n if(m+k<=5):\r\n cntr+=1\r\nprint(cntr//3)", "# Wadea #\r\n\r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nc = 0\r\nfor i in arr:\r\n if 5 - i >= k:\r\n c += 1\r\nprint(c//3)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\ncount = 0\r\nl = [int(x) for x in input().rstrip().split()][:n]\r\nfor i in range(len(l)):\r\n if l[i]+k <= 5:\r\n count += 1\r\n\r\nprint(count//3)", "n, k = map(int, input().split())\r\n\r\nl = [int(i) for i in input().split()]\r\n\r\nnum = 5 - k\r\ncount = 0\r\nfor i in l:\r\n if i <= num:\r\n count += 1\r\n\r\nprint(count//3)", "import sys\r\n\r\nk = [int(i) for i in sys.stdin.readline().split()]\r\narray = [int(i) for i in sys.stdin.readline().split()]\r\narr = []\r\nfor i in array:\r\n if i + k[1] <= 5:\r\n arr.append(i)\r\n else:\r\n continue\r\nprint(len(arr) // 3)\r\n", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\nb = 0\r\nfor i in range(len(y)):\r\n if y[i] + k <= 5:\r\n b += 1\r\n else:\r\n continue\r\nprint(b // 3)\r\n", "s = input().split(\" \")\r\nmas = input().split(\" \")\r\nch = 0\r\nn = int(s[0])\r\nk = int(s[1])\r\nfor i in range(0, n):\r\n mas[i] = int(mas[i])\r\nfor i in range(0, n):\r\n if mas[i] + k <= 5:\r\n ch += 1\r\nprint(ch // 3)", "n, m = map(int, input().split())\r\nl = [int(i) for i in input().split()]\r\nk = 0\r\nsum_ = 0\r\nfor i in range(n):\r\n if l[i] + m <= 5:\r\n sum_ += 1\r\n if sum_ == 3:\r\n k += 1\r\n sum_ = 0\r\nprint(k)\r\n", "def solve(n,k,l):\r\n c=0\r\n for i in l:\r\n if i+k<=5:\r\n c+=1\r\n return c//3\r\n\r\n\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(solve(n,k,l))", "a,b=input().split(\" \")\r\na=int(a)\r\nb=int(b)\r\nc=input().split(\" \")\r\ne=len(c)\r\n\r\nfor d in range(a):\r\n c[d]=int(c[d])\r\n c[d]=c[d]+b\r\n\r\nfor d in range(a):\r\n if c[d]>5:\r\n e=e-1\r\n\r\nprint(e//3)", "import math\nimport io, os, sys\n\ndef main():\n n, k = in_map(int)\n a = inlis_map(int)\n cnt = 0\n for e in a:\n if e + k <= 5:\n cnt+=1\n print(cnt // 3)\n\n\ndef inlis_map(fnc):\n return list(map(fnc, fastin().split()))\n\ndef in_map(fnc):\n return map(fnc, fastin().split())\n\ndef inint():\n return int(fastin())\n\ndef instr():\n return fastin().strip()\n\n__instrm = io.BytesIO(os.read(0, os.fstat(0).st_size))\n\ndef fastin():\n global __instrm\n return __instrm.readline().decode()\n\ndef put(f):\n if type(f) is str:\n sys.stdout.write(f)\n else:\n sys.stdout.write(str(f))\n\ndef puts(f):\n put(f)\n sys.stdout.write(\"\\n\")\n\ndef outnl():\n sys.stdout.write(\"\\n\")\n\ndef outsp():\n sys.stdout.write(\" \")\n\nmain()\n\n", "a,n = map(int, input().split())\r\nl = list(map(int,input().split()))\r\nd = n\r\n\r\nfor i in range(len(l)):\r\n if l[i]+n>5:\r\n l.insert(i, '*')\r\n l.pop(i+1)\r\n\r\nfiltered_list = [item for item in l if isinstance(item, int)]\r\n\r\n\r\nif len(filtered_list)<3:\r\n print(0)\r\nelse:\r\n print(int(len(filtered_list)/3))", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint((sum(1 for i in l if (5-i)>=k))//3)", "v=lambda:map(int,input().split())\r\n_,c=v()\r\nprint(sum(a<=5-c for a in v())//3)\r\n#HI CODEFORCES\r\n#", "n, k = map(int, input().split())\r\nl = list(map(int,input().split()))\r\n\r\nl = sorted(l)\r\ncount = 0\r\n\r\nfor i in range (len(l)):\r\n if (i+1)%3 == 0:\r\n if l[i] <= 5-k:\r\n count += 1\r\n else:\r\n break\r\n\r\nprint(count)", "n, k = map(int, input().split())\r\na = input().split()\r\na = [int(i) for i in a]\r\ncnt = 0\r\nfor i in range(len(a)):\r\n if a[i] + k <= 5:\r\n cnt += 1\r\npos = cnt // 3\r\nprint(pos)", "string1 = [int(i) for i in input().split()]\r\ncounter = [int(i) for i in input().split()]\r\nn, k = string1[0], string1[1]\r\ncount = []\r\n\r\nfor i in counter:\r\n if i + k <= 5:\r\n count.append(i)\r\n \r\nprint(len(count) // 3)", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(n):\r\n\tif (5-l[i] >= k):\r\n\t\tcnt += 1\r\nprint(cnt//3)", "n, k = map(int, input().split())\r\ne = list(map(int, input().split()))\r\nt = sum(1 for c in e if c <= (5 - k)) // 3\r\nprint(t)", "n,k=map(int,input().split())\r\ns=input().split()\r\nc=0\r\nfor i in s:\r\n if int(i)+k>5:\r\n c+=1\r\nprint((n-c)//3)", "n, k = list(map(int, input().split()))\r\ng = list(map(int, input().split()))\r\nj = []\r\nz = 0\r\nfor i in g:\r\n if i + k > 5:\r\n g\r\n else:\r\n j.append(i)\r\nprint(len(j)//3)", "def main():\r\n n, k = list(map(int, input().split()))\r\n ans = 0\r\n a = list(map(int, input().split()))\r\n a = [i + k for i in a]\r\n for i in a:\r\n if i <= 5:\r\n ans += 1\r\n print(ans // 3)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\na = max(l)+1\r\nfor i in l :\r\n if i+k> 5 :\r\n l[l.index(i)] = a\r\nwhile a in l :\r\n l.remove(a)\r\nprint(int(len(l)/3))", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in range(a):\r\n l[i]+=b\r\nc=0\r\nfor i in l:\r\n if i<=5:\r\n c+=1\r\nprint(c//3) ", "n,k=map(int,input().split())\r\na=map(int,input().split())\r\na=list(a)\r\ns=[]\r\nfor i in range (n):\r\n if a[i]+k<=5:\r\n s.append(a[i])\r\nprint (int(len(s)//3))", "s=list(map(int,input().split()))\r\nk=s[1]\r\ntemp=list(map(int,input().split()))\r\ntemp.sort()\r\ncount=0\r\nt=5-k\r\n\r\nfor i in temp:\r\n if i<=t:\r\n count+=1\r\n \r\nprint(count//3)\r\n", "n,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nni = input().split()\r\nif k==5:\r\n print((ni.count('0'))//3)\r\nelif k==4:\r\n print(((ni.count('1'))+(ni.count('0')))//3)\r\nelif k==3:\r\n print(((ni.count('2'))+ni.count('1')+ni.count('0'))//3)\r\nelif k==2:\r\n print(((ni.count('3'))+ni.count('2')+ni.count('1')+ni.count('0'))//3)\r\nelif k==1:\r\n print((((ni.count('4'))+ni.count('3'))+ni.count('2')+ni.count('1')+ni.count('0'))//3)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n if a[i]<= 5-k :\r\n s+=1\r\nprint(s//3)", "a=input().split()\r\nn=int(a[0]) \r\nk=int(a[1])\r\ny=input().split()\r\ncount=0\r\nfor i in range(n):\r\n if(5-int(y[i])>=k):\r\n count+=1\r\nprint(count//3) \r\n\r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ni = 0\r\nwhile i!=len(a):\r\n if a[i]>5-k:\r\n a.pop(i)\r\n else:\r\n i+=1\r\nprint(len(a)//3)", "a, b = map(int, input().split())\r\narr = list(map(lambda x: 5 - x >= b, map(int, input().split())))\r\nprint(arr.count(True) // 3)", "n, k = [int(i) for i in input().split()]\r\ny_list = sorted([int(i) for i in input().split()])\r\nnum_of_possible_teams = 0\r\nwhile len(y_list) >= 3 and k + max(y_list[:3]) <= 5:\r\n num_of_possible_teams += 1\r\n y_list = y_list[3:]\r\n\r\nprint(num_of_possible_teams)\r\n", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\ncounter = 0\r\nfor i in range(n):\r\n if y[i] + k <= 5:\r\n counter += 1\r\nprint(counter // 3)\r\n", "nk = list(map(int,input().strip().split()))[:2]\n\nmembers = list(map(int,input().strip().split()))[:nk[0]]\nteams=0\nmembers = sorted(members)\n\nfor i in range(nk[0]):\n if(members[i]+nk[1]<=5):\n teams+=1\n continue\n\nprint(int(teams/3))\n\n\t \t\t \t\t \t \t\t \t \t \t\t", "n, k = map(int, input().split())\r\ntimes = list(map(int, input().split()))\r\n\r\nstudCount = 0\r\n\r\nfor i in range(6 - k) :\r\n studCount += times.count(i)\r\n\r\nprint(studCount // 3)\r\n\r\n", "import sys\r\n\r\nx = sys.stdin.readlines()\r\n\r\na, b = map(int, x[0].split())\r\nz = list(map(int, x[1].split()))\r\nposs=[]\r\nfor i in range(a):\r\n if z[i]+b > 5:\r\n continue\r\n else:\r\n poss.append(z[i])\r\n\r\nprint(int(len(poss)/3))", "def makeTeams(array, k):\r\n\tcount = 0\r\n\tfor i in array:\r\n\t\tif k + i <= 5:\r\n\t\t\tcount += 1\r\n\treturn count // 3\r\n\r\nn, k = [int(x) for x in input().split()]\r\narray = [int(x) for x in input().split()]\r\nprint(makeTeams(array, k))\r\n", "q, w = map(int, input().split())\r\ne = list(map(int, input().split()))\r\nr = 0\r\nfor i in e:\r\n if i + w < 6:\r\n r += 1\r\nprint(r // 3)", "n,t=input().split()\r\nn,t=int(n),int(t)\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\ni=0\r\nwhile i+2<n:\r\n if l[i]+t<=5 and l[i+1]+t<=5 and l[i+2]+t<=5:\r\n c+=1\r\n i+=3\r\n else:\r\n break\r\nprint(c)", "n,k=list(map(int, input().split()))\r\ncount=0\r\ny=list(map(int, input().split()))\r\nfor i in range(n):\r\n if 5-k>=y[i]:\r\n count+=1\r\nprint(count//3) ", "n,k = map(int,input().split())\r\ny = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n if(y[i] <= 5-k):\r\n count += 1\r\nprint(count//3)", "n, k = map(int, input().split(' '))\ny = list(filter(lambda x: 5 - x >= k, map(int, input().split(' '))))\nprint(len(y) // 3)\n", "cnt = 0\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if 5 - a[i] >= k:\r\n cnt += 1\r\n\r\nprint(cnt // 3)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ng,c=0,0\r\nfor i in l:\r\n if i<=(5-k):\r\n c+=1\r\n if (c==3):\r\n c=0\r\n g+=1\r\nprint(g)", "n, k = map(int, input().split())\r\ny = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in range(len(y)):\r\n if y[i] + k <= 5:\r\n c += 1\r\nprint(c // 3)", "n, k = map(int, input().split())\r\na = [x for x in list(map(int, input().split())) if 5-x >= k]\r\nif len(a) < 3:\r\n print(0)\r\nelse:\r\n print(int(len(a)/3))", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nfor x in a:\r\n count += x<6-k\r\nprint(count//3)", "\r\nn,k = map(int, input().split())\r\np = list(map(int, input().split()))\r\n\r\n\r\nc=0\r\nfor i in range(0,n):\r\n \r\n if (p[i]+k <=5):\r\n c+=1\r\n\r\n\r\n\r\nr=c/3\r\n\r\nprint(int(r))\r\n", "n, k = map(int, input().split())\ny = list(map(int, input().split()))\ncount = 0\nfor i in y:\n if i <= 5 - k:\n count += 1\nprint(count // 3)\n", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nch = 0\r\nfor i in s:\r\n if 5 - i >= k:\r\n ch += 1\r\nprint(ch // 3)\r\n", "students, times = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nc = 0\r\nfor i in y:\r\n if i <= 5 - times:\r\n c+=1\r\nprint(int(c/3))", "#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 l.sort()\r\n ans=0\r\n if(n<=2):\r\n return 0\r\n for i in range(2,n,3):\r\n if(5-l[i]>=k):\r\n ans+=1\r\n else:\r\n return ans\r\n return ans\r\n \r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(exe())", "\r\nn1, k1 = map(int, input().split())\r\ns1 = str(6-k1)\r\nprint(sum(i<s1 for i in input()[::2]) // 3)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=[]\r\nfor i in l:\r\n if (5-i)>=k:\r\n s.append(i)\r\nif len(s)>=3:\r\n print(len(s)//3) \r\nelse:\r\n print(0) ", "n,k=map(int, input().split())\r\ny=map(int, input().split())\r\nx=sorted(y)\r\nc=0\r\nfor i in x:\r\n if i <= 5-k:\r\n c+=1\r\nprint(c//3)", "n,k=[int(i) for i in input().split()]\r\ny=[int(i) for i in input().split()]\r\ncnt=0\r\nfor j in y:\r\n if j<=5-k:\r\n cnt+=1\r\nprint(cnt//3)", "Info = input()\r\nRecords = input()\r\nRecords.split(\" \")\r\nCount = 0\r\n\r\nfor i in range(0, len(Records), 2):\r\n if (int(Records[i]) + int(Info[-1])) <= 5:\r\n Count += 1\r\n\r\nTeams = Count // 3\r\nprint(Teams)\r\n", "x,y=map(int,input().split())\r\nlist=[int(i) for i in input().split()]\r\ny_2=5-y\r\nlist_2=[i for i in list if i<=y_2]\r\nif len(list_2)<3:\r\n print(0)\r\nelse:\r\n print(int(len(list_2)/3))", "n,k=[int(i) for i in input().split()]\r\ny=[int(i) for i in input().split()]\r\ncnt=0\r\nfor i in range(0,n):\r\n if 5 - y[i] >= k:\r\n cnt+=1\r\nprint(int(cnt/3))", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nlst=[]\r\nc=0\r\nfor i in range(len(l)):\r\n\tlst.append(l[i]+k)\r\nfor i in range(len(l)):\r\n\tif(lst[i]<=5):\r\n\t\tc+=1\r\nprint(c//3)", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl = [i + k <= 5 for i in l]\r\nprint(l.count(True) // 3)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n a[i]=a[i]+k\r\nfor i in range(n):\r\n if a[i]<=5:\r\n c+=1\r\nif c>=3:\r\n print(c//3)\r\nelse:\r\n print(0)", "n,k=map(int,input().split())\r\ny=(''.join(input())).split()\r\na=[]\r\nfor i in y:\r\n if int(i)+k<=5:\r\n a.append(i)\r\nprint(len(a)//3)\r\n \r\n", "n,k=map(int,input().split())\nl=list(map(int,input().split()))\nc=0\nfor i in l:\n\tif (i+k)<=5:\n\t\tc+=1\nprint(c//3)\n \t\t \t \t \t \t\t\t\t \t\t \t \t\t \t \t", "k = int(input().split()[1])\nprint(sum(int(x) <= 5 - k for x in input().split()) // 3)\n", "listX = list(map(int,input().split(\" \")))\r\nn = listX[0]\r\nk = listX[1]\r\nlistA = list(map(int,input().split(\" \")))\r\nvalue = 5-k\r\ncount = 0\r\nfor a in listA:\r\n if a in range(0,value+1):\r\n count+=1\r\nans = count//3\r\nprint(ans)", "n,k= (map(int, input().split()))\r\nl1= list(map(int, input().split()))\r\nl2=list()\r\nfor i in range(len(l1)):\r\n if l1[i]+k<= 5:\r\n l2.append(l1[i])\r\nprint(int(len(l2)/3))", "import math\r\n\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if int(l[i]+k)<=5:\r\n count+=1\r\nprint(math.floor(count/3))", "n, k = map(int, input().split())\r\n\r\nparticipation_count = list(map(int, input().split()))\r\n\r\ncounter = 0\r\n\r\nfor s in participation_count:\r\n\tif s + k <= 5:\r\n\t\tcounter += 1\r\n\r\nprint(counter//3)", "n,k = map(int,input().split())\r\nnum_lst = sorted(list(map(int,input().split())))\r\nanswer = 0\r\nfor i in range(len(num_lst)):\r\n if num_lst[i] > 5-k:\r\n answer = i\r\n break\r\n if answer == 0:\r\n answer = len(num_lst)\r\nprint(int(answer/3))", "a = input().split()\r\nn = int(a[1]); \r\nanswer = 0\r\nb = list(map(int, input().split()))\r\n\r\n\r\nfor i in b:\r\n if i + n <= 5: answer += 1\r\n # if 5 - i >= n: answer.append(i)\r\n \r\nprint(answer//3)", "n,k=input().split()\r\nn,k=int(n),int(k)\r\n\r\nones=input().split()\r\nmembers=[int(x) for x in ones if int(x)+k<=5]\r\n\r\nprint(int(len(members)//3))\r\n", "n,k1=map(int,input().split())\r\nl=input().split()\r\nl=[int(i) for i in l]\r\ncount=0\r\nfor i in range(len(l)):\r\n if l[i]<=5-k1:\r\n count=count+1\r\nprint(int(count/3))\r\n# print(int(count)/3)", "n,k = map(int,input().split())\nstudents = list(map(int,input().split()))\nc = 0\nfor student in students:\n if student + k >5:\n continue\n c+=1\nprint(c//3)", "n, k = [int(x) for x in input().split()]\r\ns = [int(x) + k for x in input().split() if int(x) + k <= 5]\r\nprint(len(s) // 3)", "a,b = map(int,input().strip().split())\r\ncount=0 \r\nlst= list(map(int, input().strip().split())) \r\nfor i in range(a):\r\n if lst[i]+b<=5:\r\n count=count+1\r\nprint(int(count/3))", "import sys\r\n\r\nn, k = (int(el) for el in input().split())\r\na = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n if a[i] + k <= 5:\r\n cnt += 1\r\n \r\nprint(cnt // 3)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm=0\r\nfor i in l:\r\n\tx=i+k\r\n\tif x<6:\r\n\t\tm+=1\r\nprint(m//3)", "n,k=map(int,input().split())\r\na=0\r\ny=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n if y[i]+k>5:\r\n a+=0\r\n else:\r\n a+=1\r\nprint(a//3)\r\n", "x,y=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsum=0\r\nfor i in a:\r\n if i+y<=5:\r\n sum=sum+1\r\nprint(sum//3)", "n,k=map(int,input().split())\r\n\r\nmy_list=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n my_list[i] += k\r\n\r\ncount=0\r\n\r\nfor item in my_list:\r\n if item <=5:\r\n count += 1\r\n\r\nprint(count//3)", "n,k = map(int,input().split())\narr = list(map(int,input().split()))\n\nans = 0\nfor i in arr:\n if i + k <= 5:\n ans+=1\nprint(ans // 3)\n", "n , k = map(int , input().split())\r\na = list(map(int,input().split()))\r\nans = 0\r\ncount = 0\r\nfor i in range(n):\r\n if(a[i] <= (5 - k)):\r\n count += 1\r\nprint((count // 3))\r\n", "n, k = map(int, input().split())\nl = list(map(int, input().split()))\ncount = 0\nfor i in range(n):\n if 5 - l[i] < k:\n count += 1\nprint((n - count)//3)\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\ny = list(map(int,input().split()))\r\n\r\nf = list(filter(lambda item: 5 - item >= k, y))\r\n\r\nprint(len(f)//3)\r\n", "n , k = map(int , input().split())\r\nmyList = list(map(lambda x: int(x)<=5-k , input().split()))\r\nprint(myList.count(True)//3)\r\n", "n, k = map(int, input().split()) # Read n and k\nl = list(map(int, input().split())) # Read list of integers\nh = [] # Initialize list for selected integers\n# Iterate through the list, adding integers that meet the condition\nfor i in range(n):\n if k + l[i] <= 5:\n h.append(l[i])\n# Calculate and print the number of groups of 3 from selected integers\nprint(len(h) // 3)\n\t\t \t \t \t \t\t\t \t \t\t \t\t", "n,k = map(int,input().split())\r\na = list(map(int, input().split()))\r\ncnt=0\r\nfor i in a:\r\n\tx = 5-i\r\n\tif x>=k:\r\n\t\tcnt+=1\r\nprint(int(cnt/3))", "v=0\r\nn,k=map(int,input().split())\r\np=list(map(int,input().split()))\r\nfor i in p:\r\n if(i+k<=5):\r\n v=v+1\r\nprint(v//3)", "n, k = map(int, input().split())\r\nparticipation = list(map(int, input().split()))\r\n\r\neligible_students = sum(1 for p in participation if p + k <= 5)\r\nteams = eligible_students // 3\r\n\r\nprint(teams)", "\r\nn, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncnt=0\r\nfor i in arr:\r\n \r\n i=i+m\r\n if i<=5 :\r\n cnt+=1\r\nprint(cnt//3); ", "n,k=map(int,input().split())\narr=list(map(int,input().split()))\nreq=5-k\ncount=0\nfor i in arr:\n if i <= req:\n count += 1\nprint(count//3)", "_, years = map(int, input().split())\r\nprint(len(list(filter(lambda x: x + years <= 5, [int(x) for x in input().split()]))) // 3)", "# Define a function to read the input values and return them as a tuple.\r\ndef read_input():\r\n \"\"\"\r\n Reads the input values and returns them as a tuple.\r\n \"\"\"\r\n num_students, min_participations = map(int, input().split()) # read n and k\r\n participations = list(map(int, input().split())) # read the list of participation counts\r\n return num_students, min_participations, participations\r\n\r\n# Define a function to count the number of eligible students.\r\ndef count_eligible_students(min_participations, participations):\r\n \"\"\"\r\n Counts the number of students who are eligible to participate in the contest,\r\n given the minimum number of participations and the list of participation counts.\r\n \"\"\"\r\n # Count the number of students whose participation count is at most 5 - k.\r\n eligible_count = sum(1 for p in participations if 5 - p >= min_participations)\r\n return eligible_count\r\n\r\n# Define a function to compute the maximum number of teams that can be formed.\r\ndef compute_max_teams(eligible_count):\r\n \"\"\"\r\n Computes the maximum number of teams that can be formed, given the number of eligible students.\r\n \"\"\"\r\n # Divide the number of eligible students by 3 to get the maximum number of teams.\r\n max_teams = eligible_count // 3\r\n return max_teams\r\n\r\n# Define a function to output the maximum number of teams.\r\ndef output_result(max_teams):\r\n \"\"\"\r\n Outputs the maximum number of teams that can be formed.\r\n \"\"\"\r\n print(max_teams)\r\n\r\n# Main program\r\n# Read the input values using the read_input() function.\r\nnum_students, min_participations, participations = read_input()\r\n\r\n# Count the number of eligible students using the count_eligible_students() function.\r\neligible_count = count_eligible_students(min_participations, participations)\r\n\r\n# Compute the maximum number of teams using the compute_max_teams() function.\r\nmax_teams = compute_max_teams(eligible_count)\r\n\r\n# Output the result using the output_result() function.\r\noutput_result(max_teams)\r\n", "count = 0\r\na,b = map(int,input().split())\r\nh = list(map(int,input().split()))\r\nfor i in range(a):\r\n\tif (5-h[i]) >= b:\r\n\t\tcount += 1\r\n\telse:\r\n\t\tcount += 0\r\nprint(count//3)", "dl, ile_razy = input().split()\r\ndl = int(dl)\r\nile_razy = int(ile_razy)\r\n\r\nuczestnicy = input().split()\r\nfor i in range(dl):\r\n uczestnicy[i] = int(uczestnicy[i])\r\n\r\nlista_zespol = []\r\nwynik = 0\r\n\r\nfor i in range(dl):\r\n if 5 - uczestnicy[i] >= ile_razy:\r\n lista_zespol.append(uczestnicy[i])\r\n if len(lista_zespol) == 3:\r\n lista_zespol = []\r\n wynik += 1\r\n\r\nprint(wynik)\r\n", "n,k=map(int,input().split())\r\ny=list(map(int,input().split()))\r\ns=0\r\ns2=0\r\na=5\r\nfor i in range(n):\r\n result=a-k\r\n if y[i]<=result:\r\n s=s+1\r\n \r\n \r\nprint(s//3)", "n,m = map(int,input().split())\r\na = 5-m\r\nmas = list(map(int, input().split()))\r\nk = 0\r\nfor i in mas:\r\n if i<=a:\r\n k += 1\r\nprint(k//3)", "\r\nmembers, k = list(map(int, input().split()))\r\nprint(sum(map(lambda x: 5 - int(x) >= k, input().split()))//3)", "n,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\na=5-k\r\nans=0\r\nfor i in l:\r\n if i<=a:\r\n ans+=1\r\nprint(ans//3)", "n, k = input().split()\r\nn,k=int(n),int(k)\r\na = input().split()\r\nfit = 0\r\nfor i in a:\r\n if int(i) + k <=5:\r\n fit += 1\r\nprint(fit//3)\r\n \r\n", "from sys import stdin\r\nn,k=map(int,stdin.readline().split())\r\nc=0\r\nfor i in map(int,stdin.readline().split()):\r\n if i+k<=5:\r\n c+=1\r\nprint(c//3)\r\n", "n,k=list(map(int,input().split()))\r\n\r\nx=list(map(int,input().split()))\r\n\r\ncnt=0\r\n\r\nfor i in range(len(x)):\r\n if (x[i]+k)<=5:\r\n cnt+=1\r\n\r\nprint(cnt//3)\r\n", "n,k = [int(x) for x in input().split()]\r\nn1 = input().split()\r\nc = 0\r\n\r\nfor i in range(n):\r\n if (5 - int(n1[i])) >= k:\r\n c += 1\r\nprint(c//3)", "\r\nn,k= [int(i) for i in input().rstrip().split()] \r\nk=5-k\r\nlst=list(map(int,input().rstrip().split()))\r\nlst2=[]\r\nfor i in lst:\r\n if i<=k:\r\n lst2.append(i)\r\nprint(len(lst2)//3)", "n,k = map(int,input().split())\r\ntimes = list(map(int,input().split()))\r\ncount = 0\r\nteams = []\r\nlimit = 5-k\r\nfor i in times:\r\n if i <= limit:\r\n count+=1\r\n teams.append(i)\r\nprint(count//3)\r\n\r\n", "n, k = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\ncount = 0\r\nfor item in data:\r\n if 5 - item >= k:\r\n count += 1\r\n\r\nprint(count//3)", "a1 , b1 = map(int,input().split())\nlis = list(map(int,input().split()))\nlis.sort()\nb1= 5 - b1\nc = 0\nfor i in lis:\n if i<=b1:\n c += 1\nprint(c//3)\n \t\t \t \t \t\t\t \t \t\t \t\t \t \t\t", "if __name__ == \"__main__\":\r\n n, k = map(int,input().split())\r\n p = list(map(int,input().split()))\r\n \r\n participants = len([i for i in range(n) if p[i] + k <= 5])\r\n teams = participants // 3\r\n \r\n print(teams)\r\n", "n, k = map(int, input().split())\r\nparticipations = list(map(int, input().split()))\r\ncount_eligible = sum(1 for p in participations if p <= (5 - k))\r\nteams = count_eligible // 3\r\nprint(teams)", "length,times = [int(x) for x in input().split()]\r\ncontestants = [int(x) for x in input().split()]\r\n\r\ncontestants_eligible = [x for x in contestants if x <= 5-times]\r\n\r\nprint(len(contestants_eligible)//3)", "n, k = [int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nl=[]\r\nfor i in a:\r\n if i+k<=5:\r\n l.append(i)\r\n else:\r\n continue\r\nprint(len(l)//3)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ng = 5-k\r\nl = []\r\nfor i in range(n):\r\n if a[i]<=g:\r\n l.append(a[i])\r\nprint(len(l)//3) ", "# Happy_water\r\ndef main():\r\n n, k = map(int, input().split())\r\n y = list(map(int, input().split()))\r\n cnt = 0\r\n for i in range(n):\r\n if 5 - y[i] >= k:\r\n cnt += 1\r\n print(cnt // 3)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,k=map(int,input().split())\ns=list(map(int,input().split()))\ncount=0\nfor i in s:\n\tif i+k<=5:\n\t\tcount+=1\nprint(count//3)", "a,b=map(int,input().split())\r\na=5-b\r\nl=list(map(int,input().split()))\r\nct=0\r\nfor i in l:\r\n if i<=a:\r\n ct+=1\r\nprint(ct//3)", "n,k=map(int,input().split(' '))\r\narray=list(map(int,input().split(\" \",n-1)))\r\narray1=[]\r\nfor i in range(len(array)):\r\n if (array[i]<=(5-k)):\r\n array1.append(array[i])\r\narray1=sorted(array1)\r\nteams=0\r\nlength=len(array1)\r\nwhile length>=3:\r\n teams+=1\r\n length-=3\r\nprint(teams)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n a[i]+=k\r\ncount=0\r\nfor i in a:\r\n if i<=5:\r\n count+=1\r\nprint(count//3)", "n,k = map(int, input().split())\r\nmylist = list(map(int, input().split()))\r\nsum = 0\r\nk = 5 - k\r\nfor i in range(n):\r\n if mylist[i] <= k:\r\n sum += 1\r\nprint(int(sum/3))", "\r\ncount=0\r\nn,k= map(int, input().split())\r\na= list(map(int, input().split()))\r\nfor i in range(len(a)):\r\n if a[i]+k<=5:\r\n count+=1\r\n \r\nprint(int(count/3))\r\n \r\n", "n,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nl = [int(x) for x in input().split()]\r\nb = 5-k\r\ncount =0\r\nfor i in range(0,len(l)):\r\n if l[i]<=b:\r\n count =count +1\r\nprint(count//3)", "n,m = map(int, input().split())\r\n\r\nx = [int(x) for x in input().split()]\r\ny = []\r\nfor i in x:\r\n if (5-i) >= m:\r\n y.append(i)\r\n\r\na = int(len(y) / 3)\r\n\r\nprint(a)", "n, h= map(int, input().split())\r\nt = [int(i) + h for i in input().split() if (int(i) + h) <= 5]\r\nprint(len(t) // 3)", "a,b = map(int,input().split())\r\nc = input().split()\r\nnew_list=[]\r\nfor i in range(len(c)):\r\n c[i] = int(c[i])\r\nfor i in c:\r\n if 5-i>=b:\r\n new_list.append(i)\r\nprint(len(new_list)//3)", "n,k=map(int,input().split())\r\ny=list(map(int,input().split()))\r\np=5-k\r\ncount=0\r\nfor i in range(p+1):\r\n count+=y.count(i)\r\nprint(int(count/3))", "import math\r\nn,k=map(int,input().split())\r\ncnt=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if 5-i>=k:\r\n cnt+=1\r\nprint(cnt//3) \r\n ", "import sys\r\n\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\n\r\n\r\ndef in_int():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef in_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef in_map_int():\r\n return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef in_arr_int():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef in_arr_str():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef is_prime(n):\r\n for i in range(2, int(n ** (1/2)) + 1):\r\n if n % i == 0:\r\n return True\r\n return False\r\n\r\n\r\ndef solve(n, k, arr):\r\n a = 0\r\n ans = 0\r\n for i in range(n):\r\n if 5 - arr[i] >= k:\r\n a += 1\r\n else:\r\n break\r\n\r\n if a == 3:\r\n ans += 1\r\n a = 0\r\n\r\n return ans\r\n\r\n\r\ndef main():\r\n n, k = in_map_int()\r\n arr = in_arr_int()\r\n print(solve(n, k, sorted(arr)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n# трамвай - 1\r\n# n = 39\r\n", "n,k=map(int,input().split())\narr=list(map(int,input().split()))\nc=0\nfor i in arr:\n if i+k <=5:\n c+=1\nprint(c//3)\n \t \t \t \t \t\t\t\t \t \t\t \t\t\t\t \t", "n, k = map(int, input().split())\nl = map(int, input().split())\n\nls = list(map(lambda x: x+k, l))\nlc = [c for c in ls if c <= 5]\nprint(len(lc)//3)", "n, k = map(int,input().split())\r\nyl = list(map(int,input().split()))\r\nstset = {i for i in range(n)}\r\ncounter = 0\r\nfor i in range(n):\r\n if 5 - yl[i] >= k and i in stset:\r\n for j in range(i+1,n):\r\n if 5 - yl[j] >= k and j in stset and i in stset:\r\n for p in range(j+1,n):\r\n if 5 - yl[p] >= k and p in stset and j in stset and i in stset:\r\n counter += 1\r\n stset.discard(i)\r\n stset.discard(j)\r\n stset.discard(p)\r\nprint(counter)", "n,k=list(map(int,input().split()))\nl=list(map(int,input().split()))\ncount=0\nfor i in l:\n if i + k <=5:\n count+=1\n\nres=int(count/3)\nprint(res)\n\t\t \t\t \t\t\t\t\t \t \t \t \t \t \t", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\ny.sort()\r\ncount = 0\r\nfor i in range(len(y)):\r\n if 5 - y[i] >= k:\r\n count += 1\r\nprint(count//3)", "podh=0\r\nn,k=map(int,input().split())\r\ny=list(map(int,input().split()))\r\n# n=6\r\n# k=5\r\n# y=[0,0,0,0,0,0]\r\nfor i in range(n):\r\n if y[i]+k<=5:\r\n podh+=1\r\nprint(podh//3)", "a = input().split()\r\nb = list(a)\r\nfor i in range(len(b)):\r\n b[i]=int(b[i])\r\nn = b[0]\r\nk = b[1]\r\nc = input().split()\r\nd = list(c)\r\nfor i in range(len(d)):\r\n d[i]=int(d[i])\r\n\r\nl =[]\r\nfor i in d:\r\n if i <=(5-k) :\r\n l.append(i)\r\nif len(l)>=3:\r\n print(len(l)//3)\r\nelse:\r\n print(0)\r\n", "n = list(map(int,input().split()))\r\nx = list(map(int,input().split()))\r\nx.sort()\r\nc = 0\r\nfor i in x:\r\n if (i + n[1]) <= 5:\r\n c+=1\r\n elif (i+n[1]) > 5:\r\n break\r\nprint(c//3)", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n if 5 - l[i] < k:\r\n count += 1\r\nprint((n - count)//3)", "a, b = map(int, input().split())\r\nc = 5 - b\r\nd = list(map(int, input().split()))\r\ni = 0\r\nfor x in d:\r\n if x <= c:\r\n i = i + 1\r\n\r\ne = int(i/3)\r\nprint(e)", "n,k = map(int,input().split())\r\n\r\ny = list(map(int,input().split()))\r\n\r\ncount = 0\r\nfor i in y:\r\n if i<=(5-k):\r\n count+=1\r\n\r\nprint(count//3)", "_, k = [int(x) for x in input().split()]\r\nlst = [int(x) for x in input().split()]\r\ncount = 0\r\nfor man in lst:\r\n if man+k <= 5:\r\n count += 1\r\n \r\nprint(count // 3)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\ns=0\r\nc=[]\r\nfor i in l:\r\n if i +k <= 5 :\r\n c.append(i)\r\n#print(c)\r\ns=len(c)//3 \r\nprint(s)\r\n \r\n", "n, k = [int(e) for e in input().split()]\r\ny = [int(e) for e in input().split()]\r\n\r\ny = sorted(y)\r\n\r\ncount = 0\r\nfor i in range(2, n, 3):\r\n if y[i] <= 5-k:\r\n count += 1\r\n else:\r\n break\r\n\r\nprint(count)\r\n", "n,k = [int(x) for x in input().split()]\r\nl = [int(x) for x in input().split()]\r\ns = 0\r\nfor x in l:\r\n if x +k <= 5: \r\n\r\n s+=1\r\nprint(s//3)", "n , k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nc=0\r\nwhile True :\r\n if len(a) >= 3 :\r\n flag=0\r\n b = a[:3]\r\n del(a[:3])\r\n for i in range(3):\r\n if b[i] + k > 5:\r\n flag+=1\r\n break\r\n if flag == 0 :\r\n c+=1\r\n else:\r\n break\r\n else:\r\n break\r\nprint(c)\r\n", "a, b = map(int, input().split(' '))\r\ns = list(map(int, input().split(' ')))\r\nq = []\r\nfor i in s:\r\n i = int(i)\r\n if i + b <= 5:\r\n q.append(i)\r\nprint(len(q) // 3)\r\n", "n, k = input().split(\" \")\nl = input().split(\" \")\nl = [int(elem) + int(k) for elem in l]\n\nresult = 0\nfor num in l:\n if num <= 5:\n result += 1\nprint(int(result / 3))\n", "n,k=map(int,input().split())\r\ny=sorted(list(map(int,input().split())),reverse=True)\r\nNbre=-1\r\nfor Yi in y:\r\n if Yi<=5-k:\r\n Nbre=Yi\r\n break\r\nNb=0\r\nfor Yi in y:\r\n if Yi<=Nbre:\r\n Nb+=1\r\nprint(Nb//3)", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nind = n\r\nfor i in range(n):\r\n if(l[i]+k>5):\r\n ind = i\r\n break\r\nprint(ind//3)", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr1=[j for j in arr if j<=5-k]\r\nprint(len(arr1)//3)\r\n", "n, k = map(int, input().split())\r\nt = 5 - k\r\nc = 0\r\nmas = list(map(int, input().split()))\r\nf = 0\r\nmas.sort(key=None, reverse=True)\r\nfor i in range(n):\r\n if mas[i] <= t:\r\n c += 1\r\nprint(c // 3)", "n,k = map(int,input().split())\na = list(map(int,input().split()))\na.sort()\nv = 0\nc = []\nfor i in a:\n i += k\n if i <= 5:\n v += 1\nprint(v // 3)\n", "[n, k] = list(map(int, input().split()))\r\nstudent_list = list(map(int, input().split())) \r\nn = 0\r\n\r\nfor i in student_list:\r\n if i <= (5 - k):\r\n n += 1\r\n\r\nprint(n // 3)", "n,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nthree_count=0\r\nfor char in lst:\r\n if char+k<=5:\r\n three_count+=1\r\nprint(three_count//3)", "x,ya=map(int,input().split())\nmass=list(map(int,input().split()))\nx=0\nfor i in mass:\n if i<=5-ya:\n x=x+1 \nprint(x//3)\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\nmembers = sorted(map(int, input().split()))\r\npeople = 0\r\n\r\nfor member in members:\r\n if 5 - member >= k:\r\n people += 1\r\n\r\nprint(int(people / 3))\r\n", "N, K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\npool = sum(+(x + K) <= 5 for x in A)\r\nprint(pool // 3)", "n,k=map(int,input().split())\r\ny=list(map(int,input().split()))\r\nc=0\r\nfor i in y:\r\n if i<=5-k:\r\n c+=1\r\nprint(c//3)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\na.sort()\r\ncnt = 0\r\nc = 0\r\nfor i in range(n):\r\n if 5 - a[i] >= k:\r\n c += 1 \r\n if c == 3:\r\n cnt += 1 \r\n c = 0\r\nprint(cnt)\r\n ", "a=input().split(\" \")\ncount=0\nb=input().split(\" \")\nfor i in b:\n if int(i) <= 5-int(a[1]):\n count+=1\nprint(count//3)\n\t\t \t\t\t\t \t\t \t \t \t\t\t", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in l:\r\n if (i+k)<=5:\r\n ans+=1\r\n \r\nprint(ans//3)", "n , k = map(int,input().split())\r\ny = list(map(int,input().split()))\r\ns = []\r\na = []\r\nfor i in y :\r\n if i < 5 :\r\n s.append(i)\r\nfor p in s :\r\n if 5-p >= k :\r\n a.append(p)\r\n\r\nprint(len(a)//3) \r\n\r\n", "n,k=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\nl1=[x for x in l if x<=5-k]\r\nprint(len(l1)//3)", "n,k = map(int,input().split())\r\ny = [int(x) for x in input().split()]\r\n\r\nteam = []\r\nfor i_th in y:\r\n if i_th + k <=5:\r\n team.append(i_th)\r\n\r\nprint(len(team)//3)", "a , b = map(int,input().split())\nl = list(map(int,input().split()))\nb = 5 - b\nc = 0\nfor i in l:\n if i<=b:\n c+= 1\nprint(c//3)\n \t \t\t \t\t\t \t \t \t\t \t \t \t", "info = list(map(int, input().split()))\r\npeople = sorted(list(map(int, input().split())))\r\n\r\nfor i in range(info[0]):\r\n people[i] += info[1]\r\n\r\npossible = 0\r\n\r\nfor i in people:\r\n if i <= 5:\r\n possible += 1\r\n\r\nprint(possible // 3)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\ncnt = 0\nfor i in range(n):\n if 5 - a[i] >= k:\n cnt += 1\nans = cnt // 3\nprint(ans)\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nkol=0\r\nfor i in range(len(a)):\r\n if (a[i]+k)<=5:\r\n kol+=1\r\nprint(kol//3)\r\n", "n, k = list(map(int, input().split()))\r\n\r\nratings = list(map(int, input().split())) \r\n\r\neligible_participants = 0 \r\n\r\nfor rating in ratings:\r\n \r\n if rating <= 5-k:\r\n eligible_participants += 1\r\n\r\n\r\nteams = eligible_participants // 3\r\n\r\nprint(teams)", "n,k=map(int,input().split())\r\nli=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if(5-li[i]>=k):count+=1\r\nprint(count//3)\r\n ", "number_of_students, minimum_participations = map(int, input().split())\r\nstudents = list(map(int, input().split()))\r\n\r\nplayers_count = 0\r\nfor student in students:\r\n if 5 - student >= minimum_participations:\r\n players_count += 1\r\n\r\nprint(players_count//3)", "def print_hi():\r\n n, k = map(int, input().split())\r\n y = list(map(int, input().split()))\r\n res=[]\r\n for num in y:\r\n r = 5 - num\r\n if r >= k:\r\n res.append(num)\r\n print(int(len(res)/3))\r\n\r\n\r\nif __name__ == '__main__':\r\n print_hi()\r\n\r\n\r\n", "import math\r\nimport itertools\r\nfrom collections import Counter\r\nfrom heapq import *\r\n\r\nlis = lambda: list(map(int, input().split()))\r\nmapnum = lambda: map(int, input().split())\r\nnum = lambda: int(input())\r\nstrlis = lambda: input().split()\r\n\r\n\r\nn,k = mapnum()\r\narr = lis()\r\narr.sort()\r\nfor i in range(n%3):\r\n arr.pop()\r\nteams = []\r\nfor i in range(0,len(arr),3):\r\n teams.append([arr[i],arr[i+1],arr[i+2]])\r\nc = 0\r\nfor i in teams:\r\n if i[2]+k <= 5:\r\n c += 1\r\nprint(c)\r\n\r\n ", "n, k = map(int, input().split())\r\npeople = list(map(int, input().split()))\r\n\r\npeople_new = [x for x in people if x <= (5 - k)]\r\n# print(people_new)\r\nprint(len(people_new) // 3)\r\n", "n,k = input().split()\r\nparticipate = input().split()\r\navailable = 0\r\nfor i in range(len(participate)):\r\n if int(participate[i]) + int(k) <= 5:\r\n available += 1\r\nprint(available // 3)", "k=int(input().split()[1])\r\nprint(sum(x<=5-k for x in map(int,input().split()))//3)", "a = list(map(int,input().split()))\r\nn,k = a[0],a[1]\r\nlst = list(map(int,input().split()))\r\nc=0\r\ns=0\r\nfor i in lst:\r\n if i+k<=5:\r\n s+=1\r\n if s==3:\r\n c+=1\r\n s=0\r\nprint(c)", "n, k = map(int, input().split())\r\nguys = list(map(int, input().split()))\r\nmin_c = 5 - k\r\ncount = 0\r\nfor i in range(len(guys)):\r\n if guys[i] <= min_c:\r\n count += 1\r\nprint(count // 3)", "# Choosing Teams\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\ncount = 0\r\nfor i in range(n):\r\n if a[i] + k <= 5:\r\n count += 1\r\n else:\r\n break\r\nprint(count // 3)", "a=input().split()\r\nn,k = int(a[0]),int(a[1])\r\nt = [int(a) for a in input().split() if 5-int(a)>=k]\r\nprint(int(len(t)/3))\r\n", "n,k = map(int,input().split())\r\ns = [int(x) for x in list(input().split())]\r\ns.sort()\r\ni = 0\r\nj = n-1\r\nans = 0\r\nwhile i<j:\r\n if s[j]<=5-k and i+2<=j:\r\n j-=1\r\n i+=2\r\n ans +=1\r\n else:\r\n j-=1\r\nprint(ans)", "n,k = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\nans=0\r\nfor i in lis:\r\n if 5 - i >= k:\r\n ans+=1\r\nprint(ans//3)", "n, k = list(map(int, input().split()))\r\n\r\nstd = list(map(int, input().split()))\r\n\r\nmaxN = 0\r\n\r\nans = 0\r\n\r\nfor i in std:\r\n if 5 - i >= k:\r\n maxN += 1\r\n\r\n if maxN == 3:\r\n ans += 1\r\n maxN = 0\r\n\r\nprint(ans)", "n,k=map(int,input().split())\r\nmembers = list(map(int,input().split()))\r\nfor i in members:\r\n if i>5-k:\r\n n-=1\r\nprint(n//3)", "n, k = map(int, input().split())\r\np = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if p[i] <= 5 - k:\r\n ans += 1\r\nprint(ans // 3)", "import math\r\ninput_everything = list(input().split(\" \"))\r\ninput_number = int(input_everything[0])\r\nno_of_times = int(input_everything[1])\r\nif_team = 0\r\nmember_team = list(input().split(\" \"))\r\nfor r in range(input_number):\r\n if int(member_team[r]) >= 5:\r\n None\r\n elif (int(member_team[r])+no_of_times) > 5:\r\n None\r\n else:\r\n if_team+= 1\r\nprint(math.floor(if_team/3))", "val=input().split()\r\nn=int(val[0])\r\nk=int(val[1])\r\n\r\nt=input().split()\r\nt=[int(x) for x in t]\r\n\r\nt.sort()\r\nl=0\r\nct=0\r\nwhile(l+2<n):\r\n if t[l+2]+k>5:\r\n break\r\n\r\n else:\r\n ct+=1\r\n l=l+3\r\n\r\nprint(ct)", "n,k=map(int,input().split(\" \"))\r\nL=list(map(int,input().split(\" \")))\r\ncount=0\r\ntemp=5-k\r\nfor i in L:\r\n if i<=temp:\r\n count=count+1\r\n else:\r\n continue\r\nprint(count//3)", "l1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nx,y=l1\r\ncount=0\r\nfor i in range(y):\r\n for j in range(len(l2)):\r\n l2[j]=l2[j]+1\r\nfor i in l2:\r\n if i<=5:\r\n count+=1\r\nprint(count//3) \r\n", "# CHAT GPT SOLUTION!!!!\n\nn, k = map(int, input().split())\na = sorted(map(int, input().split()), reverse=True)\n\ncnt_k = sum(1 for x in a if x <= 5 - k)\nans = cnt_k // 3\n\nprint(ans)\n", "n,k=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nlst=[]\r\nfor i in range(n):\r\n if 5-x[i]>=k:\r\n lst.append(x[i])\r\n else:\r\n continue\r\nprint(len(lst)//3)\r\n \r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nv=0\r\nfor i in range(n):\r\n if (l[i]+k)<=5 :\r\n v+=1\r\nprint(v//3)\r\n", "c = 0\r\nn, k = input().split()\r\nn, k = int(n), int(k)\r\nl = list(map(int, input().strip().split()))[:n]\r\nfor i in range(0, len(l)):\r\n if l[i] < 5:\r\n if 5-l[i] >= k:\r\n c += 1\r\n\r\nif c >= 3:\r\n print(c//3)\r\nelse:\r\n print(0)\r\n", "ad = input().split()\r\nn, k = ad[0], int(ad[1])\r\ncom = list(map(int, input().split()))\r\nNEW = []\r\nfor i in com:\r\n if (5 - i - k) > -1:\r\n NEW.append(i)\r\nprint(len(NEW) // 3)", "a=lambda:map(int,input().split())\r\n_,s=a()\r\nprint(sum( c<=5-s for c in a())//3)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm=[5-a for a in l]\r\ns=list(filter(lambda x: x >=k,m))\r\nprint(len(s)//3)", "_, k = map(int, input().split())\r\na = [int(i) + k for i in input().split() if int(i) + k <= 5]\r\nprint(len(a) // 3)\r\n", "students, times = map(int, input().split())\n\nparticipants = 0\nnumbers = list(map(int, input().split()))\nfor i in range(students):\n if numbers[i] + times > 5:\n continue\n else:\n participants += 1\n\nprint(participants // 3)\n\n \t \t\t\t \t \t \t\t \t \t\t\t\t\t \t", "n=list(map(int,input().split(\" \")))\r\nn2=list(map(int,input().split(\" \")))\r\ny=0\r\nfor x in n2:\r\n\tif x+int(n[1])<=5:\r\n\t\ty=y+1\r\nprint(y//3)", "n,k=map(int, input().split())\r\nj=0\r\nc=0\r\na=[int(x) for x in input().split()]\r\na.sort()\r\nfor i in range(n):\r\n if a[j]+k<=5:\r\n c+=1\r\n j+=1\r\n else:\r\n c+=0\r\nprint(c//3)", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\ns=[int(x) for x in input().split()]\r\np=5-k\r\ncount=0\r\nfor i in range(0,n):\r\n if s[i]<=p:\r\n count+=1\r\n else:\r\n continue\r\nprint(count//3)", "n = list(map(int, input().split()))\nn, j = n[0], n[1]\n\nmembers = list(map(int, input().split()))\n\nk = 0\nfor member in members:\n if 5-member-j >= 0:\n k += 1\n\nprint(k//3)", "n,k = map(int,input().split());print(len([*filter(lambda x: (5-x) >=k,map(int,input().split()))])//3)", "n,k=map(int,input().split())\r\ny=list(map(int,input().split()))\r\nc=0\r\nteam=0\r\nfor i in y:\r\n if i==5:\r\n continue\r\n elif i<=(5-k):\r\n team+=1\r\nprint(team//3)\r\n\r\n", "vvod = input().split(\" \")\r\nvvod2 = input().split(\" \")\r\n\r\nn = int(vvod[0])\r\nk = int(vvod[1])\r\nu = 0\r\n\r\nfor i in range(0, n):\r\n if int(vvod2[i]) + k <= 5:\r\n u = u + 1\r\n #u.append(int(vvod2[i]))\r\n\r\nprint(int(u/3))\r\n", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nres = 0\r\nfor x in a:\r\n if x + k <= 5:\r\n res += 1\r\nres //= 3\r\nprint(res)", "n=lambda:map(int,input().split())\r\n_,k=n()\r\nprint(sum(x<=5-k for x in n())//3)", "m,n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(len(l)):\r\n l[i]=l[i]+n\r\nfor i in range(len(l)):\r\n if l[i]<=5:\r\n c+=1\r\ns=c//3\r\nprint(s)", "n, k = map(int, input().split())\r\nparticipations = list(map(int, input().split()))\r\n\r\n# Count the number of students who have participated k times or more\r\ncount = sum(1 for p in participations if p + k <= 5)\r\n\r\n# Calculate the maximum number of teams that can be formed\r\nteams = count // 3\r\n\r\nprint(teams)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nfor i in range(n):\r\n if 5 - a[i] < k:\r\n a = a[:i]\r\n break\r\nprint(len(a) // 3)", "n, k = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\ncount = 0\r\nfor i in range(n):\r\n\tif A[i] + k <= 5:\r\n\t\tcount+=1\r\nprint(int(count/3))", "n, k = map(int, input().split())\r\nl = [int(x) for x in input().split()]\r\n\r\ncount = 0\r\n\r\nfor i in l:\r\n if i <= 5-k:\r\n count+=1\r\nprint(count//3)", "a, b = map(int, input().split())\r\nc = [j + b for j in list(map(int, input().split())) if j + b <= 5]\r\nprint(len(c)//3)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\ny = input().split()\r\n\r\nteamMembers = 0\r\nteamsNumber = 0\r\n\r\nfor i in range(n):\r\n y[i]=int(y[i])\r\nfor i in range(n):\r\n if y[i]+k <= 5:\r\n teamMembers += 1\r\n if teamMembers == 3:\r\n teamMembers = 0\r\n teamsNumber += 1\r\n\r\nprint(teamsNumber)\r\n", "abc,bca=map(int,input().split(' '))\r\nk=list(map(int,input().split(' ')))\r\ns=0\r\nfor chir in range(0,abc):\r\n if k[chir]<=5-bca:\r\n s+=1\r\ns0l=int(s//3)\r\nprint(s0l)", "n,k = map(int,input().split())\nl = list(map(int,input().split()))\nl1 = []\nfor i in range(len(l)):\n l[i] += k\n if(l[i] <= 5):\n l1.append(l[i])\nprint(len(l1)//3)\n\t \t \t \t\t\t\t\t\t\t\t \t \t \t \t\t\t", "inp=[int(i) for i in input().split()]\nn,k = inp[0], inp[1]\nst = sorted([int(i) for i in input().split()]); st.reverse()\n\ncount=0\nfor i in [0]*(n%3):\n del st[i]\nfor i in range(0,len(st),3):\n if max(st[i],st[i+1],st[i+2])<=5-k:\n count+=1\nprint(count)\n", "n,k=map(int,input().split(' '))\r\nl=list(map(int,input().split(' ')))\r\nl.sort()\r\nc=0\r\nfor x in l:\r\n if(x+k>5):\r\n break\r\n c+=1\r\nprint(c//3)", "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,k = getints()\r\nans = 0\r\nl = list(getints())\r\nfor x in l:\r\n if x <= 5-k: ans += 1\r\nprint(ans//3)", "def f():\r\n n,k=list(map(int,input().split(\" \")))\r\n arr=list(map(int,input().split(\" \")))\r\n for i in range(len(arr)):\r\n arr[i]=arr[i]+k\r\n \r\n count=0\r\n for i in arr:\r\n if i<=5:\r\n count=count+1\r\n return count//3\r\nprint(f())\r\n \r\n \r\n", "n = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nl = []\r\nfor i in t:\r\n if 5-i >= n[1]:\r\n l.append(i)\r\nprint(len(l)//3)", "def solve(n,k,par):\r\n par = sorted(par)\r\n teams = 0\r\n for i in range(0,n,3):\r\n if(i+1<n and i+2<n):\r\n pl1 = par[i]+k\r\n pl2 = par[i+1]+k\r\n pl3 = par[i+2]+k\r\n if(pl1<=5 and pl2<=5 and pl3<=5):\r\n teams+=1\r\n\r\n print (teams)\r\n\r\nif __name__ == \"__main__\":\r\n n,k = map(int,input().split(\" \"))\r\n par = map(int,input().split(\" \"))\r\n solve(n,k,par)", "x = [int(x) for x in input().split(' ')]\r\nn = x[0]\r\nk = x[1]\r\n\r\nx = [int(x) for x in input().split(' ')]\r\na = 0\r\n\r\nfor i in range(n):\r\n if x[i] <= 5-k:\r\n a += 1\r\n\r\nprint(a//3)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nb = []\nfor i in range(n):\n if a[i] + k <= 5:\n b.append(a[i])\n else:\n continue\nprint(len(b)//3)\n", "b,n=map(int,input().split())\r\nd=list(map(int,input().split()))\r\ns=0\r\nfor i in range(b):\r\n if d[i]<=5-n:\r\n s+=1\r\nprint(s//3)", "import sys\r\n\r\ninput = []\r\nfor line in sys.stdin:\r\n input.append(line)\r\n\r\nnAndK = input[0].strip().split()\r\nn = int(nAndK[0])\r\nk = int(nAndK[1])\r\nplayers = input[1].strip().split()\r\nfor i in range(0,n):\r\n players[i] = int(players[i])\r\n\r\nfor i in range(0,len(players)):\r\n players[i]+=k\r\n \r\ncount = 0\r\nfor i in range(0,len(players)):\r\n if players[i] <= 5:\r\n count+=1\r\nprint(count//3)", "nop , lt = list(map(int,input().split()))\r\ng_p= list(map(int,input().split()))\r\np=[]\r\nfor i in g_p:\r\n p.append(5-i)\r\na_p=[]\r\nfor i in p:\r\n if i>=lt:\r\n a_p.append(i)\r\nNoT=len(a_p)//3\r\nprint(NoT)", "n,k=map(int,input().split())\r\n\r\narr=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n arr[i]=5-arr[i]\r\n\r\narr.sort()\r\n\r\nstu=0\r\n\r\nfor i in range(n):\r\n if arr[i]>=k:\r\n stu+=1\r\n\r\nprint(stu//3)\r\n", "n, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\ncheck = 0\r\nfor a in lst:\r\n if 5 >= a + k:\r\n check += 1\r\n\r\nprint(check//3)\r\n", "k = int(input().split()[1])\r\nlst = [int(x) for x in input().split()]\r\ncount = 0\r\nfor item in lst:\r\n if item+k <= 5:\r\n count += 1\r\nprint(count//3)", "n, k = map(int, input().split())\r\n\r\nlist = []\r\ncount = 0\r\n\r\nlist += map(int,input().split())\r\n\r\nfor item in list:\r\n if 5-item >= k:\r\n count += 1\r\n \r\nprint(count//3)", "def main():\r\n num_list = input().split(\" \")\r\n temp_list = input().split(\" \")\r\n k = int(num_list[1])\r\n n = int(num_list[0])\r\n del num_list\r\n main_list = []\r\n # Make another list to convert all list elements to <int> type.\r\n for i in range(n):\r\n main_list.append(int(temp_list[i]))\r\n main_list.sort() # Sort it.\r\n del temp_list\r\n\r\n main_list[:] = [(i + k) for i in main_list]\r\n final_list = []\r\n for i in range(int(n)):\r\n if main_list[i] <= 5:\r\n final_list.append(main_list[i])\r\n del main_list\r\n result = len(final_list)//3\r\n print(result)\r\n del final_list\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "line = input()\r\nvezes, k = (int(n) for n in line.split())\r\nline = input()\r\nparticipantes = []\r\nfor n in line.split():\r\n n = int(n) # conversão de string p/ numero\r\n for _ in range(k): \r\n n+=1 #quero somar o valor em 1 k vezes\r\n if n <= 5:\r\n participantes.append(n)\r\nprint(len(participantes)//3)", "n,k=map(int,input().split()) #n:numofstudents, k:numoftimestoparticipate\r\ny=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n if y[i] <= 5-k:\r\n c+=1\r\nprint(c//3)\r\n \r\n ", "from math import floor\r\n\r\nn, k = [int(i1) for i1 in input().split()]\r\nstudents = [int(i2) for i2 in input().split()]\r\neligible_students = 0\r\nmax_rounds = 5-k\r\nfor i3 in students:\r\n if i3 <= max_rounds:\r\n eligible_students += 1\r\nprint(floor(eligible_students/3))", "n,k = map(int,input().split())\r\n\r\ncount=0\r\n\r\narr = list(map(int,input().split()))\r\n\r\nfor i in arr:\r\n if(i+k<=5):\r\n count+=1\r\nprint(count//3)", "o=input()\r\no=o.split()\r\nn=int(o[0])\r\nk=int(o[1])\r\na=input()\r\na=a.split()\r\nm=0\r\nfor i in range(n):\r\n if 5-int(a[i])-k>=0:\r\n m+=1\r\nprint(m//3)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 5 - k\r\nz = list(filter(lambda x: x <= s, a))\r\nprint(len(z) // 3)\r\n", "x,y=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nt=0\r\nl.sort()\r\nfor i in l:\r\n if i+y>5:\r\n break\r\n t=t+1\r\nprint(int(t/3))", "a,b=map(int,input().split())\r\nc=[int (i) for i in input().split()]\r\nk=[]\r\nfor v in range(len (c)) :\r\n if 5-c[v]>=b :\r\n k.append(c[v])\r\nprint(int (len(k)/3))", "n, k = map(int, input().split())\r\nparticipation_counts = list(map(int, input().split()))\r\n\r\nteamCount = 0\r\n\r\nfor count in participation_counts:\r\n if count <= 5 - k:\r\n teamCount += 1\r\n\r\nmaxTeams = teamCount // 3\r\nprint(maxTeams)", "n,k = [int(x) for x in input().split()]\r\ntimes = [int(y) for y in input().split() if (int(y)+int(k)) <6]\r\nprint(len(times)//3)", "a, b = map(int,input().split())\r\n\r\nc = [int(c) for c in input().split()]\r\nc.sort()\r\ncount = 0\r\nfor i in range(a):\r\n if c[i]+b<=5:\r\n count +=1\r\nprint(count//3)", "a,b=map(int,input().split())\r\nn=list(map(int, input().split()))\r\nfor i in range(a):\r\n n[i]+=b\r\nx=0\r\nfor i in n:\r\n if i<=5:\r\n x+=1\r\nprint(x//3)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(len([c for c in a if c + k <= 5]) // 3)\r\n", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nl = [i for i in s if i <= (5-k)]\r\nprint(len(l)//3)\r\n\r\n", "n,k=map(int,input().split())\r\ns=map(int,input().split())\r\nprint(int(sum([i+k<=5 for i in s])/3))\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncnt=0\r\nfor i in range (0,n):\r\n if 5-l[i]>=m:\r\n cnt+=1\r\nprint(cnt//3)", "n,k = map(int,input().split(\" \"))\r\nl =[int(k) for k in input().split(\" \")]\r\nres=0\r\ncnt=0\r\nfor i in l:\r\n if i+k <= 5:\r\n cnt +=1\r\n if(cnt ==3):\r\n cnt = 0\r\n res +=1 \r\nprint(res)", "n,k = map(int,input().split())\narr = [int(i) for i in input().split()]\ntemp = []\nfor i in range(n):\n if arr[i]+k <= 5:\n temp.append(arr[i])\nprint(len(temp)//3)\n \t\t\t \t\t \t\t \t\t \t\t\t\t \t\t", "a1 , b1 = map(int,input().split())\nlis = list(map(int,input().split()))\nlis.sort()\nb1= 5 - b1\nk = 0\nfor i in lis:\n if i<=b1:\n k += 1\nprint(k//3)\n \t\t\t\t\t \t \t\t \t \t\t \t", "n,k= map(int,input().split())\r\nl = list(map(int,input().split()))\r\nm = 0\r\nfor i in l:\r\n if i <= 5-k:\r\n m+=1\r\n \r\n \r\nprint(m//3)\r\n", "n,k=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\ncnt=0\r\nfor i in range(2,len(l),3):\r\n if 5-l[i]>=k:\r\n cnt+=1\r\n else:\r\n break\r\nprint(cnt) ", "s = input()\r\nn, k = int(s.split()[0]), int(s.split()[1])\r\nlst = input()\r\nlst_ = [int(i) for i in lst.split() if int(i) + k <= 5]\r\nprint(len(lst_)//3)", "n,a=map(int,input().split())\r\nm=list(map(int,input().split()))\r\nans=0\r\nfor i in range(6-a):\r\n ans+=m.count(i)\r\nans//=3\r\nprint(ans)", "# cook your dish here\nr1 , a1 = map(int,input().split())\nlis = list(map(int,input().split()))\nlis.sort()\na1= 5 - a1\nc = 0\nfor i in lis:\n if i<=a1:\n c += 1\nprint(c//3)\n \t \t \t \t\t\t\t\t \t \t\t\t \t\t \t", "n,k = map(int, input().split())\r\nl = [int(i) for i in input().split()]\r\nl2 = []\r\nfor x in l:\r\n if x + k <= 5:\r\n l2.append(x)\r\n else:\r\n continue\r\n\r\nif len(l2) >= 3:\r\n print(len(l2) // 3)\r\nelse:\r\n print(0)", "n,k=map(int,input().split())\r\nparticipation=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(0,n):\r\n play_time=5-participation[i]\r\n if play_time>=k:\r\n count+=1\r\n\r\nteam=count//3\r\nprint(team)\r\n\r\n\r\n", "n,k = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nlst = [5-i for i in lst]\r\ncnt = 0\r\nfor i in lst:\r\n if i>= k:\r\n cnt += 1\r\nprint(cnt//3)", "n, k = list(map(int, input().split()))\r\na = list(filter(lambda e: e + k <= 5, map(int, input().split())))\r\nprint(len(a) // 3)", "x = input().split()\r\nn, k = int(x[0]), int(x[1]) \r\ny = list(map(int, input().split()))\r\n\r\nlst = [i for i in y if int(i)+k <= 5]\r\n# print(lst)\r\nif len(lst) >= 3:\r\n print(len(lst) // 3)\r\nelse:\r\n print(\"0\")", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\narr = list(sorted(arr))\ncnt = 0\nfor i in range(0, len(arr) - len(arr) % 3, 3): \n if arr[0] + k <= 5 and arr[1] + k <= 5 and arr[2] + k <= 5:\n cnt += 1\n arr = arr[3:]\nprint(cnt)", "ips = [int(i) for i in input().split()]\r\nn, k = ips[0], ips[1]\r\n\r\nmembers = [(int(j) + k) for j in input().split()]\r\n\r\neligible = 0\r\nfor i in members:\r\n if i <= 5:\r\n eligible += 1\r\n\r\nprint(eligible // 3)", "n , k = map(int , input().split())\r\nlst = map(int , input().split())\r\ncnt =0\r\nres = 0\r\nfor i in lst :\r\n if i + k <= 5 :\r\n cnt +=1\r\n\r\n if cnt == 3 :\r\n res +=1\r\n cnt =0\r\nprint(res)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = 0\r\nwhile i < len(a):\r\n if a[i] > (5 - k):\r\n a.remove(a[i])\r\n else:\r\n i += 1\r\nprint(len(a) // 3)", "n,k=map(int,input().split())\r\nnumbers=list(map(int,input().split()))\r\nnumbers.sort()\r\nc=0\r\nfor i in range(n//3):\r\n if 5-numbers[3*i+2]>=k:\r\n c+=1\r\nprint(c)", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ns_m = []\r\nfor x in s:\r\n if x+k <= 5:\r\n s_m.append(x)\r\nprint(len(s_m)//3)", "n, k = [int(x) for x in input().split()]\r\npeoples = [int(x) for x in input().split()]\r\n# peoples.sort()\r\ncommand = list()\r\nfor men in peoples:\r\n if men + k <= 5:\r\n command.append(men)\r\nprint(len(command) // 3)\r\n", "n,k = map(int,input().split())\r\na = map(int,input().split())\r\n\r\nprint(\r\n sum(\r\n i<= 5-k for i in a\r\n ) // 3\r\n)", "n,k=(map(int,input().split()))\r\na=list(map(int,input().split()))\r\na.sort()\r\ncnt=0\r\nfor i in range(2,n,3):\r\n if(a[i]+k<=5):\r\n cnt+=1\r\nprint(cnt)", "n, k = [int(x) for x in input().split()]\r\nt = 0\r\nfor y in [int(x) for x in input().split()]:\r\n if y+k <= 5:\r\n t += 1\r\nprint(int(t/3))", "a,b=map(int,input().split())\ncount=0\nm=list(map(int,input().split()))\nfor i in range(a):\n m[i]=m[i]+b\nfor i in range(a):\n if m[i]<=5:\n count+=1\nf=count//3\nprint(f)\n\t\t \t \t \t \t \t \t\t \t", "n, k = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nh = []\r\nr = 0\r\n\r\n\r\nfor i in l:\r\n if 5 - i >= k:\r\n h.append(i)\r\n if len(h) == 3:\r\n r += 1\r\n h = []\r\n\r\nprint(r)\r\n", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\ns = []\r\nfor i in range(n):\r\n if y[i] <= 5 - k:\r\n s.append(y[i])\r\nif len(s) // 3 >= 1:\r\n print(len(s) // 3)\r\nelse:\r\n print(0)", "n=input().split(\" \")\r\nmn=int(n[1])\r\nn1=input().split(\" \")\r\nc=0\r\ntc=0\r\nfor k in n1:\r\n if int(k)+mn<=5:\r\n tc=tc+1\r\n if tc==3:\r\n c=c+1\r\n tc=0\r\nprint(c)\r\n\r\n\r\n", "n, k = map(int, input().split()) \r\nparticipation = list(map(int, input().split())) \r\nless_than_k = sum(1 for p in participation if p <= (5 - k))\r\nmax_teams = less_than_k // 3\r\nprint(max_teams)", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\ni=0\r\nans=0\r\nteam=0\r\nwhile i<n:\r\n if (5-a[i])>=k:\r\n team+=1 \r\n if team==3:\r\n ans+=1 \r\n team=0\r\n i+=1 \r\nprint(ans)\r\n ", "s = input().split()\r\nn = int(s[0])\r\nk = int(s[1])\r\nl = input().split()\r\nppl = 0\r\nfor person in l:\r\n if int(person) < 6 - k:\r\n ppl += 1\r\nprint(int(ppl/3))\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nbarr = [i + k for i in arr]\r\ncount = 0\r\nfor j in barr:\r\n if j < 6:\r\n count += 1\r\nprint(count // 3)", "n,k=map(int,input().split())\r\ny=list(map(int,input().split()))\r\nc=0\r\nfor x in y:\r\n\tif 5-x>=k:\r\n\t\tc+=1\r\nprint(c//3) ", "nk = [int(i) for i in input().split()]\r\ny = [(int(i)+nk[1]) for i in input().split()]\r\n\r\nprint(len([i for i in y if i<6])//3)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\nc = 0\r\n\r\nfor i in a:\r\n if 5-i >= k:\r\n c += 1\r\nprint(int(c/3))", "n_k=[]\ni=0\nn_k.append(input().split())\nli=[]\nli.append(input().split())\ncount=0\nfor i in range(0,int(n_k[0][0])):\n if int(li[0][i])<=(5-int(n_k[0][1])):\n count=count+1\nn_teams=int(count/3)\nprint(n_teams)\n\t\t\t \t \t \t\t\t\t\t \t \t \t\t\t \t\t \t", "n, k = map(int, input().split())\r\n\r\nli = list(map(int, input().split()))\r\ncount = 0\r\n\r\nfor i in li:\r\n if i + k <= 5:\r\n count += 1\r\n\r\nprint(int(count//3))\r\n", "# LUOGU_RID: 101568756\nn, k, *a = map(int, open(0).read().split())\r\nprint(sum(k + x <= 5 for x in a) // 3)", "n, k = [int(i) for i in input().split(' ')]\r\nseq = list([int(i) for i in input().split(' ')])\r\nseq.sort()\r\nl = []\r\nfor i in seq:\r\n if(i +k <= 5):\r\n l.append(i)\r\nif(len(l) >= 3):\r\n print(int(len(l)/3))\r\nelse:\r\n print('0')", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort() \r\nteams = 0 \r\ni = 0 \r\nwhile i < n-2:\r\n if a[i] + k <= 5 and a[i+1] + k <= 5 and a[i+2] + k <= 5:\r\n teams += 1 \r\n i += 3 \r\n else:\r\n i += 1 \r\nprint(teams) ", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = 0\r\nfor _ in range(n):\r\n if 5 - a[_] >= k:\r\n c += 1\r\nprint(c // 3)", "m,n=map(int,input().split())\nl=list(map(int,input().split()))\nk=[][:m]\nfor i in l:\n if (i+n)<=5:\n k.append(i)\nprint(len(k)//3)\n \t\t\t\t\t\t \t\t\t \t\t\t\t \t\t\t \t \t\t\t", "n,k=map(int,input().split())\r\ny=list(map(int,input().split()))\r\ncount=0\r\nfor i in y:\r\n if i+k <=5:\r\n count+=1\r\n\r\nprint(int(count/3))\r\n\r\n", "import math\r\n\r\nnum1 = list(map(int, input().split()))\r\nn, k = num1\r\nstudents = list(map(int, input().split()))\r\ncount = 0\r\nfor i in students:\r\n if i <= (5 - k):\r\n count += 1\r\nprint(math.floor(count / 3))", "a, b = map(int, input().split())\r\nentered_list = input().split()\r\nnum_list = [int(i) for i in entered_list]\r\ncount = 0\r\nfor i in range(a):\r\n if num_list[i] + b <= 5:\r\n count += 1\r\nitog = count // 3\r\nprint(itog)\r\n\r\n", "n, k = map(int, input().split())\r\n\r\nl = list(map(int, input().split()))\r\n\r\nnl = [i + k for i in l]\r\n\r\nnl.sort()\r\n\r\nt = [i for i in nl if i<=5]\r\n\r\nprint(len(t)//3)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\nx = list(map(int, input().split()))\r\n\r\nc = 0\r\nfor i in x:\r\n if(5 - k >= i):\r\n c += 1\r\nprint(c//3)\r\n", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\n\r\nu = [x for x in y if x + k <= 5]\r\n\r\nif len(u) < 3:\r\n print(0)\r\nelif len(u) == 3:\r\n print(1)\r\nelse:\r\n print(len(u)//3)", "n, k = map(int, input().split())\r\ncount_participations = list(map(int, input().split()))\r\n\r\nteam = 0\r\n\r\nfor count_participation in count_participations:\r\n if count_participation + k <= 5:\r\n team += 1\r\n\r\nprint(team // 3)\r\n", "n,k=map(int,input().split())\nls=list(map(int,input().split()))\nprint(len([i for i in ls if i+k<=5 ])//3)\n\t\t \t\t\t \t\t\t \t\t \t\t \t\t \t \t\t\t\t \t", "firstLine = [int(i) for i in input().split()]\r\n\r\nn, k = tuple(firstLine)\r\n\r\nplayers = [(5-int(i)) for i in input().split()]\r\n\r\n\r\navalible = 0\r\nfor p in players:\r\n if p >=k:\r\n avalible+=1\r\nprint(avalible//3)\r\n ", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in l:\r\n if i+b <=5:count+=1\r\nprint(count//3)", "a=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nd=0\r\nfor j in b:\r\n if 5-j>=a[1]:\r\n d+=1\r\nif d==0:\r\n print(0)\r\nelse:\r\n print(d//3)", "n,k=tuple(map(int,input().split()))\r\nlis=list(map(int,input().split()))\r\nl=[]\r\nfor i in lis:\r\n if 5-k>=i:\r\n l.append(i)\r\nprint(len(l)//3)", "a,b=map(int,input().split())\r\nc=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if(i+b<=5):\r\n c+=1\r\nprint(c//3)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\n\r\ni = 0\r\n\r\nwhile (i < len(a)):\r\n if (a[i] + k <= 5):\r\n count += 1\r\n \r\n i += 1\r\n \r\nprint(count // 3)\r\n", "a,b=map(int,input().split())\nlm=list(map(int,input().split()))\nlm.sort()\nb=5-b\ncount=0\nfor i in lm:\n if i<=b:\n count+=1\nprint(count//3)\n\n \t\t \t\t\t\t \t \t\t\t \t\t \t \t \t\t\t", "n, k = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\n\r\nc = 0\r\nfor i in range(n):\r\n l[i] += k\r\n if l[i] <= 5:\r\n c += 1\r\n\r\nprint(c // 3)", "#a = int(input())\r\nn, k = map(int, input().split())\r\n#n, a, b, c = map(int, input().split())\r\nl1 = list(map(int, input().split()))\r\ndef func(p):\r\n if p + k <= 5:\r\n l2.append(p)\r\n else:\r\n pass\r\nl2 = []\r\nlist(map(func,l1))\r\nprint(len(l2)//3)", "a,b = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nsum = 0\r\nfor i in c:\r\n if i+b <= 5:\r\n sum+=1\r\nprint(sum//3)\r\n", "n, k = map(int, input().split())\r\ns = map(int, input().split())\r\ni = 0\r\nfor j in s:\r\n if 5-j>=k:\r\n i+=1\r\nprint(i//3)", "n, k = map(int, input().split())\r\nparticipations = list(map(int, input().split()))\r\n\r\ncount_teams = 0\r\nfor participation in participations:\r\n if 5 - participation >= k:\r\n count_teams += 1\r\n\r\nresult = count_teams // 3\r\n\r\nprint(result)\r\n", "import math\r\n\r\n\r\n\r\nn, k = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\nce = 0\r\nfor yi in y:\r\n if(yi+k <= 5):\r\n ce += 1\r\n n -= 1\r\n \r\nprint(math.trunc(ce/3))", "n, k = map(int, input().split())\n\ny = [int(i) for i in input().split()]\nz = [ele for ele in y if ele + k <= 5]\nprint(len(z) // 3)\n \t \t \t \t\t\t \t\t\t \t \t \t", "n,k=map(int,input().split())\r\ny=list(map(int,input().split()))\r\ny.sort()\r\nc=0\r\ni=0\r\nif n%3==2:\r\n n-=2\r\nelif n%3==1:\r\n n-=1\r\nwhile i<=n-1:\r\n p=5-max(y[i],y[i+1],y[i+2])\r\n if p>=k:\r\n c+=1\r\n i+=3\r\nprint(c)\r\n\r\n ", "n, k = map(int, input().split())\r\nkk = list(map(int, input().split()))\r\nkk.sort()\r\n\r\nt = 0\r\nfor i in range(2, n, 3):\r\n if 5 - kk[i] >= k:\r\n t += 1\r\n\r\nprint(t)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in a:\r\n if i <= 5 - k:\r\n cnt += 1\r\nprint(cnt // 3)\r\n", "n,k=map(int,input().split())\r\nx=list(map(int,input().split()))\r\ny=[]\r\nfor i in x:\r\n y.append(i+k) #모든 학생들이 앞으로 k번 더 참가했을때의 횟수를 y에 저장\r\n\r\ncnt=0\r\nfor j in y:\r\n if j<=5: #y리스트 안에서도 참가횟수가 5회 이하인 학생들만 카운트\r\n cnt=cnt+1\r\n\r\n \r\nif cnt<3: #참가가능한 학생수가 3명보다 적으면 0을 출력\r\n print(0)\r\nelse: #참가 가능한 학생수를 3으로 나눈 몫을 출력(3인1팀이기때문에)\r\n print(cnt//3)\r\n", "n,k=map(int,input().split())\r\nc=0\r\nelem=[int(i) for i in input().split()][:n]\r\nfor i in range(n):\r\n if(elem[i]+k<=5):\r\n c=c+1\r\nprint(c//3)\r\n \r\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nn, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nuc = 0\r\nfor i in range(n):\r\n ans = 5 - l[i]\r\n if ans >= k:\r\n uc += 1\r\nprint(uc//3)", "def max_teams(n, k, participation_counts):\r\n eligible_students = sum(1 for count in participation_counts if count + k <= 5)\r\n return eligible_students // 3\r\n\r\nn, k = map(int, input().split())\r\nparticipation_counts = list(map(int, input().split()))\r\n\r\nresult = max_teams(n, k, participation_counts)\r\nprint(result)\r\n", "n,k = map(int,input().split())\ncount = 0\na = list(map(int,input().split()))\nfor i in range(len(a)):\n if 5-a[i]>=k:\n count += 1\nprint(count//3)\n \t \t\t \t\t\t\t\t\t\t\t \t \t \t\t\t", "n,k = map(int, input().split());a= map(int, input().split())\r\nprint(sum(1 for i in a if i + k <= 5) // 3)", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\n\r\n# count the number of participants who can participate in the world championship at least k times\r\nnum_eligible = sum(1 for i in y if 5 - i >= k)\r\n\r\n# calculate the maximum number of teams that can be formed with eligible participants\r\nnum_teams = num_eligible // 3\r\n\r\nprint(num_teams)", "n , k = map(int, input().split())\r\ny = [int(i) for i in input().split()]\r\ncounter = 0\r\nfor i in range(n):\r\n if y[i]+k <= 5:\r\n counter+=1\r\nprint(counter//3)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nfor i in range(len(l)):\r\n l[i]+=k\r\nfor i in l[::-1]:\r\n if i>5:\r\n l.remove(i)\r\nprint(len(l)//3)\r\n", "n,k= map(int,input().split())\r\nx =list(map(int,input().split()))\r\nc=0\r\nfor i in x:\r\n if i+k<=5:\r\n c+=1\r\nprint(c//3)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))[:n]\r\ncount=0\r\nfor i in range(n):\r\n l[i]=l[i]+k\r\nfor i in l:\r\n if(i<=5):\r\n count+=1\r\nprint(count//3)", "n,k=map(int,input().split())\r\nc=0\r\nli=list(map(int,input().split()))\r\nfor i in range(n):\r\n if li[i]<=(5-k):\r\n c=c+1\r\nprint(c//3)", "\r\nn, k = input().split(' ')\r\nn, k = int(n), int(k)\r\nline = [int(x) for x in input().split(' ')]\r\n\r\nline = sorted(line)\r\n\r\n\r\ndef fit(group, k):\r\n for person in group:\r\n if person+k>5:\r\n return False\r\n return True\r\ngroups=0\r\n\r\nfor i in range(0, len(line), 3):\r\n group = line[i:i+3]\r\n if len(group)<3:\r\n break\r\n if fit(group, k)==True:\r\n groups+=1\r\n else:\r\n break\r\n\r\nprint(groups)\r\n", "n, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nhlp = []\r\nfor i in lst:\r\n if i <= 5 - k:\r\n hlp.append(i)\r\nprint(len(hlp) // 3)", "NandK = input(\"\").split(\" \")\r\nnumberOfStudents = int(NandK[0])\r\nleastNumberOfParticipation = int(NandK[1])\r\nnumberOftimesParticipated = input(\"\").split(\" \")\r\nnumberOftimesParticipated = list(map(int, numberOftimesParticipated))\r\nif numberOfStudents >= 1 and numberOfStudents <= 2000 and leastNumberOfParticipation >= 1 and leastNumberOfParticipation <= 5:\r\n times = 0\r\n for i in range(numberOfStudents):\r\n if (5 - numberOftimesParticipated[i]) >= leastNumberOfParticipation:\r\n times += 1\r\n print(int(times / 3))", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\n\r\nprint(len([1 for t in y if abs(t - 5) >= k])//3)\r\n", "n,k=map(int,input().split())\na=list(map(int,input().split()))\nc=0\nfor i in a:\n\tif i+k<=5:\n\t\tc+=1\nprint(c//3)\n\t \t\t \t\t \t \t \t \t\t\t\t\t", "from sys import stdin\r\nn,k=map(int,stdin.readline().split())\r\nc=0\r\nfor i in list(map(int,stdin.readline().split())):\r\n c+=1 if i+k<=5 else 0\r\nprint(c//3)\r\n", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nc = 0\r\nfor i in arr:\r\n if i + k <= 5:\r\n c+=1\r\nprint(c//3)", "from collections import Counter\r\nI = lambda : list(map(int,input().split()))\r\nn,k = I()\r\nm = I()\r\nz = Counter(m)\r\nif k==5:print(z[0]//3)\r\nelif k==4:print((z[0]+z[1])//3)\r\nelif k==3:print((z[0]+z[1]+z[2])//3)\r\nelif k==2:print((z[0]+z[1]+z[2]+z[3])//3)\r\nelif k==1:print((z[0]+z[1]+z[2]+z[3]+z[4])//3)", "n, k = map(int, input().split())\r\ns = sorted(map(int, input().split()))\r\na = 0\r\n\r\nfor i in s:\r\n if 5-i >= k:\r\n a += 1\r\n\r\nprint(a//3)", "# Read the values of n and k\r\nn, k = map(int, input().split())\r\n\r\n# Read the list of participation counts\r\nparticipation_counts = list(map(int, input().split()))\r\n\r\n# Initialize the count of eligible team members\r\neligible_team_members = 0\r\n\r\n# Iterate through the participation counts\r\nfor count in participation_counts:\r\n # Check if the person can participate k more times\r\n if 5 - count >= k:\r\n eligible_team_members += 1\r\n\r\n# Calculate the maximum number of teams that can be formed\r\nmax_teams = eligible_team_members // 3\r\n\r\n# Print the result\r\nprint(max_teams)\r\n", "n, k = list(map(int, input().split()))\r\ny = list(map(int, input().split()))\r\ny.sort()\r\n# print(y)\r\ntimes = n//3\r\ncount = 0\r\n# print(times)\r\nfor i in range(times):\r\n maxpart = max(y[3*i:3*(i+1)])\r\n if 5-maxpart >= k:\r\n count += 1\r\n # print(count)\r\nprint(count)", "a,b=map(int,input().split())\r\ns=0\r\nn=[int(i)for i in input().split()]\r\nfor i in n:\r\n if i+b<=5:\r\n s+=1\r\nprint(s//3)", "# ICPC teams\nn, k = list(map(int, input().split()))\na = list(map(int, input().split()))\n\ncount = 0\nfor i in range(n):\n if 5-a[i] >= k:\n count += 1\n\n\nans = count // 3\nprint(ans)\n \t \t\t\t \t \t\t \t\t\t \t\t\t\t\t \t", "x , y = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nls = []\r\nfor i in l:\r\n if y+i<=5:\r\n ls.append(i)\r\nprint(len(ls)//3)", "n,k=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nres = [x + k for x in li]\r\nans=0\r\nfor i in res:\r\n if(i<=5):\r\n ans+=1\r\n\r\nprint(ans//3)", "i=input().split(' ')\r\nn=int(i[0])\r\nk=int(i[1])\r\np=list(map(int,input().split(' ')))\r\nc=0\r\nfor i in p:\r\n if i+k<=5:\r\n c+=1\r\nprint(c//3)", "a,b=list(map(int,input().split()))\r\nc=0\r\nr=5-b\r\nn=list(map(int,input().split()))\r\nfor i in n:\r\n if r>=i:\r\n c+=1\r\nprint(c//3)", "from math import floor\na,b = map(int,input().split())\nx = list(map(int,input().split()))\nma = 5-b\np = 0\nfor i in x:\n if i <= ma:\n p+=1\nprint(floor(p/3))", "n,k = map(int, input().split())\r\npart = list(map(int, input().split()))\r\neligible_count = 0\r\nfor count in part:\r\n if count + k <= 5:\r\n eligible_count += 1\r\nmax_teams = eligible_count // 3\r\nprint(max_teams)", "def icpc(lst,k):\r\n #lst has the number of times each student already participated and k is the number of times coach wants next attempts\r\n alist=[]\r\n blist=[]\r\n for f in lst:\r\n if f<5:\r\n alist.append(f)\r\n for t in alist:\r\n if t+k<=5:\r\n blist.append(t)\r\n return len(blist)//3\r\ny=input()\r\nalist=[int(x) for x in y.split()]\r\nf=input()\r\nblist=[int(d) for d in f.split()]\r\nprint(icpc(blist,alist[1]))", "if __name__ == '__main__':\r\n x = input().split()\r\n n = int(x[0])\r\n k = int(x[1])\r\n x = input().split()\r\n li = [int(i) for i in x]\r\n for i in li:\r\n if i > 5 - k:\r\n n -= 1\r\n print(n//3) ", "n, k=[int(x) for x in input().split()]\r\ny=[int(x) for x in input().split()]\r\neligible=0\r\nfor student in y:\r\n if 5-student >= k:\r\n eligible += 1\r\nprint(eligible//3)", "n, k = map(int, input().split())\r\n\r\npart = list(map(int, input().split()))\r\n\r\nelst = sum(1 for p in part if p + k <= 5)\r\n\r\nmt = elst // 3\r\n\r\nprint(mt)\r\n", "x,y=map(int,input().split())\nm=list(map(int,input().split()))\nx=0\nfor i in m:\n if i<=5-y:\n x=x+1 \nprint(x//3)\n \n\t\t\t \t \t \t\t \t\t \t \t\t \t\t\t\t\t\t", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nr = []\r\nfor i in range(len(s)):\r\n if s[i] + k < 6:\r\n r.append(s[i])\r\n\r\nprint(len(r) // 3)\r\n", "n, k = map(int, input().split())\r\ny = list(map(lambda x: k + int(x), input().split()))\r\n\r\ncounter = 0\r\nfor i in y:\r\n if i <= 5:\r\n counter += 1\r\n\r\nprint(int(counter / 3))", "inp = list(map(int,(input().split())))\r\nlst = list(map(int, input().split()))\r\nc=0\r\nfor i in range(len(lst)):\r\n if lst[i]+inp[1] <= 5:\r\n c+=1\r\nprint(c//3)", "p,q=map(int,input().split())\narray=list(map(int,input().split()))\nr = 0\nfor i in array:\n if i+q <=5:\n r+=1\nprint(r//3)\n \t\t \t\t\t\t\t\t \t\t \t \t \t \t\t\t \t \t\t", "z = []\r\nz[0:] = map(int,input().split())\r\nw = []\r\nw[0:] = map(int,input().split())\r\nnum = []\r\ntimes = z[1]\r\nfor i in range(z[0]):\r\n if (w[i] <= 5-times):\r\n num.append(w[i])\r\n\r\nprint(len(num)//3)", "n,k=map(int,input().split())\r\ny=list(map(int,input().split()))\r\ny.sort()\r\ncount=0\r\nfor i in range(len(y)):\r\n if 5-y[i]>=k:\r\n count+=1\r\nprint(count//3)", "n,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nc=0\r\nd=5-k\r\nfor i in range(n):\r\n if(lst[i]<=d):\r\n c+=1\r\nprint(c//3)", "n,k = map(int,input().split())\r\nx = list(map(lambda q:int(q), input().split(\" \")))\r\nx.sort()\r\nc=0\r\nfor i in range (2,n,3):\r\n if x[i]+k<=5:\r\n c=c+1\r\nprint(min(n//3,c))", "n,k=map(int,input().split())\r\nm=list(map(int,input().split()))\r\nans=0\r\nfor i in range(6-k):\r\n ans+=m.count(i)\r\nans//=3\r\nprint(ans)", "n,k = (int(x) for x in input().split())\r\n\r\nL = [int(x) for x in input().split()]\r\n\r\ncount = 0\r\n\r\nfor i in range (0,n):\r\n if L[i]<=5-k:\r\n count+=1\r\n\r\n\r\nprint(count//3)", "n, k = map(int, input().split())\ny = list(map(int, input().split()))\ny.sort()\ntotal = 0\nfor i in range(2, n, 3):\n if y[i] + k <= 5:\n total += 1\n\nprint(total)\n", "n, k = [int(p) for p in input().split()]\r\nlmao = 5-k\r\ncount = 0\r\na = [int(p) for p in input().split()]\r\nfor i in range (n):\r\n if a[i] <= lmao:\r\n count += 1\r\nprint(count // 3)", "a,b = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\ncount=0\r\nc = 5 - b\r\nfor i in lst:\r\n if i <= c:\r\n count += 1\r\nprint(count//3)\r\n\r\n", "n,k = map(int,input().split())\r\narr = sorted(list(map(int,input().split())))\r\ncount = 0\r\n# print(arr)\r\nfor i in range(0,n,3):\r\n if i+2 < n and arr[i+2] + k <= 5:\r\n count += 1\r\nprint(count)", "n, k = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nli.sort()\r\ncount = 0\r\nfor i in li:\r\n if i + k > 5:\r\n break\r\n else:\r\n count += 1\r\nprint(count//3)", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\na = [i for i in a if i+k <= 5]\r\nprint((len(a))//3)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nlst = input().split()\r\nmember = 0\r\nteam = 0\r\nfor i in range(0,len(lst)):\r\n lst[i] = int(lst[i])\r\n if (5-lst[i])>=k:\r\n member = member + 1\r\n if member%3==0:\r\n team += 1\r\nprint(team)\r\n", "a,b=map(int,input().split())\r\n*c,=map(int,input().split())\r\nk=0\r\nfor i in sorted(c):\r\n if i+b<=5:\r\n k+=1\r\n else:\r\n break\r\nprint(k//3)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nkol=0\r\nfor x in a:\r\n if x+k<=5:\r\n kol+=1\r\nprint(kol//3) ", "n , k = [int(x) for x in input().split(\" \")]\r\nlevels = sorted([int(x) for x in input().split(\" \")])\r\nimportLevels = [True for x in range(2 , n , 3) if 5 - levels[x] >= k]\r\nprint(len(importLevels))", "g,p=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr=sorted(arr)\r\nt=0\r\nfor z in range(0,g,3):\r\n if(z+1<g and z+2<g):\r\n sol1=arr[z]+p\r\n sol2=arr[z+1]+p\r\n sol3=arr[z+2]+p\r\n if(sol1<=5 and sol2<=5 and sol3<=5):\r\n t+=1\r\nprint(t)", "n,k=map(int,input().split())\r\ny=list(map(int,input().split()))\r\ny.sort()\r\nl=[]\r\nfor i in range(len(y)):\r\n if(y[i]+k<=5):\r\n l.append(y[i])\r\nprint(len(l)//3)", "n,k = list(map(int, input().split(' ')))\r\nnums = list(map(int, input().split(' ')))\r\nans = []\r\nfor ind, ele in enumerate(nums):\r\n if ele <= 5-k:\r\n ans.append(ele)\r\n \r\nprint(len(ans)//3)\r\n ", "n, k = map(int, input().split())\r\ny = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in range(len(y)):\r\n i -= c\r\n if y[i] + k > 5:\r\n del y[i]\r\n c += 1\r\nprint(len(y) // 3)", "n,k=map(int, input().strip().split())\r\ncount=0\r\ny=list(map(int, input().strip().split()))\r\nfor i in range(0,n):\r\n if y[i]+k<=5:\r\n count+=1\r\n else:\r\n continue\r\nprint(count//3)", "n, k = map(int, input().split())\r\ntime_participated = list(map(int, input().split()))\r\n\r\nans = []\r\nfor i in time_participated:\r\n if i + k <= 5:\r\n ans.append(i)\r\n\r\nprint(len(ans) // 3)", "n, k = [int(x) for x in input().split(\" \")]\r\nlis = [int(y) for y in input().split(\" \")]\r\nlis2 = []\r\n\r\nfor i in lis:\r\n if (i+k) <= 5:\r\n lis2.append(i)\r\n\r\n\r\nif len(lis2) >= 3:\r\n print(int(len(lis2) // 3))\r\nelse:\r\n print(0)\r\n", "# A. Choosing Teams \r\nparam = [int(x) for x in input().split(' ')]\r\nn = param[0]\r\nk = param[1]\r\nlista = [int(x) for x in input().split(' ')]\r\n\r\nfor i in range(1):\r\n for j in range(len(lista)):\r\n lista[j] += k\r\n if lista[j] > 5:\r\n lista[j] = -1\r\nresposta = int((len(lista) - lista.count(-1))/3)\r\nprint(resposta)\r\n", "# https://codeforces.com/problemset/problem/432/A\r\n\r\nn, k = map(int, input().split())\r\nstudents_participation_count = list(map(int, input().split()))\r\n\r\ntotal_eligible = 0\r\n\r\nfor c in students_participation_count:\r\n if 5 - c >= k:\r\n total_eligible += 1\r\n\r\nresult = total_eligible // 3\r\nprint(result)\r\n", "input1 = input().split()\nn=int(input1[0])\nk=int(input1[1])\ninput2=input().split()\ncount=0\nfor i in range (n):\n if int(input2[i])<=(5-k):\n count +=1\n\nteams=count//3\nprint(teams)\n\t\t \t\t\t\t\t \t\t\t\t\t\t\t \t \t\t\t\t\t\t\t \t", "n, k = map(int, input().split())\r\n\r\nstudent = list(map(int, input().split()))\r\n\r\nwhile ( 5 in student) : # 5번 참여한 학생은 모두 제외하기\r\n student.remove(5)\r\n\r\nstudent = list(map(lambda x : x+k, student)) # 학생이 k번 참가한다고 했을 때 총 참가 횟수\r\n\r\n'''\r\nfor n in range(len(student)): # 총 참가횟수가 5번을 넘어가는 학생은 모두 제외\r\n if n > 5: # 5까지는 괜찮음\r\n student.remove()\r\n삭제는 인덱스 고려사항이 있어서 안하는 걸로\r\n'''\r\navailable = []\r\nfor n in student:\r\n if n <= 5:\r\n available.append(n)\r\n\r\n# 가능한 팀 개수\r\nmax_num_of_teams = len(available) // 3\r\nprint(max_num_of_teams)\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\na=0\r\ny=list(map(int,input().split()))\r\nk=5-k\r\nfor i in y:\r\n if i<=k:a+=1\r\nprint(int(a/3))", "n, k = map(int, input().split())\r\np = [int(i) + k for i in input().split() if (int(i) + k) <= 5]\r\nprint(len(p) // 3)", "n,k = map(int,input().split())\r\na = input().split()\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\na.sort()\r\nsumm = 0\r\nfor i in range(n):\r\n if a[i]+k<=5:\r\n summ+= 1\r\nprint(summ//3)\r\n", "a,b=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nc=0\r\nfor i in range(a):\r\n if arr[i]+b<=5:\r\n c+=1\r\nprint(c//3)", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in l:\r\n if 5-i>=b:\r\n c+=1\r\nprint(c//3)", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n if((l[i]+k)<=5):\r\n count = count + 1 \r\n\r\nprint(count//3) ", "n,k=map(int,input().split())\r\nli1=list(map(int,input().split()))\r\nli1.sort()\r\ni=0\r\nli2=[]\r\nwhile i<len(li1):\r\n li2.append(li1[i]+k)\r\n if li2[i]>5:\r\n li2.pop(i)\r\n break\r\n i+=1\r\ncnt=len(li2)\r\nresult=cnt//3\r\nprint(result)", "n, k = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\navl = 0\r\nk = 5 - k\r\n\r\nfor i in arr:\r\n if i <= k:\r\n avl += 1\r\n\r\nprint(int(avl / 3))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nfor i in range(len(a) - 1, -1, -1):\r\n if a[i] <= 5 - k:\r\n print((i + 1) // 3)\r\n exit()\r\nprint(0)\r\n ", "n,k = map(int,input().split())\r\nvalid = 0\r\na = [int(i) for i in input().split()]\r\nfor i in a:\r\n if i+k <=5:\r\n valid+=1\r\n\r\nprint(valid//3)\r\n", "n,k=map(int,input().split())\r\nprint(sorted([*map(int,input().split())]+[6-k]).index(6-k)//3)", "n, k = list(map(int, input().split()))\r\n\r\nstudents = list(map(int, input().split()))\r\n\r\nfiltered = [i for i in students if 5-i >= k]\r\n\r\nprint(len(filtered) // 3)", "n, k = map(int, input().split())\r\narr = [int(i) for i in input().split() if int(i) + k <= 5]\r\n\r\nprint(len(arr) // 3)", "n,k = (map(int,input().split()))\r\narr = list(map(int,input().split()))\r\n\r\ncount=0\r\nfor i in range(n) :\r\n if arr[i]+k<=5 :\r\n count+=1\r\nprint(count//3)", "\nn,k = [int(x) for x in input().split()]\narr = [int(x) for x in input().split()]\ncnt= 0\nfor i in range(n):\n if arr[i]<=5-k:\n cnt+=1\nprint(cnt//3)\n", "[n, k] = list(map(int, input().split()))\nnum = list(map(int, input().split()))\ncount = 0 \nfor i in num:\n if i + k <= 5:\n count += 1\nprint(count// 3)\n\t\t \t\t\t\t\t \t\t \t \t\t \t\t \t \t\t\t", "a,b=map(int,input().split())\nc=list(map(int,input().split()))\nd=0\nfor i in c:\n if i<=5-b:\n d=d+1 \nprint(d//3)\n\n\t \t\t\t \t\t \t\t \t \t\t\t \t", "def int_list_input():\r\n return(list(map(int,input().split())))\r\nn,k = int_list_input()\r\ny = int_list_input()\r\n\r\nres=0\r\nfor i in y:\r\n if 5-i>=k: res+=1\r\nprint(int(res/3))", "n,k=[int(s) for s in input().split()]\r\na=[int(s) for s in input().split()]\r\nb=[]\r\nfor i in range(n):\r\n if a[i]<=(5-k):\r\n b.append(a[i])\r\nprint(len(b)//3)\r\n \r\n", "n,k = map(int, input().split())\r\ns = [int(_) for _ in input().split()]\r\nss = list(filter(lambda x: x <= 5 and x <= 5-k , s))\r\nprint(len(ss)//3)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nall = input().split()\r\nall = [int(x) for x in all]\r\ncount = 0\r\nfor i in all:\r\n if i+k <= 5:\r\n count+=1 \r\nprint(count//3)", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nc=0\r\nfor i in arr:\r\n if i+k <=5:\r\n c+=1\r\nprint(c//3)", "n, k = list(map(int, input().split()))\r\nparticipants = list(map(int, input().split()))\r\nparticipants = [e+k for e in participants]\r\nanswer = [e for e in participants if e <= 5]\r\nprint(len(answer)//3)", "import math, os, sys\r\nfrom collections import defaultdict\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n# Main code here.\r\ndef solve():\r\n n,k = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n\r\n cnt = 0\r\n for num in arr: \r\n if num + k <= 5: \r\n cnt += 1 \r\n \r\n print(cnt//3)\r\n# for _ in range(int(input())):\r\n# solve()\r\nsolve()\r\n\r\nsys.stdout.close() \r\nsys.stdin.close()", "n, k = [int(i) for i in input().split()]\r\ny = [int(i) for i in input().split()]\r\ncounter = 0\r\nfor i in y:\r\n if k + i <= 5:\r\n counter += 1\r\nprint(counter // 3)", "import math\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in a:\r\n if 5-k>=i:\r\n count+=1\r\nprint(math.floor(count/3))", "m,n=map(int,input().split())\nl=list(map(int,input().split()))\nc=0\nfor i in range(len(l)):\n l[i]=l[i]+n\nfor i in range(len(l)):\n if l[i]<=5:\n c+=1\nw=c//3\nprint(w)\n\t\t\t\t \t \t\t \t \t\t \t\t \t\t \t", "non,kok = map(int,input().split())\r\nlon = list(map(int,input().split()))\r\ncount = 0\r\nfor i in lon:\r\n if i<=5-kok:\r\n\t count+=1\r\nprint(count//3)", "n, k = map(int, input().split())\r\nall = sorted(list(map(int, input().split())))\r\ncount = 0\r\nfor i in range(0, len(all) - len(all) % 3, 3):\r\n company = all[i:i+3]\r\n if 5 - max(company) >= k:\r\n count += 1\r\n else:\r\n break\r\nprint(count)\r\n", "l=input().split()\r\nn=int(l[0])\r\nk=int(l[1])\r\nl=input().split()\r\nfor i in range(n):\r\n l[i]=int(l[i])\r\ncounter=0\r\nfor i in range(n):\r\n if l[i]<=5-k: counter+=1\r\nprint(counter//3)", "from sys import stdin, stdout\r\nfrom collections import Counter, deque\r\nfrom itertools import permutations, combinations, accumulate\r\nfrom functools import reduce\r\nfrom heapq import *\r\nfrom operator import itemgetter\r\nimport math\r\n\r\ninput_int = lambda: int(stdin.readline())\r\ninput_ints = lambda: map(int, stdin.readline().split())\r\ninput_array = lambda: list(input_ints())\r\ninput_str = lambda: stdin.readline()[:-1]\r\n\r\nn, k = input_ints()\r\ny = sorted(input_array())\r\ny = list(filter(lambda x: x + k <= 5, y))\r\nstdout.write(f'{len(y) // 3}')\r\n", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nres = []\r\nfor i in l:\r\n if i <= (5-k):\r\n res.append(i)\r\nprint(len(res)//3)", "n, k = map(int, input().split())\ny = list(map(int, input().split()))\ncnt = 0\nfor i in y :\n if i <= 5 - k:\n cnt += 1\nprint(cnt//3)\n\n \t\t \t \t\t \t\t \t\t\t \t", "n,k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\ndopusk = []\r\nfor i in s:\r\n if i + k <= 5:\r\n dopusk.append(i)\r\nprint(len(dopusk)//3)", "n,m=map(int,input().split())\nl=list(map(int,input().split()))\nx=[]\nfor i in range(n):\n if l[i]+m<=5 :\n x.append(1)\nif len(x)>=3:\n print(len(x)//3)\nelse:\n print(0)\n \t\t\t\t\t\t\t \t\t\t \t\t\t\t \t \t \t \t", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ng = 0\r\nfor i in a:\r\n if i + k <= 5:\r\n g += 1\r\n\r\nprint(g // 3)", "athletes, k_times = [int(x) for x in input().split()]\r\nathletes_times = [int(x) for x in input().split()]\r\nathletes_times = [x + k_times for x in athletes_times]\r\nathletes_times = [x for x in athletes_times if x <= 5]\r\nprint(len(athletes_times) // 3)", "n, k = [int(x) for x in input().split()]\r\nl = [int(x) for x in input().split()]\r\nl = [l[i] for i in range(len(l)) if l[i] + k <= 5]\r\nprint(len(l) // 3)", "_, k = input().split(\" \")\r\nnumbers = input().split(\" \")\r\ncount = 0\r\nfor i in numbers:\r\n if int(i) + int(k) <= 5: count += 1\r\nprint(count // 3)", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ni = 0\r\nwhile i != len(l):\r\n if l[i] + k > 5:\r\n l.pop(i)\r\n i = 0\r\n else:\r\n i += 1\r\nprint(len(l)//3)\r\n", "n,m = list(map(int, input().split()))\nalunos = list(map(int, input().split()))\n\nalunos = [-1 if i > 5-m else i for i in alunos]\nif n-alunos.count(-1) >= 3:\n print(int((n-alunos.count(-1))/3))\nelse:\n print(0)", "'''input\r\n\r\n'''\r\n\r\nimport math\r\nimport heapq\r\nfrom bisect import bisect_left\r\n\r\ninp =lambda: int(input())\r\nstrng =lambda: input().strip()\r\njn =lambda x,l: x.join(map(str,l))\r\nstrl =lambda: list(input().strip())\r\nmul =lambda: map(int,input().strip().split())\r\nmulf =lambda: map(float,input().strip().split())\r\nseq =lambda: list(map(int,input().strip().split()))\r\n\r\nceil =lambda x: int(x) if(x==int(x)) else int(x)+1\r\nceildiv=lambda x,d: x//d if(x%d==0) else x//d+1\r\n\r\n\r\n\r\nmod=1000000007\r\n\r\n\r\n\r\n \r\n[n,k]= seq()\r\nqq = seq()\r\nans = 0\r\nfor i in qq:\r\n if i<=(5-k):\r\n ans+=1\r\nprint(ans//3)\r\n\r\n", "from math import floor\n\n\n\n\nn, k = map(int, input().split())\nnums = list(map(int, input().split()))\nnums = list(filter(lambda x: 5 - x >= k, nums))\nprint(floor(len(nums) / 3))\n\n\n\n \t\t \t \t\t\t\t\t \t\t\t\t \t \t \t\t\t \t", "n, k = list(map(int, input().split()))\ny = list(map(int, input().split())) \ncount = 0\nfor i in y:\n if i + k <= 5:\n count += 1\nprint(count//3)", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb = sorted(b)\r\nk = a[1]\r\nc = 0\r\nfor i in range(2, len(b), 3):\r\n if b[i] + k > 5:\r\n break\r\n else:\r\n c += 1\r\nprint(c)\r\n", "n,k=map(int,input().split())\nl=list(map(int,input().split()))\nm=[]\nfor x in l:\n if x<=5-k:\n m.append(x)\nprint(len(m)//3)\n\t \t \t\t \t \t\t \t \t\t \t \t \t\t \t", "def ChoosingTeams(n,cf,l):\n b=[]\n for i in range(n):\n if l[i]<=(5-cf):\n b.append(l[i])\n return len(b)//3\n\nn,cf=map(int,input().split())\nl=list(map(int,input().split()))\nprint(ChoosingTeams(n,cf,l))\n\t\t \t \t\t\t\t \t\t \t \t \t\t \t", "n, k = map(int, input().split()) # Number of students, and minimum participation count\r\ny = list(map(int, input().split())) # List of participation counts\r\n\r\n# Count the number of students who can participate in a team\r\ncount = 0\r\nfor i in y:\r\n if 5 - i >= k: # Check if the student can participate in a team at least k times\r\n count += 1\r\n\r\n# Calculate the maximum number of teams that can be formed\r\nteams = count // 3\r\n\r\nprint(teams)\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ndef main():\r\n _, k = [int(n) for n in input().split()]\r\n y = [int(n) for n in input().split()]\r\n y = list(filter(lambda s: s <= 5 - k, y))\r\n print(\"%d\" %(len(y) // 3))\r\n\r\nmain()", "n,k=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\ntemp=[]\r\nfor i in range(n):\r\n if l[i]+k<=5:\r\n temp.append(l[i])\r\nprint(len(temp)//3)", "from math import floor\r\n\r\nn, k = [int(i) for i in input().split()]\r\n\r\nteams = [int(j) for j in input().split()]\r\n\r\nres = [i for i in teams if 5 - i >= k]\r\n\r\nprint(floor(len(res)/3))", "\r\n# n = int(input())\r\n# j = [int(i) for i in input().split(\" \")]\r\na, b = [int(i) for i in input().split(\" \")]\r\n\r\nj = [int(i) for i in input().split(\" \")]\r\n\r\nwhile 5 in j:\r\n j.remove(5)\r\n\r\nt = 0\r\nfor x in j:\r\n if x <= (5 - b):\r\n t += 1\r\nprint(t//3)\r\n", "n, k = map(int, input().split())\r\narr = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n arr[i] = 5-arr[i]\r\n\r\nans = 0\r\nfor i in range(n):\r\n if arr[i]>=k:\r\n ans+=1\r\n\r\nprint(ans//3)\r\n", "\r\ndef solve():\r\n n, k = map(int, input().split())\r\n l = list(map(int, input().split()))\r\n\r\n cnt = 0\r\n for i in range(n):\r\n if l[i] <= 5 - k:\r\n cnt += 1\r\n\r\n print(cnt // 3)\r\nsolve()", "x,y = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ncount=0\r\nk = [0 for i in range(x)]\r\nfor i in range(x):\r\n k[i]+=l[i]+y\r\n \r\nfor i in k:\r\n if i<=5:\r\n count+=1\r\nprint(count//3)\r\n\r\n\r\n\r\n\r\n\r\n#5 2\r\n#0 4 5 1 0\r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nfor i in a:\r\n if i <= 5-k:\r\n count+=1\r\nprint(count//3)", "n , k = map(int, input().split())\r\nsh=list(map(int, input().split(' ')[:n]))\r\nc = 0\r\nfor i in sh:\r\n if i+k<=5:\r\n c+=1\r\nprint(c//3)\r\n ", "n,k=map(int,input().split())\nl=[int(x) for x in input().split()]\ntemp=[]\nfor i in range(n):\n if l[i]+k<=5:\n temp.append(l[i])\nprint(len(temp)//3)\n \t\t\t\t \t\t \t \t\t\t\t \t \t\t", "n, k = list(map(int, input().split()))\r\nprint(len([i for i in input().split() if int(i) <= 5 - k]) // 3)", "def readint():\r\n return int(input())\r\n\r\ndef readarray(typ):\r\n return list(map(typ, input().split()))\r\n\r\n\r\ndef solve():\r\n n, k = readarray(int)\r\n participations = readarray(int)\r\n cnt = 0\r\n\r\n for p in participations:\r\n if p <= 5 - k:\r\n cnt += 1\r\n\r\n print(cnt//3)\r\n\r\nsolve()", "import sys\r\n\r\nnumbers = [int(i) for i in sys.stdin.readline().split()]\r\n\r\nn, k = numbers[0], numbers[1]\r\n\r\nmembers = [int(i) for i in sys.stdin.readline().split()]\r\n\r\nteam_member_count = 0\r\n\r\nfor member in members:\r\n if member + k <= 5:\r\n team_member_count += 1\r\n\r\nprint(team_member_count // 3)", "'''\r\n#list(map(int,input().split()))'''\r\n# before you win, you have to fail\r\nn,k=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\npossible=[x+k for x in y if x+k<=5]\r\nprint(len(possible)//3)\r\n", "n , k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nst = input()\r\narr = []\r\nfor i in range(0,len(st),2):\r\n arr.append(int(st[i]))\r\ncount = 0\r\nfor ele in arr:\r\n if (ele+k)<=5:\r\n count+=1\r\nteam = count//3\r\nprint(team) ", "import math\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range (n):\r\n if (l[i]>(5-k)):\r\n c=c+1\r\n\r\nprint(math.floor((len(l)-c)/3))\r\n \r\n", "n, k = map(int,input().split())\r\na = [int(el) for el in input().split()]\r\na.sort()\r\nans = 0\r\ni = 0\r\nwhile i < n and a[i] <= 5 - k:\r\n ans += 1\r\n i += 1\r\nprint(ans // 3)\r\n", "n, k= map(int, input().split())\r\na= list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n\tif a[i]+k <=5:\r\n\t\tans+=1\r\nprint(int(ans/3))\r\n", "str1 = input().split()\r\nstr1 = [int(a) for a in str1]\r\nstr2 = input().split()\r\nstr2 = [int(b) for b in str2]\r\nnum1 = 5 - str1[1]\r\ncounter = 0\r\nfor x in str2 :\r\n if x <= num1 : counter+=1\r\nprint(counter//3)", "n, k = map(int, input().split())\r\nparticipants = list(map(int, input().split()))\r\n\r\ndef combinaisons(array, n, minimumParticipation):\r\n count = 0\r\n for i in range(n):\r\n if array[i] + minimumParticipation <= 5:\r\n count += 1\r\n teams = count // 3\r\n return teams\r\n\r\nresult = combinaisons(participants, n, k)\r\nprint(result)", "from math import floor as f\nn, k= map(int, input().split())\nn= 0\nl= list(map(int, input().split()))\ni= 0\nfor i in range(len(l)):\n if l[i]+ k <= 5:\n n+= 1\nprint(f(n/ 3))\n", "a, b = map(int, input().split())\r\nq = list(map(int, input().split()))\r\nt = 0\r\nfor i in q:\r\n if i <= 5 - b:\r\n t += 1\r\nprint (t // 3)", "n , k = map(int,input().split())\r\nd=list(map(int,input().split()))\r\ns = 0\r\nfor i in d:\r\n if k + i <= 5:\r\n s += 1\r\ns //= 3\r\nprint(s)\r\n", "import sys\n\ninput = sys.stdin.readline\nprint = sys.stdout.write\n\nn, k = map(int, input().split())\nnums = list(map(int, input().split()))\n\ncount = 0\nteam_count = 0\n\nfor i, num in enumerate(nums):\n if 5 - num >= k:\n count += 1\n\n if count == 3:\n team_count += 1\n count = 0\n\nprint(f\"{team_count}\")\n", "n, k = list(map(int, input().split()))\r\n\r\narray = list(filter(lambda x: x <= 5 - k, map(int, input().split())))\r\n\r\nprint(len(array)//3)", "N,k=map(int,input().split())\nli=list(map(int,input().split()))\ncount=0\nfor i in li:\n if i<=5-k:\n count+=1\nprint(count//3)\n \t\t\t \t \t\t\t \t\t \t\t\t \t\t \t", "n,k=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\na=sorted(t)\r\nc=0\r\nl=[]\r\nfor i in a:\r\n if 5-i>=k:\r\n l.append(i)\r\nprint(len(l)//3)", "n,k1=map(int ,input().split())\r\nl=list(map(int,input().split()))\r\ncount=sum(1 for i in l if i<=5-k1)\r\ncount=count//3\r\nprint(count)", "def solve(n, k, l):\r\n c = 0\r\n for i in l:\r\n if i + k <= 5:\r\n c += 1\r\n return c // 3\r\n\r\n\r\nn, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nprint(solve(n, k, l))", "n, k = input().split()\r\nn, k = int(n), int(k)\r\n\r\nm = [int(i) for i in input().split()]\r\nam = []\r\nfor i in m:\r\n if i+k<=5:\r\n am.append(i)\r\nprint(len(am)//3)", "n,k = list(map(int,input().strip().split()))[:2]\r\ny = list(map(int,input().strip().split()))[:n]\r\ncount=0\r\nfor i in range(n):\r\n if y[i]+k<6:\r\n count=count+1\r\n \r\nans=count//3\r\nprint(ans)", "a=input().split(\" \")\r\ncount=0\r\nb=input().split(\" \")\r\nfor i in b:\r\n if int(i) <= 5-int(a[1]):\r\n count+=1\r\nprint(count//3)", "n,k = list(map(int,input().split()))\r\narr,ans = sorted(list(map(int,input().split()))),0\r\nfor i in range(n//3):\r\n ans += max(arr[3*i:3*(i+1)]) <= 5 - k\r\nprint(ans)", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in range(a):\r\n l[i]+=b\r\nl.sort()\r\nw=0\r\nfor i in l:\r\n if i<=5:w=w+1\r\nprint(w//3)", "import sys\r\n \r\ndef MI(): return map(int, sys.stdin.readline().strip().split())\r\ndef LI(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef main():\r\n _, k = MI()\r\n l = sorted(LI())\r\n i = 0\r\n ans = 0\r\n while(True):\r\n if i+2 >= len(l) :\r\n break\r\n #print(\"Testting \"+str(i))\r\n if 5-l[i] >= k and 5-l[i+1] >= k and 5-l[i+2] >= k:\r\n ans += 1\r\n i += 3\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n", "a = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nb.sort()\r\nn = a[0]\r\nk=a[1]\r\ni=0\r\nwhile ( i<n and b[i]<=(5-k)):\r\n i+=1\r\nprint(i//3)", "n, k = map(int, input().split(\" \"))\r\narr = list(map(int, input().split(\" \")))\r\nc = 0\r\na = 0\r\nfor i in arr:\r\n\tif a<3 and 5-i>=k:\r\n\t\ta+=1\r\n\tif a==3:\r\n\t\tc +=1\r\n\t\ta = 0\r\nprint(c)", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc=sorted(c)\r\ncol_m=0\r\n\r\nfor i in c:\r\n if i+b<=5:\r\n col_m+=1\r\n\r\nprint(col_m//3)\r\n\r\n \r\n", "def Choosing_Teams(n,k, participated):\r\n# choose = []\r\n# for i in range(len(participated)):\r\n# if (participated[i] + k )<= 5:\r\n# choose.append(participated[i]) \r\n# choose.sort()\r\n# print(choose)\r\n participated.sort()\r\n# print(participated)\r\n count = 0\r\n for i in range (0,len(participated)-2,3):\r\n \r\n x = participated[i:i+3]\r\n# print(x)\r\n maxo = max(x) + k\r\n# print(maxo)\r\n if maxo <=5:\r\n count+=1\r\n return count\r\n \r\nn,k = map(int, input().split())\r\nparticipated = list(map(int, input().split()))\r\nif len(participated) == n :\r\n print(Choosing_Teams(n,k, participated)) \r\n ", "a,b = map(int,input().split())\r\nn = list(map(int,input().split()))\r\ncnt = 0\r\nfor i in range(a):\r\n if (5-n[i]) >= b:\r\n cnt += 1\r\nprint(cnt//3)\r\n", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\ns=0\r\nfor i in a:\r\n if 5-i>=k:s+=1\r\nprint(s//3)", "n, k = map(int, input().split())\r\nints = list(map(int, input().split()))\r\nteams = []\r\ncount = 0\r\nfor c in range(n):\r\n if ints[c] <= 5-k and c not in teams:\r\n teams.append(c)\r\n if len(teams)== 3:\r\n count+=1\r\n teams = []\r\n\r\nprint(count)\r\n\r\n", "teams=list(map(int,input().split()))\r\nteams_mem=list(map(int,input().split()))\r\nk = teams[1]\r\ncount=0\r\nfor i in teams_mem:\r\n x=i+k\r\n if x<=5:\r\n count+=1\r\nprint(count//3)", "n,k = [int(e) for e in input().split()]\r\na = [int(e) for e in input().split()]\r\ncount = 0\r\nfor e in a:\r\n if e<=5-k:\r\n count = count + 1\r\nprint(count//3)", "a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nc=sum(1 for s in x if s<=5-b)\r\nt=c//3\r\nprint(t)", "i=lambda:map(int,input().split());n,k=i()\r\nprint(sum(x<=5-k for x in i())//3)", "n, k = map(int, input().split())\r\nprint(sum(1 if (i+k <= 5) else 0 for i in list(map(int, input().split())))//3)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\np=0\r\nfor i in l:\r\n p=i+k\r\n if p<=5:\r\n c=c+1\r\nprint(c//3)", "[n, i] = list(map(int, input().split()))\n\nnums = list(map(int, input().split()))\ncounts = 0 \nfor num in nums:\n if num + i <= 5:\n counts += 1\nprint(counts // 3)\n\t \t \t \t\t\t\t\t\t \t\t\t\t\t \t \t \t\t\t", "_ , kTimes = map(int, input().split())\nstdntsArr = list(map(int, input().split()))\neligible = 0\nfor item in stdntsArr:\n if item <= 5 - kTimes:\n eligible += 1\nprint(eligible // 3)", "n, k = [int(x) for x in input().split()]\nY= [int(x) for x in input().split()]\ncounter1 = 0\nfor y in Y:\n if y+k <=5:\n counter1+=1\ncounter2= int(counter1 / 3)\nprint(counter2)\n\t \t \t \t\t\t \t\t \t\t \t\t\t \t \t", "def solve():\r\n n = [int(n) for n in input().split(\" \", 2)]\r\n x = [int(x) for x in input().split(\" \", n[0])]\r\n max_team = n[0] // 3 * 3\r\n count = 0\r\n i = 0\r\n while i < len(x) and count != max_team:\r\n if x[i] + n[1] <= 5:\r\n count += 1\r\n i += 1\r\n return count // 3\r\n\r\n\r\nprint(solve())\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\ns=0\r\nfor i in a:\r\n if i+k<=5:\r\n s=s+1\r\n #print(i,s)\r\nprint(s//3)", "n, k = map(int, input().split())\r\nl = sorted([int(x) for x in input().split()] + [10 ** 10])\r\n\r\nfor i in range(len(l)):\r\n if 5 - k < l[i]:\r\n break\r\nprint(i // 3)\r\n", "def solution(l,k):\n l.sort()\n k = 5 - k\n count = 0\n for i in l:\n if i<=k:\n count += 1\n return (count//3)\n\n\nn , k = map(int,input().split())\nl = list(map(int,input().split()))\nprint(solution(l,k))\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\ns = list(map(int, input().split()))\r\ncnt = 0\r\n\r\nfor i in s:\r\n if (5-i) >= k:\r\n cnt += 1\r\n \r\nprint(cnt // 3)", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nprint(sum(1 for i in s if 5 - i >= k) // 3)", "n,k = map(int,input().strip().split())\r\nar = list(map(int,input().strip().split()))\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if ar[i] < 5 and (5-ar[i] >= k):\r\n count +=1\r\nprint(count // 3 if count >= 3 else 0)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nnum = 0\r\ncount = 0\r\nwhile num < 3*(n//3):\r\n if max(arr[num:num+3])+k <= 5:\r\n count+=1\r\n num += 3\r\nprint(count)\r\n \r\n ", "# https://codeforces.com/problemset/problem/432/A\r\n\r\ndef main():\r\n n, k = map(int, input().split(' '))\r\n y = sorted(map(int, input().split(' ')))\r\n result = 0\r\n for i in range(0, len(y) - 2, 3):\r\n m = max(y[i], y[i + 1], y[i + 2])\r\n if m + k <= 5:\r\n result += 1\r\n print(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "#!/usr/bin/env python3\n# coding:utf-8\n\nif __name__ == \"__main__\":\n n, k = [int(item) for item in input().split()]\n p = [int(item) for item in input().split()]\n t = 0\n for i in p:\n if 5 - i >= k:\n t += 1\n print(t // 3)\n", "p, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n# count the number of students who can form a team\r\ncnt = 0\r\nfor i in range(p):\r\n # count the number of times the student participated\r\n # and the number of times the student can still participate\r\n x = a[i]\r\n y = 5 - k\r\n\r\n # if the student can participate k more times, add them to the count\r\n if x <= y:\r\n cnt += 1\r\n\r\n# count the number of teams that can be formed\r\nans = cnt // 3\r\n\r\n# output the answer\r\nprint(ans)\r\n", "n,k=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nlist1=[]\r\nfor i in y:\r\n if i+k<=5:\r\n list1.append(i)\r\nprint(len(list1)//3)", "# LUOGU_RID: 135322311\nfrom bisect import bisect_right\r\n\r\nn, k = map(int, input().split())\r\nlis = list(map(int, input().split()))\r\nlis.sort()\r\nx = bisect_right(lis, 5 - k)\r\nprint(x // 3)\r\n", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\ni = 0\r\nwhile i < len(y):\r\n if y[i]>(5-k):\r\n del y[i]\r\n else:\r\n i+=1\r\nprint(len(y)//3)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nc = 0\r\nfor i in range(2, n, 3):\r\n if a[i] + k <= 5:\r\n c += 1\r\nprint(c)\r\n", "n,k=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nm=[]\r\nfor i in y:\r\n if (5-i)>=k:\r\n m.append(i)\r\nprint(len(m)//3)", "\r\n#432A\r\nn=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nd=0\r\nfor i in l:\r\n if i<=5-n[1]:\r\n d+=1\r\nprint(int(d/3))", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nc = 0\r\nfor i in a:\r\n\tif i+k<=5:\r\n\t\tc += 1\r\nprint(c//3)", "# 432A\r\n\r\nn , x = map(int , input().split())\r\nthelist = list(map(int, input().split()[:n]))\r\n# print(thelist)\r\nc=0\r\nfor item in thelist:\r\n # print(item)\r\n if (5- item) >=x:\r\n c +=1\r\nprint(int(c/3))\r\n", "L1= [int(x) for x in input().split(\" \")]\r\n\r\nL2= [int(x) for x in input().split(\" \")]\r\n\r\nnum1=L1[0]\r\nnum2=L1[1]\r\n\r\nL3=[]\r\n\r\nfor i in L2:\r\n if 5-i>=num2:\r\n L3.append(i)\r\n\r\n#print(L3)\r\nprint(len(L3)//3)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n if (5-a[i]) >= k:\r\n cnt += 1\r\nprint(int(cnt/3))\r\n", "#A. Choosing Teams\r\nn,k = [int(x) for x in input().split()]\r\ny = [int(x) for x in input().split()]\r\nres = 0\r\nfor i in range(n):\r\n y[i] = 5-y[i]-k\r\n if y[i] >= 0: res+= 1\r\nprint(int(res/3))", "a0 , b0 = map(int,input().split())\nlis = list(map(int,input().split()))\nlis.sort()\nb0= 5 - b0\nc = 0\nfor i in lis:\n if i<=b0:\n c += 1\nprint(c//3)\n\n\t \t \t \t \t\t\t \t\t \t", "n, k = list(map(int, input().split()))\r\nentrada = list(map(int, input().split()))\r\ntime = 0\r\nwhile True:\r\n membro = []\r\n repeat = False\r\n for each in entrada:\r\n if each + k <= 5:\r\n membro.append(each)\r\n if len(membro) == 3:\r\n repeat = True\r\n time += 1\r\n break\r\n continue\r\n for cada in membro:\r\n entrada.remove(cada)\r\n if not repeat:\r\n break\r\nprint(time)", "n,k=map(int,input().split())\na=list(map(int,input().split()))\ns=0\nfor i in a:\n if(i+k<=5):\n s+=1\nprint(s//3)\n \t\t\t\t\t \t\t \t\t \t \t \t \t \t", "n,k = [int(i) for i in input().split()]\narr = [int(i) for i in input().split()]\narr.sort()\n\ni = 0 \ncounter = 0 \nwhile i +2 < n and (arr[i+2]+k) <= 5 : \n i += 3 \n counter += 1\nprint(counter)", "t=[]\r\nn,k=map(int,input().split())\r\np=list(map(int,input().split()))\r\nfor i in p:\r\n if 5-i>=k:\r\n t.append(i)\r\nprint(len(t)//3)", "\nn, k = map(int, input().split())\nnums = list(map(int, input().split()))\ncount = 0\n\nfor num in nums:\n if num <= 5 - k:\n count += 1\nprint(count//3)\n \t\t\t \t \t \t\t\t\t \t \t \t \t\t\t", "N,K = map(int,input().split())\r\nmembers = sorted(list(map(int,input().split())))\r\nteam = 0\r\nfor n in range(N):\r\n if members[n] + K <= 5 : team += 1 \r\n else: break\r\n\r\nprint(team // 3 ) ", "n,m = input().split()\nlst =[]\nlst = input().split()\ntemp = 5 -int(m)\nper = 0\nfor i in range (int(n)):\n if int(lst[i]) <= temp:\n per += 1\nprint(int(per/3))\n\n \t \t \t\t\t\t\t\t \t\t \t \t \t \t", "p,q=map(int,input().split())\r\nparts=list(map(int,input().split()))\r\neli_parts=0\r\nfor part in parts:\r\n rem_parts=5-part\r\n if rem_parts>=q:\r\n eli_parts+=1\r\nmax_tms=eli_parts//3\r\nprint(max_tms)\r\n", "import sys, math\r\nfrom collections import *\r\nfrom bisect import *\r\nfrom itertools import *\r\ninput = sys.stdin.readline\r\n\r\nII = lambda: map(int, input().split())\r\nL = lambda: list(II())\r\nSL = lambda: sorted(L())\r\nYES = lambda: print(\"YES\")\r\nNO = lambda: print(\"NO\")\r\nOK = lambda: print(\"OK\")\r\n\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n arr = L()\r\n p = 5-k\r\n d = defaultdict(int)\r\n for i in range(p+1):\r\n d[i] = arr.count(i)\r\n print(sum(d.values())//3)\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n #for testcase in range(int(input())):\r\n # solve()\r\n", "n, k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\n\r\nteams_possible = sum(1 for participant in y if (5 - participant) >= k)\r\n\r\nmax_teams = teams_possible // 3\r\n\r\nprint(max_teams)\r\n", "n, k = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\nans = 0\r\nfor i in range(0, n - n % 3, 3):\r\n if a[i] + k < 6 and a[i + 1] + k < 6 and a[i + 2] + k < 6:\r\n ans += 1\r\n else:\r\n break\r\nprint(ans)\r\n", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n# l.sort()\r\ncount = 0\r\n# print(teams)\r\n\r\nfor i in range(n):\r\n if 5 - l[i] >= k:\r\n count += 1\r\n \r\n\r\n\r\n\r\nteams = count//3\r\nprint(teams)", "n,m=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()] \r\nl.sort()\r\nm=5-m\r\nres=0\r\nfor i in range(len(l)):\r\n if l[i]<=m:\r\n res+=1\r\n else:\r\n break\r\nprint(res//3)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(len(a)):\r\n\tif(5-a[i])>=k:\r\n\t\tcount+=1\r\nif count>=3:\r\n\tprint(count//3)\r\nelse:\r\n\tprint(0)\r\n", "def ChoosingTeams(n, k):\r\n\r\n ppl = input().split()\r\n\r\n cnd = 5 - k\r\n\r\n team = []\r\n\r\n for i in range(n):\r\n\r\n if int(ppl[i]) <= cnd:\r\n team += [int(ppl[i])]\r\n\r\n return int(len(team) / 3)\r\n\r\nn, k = map(int, input().split())\r\n\r\nprint(ChoosingTeams(n, k))\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nc=0\r\nl=list(map(int,input().split()))\r\nk=5-k\r\nfor i in range(n):\r\n if l[i]<=k:\r\n c=c+1\r\nprint(c//3)", "n, k = map(int, input().split())\na = map(int, input().split())\ncnt = 0\nfor x in a:\n if x + k <= 5:\n cnt += 1\nprint(cnt // 3)\n \t\t \t \t \t \t \t\t \t\t\t \t\t \t", "x,y = map(int,input().split())\r\nz = list(map(int,input().split()))\r\nn = 5-y\r\nc = 0\r\nfor i in z:\r\n if i <= n:\r\n c+=1\r\n\r\nprint(c//3)", "n,k = map(int,input().split())\nar = list(map(int,input().split()))\nc = 0\nfor i in ar:\n if (i+k) <= 5:\n c += 1\nif c < 3:\n print(0)\nelse:\n print(c // 3)\n\t \t \t \t\t\t\t\t \t\t \t \t \t", "n , k = input().split()\r\nn = int(n)\r\nk = int(k)\r\ns = [int(x) for x in input().split()]\r\ncount = 0\r\nfor i in s :\r\n if (i+k) > 5 :\r\n continue\r\n else :\r\n count += 1\r\nif count < 3 :\r\n print(0)\r\nelse :\r\n print(count//3)", "n, m = map(int, input().split())\r\nans = 0\r\ntemp = 5 - m\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n temp2 = l[i]\r\n if(temp2 <= temp):\r\n ans += 1\r\nprint(ans // 3)", "n, k = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\nnums.sort()\r\ncount, i = 0, 0\r\nwhile i != n - 2:\r\n try:\r\n if nums[i + 2] + k <= 5:\r\n count += 1\r\n i += 3\r\n else:\r\n break\r\n except IndexError:\r\n break\r\nprint(count)\r\n", "n=str(input()).split()\r\na=str(input()).split()\r\n\r\nfor i in range (len(n)):\r\n n[i]=int(n[i])\r\n\r\nfor i in range (len(a)):\r\n a[i]=int(a[i])\r\n\r\nfor i in range (len(a)):\r\n a[i]=5-a[i]\r\ns=[]\r\nfor x in range (len(a)):\r\n if a[x]-n[1]>=0:\r\n s.append(a[x])\r\n\r\nprint(len(s)//3)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\n\r\nt=0\r\n\r\n\r\nfor i in l:\r\n if k+i<=5:\r\n t+=1\r\nprint(t//3)", "n , k = map(int, input().split())\r\nl = [int(i) for i in input().split()]\r\nc = 0\r\nres = 0\r\nfor i in l:\r\n if i+k <= 5:\r\n c += 1\r\n if c == 3:\r\n c = 0\r\n res += 1\r\nprint(res)", "# This is a sample Python script.\r\n\r\n# Press Shift+F10 to execute it or replace it with your code.\r\n# Press Double Shift to search everywhere for classes, files, tool windows, actions, and settings.\r\n\r\nimport math\r\nimport collections\r\n\r\nif __name__ == '__main__':\r\n n, k = map(int, input().split(' '))\r\n p = [int(e) for e in input().split(' ')]\r\n #print(n, k, p)\r\n print(len([e for e in p if e + k < 6]) // 3)\r\n", "def solve():\r\n n, k = map(int, input().split())\r\n l = [int(i) for i in input().split()]\r\n ans = 0\r\n for i in l:\r\n ans += i+k <= 5\r\n print(ans//3)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "a = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nb.sort()\r\nc=[]\r\nfor i in b:\r\n if i+a[1]<=5:\r\n c.append(i)\r\nprint(int(len(c)/3))", "n = input().split()\r\nn[0] = int(n[0])\r\nn[1] = int(n[1])\r\nm = input().split()\r\nfor i in range(0, n[0]):\r\n m[i] = int(m[i])\r\nm.sort()\r\ns = 0\r\nfor j in range(0, n[0]):\r\n p = 5 - m[j]\r\n if p >= n[1]:\r\n s = s + 1\r\nc = s//3\r\nprint(c)", "n, k = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nli = [i+k for i in li]\r\nli.sort()\r\nc = 0\r\nfor i in li:\r\n if i<=5:\r\n c = c+1\r\nprint(c//3)", "n, k = map(int, input().split())\r\nps = list(map(int, input().split()))\r\nteams = 0\r\nfor count in ps:\r\n if 5 - count >= k:\r\n teams += 1\r\nms = teams // 3\r\nprint(ms)\r\n", "from sys import stdin\r\n\r\nfirst_line = [int(x) for x in stdin.readline().split()]\r\nn= first_line[0]\r\nk = first_line[1]\r\nlisty = [int(x) for x in stdin.readline().split()]\r\n\r\neligible = sum(1 for i in listy if i<6-k)\r\nanswer = eligible//3\r\nprint(answer)\r\n", "n , k = [int(x) for x in input().split()]\r\n\r\nl = [int(x) for x in input().split()]\r\n\r\ntotal = 0\r\n\r\nfor i in l:\r\n\tif(i + k <= 5):\r\n\t\ttotal += 1\r\n\r\nprint(total//3)", "\r\nn,k = map(int,input().split())\r\nq = list (map(int,input().split()))\r\n\r\n\r\ncnt=0\r\n\r\nfor x in range (len(q)):\r\n if q[x] <=5-k:\r\n cnt+=1\r\nprint (cnt//3)\r\n\r\n\r\n", "n, m = [int(i) for i in input().split()]\r\nk = [int(i) for i in input().split()]\r\na = []\r\nfor i in k:\r\n if i +m <= 5:\r\n a.append(i)\r\nif len(a) < 3:\r\n print(0)\r\nelse:\r\n print(len(a)//3)", "from math import floor\r\n\r\n\r\nn,k=[int(i1) for i1 in input().split()]\r\nstudents=[int(i2) for i2 in input().split()]\r\neligible_students=0\r\nmax_rounds=5-k\r\nfor i3 in students:\r\n if i3<=max_rounds:\r\n eligible_students+=1\r\nprint(floor(eligible_students/3))", "n, k = input().split()\nn, k = int(n), int(k)\nrez = 0\na = input().split()\nfor i in range(len(a)):\n a[i] = int(a[i]) + k\nfor i in a:\n if i <= 5:\n rez += 1\nprint(rez // 3)\n \n", "n, k = map(int, input().split())\r\ncountCompetitions = list(map(int, input().split()))\r\n\r\ncountMembers = 0\r\nfor countCompetition in countCompetitions:\r\n if countCompetition + k <= 5:\r\n countMembers += 1\r\nprint(countMembers//3)", "a = input().split()\r\nN = int(a[0])\r\nK = int(a[1])\r\nlist = []\r\nkord = input().split()\r\nfor i in range(N):\r\n if int(kord[i]) + K > 5:\r\n continue\r\n else:\r\n list.append(kord[i])\r\narv = len(list)/3\r\nprint(int(arv))\r\n\r\n\r\n", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nallow = 5 - k\r\ncount = 0\r\nfor j in arr:\r\n if j <= allow:\r\n count += 1 \r\nprint(count//3)", "v=0\r\nn=0\r\nx=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nfor i in range(len(c)):\r\n c[i]+=x[1]\r\n if c[i]<=5:\r\n v+=1\r\n if v%3==0:\r\n n+=1\r\nprint(n)", "from collections import Counter\r\nn,k=map(int,input().split())\r\na=Counter(map(int,input().split()))\r\nprint(sum(a[i] for i in range (6-k))//3)\r\n", "n,k=map(int,input().split())\r\nchampionships=list(map(int,input().split()))\r\nresult=0\r\nfor i in championships:\r\n if i<=(5-k):\r\n result+=1\r\nprint(result//3)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ni=0\r\nwhile i!=len(a):\r\n if a[i]+k>5:\r\n a.remove(a[i])\r\n i-=1\r\n i+=1\r\nprint(len(a)//3)", "def main() -> None :\r\n print(maximum_Number_Of_Teams(*user_Inputs()))\r\n\r\n\r\ndef maximum_Number_Of_Teams(participate_count: int, student_participate_counts: list[int]) -> int :\r\n return len(filter_Less_Than(map_Add(student_participate_counts, participate_count), 6)) // 3\r\n\r\ndef map_Add(array: list[int], target: int) -> list[int] :\r\n return list(map(lambda num: num + target, array))\r\n\r\ndef filter_Less_Than(array: list[int], critical: int) -> list[int] :\r\n return list(filter(lambda num: num < critical, array))\r\n\r\n\r\ndef user_Inputs() -> tuple[int, list[int]] :\r\n return input_Array()[1], input_Array()\r\n\r\ndef input_Array() -> list[int] :\r\n return list(map(int, input().split()))\r\n\r\n\r\nmain()", "n,k = map(int,input().split())\nlst = list(map(int,input().split()))\nl = []\nd = 0 \nfor i in range(len(lst)):\n l.append(lst[i]+k)\nfor i in range(len(lst)):\n if l[i]<=5:\n d+=1 \nprint(d//3) \n \t \t\t\t\t \t \t \t\t\t \t \t \t \t \t", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nprint(sum(1 for i in l if 5-i>=b)//3)", "def solve(n, p, k):\r\n\r\n count = sum(1 for p in p if p <= 5 - k)\r\n\r\n teams = count // 3\r\n\r\n return teams\r\n\r\ndef main():\r\n \r\n n, k = map(int, input().split())\r\n p = list(map(int, input().split()))\r\n print(solve(n, p, k))\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nnew_list=list()\r\ncan=0\r\nfor i in lst:\r\n if 5-i>=k:\r\n new_list.append(i)\r\nprint(len(new_list)//3)", "n,k=map(int,input().split())\r\ns=list(map(int,input().split()))\r\ns=[s[i]+k for i in range(n)]\r\nss=[]\r\nfor i in range(n):\r\n if s[i]<=5:ss.append(s[i])\r\nprint(len(ss)//3)", "N, K =list(map(int, input().split()))\r\nY = sum(map(lambda x: 5 - K >= int(x),input().split()))\r\nprint(Y// 3)", "# 코드포스 432A Choosing Teams\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nn, k = map(int, put().split())\r\ny = [1 for i in list(map(int, put().split())) if i + k <= 5]\r\n\r\nprint(len(y) // 3)", "line1 = input()\nline2 = input()\n\nn, k = map(lambda x: int(x), line1.split(' '))\nmembers = list(map(lambda x: int(x), line2.split(' ')))\n\ncount = 0\nfor member in members:\n if 5 - member >= k:\n count += 1\n\nprint(count // 3) ", "a , b = map(int,input().split())\nl = list(map(int,input().split()))\nl.sort()\nb= 5 - b\nq = 0\nfor i in l:\n if i<=b:\n q += 1\nprint(q//3)\n\n \t\t\t\t\t \t \t\t\t \t \t \t \t", "n, k = map(int, input().split())\r\nstudents = list(map(int, input().split()))\r\ncounter = 0\r\nfor i in students:\r\n if 5 - i >= k: counter += 1\r\nprint(counter // 3)\r\n", "n,k=map(int,input().split())\r\nd=list(map(int,input().split()))\r\ns=0\r\nfor i in d:\r\n if k+i<=5:\r\n s+=1\r\nprint(s//3)", "_, k = map(int, input().split())\r\nprint(sum(1 for x in map(int, input().split()) if x <= 5 - k) // 3)\r\n", "a,b=map(int,input().split())\narr=list(map(int,input().split()))\ncnt=0\nfor i in range(len(arr)):\n arr[i]=arr[i]+b \nfor i in range(len(arr)):\n if arr[i]<=5:\n cnt+=1 \ns=cnt//3 \nprint(s)\n \n\t \t\t \t\t \t \t \t \t \t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Apr 6 13:56:39 2022\r\n\r\n@author: dehon\r\n\"\"\"\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(n):\r\n if(int(a[i]) + k <= 5):\r\n c+=1\r\nprint(c//3)", "n,k=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\ny.sort()\r\nwhile y and y[-1]+k>5:\r\n y.pop()\r\nprint(len(y)//3)", "n,k=map(int,input().split())\r\ny=input().split()\r\nlist=[]\r\nfor i in range(len(y)):\r\n y[i]=int(y[i])\r\nfor j in range(len(y)):\r\n if (y[j]+k)<=5:\r\n list.append(y[j])\r\nprint(len(list)//3)", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nl1=input().split()\r\nvalid=0\r\nl2=[int(x) for x in l1]\r\nfor i in range(len(l2)):\r\n if(l2[i]+k<=5):\r\n valid+=1\r\nvalid//=3\r\nprint(valid)", "lst1=list(map(int,input().split()))\r\nn=lst1[0]\r\nk=lst1[1]\r\nlst2=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n if lst2[i]<=(5-k):\r\n c=c+1\r\nres=c//3\r\nprint(res)\r\n", "n, k = map(int,input().split())\r\ny = list(map(int,input().split()))\r\nans = 0\r\nfor i in y :\r\n if i <= 5 - k:\r\n ans += 1\r\nprint(ans//3)\r\n", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(len(a)):\r\n if a[i]+k>5:\r\n pass\r\n else:\r\n count+=1\r\n\r\np=count//3\r\nprint(p)\r\n ", "f , m = map(int,input().split())\r\ng = map(int,input().split())\r\nplayes=0\r\nfor i in g :\r\n if (i + m <= 5) :\r\n playes+=1\r\nprint(playes//3)\r\n\r\n\r\n\r\n \r\n", "n, k = map(int, input().split())\na = [int(elem) for elem in input().split() if int(elem) <= (5-k)]\nprint(len(a) // 3)", "n,k=map(int,input().split())\r\ncount=0\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n if l[i]+k > 5:\r\n continue\r\n else:\r\n count+=1\r\nprint(count//3)", "# Problem: https://codeforces.com/problemset/problem/432/A\r\n# Answer:\r\n\r\n# *\r\n\r\n# Each student can compete up to 5 times.\r\n# Each team consists of 3 people. \r\n# One person may only join one team.\r\n\r\n# The first line has two numbers:\r\n # n = number of people available to pick from.\r\n # k = number of times we want our teams to compete\r\n# The second line has one number:\r\n # y = number of times that person has competed already.\r\n\r\n# The President wants our school to compete K number of times. Determine based on the candidate list (y) whether we can meet the president's expectations.\r\n\r\n# To solve I think we need to sort the candidates based on the number of times they have competed. \r\n# Then, determine how many times we can make. If we have more than 3 viable candidates, we can only make 1 team. Sometimes we might need more than 1 group.\r\n# Finally, determine how many attempts a team can make based on the composition of the team. This number will always be based on the person who has already competed the most times. Specifically, 5-that person's attempts.\r\n# Note, because we cannot swap teammates once they're part of a team, we need to group people based on how few attempts they have. It wouldn't make sense to group someone with 0 attempts with someone who has attempted 4 times because when the person with 4 attempts competes he will block the rest of his teammates from competing.\r\n\r\n# *\r\n\r\nfirstInput = [int(i) for i in input().split()]\r\n\r\navailablePeople = firstInput[0]\r\ntargetAttempts = firstInput[1]\r\n\r\ncList = [int(i) for i in input().split()]\r\ncList.sort()\r\n\r\n\r\n\r\noutput = 0\r\ndef teamChecker(member1, member2, member3):\r\n counter = 0\r\n output = 0\r\n for n in range(targetAttempts):\r\n team = [member1,member2,member3]\r\n \r\n # Can this team compete?\r\n if member3 < 5:\r\n member3 += 1\r\n counter += 1\r\n \r\n if n == targetAttempts-1:\r\n if counter == targetAttempts:\r\n output += 1\r\n return output\r\n\r\nnumberOfTeams = availablePeople // 3\r\n\r\nfor x in range(numberOfTeams):\r\n try:\r\n output += teamChecker(cList[0],cList[1],cList[2])\r\n del cList[0], cList[1], cList[2]\r\n except:\r\n pass\r\nprint(output)", "n,m = map(int,input().split())\r\nl = sorted(list(map(int,input().split())))\r\nc = 0\r\nfor i in l:\r\n if i <= 5-m:\r\n c+=1\r\n else:\r\n break\r\n\r\nprint(c//3)", "w = [int(i) for i in list(input().split())]\r\nn = w[0]\r\nk = w[1]\r\n\r\ny = [int(i) for i in list(input().split())]\r\nt = []\r\nfor i in range(n):\r\n if y[i] + k <= 5:\r\n t.append(y[i])\r\n\r\ncount = len(t)//3\r\nprint(count)\r\n", "n,k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\ny.sort()\r\nc = 0\r\nfor i in range(n):\r\n if y[i] <= 5-k:\r\n c+=1\r\nres = c//3\r\nprint(res)", "a,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nc = 0\r\nfor i in range(len(l)):\r\n if l[i] <= 5 - b:\r\n if (i+1) % 3 == 0:\r\n c += 1\r\nprint(c)", "n, k = map(int, input().split())\r\np = list(map(int, input().split()))\r\ns = sum(1 for i in p if 5 - i >= k)\r\nm = s // 3\r\nprint(m)\r\n", "n, k = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n \r\ncount = 0\r\nfor ele in arr:\r\n if ele <= 5 - k:\r\n count += 1\r\n \r\nif count <= 2:\r\n print(0)\r\nelse:\r\n ans = count//3\r\n print(ans)", "import sys\r\n\r\n\r\nLI = lambda: list(map(int, sys.stdin.readline().split()))\r\nMI = lambda: map(int, sys.stdin.readline().split())\r\nSI = lambda: sys.stdin.readline().strip('\\n')\r\nII = lambda: int(sys.stdin.readline())\r\n\r\n# sys.stdin = open(\"IO/input.txt\", \"r\")\r\nn, k = MI()\r\n\r\ns = LI()\r\n\r\nallowed = 0\r\n\r\nfor i in s:\r\n\tif (i + k) <= 5:\r\n\t\tallowed += 1;\r\n\r\nprint(int(allowed / 3))", "x = lambda:map(int,input().split());_,k=x();print(sum([*((5-i)>=k for i in x())])//3)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n l[i]+=k\r\n if l[i]<=5:\r\n c+=1\r\nprint(c//3) ", "# -*- coding: utf-8 -*-\n\"\"\"432A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YAcE_C3NXDvEY0NY_rHyte8StemSWBIK\n\"\"\"\n\nn, k = map(int, input().split())\nnums = list(map(int, input().split()))\ncount = 0\n\nfor num in nums:\n if num <= 5 - k:\n count += 1\nprint(count//3)", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\n\r\n#print(arr)\r\ncnt=0\r\nfor i in range(0,n):\r\n if(5-arr[i]>=k):\r\n cnt+=1\r\n\r\nprint(cnt//3)\r\n", "a,b=map(int,input().split())\r\nn=list(map(int,input().split()))\r\nc=0\r\nfor i in range(a):\r\n if(int(n[i])+b <= 5):\r\n c+=1\r\nprint(c//3)", "n,k=map(int,input().split())\r\ny=list(map(int,input().split()))\r\nd=0\r\nfor i in range(n):\r\n if(5-y[i]>=k):\r\n d+=1\r\nprint(d//3)\r\n\r\n", "n, k = map(int, input().split())\r\nloop = list(map(int, input().split()))\r\ncount = 0\r\nfor num in loop:\r\n if num <= 5-k:\r\n count += 1\r\nprint(count//3)\r\n", "n,K=map(int,input().split())\ncount=0\nl=list(map(int,input().split()))\nfor i in range(n):\n l[i]=l[i]+K\nfor i in range(n):\n if l[i]<=5:\n count+=1\ns=count//3 \nprint(s)\n\t\t \t \t\t \t\t\t\t \t\t \t \t\t \t \t", "n,k = map(int,input().split())\r\ny = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(n):\r\n if y[i] + k<= 5:\r\n c+= 1\r\n \r\nteams = c//3\r\nprint(teams)", "a,b=map(int,input().split())\r\nlis = list(map(int,input().split()))\r\ntotal = 0\r\nfor i in range(0,len(lis)):\r\n lis[i] = lis[i]+b\r\n if lis[i] < 6:\r\n total+=1\r\nprint(total//3)", "n, k = map(int, input().split())\r\nparticipation = list(map(int, input().split()))\r\nteams = 0\r\nfor i in range(n):\r\n remaining_participation = 5 - participation[i]\r\n if remaining_participation >= k:\r\n teams += 1\r\nmax_teams = teams // 3\r\nprint(max_teams)\r\n", "def sol(l,k):\r\n t=[]\r\n for _ in range(len(l)):\r\n if l[_] +k <=5:\r\n t.append(l[_])\r\n return len(t)//3\r\n\r\nn,k =map(int , input().split())\r\nl=[int(i) for i in input().split()]\r\nprint(sol(l,k))", "from math import factorial\r\n\r\nmax_personal_participations = 5\r\nteam_size = 3\r\n\r\nnumber_of_students, min_team_participations = map(int, input().split())\r\npersonal_participations = map(int, input().split())\r\n\r\neligible_personal_participations = len(list(filter(lambda n: n <= max_personal_participations - min_team_participations,\r\n personal_participations)))\r\n\r\nprint(int(eligible_personal_participations // team_size))\r\n", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ncount = 0\r\nfor i in l:\r\n if i <= 5-k:\r\n count +=1 \r\nprint(count //3)", "def solve():\r\n n, k = [int(x) for x in input().split()]\r\n contestant = input().split()\r\n participant = []\r\n\r\n for i in range(n):\r\n if int(contestant[i]) <= 5 - k:\r\n participant.append(contestant[i])\r\n\r\n print(len(participant) // 3)\r\n\r\nT = 1\r\nfor _ in range(T):\r\n solve()\r\n", "detalis=input().split(' ')\r\np=input().split(' ')\r\nn_players=0\r\nfor i in range(int(detalis[0])):\r\n if 5-int(p[i])>=int(detalis[1]):\r\n n_players+=1\r\nprint(int(n_players//3))", "n,k = map(int,input().split())\np = list(map(int,input().split()))\ne = sum(1 for i in p if i+k<=5) \nm = e // 3 \nprint(m)", "n, k = [int(x) for x in input().split()]\r\ny = [int(x) for x in input().split()]\r\neligible = 0\r\nfor student in y:\r\n if 5 - student >= k:\r\n eligible += 1\r\nprint(eligible // 3)\r\n", "# your code goes here\nn,k=list(map(int,input().split()))\ny=list(map(int,input().split()))\ny.sort()\nk=5-k\nc=0\nfor i in y:\n\tif i<=k:\n\t\tc+=1\nprint(c//3)\n \t\t\t\t\t\t \t \t \t \t \t\t \t\t", "n_k = [int(x) for x in input(\"\").split(\" \")]\nstudents = [int(x) for x in input(\"\").split(\" \")]\n\nparticipants = 0\n\nfor student in students:\n if student + n_k[1] <= 5:\n participants += 1\n\nprint(int(participants / 3))\n", "\r\nfrom sys import stdin ,stdout \r\ninput=stdin.readline \r\ninp = lambda : map(int,input().split())\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\nn,k=inp()\r\narr=list(inp())\r\nc=0\r\nfor i in range(n):\r\n if arr[i]+k<= 5:\r\n c+=1\r\nprint(c//3)\r\n", "n,k=input().split()\r\nn,k=[int(n),int(k)]\r\nx=list(map(int,input().split()))\r\nx.sort()\r\ny=list(filter(lambda i:k+i<=5,x))\r\nm=len(y)\r\nprint(m//3)", "n,k = map(int,input().split())\r\na = map(int,input().split())\r\n\r\nallow = 5 - k\r\nc = 0\r\nfor i in a:\r\n if i <= allow:\r\n c+= 1\r\n\r\nprint(c // 3)", "from sys import stdin\r\nn,k=map(int,stdin.readline().split())\r\nprint(sum(i<=5-k for i in map(int,stdin.readline().split()))//3)\r\n", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ncounter = 0\r\n\r\nfor i in range(len(l)):\r\n if (5-l[i]) >= k:\r\n counter += 1\r\nprint(counter//3)", "(n, k) = map(int, input().split())\r\ntimes_par = list(map(int, input().split()))\r\n\r\nvalid_par = 0\r\n\r\nfor par in times_par:\r\n if par + k <= 5:\r\n valid_par += 1\r\n\r\nprint(valid_par//3)", "n, k = map(int,input().split())\r\nf = [int(x) for x in input().split()]\r\ncnt = 0\r\nfor i in f:\r\n if i + k <= 5:\r\n cnt += 1\r\nprint(cnt // 3)", "n , k = list(map(int,input().split()))\r\nnums = list(map(int,input().split()))\r\nnums.sort()\r\ncount = index = 0\r\nwhile(n - 1 >= index + 2) :\r\n if nums[index + 2] + k <= 5 : count += 1\r\n index += 3\r\nprint(count)", "n,k=map(int,input().split())\nprint(sum(1 for x in sorted(map(int,input().split()),reverse=True) if x<=5-k)//3)\n", "dd,ee=map(int, input().split(\" \"))\r\nc=0\r\nl=map(int,input().split(\" \"))\r\nfor x in l:\r\n if x<=5-ee:\r\n c+=1\r\nprint(c//3)", "p,q=map(int,input().split())\r\nr=list(map(int,input().split()))\r\nc=[]\r\ni=0\r\nwhile p>0:\r\n if ((r[i]+q)<=5):\r\n c.append(r[i])\r\n i=i+1\r\n p=p-1\r\nl=len(c)\r\nprint(l//3)\r\n ", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=[]\r\nfor i in range(n):\r\n if l[i]<=5-k:\r\n a.append(l[i])\r\nprint(len(a)//3)", "_, k = map(int, input().split())\r\nvls = list(map(int, input().split()))\r\nx = len([v for v in vls if 5 - v >= k]) // 3\r\nprint(x)", "from sys import stdin\t\r\n\r\n\r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\n\r\nn, k = readarray(int)\r\n\r\narr = sorted(readarray(int))\r\n\r\n\r\nans = 0\r\n\r\ni = 0\r\n\r\nwhile i < n:\r\n\r\n curr = 0\r\n for _ in range(3):\r\n if arr[i] + k < 6:\r\n curr += 1\r\n i += 1\r\n \r\n if i == n:\r\n break\r\n \r\n if curr < 3:\r\n break\r\n\r\n ans += 1\r\n\r\nprint(ans)\r\n", "a , b = map(int , input().split())\r\nm = list(map(int , input().split()))\r\nans = 0\r\n\r\nfor i in range(len(m)):\r\n m[i] += b\r\n if m[i] < 6:\r\n ans += 1\r\n\r\nprint(ans//3)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = 0\r\nfor elem in a:\r\n if elem + k <= 5:\r\n s += 1\r\nprint(s // 3)\r\n", "a,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(a):\r\n if l[i]+b <=5:\r\n count += 1\r\nprint(count//3)\r\n", "n,k = map(int,input().split())\np=list(map(int,input().split()))\ns=[]\n\nfor i in p:\n if i+k<=5:\n s.append(i)\nprint(len(s)//3)\n", "n, k = map(int, input().split())\r\n\r\nparticipation_count_list = list(map(int, input().split()[:n]))\r\n\r\neligible_students = sum(list(1 for p in participation_count_list if 5-p >= k))\r\n\r\nmax_teams = eligible_students // 3\r\n\r\nprint(max_teams)\r\n", "n,k=map(int,input().split())\r\nlist1=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n x=5-k\r\n if list1[i]<=x:\r\n count=count+1\r\nprint(count//3)", "n,k=map(int,input().split())\r\nl1=list(map(int,input().split()))[:n]\r\nl2=[]\r\ncount=0\r\nl2=[5-j for j in l1]\r\nl2=[j-k for j in l2]\r\nfor i in l2:\r\n if(i>=0):\r\n count=count+1\r\nprint(count//3)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = 0\r\nfor i in arr:\r\n if i+k <= 5:\r\n ans += 1\r\nprint(ans//3)", "n, k = list(map(int, input().split(\" \")))\r\ny = list(map(int, input().split(\" \")))\r\n\r\nmembercnt = 0\r\nfor i in range(n):\r\n if 5- y[i] >= k:\r\n membercnt += 1\r\nans = membercnt//3\r\nprint(ans)", "n,k = map(int, input().split())\r\ny = list(map(int, input().split()))\r\ng = 0\r\nfor i in range(n):\r\n if y[i] <= 5-k:\r\n g += 1\r\nif g >= 3:\r\n print(g//3)\r\nelse: print(0)\r\n", "x, y=map(int, input().split())\r\na=list(map(int, input().split()))\r\nk=0\r\nfor i in a:\r\n if i<=5-y:\r\n k+=1\r\nprint(k//3)\r\n \r\n \r\n \r\n \r\n\r\n", "n, k = map(int, input().split())\nlst = list(map(int, input().split()))\nd = 5 - k\ncount = 0\nfor i in lst:\n if i <= d:\n count += 1\n\nprint(count // 3)\n\t\t \t \t \t \t\t \t\t\t \t\t\t", "import sys; input = sys.stdin.readline\r\nn, k = map(int, input().split())\r\nct = 0\r\nfor y in map(int, input().split()):\r\n if y < 6 - k:\r\n ct += 1\r\nprint(ct // 3)", "n,m=list(map(int,input().split(\" \")))\r\nk=list(map(int,input().split(\" \")))\r\nsum=0\r\n# print(k)\r\nfor i in (k):\r\n\t# print(i)\r\n\tif i+m<=5:\r\n\t\tsum+=1\r\n\telse: sum+=0\r\nprint(sum//3)", "n,k=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor i in l:\r\n if 5-i>=k:\r\n ans+=1\r\nprint(ans//3)", "n,k=map(int,input().split())\r\np=[int(x) for x in input().split()]\r\n\r\ncnt=0\r\n\r\nfor i in range(n):\r\n if p[i]<=5-k:\r\n cnt+=1\r\n\r\nprint(cnt//3)\r\n\r\n \r\n", "n,k = [int(c) for c in input().split()]\r\narr = [int(x) for x in input().split()]\r\narr.sort()\r\nans = 0\r\nnum = 0\r\nfor i in range(n):\r\n if num==3:\r\n ans+=1\r\n num = 0\r\n if arr[i]+k<=5:\r\n num+=1\r\n else:\r\n break\r\nif num==3:\r\n ans+=1\r\nprint(ans)", "a,b = list((int(i) for i in input().split()))\r\nl = list((int(i) for i in input().split()))\r\nppl = 0\r\nfor k in l:\r\n if k<=(5-b):\r\n ppl += 1\r\nprint(ppl//3)", "n , k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nans = 0\r\nfor i in range(2,n,3):\r\n if(l[i]+k<=5):\r\n ans = ans + 1\r\n else:\r\n break\r\n \r\nprint(ans)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nr=0\r\ns=5-k\r\nfor i in range(n):\r\n if a[i]<=s:\r\n r+=1\r\nif r>=3:\r\n print(r//3)\r\nelse:\r\n print(0)", "n,k=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nc=0\r\nfor i in a:\r\n #print(i)\r\n if(i>5-k):\r\n c+=1\r\nprint((len(a)-c)//3)\r\n " ]

[ "# \"X posted on Y's wall\" (15 points),\r\n# 2. \"X commented on Y's post\" (10 points),\r\n# 3. \"X likes Y's post\" (5 points).\r\ndef face(name,arr):\r\n points={\"posted\":15,\"commented\":10,\"likes\":5}\r\n dct=dict()\r\n for i in arr:\r\n c=3\r\n if i[1]==\"likes\":\r\n c=2\r\n x = i[c][:len(i[c]) - 2]\r\n if i[0]==name or x==name:\r\n if i[0]==name:\r\n dct[x]=dct.get(x,0)+points[i[1]]\r\n else:\r\n dct[i[0]] = dct.get(i[0],0) + points[i[1]]\r\n else:\r\n dct[i[0]]=dct.get(i[0],0)\r\n dct[x]=dct.get(x,0)\r\n if name in dct.keys():\r\n dct.pop(name)\r\n lst=[[x,y] for x,y in dct.items()]\r\n lst=sorted(lst,key=lambda s:s[0])\r\n lst=sorted(lst,key=lambda s:s[1],reverse=True)\r\n for x,y in lst:\r\n print(x)\r\n return \"\"\r\n\r\na=input()\r\nblanck=[]\r\nfor i in range(int(input())):\r\n lst=list(map(str,input().strip().split()))\r\n blanck.append(lst)\r\n\r\nprint(face(a,blanck))\r\n", "from collections import *\r\nfrom operator import *\r\n\r\nmyname, n, mem = input(), int(input()), defaultdict(int)\r\n\r\nfor i in range(n):\r\n s, val = input().split(), 0\r\n x, y = s[0], s[3][:-2]\r\n if s[1] == 'posted':\r\n val = 15\r\n elif s[1] == 'commented':\r\n val = 10\r\n else:\r\n val = 5\r\n y = s[2][:-2]\r\n\r\n if x == myname:\r\n mem[y] += val\r\n elif y == myname:\r\n mem[x] += val\r\n else:\r\n if not mem[x]:\r\n mem[x] = 0\r\n if not mem[y]:\r\n mem[y] = 0\r\n\r\nans = sorted(list(mem.items()), reverse=True, key=itemgetter(1, 0))\r\nmem = defaultdict(list)\r\nfor i, j in ans:\r\n mem[j].append(i)\r\n\r\n\r\nfor i, j in mem.items():\r\n for k in j[::-1]:\r\n print(k)\r\n", "name = input()\r\nn = int(input())\r\nactions = []\r\nfor i in range(n):\r\n actions.append(input())\r\n\r\nresults = {name: 0}\r\nfor action in actions:\r\n comps = action.split()\r\n if comps[0] not in results:\r\n results[comps[0]] = 0\r\n if comps[-2][:-2] not in results:\r\n results[comps[-2][:-2]] = 0\r\n\r\n if comps[0] == name or comps[-2][:-2] == name:\r\n score = 0\r\n if comps[1] == \"posted\":\r\n score += 15\r\n elif comps[1] == \"commented\":\r\n score += 10\r\n else:\r\n score += 5\r\n results[comps[0]] += score\r\n results[comps[-2][:-2]] += score\r\n score = 0\r\n \r\nresults.pop(name)\r\nfor e in sorted(results.items(), key=lambda x: (-x[1], x[0])):\r\n print(e[0])\r\n", "me = input()\r\nd = {}\r\nfor _ in range(int(input())):\r\n\ts = input().split('\\'')[0].split()\r\n\tx,y=s[0],s[-1]\r\n\tif x not in d: d[x]=0\r\n\tif y not in d: d[y]=0\r\n\tother = None\r\n\tif x == me:\r\n\t\tother = y\r\n\telif y == me:\r\n\t\tother = x\r\n\tif other:\r\n\t\tif len(s)==3:\r\n\t\t\td[other]-=1\r\n\t\telif s[1]==\"posted\":\r\n\t\t\td[other]-=3\r\n\t\telse:\r\n\t\t\td[other]-=2\r\nend = [(d[k],k) for k in d if k != me]\r\nend.sort()\r\nfor e in end: print(e[1])\r\n", "def solve():\r\n d = {}\r\n myname = input()\r\n n = int(input())\r\n ad = {\"posted\": 15, \"commented\": 10, \"likes\": 5}\r\n for _ in range(n):\r\n lst = input().split()\r\n #print(lst)\r\n x = lst[0]\r\n action = lst[1]\r\n # print(action)\r\n if action == \"likes\":\r\n y = lst[2][:-2]\r\n else:\r\n y = lst[3][:-2]\r\n #print(y)\r\n if y == myname:\r\n if x in d:\r\n d[x] += ad[action]\r\n else:\r\n d[x] = ad[action]\r\n elif x == myname:\r\n if y in d:\r\n d[y] += ad[action]\r\n else:\r\n d[y] = ad[action]\r\n else:\r\n if x not in d:\r\n d[x] = 0\r\n if y not in d:\r\n d[y] = 0\r\n\r\n #print(d)\r\n\r\n d2 = {}\r\n\r\n for k, v in d.items():\r\n if v in d2:\r\n d2[v].append(k)\r\n else:\r\n d2[v] = [k]\r\n #print(d2)\r\n d3 = sorted(d2, reverse=True)\r\n #print(d3)\r\n\r\n for k in d3:\r\n for name in sorted(d2[k]):\r\n print(name)\r\n\r\n\r\nsolve()\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nseen = set()\r\nlib = defaultdict(int)\r\nme = input()\r\nfor _ in range(int(input())):\r\n t = input().split()\r\n t[-2] = t[-2][:-2]\r\n seen.add(t[0])\r\n seen.add(t[-2])\r\n \r\n if t[0]!=me and t[-2]!=me:continue\r\n \r\n find = t[0]\r\n if t[0]==me:\r\n find = t[-2]\r\n \r\n if t[1]=='posted':\r\n lib[find]+=15\r\n elif t[1]=='commented':\r\n lib[find]+=10\r\n else:\r\n lib[find]+=5\r\n \r\nans = []\r\nfor k in seen:\r\n ans.append((-lib[k],k))\r\nans.sort()\r\nfor c,k in ans:\r\n if k==me:continue\r\n print(k)\r\n\r\n \r\n\r\n \r\n \r\n\r\n", "from collections import defaultdict\n\nme = input()\nn = int(input())\n\nscores = defaultdict(int)\nfor _ in range(n):\n st = input()\n st_l = st.split(' ')\n p1 = st_l[0]\n if st_l[1] == 'posted':\n p2 = st_l[3][:-2]\n points = 15\n elif st_l[1] == 'commented':\n p2 = st_l[3][:-2]\n points = 10\n else:\n p2 = st_l[2][:-2]\n points = 5\n scores[p1] += 0\n scores[p2] += 0\n # print(p1, p2)\n if p1 == me:\n scores[p2] += points\n if p2 == me:\n scores[p1] += points\n\n# print(scores)\nit = sorted(scores.items(), key=lambda x: (-x[1], x[0]))\nfor v in it:\n if v[0] != me:\n print(v[0])\n", "from collections import defaultdict\n\nu, p = input(), defaultdict(int)\n\nfor i in range(int(input())):\n\n t = input().split()\n\n a, k = t[0], t[1][0]\n\n if k == 'p': b, d = t[3][: -2], 15\n\n elif k == 'c': b, d = t[3][: -2], 10\n\n else: b, d = t[2][: -2], 5\n\n if a == u: p[b] += d\n\n elif b == u: p[a] += d\n\n else: p[a], p[b]\n\nr = defaultdict(list)\n\nfor i, j in p.items(): r[j].append(i)\n\nfor j in r: r[j] = '\\n'.join(sorted(r[j]))\n\nq = sorted(r.items(), reverse = True)\n\nprint('\\n'.join(i[1] for i in q))\n\n\n\n# Made By Mostafa_Khaled", "from collections import defaultdict\r\nfrom 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 me = input()\r\n n = int(input())\r\n d = defaultdict(int)\r\n for i in range(n):\r\n s = input().split()\r\n x = s[0]\r\n y = s[-2][:-2]\r\n action = s[1]\r\n if action == 'posted':\r\n if x == me:\r\n d[y] += 15\r\n elif y == me:\r\n d[x] += 15\r\n else:\r\n d[x] += 0\r\n d[y] += 0\r\n elif action == 'commented':\r\n if x == me:\r\n d[y] += 10\r\n elif y == me:\r\n d[x] += 10\r\n else:\r\n d[x] += 0\r\n d[y] += 0\r\n else:\r\n if x == me:\r\n d[y] += 5\r\n elif y == me:\r\n d[x] += 5\r\n else:\r\n d[x] += 0\r\n d[y] += 0\r\n print(*sorted(d, key=lambda x: (-d[x], x)), sep='\\n')\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "name=input()\r\nn=int(input())\r\n\r\ndict={}\r\nfor i in range(0,n):\r\n s=input()\r\n l=s.split()\r\n\r\n a=l[0]\r\n b=l[-2][:-2]\r\n\r\n val=15 if s.count('posted on') else 10 if s.count('commented on') else 5 \r\n \r\n if a not in dict.keys():\r\n dict[a]=0\r\n\r\n if b not in dict.keys():\r\n dict[b]=0\r\n\r\n if b==name:\r\n dict[a]+=val\r\n \r\n elif a==name:\r\n dict[b]+=val\r\n\r\nans=[]\r\n\r\nfor i in dict.keys():\r\n ans.append([-dict[i],i])\r\n\r\nans.sort()\r\n\r\nfor i in ans:\r\n if i[1]!=name:\r\n print(i[1])\r\n\r\n# szfwtzfp\r\n# 5\r\n# zqx posted on szfwtzfp's wall\r\n# r commented on scguem's post\r\n# r posted on civ's wall\r\n# r likes scguem's post\r\n# r likes scguem's post\r\n\r\n# 1. \"X posted on Y's wall\" (15 points),\r\n# 2. \"X commented on Y's post\" (10 points),\r\n# 3. \"X likes Y's post\" (5 points).\r\n", "s=input()\r\nn=int(input())\r\ndict1={}\r\nfor i in range(n):\r\n ss=input()\r\n ll=ss.split()\r\n if(len(ll)==4):\r\n a1=ll[0]\r\n a2=ll[2][0:len(ll[2])-2]\r\n if(a1==s):\r\n if(a2 in dict1):\r\n dict1[a2]+=5\r\n else:\r\n dict1[a2]=5\r\n elif(a2==s):\r\n if(a1 in dict1):\r\n dict1[a1]+=5\r\n else:\r\n dict1[a1]=5\r\n else:\r\n if(a1 in dict1):\r\n dict1[a1]+=0\r\n else:\r\n dict1[a1]=0\r\n if(a2 in dict1):\r\n dict1[a2]+=0\r\n else:\r\n dict1[a2]=0\r\n else:\r\n a1=ll[0]\r\n a2=ll[3][0:len(ll[3])-2]\r\n if(ll[-1]==\"wall\"):\r\n c=15\r\n else:\r\n c=10\r\n if(a1==s):\r\n if(a2 in dict1):\r\n dict1[a2]+=c\r\n else:\r\n dict1[a2]=c\r\n elif(a2==s):\r\n if(a1 in dict1):\r\n dict1[a1]+=c\r\n else:\r\n dict1[a1]=c\r\n else:\r\n if(a1 in dict1):\r\n dict1[a1]+=0\r\n else:\r\n dict1[a1]=0\r\n if(a2 in dict1):\r\n dict1[a2]+=0\r\n else:\r\n dict1[a2]=0\r\n \r\nflist=[]\r\nfor i in dict1:\r\n flist.append((dict1[i],i))\r\nfor i in range(len(flist)-1):\r\n for j in range(i+1,len(flist)):\r\n if(flist[i][0]<flist[j][0]):\r\n flist[i],flist[j]=flist[j],flist[i]\r\n elif(flist[i][0]==flist[j][0]):\r\n if(flist[i][1]>flist[j][1]):\r\n flist[i],flist[j]=flist[j],flist[i]\r\nfor i in range(len(flist)):\r\n print(flist[i][1])", "def compare(item1, item2):\r\n if item1[0] == item2[0]:\r\n return item1[1] < item2[1]\r\n return item1[0] < item2[0]\r\n\r\nname = input()\r\nn = int(input())\r\nm = {}\r\nfor i in range(n):\r\n s = list(input().split())\r\n if s[1] == 'posted':\r\n p1 = s[0]\r\n p2 = s[3]\r\n if p1 == name:\r\n if p2[:-2] not in m.keys():\r\n m[p2[:-2]] = 0\r\n m[p2[:-2]] += 15\r\n if p2[:-2] == name:\r\n if p1 not in m.keys():\r\n m[p1] = 0\r\n m[p1] += 15\r\n if p1 != name and p2[:-2] != name:\r\n if p1 not in m.keys():\r\n m[p1] = 0\r\n if p2[:-2] not in m.keys():\r\n m[p2[:-2]] = 0\r\n elif s[1] == 'commented':\r\n p1 = s[0]\r\n p2 = s[3]\r\n if p1 == name:\r\n if p2[:-2] not in m.keys():\r\n m[p2[:-2]] = 0\r\n m[p2[:-2]] += 10\r\n if p2[:-2] == name:\r\n if p1 not in m.keys():\r\n m[p1] = 0\r\n m[p1] += 10\r\n if p1 != name and p2[:-2] != name:\r\n if p1 not in m.keys():\r\n m[p1] = 0\r\n if p2[:-2] not in m.keys():\r\n m[p2[:-2]] = 0\r\n else:\r\n p1 = s[0]\r\n p2 = s[2]\r\n if p1 == name:\r\n if p2[:-2] not in m.keys():\r\n m[p2[:-2]] = 0\r\n m[p2[:-2]] += 5\r\n if p2[:-2] == name:\r\n if p1 not in m.keys():\r\n m[p1] = 0\r\n m[p1] += 5\r\n if p1 != name and p2[:-2] != name:\r\n if p1 not in m.keys():\r\n m[p1] = 0\r\n if p2[:-2] not in m.keys():\r\n m[p2[:-2]] = 0\r\nz = []\r\nm2 = {}\r\nfor i in m.keys():\r\n if m[i] not in m2.keys():\r\n z.append(m[i])\r\n m2[m[i]] = []\r\n m2[m[i]].append(i)\r\nz.sort()\r\nz.reverse()\r\nfor i in z:\r\n f = sorted(m2[i])\r\n for j in f:\r\n print(j)", "from collections import defaultdict\r\nme = input()\r\nn = int(input())\r\n\r\nnames = defaultdict(lambda : 0)\r\n\r\nfor i in range(n):\r\n action = input()\r\n\r\n\r\n post = action.split()\r\n\r\n if post[1] == 'likes':\r\n onname = post[2].split('\\'')[0]\r\n if onname == me:\r\n names[post[0]] += 5\r\n elif post[0] == me:\r\n names[onname] += 5\r\n else:\r\n names[onname] += 0\r\n names[post[0]] += 0\r\n\r\n elif post[1] == 'commented':\r\n onname = post[3].split('\\'')[0]\r\n if onname == me:\r\n names[post[0]] += 10\r\n elif post[0] == me:\r\n names[onname] += 10\r\n else:\r\n names[onname] += 0\r\n names[post[0]] += 0\r\n else:\r\n onname = post[3].split('\\'')[0]\r\n if onname == me:\r\n names[post[0]] += 15\r\n elif post[0] == me:\r\n names[onname] += 15\r\n else:\r\n names[onname] += 0\r\n names[post[0]] += 0\r\n\r\n\r\nsame = dict()\r\n\r\nfor k, v in names.items():\r\n if v in same:\r\n same[v].append(k)\r\n else:\r\n same[v] = [k]\r\n\r\nfor k, v in same.items():\r\n same[k] = sorted(v)\r\n\r\nres = sorted(same.items(), key=lambda x: x[0], reverse=True)\r\n\r\nfor i in res:\r\n for k in i[1]:\r\n print(k)", "r = input\r\nc = r()\r\nx = int\r\nA = dict\r\ny = range\r\nI = print\r\nn = x(r())\r\nd = A()\r\np = [' likes ', ' commented on ', ' posted on ']\r\nfor _ in y(n):\r\n s = r()\r\n for i in y(3):\r\n if p[i]in s:\r\n s = s.split(p[i])\r\n break\r\n a, b = s\r\n b = b.split('\\'')[0]\r\n s = [a, b]\r\n if c in s:\r\n a = s[1-s.index(c)]\r\n d[a] = d.get(a, 0)-(i+1)*5\r\n else:\r\n d[a] = d.get(a, 0)\r\n d[b] = d.get(b, 0)\r\nj = [[d[i], i]for i in d]\r\nj.sort(key=lambda x: (x[0], x[1]))\r\nfor i in j:\r\n I(i[1])\r\n", "my=input()\r\na={}\r\nfor _ in range(int(input())):\r\n s=input().split()\r\n x,y=s[0],s[-2][:-2]\r\n if s[1]=='posted':\r\n z=15\r\n elif s[1]=='commented':\r\n z=10\r\n else:\r\n z=5\r\n if x!=my and not (x in a):a[x]=0\r\n if y!=my and not (y in a):a[y]=0\r\n if x==my:a[y]+=z\r\n if y==my:a[x]+=z\r\n \r\nb=[]\r\nfor x in a:\r\n b.append((100000000-a[x],x))\r\nb.sort()\r\nfor x in b:\r\n print(x[1])\r\n", "s = input()\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n\tk = input().split()\r\n\tif len(k) == 5:\r\n\t\ta = k[0]\r\n\t\tb = k[3][:-2]\r\n\t\tf = True\r\n\t\tf2 = True\r\n\t\tfor q in range(len(l)):\r\n\t\t\tif a == l[q][0]:\r\n\t\t\t\tf = False\r\n\t\t\tif b == l[q][0]:\r\n\t\t\t\tf2 = False\r\n\t\tif f and a != s:\r\n\t\t\tl.append([a,0])\r\n\t\tif f2 and b != s:\r\n\t\t\tl.append([b,0])\r\n\t\tscore = 10\r\n\t\tif k[1] == 'posted':\r\n\t\t\tscore = 15\r\n\t\tfor u in range(len(l)):\r\n\t\t\tif l[u][0] == a and b == s:\r\n\t\t\t\tl[u][1]+=score\r\n\t\t\tif l[u][0] == b and a == s:\r\n\t\t\t\tl[u][1]+=score\r\n\t\t\t\r\n\tif len(k) == 4:\r\n\t\ta = k[0]\r\n\t\tb = k[2][:-2]\r\n\t\tf = True\r\n\t\tf2 = True\r\n\t\tfor q in range(len(l)):\r\n\t\t\tif a == l[q][0]:\r\n\t\t\t\tf = False\r\n\t\t\tif b == l[q][0]:\r\n\t\t\t\tf2 = False\r\n\t\tif f and a != s:\r\n\t\t\tl.append([a,0])\r\n\t\tif f2 and b != s:\r\n\t\t\tl.append([b,0])\r\n\t\tscore = 5\r\n\t\tfor u in range(len(l)):\r\n\t\t\tif l[u][0] == a and b == s:\r\n\t\t\t\tl[u][1]+=score\r\n\t\t\tif l[u][0] == b and a == s:\r\n\t\t\t\tl[u][1]+=score\r\ni = 0\r\nwhile i < len(l):\r\n\tj = 0\r\n\twhile j < len(l)-1:\r\n\t\tif l[j][1]<l[j+1][1]:\r\n\t\t\tk = l[j]\r\n\t\t\tl[j] = l[j+1]\r\n\t\t\tl[j+1] = k\r\n\t\tif l[j][1] == l[j+1][1]:\r\n\t\t\tif l[j][0] > l[j+1][0]:\r\n\t\t\t\tk = l[j]\r\n\t\t\t\tl[j] = l[j+1]\r\n\t\t\t\tl[j+1] =k\r\n\t\tj+=1\r\n\ti+=1\t\t\t\r\nfor i in l:\r\n\tprint(i[0])\r\n", "ans=[]\r\nme=input()\r\npri={}\r\nd={'p':15,'c':10,'l':5} \r\nn=int(input())\r\nfor i in range(n):\r\n s=input().split()\r\n a=s[0]\r\n b=s[1]\r\n c=s[-2][:-2]\r\n if a==me or c==me:\r\n if a==me:\r\n if c in pri:\r\n pri[c]-=d[b[0]]\r\n else:\r\n pri[c]=-d[b[0]]\r\n else:\r\n if a in pri:\r\n pri[a]-=d[b[0]]\r\n else:\r\n pri[a]=-d[b[0]]\r\n else:\r\n if a not in pri:\r\n pri[a]=0 \r\n if c not in pri:\r\n pri[c]=0 \r\n#print(pri)\r\nfor (v,k) in sorted((v,k) for (k,v) in pri.items()):\r\n print(k)", "import operator\r\nfrom collections import OrderedDict\r\nmy=input()\r\nvalue={}\r\nfor i in range(int(input())):\r\n\ts=input()\r\n\tif(\"posted on\" in s):\r\n\t\ta1=s[0:s.find(\" posted on\")]\r\n\t\ta2=s[s.find(\"posted on\")+10:-7]\r\n\t\tf=3\r\n\telif(\"commented on\" in s):\r\n\t\ta1=s[0:s.find(\" commented on\")]\r\n\t\ta2=s[s.find(\"commented on\")+13:-7]\r\n\t\tf=2\r\n\telse:\r\n\t\ta1=s[0:s.find(\" likes \")]\r\n\t\ta2=s[s.find(\" likes \")+7:-7]\r\n\t\tf=1\r\n\tif(a1==my or a2==my):\r\n\t\tif(a1 in value):\r\n\t\t\tvalue[a1]+=5*f\r\n\t\telse:\r\n\t\t\tvalue[a1]=5*f\r\n\t\tif(a2 in value):\r\n\t\t\tvalue[a2]+=5*f\r\n\t\telse:\r\n\t\t\tvalue[a2]=5*f\r\n\telse:\r\n\t\tif(a1 not in value):\r\n\t\t\tvalue[a1]=0\r\n\t\tif(a2 not in value):\r\n\t\t\tvalue[a2]=0\r\n\t# print(value)\r\nvalue=OrderedDict(sorted(value.items()))\r\nsorted_value=dict(sorted(value.items(),key=operator.itemgetter(1),reverse=True))\r\n# print((sorted_value))\r\nfor key in sorted_value:\r\n\tif(key!=my):\r\n\t\tprint(key)", "class pair:\r\n def __init__(self,f,s):\r\n self.f=f\r\n self.s=s\r\n\r\nme=input()\r\nn=int(input())\r\n\r\nmp={}\r\nfor i in range(n):\r\n a=list(map(str,input().split()))\r\n\r\n if a[1]==\"likes\":\r\n ot=a[2]\r\n else:\r\n ot=a[3]\r\n\r\n #parse the name\r\n her=\"\"\r\n for j in range(len(ot)-2):\r\n her+=ot[j]\r\n\r\n if me!=a[0] and me!=her:\r\n try:\r\n x=mp.get(a[0])\r\n mp[a[0]]+=0\r\n except:\r\n mp[a[0]]=0\r\n\r\n try:\r\n x=mp.get(her)\r\n mp[her]+=0\r\n except:\r\n mp[her]=0\r\n\r\n continue\r\n\r\n if a[1]==\"posted\":\r\n try:\r\n x=mp.get(a[0])\r\n mp[a[0]]+=15\r\n except:\r\n mp[a[0]]=15\r\n\r\n try:\r\n x=mp.get(a[0])\r\n mp[her]+=15\r\n except:\r\n mp[her]=15\r\n\r\n elif a[1]==\"commented\":\r\n try:\r\n x = mp.get(a[0])\r\n mp[a[0]] += 10\r\n except:\r\n mp[a[0]] = 10\r\n\r\n try:\r\n x = mp.get(a[0])\r\n mp[her] += 10\r\n except:\r\n mp[her] = 10\r\n\r\n else:\r\n try:\r\n x = mp.get(a[0])\r\n mp[a[0]] += 5\r\n except:\r\n mp[a[0]] = 5\r\n\r\n try:\r\n x = mp.get(a[0])\r\n mp[her] += 5\r\n except:\r\n mp[her] = 5\r\n\r\nnames=[]\r\nfor i in mp:\r\n if i != me:\r\n names.append(pair(mp[i],i))\r\n\r\nl=sorted(names,key=lambda x:(-x.f,x.s))\r\nfor i in range(len(names)):\r\n print(l[i].s)\r\n", "n=input()\r\nt=int(input())\r\nl=[]\r\nfor i in range(t):\r\n l.append(input())\r\n\r\nresult={n:0}\r\nfor j in l:\r\n act = j.split()\r\n if act[0] not in result:\r\n result[act[0]]=0\r\n if act[-2][:-2] not in result:\r\n result[act[-2][:-2]]=0\r\n \r\n if act[0]==n or act[-2][:-2]==n:\r\n score=0\r\n if act[1]==\"posted\":\r\n score+=15\r\n elif act[1]==\"commented\":\r\n score+=10\r\n else:\r\n score+=5\r\n result[act[0]]+=score\r\n result[act[-2][:-2]]+=score\r\n score=0\r\nresult.pop(n)\r\nfor i in sorted(result.items(),key=lambda x:(-x[1],x[0])):\r\n print(i[0])", "def priority_names():\r\n\tmy_name = input()\r\n\tcount = int(input())\r\n\r\n\tfriends = {}\r\n\tfor _ in range(count):\r\n\t\tstring = input().split()\r\n\t\tpoints = 0\r\n\t\tif string[1] == \"posted\":\r\n\t\t\tpoints = 15\r\n\t\telif string[1] == \"commented\":\r\n\t\t\tpoints = 10\r\n\t\telif string[1] == \"likes\":\r\n\t\t\tpoints = 5\r\n\r\n\t\tnames = string[0], string[-2][:-2]\r\n\t\tfor name in names:\r\n\t\t\tif name not in friends:\r\n\t\t\t\tfriends[name] = 0\r\n\r\n\t\tif my_name in names:\r\n\t\t\tfor name in names:\r\n\t\t\t\tfriends[name] += points\r\n\t\r\n\tfriends_list = [[friends[friend], friend] for friend in friends]\r\n\tfriends_list.sort(key=lambda x: (-x[0], x[1]))\r\n\tfor friend in friends_list:\r\n\t\tif friend[1] == my_name:\r\n\t\t\tcontinue\r\n\t\tprint(friend[1])\r\n\r\n\r\npriority_names()\r\n", "#------------------------template--------------------------#\r\nimport os\r\nimport sys\r\nfrom math import *\r\nfrom collections import *\r\nfrom fractions import *\r\nfrom bisect import *\r\nfrom heapq import*\r\nfrom io import BytesIO, IOBase\r\ndef vsInput():\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef value():return tuple(map(int,input().split()))\r\ndef array():return [int(i) for i in input().split()]\r\ndef Int():return int(input())\r\ndef Str():return input()\r\ndef arrayS():return [i for i in input().split()]\r\n\r\n#-------------------------code---------------------------#\r\n#vsInput()\r\n\r\nkey=input()\r\nn=Int()\r\nscore=defaultdict(int)\r\n\r\nfor _ in range(n):\r\n action=input().split()\r\n\r\n if(action[1]==\"posted\"):\r\n p1,p2=action[0],action[3][:-2]\r\n if(p1==key):\r\n score[p2]+=15\r\n elif(p2==key):\r\n score[p1]+=15\r\n else:\r\n score[p1]+=0\r\n score[p2]+=0\r\n \r\n if(action[1]==\"commented\"):\r\n p1,p2=action[0],action[3][:-2]\r\n if(p1==key):\r\n score[p2]+=10\r\n elif(p2==key):\r\n score[p1]+=10\r\n else:\r\n score[p1]+=0\r\n score[p2]+=0\r\n\r\n if(action[1]==\"likes\"):\r\n p1,p2=action[0],action[2][:-2]\r\n if(p1==key):\r\n score[p2]+=5\r\n elif(p2==key):\r\n score[p1]+=5\r\n else:\r\n score[p1]+=0\r\n score[p2]+=0\r\n\r\n\r\nscore_based=defaultdict(list)\r\nfor i in score:\r\n score_based[score[i]].append(i)\r\n\r\n# print(score)\r\n# print(score_based)\r\n\r\nfor i in sorted(score_based,reverse=True):\r\n for ele in sorted(score_based[i]):\r\n print(ele)\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n", "# Author: πα\r\n\r\ndef update(X, Y, dic, points):\r\n flag = you in (X, Y)\r\n if X in dic:\r\n if flag:\r\n dic[X] += points\r\n else:\r\n dic[X] = points * flag\r\n if Y in dic:\r\n if flag:\r\n dic[Y] += points\r\n else:\r\n dic[Y] = points * flag\r\n\r\nyou = input()\r\nn = int(input())\r\npriority = {}\r\nfor i in range(n):\r\n action = input()\r\n X = action.split()[0]\r\n if \"posted\" == action.split()[1]:\r\n Y = action.split()[3][:-2]\r\n update(X, Y, priority, 15)\r\n if \"commented\" == action.split()[1]:\r\n Y = action.split()[3][:-2]\r\n update(X, Y, priority, 10)\r\n if \"likes\" == action.split()[1]:\r\n Y = action.split()[2][:-2]\r\n update(X, Y, priority, 5)\r\n\r\nif you in priority:\r\n del priority[you]\r\n\r\nnames = list(priority.keys())\r\nfor i in range(len(names)-1):\r\n for j in range(len(names)-1, i, -1):\r\n if priority[names[j-1]] < priority[names[j]] or \\\r\n (priority[names[j-1]] == priority[names[j]] and names[j-1] > names[j]):\r\n temp = names[j]\r\n names[j] = names[j-1]\r\n names[j-1] = temp\r\n\r\nfor name in names:\r\n print(name)", "import itertools\r\nimport math\r\nimport time\r\nfrom builtins import input, range\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nimport collections\r\nfrom heapq import heappop, heappush\r\nimport random\r\nimport os\r\nfrom random import randint\r\nimport decimal\r\n\r\n# from sys import stdin, stdout\r\n# input, print = stdin.readline, stdout.write\r\n\r\ndecimal.getcontext().prec = 18\r\nsys.setrecursionlimit(10000)\r\n\r\n\r\ndef solve():\r\n myname = str(input())\r\n n = int(input())\r\n\r\n m = {}\r\n a = {\"posted\": 15, \"commented\": 10, \"likes\": 5}\r\n\r\n for i in range(n):\r\n s = list(map(str, input().split()))\r\n x, act, y = [s[0], s[1], s[-2][0:-2]]\r\n if x == myname:\r\n x, y = y, x\r\n\r\n if y == myname:\r\n if x in m:\r\n m[x] += a[act]\r\n else:\r\n m[x] = a[act]\r\n else:\r\n if x not in m:\r\n m[x] = 0\r\n if y not in m:\r\n m[y] = 0\r\n\r\n res = [[m[i], i] for i in m]\r\n res.sort(key=lambda x: (-x[0], x[1]))\r\n\r\n for a, b in res:\r\n print(b)\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", "\r\n\r\nn = 0\r\nname = \"\"\r\ns = \"\"\r\nname = input()\r\nn = int(input())\r\nscore = {}\r\npoints = {\r\n \"posted\" : 15 ,\r\n \"commented\" : 10 ,\r\n \"likes\" : 5 \r\n }\r\n\r\n\r\n\r\nfor i in range(n) :\r\n s = input().split(\" \")\r\n j = 3 \r\n if(s[1] == \"likes\") :\r\n j = 2\r\n s[j] = s[j][:len(s[j])-2]\r\n if s[0] != name and s[0] not in score :\r\n score[s[0]] = 0 \r\n if s[j] != name and s[j] not in score :\r\n score[s[j]] = 0 \r\n if(name == s[0]) :\r\n score[s[j]] += points[s[1]]\r\n if name == s[j]:\r\n score[s[0]] += points[s[1]]\r\n\r\nfor e in sorted( [(-value,key) for (key,value) in score.items()]) :\r\n print(e[1])\r\n \r\n ", "class Chain:\r\n def __init__(self, f, s):\r\n self.f = f\r\n self.s = s\r\n\r\n\r\nme = input()\r\nn = int(input())\r\n\r\nmp = {}\r\nfor i in range(n):\r\n a = list(map(str, input().split()))\r\n\r\n if a[1] == \"likes\":\r\n ot = a[2]\r\n else:\r\n ot = a[3]\r\n\r\n # parse the name\r\n her = \"\"\r\n for j in range(len(ot)-2):\r\n her += ot[j]\r\n\r\n if me != a[0] and me != her:\r\n try:\r\n x = mp.get(a[0])\r\n mp[a[0]] += 0\r\n except:\r\n mp[a[0]] = 0\r\n\r\n try:\r\n x = mp.get(her)\r\n mp[her] += 0\r\n except:\r\n mp[her] = 0\r\n\r\n continue\r\n\r\n if a[1] == \"posted\":\r\n try:\r\n x = mp.get(a[0])\r\n mp[a[0]] += 15\r\n except:\r\n mp[a[0]] = 15\r\n\r\n try:\r\n x = mp.get(a[0])\r\n mp[her] += 15\r\n except:\r\n mp[her] = 15\r\n\r\n elif a[1] == \"commented\":\r\n try:\r\n x = mp.get(a[0])\r\n mp[a[0]] += 10\r\n except:\r\n mp[a[0]] = 10\r\n\r\n try:\r\n x = mp.get(a[0])\r\n mp[her] += 10\r\n except:\r\n mp[her] = 10\r\n\r\n else:\r\n try:\r\n x = mp.get(a[0])\r\n mp[a[0]] += 5\r\n except:\r\n mp[a[0]] = 5\r\n\r\n try:\r\n x = mp.get(a[0])\r\n mp[her] += 5\r\n except:\r\n mp[her] = 5\r\n\r\nnames = []\r\nfor i in mp:\r\n if i != me:\r\n names.append(Chain(mp[i], i))\r\n\r\nl = sorted(names, key=lambda x: (-x.f, x.s))\r\nfor i in range(len(names)):\r\n print(l[i].s)\r\n" ]

[ "a=int(input())\r\nc=[]\r\nd=0\r\nfor i in range(1,a+1):\r\n c.append(i)\r\nsum=0\r\nfor j in range(a):\r\n if sum+c[j]>a:\r\n sum+=c[j]\r\n d+=1\r\n break\r\n else:\r\n sum+=c[j]\r\n d+=1\r\nsum=0\r\ne=[]\r\nfor i in range(d-2):\r\n e.append(c[i])\r\n sum+=c[i]\r\ne.append(a-sum)\r\nprint(len(e))\r\nprint(*e)\r\n\r\n\r\n", "n=int(input())\r\nt=1\r\na=[]\r\nwhile n>=t:\r\n a.append(t)\r\n n-=t\r\n t=t+1\r\na[-1]+=n\r\nprint(len(a))\r\nfor i in range(len(a)):\r\n print(a[i],end=' ')\r\n \r\n", "n = int(input()) - 1\r\nans = [1]\r\nwhile n > ans[-1]:\r\n n -= ans[-1] + 1\r\n ans.append(ans[-1] + 1)\r\nans[-1] += n\r\nprint(len(ans))\r\nprint(*ans)", "n=int(input())\r\na=[]\r\nwhile n>len(a):\r\n\ta+=[len(a)+1]\r\n\tn-=a[-1]\r\na[-1]+=n\r\nprint(len(a))\r\nprint(*a)", "n = int(input())\r\ntmp = 0\r\nres = []\r\ni = 0\r\nwhile n > tmp:\r\n i += 1\r\n tmp += i\r\n if tmp > n:\r\n tmp -= i\r\n break\r\n else:\r\n res.append(i)\r\ntmp = tmp - res.pop()\r\nres.append(n-tmp)\r\nprint(len(res))\r\nprint(*res)", "candy=int(input())\r\nchild=[]\r\ngive=0\r\nwhile True:\r\n if candy<give+1:\r\n child[-1]=child[-1]+candy\r\n break\r\n else:\r\n give += 1\r\n candy -= give\r\n child.append(give)\r\nprint(len(child))\r\nfor i in child:\r\n print(i,end=\" \")", "def s(n):\r\n j = 1\r\n sm = 0\r\n counter = 0\r\n ans = []\r\n while sm + j <= n:\r\n ans.append(j)\r\n sm += j\r\n j += 1\r\n counter += 1\r\n if n - sm != 0:\r\n ans[-1] = n - sm + ans[-1]\r\n print(counter)\r\n for x in ans:\r\n print(str(x),end = \" \")\r\n print()\r\n\r\nn = int(input())\r\ns(n)", "import math\r\nCandies=int(input())\r\n\r\ndef reparto(n):\r\n m=(math.sqrt(8*n+1)-1)/2\r\n print(int(m))\r\n for i in range(1,int(m)):\r\n n-=i\r\n print(i)\r\n return n\r\n\r\nprint(reparto(Candies))", "n= int(input())\r\nsumv,i=0,1\r\ns=[]\r\nwhile sumv<n:\r\n s.append(i)\r\n sumv+=i\r\n i+=1 \r\nif sumv>n:\r\n x=s[-1]\r\n sumv-=x\r\n s.pop()\r\n s[-1]+=(n-sumv)\r\nprint(len(s))\r\nprint(*s)", "n=int(input())\r\ns=''\r\ni=0\r\nwhile True:\r\n i+=1\r\n n-=i\r\n if n>i:\r\n s+=str(i)+' '\r\n else:\r\n s+=str(n+i)\r\n break\r\nprint(i)\r\nprint(s)", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\ndef cusum(x):\r\n\treturn x * (x+1) // 2\r\n\r\nn = int(input())\r\nans = []\r\nfor i in range(1, n+1):\r\n\tt = cusum(i)\r\n\tif t > n:\r\n\t\tif len(ans) == 1:\r\n\t\t\tans[-1] = n\r\n\t\telse:\r\n\t\t\tans[-1] = abs(cusum(ans[-2]) - n)\r\n\t\tbreak\r\n\tans.append(i)\r\nprint(len(ans))\r\nprint(\" \".join(map(str, ans)))", "def cari(bil, peng):\n # print(bil)\n if len(memo[bil]) != 0:\n return memo[bil]\n\n if bil == 0:\n return [peng]\n\n if bil < 0:\n return []\n\n temp = []\n for i in range(peng, bil + 1):\n\n hasil = cari(bil - i, i + 1)\n temp = ([i] + hasil) if len(hasil) > len(temp) else temp\n\n memo[bil] = temp\n return temp\n\n\nn = int(input())\nmemo = [list()] * (n + 1)\nhasil = cari(n, 1)[:-1]\nprint(len(hasil))\nprint(*hasil)\n", "a=int(input())\r\n\r\n\r\nt=[]\r\n\r\n\r\n\r\nfor j in range(1,10000):\r\n if a>=j:\r\n t.append(j)\r\n a-=j\r\n else:\r\n\r\n for c in range(len(t)):\r\n if a>0:\r\n t[c]+=1\r\n a-=1\r\n else:\r\n break\r\n\r\n\r\nfor i in range(len(t)):\r\n if t.count(t[i])==2:\r\n p=t[i]\r\n t[-1]+=p-1\r\n t.append(1)\r\n t.remove(p)\r\n break\r\n \r\nprint(len(t))\r\nprint(*t)\r\n", "#Author: Bishal Sarang\r\n\r\nn = int(input())\r\ni = 1\r\nwhile i * (i + 1) // 2 <= n:\r\n i += 1\r\ni -= 1\r\nl = [x for x in range(1, i)]\r\nl.append(n - sum(l))\r\nprint(len(l))\r\nprint(*l)\r\n", "n = int(input())\r\nans = []\r\nuk = 1\r\nwhile n >= uk:\r\n ans.append(uk)\r\n n -= uk\r\n uk += 1\r\nans[-1] += n\r\nprint(len(ans))\r\nprint(*ans)\r\n", "n = int(input())\r\ncur = 1\r\nans = []\r\nwhile n > cur:\r\n n -= cur\r\n ans.append(cur)\r\n cur += 1\r\nif n < cur:\r\n ans[-1] += n\r\nelse:\r\n ans.append(n)\r\nprint(len(ans))\r\nprint(*ans)\r\n", "N=int(input())\r\ncount=1\r\nans=[]\r\nwhile N>=count:\r\n ans+=[count]\r\n N-=count\r\n count+=1\r\nif N!=0:\r\n ans[-1]+=N\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i,end=\" \")", "n = int(input())\r\nresult=0\r\nmu=0\r\nwhile mu*(mu+1)/2<=n:\r\n result=mu\r\n mu+=1\r\nprint(result)\r\np=1\r\nwhile p<result:\r\n print(p,end=\" \")\r\n p+=1\r\nprint(n-p*(p-1)//2,end=\" \")\r\n", "n = int(input())\r\n\r\ncount = 0\r\nres = []\r\n\r\nk = 0\r\n\r\nwhile k < n:\r\n k += 1\r\n n -= k\r\n res.append(k)\r\n count += 1\r\nif n > 0:\r\n res[-1] += n\r\nprint(k)\r\nprint(*res)", "n = int(input())\r\nc = [0 for i in range(n + 1)]\r\nt = n\r\nres = []\r\nfor i in range(1, n + 1):\r\n if i == t - i:\r\n continue\r\n elif i > t:\r\n continue\r\n elif c[i] == 1 or c[t - i] == 1:\r\n continue\r\n else:\r\n t -= i\r\n c[i] = 1\r\n res.append(i)\r\nprint(len(res))\r\nprint(*res)\r\n", "n=int(input())\r\nif n==1 or n==2:\r\n print(1)\r\n print(n)\r\nelse:\r\n s=0\r\n i=1\r\n t=0\r\n while(True):\r\n s+=i\r\n if n-s<=i:\r\n t=n-((i)*(i-1)//2)\r\n break\r\n else:\r\n i+=1\r\n print(i)\r\n for j in range(i):\r\n \r\n if j==i-1:\r\n print(t,end=\" \")\r\n else:\r\n print(j+1,end=\" \")\r\n \r\n ", "#not submitted not completed\r\n#http://codeforces.com/problemset/problem/753/A\r\nn = int(input())\r\nsum = 0\r\nnumbers = []\r\ni = 1\r\nwhile sum < n:\r\n\tnumbers.append(i)\r\n\tsum += i\r\n\ti += 1\r\nif sum > n:\r\n\tdel numbers[sum - n - 1]\r\nprint(len(numbers))\r\nfor j in numbers:\r\n\tprint(j, end=\" \")\r\nprint()", "n = int(input())\r\nans = []\r\ncount = 0\r\ni = 1\r\nwhile count <= n:\r\n ans.append(i)\r\n count += i\r\n i += 1\r\nans.pop()\r\nans.pop()\r\nans.append(n-sum(ans)) \r\nprint(len(ans))\r\nprint(*ans)", "#fr=open(\"INPUT.txt\",\"r\")\r\n#fw=open(\"OUTPUT.txt\",\"w\")\r\n \r\nsweets=int(input())\r\nam=1\r\nmas=[]\r\nwhile(True):\r\n if(sweets-am-(am+1)>=0):\r\n mas.append(am)\r\n sweets-=am\r\n am+=1\r\n else:\r\n mas.append(sweets)\r\n break\r\nprint(len(mas))\r\nfor i in mas:\r\n print(i,end=' ')\r\n\r\n#fr.close()\r\n#fw.close()\r\n", "n = int(input())\r\ni = 1\r\nans = []\r\nwhile n >= i:\r\n ans.append(i)\r\n n -= i\r\n i += 1\r\nans[-1] += n\r\n\r\nprint(len(ans))\r\nprint(*ans)", "n=int(input())\na=[]\nwhile n>len(a):\n\ta+=[len(a)+1]\n\tn-=a[-1]\na[-1]+=n\nprint(len(a))\nprint(*a)\n \t\t\t \t\t\t \t\t \t \t\t\t\t\t \t \t\t", "n = int(input())\r\ncnt, s = 1, 0\r\nwhile (s < n):\r\n s += cnt\r\n cnt += 1\r\n\r\ns -= n\r\n\r\na = [i for i in range(1, cnt) if i != s]\r\nprint(len(a))\r\nprint(*a)", "n=int(input())\r\na=[0]\r\nwhile len(a)<1001:\r\n a.extend([a[-1]+1]*(a[-1]+2))\r\nk=a[n]\r\nb=[]\r\nfor i in range(1,a[n]):\r\n b.append(i)\r\nb.append(n-sum(b))\r\nprint(k)\r\nprint(*b)", "a=int(input())\r\ni=1\r\ncounter=0\r\nT=[]\r\nwhile a-i>=0:\r\n a-=i\r\n counter+=1\r\n T=T+[i]\r\n i+=1\r\nT[counter-1]+=a\r\nprint(counter)\r\nfor i in T:\r\n print(i,end=\" \")\r\n", "import math\r\nn=int(input())\r\nif (n!=2):\r\n\ti=1\r\n\tc=1\r\n\ts=\"1\"\r\n\twhile((i*(i+1))/2<=n):\r\n\t\ti+=1\r\n\tprint(i-1)\r\n\tfor j in range(1,i-1):\r\n\t\tif j==(i-2):\r\n\t\t\ts+=\" \"+ str(n-c)\r\n\t\telse:\r\n\t\t\ts+=\" \"+ str(j+1)\r\n\t\t\tc+=j+1\r\n\tprint(s)\r\nelse:\r\n\tprint(1)\r\n\tprint(2)\r\n", "n=int(input())\r\nk=1;x=0;s=0\r\nwhile (k*(k+1)//2)<=n:\r\n x=k\r\n s=(k*(k+1)//2)\r\n k+=1\r\nl=list()\r\ni=1\r\nwhile i<x:\r\n l.append(i)\r\n i+=1\r\nl.append(i+(n-s))\r\nprint(len(l))\r\nfor i in l:\r\n print(i,end=' ')\r\n\r\n", "from math import *\r\nn=int(input())\r\nx=((floor(sqrt(8*n+1)))-1)//2\r\nprint(x)\r\ntot=0\r\nfor i in range(x-1):\r\n print(i+1,end=\" \")\r\n tot+=i+1\r\nprint(n-tot)", "def sum_digits(n):\r\n sum = 0\r\n for i in range(n + 1):\r\n sum += i\r\n return sum\r\n\r\ndef list_need_digits(numb):\r\n count, lst = 1, []\r\n while sum_digits(count) <= numb:\r\n lst.append(count)\r\n count += 1\r\n if sum_digits(count) != numb:\r\n lst[len(lst) - 1] += numb - sum_digits(count - 1)\r\n return lst \r\n\r\nn = int(input())\r\nprint(len(list_need_digits(n)))\r\nprint(' '.join(map(str, list_need_digits(n))))", "def rs(): return input().strip()\r\ndef ri(): return int(input())\r\ndef ria(): return list(map(int, input().split()))\r\ndef ia_to_s(a): return ' '.join([str(s) for s in a])\r\n\r\n\r\n\r\ndef solve(n):\r\n k = 1\r\n while k * (k+1) // 2 <= n:\r\n k += 1\r\n\r\n ans = k-1\r\n print(ans)\r\n\r\n a = list(range(1, ans+1))\r\n left = n - ans * (ans + 1) // 2\r\n for i in range(left):\r\n a[ans-i-1] += 1\r\n\r\n print(ia_to_s(a))\r\n\r\n\r\ndef main():\r\n n = ri()\r\n solve(n)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "x = int(input())\r\nans = []\r\ni = 0\r\nwhile x>i:\r\n i += 1\r\n x -= i\r\n ans.append(str(i))\r\nans[-1] = str(int(ans[-1])+x)\r\nprint(len(ans))\r\nprint(\" \".join(ans))", "n = int(input())\nk = int((2*n)**0.5) - 1\nwhile k*(k+1) <= 2*n:\n k +=1\nk -= 1\nprint(k)\nq = n - k*(k+1)//2\nfor i in range(1, k):\n print(i, end = ' ')\nprint(k+q)", "n=int(input())\nL=[]\np=1\nif n==1:\n print(1)\n print(1)\nelif n==2:\n print(1)\n print(2)\nelse:\n while n>0:\n L.append(p)\n n-=p\n p+=1\n if n<2*p+1:\n L.append(n)\n n=0\n print(len(L))\n print(*L)", "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'''\nn = int(input())\ncand = []\ncur = 1\nwhile cur<=n:\n cand.append(cur)\n n-=cur\n cur += 1\ncand[-1]+=n\nprint(len(cand))\nprint(' '.join(map(str,cand)))\n", "def decomp(n):\r\n ans = []\r\n x = 1\r\n sum_ = 0\r\n while sum_ < n:\r\n if sum_ + x + x + 1 > n:\r\n k = n - sum_ - x\r\n x += k\r\n ans.append(x)\r\n return ans\r\n\r\n sum_ += x\r\n ans.append(x)\r\n x += 1\r\n \r\n \r\n\r\n \r\n \r\nn = int(input())\r\nans = decomp(n)\r\nprint(len(ans))\r\nprint(\" \".join(map(str, ans)))\r\n", "candies=int(input())\n\nchildren=1\n\nwhile (children*(children+1)<=2*candies):\n children+=1\n \nchildren-=1\n\nprint(children)\nfor i in range(1,children):\n print(i,end=\" \")\n candies-=i\nprint(candies)\n\n \t\t \t \t \t \t\t \t \t", "#_______________________________________________________________#\ndef fact(x):\n\tif x == 0:\n\t\treturn 1\n\telse:\n\t\treturn x * fact(x-1)\ndef lower_bound(li, num): #return 0 if all are greater or equal to\n\tanswer = len(li)-1\n\tstart = 0\n\tend = len(li)-1\n\n\twhile(start <= end):\n\t\tmiddle = (end+start)//2\n\t\tif li[middle] >= num:\n\t\t\tanswer = middle\n\t\t\tend = middle - 1\n\t\telse:\n\t\t\tstart = middle + 1\n\treturn answer #index where x is not less than num\ndef upper_bound(li, num): #return n-1 if all are small or equal\n\tanswer = -1\n\tstart = 0\n\tend = len(li)-1\n\n\twhile(start <= end):\n\t\tmiddle = (end+start)//2\n\n\t\tif li[middle] <= num:\n\t\t\tanswer = middle\n\t\t\tstart = middle + 1\n\t\t\n\t\telse:\n\t\t\tend = middle - 1\n\treturn answer #index where x is not greater than num\n\ndef abs(x):\n\treturn x if x >=0 else -x\ndef binary_search(li, val, lb, ub): # ITS A BINARY\n\tans = 0\n\twhile(lb <= ub):\n\t\tmid = (lb+ub)//2\n\t\t#print(mid, li[mid])\n\t\tif li[mid] > val:\n\t\t\tub = mid-1\n\t\telif val > li[mid]:\n\t\t\tlb = mid + 1\n\t\telse:\n\t\t\tans = 1\n\t\t\tbreak\n\treturn ans\n\ndef sieve_of_eratosthenes(n):\n\tans = []\n\tarr = [1]*(n+1)\n\tarr[0],arr[1], i = 0, 0, 2\n\twhile(i*i <= n):\n\t\tif arr[i] == 1:\n\t\t\tj = i+i\n\t\t\twhile(j <= n):\n\t\t\t\tarr[j] = 0\n\t\t\t\tj += i\n\t\ti += 1\n\tfor k in range(n):\n\t\tif arr[k] == 1:\n\t\t\tans.append(k)\n\treturn ans\ndef nc2(x):\n\tif x == 1:\n\t\treturn 0\n\telse:\n\t\treturn x*(x-1)//2\ndef kadane(x): #maximum subarray sum\n\tsum_so_far = 0\n\tcurrent_sum = 0\n\tfor i in x:\n\t\tcurrent_sum += i\n\t\tif current_sum < 0:\n\t\t\tcurrent_sum = 0\n\t\telse:\n\t\t\tsum_so_far = max(sum_so_far,current_sum)\n\treturn sum_so_far\ndef mex(li):\n\tcheck = [0]*1001\n\tfor i in li:\n\t\tcheck[i] += 1\n\tfor i in range(len(check)):\n\t\tif check[i] == 0:\n\t\t return i \ndef sumdigits(n):\n\tans = 0\n\twhile(n!=0):\n\t\tans += n%10\n\t\tn //= 10\n\treturn ans\n\ndef product(li):\n\tans = 1\n\tfor i in li:\n\t\tans *= i\n\treturn ans\ndef maxpower(n,k):\n\tcnt = 0\n\twhile(n>1):\n\t\tcnt += 1\n\t\tn //= k\n\treturn cnt\ndef knapsack(li,sumi,s,n,dp):\n\tif s == sumi//2:\n\t\treturn 1\n\telif n==0:\n\t\treturn 0\n\telse:\n\t\tif dp[n][s] != -1:\n\t\t\treturn dp[n][s]\n\t\telse:\n\t\t\tif li[n-1] <= s:\n\t\t\t\tdp[n][s] = knapsack(li,sumi,s-li[n-1],n-1,dp) or knapsack(li,sumi,s,n-1,dp)\n\t\t\telse:\n\t\t\t\tdp[n][s] = knapsack(li,sumi,s,n-1,dp)\n\t\t\treturn dp[n][s]\n\n#_______________________________________________________________#\n'''\n ▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄\n ▄███████▀▀▀▀▀▀███████▄\n░▐████▀▒▒Aestroix▒▒▀██████\n░███▀▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▀████\n░▐██▒▒▒▒▒KARMANYA▒▒▒▒▒▒████▌ ________________\n░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌ ? ? |▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒|\n░░█▒▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▒▐███▌ ? |___CM ONE DAY___|\n░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▒▐███▌ ? ? |▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒|\n░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌ ? ? \n░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌ ? \n░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█ ? ? \n░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀ ? \n░░░░▄█████████ ████=========█▒▒▐▌\n░░░▀███▀▀████▀█████▀▒▌\n░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐\n░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐\n░░░░░████████████████\n'''\nfrom math import *\nfrom collections import deque\nmax_steps = 100005\n#for _ in range(int(input())):\nfor _ in range(1):\n\tn = int(input())\n\t#l,r,m = map(int,input().split())\n\t#s1 = input()\n\t#s2 = input()\n\t#n,m = map(int,input().split())\n\t#a = list(map(int,input().split()))\n\t#b = list(map(int,input().split()))\n\t#s = list(st)\n\t#a = [int(x) for x in list(s1)]\n\t#b = [int(x) for x in list(s2)]\n\tans = 1\n\tfor k in range(1,50):\n\t\tif k*(k+1) > 2*n:\n\t\t\tans = k\n\t\t\tbreak\n\tprint(ans-1)\n\tli = [x for x in range(1,ans)]\n\tli[-1] += n-sum(li)\n\tprint(*li)\n\n\n\n\n\n\n\n\t\n\n\n\n\n", "n = int(input())\r\nk = 0\r\nif n==2:\r\n print(1)\r\n print(2)\r\n exit()\r\nif n==1:\r\n print(1)\r\n print(1)\r\n exit()\r\nfor i in range(1,n):\r\n k += i\r\n if k==n:\r\n print(i)\r\n for i in range(1,i+1):\r\n print(i,end=' ')\r\n exit()\r\n if k > n:\r\n k -= i + i - 1\r\n break\r\nprint(i-1)\r\nfor i in range(1,i-1):\r\n print(i,end=' ')\r\nprint(n-k)\r\n ", "def sum_pos(first, n):\r\n global f1, begin, end, dop, k1, k2\r\n start = first + 1\r\n stop = first + n -1\r\n sum = 0\r\n while sum < N-1:\r\n sum = first\r\n for i in range(start, stop):\r\n sum += i\r\n for i in range(stop, N):\r\n if (sum + i) >= N:\r\n sum += i\r\n break\r\n start += 1\r\n stop += 1\r\n if sum == N and (stop-start) > k1:\r\n f1 = first\r\n begin = start - 1\r\n end = stop - 1\r\n dop = i\r\n k1 = stop - start\r\n\r\nN = int(input())\r\nk1 = -1\r\nif N == 1 or N == 2:\r\n print(1)\r\n print(N)\r\nif N == 3:\r\n print(2)\r\n print(1,2)\r\nif N > 3:\r\n for i in range(1, N):\r\n k2 = k1\r\n for j in range(2, N+2):\r\n sum_pos(i, j)\r\n if k2 == k1:\r\n break\r\n print(k1+2)\r\n print(f1, end=' ')\r\n for i in range(begin, end):\r\n print(i, end=' ')\r\n print(dop)\r\n", "n = int(input())\r\nans = 0\r\nL = []\r\ni = 1\r\nwhile i <= n:\r\n ans += 1\r\n L.append(i)\r\n n -= i\r\n i += 1\r\nL[-1] += n\r\nprint(ans)\r\nprint(*L)", "n = int(input())\r\ni = int((-1 + (1 + 8 * n) ** .5) // 2)\r\nprint(i)\r\nprint(*range(1, i), n - sum(range(1, i)))\r\n", "n = int(input())\r\nm = n\r\nk = 0\r\ni = 1\r\ns = set()\r\nwhile m > 0:\r\n\tif not s.__contains__(m-i) and not s.__contains__(i) and m - i != i:\r\n\t\tm = m - i\r\n\t\ts.add(i)\r\n\t\ti += 1\r\n\t\tk += 1\r\n\telse:\r\n\t\ts.add(m)\r\n\t\tk += 1\r\n\t\tm -= m\r\nprint(k)\r\nfor number in list(s):\r\n\tprint(number, end=\" \")\r\nprint()", "n = int(input())\r\ni = 1\r\nm = n\r\nl = []\r\nwhile(m>0):\r\n l.append(i)\r\n m-=i\r\n i+=1\r\nif sum(l)!=n:\r\n l.pop()\r\n le = len(l)\r\n l[le-1] = n-sum(l[:le-1])\r\nprint(len(l))\r\nprint(*l)\r\n ", "n=int(input())\r\ns=[]\r\nsum=0\r\ni=1\r\nwhile sum+i<=n and i not in s:\r\n s.append(i)\r\n sum+=i\r\n i+=1\r\n\r\nprint(len(s))\r\ns[-1]+=(n-sum)\r\nprint(*s)\r\n\r\n\r\n\r\n", "n = int(input())\n\nind = 1\na = list()\nwhile True:\n\ta.append(ind)\n\tn -= ind\n\tif (n == 0):\n\t\tbreak\n\tif (n <= ind):\n\t\ta[-1] += n\n\t\tbreak\n\tind += 1\n\nprint(len(a))\nfor i in a:\n\tprint(i, end=' ')", "n = int(input())\r\n\r\na = [set()] * (n + 1)\r\n\r\nfor i in range(1, n + 1):\r\n b = set([i])\r\n for j in range(1, i):\r\n aj = a[i - j]\r\n if j not in aj:\r\n new_len = len(aj) + 1\r\n if new_len > len(b):\r\n b = aj.copy()\r\n b.add(j)\r\n a[i] = b\r\n\r\nprint(len(a[n]))\r\nprint(' '.join(map(str, a[n])))\r\n", "n = int(input())\r\ndp = []\r\nx = 1\r\nwhile n >= x:\r\n\tdp.append(x)\r\n\tn -= x\r\n\tx += 1\r\ndp[-1] += n\r\nprint(len(dp))\r\nprint(*dp)", "a=int(input())\r\nf=0\r\nd=[]\r\ni=1\r\nwhile a!=0:\r\n if a-i<i+1:\r\n d.append(a)\r\n a=0\r\n f+=1\r\n else:\r\n d.append(i)\r\n a-=i\r\n f+=1\r\n i+=1\r\nprint(f)\r\nprint(*d)", "n = int(input())\r\ni = 1\r\nans = []\r\nwhile n >= i:\r\n ans.append(i)\r\n n -= i\r\n i = i + 1\r\nans[len(ans) - 1] = ans[len(ans) - 1] + n\r\nprint(len(ans))\r\nprint(\" \".join(str(i) for i in ans))\r\n", "#753A\r\nn = int(input())\r\n#сначала количество мальчиков равно нулю;\r\ngiven = []\r\n\r\n#пока количество оставшихся конфет >= количетство мальчиков + 1\r\n #добавляем мальчика\r\n #даем ему конфеты;\r\n #заносим в список выданных конфет\r\n\r\nwhile n >= len(given) + 1:\r\n n -= len(given) + 1\r\n given.append(len(given) + 1)\r\n\r\ngiven[-1] += n\r\n \r\nprint(len(given))\r\n\r\nprint(\" \".join(map(str, given)))\r\n#последнему мальчику отдаем все оставшиеся конфеты\r\n#выводим размер списка\r\n#выводим список\r\n", "n = int(input())\r\nways = {}\r\nways[1] = (1, [1]); ways[2] = (1, [2])\r\nfor candy in range(3, n + 1):\r\n maxlength = 0\r\n for j in range(1, candy):\r\n left = candy - j\r\n if left in ways and j not in ways[left][1] and ways[left][0] + 1 > maxlength:\r\n maxlength = ways[left][0] + 1\r\n ways[candy] = (maxlength, ways[left][1][:] + [j])\r\ncount, candies = ways[n]\r\nprint(count)\r\nprint(*candies)\r\n", "import sys\r\nimport math\r\n\r\n# sys.stdin=open(\"D:/VSCODE/cp/input.txt\",\"r\")\r\n# sys.stdout=open(\"D:/VSCODE/cp/output.txt\",\"w\")\r\n\r\n# t=int(input())\r\nt=1\r\nfor testcase in range(1,t+1):\r\n \r\n n=int(input())\r\n l=[]\r\n sum=n;i=1\r\n while True:\r\n if sum-i > i:\r\n l.append(i)\r\n sum-=i\r\n i+=1\r\n else:\r\n break\r\n\r\n if(sum == 0):\r\n print(len(l))\r\n for it in l:\r\n print(it,end=\" \")\r\n print()\r\n else:\r\n print(len(l)+1)\r\n for it in l:\r\n print(it,end=\" \")\r\n print(sum)", "t=int(input())\r\nn=int(((1+8*t)**.5-1)//2)\r\nl=[i for i in range(1,n+1)]\r\nl[-1]+=t%(n*(n+1)//2)\r\nif t==2:l[-1]+=1\r\nprint(n,\"\\n\",*l)", "N = int(input())\nM = 0\nwhile (M + 1) * (M + 2) / 2 <= N :\n\tM += 1\nprint(M)\nfor i in range(1, M) :\n\tprint(i, end = ' ')\n\tN -= i\nprint(N)\t\n", "#!/usr/bin/env python3\n\n# ------------------------------\n# cs104c/assignment6/SantaClaus.py\n# Copyright (C) 2017\n# Drew Romanyk\n# ------------------------------\n\n# -------\n# imports\n# -------\n\nimport sys\n\n\n# -------\n# solve\n# -------\n\ndef solve(r, w):\n \"\"\"\n :param r:\n :param w:\n :return: print the eulcian path, or -1 if there is none\n \"\"\"\n santa_candy = int(r.readline())\n candy_for_kid_list = []\n\n # algo: go up by one, and give the leftovers to the last kid\n while santa_candy > len(candy_for_kid_list):\n candy_for_kid = len(candy_for_kid_list) + 1\n candy_for_kid_list += [candy_for_kid]\n santa_candy -= candy_for_kid\n\n # last kid gets the leftovers\n candy_for_kid_list[-1] += santa_candy\n print(len(candy_for_kid_list))\n print(*candy_for_kid_list)\n\n\n# -------\n# main\n# -------\n\nif __name__ == \"__main__\":\n solve(sys.stdin, sys.stdout)\n", "\n\nn = int(input())\ns = set()\n\ni = 1\nwhile i < n:\n if n-i > i:\n s.add(i)\n n -= i\n i += 1\n\nif n != 0: s.add(n)\nprint(len(s))\nprint(*s)\n", "import sys\r\nimport math\r\nZ = sys.stdin.readline\r\nn = int(Z().strip())\r\nN = int(math.sqrt(2*n + 0.25)-0.5)\r\nprint(N)\r\ns = N*(N+1)//2\r\nif n==s:\r\n print(' '.join(str(i) for i in range(1,N+1)))\r\nelse:\r\n print(' '.join(str(i) if i<N else str(N+(n-s)) for i in range(1,N+1)))", "n=int(input())\r\nr=[]\r\n\r\nfor i in range(1,50):\r\n if i>n:\r\n r[-1]+=n\r\n break\r\n else:\r\n r.append(i)\r\n n-=i\r\n\r\nprint(len(r))\r\nfor i in range(len(r)):\r\n print(r[i],end=\" \")", "import math\nx = int(input())\nn = int((-1 + math.sqrt(1 + 8 * x)) / 2)\nprint(n)\nif x <= 2:\n print(x)\n exit()\nli = []\ns = 0\nfor i in range(1, n):\n li += [i]\n s += i\nli.append(x - s)\nprint(*li)\n", "n = int(input())\r\ni = 0\r\na = []\r\nwhile n - i > 0:\r\n i += 1\r\n a.append(i)\r\n n -= i\r\na[-1] += n\r\nprint(len(a))\r\nfor x in a:\r\n print(x,end = ' ')", "n = int(input())\r\nans = 0\r\narr = []\r\nwhile ans < n:\r\n ans += 1\r\n arr.append(ans)\r\n n -= ans\r\narr[-1] += n\r\nprint(len(arr))\r\nprint(*arr)\r\n", "import sys\r\n\r\nn = int(input())\r\n\r\nnow = 1\r\na = []\r\n\r\nwhile (True):\r\n\tif (now+now>=n):\r\n\t\ta.append(n)\r\n\t\tbreak\r\n\ta.append(now)\r\n\tn-=now\r\n\tnow+=1\r\n\r\nprint(len(a))\r\nfor i in range(len(a)):\r\n\tprint(a[i])", "\r\n\r\n\r\n \r\n\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n nr = 1\r\n candies = []\r\n while (nr * (nr + 1)) // 2 < n:\r\n candies.append(nr)\r\n nr += 1\r\n if (nr * (nr + 1)) // 2 > n:\r\n nr -= 1\r\n if (nr * (nr + 1) // 2 == n):\r\n candies.append(nr)\r\n print(len(candies))\r\n print(\" \".join(map(str, candies)))\r\n return\r\n while True:\r\n if n - ((nr * (nr+1)) // 2) in candies:\r\n candies.remove(nr)\r\n nr -= 1\r\n else:\r\n candies.append(n - ((nr * (nr+1))) // 2)\r\n break\r\n\r\n print(len(candies))\r\n print(\" \".join(map(str, candies)))\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\nans = 0\ni = 1\na = []\nwhile ans != n:\n if ans + i < n:\n ans += i\n a.append(i)\n elif ans + i == n:\n a.append(i)\n print(len(a))\n print(*a)\n break\n else:\n del a[-1]\n a.append(n - sum(a))\n print(len(a))\n print(*a)\n break\n i += 1\n", "\r\ndef single():return input()\r\ndef multiple():return list(map(int, input().split()))\r\n\r\ndef findS(s): \r\n \r\n l = 1\r\n r = int(s / 2) + 1\r\n \r\n # Apply Binary search \r\n while (l <= r) : \r\n # Find mid \r\n mid = int((l + r) / 2) \r\n \r\n # find sum of 1 to mid natural numbers \r\n # using formula \r\n sum = int(mid * (mid + 1) / 2) \r\n \r\n # If sum is equal to n \r\n # return mid \r\n if (sum == s): \r\n return mid \r\n \r\n # If greater than n \r\n # do r = mid-1 \r\n elif (sum > s): \r\n r = mid - 1\r\n \r\n # else do l = mid + 1 \r\n else: \r\n l = mid + 1\r\n \r\n \r\n # If not possible, return -1 \r\n return -1\r\nn=int(single())\r\nx=[[0], [1], [2], [1,2], [1,3]]\r\nres=[]\r\nnearest=[3]\r\nl=1\r\nfor i in range(5,n+1):\r\n t=findS(i)\r\n \r\n if t==-1:\r\n curr=-1\r\n k=l-1\r\n while k:\r\n if i-nearest[k]>x[nearest[k]][-1]:\r\n curr=nearest[k]\r\n break \r\n k-=1\r\n if curr==-1:\r\n curr=i//2\r\n x.append(x[curr]+[i-curr])\r\n else:\r\n nearest.append(i)\r\n l+=1\r\n x.append([j for j in range(1, t+1)])\r\nprint(len(x[n]))\r\nfor i in x[n]:\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\r\n\r\n\r\n\"\"\"\r\nNumber of subsequneces of a string in the given string\r\n\"\"\"\r\n# word=\"rabbit\"\r\n# col=len(s)\r\n# l=len(word)\r\n# dp=[[0 for j in range(col+1)] for i in range(l)]\r\n# for i in range(1, col+1):\r\n# if word[0]==s[i-1]:\r\n# dp[0][i]=dp[0][i-1]+1\r\n# else:\r\n# dp[0][i]=dp[0][i-1]\r\n# for i in range(1,l):\r\n# for j in range(i+1, col+1):\r\n# if word[i]==s[j-1]:\r\n# if dp[i][j-1]==0:\r\n# dp[i][j]=1\r\n# else:\r\n# dp[i][j]=dp[i-1][j]+dp[i-1][j-1]\r\n# else:\r\n# dp[i][j]=dp[i][j-1]\r\n# # for i in dp:\r\n# # print(i)\r\n# print(dp[-1][-1])", "a=int(input())\r\nk=0\r\nl=0\r\nwhile a-l>k:\r\n k+=1\r\n l+=k\r\nprint(k)\r\nfor i in range(k-1):\r\n print(i+1,end=' ')\r\nprint(a-l+k)", "n = int(input())\r\nl = []\r\nfor i in range(1, 10 ** 10):\r\n if n >= i:\r\n n -= i\r\n else:\r\n break\r\nprint(i - 1)\r\nprint(*range(1, i - 1), i - 1 + n)", "n=int(input())\r\nout=[]\r\nbase=1\r\nwhile n>0:\r\n out.append(base)\r\n n-=base\r\n base+=1\r\n if n<base:\r\n out[-1]+=n\r\n n=0\r\nprint(len(out))\r\nprint(*out)", "n = int(input())\r\nl = 1\r\nr = 1000\r\nres = 0\r\n\r\nwhile l <= r:\r\n m = (l + r) // 2\r\n if m * (m + 1) // 2 <= n:\r\n res = m\r\n l = m + 1\r\n else:\r\n r = m - 1\r\nif res*(res+1) // 2 == n:\r\n print(res)\r\n print(*[i for i in range(1, res + 1)])\r\nelse:\r\n print(res)\r\n a = [i for i in range(1, res)]\r\n print(n - sum(a), *a)", "t=int(input())\r\nres=0\r\narr=[]\r\nwhile(t>res):\r\n res+=1\r\n t-=res\r\n arr.append(res)\r\nprint(len(arr))\r\nfor i in arr[:-1]:\r\n print(i,end=' ')\r\nprint(arr[-1]+t)", "def ii(): return int(input())\r\ndef fi(): return float(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef li(): return list(mi())\r\n\r\nn=ii()\r\ndup=n\r\ni,c=1,0 \r\nwhile(i<=n):\r\n n-=i \r\n i+=1 \r\n c+=1 \r\nl=[]\r\nfor i in range(1,c):\r\n l.append(i)\r\na=dup-sum(l)\r\nl.append(a)\r\nprint(c)\r\nprint(*l)", "n=int(input())\r\nl=[]\r\nfor i in range(1,2000):\r\n\tif((n-i)>i):\r\n\t\tn=n-i\r\n\t\tl.append(i)\r\n\telse:\r\n\t\tl.append(n)\r\n\t\tbreak\r\nprint(len(l))\r\nfor i in range(len(l)):\r\n\tprint(l[i],end=\" \")", "y=int(input())\r\nh=((((8*y+1)**0.5)-1)//2)\r\nl=[]\r\nc=0\r\nfor x in range(1,int(h)):\r\n c+=x\r\n l.append(x)\r\nl.append(y-c)\r\nprint(len(l))\r\nprint(*l)", "a=int(input())\r\nb=int((2*a)**(0.5))+1\r\nlis=[]\r\nfor i in range(1,b+1):\r\n lis.append(i)\r\n if (i*(i+1))/2>a:\r\n print(i-1)\r\n break\r\ni=0\r\nlis=lis[:-1]\r\nif sum(lis)<a:\r\n lis[-1]+=a-sum(lis)\r\nprint(\" \".join(map(str,lis)))\r\n", "n = int(input())\r\nans = []\r\ni = 0\r\nwhile i < n:\r\n i += 1\r\n ans.append(i)\r\n n -= i\r\nans[-1] += n\r\nprint(len(ans))\r\nprint(*ans)", "n = int(input())\r\na = []\r\ni = 1\r\nwhile i <= n:\r\n a.append(i)\r\n n -= i\r\n i += 1\r\n\r\na[-1] += n\r\nprint(len(a))\r\nprint(*a)", "n = int(input())\r\npp = []\r\nk = 0\r\nwhile n > 0 :\r\n k += 1\r\n n = n - k\r\n pp.append(str(k))\r\n if n <= len(pp):\r\n for j in range(len(pp)-1,-1,-1):\r\n if n == 0:\r\n break\r\n else:\r\n pp[j] = str(int(pp[j]) + 1)\r\n n = n - 1\r\nprint(len(pp))\r\nprint(' '.join(pp))", "n = int(input())\r\nk = 0\r\nans = ''\r\nwhile k * (k + 1) <= 2 * n:\r\n k += 1\r\nk -= 1\r\nprint(k)\r\nfor i in range(1, k):\r\n print(i, end=' ')\r\nprint(k + (n - k * (k + 1) // 2))\r\n \r\n", "n = int(input())\r\nc=1\r\nsol = []\r\nwhile n>c:\r\n n = n-c\r\n sol.append(c)\r\n c=c+1\r\nif n >= c:\r\n sol.append(n)\r\nelse:\r\n sol[-1] += n\r\nprint(len(sol))\r\nprint(*sol)\r\n", "q=int(input())\r\na=[1]\r\nq-=1\r\nl=1\r\nwhile q>a[l-1]:\r\n q-=l+1\r\n a.append(l+1)\r\n l+=1\r\na[l-1]+=q\r\nprint(len(a))\r\nfor i in a:\r\n print(i,end=' ')\r\n", "from sys import stdout\n\ndef solve():\n num = int(input().rstrip())\n total = 0\n ans = set()\n i = 1\n while True:\n if total+i <= num:\n ans.add(i)\n total += i\n i += 1\n else:\n i -= 1\n break\n if total < num:\n ans.remove(i)\n ans.add(num-total+i)\n print(len(ans))\n for i in ans:\n stdout.write(str(i)+' ')\n stdout.write('\\n')\n\nif __name__ == '__main__':\n solve()\n", "from sys import stdin\r\nimport math\r\n\r\nA = int(stdin.readline())\r\nB = math.floor((-1+math.sqrt(8*A+1))/2)\r\nC = A - int(B*(B+1)/2)\r\n\r\nprint(B)\r\nfor t in range(0,B-1):\r\n print(t+1,end=' ')\r\n\r\nprint(B+C)", "n = int(input())\r\nans = list()\r\ni = 1\r\nwhile 1:\r\n\tif n < i :\r\n\t\tbreak\r\n\tn-=i \r\n\tans.append(i)\r\n\ti +=1\r\nans[len(ans)-1] += n\r\nprint(len(ans))\r\nfor i in ans :\r\n\tprint(i,end=' ')\r\n", "\r\nt = int(input())\r\nt0=t\r\ns=[]\r\nf=0\r\nfor i in range(1,t+1):\r\n if t-i>i:\r\n s.append(i)\r\n t-=i\r\n f+=1\r\n else:\r\n break\r\n\r\nif sum(s)!=t0:\r\n f+=1\r\n s.append(t)\r\nprint(f)\r\nprint(*s)\r\n \r\n", "a = int(input())\r\nm = []\r\nb = 0\r\nv = 0\r\nwhile v < a:\r\n b += 1\r\n m.append(b)\r\n v = v + b\r\n if a < v + b + 1:\r\n m[b - 1] = m[b - 1] + (a - v)\r\n break\r\nprint(b)\r\nprint(*m)", "n = int(input())\n\ncount = 0\nl = []\n\nfor i in range(1,101):\n\tif n>=i: n -= i ; count += 1 ; l.append(i)\n\telse: break\nl[-1] += n\n\nprint(count)\nfor i in l: print(i, end=\" \")\nprint()", "\r\nn = int(input())\r\nres = []\r\ni = 1\r\nwhile i <= n:\r\n res.append(i)\r\n n -= i\r\n i += 1\r\nres[-1] += n if n < i else 0\r\nprint(len(res))\r\nprint(*res)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ni = 1\r\nd = []\r\nwhile n:\r\n n -= i\r\n if n - i - 1 < 0:\r\n d.append(n+i)\r\n break\r\n d.append(i)\r\n i += 1\r\nprint(len(d))\r\nprint(' '.join(map(str, d)))", "import math\r\n\r\na = int(input())\r\nn = int((-1 + math.sqrt(1 + 8 * a)) / 2)\r\n\r\nprint(n)\r\n\r\nfor i in range(1, n):\r\n print(i, end=' ')\r\n\r\nprint(a - n * (n-1) // 2, end='')", "n=int(input())\r\n\r\nans=0\r\nl1=[]\r\ni=1\r\nwhile n>0:\r\n if n-i>=0:\r\n l1.append(i)\r\n n-=i\r\n i+=1\r\n else:\r\n l1[-1]+=n\r\n break\r\nprint(len(l1))\r\n\r\nfor i in l1:\r\n print(i,end=\" \")\r\n \r\n \r\n \r\n ", "def f(n):\n k = 0\n tn = 2*n\n while k*k < tn:\n k += 1\n k -= 1\n # possibly an overshoot\n if n < ((k+1)*k)//2:\n k -= 1\n return k\n\ndef g(n,k):\n s = \"\"\n for i in range(1, k):\n s += str(i) + ' '\n s += str(n - ((k*(k-1))//2))\n return s\n\n\ndef run():\n i = 0\n for line in iter(input, ''):\n n = int(line)\n break\n k = f(n)\n print(k)\n print(g(n,k))\n\n\nrun()", "NUMBERS = 45\r\nn = int(input())\r\n\r\nsums = [0] * NUMBERS\r\nsums[0] = 1\r\nfor i in range(1, NUMBERS):\r\n sums[i] = sums[i - 1] + i + 1\r\n if n < sums[i]:\r\n print(i)\r\n for j in range(i - 1):\r\n print(j + 1, end=\" \")\r\n print(n - sums[i - 2])\r\n break", "n = int(input())\r\n\r\nMas = [0] + []\r\ni = 1\r\nwhile len(Mas) <= n:\r\n Mas += [i]*(i+1)\r\n i += 1\r\n\r\nNumb = [0] * Mas[-1]\r\nfor i in range(Mas[-1]-1):\r\n Numb[i] = i+1\r\n\r\nNumb[-1] = n - sum(Numb)\r\nprint(Mas[-1])\r\nprint(*Numb)", "candy_cnt = int(input())\r\n\r\nlist_to_start = []\r\nfor i in range(1, 1000):\r\n test_list = [y for y in range(0, i)]\r\n if sum(test_list) > candy_cnt:\r\n list_to_start = test_list[:-1]\r\n break\r\n\r\nstart_point = sum(list_to_start)\r\ndif = candy_cnt - start_point\r\nif dif > 0:\r\n for add in range(1, dif + 1):\r\n for pos in range(len(list_to_start)):\r\n if list_to_start[pos] + 1 not in list_to_start:\r\n list_to_start[pos] += 1\r\n break\r\n\r\nprint(len(list_to_start)-1)\r\nprint(\" \".join([str(s) for s in list_to_start[1:]]))", "n = int(input())\r\n\r\na = []\r\nfor i in range(1,n+1):\r\n if n - i >= 0:\r\n a.append(i)\r\n n -= i\r\n\r\nfor j in range(1,n+1):\r\n if n - j >= 0:\r\n a[-j] += 1\r\nprint (len(a))\r\nprint (*a)", "import math\r\n\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n for k in range(n + 1):\r\n x = (- 1 + math.sqrt(1 + 8 * (n - k))) / 2\r\n if x == math.ceil(x) and x + 1 > k and x > 0:\r\n x = int(x)\r\n a = k\r\n break\r\n print(x)\r\n for i in range(1, x):\r\n print(i, end=\" \")\r\n print(x + a)\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "n = int(input())\r\nl = []\r\n\r\ndef foo():\r\n global l\r\n global n\r\n for i in range(1, n + 1):\r\n if i in l:\r\n continue\r\n l.append(i)\r\n n = n - i\r\n foo()\r\n if n == 0:\r\n return\r\n elif len(l) > 0:\r\n n = n + l[len(l) - 1]\r\n del(l[len(l) - 1])\r\n\r\nfoo()\r\nprint(len(l))\r\nfor i in l:\r\n print(i, end=\" \")", "import sys\n\nnum_candies = int(sys.stdin.readline())\n\nsum_candies = 1\ncandies = []\nfor n in range(2, 50):\n sum_candies += n\n if sum_candies <= num_candies:\n candies.append(n - 1)\n else:\n candies.append(num_candies - sum(candies))\n break\nprint(len(candies))\nprint(' '.join(map(str, candies)))\n", "import sys\r\n\r\ndef giveCandies(candies):\r\n used = set()\r\n num = 1\r\n\r\n while candies > 0:\r\n used.add(num)\r\n if candies - num in used:\r\n used.remove(num)\r\n used.add(candies)\r\n candies = 0\r\n else:\r\n candies -= num\r\n num += 1\r\n\r\n print(len(used))\r\n for num in used:\r\n print(num, end = \" \")\r\n\r\n\r\ndef main():\r\n #sys.stdin = open('t1.txt', 'r')\r\n candies = 0\r\n for line in sys.stdin:\r\n candies = int(line)\r\n giveCandies(candies)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\ni=0\r\nwhile int(i*(i+1)/2) <= n:\r\n i+=1\r\ni-=1\r\nprint(i)\r\na=[]\r\nfor j in range(i-1):\r\n print(j+1,end=\" \")\r\n a.append(j+1)\r\nprint(n-sum(a))", "n = int(input())\n\ns = 0\ncurrent = 1\nwhile (s + current) <= n:\n s += current\n current += 1\n\nprint(current - 1)\nfor i in range(1, current-1):\n print(i, end=\" \")\n n -= i\n\nprint(n)\n\n", "n = int(input())\r\n\r\nfor i in range(1, n + 1):\r\n if (i * (i + 1)) / 2 == n:\r\n j = 1\r\n break\r\n \r\n elif(i * (i + 1)) / 2 > n:\r\n j = 0\r\n break\r\n\r\nSum = []\r\n\r\nif j:\r\n for i in range(1, i + 1):\r\n Sum.append(i)\r\nelse:\r\n for i in range(1, i):\r\n Sum.append(i)\r\n \r\n Sum[-1] = Sum[-1] + int(n - (i * (i + 1)) / 2)\r\n\r\nprint(len(Sum))\r\nfor num in Sum:\r\n print(num, end=\" \")", "import math\nnum = int(input())\nmaxp = int((-1+math.sqrt(1+8*num))/2)\nprint(maxp)\nfor i in range(1, maxp):\n print(i, end = ' ')\nprint(int(num - maxp*(maxp-1) / 2))", "import math\r\n\r\n\r\nn = int(input())\r\nt = int(math.sqrt(2 * n + 0.25) - 0.5)\r\nans = list(range(t + 1)[1:])\r\nans[-1] += n - t * (t + 1) // 2\r\nprint(t)\r\nprint(*ans)\r\n", "n = int(input())\r\n\r\ni = 1\r\n\r\nwhile i * (i + 1) // 2 < n:\r\n i += 1\r\n\r\nif i * (i + 1) // 2 == n:\r\n print(i)\r\n print(*list(range(1, i + 1)))\r\nelse:\r\n print(i - 1)\r\n d = n - (i - 1) * i // 2\r\n a = list(range(1, i))\r\n print(*a[:-1] + [a[-1] + d])", "import math\r\nn = int(input())\r\nx = math.floor((- 1 + math.sqrt(1 + 8 * n)) / 2)\r\nans = [i for i in range(1, x)] + [n - (x * (x - 1)) // 2]\r\nprint(len(ans))\r\nprint(*ans)\r\n", "from math import *\r\ndef Main(n):\r\n sm = 0\r\n A = []\r\n for i in range(1,n + 1):\r\n sm += i\r\n A.append(i)\r\n if(sum(A) == n):\r\n break\r\n elif(sum(A) > n):\r\n break\r\n # print(A)\r\n rez = abs(n - sum(A))\r\n\r\n if rez in A:\r\n value_index = A.index(rez)\r\n A.pop(value_index)\r\n\r\n print(len(A))\r\n print(*A)\r\n\r\n\r\n # print(int(sqrt(n)))\r\n # if n%2 == 1:\r\n # res = n//2\r\n # print(res, end = \" \")\r\n # for i in range(res - 1, 1, -1):\r\n # print(i, end = ' ')\r\n # print()\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n Main(n)", "n = int(input())\r\ni = 0\r\ncounter = 0\r\nwhile True:\r\n i += 1\r\n counter += i\r\n if (counter < n) and (counter + i + 1 > n):\r\n break\r\n if counter > n:\r\n counter -= i\r\n break\r\n\r\nk = [j for j in range(1, i)]\r\nif n-counter > 0:\r\n k.append(n - sum(k))\r\nprint(len(k))\r\nprint(*k)", "fast=lambda:stdin.readline().strip()\nzzz=lambda:[int(i) for i in fast().split()]\nz,zz=input,lambda:list(map(int,z().split()))\nszz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())\nfrom re import *\nfrom sys import *\nfrom math import *\nfrom heapq import *\nfrom queue import *\nfrom bisect import *\nfrom string import *\nfrom itertools import *\nfrom collections import *\nfrom math import factorial as f\nfrom bisect import bisect as bs\nfrom bisect import bisect_left as bsl\nfrom collections import Counter as cc\nfrom itertools import accumulate as ac\ndef lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))\ndef output(answer):stdout.write(str(answer))\n###########################---Test-Case---#################################\n\"\"\"\n\n If you think, You Know me, Then you probably don't know me !\n\n\n\"\"\"\n###########################---START-CODING---##############################\n\n\ns=int(z())\nif s==1:\n exit(print(\"1\\n1\"))\narr=[]\nt=0\n\nfor i in range(1,s):\n t+=i\n\n if t>s:\n break\n else:\n arr.append(i)\n\nif sum(arr)==s:\n print(len(arr))\n print(*arr)\nelse:\n print(len(arr))\n print(*arr[:-1],arr[-1]+(s-sum(arr)))\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "S = int(input())\r\n\r\n\r\ndp = [0 for i in range(S+1)]\r\ns = 0\r\nfor k in range(1, S+1):\r\n s += k\r\n if s > S:\r\n break\r\n dp[s] = k\r\n\r\ncur = 0; inx0 = 0\r\nfor i in range(S+1):\r\n # cur = max(dp[i],cur)\r\n if dp[i] > cur:\r\n cur = dp[i]\r\n inx0 = i\r\n if dp[i] == 0:\r\n dp[i] = cur\r\n\r\n\r\nprint(dp[S]) # \"макс, кол-во: \", \r\ntmp = [i for i in range(1, dp[inx0])]\r\nres = tmp + [S - sum(tmp)]\r\nprint(*res)", "n = int(input())\r\nans = []\r\ni = 1\r\nwhile n > 0:\r\n if n - i > i:\r\n ans.append(i)\r\n n -= i\r\n else:\r\n ans.append(n)\r\n n -= n\r\n i += 1\r\nprint(len(ans))\r\nprint(*ans)", "n = int(input())\r\nx = int(((8*n+1)**0.5 - 1)//2) \r\nm = [i for i in range(1, x+1)]\r\nm[-1] += n - x*(x+1)//2\r\nprint(x)\r\nprint(*m)", "import math\r\n\r\nn = int(input())\r\nd = {1: [1, 1], 2: [1, 2]}\r\n\r\nif n <= 2:\r\n print(d[n][0])\r\n print(*d[n][1:])\r\nelse:\r\n numCount = int(math.sqrt(2 * n))\r\n nums = [i for i in range(1, numCount)]\r\n\r\n n -= sum(nums)\r\n\r\n while n - nums[-1] > n/2:\r\n nums.append(nums[-1] + 1)\r\n n -= nums[-1]\r\n\r\n if n > nums[-1]:\r\n nums.append(n)\r\n elif n <= nums[-1]:\r\n nums[-1] += n\r\n\r\n print(len(nums))\r\n print(*nums)", "import math\n\nclass Solution(object):\n def __init__(self):\n pass\n\n def sol(self, n):\n return self.sum(n, 1)\n\n def sum(self, n, k):\n if n == 0:\n return []\n if n < 0 and n < k:\n return None\n\n for i in range(k, n + 1):\n r = self.sum(n - i, i + 1)\n if r is not None:\n r.append(i)\n return r\n return None\n\n\ndef main():\n n = int(input())\n sol = Solution()\n r = sol.sol(n)\n if not r:\n return 0\n print(len(r))\n print(' '.join(map(lambda x: str(x), r)))\n return 0\n\n\nif __name__ == '__main__':\n main()", "\r\nn = int(input())\r\nl = list(range(1,51))\r\nt = 0\r\nfor i in l:\r\n t += i \r\n if t>n:\r\n break\r\nprint(i-1)\r\nprint(*(l[:i-2]+[n-t+i+i-1]))\r\n", "n=int(input())\r\nif n==1:\r\n print(1)\r\n print(1)\r\nelse:\r\n arr=[]\r\n for i in range(1,n):\r\n if i*(i+1)<=2*n:\r\n arr+=[i]\r\n k=arr[-1]\r\n a=[i for i in range(1,k)]\r\n lastdig=n-sum(a)\r\n a+=[lastdig]\r\n print(k)\r\n print(*a)", "n = int(input())\r\ni = 1\r\ns = []\r\nwhile n != 0:\r\n\tif n < i:\r\n\t\ts[-1] += n \r\n\t\tn = 0\r\n\telse:\r\n\t\ts.append(i)\r\n\t\tn -= i\r\n\t\ti += 1\r\nprint(len(s))\r\nprint(\" \".join(map(str, s)))\r\n", "sums = lambda n: n * (n + 1) // 2\r\n\r\n\r\ndef get_maximum(n):\r\n for i in range(0, 1000):\r\n if sums(i) > n:\r\n return i - 1\r\n\r\n\r\nnumber = int(input())\r\nmaxi = get_maximum(number)\r\n_list_ = [i for i in range(1, maxi)] + [number - sums(maxi - 1)]\r\nprint(maxi)\r\nprint(*_list_)\r\n", "n = int(input())\n\ni=1\ncurrent = []\nwhile n >= i:\n\tcurrent.append(i)\n\tn -= i\n\ti += 1\ncurrent[-1] += n\n\nprint(len(current))\nprint(*current)\n", "def sum(end):\r\n return end * (end + 1) / 2\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\r\n inpt = input().split()\r\n n = int(inpt[0])\r\n\r\n start = 1\r\n end = start - 1\r\n\r\n while sum(end + 1) <= n:\r\n end += 1\r\n\r\n numbers = [x for x in range(1, end)]\r\n\r\n print(end)\r\n\r\n numbers.append(end if sum(end) == n else int(n - sum(end - 1)))\r\n\r\n print(' '.join([str(x) for x in numbers]))\r\n", "if __name__ == \"__main__\":\n\tn = int(input())\n\tbag = []\n\tst = 1\n\tn-=1\n\tbag.append(1)\n\ttp = n+1\n\twhile n>0:\n\t\tst+=1\n\t\tn-=st\n\t\tif n>=0:\n\t\t\tbag.append(st)\n\tbag[-1]+=abs((tp-sum(bag)))\n\tprint(len(bag))\n\tprint(*bag)\n", "number = int(input())\r\nn = int((1+(1+8*(number))**(1/2))/2)\r\nn -= 1\r\nprint(n)\r\nans = []\r\nfor i in range(n-1):\r\n ans.append(str(i+1))\r\nans.append(str(number - (n-1)*(n)//2))\r\nprint(' '.join(ans))", "n=int(input())\r\n\r\ns=0\r\nval=1\r\nl=[]\r\nwhile 1:\r\n \r\n s+=val\r\n if(n-s<=val):\r\n s-=val\r\n l.append(n-s)\r\n break\r\n l.append(val)\r\n val+=1\r\nprint(len(l))\r\nprint(\" \".join(map(str,l)))", "n = int(input())\r\n\r\ncount = 0\r\ni = 1\r\n\r\narr = []\r\n\r\nwhile n >= i :\r\n count += 1\r\n n -= i\r\n arr.append(i)\r\n i += 1\r\n\r\narr[-1] += n\r\n\r\nprint(len(arr))\r\nprint(*arr)", "from math import floor\r\n\r\ndef f(x):\r\n return 0.5 * (-1 + (8*x+1)**0.5)\r\n\r\nn = int(input())\r\nnum_children = floor(f(n))\r\nprint(num_children)\r\nfor i in range(1, num_children+1):\r\n if i == num_children:\r\n print(n - int(0.5*num_children*(num_children+1)) + num_children)\r\n else:\r\n print(i, end=' ')", "n, a, i = int(input()), [], 1\nwhile i <= n: a += [i]; n -= i; i += 1\na[-1] += n\nprint(len(a), '\\n', *a)\n\t", "inp = int(input())\r\nr = []\r\ncurrent_n = 0\r\nwhile sum(r) < inp:\r\n current_n += 1\r\n if sum(r) + current_n + 1 >= inp:\r\n current_n = inp - sum(r)\r\n r.append(current_n)\r\n\r\nR = set(r)\r\nif len(r) != len(R):\r\n g = r[len(r)-1]\r\n r[len(r)-2] += g\r\n r.pop(len(r)-1)\r\n\r\nprint(len(r))\r\nprint(*r)", "a=int(input())\r\nb=0\r\nn=\"\"\r\ndef pedy(x,m):\r\n global b,n\r\n if x-m>m:\r\n x=x-m\r\n b=b+1\r\n n=n+str(m)+\" \"\r\n m=m+1\r\n pedy(x,m)\r\n else:\r\n b=b+1\r\n n=n+str(x)\r\npedy(a,1)\r\nprint(b)\r\nprint(n)\r\n", "n=int(input())\r\nls=[]\r\nif n>1:\r\n for i in range(1, n):\r\n if n - i >= i + 1:\r\n ls.append(i)\r\n # print(i,end=\" \")\r\n n -= i\r\n else:\r\n ls.append(n)\r\n # print(n)\r\n print(len(ls))\r\n print(*ls)\r\n exit(0)\r\nelse:\r\n print(1)\r\n print(1)", "n = int(input())\r\nk = int(((8 * n + 1) ** .5 - 1) / 2)\r\nprint(k)\r\nprint(*range(1, k), n - k * (k - 1) // 2)", "import sys\r\nimport math\r\nfrom collections import defaultdict as ddict\r\nfrom collections import deque\r\nimport heapq\r\nfrom queue import Queue\r\n\r\nfast_inp = lambda: sys.stdin.readline().split('\\n')[0]\r\nread_list = lambda: fast_inp().split(' ')\r\nread_listi = lambda: list(map(int, fast_inp().split(' ')))\r\nread_listf = lambda: list(map(float, fast_inp().split(' ')))\r\nread_int = lambda: int(fast_inp())\r\nread_float = lambda: float(fast_inp())\r\nread = lambda: fast_inp()\r\nDEBUG = True\r\n\r\n\r\ndef debug(**kwargs):\r\n if not DEBUG:\r\n return\r\n print('*' * 20)\r\n for k, v in kwargs.items():\r\n print(f'\\t{k}:{v}\\t')\r\n print('*' * 20)\r\n\r\n\r\ndef solve() -> None:\r\n n = read_int()\r\n s = 0\r\n i = 1\r\n while s < n:\r\n s += i\r\n i += 1\r\n if s == n:\r\n print(i - 1)\r\n print(*list(range(1, i)))\r\n else:\r\n l = list(range(1, i-1))\r\n l[-1] += n - (s - (i - 1))\r\n print(len(l))\r\n print(*l)\r\n\r\n\r\nt = 1\r\nfor _ in range(t):\r\n solve()", "# CF 753/A\n# 1100\ndef f(n):\n s = 0\n count = 0\n for i in range(1, n + 1):\n s += i\n count += 1\n if s >= n:\n break\n\n return [j for j in range(1, count + 1) if j != (s - n)]\n\nassert f(2) == [2]\nassert f(5) == [2, 3]\n\nn = int(input().strip())\nans = f(n)\nprint(len(ans))\nprint(\" \".join(map(str, ans)))\n", "n, a, i = int(input()), [], 1\r\nwhile i <= n: a += [i]; n -= i; i += 1\r\na[-1] += n\r\nprint(len(a), '\\n', *a)\r\n\t", "n = int(input())\r\n\r\ni = 1\r\nA = []\r\nwhile True:\r\n\tx = n - i\r\n\tif x > i:\r\n\t\tA.append(i)\r\n\t\tn -= i\r\n\telse:\r\n\t\tA.append(n)\r\n\t\tbreak\r\n\ti += 1\r\n\r\nprint(len(A))\r\n\r\nfor k in range(len(A)):\r\n\tprint(A[k], end=' ')", "from collections import deque as d\r\n\r\nn = int(input())\r\nf = 1\r\nl = d()\r\n\r\nwhile n >= f:\r\n if n-f*2-1 < 0:\r\n l.append(n)\r\n break\r\n l.append(f)\r\n n -= f\r\n f += 1\r\nprint(len(l))\r\nfor i in l:\r\n print(i)\r\n \r\n", "n = int(input())\r\ns = 0\r\nm = []\r\ni = 1\r\nwhile True:\r\n s += i\r\n m.append(i)\r\n i += 1\r\n if s >= n:\r\n break\r\nif s == n:\r\n print(len(m))\r\n for e in m:\r\n print(e, end=' ')\r\nelse:\r\n del m[m.index(s - n)]\r\n print(len(m))\r\n for e in m:\r\n print(e, end=' ') ", "n=int(input())\r\nk=1\r\nwhile 1:\r\n k+=1\r\n if ((k*(k+1))//2)>n:\r\n break\r\nk-=1\r\nans=[]\r\nfor i in range(1,k):\r\n ans.append(i)\r\nans.append(n-((k-1)*k)//2)\r\nprint(k)\r\nprint(*ans)", "import sys\r\ninput = sys.stdin.readline\r\nimport math\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\nn=int(input())\r\ni=1\r\na=[]\r\nwhile i<=n:\r\n\ta.append(i)\r\n\tn-=i;i+=1\r\na[-1]+=n\r\nprint(len(a))\r\nprint(\" \".join(str(x)for x in a))", "n=int(input())\r\nll=[]\r\nif n>2:\r\n i=1\r\n while 2*i<n:\r\n ll.append(i)\r\n n-=i\r\n i+=1\r\n if n>0:\r\n ll.append(n)\r\nelse:\r\n print(1)\r\n print(n)\r\n exit()\r\nprint(len(ll))\r\nprint(*ll)\r\n", "n=int(input())\r\nm=n\r\ncount=0\r\narr=[]\r\n\r\nif n==1:\r\n print(1)\r\n print(1)\r\nelse:\r\n for i in range(1,n):\r\n if m-i>=0:\r\n count+=1\r\n m-=i\r\n arr.append(i)\r\n arr[len(arr)-1]+=m\r\n print(count)\r\n print(*arr)", "n = int(input())\r\n\r\ndp = [0, n]\r\n\r\nextend = True\r\n\r\nwhile extend == True:\r\n temp = dp[-1] - (len(dp) - 1)\r\n if temp > len(dp) - 1:\r\n dp.append(temp)\r\n else:\r\n extend = False\r\n\r\nprint(len(dp) - 1)\r\nres = \"\"\r\n\r\nfor i in range(0, len(dp) - 2):\r\n res = res + str(i + 1) + \" \"\r\n\r\nres = res + str(dp[len(dp) - 1])\r\n\r\nprint(res)", "\r\ndef main():\r\n n=int(input())\r\n a=[]\r\n for i in range(1,1000):\r\n if i<=n:\r\n a.append(i)\r\n n-=i\r\n else:\r\n a[len(a)-1]+=n\r\n break\r\n print(len(a))\r\n for i in a: print('%d ' % i,end='')\r\n print()\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "def solve(n):\n track = []\n dp = [0] * (n+1)\n\n if n == 1 or n == 2:\n print(1)\n print(n)\n return\n\n for i in range(n-1,0,-1):\n track.append(i)\n for j in range(1,i):\n track.append(j)\n\n if sum(track) < n:\n continue\n elif sum(track) == n:\n if len(track) > dp[i]:\n dp[i] = len(track)\n ans = track[:]\n\n else:\n\n break\n\n track = []\n\n print(len(ans))\n print(\" \".join(map(str, ans)))\n\n\nif __name__ == '__main__':\n n = int(input())\n\n\n solve(n)", "n=int(input())\r\nfor i in range(1,1001):\r\n if (i*(i+1))//2>=n:break\r\nn1=(i*(i+1))//2\r\ndiff=n1-n;ans=[]\r\nfor i in range(1,i+1):\r\n if i!=diff:ans.append(i)\r\n\r\nprint(len(ans))\r\nprint(*ans)\r\n", "n=int(input())\r\na=[]\r\nc=0\r\nx=1\r\nwhile((sum(a)+x)<=n):\r\n a.append(x)\r\n x+=1\r\n c+=1\r\nif(sum(a)==n):\r\n print(c)\r\n print(*a)\r\nelse:\r\n a[-1]=n-sum(a[:-1])\r\n print(c)\r\n print(*a)\r\n", "from math import sqrt, floor\n\nn = int(input())\n# (1 + x)*x/2 = n\n# x^2 + x - 2n = 0\n# D = 1 + 8n\nres = floor((-1 + sqrt(1 + 8 * n)) / 2)\nprint(res)\nx = res\nres = [i for i in range(1, res + 1)]\nres[-1] += (n - (1 + x)*x//2)\nprint(*res)\n", "n = int(input())\r\nl = []\r\nw = 0\r\nsm = 0\r\nwhile True:\r\n w += 1\r\n sm += w\r\n if sm<n+1:\r\n l.append(w)\r\n else:\r\n break\r\nsm -= w\r\nl[-1] = n - sm + l[-1]\r\nprint(len(l))\r\ns = \"\"\r\nfor i in l:\r\n s += \" \"+str(i)\r\nprint(s[1:])\r\n \r\n", "a = int(input())\r\nflag = True\r\narr = [0 for i in range(50)]\r\nacc = 0\r\ni = 1\r\nwhile (flag == True):\r\n if (acc+i<=a):\r\n arr[i-1]=i\r\n acc += i\r\n i+= 1\r\n else:\r\n arr[i-2]+=a-acc\r\n i-=2\r\n flag = False\r\nprint (i+1)\r\nfor j in range (0,i+1):\r\n print (arr[j],end = ' ')", "n=int(input())\r\nans=[]\r\nt=n\r\nfor i in range(1,n+1):\r\n if i==1:\r\n ans=[1]\r\n t-=1\r\n elif t>=i:\r\n ans.append(i)\r\n t-=i\r\n else:\r\n ans[-1]+=t\r\n t=0\r\n if t==0:\r\n break\r\nprint(len(ans))\r\nprint(*ans)", "n = int(input())\r\n\r\nanswer = [1];\r\ni = 1;\r\ntotal = 1;\r\n\r\nwhile 1:\r\n next = i+1;\r\n if total + next > n:\r\n break;\r\n\r\n i = next;\r\n total += i;\r\n answer.append(i);\r\n\r\nlast = len(answer)-1;\r\nanswer[last] += n - total;\r\n\r\nprint(len(answer));\r\n\r\nfor a in answer :\r\n print(a, sep = ' ', end = ' ');\r\n ", "n = int(input())\r\nsett = set()\r\n\r\nz = 1\r\nn -= 1\r\nsett.add(1)\r\nwhile z+1 <= n:\r\n\tsett.add(z+1)\r\n\tz += 1\r\n\tn -= z\r\n\t# print(z, n)\r\n\t# print(*sett)\r\nif n:\r\n\tsett.remove(z)\r\n\tsett.add(z+n)\r\n\tprint(len(sett))\r\n\tprint(*sett)\r\nelse:\r\n\tprint(len(sett))\r\n\tprint(*sett)\r\n\r\n# print(n)\r\n", "n = int(input())\r\n\r\nans = []\r\ncur = 1\r\ntotal = 0\r\nwhile total + 2 * cur + 1 <= n:\r\n #print( total + 2 * cur + 1, cur, total)\r\n ans.append(str(cur))\r\n cur += 1\r\n total += cur-1\r\n \r\nans.append(str(n-total))\r\nprint(len(ans))\r\nprint(' '.join(ans))\r\n \r\n", "from collections import defaultdict\r\nfrom sys import stdin, stdout\r\nimport math \r\nn=int(input())\r\ntemp=x=(-1+math.sqrt(1+(8*n)))/2\r\nprint(int(temp))\r\nif(int(temp)==temp):\r\n for i in range(1,int(temp)+1):\r\n print(i,end=\" \")\r\nelse:\r\n for i in range(1,int(temp)):\r\n print(i,end=\" \")\r\n t=int(temp)-1\r\n val=(t*(t+1))//2\r\n print(n-val)", "n=int(input())\r\n \r\na=[]\r\n \r\nwhile n>len(a):\r\n \r\n\ta+=[len(a)+1]\r\n \r\n\tn-=a[-1]\r\n \r\na[-1]+=n\r\n \r\nprint(len(a))\r\n \r\nprint(*a)", "n = int(input()); ans = 0; i = 1\r\nans1 = []\r\nwhile ans + i <= n:\r\n ans += i\r\n ans1.append(i)\r\n i += 1\r\nans1[-1] = ans1[-1]+(n-sum(ans1))\r\nprint(len(ans1))\r\nprint(*ans1)", "n = int(input());\r\ns=[]\r\nt=0\r\nnums=[int(i) for i in range(1,n+1)]\r\n\r\nfor i in range(1,n+1):\r\n d = sum(nums[:i])\r\n if(d<=n):\r\n t=nums[:i]\r\n \r\n\r\n \r\nt[-1]+=(n-sum(t))\r\n\r\nprint(len(t))\r\nprint(*t)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\n\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n\r\n ans = []\r\n sm = 0\r\n for i in range(1,n+1):\r\n sm+=i\r\n ans.append(i)\r\n if sm>=n:\r\n break\r\n # print(ans)\r\n # total = \r\n if sm==n:\r\n print(len(ans))\r\n print(*ans)\r\n else:\r\n\r\n sm = sum(ans)-n\r\n ans.remove(sm)\r\n print(len(ans))\r\n print(*ans)\r\n\r\n\r\n\r\nsolve()\r\n\r\n", "n=int(input())\r\nk=((8*n+1)**0.5-1)/2\r\nk=int(k)\r\ndiff=n-k*(k+1)//2\r\n#print(diff)\r\nprint(k)\r\nfor i in range(1,k):\r\n print(i,end=\" \")\r\nprint(k+diff)", "n = int(input())\r\nk = int((2*n)**0.5) - 1\r\nwhile k*(k+1) <= 2*n:\r\n k += 1\r\n\r\nk -= 1\r\nq = n-k*(k+1)//2\r\nprint(k)\r\nfor i in range(1, k):\r\n print(i, end=\" \")\r\nprint(k+q)\r\n", "n = int(input())\r\ni = 1\r\nres = []\r\nwhile True:\r\n if i > n:\r\n res[-1] += n\r\n n = 0\r\n break\r\n res.append(i)\r\n n -= i\r\n i += 1\r\n\r\nprint(len(res)) \r\nprint(*res)", "n = int(input())\r\ns = 0\r\nidx = -1\r\nfor i in range(1, n + 1):\r\n s += i\r\n if s > n:\r\n break\r\n idx = i\r\n\r\nprint(idx)\r\ns = 0\r\nfor i in range(1, idx):\r\n s += i\r\n print(i, end=' ')\r\nif n - s != 0:\r\n print(n - s)", "#!/usr/bin/env python3\r\n\r\ndef main():\r\n try:\r\n while True:\r\n t = n = int(input())\r\n result = 0\r\n i = 1\r\n while n >= i:\r\n n -= i\r\n i += 1\r\n result += 1\r\n print(result)\r\n for i in range(1, result):\r\n print(i, end=' ')\r\n print(t - sum(range(result)))\r\n\r\n except EOFError:\r\n pass\r\n\r\nmain()\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\ninp = lambda: list(map(int,input().split()))\r\nn = int(input())\r\na = [1]\r\ni = 1\r\nn-=1\r\nwhile(n>0):\r\n i = min(n,i+1)\r\n if i>a[-1]:\r\n a.append(i)\r\n n-=i\r\n else:\r\n temp = a[-1]\r\n a[temp-i]+=i\r\n break\r\nprint(len(a))\r\nprint(*a)", "m = int(input())\r\n\r\nl = []\r\nfor i in range(1,100):\r\n l.append(i*(i+1)//2)\r\n\r\np,j=0,0\r\nif m==1:\r\n print(1)\r\n print(1)\r\n exit()\r\nfor i in range(100):\r\n if m<l[i]:\r\n p = l[i-1]\r\n j=i\r\n break\r\n\r\nprint(j)\r\nl1 = []\r\np = m-p\r\nfor i in range(1,j+1):\r\n l1.append(i)\r\n\r\nfor i in range(j):\r\n if p>0:\r\n l1[j-i-1]+=1\r\n p-=1\r\nprint(*l1)", "n=int(input())\r\na=[]\r\ns=0\r\nfor i in range(1,n+1):\r\n\ta.append(i)\r\n\ts+=i\r\n\tif(s==n):\r\n\t\tbreak\r\n\telif(s>n):\r\n\t\t# print(a)\r\n\t\ttemp=s-n\r\n\t\ta[len(a)-1]-=temp\r\n\t\ta[len(a)-2]+=a[len(a)-1]\r\n\t\ta.remove(a[len(a)-1])\r\n\t\tbreak\r\nprint(len(a))\r\nprint(*a)", "n = int(input())\r\n\r\nans = []\r\ns = 0\r\nnow = 1\r\nwhile s + now + now + 1 <= n:\r\n ans.append(now)\r\n s += now\r\n now += 1\r\n \r\nans.append(n - s)\r\n\r\nprint(len(ans))\r\nprint(' '.join(map(str, ans)))", "n = int(input())\nlower = int(((n*8 + 1)**0.5-1)/2)\nprevSum = lower*(lower-1)//2\narr = list(range(1, lower+1))\narr[-1] = n - prevSum\nprint(len(arr))\nprint(*arr)", "\r\ndef h(n):\r\n lis = []\r\n\r\n i = 0\r\n while n>0:\r\n i= i+1\r\n \r\n if n-i<0:\r\n break\r\n lis.append(i) \r\n n = n-i\r\n lis[-1]=lis[-1]+n\r\n print(len(lis))\r\n for i in lis:\r\n print(i,end=\" \")\r\n \r\n print(\"\")\r\n \r\nn = int(input())\r\n\r\nh(n)", "n = int(input())\nchilds = 0\nchildsum = 0\nwhile childsum <= n:\n childs += 1\n childsum = (childs*(childs+1))//2\nchilds -= 1\nchildsum = (childs*(childs+1))//2\n\narr = []\nfor i in range(1,childs+1):\n arr.append(i)\narr[-1] = arr[-1]+(n-sum(arr))\n\nprint(childs)\nfor num in arr:\n print(num, end=\" \")\n\t \t \t\t \t\t \t \t \t\t\t \t \t \t", "n = int(input())\narr=[-1 for i in range(n)]\nmaxsplits = [[] for i in range(n)]\n\nfor i in range(n):\n if arr[i] == -1:\n if i<=1:\n arr[i]=1\n maxsplits[i].append(i+1)\n else:\n k=-1\n for j in range(1,i+1):\n if j not in maxsplits[i-j]:\n if arr[i]< arr[i-j]+1:\n arr[i] = arr[i-j]+1\n k=j \n maxsplits[i] = maxsplits[i-k][:]\n if k!=-1:\n maxsplits[i].append(k)\ns = \"\"\nfor x in maxsplits[n-1]:\n s = s+str(x)+\" \"\nprint(len(maxsplits[n-1]))\nprint(s)\n\n", "n = int(input())\r\n\r\nnums = []\r\nSum = 0\r\ni = 1\r\n\r\nwhile n - i - (i+1) >= 0:\r\n nums.append(i)\r\n n -= i\r\n i += 1\r\nif n != 0:\r\n nums.append(n)\r\nprint(len(nums))\r\nprint(*nums)\r\n", "import math\nimport sys\n\nif __name__==\"__main__\":\n\tn = int(input())\n#\tn = int(sys.argv[1])\n\ta = int((math.sqrt(8*n + 1) - 1)/2)\n\tprint (a)\n\tfor i in range(a-1):\n\t\tprint (i+1)\n\tprint (int(n - a*(a-1)/2))\n", "n=int(input())\r\nl=[1]\r\nfor i in range(2,n):\r\n if(sum(l)+i<=n):\r\n l.append(i)\r\n else:\r\n break\r\nl[-1]=l[-1]+(n-sum(l))\r\nprint(len(l))\r\nprint(*l)", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline().strip())\r\n\r\ndef main(n):\r\n max_children = 0\r\n candies = 1\r\n subtotal = 0\r\n possible_result = []\r\n while subtotal < n:\r\n if subtotal + candies + (candies + 1) <= n:\r\n subtotal += candies\r\n possible_result.append(candies)\r\n max_children += 1\r\n else:\r\n possible_result.append(n - subtotal)\r\n max_children += 1\r\n break\r\n candies += 1\r\n \r\n print(max_children)\r\n print(' '.join(str(x) for x in possible_result))\r\n\r\n\r\nmain(n)", "candies= int(input())\r\nchildren=0\r\ntotal=0\r\nnum=0\r\ncandiesxchildren=[]\r\nwhile(total<candies):\r\n\tif((total+num+1)>candies):\r\n\t\tnew=candiesxchildren.pop(len(candiesxchildren)-1)\r\n\t\tnum=(candies-total)+new\r\n\t\tchildren=children-1\r\n\telse:\r\n\t\tnum=num+1\r\n\ttotal=total+num\r\n\tcandiesxchildren.append(num)\r\n\tchildren=children+1\r\n\r\nprint(children)\r\nprint(\" \".join(map(str, candiesxchildren)))", "n = int(input())\narr = []\nsum_ = 0\nfor i in range(1, n + 1):\n sum_ += i\n if sum_ > n:\n break\n arr.append(i)\nsum_ = sum(arr)\ndiff = n - sum_\narr[-1] += diff\nassert sum(arr) == n\nprint(len(arr))\nprint(*arr)\n", "n=int(input())\r\na=[]*n\r\nb=[0]*1001\r\nd=0\r\ne=1\r\ns=0\r\nwhile 1:\r\n if e>n:\r\n d=1\r\n break\r\n a.append(e)\r\n s+=1\r\n n-=e\r\n e+=1\r\n if n==0:\r\n break\r\n# 11 1 2 3 4 1\r\nif d==1:\r\n f=a[s-1]+n\r\n a[s-1]=f\r\nprint(s)\r\nfor i in range(0,s):\r\n print(a[i],end=' ')", "\r\nn = int(input())\r\nans = []\r\nfor i in range(1,n+1):\r\n\tif n==0: break\r\n\tif (n - i == 0) or (n - i > i):\r\n\t\tans.append(i)\r\n\t\tn -= i\r\nprint(len(ans))\r\nfor x in ans: print(x, end = ' ')", "n=int(input())\r\nans=[]\r\ntemp=1\r\nwhile n>=temp:\r\n ans.append(temp)\r\n n-=temp\r\n temp+=1\r\nans[-1]+=n\r\nprint(len(ans))\r\nprint(*ans) ", "n = int(input())\ni = 1\nans = []\nwhile i <= n:\n ans.append(i)\n n = n - i\n i += 1\nans[-1] += n\nprint(len(ans))\nprint(*ans)\n", "from math import *\r\n\r\n\r\ndef getN(S):\r\n S *= 2\r\n N = int(sqrt(S))\r\n if N * (N + 1) <= S:\r\n return N\r\n else:\r\n return N - 1\r\nX = int(input())\r\nnum = getN(X)\r\nprint(num)\r\nS = 0\r\nfor i in range(1, num):\r\n print(i, end= ' ')\r\n S += i\r\nprint(X - S)\r\n ", "import math as m\r\nn=int(input())\r\nk=int(m.sqrt(8*n+1)-1)//2\r\nprint(k)\r\nnum=[i for i in range(1,k+1)]\r\nif sum(num) != n:\r\n num[-1]+=n-sum(num)\r\nprint(' '.join(map(str, num)))", "from bisect import bisect_left as bl\r\nn=int(input())\r\ndp=[]\r\nfor i in range(1,n+1):\r\n dp.append((i*(i+1))//2)\r\nx=bl(dp,n)\r\nif dp[x]==n:\r\n ans=[i for i in range(1,x+2)]\r\nelse:\r\n tmp=n-dp[x-1]\r\n ans=[i for i in range(1,x+1)]\r\n ans[-1]+=tmp\r\nprint(len(ans))\r\nprint(*ans)", "import math\r\nn = int(input().strip())\r\nx = int((math.sqrt(n*8 + 1) - 1)//2)\r\nprint(x)\r\nfor i in range(1,x):print(i,end=\" \")\r\nval = ((x - 1)*(2 + (x - 2)))//2\r\nprint(n - val)\r\n", "a = int(input())\r\nc = 1\r\nb = 1\r\nif a == 1 or a == 2:\r\n ans = str(a)\r\nelse:\r\n ans = \"1\"\r\nwhile c < a:\r\n b += 1\r\n c = c + b\r\n if c > a:\r\n b -= 1\r\n break\r\n elif a - c < b + 1:\r\n ans = ans + \" \" + str(b + (a - c))\r\n else:\r\n ans = ans + \" \" + str(b)\r\nprint(b)\r\nprint(ans)\r\n\n# Sat Dec 25 2021 10:01:49 GMT+0000 (Coordinated Universal Time)\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict\r\nfrom heapq import heapify,heappop,heappush\r\nfrom itertools import permutations\r\nfrom math import gcd,log\r\nmod = int(1e9 + 7)\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\n\r\n\r\n\r\nn=int(input())\r\nres=[0]\r\nwhile True:\r\n if n>=res[-1]+1:\r\n res.append(res[-1]+1)\r\n n-=res[-1]\r\n else:\r\n res[-1]+=n\r\n break\r\nprint(len(res)-1)\r\nprint(\" \".join([str(i) for i in res[1:]] ))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "n = int(input())\npref_sum = 0\npref = []\nrem = n\nc=0\nwhile rem > 0:\n if c != 0:\n pref_sum +=c\n pref.append(c)\n rem = n-pref_sum\n c+=1 \n if rem < c+c+1:\n c=rem\nprint(len(pref))\nprint(*pref)", "def max_candies(n):\r\n if n==1 or n==2:\r\n print(1)\r\n l = [n]\r\n return l\r\n l = []\r\n k = n\r\n for i in range(1,n+1):\r\n if i==k-i or i>k-i:\r\n l.append(k)\r\n break\r\n else:\r\n l.append(i)\r\n k-=i\r\n print(len(l))\r\n return l\r\nn = int(input())\r\nresult = max_candies(n)\r\nprint(*result,sep=\" \")", "n=int(input())\r\ns=0\r\nres=[]\r\ncurr=1\r\nfrom math import sqrt as S \r\nz=(-1+S(1+8*n))/2 \r\nif int(z)==z:\r\n z=int(z)\r\n res=[i for i in range(1,z+1)]\r\n print(z)\r\n print(*res)\r\nelse:\r\n can=int(z)\r\n for i in range(1,can):\r\n s+=i\r\n res.append(i)\r\n res.append(n-s)\r\n print(can)\r\n print(*res)", "n = int(input())\r\ncache = []\r\ni = 1\r\nwhile i <= n:\r\n\tcache.append(i)\r\n\tn -= i\r\n\ti += 1\r\n\r\nprint(len(cache))\r\nfor i in range(len(cache)):\r\n\tif i == (len(cache) - 1):\r\n\t\tprint(cache[i] + n, end=\" \")\r\n\telse:\r\n\t\tprint(cache[i], end=\" \")", "n = int(input())\r\nq = []\r\nfor i in range(1, 1000):\r\n if i > n:\r\n break\r\n n -= i\r\n q.append(i)\r\nfor i in range(len(q) - n, len(q)):\r\n q[i] += 1\r\nprint(len(q))\r\nprint(*q)\r\n", "from collections import deque\nfrom heapq import *\nimport sys\nsys.setrecursionlimit(5005)\nmod = 1000000007\ntime = 0\n\ndef solve():\n\tn = int(input())\n\tarr = []\n\ti = 1\n\twhile n:\n\t\tif i<=n:\n\t\t\tarr.append(i)\n\t\t\tn-=i\n\t\telse:\n\t\t\tarr[-1]+=n\n\t\t\tn = 0\n\t\ti+=1\n\tprint(len(arr))\n\tprint(*arr)\n\n\n\n\n\n\n\nt = 1\n#t = int(input())\n\nfor i in range(t):\n\tsolve()", "n = int(input())\r\nnum = 1\r\nsum1 = 0\r\ndiff = 0\r\nlst = list()\r\nwhile True:\r\n lst.append(num)\r\n sum1 += num\r\n diff = n - sum1\r\n if diff < num + 1:\r\n print(num)\r\n lst[-1] += diff\r\n print(*lst)\r\n break\r\n num += 1\r\n\r\n", "n = int(input())\r\ndp = [[[0,False] for x in range(n+1)] for x in range(n+1)]\r\n\r\n#Base Values\r\nfor i in range(n+1):\r\n dp[0][i][1] = True\r\n \r\nfor i in range(1, n+1):\r\n for j in range(1, n+1):\r\n #Update DP\r\n if j <= i and dp[i-j][j-1][1] != False:\r\n dp[i][j][0] = dp[i-j][j-1][0]+1\r\n dp[i][j][1] = True\r\n \r\n if dp[i][j-1][0] > dp[i][j][0]: \r\n dp[i][j][0] = dp[i][j-1][0]\r\n dp[i][j][1] = True\r\n \r\n\r\nprint(dp[-1][-1][0])\r\n \r\ni = j = n\r\nwhile i>0 and j>0:\r\n \r\n if dp[i][j] == dp[i][j-1]:\r\n j -= 1\r\n else:\r\n print(j,end=\" \")\r\n i -= j\r\n \r\n ", "n = int(input())\ni = 1\nans = []\nwhile n >= i:\n ans.append(i)\n n -= i\n i += 1\nans[-1] += n\n\nprint(len(ans))\nprint(*ans)\n", "n = int(input())\r\nmem = [1, 3, 6, 10, 15, 21, 28, 36, 45, 55, 66, 78, 91, 105, 120, 136, 153, 171, 190, 210, 231, 253, 276, 300, 325, 351, 378, 406, 435, 465, 496, 528, 561, 595, 630, 666, 703, 741, 780, 820, 861, 903, 946, 990, 1035, 1081, 1128, 1176]\r\ncomplete = False\r\nfor i in range(len(mem)):\r\n if mem[i] == n : \r\n idx = i +1\r\n complete = True \r\n break \r\n elif mem[i] > n:\r\n idx = i-1 \r\n break\r\nif complete: \r\n ans = [str(e) for e in list(range(1,idx+1)) ]\r\n\r\nelse: \r\n diff = n - mem[idx]\r\n ans = list(range(1,idx+2))\r\n ans[-1] += diff\r\n ans = [str(e) for e in ans ]\r\nprint(len(ans))\r\nprint(\" \".join(ans) ) \r\n\r\n\r\n", "from sys import stdin\r\nn = int(stdin.readline())\r\na = []\r\nwhile n > len(a):\r\n a += [len(a)+1]\r\n n -= a[-1]\r\n\r\na[-1] += n\r\nprint(len(a))\r\nprint(*a)", "n=int(input())\r\na=1\r\nl=[]\r\nwhile(a<=n):\r\n l.append(a)\r\n n-=a\r\n a+=1\r\nl[len(l)-1]+=n\r\nprint(len(l))\r\nprint(*l)", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n\r\n\tl.append(i + 1)\r\n\tif sum(l) + l[len(l) - 1] + 1 > n:\r\n\t\tl[len(l) - 1] += n - sum(l)\r\n\t\tbreak\r\nprint(len(l))\r\nprint('%s' % ' '.join(map(str, l)))", "from sys import stdin \r\n\r\nn=int(stdin.readline())\r\nc=1\r\ncnt=[]\r\nkids=0\r\nwhile n>0:\r\n if n==c:\r\n kids+=1\r\n cnt.append(c)\r\n n-=c\r\n elif n>c:\r\n if n-c>c:\r\n kids+=1\r\n cnt.append(c)\r\n n-=c\r\n c+=1\r\n\r\nprint(kids)\r\nprint(*cnt)", "def sol():\r\n n=int(input())\r\n dp=[]\r\n s=0\r\n i=1\r\n while(s+i+i+1<=n):\r\n s+=i\r\n dp.append(i)\r\n i+=1\r\n dp.append(n-sum(dp))\r\n print(len(dp))\r\n print(*dp,sep=\" \")\r\nif(__name__=='__main__'):\r\n sol()\r\n", "n = int(input())\r\nl = []\r\nc=0\r\nm=0\r\nfor i in range(1,n+1):\r\n if i not in l and c+i<=n:\r\n l.append(i)\r\n c+=i\r\n else:\r\n break\r\nl[-1]+=n-c\r\nprint(len(l))\r\nprint(*l)\r\n\r\n", "candies = int(input())\r\n\r\ndef printCandies(touse):\r\n print(len(result))\r\n resultS = \"\"\r\n for child in touse:\r\n resultS += str(child) + \" \"\r\n print(resultS)\r\n\r\nif candies >= 1 and candies <= 1000:\r\n result = []\r\n for i in range(1, candies + 1):\r\n result.append(i)\r\n if sum([int(i) for i in result]) > candies:\r\n result = result[0:-1]\r\n break\r\n sumN = sum(result)\r\n if sumN == candies:\r\n printCandies(result)\r\n else:\r\n remain = candies - sum(result)\r\n\r\n for i in range(remain, 0, -1):\r\n result[-1 - (i-1)] += 1\r\n \r\n printCandies(result)\r\n \r\n", "def solve():\n n = int(input())\n actual_give = 1\n given = []\n while n >= (actual_give):\n given += [actual_give]\n n-=actual_give\n actual_give +=1\n given[-1] = n + actual_give-1\n print (actual_give-1)\n print (*given, sep=\" \")\n \ndef main():\n solve()\n\n\nmain()\n\t \t \t\t\t \t\t\t\t \t\t\t \t\t\t \t \t", "n = int(input())\r\na = []\r\nwhile n > len(a):\r\n a.append(len(a)+1)\r\n n -= a[-1]\r\na[-1] += n\r\nprint(len(a))\r\nprint(*a)", "n = int(input())\r\nx = n\r\ni = 1\r\nwhile n >= i:\r\n n -= i\r\n i += 1\r\nprint(i-1)\r\nfor j in range(1,i):\r\n if j == i-1:\r\n print(x)\r\n break\r\n else:\r\n print(j,end= ' ')\r\n x -= j", "s=int(input())\nn=(int((8*s+1)**0.5)-1)//2\nprint(n)\nfor i in range(n-1):\n\tprint(i+1,end=\" \")\nprint(s-((n-1)*n)//2)\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\nnum = int(input())\r\n\r\nans = []\r\n\r\nfor i in range(1, 50):\r\n if i <= num:\r\n ans.append(i)\r\n num -= i\r\n else:\r\n ans[-1] += num\r\n break\r\nprint(len(ans))\r\nprint(*ans)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\nfor i in range(1,n+1):\n if (2*n)-(i**2)-i<0:\n k = i-1\n break\nif n==1:\n k=1\nprint(k)\nresto = int(n-k*(k+1)/2)\nfrase = \"\"\nfor j in range(1,k):\n frase = frase+str(j)+\" \"\nfrase = frase+str(k+resto)\nprint(frase)\n \t\t \t \t \t \t \t \t \t \t \t", "n=int(input())\narr=[]\ncount=1\nwhile sum(arr)!=n:\n arr.append(count)\n if sum(arr)>n:\n arr.remove(sum(arr)-n)\n break\n count+=1\nprint(len(arr))\nfor i in arr:\n print(i,end=\" \")\n\t \t \t \t \t \t \t\t\t\t \t \t\t\t", "\r\nn = int(input())\r\n\r\ni = 1\r\nsuma_siguiente = 1 \r\nwhile suma_siguiente <= n:\r\n i = i+1\r\n suma_siguiente = suma_siguiente + i\r\n\r\nnumero_ninios = i - 1\r\nsuma_actual = suma_siguiente - i\r\n\r\ndulces_ninio = []\r\nfor i in range(numero_ninios):\r\n dulces_ninio.append(i+1)\r\n\r\ndulces_restantes = n - suma_actual\r\n\r\nfor i in range(dulces_restantes):\r\n dulces_ninio[numero_ninios-i-1] = dulces_ninio[numero_ninios-i-1] + 1\r\n\r\ndulces_a_repartir = str(dulces_ninio[0])\r\nfor i in range(1,numero_ninios):\r\n dulces_a_repartir = dulces_a_repartir + ' ' + str(dulces_ninio[i])\r\n\r\nprint(numero_ninios)\r\nprint(dulces_a_repartir) ", "#!/usr/bin/env python\n\n\ndef main():\n n = int(input())\n\n k = 1\n while ((k + 1) * (k + 2)) // 2 <= n:\n k += 1\n\n print(k)\n\n for i in range(k - 1):\n print(i + 1, end=' ')\n\n extra = n - (k * (k + 1)) // 2\n print(k + extra)\n\nif __name__ == '__main__':\n main()\n", "a=list((range((i*(i+1))//2,(i*i+i*3+2)//2)) for i in range(1,1001))\r\nb=int(input())\r\nfor i in range(1001):\r\n\tif b in a[i]:\r\n\t\tprint(i+1)\r\n\t\tprint(\" \".join(str(x) for x in (list(range(1,i+1))+[b-((i*(i+1))//2)])))\r\n\t\tbreak", "n = int(input())\r\n\r\ndaf = set()\r\n\r\ni = 1\r\n\r\nwhile i <= n:\r\n daf.add(i)\r\n n -= i\r\n i += 1\r\n\r\ndaf.remove(i - 1)\r\ndaf.add(i - 1 + n)\r\n\r\nprint(len(daf))\r\nprint(*daf)\r\n", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nfrom bisect import *\r\nimport sys\r\nfrom random import *\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\ndef optimal_summands(n):\r\n\r\n\r\n summands = [] # array to store pairwise distinct positive integers\r\n k = n # marked the upper part\r\n m = 1 # marked the lower part\r\n\r\n if n == 2 or n == 1:\r\n summands.append(n)\r\n else:\r\n for i in range(1,k):\r\n if k <= 2*m:\r\n summands.append(k)\r\n break\r\n else:\r\n summands.append(m)\r\n k = k - m\r\n m = m + 1\r\n\r\n return summands\r\n\r\nn = inp()\r\nans = optimal_summands(n)\r\nprint(len(ans))\r\nprint(*ans)\r\n", "n = int(input())\r\nk = 1\r\nsol = []\r\nwhile n >0:\r\n if n > 2*k:\r\n sol.append(k)\r\n n = n -k\r\n k+=1\r\n else:\r\n sol.append(n)\r\n n = 0\r\nprint(len(sol))\r\nfor it in sol:\r\n print(it,end=' ')", "n = int(input())\r\ni = 1\r\na =[]\r\nwhile n>=i:\r\n a.append(i)\r\n n-=i\r\n i+=1\r\nif n > 0:\r\n a[-1]+=n\r\nprint(len(a))\r\nprint(*a)", "import math \r\nn=int(input())\r\nreq_value=n*2 \r\nk=int(math.sqrt(req_value))\r\nwhile((k*(k+1))>req_value):\r\n k-=1 \r\nprint(k) \r\nfor i in range((k-1)):\r\n print(i+1,end=\" \")\r\nans=n-(k*(k-1))//2 \r\nprint(ans)", "n = int(input())\r\nk = int(-0.4999999 + (0.25 + 2*n)**0.5)\r\nprint(k)\r\nfor i in range(1,k):\r\n print(i, end = \" \")\r\nprint(n - k*(k-1)//2) ", "k = int(input())\r\na = []\r\nfor i in range(1,k+1):\r\n if k >= i:\r\n a.append(i)\r\n k -= i\r\n else: \r\n a[-1] += k\r\n break\r\n\r\nstr_a = [str(x) for x in a]\r\nprint(len(a))\r\nprint(\" \".join(str_a))", "n = int(input())\nans = []\nnxt = 1\nwhile n > 0:\n x = nxt\n n -= nxt\n nxt += 1\n if n < nxt:\n x += n\n n = 0\n ans.append(str(x))\nprint(len(ans))\nprint(\" \".join(ans))\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(n):\r\n A = []\r\n val = 0\r\n for i in range(1, 10000):\r\n if val + i <= n:\r\n A.append(i)\r\n val += i\r\n else:\r\n break\r\n A[-1] += n - sum(A)\r\n return A\r\n\r\ndef main():\r\n n = int(input())\r\n A = solve(n)\r\n print(len(A))\r\n print(' '.join(list(str(a) for a in A)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\n# n, k = map(int, input().split())\r\n# a = list(map(int, input().split()))\r\nn = int(input())\r\nn *= 2\r\nstack = []\r\ncann = math.sqrt(n)\r\na = math.floor(cann)\r\ntong = a*(a+1)\r\n#print(a, tong)\r\nif tong > n:\r\n a -= 1\r\n n = n // 2\r\n for i in range(1, a):\r\n stack.append(str(i))\r\n n -= i\r\n stack.append(str(n))\r\nelif tong == n:\r\n for i in range(1, a+1):\r\n stack.append(str(i))\r\nelif tong < n:\r\n n = n // 2\r\n for i in range(1, a):\r\n stack.append(str(i))\r\n n -= i\r\n stack.append(str(n))\r\nprint(len(stack))\r\nprint(\" \".join(stack))", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nn=int(input())\r\ni=1\r\na=[]\r\nwhile(n>=i):\r\n a.append(i)\r\n n-=i\r\n i+=1\r\na[-1]+=n\r\nprint(len(a))\r\nprint(*a)", "n=int(input())\r\nk=0\r\ng=0\r\nwhile n-g>k:\r\n k+=1\r\n g+=k\r\nprint(k)\r\nfor i in range(k-1):\r\n print(i+1,end=' ')\r\nprint(n-g+k)", "n = int(input())\r\n\r\nl = []\r\nc, x = 0, 1\r\n\r\nwhile c < n:\r\n\tl.append(x)\r\n\t\r\n\tc += x\r\n\tx += 1\r\n\t\r\nif c != n:\r\n\tl.remove(c - n)\r\n\t\r\nprint(len(l))\r\nprint(\" \".join(list(map(str, l))))\r\n\t\t", "n = int(input())\n\na = [0] * (n + 1)\n\ndic = {}\nrest = n\nnext = 0\n\nwhile rest > 0:\n next += 1\n if rest - next >= 0 and next not in dic:\n left = rest - next\n if left != next and left not in dic:\n dic[next] = 0\n rest = rest - next\n\nprint(len(dic))\nfor p, v in enumerate(dic):\n print(v, end=' ')\nprint()\n", "n = int(input())\nans = []\ni = 0\nwhile i < n:\n i += 1\n ans.append(i)\n n -= i\nans[-1] += n\nprint(len(ans))\nprint(*ans)", "n = int(input())\r\nlst = [0]\r\ni = 1\r\ntotal = 0\r\nwhile True:\r\n\tif n - i <= i:\r\n\t\tlst.append(n)\r\n\t\tbreak\r\n\telse:\r\n\t\tlst.append(i)\r\n\t\tn -= i\r\n\t\ti += 1\r\n\t\ttotal += 1\r\n\r\n\r\nprint(len(lst) - 1)\r\nfor i in range(1, len(lst)):\r\n\tprint(lst[i], end=\" \")", "import math\r\nn = int(input())\r\nm = (-1 + (1 + (4 * 2 * n))**0.5) / 2\r\np = math.ceil((-1 + (1 + (4 * 2 * n))**0.5) / 2)\r\nl = []\r\nif m == p:\r\n for i in range(1,int(p+1)):\r\n l.append(i)\r\n print(p)\r\nelse:\r\n for i in range(1,int(p)):\r\n if i != p-1:\r\n l.append(i)\r\n else:\r\n x = (p*(p+1))//2\r\n l.append(i+1 - x + n + i)\r\n print(int(m))\r\n\r\nprint(*l)", "n = int(input())\na = []\nwhile n > len(a):\n a.append(len(a)+1)\n n -= a[-1]\na[-1] += n\nprint(len(a))\nprint(*a)\n", "n = int(input())\r\ni = 1\r\ncount = []\r\nwhile n:\r\n if i > n:\r\n count[-1] = count[-1] + n\r\n break\r\n n -= i\r\n count += [i]\r\n i += 1\r\nprint(len(count))\r\nprint(*count)", "n=int(input())\r\ns=1\r\ni=2\r\nlis=[1]\r\nwhile s<n:\r\n s=s+i\r\n lis.append(i)\r\n i=i+1\r\ni=len(lis)-1\r\nwhile s!=n:\r\n if s-lis[i]>=n:\r\n s=s-lis[i]\r\n del lis[i]\r\n else:\r\n i=i-1\r\nprint(len(lis))\r\nk=\"\"\r\nfor i in lis:\r\n k=k+str(i)+\" \"\r\nprint(k)", "# Enter your code here. Read input from STDIN. Print output to STDOUT\n \nif __name__ == '__main__':\n\tt = int(input().strip())\n\tans = []\n\ti = 1\n\ts = 0\n\twhile s+i <= t:\n\t\tans.append(i)\n\t\ts += i\n\t\ti += 1\n\tif s < t:\n\t\tans[-1] += t-s\n\tprint(len(ans))\n\tprint(\" \".join([str(x) for x in ans]))\n\t\t\t \t\t\t\t\t \t \t\t \t \t\t\t\t\t", "import sys\n\nstart = int(sys.stdin.readline())\nkids = 0\nleftover = start\nkid_list = []\n\nwhile leftover > kids :\n kids += 1\n leftover -= kids\n kid_list.append(kids)\n #print(\"kids = \", kids, \"\\nleftover = \", leftover)\n\nkid_list[kids-1] += leftover\nz = [str(item) for item in kid_list]\nprint(kids)\nprint(\" \".join(z))\n", "#ROUNIAUDI\r\nnum1=int(input())\r\ni=2\r\nans=0\r\ns=0\r\n\r\nans=int((((8*num1+1)**(1/2)-1)/2))\r\n\r\nprint(int(ans))\r\nfor i in range(int(ans)-1):\r\n print(i+1,end=\" \")\r\n s+=i+1\r\n\r\nprint(num1-s,end=\" \")\r\n\r\n", "n = int(input())\r\narr = []\r\ni = 1\r\nwhile n >= i:\r\n\tarr.append(i)\r\n\tn -= i\r\n\ti += 1\r\narr[-1] += n\r\nprint(len(arr))\r\nprint(*arr)\r\n\r\n\r\n", "n = int(input())\r\n\r\nresult = [1]\r\nstep = 2\r\ncount = 3\r\n\r\nwhile count <= n:\r\n result.append(step)\r\n step += 1\r\n count += step\r\n\r\nresult[-1] += (n - count + step)\r\n\r\nprint(len(result))\r\nprint(' '.join([str(x) for x in result]))", "import random\r\nimport math\r\n\r\ndef main():\r\n n = int(input())\r\n c = int((math.sqrt(1+8*n)-1)//2)\r\n print(c)\r\n s = ''\r\n r = n - c*(c+1)//2\r\n for i in range(c-1):\r\n s+= str(i+1)+' '\r\n s+= str(c+r)\r\n print(s)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def f(n):\r\n return n*(n+1)//2\r\ndef g(n):\r\n for i in range(n):\r\n if n>= f(i) and n < f(i+1):\r\n return i\r\n return n\r\n\r\nn = int(input())\r\nx = g(n)\r\nprint(x)\r\nl = []\r\ny = n\r\nfor i in range(1,x+1):\r\n l.append(i)\r\n y -= i\r\nl[len(l)-1] += y\r\nprint(*l)\r\n", "n = int(input())\n\nsve = 1\ncnt = 1\n\nwhile sve <= n:\n cnt += 1\n sve += cnt\n\nsve -= cnt\ncnt -= 1\n\nsve = cnt - n + sve\n\nres = [str(x + (x > sve)) for x in range(1, cnt + 1)]\n\nprint (cnt)\nprint (' '.join(res))\n", "n = int(input())\r\nk = 1\r\narr = []\r\n\r\nwhile (k*(k+1)) <= 2*n:\r\n\tarr.append(k)\r\n\tk += 1\r\narr.pop()\r\narr.append(n-sum(arr))\r\n\r\nprint(len(arr))\r\nprint(*arr)\r\n\r\n", "n=int(input())\r\nx=[];i=1\r\nwhile n>0:\r\n n-=i\r\n x.append(i)\r\n i+=1\r\n if n-i<0: \r\n x[-1]+=n\r\n break\r\nprint(len(x))\r\nprint(*x)\r\n", "n = int(input())\r\nnums = (-1 + int((1 + 8*n)**0.5))//2\r\nres = \"\"\r\ns = 0\r\nfor i in range(1, nums):\r\n res += str(i) + \" \"\r\n s += i\r\nres += str(n - s)\r\nprint(nums)\r\nprint(res)\r\n", "n = int(input())\nk = 1\nwhile k * (k + 1) // 2 <= n:\n k += 1\nk -= 1\nprint(k)\nfor i in range(1, k):\n print(i, end=' ')\nprint(n - k * (k - 1) // 2)\n", "n= int(input())\r\na=[]\r\ni=1\r\n\r\nwhile i<=n:\r\n a.append(i)\r\n n-=i\r\n i+=1\r\n\r\na[-1]+=n\r\nprint(len(a))\r\nprint(*a)", "n=int(input())\r\ni=1\r\ns=0\r\nl=[]\r\nwhile(s<n):\r\n s=s+i\r\n l.append(i)\r\n i=i+1\r\n if(s==n):\r\n break\r\n elif(s>n):\r\n s=s-i\r\n l.pop()\r\n break\r\n else:\r\n pass\r\nprint(len(l))\r\nl.pop()\r\nl.append(n-(sum(l)))\r\nprint(*l)", "import sys\r\n\r\ndef CalcAnswer(n):\r\n\tat = 1\r\n\tremainder = n\r\n\tlist = []\r\n\twhile at+at+1 <= remainder:\r\n\t\tlist.append(at)\r\n\t\tremainder-=at\r\n\t\tat+=1\r\n\tlist.append(remainder)\r\n\treturn list\r\n\r\n\r\ndef PrintAnswer(list_of_candies):\r\n\tprint(len(list_of_candies))\r\n\tprint(\" \".join(str(x) for x in list_of_candies))\r\n\r\nPrintAnswer(CalcAnswer(int(sys.stdin.readline().strip())))\r\n", "\r\nf = int(input())\r\n\r\ndata = dict()\r\n\r\ndata[1] = [1]\r\ndata[2] = [2]\r\ndata[3] = [1, 2]\r\n\r\nfor x in range(4, f+1):\r\n t = data[x-1]\r\n\r\n if 1 not in t:\r\n data[x] = t + [1]\r\n else:\r\n t.sort()\r\n for z in set(t):\r\n if sum(set(t) - {z} | {z+1}) == x:\r\n data[x] = list(set(t) - {z} | {z+1})\r\n break\r\n\r\nprint(len(data[f]))\r\nprint(' '.join(map(str, data[f])))", "n = int(input())\r\nanswer = []\r\ns, i = 0, 1\r\nwhile s < n:\r\n answer.append(i)\r\n s += i\r\n i += 1\r\nd = s - n\r\nanswer = list(filter(lambda x: x != d, answer))\r\nprint(len(answer))\r\nprint(' '.join(map(str, answer)))\r\n", "n = int(input())\r\n\r\nres = []\r\ns = 0\r\nfor i in range(1, 10000):\r\n if s + i < n:\r\n res.append(i)\r\n s += i\r\n else:\r\n el = n - s\r\n while el in res:\r\n s -= res[-1]\r\n res = res[:-1]\r\n el = n - s\r\n res.append(n - s)\r\n break\r\n\r\nprint(len(res))\r\nprint(\" \".join(map(str, res)))\r\n", "a=int(input())\n# n2 + n -2*a\nr=int((-1+(1+8*a)**0.5)//2)\nprint(r)\nextra=a-(r*(r+1))//2\nans=[i for i in range(1,r+1)]\nans[-1]+=extra\nprint(*ans)\n", "n=int(input())\r\na=[0]*50\r\ni=1;cnt=0\r\nwhile(True):\r\n if n-i>=i+1:\r\n a[i]=i;cnt+=1\r\n n-=i;i+=1\r\n else: \r\n a[i]=n\r\n cnt+=1\r\n break\r\nprint(cnt)\r\nprint(*a[1:cnt+1])\r\n \r\n ", "n = int(input())\r\ni = 0\r\nsum = 0\r\na = []\r\nwhile sum < n:\r\n i += 1\r\n sum += i\r\n if n-sum < i+1:\r\n a.append(i+n-sum)\r\n break\r\n else:\r\n a.append(i)\r\nprint(i)\r\nprint(*a)\r\n", "n=int(input())\r\nl=[]\r\nt=1\r\nwhile t<=n:\r\n l.append(t)\r\n n-=t\r\n t+=1\r\nl[-1]=l[-1]+n\r\nprint(len(l))\r\nprint(*l)\r\n", "def sol(n):\r\n k = int( (2*n + 0.25)**0.5 - 0.5)\r\n t = k * (k+1) // 2\r\n if n == t:\r\n print(k)\r\n print(\" \".join(str(x+1) for x in range(k)))\r\n else:\r\n print(k)\r\n t = k * (k-1) // 2\r\n res = [str(x+1) for x in range(k-1)]\r\n res.append(str(n-t))\r\n print(\" \".join(res))\r\n\r\n\r\nn = int(input())\r\nsol(n)", "n = int(input())\r\ni = 1\r\ns = []\r\nwhile(i<=n):\r\n s.append(i)\r\n n -= i\r\n i += 1\r\ns[-1] = s[-1] + n\r\nprint(i-1)\r\nprint(*s)", "gifts = int(input())\nchild = 1\nwhile(child*(child+1)<=2*gifts):\n child += 1\n\nchild -= 1\nprint(child)\n\nfor i in range(1, child):\n print(i, end=' ')\n gifts -= i\n\nprint(gifts)\n\n\n \t \t \t\t \t \t \t\t\t \t\t \t \t", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn=I()\np=1\nl=[]\nx=(p*(p+1))//2\nwhile(x<=n):\n l.append(p)\n p+=1\n x=(p*(p+1))//2\nl[-1]=n-((p-2)*(p-1))//2\nprint(p-1)\nprint(*l)\n", "\r\nn = int(input())\r\nm = n\r\na = []\r\n\r\nfor i in range(1 , n + 1):\r\n\r\n if n - i >= 0 :\r\n n -= i\r\n a.append(i)\r\n\r\na.sort()\r\n#print(a)\r\n\r\nx = m - sum(a)\r\n#print(x)\r\n\r\nif x == 0 :\r\n print(len(a))\r\n print(*a)\r\n\r\nelse:\r\n print(len(a))\r\n mx = max(a)\r\n mx += x\r\n a.pop()\r\n a.append(mx)\r\n print(*a)\r\n\r\n", "n = int(input())\r\n\r\nj = 2\r\nk = 2\r\nl = 1\r\nfor i in range(n):\r\n\tif i == k:\r\n\t\tl += 1\r\n\t\tj += 1\r\n\t\tk += j\r\n\r\nprint(l)\r\nfor i in range(l - 1):\r\n\tprint(i + 1, end = \" \")\r\nprint(n - (l - 1) * l // 2)", "n=int(input())\r\na=[1]\r\nn-=1\r\nwhile n>a[-1]:\r\n a.append(a[-1]+1)\r\n n-=a[-1]\r\na[-1]+=n\r\nprint(len(a))\r\nfor num in a:\r\n print(num, end=' ')", "n=int(input())\r\nk=0\r\ns=0\r\nfor i in range(1,n+1):\r\n if n<s:\r\n s-=(i-1)\r\n k-=1\r\n break\r\n k+=1\r\n s+=i\r\nif s>n:\r\n k-=1\r\nprint(k)\r\ns=0\r\nfor i in range(1,k):\r\n s+=i\r\n print(i,end=\" \")\r\nif n!=s:\r\n print(n-s)", "from sys import stdin\r\ndef input(): return stdin.readline().strip()\r\n\r\n\r\ndef read_int():\r\n return int(input())\r\n\r\n\r\ndef read_ints():\r\n return map(int, input().split())\r\n\r\ndef list_ints():\r\n return list(map(int, input().split()))\r\n\r\n# t = read_int()\r\n# for case_num in range(t):\r\n \r\nn = read_int()\r\n\r\ni = 1\r\n\r\nwhile n >= (i * (i + 1)) // 2:\r\n \r\n i += 1\r\n \r\nans = i - 1\r\n\r\nL = []\r\n\r\nfor j in range(1, i - 1):\r\n L.append(j)\r\n \r\nb = n - sum(L)\r\nL.append(b)\r\n\r\nprint(ans)\r\nprint(*L)\r\n\r\n\r\n\r\n ", "\r\nn = int(input())\r\n\r\nr = ((1+8*n)**(0.5) -1)/2\r\n\r\nans = list(range(1,int(r)+1))\r\n\r\nans[-1] += n - (int(r)*(int(r)+1)//2)\r\n\r\nprint(len(ans))\r\nprint(*ans)", "n = int(input())\r\nif n == 2:\r\n print(1)\r\n print(2)\r\n exit(0)\r\nm = int(((1+8*n)**0.5-1)/2)\r\narr = [i for i in range(1,m+1)]\r\nsum = m*(m-1)//2\r\nd = n - sum\r\narr[-1] = d\r\nprint(m)\r\nprint(*arr)", "n = int(input())\n\nsve = 1\ncnt = 1\n\nwhile sve + cnt < n:\n cnt += 1\n sve += cnt\n\nres = [x for x in range(1, cnt)]\nres.append(cnt + n - sve)\n\nprint(cnt)\nprint(' '.join(str(x) for x in res))\n", "n=int(input())\r\ni=1\r\na=[]\r\nwhile(n>=i):\r\n a.append(i)\r\n n-=i\r\n i+=1\r\na[-1]+=n\r\nprint(len(a))\r\nprint(*a)", "n = int(input())\r\ncount = 0\r\na = []\r\nsumm = 0\r\nfor i in range(1, n+1):\r\n summ += i\r\n if summ > n:\r\n break\r\n count += 1\r\n a.append(i)\r\nif summ > n:\r\n a[-1] += n - summ + i\r\nprint(count)\r\nprint(' '.join(map(str, a)))\r\n", "n = int(input())\ns = 0\ni = 0\nwhile s < n:\n i = i + 1\n s = s + i\nif s == n:\n print(i)\n for a in range(1, i+1):\n print(a ,end=\" \")\nelse:\n i = i - 1\n print(i)\n for o in range(1, i):\n print(o ,end=\" \")\n n = n - o\n print(n, end=\" \")\n\n\nprint()", "n = int(input())\r\nlst = []\r\ni = 1\r\nwhile True:\r\n\tif n - i <= i:\r\n\t\tlst.append(n)\r\n\t\tbreak\r\n\telse:\r\n\t\tlst.append(i)\r\n\t\tn -= i\r\n\t\ti += 1\r\n\r\n\r\nprint(len(lst))\r\nfor i in range(0, len(lst)):\r\n\tprint(lst[i], end=\" \")", "n=int(input())\nfrom sys import setrecursionlimit\nsetrecursionlimit(300000)\n#n=1111\ndef maximum(n):\n\tif n==1:\n\t\treturn [1]\n\tb=maximum(n-1)\n\tif 1 in b:\n\t\tf=0\n\t\tfor j in range(len(b)-1,-1,-1):\n\t\t\tif(b[j]+1!=b[j-1]):\n\t\t\t\tb[j]+=1\n\t\t\t\tf=1\n\t\t\t\tbreak\n\t\tif(f==0):\n\t\t\tb[0]+=1\n\n\telse:\n\t\tb.append(1)\n\treturn b\n\nA=maximum(n)\nprint(len(A))\nprint(*A)\n", "import math\n\ndef solve(n):\n portions = []\n i = 1\n while n >= i:\n portions.append(i)\n n -= i\n i += 1\n\n portions[-1] += n\n return portions\n\nn = int(input())\nportions = solve(n)\nprint(len(portions))\nprint(' '.join(map(str, portions)))\n \n \n \n", "n=int(input())\r\nl=[]\r\ni=1\r\nwhile i<=n:\r\n\tl.append(i)\r\n\tn-=i\r\n\ti+=1\r\nif n>0:\r\n\tfor i in range(len(l)-n,len(l)):\r\n\t\tl[i]+=1\r\n\t\tn-=1\r\nprint(len(l))\r\nprint(*l)", "def bin(n):\n l=-1\n r=int(1e4)\n while l+1!=r:\n m = (l+r)//2\n if m*(m+1)//2<=n:\n l=m\n else:\n r=m\n return l\n\nn = int(input())\nx = bin(n)\nprint(x)\nfor i in range(1, x):\n print(i, end=' ')\nprint(x+n-x*(x+1)//2)\n", "def main():\n k = int(input())\n\n temp = 0\n a = []\n for i in range(1,k+1):\n if temp + i <= k:\n a.append(i)\n temp += i\n else:\n exc = (temp+i) - k\n t = a.pop()\n a.append(t + (i-exc))\n break\n print(len(a))\n print(*a)\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput=sys.stdin.readline\r\ndef main():\r\n n=int(input())\r\n sol=[1]\r\n s=1\r\n while s<n:\r\n if sol[0]!=1:\r\n sol=[1]+sol\r\n s+=1\r\n continue\r\n for i in range(len(sol)-1):\r\n if sol[i]<sol[i+1]-1:\r\n sol[i]+=1\r\n break\r\n else:\r\n sol[-1]+=1\r\n s+=1\r\n print(len(sol))\r\n print(*sol)\r\nmain()\r\n\r\n", "R = lambda: map(int, input().split())\r\nn = int(input())\r\na = []\r\nfor i in range(1, n + 1):\r\n a.append(i)\r\n n -= i\r\n if n <= i:\r\n break\r\na[-1] += n\r\nprint(len(a))\r\nprint(' '.join(map(str, a)))", "n=int(input().strip())\ni=1\nwhile i*(i+1)/2<=n:\n i+=1\nresult=[i for i in range(1,i)]\nif i*(i-1)/2!=n:\n result.sort(reverse=True)\n j=0\n for _ in range(int(n-(i*(i-1)/2))):\n result[j]+=1\n j+=1\nresul=[str(i) for i in result]\nprint(i-1)\nprint(' '.join(resul))", "n = int(input())\r\n\r\n#it is very obvious from observation that first element will be 1 always except when n = 2\r\n\r\n\r\n\r\ni=1\r\ncurrent = []\r\nwhile n >= i: #everytime we loop out we r getting decreaed n..\r\n\tcurrent.append(i)\r\n\tn -= i\r\n\t#decreasing n\r\n\ti += 1\r\n\t#increasing i\r\n\t\r\n#now the next line is trick of the question.\t\r\ncurrent[-1] += n\r\n#finally at end we add n to current so we get total sum n.\r\n#try it with example taking n as 5.\r\n\r\nprint(len(current))\r\nprint(*current)\r\n", "\r\nn=int(input());\r\nc=1;\r\na=[]\r\nwhile(n-c>c):\r\n\ta.append(c);\r\n\tn-=c;\r\n\tc+=1;\r\na.append(n);\r\nprint(len(a));\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\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input().strip())\r\nk = int(((8 * n + 1) ** 0.5 - 1) // 2)\r\ns = \"\"\r\n\r\na = []\r\nfor i in range(k - 1):\r\n s += str(i + 1) + \" \"\r\ns += str(n - (k * (k - 1)) // 2)\r\n\r\nprint(k)\r\nprint(s)\r\n", "import math\r\nn = int(input(\"\"))\r\n\r\ndef santa(n):\r\n t = []\r\n c = 0\r\n m = (math.sqrt(8*n+1)-1)/2\r\n for i in range(1,int(m)):\r\n t.append(i)\r\n n-=i\r\n c += 1\r\n c+=1\r\n print(c)\r\n t.append(n)\r\n for i in t:\r\n print(i)\r\n \r\n \r\n \r\n\r\nsanta(n)", "from math import floor, sqrt\r\nn = int(input())\r\n\r\nans = floor(0.5 * (sqrt(8 * n + 1) - 1))\r\none_to_ans = [i for i in range(1, ans + 1)]\r\none_to_ans[-1] += n - sum(one_to_ans)\r\n\r\nprint(ans)\r\nprint(*one_to_ans)" ]

[ "import sys, os\r\n\r\ndef centroid_decomp(coupl):\r\n n = len(coupl)\r\n \r\n bfs = [n - 1]\r\n for node in bfs:\r\n bfs += coupl[node]\r\n for nei in coupl[node]:\r\n coupl[nei].remove(node)\r\n \r\n size = [0] * n\r\n for node in reversed(bfs):\r\n size[node] = 1 + sum(size[child] for child in coupl[node])\r\n\r\n def centroid_reroot(root):\r\n while coupl[root]:\r\n child = max(coupl[root], key = size.__getitem__)\r\n if size[child] <= size[root] // 2:\r\n break\r\n size[root] -= size[child]\r\n size[child] += size[root]\r\n coupl[root].remove(child)\r\n coupl[child].append(root)\r\n root = child\r\n return root\r\n \r\n bfs = [n - 1]\r\n for node in bfs:\r\n centroid = centroid_reroot(node)\r\n bfs += coupl[centroid]\r\n yield centroid\r\n\r\ninp = sys.stdin.buffer.read().split(); ii = 0\r\n\r\nn = int(inp[ii]); ii += 1\r\ncoupl = [[] for _ in range(n)]\r\nfor _ in range(n - 1):\r\n u = int(inp[ii]) - 1; ii += 1\r\n v = int(inp[ii]) - 1; ii += 1\r\n \r\n coupl[u].append(v)\r\n coupl[v].append(u)\r\n\r\nA = [1 << c - b'a'[0] for c in inp[ii]]; ii += 1\r\npalistates = [0] + [1 << i for i in range(20)]\r\n\r\nans = [0.0] * n\r\ndp = [0.0] * n\r\nval = [0] * n\r\ncounter = [0] * (1 << 20)\r\n\r\nfor centroid in centroid_decomp(coupl):\r\n bfss = []\r\n for root in coupl[centroid]:\r\n bfs = [root]\r\n for node in bfs:\r\n bfs += coupl[node]\r\n bfss.append(bfs)\r\n \r\n for node in bfs:\r\n val[node] ^= A[node]\r\n for child in coupl[node]:\r\n val[child] = val[node]\r\n \r\n entire_bfs = [centroid]\r\n for bfs in bfss:\r\n entire_bfs += bfs\r\n\r\n for node in entire_bfs:\r\n val[node] ^= A[centroid]\r\n counter[val[node]] += 1\r\n\r\n for bfs in bfss:\r\n for node in bfs:\r\n counter[val[node]] -= 1\r\n\r\n for node in bfs:\r\n v = val[node] ^ A[centroid]\r\n for p in palistates:\r\n dp[node] += counter[v ^ p]\r\n\r\n for node in bfs:\r\n counter[val[node]] += 1\r\n\r\n for node in reversed(entire_bfs):\r\n dp[node] += sum(dp[child] for child in coupl[node])\r\n\r\n dp[centroid] += 1\r\n for p in palistates:\r\n dp[centroid] += counter[p]\r\n dp[centroid] //= 2\r\n\r\n for node in entire_bfs:\r\n ans[node] += dp[node]\r\n counter[val[node]] = val[node] = 0\r\n dp[node] = 0.0\r\n\r\nos.write(1, b' '.join(str(int(x)).encode('ascii') for x in ans))\r\n" ]

[ "\"\"\"def main():\r\n n, k = map(int, input().split())\r\n lst = [int(i) for i in input().split()]\r\n counter = 0\r\n while sum(lst) > 0:\r\n max_c = max(lst)\r\n if max_c >= 2*k:\r\n lst[lst.index(max_c)] -= 2 * k\r\n elif k<=max_c <= 2*k:\r\n lst[lst.index(max_c)] = 0\r\n else:\r\n lst[lst.index(max_c)] = 0\r\n \r\n counter += 1\r\nprint(main())\r\n\"\"\"\r\nn, k = map(int, input().split())\r\nlst = [int(i) for i in input().split()]\r\ncount = 0\r\nfor i in range(n):\r\n count += (lst[i] + k -1)//k\r\ncount = (count + 1)//2\r\nprint(count)", "def solve():\r\n n, k = map(int, input().split())\r\n w = [int(i) for i in input().split()]\r\n\r\n ans = sum((wi + k - 1) // k for wi in w)\r\n ans = (ans + 1) // 2\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "#RAVENS\n#TEAM_2\n#ESSI-DAYI_MOHSEN-LORENZO\nfrom math import ceil\nn, k = map(int,input().split())\na = list(map(int,input().split()))\nday = 0\nb1 = b2 = odd = 0\nfor i in range(n):\n yy = ceil(a[i]/k)\n if yy % 2 == 0:day+=(yy//2)\n else:\n odd+=1\n day+=ceil(yy/2)\nprint(day-odd//2)\n", "import math\r\n\r\ntypes, capacity = map(int, input().split())\r\n\r\npebbles = list(\r\n map(lambda x: math.ceil(x / capacity),\r\n map(int, input().split()))\r\n)\r\n\r\nprint(math.ceil(sum(pebbles)/2))", "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 [int(x) for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\n\ndef main():\n n,k = LI()\n r = 0\n for c in LI():\n r += (c+k-1) // k\n\n return (r+1)//2\n\n\nprint(main())\n", "import math\r\n\r\nn, k = map(int, input().split())\r\nw = map(int, input().split())\r\n\r\nres = 0\r\nfor el in w:\r\n res += math.ceil(float(el) / k)\r\n\r\nprint(math.ceil(float(res) / 2))\r\n", "import math\r\n\r\n\r\niter = 1\r\nfor _ in range(iter):\r\n n,k = list(map(int,input().split(' ')))\r\n w = list(map(int,input().split(' ')))\r\n r = 0\r\n for i in range(n):\r\n r+=math.ceil(w[i]/k)\r\n print(math.ceil(r/2)) ", "import math\r\nn,k=map(int,input().split())\r\nar=list(map(int,input().split()))\r\ns=0\r\nfor x in range(n):\r\n s+=math.ceil(ar[x]/k)\r\nprint(math.ceil(s/2))", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nans = 0\r\nprev = 0\r\nfor i in range(n-1):\r\n\tans += max((a[i]-prev*k-1)//k + 1,0)\r\n\tprev = max((a[i]-prev*k-1)//k + 1,0)\r\nans += max((a[-1]-prev*k-1)//(2*k) + 1,0)\r\nprint (ans)", "import math\r\n\r\nn,k=map(int,input().split())\r\nw=list(map(int,input().split()))\r\n\r\nc=0\r\nfor i in range(n):\r\n c+=(w[i]+k-1)//k\r\n \r\nprint((c+1)//2)\r\n \r\n ", "n, k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\ni=0\r\np=0\r\nfor u in a:\r\n if u//(2*k)>=1:\r\n i+=u//(2*k)\r\n if u%(2*k)<=k and u%(2*k)!=0 and p==0:\r\n p+=1\r\n elif u%(2*k)!=0 and u%(2*k)<=k and p==1:\r\n i+=1\r\n p=0\r\n elif u%(2*k)>k:\r\n i+=1\r\n else:\r\n if u<=k and u!=0 and p==0:\r\n p+=1\r\n elif u!=0 and u<=k and p==1:\r\n i+=1\r\n p=0\r\n elif u>k:\r\n i+=1\r\nif p==1:\r\n print(i+1)\r\nelse:\r\n print(i)\r\n", "_, k = map(int, input().split())\r\nprint((sum((w + k - 1) // k for w in map(int, input().split())) + 1) // 2 )", "# your code goes here\nN, B= map(int, input().split())\nW = [int(x) for x in input().split()]\nans = 0\nfor b in W:\n if b % B == 0:\n ans += b // B\n else:\n ans += b // B + 1\nif ans % 2 == 0:\n print(ans // 2)\nelse:\n print(ans // 2 + 1)", "n, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n cnt += -(-w[i] // k)\r\n\r\nprint(-(-cnt // 2))", "from math import ceil\r\nfrom sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\nn,k=map(int,input().split())\r\nw=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n\tans+=ceil(w[i]/k)\r\nprint(ceil(ans/2))", "n,k = map(int, input().split())\r\nmm = list(map(int, input().split()))\r\nl = 0\r\nfor i in mm:\r\n l = l + i // k\r\n if i - k *(i // k) != 0:\r\n l = l + 1\r\nprint((l//2)+(l%2))", "n, k = map(int, input().split())\nw = list(map(int, input().split()))\n\nans = 0\nrem = 0\n\n\nfor wi in w:\n d, r = divmod(wi, 2 * k)\n ans += d\n if r > k:\n rem += 2\n elif r > 0:\n rem += 1\n\nans += (rem + 1) // 2\nprint(ans)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\n\r\nk=0\r\nk1=0\r\nfor i in range(n-1,-1,-1) :\r\n k=k+l[i]//(m*2)\r\n l[i]=l[i]%(m*2)\r\n if l[i]!=0 :\r\n if l[i]>=m :\r\n l[i]=l[i]-m\r\n k1=k1+1\r\n\r\nst=n-l.count(0)\r\nif (k1+st)%2==0 :\r\n k=k+(k1+st)//2\r\nelse :\r\n k=k+1+(k1+st)//2\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 ====================================================================================\r\n ==================================================================================== \r\n\"\"\"\r\n# ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥\r\n\r\nimport math\r\nn,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(len(l)):\r\n ans += math.ceil(l[i]/k)\r\nprint(math.ceil(ans/2))\r\n\r\n# ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥\r\n\"\"\"====================================================================================\r\n ====================================================================================\r\n \r\n ___ _______ ___ _______ ___ ___\r\n | /\\ | | \\ | | / | | | | |\\ /|\r\n | / \\ | | \\ | | / | | | | | \\ / |\r\n |___ /____\\ | | \\ | |/ |___| | | | \\/ |\r\n | / \\ | | / | |\\ |\\ | | | |\r\n | / \\ | | / | | \\ | \\ | | | |\r\n ___|/ \\___|___ |___/ ___|___ | \\ | \\ |___| | |\r\n \r\n \r\n ====================================================================================\r\n ==================================================================================== \r\n\"\"\"", "def solve():\n n, k = map(int, input().split())\n w = [int(i) for i in input().split()]\n p = 0\n for i in w:\n p += (i + k - 1) // k\n print((p + 1)//2)\nsolve()", "import math\nn,k=map(int,input().split())\npockets=0\nw=map(int,input().split(\" \"))\nfor i in w:\n\tpockets=pockets+math.ceil(i/k)\n\nprint (math.ceil(pockets/2))\n", "import math\r\nn,k = map(int,input().split())\r\nl = list(map(int,input().split())); cnt =0;s = 0\r\nfor i in l:\r\n s+=math.ceil(i/k)\r\nprint(math.ceil(s/2))\r\n ", "import math\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(math.ceil(a[i]/k))\r\nprint(int(math.ceil(sum(l)/2)))", "# cook your dish here\r\nn,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nfrom math import ceil \r\ns=0\r\nfor i in l:\r\n s+=ceil(i/k)\r\nprint(ceil(s/2))", "import math\r\nn,k=map(int,input().split())\r\np=list(map(int,input().split()))\r\ndays=0\r\nk1=0\r\nq=[]\r\nfor i in range(n):\r\n q.append(p[i]%k)\r\n days+=p[i]//k\r\nm=(n-q.count(0))\r\nprint(math.ceil((m+days)/2))\r\n", "import math\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = []\r\n\r\nfor i in b:\r\n c.append(math.ceil(i/a[1]))\r\nprint(math.ceil(sum(c)/2))\r\n", "import math\nn, k = map(int, input().split())\nw = list(map(int, input().split()))\np = 0\nfor x in w:\n p += math.ceil(x / k)\nprint(math.ceil(p/2))", "n, k = map(int, input().split(' '))\r\npebbles = map(int, input().split())\r\n\r\n_ans = 0\r\nfor x in pebbles:\r\n _ans = _ans + ( x // k if x % k == 0 else x // k + 1)\r\n\r\n_ans = _ans // 2 if _ans % 2 == 0 else _ans // 2 + 1\r\nprint(_ans)", "n,k = map(int,input().split())\na = list(map(int,input().split()))\na.sort()\nans = 0\nprev = 0\nfor i in range(n-1):\n\tans += max((a[i]-prev*k-1)//k + 1,0)\n\tprev = max((a[i]-prev*k-1)//k + 1,0)\n\t# print (ans,prev)\nans += max((a[-1]-prev*k-1)//(2*k) + 1,0)\nprint (ans)", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nc=0\r\nr=0\r\nfor i in range(n):\r\n c=c+(l[i]+k-1)//k\r\nprint((c+1)//2)\r\n", "r = lambda:map(int,input().split())\r\nn,k = r()\r\np = list(r())\r\nprint((sum((i+k-1)//k for i in p)+1)//2)", "n, k = map(int, input().split())\r\ndays = 0\r\nw = list(map(int, input().split()))\r\nfor wi in w:\r\n days += (wi - 1) // k + 1\r\nprint((days - 1) // 2 + 1)", "import math\r\nn,k =map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\ns = 0\r\nfor x in l:\r\n s += math.ceil(x/k)\r\nprint(math.ceil(s/2))", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\np=0\r\nk=0\r\nfor i in range(n) :\r\n t=l[i]//m\r\n if l[i]%m!=0 :\r\n t=t+1\r\n t=t-p\r\n p=0\r\n k=k+t//2\r\n \r\n if t%2!=0 :\r\n k=k+1\r\n p=1\r\nprint(k)\r\n \r\n", "def main():\n n, m = map(int, input().split())\n print((sum((x + m - 1) // m for x in map(int, input().split())) + 1) // 2)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n\tans += a[i] // k + (1 if a[i] % k != 0 else 0)\r\nprint(ans // 2 + (ans % 2))", "n, k = map(int, input().split())\r\nprint((sum((int(x) + k - 1) // k for x in input().split()) + 1) // 2)", "n,k = map(int,input().split())\nw = list(map(int,input().split()))\nnbPkt = 0\nfor i in w:\n nbPkt += (i+k-1)//k\nprint((nbPkt+1)//2)\n", "n,k= map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nnbPkt = 0\r\nfor i in l:\r\n nbPkt += (i+k-1)//k\r\nprint((nbPkt+1)//2)", "import math\nn,k = [int(i) for i in input().split(' ')]\nl = [math.ceil(int(i)/k) for i in input().split(' ')]\n\n\nprint(math.ceil(sum(l)/2))", "n, k = map(int, input().split())\nw = map(int, input().split())\nans = 1\nfor x in w:\n ans += (x+k-1)//k\nprint(ans//2)\n", "import heapq\nfrom collections import deque\nimport sys\n\n#\n# f = open('input.txt')\n# sys.stdin = f\n\n_, k = map(int, input().split())\na = 0\nfor i in map(int, input().split()):\n c = (i + k - 1) // k\n a += c\nprint((a+1)//2)\n", "n,k=map(int,input().split())\nlis=input().split()\nans=0\nfor i in lis:\n\tans+=int((int(i)-1)/k)+1\nprint(int((ans+1)/2))\n", "n,k=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nx=0\r\nfor i in range(n):\r\n x+=(a[i]+k-1)//k\r\nprint((x+1)//2)", "def main():\r\n (n, k) = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n ans = 0\r\n for i in a:\r\n ans += i // k + (i % k > 0)\r\n print(ans // 2 + (ans % 2 > 0))\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import ceil\r\nfrom sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\nn,k=map(int,input().split())\r\nw=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n\tif w[i]<=k:\r\n\t\tans+=1\r\n\telif k<w[i]<=2*k:\r\n\t\tans+=2\r\n\telse:\r\n\t\tans+=ceil(w[i]/k)\r\nprint(ceil(ans/2))", "from math import ceil\r\nl = 0\r\nn, k = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\nfor i in arr:\r\n l += ceil(i / k)\r\nprint(ceil(l / 2))\r\n\r\n", "import sys\r\nimport math\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, input().split()) \r\ndef listinput(): return list(map(int, input().split()))\r\nn,k=minput()\r\nw=listinput()\r\nans=0\r\nfor i in w:\r\n ans+=math.ceil(i/k)\r\nprint(math.ceil(ans/2))", "import math\r\nn,k = map(int,input().split())\r\narr = [int(i) for i in input().split()]\r\narr.sort()\r\nans = 0\r\nfor i in range(len(arr)):\r\n temp = math.ceil(arr[i]/k)\r\n ans+=temp\r\nprint(math.ceil(ans/2))\r\n \r\n ", "import math\r\ndef pebbles(arr1,k):\r\n ans=0\r\n for i in range(len(arr1)):\r\n ans+=math.ceil(arr1[i]/k)\r\n return math.ceil(ans/2)\r\nn,k=map(int,input().split())\r\narr1=list(map(int,input().split()))\r\nprint(pebbles(arr1,k))\r\n", "from sys import stdin\r\nfrom math import ceil\r\n\r\nrd = stdin.readline\r\n\r\nn, k = map(int, rd().split())\r\nw = list(map(int, rd().split()))\r\n\r\nfor i in range(n):\r\n\r\n w[i] = ceil(w[i] / k)\r\n\r\nprint(ceil(sum(w) / 2))\r\n", "from math import ceil\r\nn,k = map(int, input().split())\r\nw = [0] + list(map(int, input().split()))\r\nminDay = 0\r\ntotal = 0\r\nfor i in range(1,n+1):\r\n total += ceil(w[i]/k)\r\nminDay = ceil(total/2)\r\nprint(minDay) \r\n", "import math\r\nc=0\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().strip().split()))\r\nfor i in arr:c+=math.ceil(i/k)\r\nprint(math.ceil(c/2))", "from math import ceil\r\nans=0\r\nn,k=map(int,input().split())\r\nw=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tans+=ceil(w[i]/k)\r\nprint(ceil(ans/2))", "import math\r\nn,k=map(int,input().split())\r\nline=map(int,input().split())\r\ncnt=0\r\nfor x in line:\r\n\tcnt+=math.ceil(x/k)\r\nprint(math.ceil(cnt/2))", "n,m=map(int,input().split())\r\nk=list(map(int,input().split()))\r\nj=0\r\nfor i in k:\r\n if i<=m:\r\n j+=1\r\n else:\r\n if i>m:\r\n if i%m==0:\r\n l=i//m\r\n j+=l\r\n else:\r\n l=i//m+1\r\n j+=l \r\nif j%2==0:\r\n b=j//2\r\n print(b)\r\nelse:\r\n b=j//2+1\r\n print(b)\r\n ", "_,k=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nn=0\r\nfor i in range(len(s)):\r\n n+=s[i]//k+((s[i]%k)>0)\r\nprint(n//2+((n%2)>0))", "n,k=map(int,input().split())\r\nr=0\r\nfor x in map(int,input().split()):r+=0--x//k\r\nprint(0--r//2)\r\n\r\n", "import math\r\nn , k = map(int, input().split())\r\nls = list(map(int,input().split()))\r\nans = 0 \r\nfor i in ls :\r\n ans += math.ceil(i / k)\r\n\r\nprint(math.ceil(ans/2.0))", "import math\r\nn,m=map(int,input().split())\r\np=0\r\nval=map(int,input().split())\r\nfor v in val:\r\n p+=math.ceil(v/m)\r\nprint(math.ceil(p/2))", "from math import ceil\r\nn, k = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nd = 0\r\nfor i in w:\r\n d += ceil(i/k)*0.5\r\nprint(int(ceil(d)))\r\n", "n, k = map(int, input().split())\r\narray = list(map(int, input().split()))\r\nans = 0\r\nfor i in range (n):\r\n ans += (array[i] + k - 1) // k\r\nprint((ans + 1) // 2)", "\n\n\ndef main():\n n,k = [int(x) for x in input().split()]\n pebbles = [int(x) for x in input().split()]\n lt = 0\n gt = 0\n ans = 0\n for x in pebbles:\n if x<=k:\n lt+=1\n else:\n lt+=(x//k)\n if x%k!=0:\n lt+=1\n\n ans+=(lt//2)\n lt = lt%2\n if lt==1:\n ans+=1\n print(ans)\n\n return\n\nmain()", "n,k=map(int,input().split())\r\nv=[int(x) for x in input().split()]\r\nv.sort()\r\nd=0\r\nfor i in range(n):\r\n d=d+(v[i]+k-1)//k\r\nprint((d+1)//2)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Mar 29 09:04:45 2017\r\n\r\n@author: kprashan\r\n\"\"\"\r\nimport math\r\nn,k = [int(a) for a in input().rstrip().split()]\r\narray = [int(a) for a in input().split()]\r\n#narray = [i for i in range(1,n+1)]\r\npocket = 0\r\nfor w in array:\r\n pocket += math.ceil(w/k)\r\n# print (pocket)\r\ndays = math.ceil(pocket/2)\r\nprint(days)", "\r\nimport math\r\nn,k=map(int,input().split())\r\na=list(map(int, input().split()))\r\nc=c1=0\r\nfor i in range(n):\r\n c+=int(a[i]//(2*k))\r\n a[i]=a[i]%(2*k)\r\n if a[i]>k:\r\n c+=1\r\n a[i]=0\r\n if a[i]>0:\r\n c1+=1\r\n# print(a)\r\n\r\nprint(c+math.ceil(c1/2))", "from math import *\r\nn,k = map(int,input().split())\r\n*m,=map(int,input().split())\r\nd=0.0\r\nfor i in m:\r\n d+=ceil(i/k)\r\nprint(ceil(d/2))\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nhelp = 0\r\nfor i in a:\r\n help += i // k\r\n if i % k != 0:\r\n help += 1\r\nif help % 2 != 0:\r\n help += 1\r\nhelp = help // 2\r\nprint(help)", "s = input()\n(n,k) = s.split()\nn = int(n)\nk = int(k)\nw = list()\nret = 0\ns = input()\nw = s.split()\nfor i in w:\n\tt = int(i)\n\tret += (t+k-1)//k\nret = (ret+1)//2\nprint(ret)\n", "n,k=map(int,input().split())\r\nw=list(map(int,input().split()))\r\nsum=0\r\nfor i in w:\r\n a=i/k\r\n if a>int(a):sum+=(int(a)+1)\r\n else:sum+=(int(a))\r\nsum/=2\r\nif sum>int(sum): print(int(sum)+1)\r\nelse:print(int(sum))", "from math import ceil\r\nn,k=map(int, input().split())\r\nw=[int(t) for t in input().split()]\r\nres=x=0\r\nfor i in range(n):\r\n x = w[i] / k\r\n y=ceil(x)\r\n res+=y\r\nprint(ceil(res/2))", "n,k = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nprint((sum((val+k-1)//k for val in lst)+1)//2)", "import math\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nres=0\r\nfor i in a:\r\n\tres+=math.ceil(i/k)\r\nprint(math.ceil(res/2))\r\n", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n \r\nn,k = ilele()\r\nA = alele()\r\nif k==1:\r\n print(math.ceil(sum(A)/2))\r\n exit(0)\r\nA.sort()\r\nday =1\r\na = -1;b = -1\r\nfor i in A:\r\n if i <= k:\r\n if a==-1:\r\n a=1\r\n elif b == -1:\r\n b = 1\r\n else:\r\n day+=1\r\n a = 1\r\n b = -1\r\n else:\r\n pockets = math.ceil(i/k)\r\n c = pockets//2\r\n day += c\r\n x = pockets % 2\r\n if x == 1:\r\n if a==-1:\r\n a=1\r\n elif b == -1:\r\n b = 1\r\n else:\r\n day+=1\r\n a = 1\r\n b = -1\r\nprint(day)\r\n\r\n\r\n\r\n", "#!/usr/bin/env python\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n w = [int(c) for c in input().split()]\r\n days = []\r\n for x in w:\r\n days.append(x//k if x%k == 0 else x//k+1)\r\n\r\n s = sum(days)\r\n print(s//2 if s % 2 == 0 else s//2+1)\r\n \r\n\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor _ in w:\r\n ans += (_ + k - 1) // k\r\n \r\nprint((ans + 1) // 2)\r\n ", "n, k = map(int, input().split())\r\nans = 0\r\na = [int(i) for i in input().split()]\r\nfor i in a : ans += (i + k - 1) // k\r\nprint ((ans + 1) // 2)", "import math\r\nn, k = map(int, input().split())\r\nw = [int(x) for x in input().split()]\r\npockt = 0\r\n\r\nfor i in range(n):\r\n pockt += w[i]//k\r\n w[i] = w[i]%k\r\n\r\npockt += sum([1 if x!=0 else 0 for x in w])\r\nprint(math.ceil(pockt/2))\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=0\r\nfor i in l:\r\n a=a+(i+k-1)//k\r\nprint((a+1)//2)\r\n", "s = input().split()\r\nn, k = int(s[0]), int(s[1])\r\nl = []\r\ns = input().split()\r\n\r\nfor i in range(n):\r\n l.append(int(s[i]))\r\n\r\na = []\r\nfor i in range(n):\r\n a.append((int(l[i] / k), l[i] % k))\r\n\r\nfullDays = 0\r\nmodDays = 0\r\n\r\nfor i in range(n):\r\n if a[i][0]:\r\n fullDays += a[i][0]\r\n if a[i][1]:\r\n modDays += 1\r\n \r\nif fullDays % 2 == 0 and modDays % 2 == 0:\r\n print(int(fullDays / 2) + int(modDays / 2))\r\nelse:\r\n print(int(fullDays / 2) + int(modDays / 2) + 1)", "n, k = map(int, input().split())\r\nans = 0\r\nfor w in list(map(int, input().split())):\r\n ans += (w // k) + (0 if w % k == 0 else 1)\r\nprint(ans // 2 + ans % 2)", "n, k = map(int, input().split())\r\nans = 0\r\nfor i in input().split() : ans += (int(i) + k - 1) // k\r\nprint ((ans + 1) // 2)", "n, k = [int(x) for x in input().split()]\r\nstones = [int(x) for x in input().split()]\r\npockets = [(x + k - 1) // k for x in stones]\r\ndays = (sum(pockets) + 1) // 2\r\nprint(days)", "# import sys\r\n# \r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nsum = 0\r\nfor item in arr:\r\n sum += int((item + k - 1) / k)\r\n\r\nprint(int((sum+1)/2))", "parameters = [int(i) for i in input().split()]\npebbles = [int(i) for i in input().split()]\nn = parameters[0]\nk = parameters[-1]\ncounter = 0\nfor pebble in pebbles:\n x = pebble/k\n if x > int(x):\n counter += int(x) + 1\n else:\n counter += int(x)\ndays = counter/2\nif days > int(days):\n print(int(days + 1))\nelse:\n print(int(days))\n\n\n\n\n\n\n", "import math\r\n\r\nn, k = map( int, input().split() )\r\nW = list( map( int, input().split() ) )\r\npocket = []\r\n\r\nW.sort(reverse=True)\r\n\r\nfor i in range(n):\r\n pocket.append( math.ceil(W[i]/k) )\r\nprint( math.ceil(sum(pocket)/2 ) ) \r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor x in a:\r\n\tans += x // k + (1 if x % k != 0 else 0)\r\nprint(ans // 2 + ans % 2)", "n,k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\ndays = 0\r\nheaps = 0\r\ntemp = 0\r\nfor i in range (n):\r\n heaps = w[i] // k\r\n if w[i] % k != 0 :\r\n heaps += 1\r\n days += (heaps + temp) // 2\r\n if (heaps + temp) % 2 != 0:\r\n temp = 1\r\n else:\r\n temp = 0\r\nprint(days + temp)\r\n", "import sys\r\nn,k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nrem = 0\r\nans = 0\r\nfor i in range(n):\r\n \r\n if w[i] % k != 0:\r\n rem +=1\r\n ans += w[i] // k;\r\nres = 0\r\nres += ans// 2\r\nif ans % 2 != 0:\r\n rem += 1\r\nres += rem // 2\r\nif rem % 2 != 0:\r\n res += 1\r\nprint(res)\r\n ", "def main():\r\n n, k = map(int, input().split())\r\n ws = list(map(int, input().split()))\r\n\r\n n_pockets = 0\r\n for w in ws:\r\n n = w // k\r\n n_pockets += n\r\n if n * k != w:\r\n n_pockets += 1\r\n\r\n if n_pockets % 2 == 0:\r\n print(n_pockets // 2)\r\n else:\r\n print(n_pockets // 2 + 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n # import sys\r\n # sys.stdin = open(\"A.txt\")\r\n main()\r\n", "n, k = map(int, input().split())\nA = list(map(int, input().split()))\ns = 0\nfor i in range(n):\n\ts += (A[i] + k - 1) // k\nprint((s + 1) // 2)", "import math\r\nif 1:\r\n n,k=map(int,input().split())\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n x,c=0,0\r\n for i in range(n-1):\r\n x=math.ceil(l[i]/k)\r\n l[i+1]-=x*k\r\n if l[i+1]<=0:\r\n l[i+1]=0\r\n c+=x\r\n if l[-1]>0:\r\n print(c+math.ceil(l[-1]/(2*k)))\r\n else:\r\n print(c)\r\n \r\n", "I = lambda: list(map(int, input().split()))\r\nn, k = I()\r\nw = I()\r\nprint((sum([(i+k-1)//k for i in w])+1)//2)", "n,k = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in a:\r\n ans += (i-1)//k+1\r\nprint ((ans-1)//2+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed May 29 14:40:49 2019\r\n\r\n@author: avina\r\n\"\"\"\r\nfrom math import ceil\r\nn,m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\ni = 0;u = 0\r\ndays = 0\r\n\r\nwhile i <n:\r\n if l[i] >= 2*m:\r\n days+= l[i]//(2*m)\r\n b = l[i]%(2*m)\r\n if b >m:\r\n days+=1\r\n else:\r\n if b!= 0:\r\n u+=1\r\n elif l[i]>m:\r\n days+=1\r\n else:\r\n u+=1\r\n i+=1\r\nprint(days+ceil(u/2))", "from math import ceil\nn, k = map(int, input().split())\nw = map(int, input().split())\npocket_travels = [ceil(i/k) for i in w]\ndays = ceil(sum(pocket_travels)/2)\nprint(days)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\na.sort()\r\n\r\ni=0\r\nans=0\r\nwhile(i<n):\r\n\t# print(i,ans)\r\n\tif a[i]>(2*k):\r\n\t\tif a[i]%(2*k)==0:\r\n\t\t\tans+=a[i]//(2*k)\r\n\t\t\ti+=1\r\n\t\telse:\r\n\t\t\tif a[i]%(2*k)>k:\r\n\t\t\t\tans += a[i]//(2*k) + 1\r\n\t\t\t\ti+=1\r\n\t\t\telse:\r\n\t\t\t\tif i<n-1 and a[i+1] > k:\r\n\t\t\t\t\ta[i+1] -= k\r\n\t\t\t\t\tans += a[i]//(2*k) + 1\r\n\t\t\t\t\ti+=1\r\n\t\t\t\telse:\r\n\t\t\t\t\tans += a[i]//(2*k) + 1\r\n\t\t\t\t\ti+=2\r\n\telif a[i]>k:\r\n\t\tans +=1\r\n\t\ti+=1\r\n\telse:\r\n\t\tif i<n-1 and a[i+1] > k:\r\n\t\t\ta[i+1] -= k\r\n\t\t\tans += 1\r\n\t\t\ti+=1\r\n\t\telse:\r\n\t\t\tans += 1\r\n\t\t\ti+=2\r\n\r\nprint(ans)", "from math import ceil\r\n\r\nn, k = map(int, input().split())\r\n\r\narr = map(int, input().split())\r\n\r\ns = 0\r\n\r\nfor p in arr:\r\n s += ceil(p / k)\r\n\r\nprint(ceil(s/2))", "#!/usr/bin/env python3\n\n\ndef ri():\n return map(int, input().split())\n\n\nn, k = ri()\n\nw = list(ri())\n\nans = 0\nfor ww in w:\n if ww % k == 0:\n ans += ww//k\n else:\n ans += ww//k + 1\n\nif ans%2:\n print(ans//2+1)\nelse:\n print(ans//2)\n\nprint\n\n", "n, k = [int(x) for x in input().split()]\r\nw = [int(x) for x in input().split()]\r\n\r\nwyn = 0\r\nfor i in w:\r\n if i/k > i//k:\r\n wyn += i//k + 1\r\n else:\r\n wyn += i//k\r\n\r\nif wyn/2 > wyn//2:\r\n print(wyn//2 + 1)\r\nelse:\r\n print(wyn//2)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nprint((sum([(a[i] + k - 1) // k for i in range(n)]) + 1) // 2)\n\n \t\t \t\t \t \t \t\t\t \t \t\t\t\t\t\t", "a=int(input().split()[1])\r\nb=0\r\nfor i in map(int,input().split()):\r\n c,d=divmod(i,a)\r\n b+=c+bool(d)\r\nprint((b+1)//2)\r\n", "import math\r\nn, k = [int(x) for x in input().split()]\r\nl = list(map(int, input().split()))\r\nc = 0\r\ni = 0\r\nwhile 1:\r\n if i == n: break\r\n temp = math.ceil(l[i] / k)\r\n c += temp\r\n i += 1\r\nc = math.ceil((c / 2))\r\nprint(c)", "n, k = map(int, input().split())\r\nw = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(n):\r\n ans += w[i] // k + (w[i] % k + k - 1) // k\r\nprint(ans // 2 + (ans % 2 + 1) // 2)", "import math\r\nn,k=map(int,input().split())\r\na = list(map(int,input().split()))\r\nres = [math.ceil(a[i]/k) for i in range(n)]\r\ns=sum(res)\r\nprint(math.ceil(s/2))", "from math import *\r\nn,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans= 0\r\nfor i in range(n):\r\n if(l[i]<=m):\r\n ans+=0.5\r\n else:\r\n if(l[i]//m%2==0):\r\n if(l[i]%m==0):\r\n ans+=(l[i]//m)//2\r\n else:\r\n ans+=(l[i]//m)//2+0.5\r\n else:\r\n if (l[i] % m == 0):\r\n ans += (l[i] // m) // 2 +0.5\r\n else:\r\n ans += (l[i] // m) // 2 + 1\r\nprint(ceil(ans))", "n,k = map(int,input().split())\r\nw = list(map(int,input().split()))\r\ncnt = 0\r\nres = 0\r\nfor i in w:\r\n cnt += (i+k-1)//k\r\nprint((cnt+1)//2)", "from math import ceil\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n l = list(map(int, input().split()))\r\n\r\n for i in range(n):\r\n l[i] = ceil(l[i]/k)\r\n\r\n r=0\r\n l.sort()\r\n# print(l)\r\n for i in range(n):\r\n if i+1!=n and l[i]:\r\n r+=l[i]\r\n l[i+1]-=l[i]\r\n l[i]=0\r\n# print(l)\r\n# print(r)\r\n return r+ceil(l[-1]/2)\r\nprint(solve())\r\n", "n, k = map(int, input().split())\r\nw = sorted(list(map(int, input().split())))\r\noutput = 0\r\nfor i in range(n):\r\n output += w[i] // k\r\n if w[i] % k > 0:\r\n output += 1\r\nprint(int(output) // 2 if int(output) % 2 == 0 else (int(output) // 2) + 1)", "import sys, heapq\r\n\r\nn, k = map(int, sys.stdin.readline().split())\r\narr = list(map(int, sys.stdin.readline().split()))\r\nans = []\r\nfor i in arr:\r\n ans.append(i // k if i % k == 0 else i // k + 1)\r\nprint(sum(ans) // 2 if sum(ans) % 2 == 0 else sum(ans) // 2 + 1)", "import math\nline = input()\npebble_types, pocket_size = line.split()\npebble_types, pocket_size = int(pebble_types), int(pocket_size)\n\nline = input()\n\na = [int(i) for i in line.split()]\n\ntotal = 0\nfor i in a:\n total = total + math.ceil(i / pocket_size)\n\nprint(math.ceil(total / 2))\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ns = 0\r\nfor i in a:\r\n s += (i + k - 1) // k\r\n \r\nprint((s + 1) // 2)", "from math import ceil\r\n\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\ndays = 0\r\n\r\nfor i in w:\r\n\tdays += ceil(i/k)\r\n\r\nprint(ceil(days/2))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\nn, k = [int(a) for a in input().strip().split()]\r\nw = [int(a) for a in input().strip().split()]\r\ncount = 0\r\nfor _w in w:\r\n l = _w//k\r\n count+=l\r\n _w -= l*k\r\n if _w:\r\n count+=1\r\nprint(math.ceil(count/2))", "from sys import stdin, stdout\n\n\nn, k = map(int, stdin.readline().rstrip().split())\n\npebbleList = [int(a) for a in stdin.readline().rstrip().split()]\n\nnTrips=[]\nfor i in range(n):\n nTrips.append(pebbleList[i]//k)\n if pebbleList[i]%k!=0:\n nTrips[i]+=1\n\ntotal = sum(nTrips)//2 + sum(nTrips)%2\nprint(total)\n", "def mapit():\r\n\ttemp=list(map(int,input().split()))\r\n \r\n\treturn temp\r\n\r\nimport math\r\ndef solution():\r\n\tn,k=mapit()\r\n\tarr=mapit()\r\n\t\r\n\tans=0\r\n\tfor i in range(n):\r\n\t\ttp=math.ceil(arr[i]/k)\r\n\t\tans+=tp\r\n\tans=math.ceil(ans/2)\r\n\tprint(int(ans))\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\t\t\r\n\r\n\r\n\treturn\r\n\t\r\n\r\n\r\n# t=int(input())\r\n \r\n# while t:\r\n# \tt-=1\r\nsolution()\r\n", "# -*- coding: utf-8 -*-\r\n#n = int(input())\r\nst = input().split(\" \")\r\nst1 = input().split(\" \")\r\nfor p in range(2):\r\n st[p] = int(st[p])\r\nfor p in range(st[0]):\r\n st1[p] = int(st1[p])\r\nst2 = []\r\nst3 = []\r\nfor i in range(st[0]):\r\n st2.append(st1[i] % (2*st[1]))\r\n st1[i] = st1[i] // (2*st[1])\r\nfor i in range(st[0]):\r\n st3.append(st2[i] % st[1])\r\n st2[i] = st2[i] // st[1]\r\ncount2 = 0\r\nsum = 0\r\nsum1 = 0\r\nfor i in range(st[0]):\r\n if st3[i] != 0:\r\n count2 = count2 +1\r\n sum = sum + st1[i]\r\n sum1 = sum1 + st2[i]\r\ncoun = sum + (sum1+count2)//2 + (sum1+count2)%2\r\n\r\n\r\nprint(coun)", "from math import ceil\r\nn,k=map(int,input().split())\r\nl=list(map(lambda x:ceil(int(x)/k),input().split()))\r\nprint(ceil(sum(l)/2))\r\n", "import sys\ninput = sys.stdin.readline\n\nn, k = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nans = 0\nfor i in range(n):\n ans += (a[i] - 1) // k + 1\nprint((ans - 1) // 2 + 1)\n", "str1 = str(input())\r\n\r\nn = int(str1.split(' ')[0])\r\nk = int(str1.split(' ')[1])\r\n\r\nstr2 = str(input())\r\nlis = str2.split(' ')\r\npocket = [int(i)//k + 1 if int(i) % k != 0 else int(i)//k for i in lis]\r\n\r\nif sum(pocket) % 2 == 0:\r\n print(sum(pocket)//2)\r\nelse:\r\n print(sum(pocket)//2 + 1)", "#Anuneet Anand\r\n\r\nn,k = map(int,input().split())\r\nW = list(map(int,input().split()))\r\n#W.sort()\r\n\r\nc = 0\r\nfor i in W:\r\n\tc = c+(i-1)//k+1\r\nprint((c+1)//2)", "n, k=map(int, input().split())\r\nl=[int(x) for x in input().split()]\r\nans=0\r\nfor x in l:\r\n\tans+=(x+k-1)//k\r\nprint((ans+1)//2)", "n , k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ns = 0\r\nfor i in l:\r\n s += i // k\r\n if i % k != 0:\r\n s += 1\r\nprint(s // 2 + s % 2)\r\n", "n,k=map(int,input().split())\r\nw=list(map(int,input().split()))\r\nb=[]\r\nsum=0\r\nfor i in range(n):\r\n if((w[i])%k==0):\r\n b.append(w[i]/k)\r\n else:\r\n b.append(((w[i])//k)+1)\r\n sum+=b[i]\r\nif(sum%2==0):\r\n print(int(sum//2))\r\nelse:\r\n print(int((sum//2)+1))", "import math\r\nn, k = list(map(int, input().split(\" \")))\r\nw = list(map(int, input().split(\" \")))\r\ns = 0\r\nfor i in range(n):\r\n s += math.ceil(w[i]/k)\r\ns = math.ceil(s/2)\r\nprint(s)", "import math\r\nn,k = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\ns=0\r\nfor j in range(n):\r\n s+=math.ceil(lst[j]/k)\r\nprint(math.ceil(s/2))\r\n \r\n \r\n ", "import math\r\nn,k =map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\nl_1=[]\r\nl_2=[]\r\nfor i in range (0,n):\r\n l_1.append(l[i]//k)\r\n l_2.append(l[i]%k)\r\np=sum(l_1)\r\nq=len(l_2)-l_2.count(0)\r\nprint(math.ceil((p+q)/2))\r\n", "n,k=map(int,input().split())\r\nw=[int(i) for i in input().split()]\r\nh=0\r\nfor i in w:\r\n if(i%k):\r\n h+=int((i-i%k)/k)+1\r\n else:\r\n h+=int(i/k)\r\nif(h%2):\r\n print(int((h+1)/2))\r\nelse:\r\n print(int(h/2))", "n,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nans=[]\r\nfor i in l:\r\n ans.append((i+k-1)//k)\r\nprint((sum(ans)+1)//2)", "n,k=map(int,input().split())\r\nans=0\r\nfor i in input().split():ans+=(int(i)+k-1)//k\r\nprint((ans+1)//2)", "if __name__ == '__main__':\n n, k = map(int, input().split())\n W = list(map(int, input().split()))\n ans = 0\n for w in W:\n ans += w // k + int(w % k != 0)\n print(ans // 2 + int(ans % 2 != 0))\n", "def R():\n return [int(x) for x in input().split()]\n\nif __name__ == '__main__':\n n, k = R()\n w = R()\n result = 0\n for _w in w:\n if _w < k:\n result += 1\n elif _w % k == 0:\n result += _w // k\n else:\n result += _w // k + 1\n\n if result % 2 == 0:\n print(result // 2)\n else: \n print(result // 2 + 1)\n", "n,k=map(int,input().split())\narr=map(int,input().split())\nfrom math import ceil\npockets=0\nfor i in arr:\n pockets+=ceil(i/k)\nprint(ceil(pockets/2))\n", "n, k = map(int, input().split())\r\na = map(int, input().split())\r\ncnt = 0\r\nfor x in a:\r\n cnt += (x + k - 1)//k\r\n\r\nprint((cnt+1)//2)", "a1=input()\r\nb1=input()\r\nL1=a1.split()\r\nn=int(L1[0])\r\nk=int(L1[1])\r\nL2=b1.split()\r\nw=[]\r\nfor i in L2:\r\n w.append(int(i))\r\n\r\ns=0\r\nfor i in w:\r\n if i%k==0:\r\n a=i//k\r\n else:\r\n a=(i//k)+1\r\n s+=a\r\n\r\nif s%2==0:\r\n ans=s//2\r\nelse:\r\n ans=(s//2)+1\r\n\r\nprint(ans)\r\n\r\n", "import itertools\r\nimport math\r\nfrom collections import defaultdict\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n, k = input_ints()\r\n a = input_ints()\r\n ans = 0\r\n for x in a:\r\n ans += (x + k - 1) // k\r\n ans = (ans + 1) // 2\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "import math\r\nn,k = map(int,input().split())\r\nli = list(map(int,input().strip().split()))[:n] \r\ntotal=0\r\nfor i in li:\r\n temp=math.ceil(i/k)\r\n total+=temp\r\nans = math.ceil(total/2)\r\nprint(ans)\r\n\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().strip().split()))[:n]\r\nimport math as m\r\na=0\r\nfor i in range(n):\r\n a=a+m.ceil(l[i]/k)\r\nprint(m.ceil(a/2))", "from math import ceil\r\nn,k = map(int, input().split())\r\ns= list(map(int, input().split()))\r\ndays=0\r\nfor i in s:\r\n days+=ceil(i/k)\r\nprint(ceil(days/2))", "from math import ceil\r\n[n, k] = [int(x) for x in input().split()]\r\n\r\nw = [ceil(int(x)/k) for x in input().split()]\r\nres = ceil(sum(w) / 2)\r\n\r\nprint(res)", "import math\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor i in a:\r\n s=s+math.ceil(i/k)\r\nprint(math.ceil(s/2))", "import math\r\n\r\nn,k = map(int,input().split())\r\nl = list(map(int, input().split()))\r\ns=0\r\nfor i in l:\r\n s+=(math.ceil(i/k))\r\nprint(math.ceil(s/2))", "n, k = map(int, input().split())\nw = list(map(int, input().split()))\nr = sum(map(lambda x: (x+k-1)//k, w))\nprint((r+1)//2)\n", "def f(l1,l2):\r\n n,k = l1\r\n ps = sum([(w+k-1)//k for w in l2])\r\n return (ps+1)//2\r\n\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\nprint(f(l1,l2))\r\n", "import math\r\ndef solve():\r\n\r\n n,k=list(map(int,input().split(\" \")))\r\n lst=list(map(int,input().split(\" \")))\r\n \r\n s=0\r\n for i in lst:\r\n s+=math.ceil(i/k)\r\n \r\n print(math.ceil(s/2))\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\nsolve();", "n, k = (int(v) for v in input().split())\r\nw = list(int(v) for v in input().split())\r\nup = lambda a, d: a//d + (1 if a%d else 0)\r\nprint(up(sum(up(v, k) for v in w), 2))\r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ns = 0\r\nfor item in a:\r\n s+=item//k\r\n if(item%k!=0):\r\n s+=1\r\nif(s%2==1):\r\n print(s//2 + 1)\r\nelse:\r\n print(s//2)\r\n", "import math\r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\npocket = 0\r\nfor i in range(n):\r\n pocket += int(math.ceil(arr[i]/k))\r\nprint(int(math.ceil(pocket/2)))", "from math import ceil\r\nn,m=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nres=0\r\nfor i in s:\r\n res+=ceil(i/m)\r\nprint(ceil(res/2))", "from collections import deque\nfrom sys import stdin\nfrom math import ceil\nlines = deque(line.strip() for line in stdin.readlines())\n\ndef nextline():\n return lines.popleft()\n\ndef types(cast):\n return tuple(int(x) for x in nextline().split())\n\ndef ints():\n return types(int)\n\ndef strs():\n return nextline().split()\n\ndef main():\n # lines will now contain all of the input's lines in a list\n n, k = ints()\n ws = ints()\n count = ceil(sum(ceil(x/k) for x in ws)/2)\n print(count)\n\n\nif __name__ == '__main__':\n main()\n", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\n\ndivk = 0\nfor e in arr:\n d, m = divmod(e, k)\n if m != 0:\n d += 1\n divk += d\n\nprint((divk + 1) // 2)\n", "from sys import stdin\nimport math\n\nN, K = map(int, stdin.readline().split())\npebbles = list(map(int, stdin.readline().split()))\n\nprint(math.ceil(sum(math.ceil(p / K) for p in pebbles) / 2))\n", "import math\r\nn,k = map(int,input().split())\r\noutput = 0\r\nl = list(map(int,input().split()))\r\n\r\nfor i in range(0,n):\r\n output+=math.ceil(l[i]/k)\r\n\r\nprint(math.ceil(output/2.0))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed May 29 15:51:43 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nfrom math import ceil\r\nn,m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\n \r\ni = 0;u = 0\r\ndays = 0\r\n\r\nfor i in range(n):\r\n days += ceil(l[i]/m)\r\nprint(ceil(days/2))", "if __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n line = map(int, input().split())\r\n line = [(it + k - 1) // k for it in line]\r\n print((sum(line) + 1) // 2)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nnum = 0\r\nfor i in range(n):\r\n num += a[i] // k\r\n num += int(a[i] % k != 0)\r\n\r\nprint(num // 2 + int(num % 2 != 0))\r\n", "def solve(f, n_lst):\r\n ans=0\r\n for i in range(len(n_lst)):\r\n tmp = n_lst[i]\r\n ans+=(tmp+f-1)//f\r\n fn=(ans+1)//2\r\n return fn\r\n\r\nn,f=map(int,input().split())\r\nn_lst = list(map(int,input().split()))\r\nprint(solve(f,n_lst))\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))[:n]\r\nq1,z,c=0,0,0\r\nfor i in a:\r\n if i<=k:\r\n c+=1\r\n else:\r\n if i%k==0:\r\n q=i//k\r\n c+=q\r\n else:\r\n q1=i//k\r\n q1+=1\r\n c+=q1\r\n\r\nif c%2==0:\r\n print(c//2)\r\nelse:\r\n z=c//2\r\n z+=1\r\n print(z)\r\n", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(0, n):\r\n ans += (a[i] + k - 1) // k\r\nprint((ans + 1) // 2)\r\n", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nans = 0\r\nimport math\r\nfor i in l:\r\n ans += math.ceil(i/k)\r\nprint( math.ceil(ans/2))\r\n", "'''input\n5 4\n3 1 8 9 7\n'''\nfrom math import ceil\nn, k = map(int, input().split())\nw = list(map(int, input().split()))\nfor x in range(n):\n\tif w[x] % k == 0:\n\t\tw[x] //= k\n\telse:\n\t\tw[x] //= k\n\t\tw[x] += 1\nprint(ceil(sum(w)/2))\n\n\n\n\n\n\n", "import math\r\nn,k=map(int, input().split(' '))\r\nt=[int(c) for c in input().split(' ')]\r\n# s=sum(t)\r\ns=0\r\nfor i in t:\r\n s=s+math.ceil(i/k)\r\n# print(s)\r\nb=math.ceil(s/2)\r\nprint(b)", "from math import ceil\r\nx, y=map(int, input().split())\r\nt=input()\r\na=ceil(sum([ceil(int(i)/y) for i in t.split()])/2)\r\nprint(a)\r\n", "n,k=map(int,input().split(' '))\r\narr=[int(i) for i in input().split(' ')]\r\ns=0\r\nfor i in range(n):\r\n s+=(arr[i]+k-1)//k\r\nprint((s+1)//2)", "n, k = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\n\r\ns = [z // k + (0 if z % k == 0 else 1) for z in w]\r\n\r\nans = sum(s)\r\nans = ans // 2 + (0 if ans % 2 == 0 else 1)\r\n\r\nprint(ans)", "n,k=input ().strip ().split (' ')\r\nn,k=(int (n),int (k ))\r\nlist1=list (map (int,input ().strip ().split (' ')))\r\na=0\r\nb=0\r\nk2=2*k\r\nfor x in list1:\r\n if x%k==0:\r\n a+=(x//k)\r\n else:\r\n a+=(x//k)+1\r\nprint (a//2+a%2 )", "n,k = map(int, input().split())\nws = list(map(int, input().split()))\n\nsum = 0\nfor i in range(n):\n sum += ws[i]//k + (ws[i]%k > 0)\n\nprint(sum//2 + (sum%2 > 0))", "from math import *\r\nfirst = input();\r\nfirst = [int(x) for x in first.split()]\r\nn = first[0]\r\nk = first[1]\r\na = input()\r\na = [int(x) for x in a.split()]\r\nfor i in range(n):\r\n a[i] = ceil(float(a[i])/k)\r\na.sort()\r\nans = 0\r\nfor i in range(n):\r\n if a[i]==0:\r\n continue\r\n elif i==n-1:\r\n ans += ceil(float(a[i])/2)\r\n else:\r\n x = min(a[i],a[i+1])\r\n ans += x;\r\n a[i] -= x\r\n a[i+1] -= x\r\nprint (ans)\r\n ", "n,k=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nt=0\r\nfor i in range(n):\r\n t+=a[i]//k\r\n if a[i]%k!=0:\r\n t+=1\r\nh=t//2\r\nif t%2==1:\r\n h+=1\r\nprint(h)\r\n", "# A. Anastasia and pebbles\r\nimport math\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in a:\r\n ans+=math.ceil(i/k) \r\nprint(math.ceil(ans/2))\r\n \r\n", "import math\r\nn,k=map(int,input().split())\r\nw=[int(i) for i in input().split()]\r\nres=[]\r\nfor i in range(n):\r\n res.append(w[i]//k)\r\n res.append(bool(w[i]%k))\r\nprint(math.ceil(sum(res)/2))\r\n", "n, k = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\nres = 0\r\nfor i in a:\r\n res += (i+k-1) // k\r\n\r\nprint((res+1)//2)", "from math import ceil\r\nv,m = map(int,input().split())\r\nt = 0\r\nl = list(map(int,input().split()))\r\nfor x in l:\r\n t += ceil(x/m)\r\nprint(ceil(t/2))", "n,k=map(int,input().split())\r\nip=list(map(int,input().split()))\r\ncount=0\r\nfor i in ip:\r\n if i%k==0:\r\n count+=i//k\r\n else:\r\n count+=(i//k)+1\r\nif count %2==0:\r\n print(count//2)\r\nelse:\r\n print(count//2 + 1)", "from math import *\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s=s+ceil(l[i]/k)\r\nprint(ceil(s/2))", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nz=0\r\nfor x in a:\r\n z+=(x+k-1)//k\r\nprint((z+1)//2)\r\n", "import math\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=0\r\nfor i in l:\r\n x+=math.ceil(i/k)\r\nprint(math.ceil(x/2))", "import math\r\nn,k=map(int,input().split())\r\nw=list(map(int,input().split()))\r\nd=0\r\nfor i in w:\r\n d+=math.ceil(i/k) \r\nprint(math.ceil(d/2))\r\n", "from math import ceil as ce\r\nfrom bisect import bisect_right as br\r\nn,k=map(int,input().split())\r\nw=sorted(list(map(int,input().split())))\r\nans=0\r\nsi= br(w,k)\r\nif si % 2:\r\n ans+= ce(si/2)\r\n ch=1\r\nelse:\r\n ch=0\r\n ans+= si//2\r\ndi= br(w,(2*k))\r\nans+= di-si\r\nnos=0\r\nfor i in range(di,n):\r\n nos+=ce(w[i]/k)\r\nif nos >0:\r\n nos-=ch\r\nans+=ce(nos/2)\r\nprint(ans)", "from math import ceil\nread = lambda: tuple(map(int, input().split()))\nn, k = read()\nv = sum([ceil(x / k) for x in read()])\n \nprint(ceil(v / 2))\n", "z=input()\r\nz=z.split()\r\nn=int(z[0])\r\nk=int(z[1])\r\na = []\r\nc = []\r\nz=input()\r\nz=z.split()\r\nfor i in range(n):\r\n b=int(z[i])\r\n a.append(b)\r\nfor i in a:\r\n if i%k==0:\r\n b = i//k\r\n c.append(b)\r\n else:\r\n b = (i//k)+1\r\n c.append(b)\r\nd = sum(c)\r\nif d%2==0:\r\n print(d//2)\r\nelse :\r\n print((d//2)+1)", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"ou.out\",'w')\r\nfrom math import ceil\r\nn,k=map(int,input().split())\r\nw=list(map(int,input().split()))\r\nd=0\r\nfor i in range(n):\r\n\tx=ceil(w[i]/k)\r\n\td+=x\r\nprint(ceil(d/2))", "n, k = map(int, input().split())\r\nnum = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if num[i] % k != 0:\r\n ans += (int(num[i] / k )+ 1)\r\n else:\r\n ans += (int(num[i] / k))\r\n\r\nif (ans % 2 == 0):\r\n print(int (ans / 2))\r\nelse:\r\n print(int(ans / 2) + 1)\r\n\r\n\r\n\r\n", "import math\nx,y=map(int,input().split())\narr=list(map(int,input().split()))\ns=0\nfor i in range(0,x):\n s=s+math.ceil(arr[i]/y)\nprint(math.ceil(s/2))\n", "import math\n\n\nclass CodeforcesTask789ASolution:\n def __init__(self):\n self.result = ''\n self.n_k = []\n self.w = []\n\n def read_input(self):\n self.n_k = [int(x) for x in input().split(\" \")]\n self.w = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n pockets = [math.ceil(x / self.n_k[1]) for x in self.w]\n self.result = str(int(math.ceil(sum(pockets) / 2)))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask789ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n,k= map(int,input().split())\r\n\r\np = map(int,input().split())\r\n\r\nmod = 0\r\nans = 0\r\nfor x in p:\r\n t = x//k + (1 if x%k !=0 else 0)\r\n ans += (t+mod)//2\r\n mod = (t+mod)%2\r\n\r\nif mod == 1: ans +=1\r\nprint(ans)\r\n", "import sys \r\ninput = sys.stdin.readline \r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split())) \r\n\r\nc = 0 \r\nfor i in range(n):\r\n c = c + 1 + a[i] // k if a[i] % k else c + a[i] // k \r\n \r\nc = c // 2 if c % 2 == 0 else c // 2 + 1 \r\nprint(c)\r\n", "import math\r\nn,k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\n\r\nli = []\r\nans = 0\r\nfor i in arr:\r\n\tans+= math.ceil(i/k)\r\nprint(math.ceil(ans/2))\r\n", "n, k = map(int, input().split())\r\nwi = list(map(int, input().split()))\r\ndays = 0.\r\nk2 = 2*k\r\nfor w in wi:\r\n if w%k==0:\r\n days += (w // k) * 0.5\r\n else:\r\n days += (1 + (w // k)) * 0.5\r\ndays = int(days) if days==int(days) else int(days)+1\r\nprint(days)", "from math import ceil\r\nn,k=map(int,input().split())\r\narr =list(map(int,input().split()))\r\ncnt = 0\r\nfor i in range(0,n):\r\n if arr[i]%k!=0:\r\n arr[i]=(arr[i]+k-1)//k\r\n else :arr[i]=arr[i]//k\r\nprint(ceil(sum(arr)/2))", "import math\nn,k=input().split()\n\nl=[]\nl=input().split()\n\nc=0\nfor i in range(0,len(l)):\n\tb=int(l[i])\n\tc=c+math.ceil(b/int(k))\n\t\nprint (math.ceil(c/2))\n", "from math import ceil\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tl[i]=ceil(l[i]/k)\r\nprint(ceil(sum(l)/2))", "from math import ceil\r\nn,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\nx=list(map(int,(input().split())))\r\n\r\ny=[]\r\n\r\nfor i in range(n):\r\n y.append(ceil(x[i]/k))\r\n\r\nprint(ceil(sum(y)/2))\r\n", "\n\nn, k = map(int, input().split())\n\nws = list(int(x) for x in input().split())\n\nresult = 0\nfree_pocket = False\n\n\nfor w in ws:\n needed_pockets = (w + k - 1) // k\n if needed_pockets % 2 == 0:\n result += needed_pockets // 2\n else:\n if free_pocket:\n result += (needed_pockets - 1) // 2\n else:\n result += (needed_pockets + 1) // 2\n free_pocket = not free_pocket\n\nprint(result)\n", "x,y=input().split(' ')\r\nx,y=int(x),int(y)\r\ntotal=0\r\nml=list(input().split(' '))\r\nfor i in ml:\r\n a=int(i)\r\n total=total+a//y\r\n if(a%y>0):\r\n total+=1\r\n\r\ntotal=(total%2)+(total//2)\r\n\r\nprint(total)", "import math\nn,k = map(int,input().split())\nl = list(map(int,input().split())); cnt =0;s = 0\nfor i in l:\n s+=math.ceil(i/k)\nprint(math.ceil(s/2))\n \n\t\t \t\t\t\t \t\t \t\t \t\t\t \t\t\t", "import math\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n w = [int(i) for i in input().split(\" \")]\r\n day_counter = 0\r\n only_on_pocket_empty = False\r\n for pebbels in w:\r\n if only_on_pocket_empty:\r\n pockets_needed = math.ceil(pebbels / k)\r\n if pockets_needed % 2 == 1:\r\n pockets_needed -= 1\r\n only_on_pocket_empty = False\r\n day_counter += pockets_needed // 2\r\n else:\r\n day_counter += pockets_needed // 2\r\n else:\r\n pockets_needed = math.ceil(pebbels / k)\r\n if pockets_needed % 2 == 0:\r\n day_counter += pockets_needed // 2\r\n else:\r\n day_counter += math.ceil(pockets_needed / 2)\r\n only_on_pocket_empty = True\r\n print(day_counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n, k = map(int, input().split(' '))\r\ns = list(map(int, input().split(' ')))\r\n\r\nr = [(x+k-1)//k for x in s]\r\nr = sum(r)\r\nres = (r+1)//2\r\nprint(res)", "R=lambda:list(map(int,input().split()))\r\nn,k=R()\r\nw=R()\r\nprint((sum((i+k-1)//k for i in w)+1)//2)", "n,k=map(int,input().split())\r\nd=0\r\nt = sum(((i-1)//k + 1) for i in map(int,input().split()))\r\nprint((t-1)//2 + 1)", "import math\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ntyp=0\r\nfor i in range(n):\r\n typ=typ+math.ceil(a[i]/k)\r\n#print(typ)\r\nprint(math.ceil(typ/2))", "n,k=input().split()\r\nw=[((int(i)-1)//(int(k))+1) for i in (input().split())]\r\ns=sum(w);m=max(w);\r\nprint(((s if(s>m) else m)+1)//2)\r\n", "import math\r\nn,k = (int(x) for x in input().split())\r\nw = [int(x) for x in input().split()]\r\nd = 0\r\nfor x in w: d += math.ceil(x/k)\r\nprint(math.ceil(d/2))\r\n", "import math\r\nn, k = map(int, input().split())\r\nl = list(map(int , input().split()))\r\nl.sort()\r\n#print(*l)\r\n#print(\"**********\")\r\nx = []\r\nc = 0\r\nfor i in l:\r\n if i<=k:\r\n x.append(i)\r\n elif i>k and i<=2*k:\r\n c = c + 1\r\n else:\r\n c = c + (i)//(2*k)\r\n if i % (2*k)==0:\r\n continue\r\n elif i % (2*k)>k:\r\n c = c+1\r\n else:\r\n x.append(i%(2*k))\r\n #print(*x)\r\n #print(\" c \",c)\r\nc = c+ ((len(x) + 1)//2)\r\nprint(c)", "# cook your dish here\r\nimport math \r\n\r\ntypes_of_peeble , pocket_size = map(int,input().split())\r\npebble_array = list(map(int,input().split()))\r\ni = pocket = 0\r\n\r\nwhile types_of_peeble > 0 :\r\n pebble = pebble_array[i]\r\n if(pebble <= pocket_size):\r\n pocket += 1\r\n elif(pebble > pocket_size and pebble <= 2*pocket_size):\r\n pocket += 2 \r\n else:\r\n pocket += pebble // pocket_size \r\n pebble = pebble % pocket_size \r\n if(pebble==0):\r\n pass\r\n else:\r\n pocket += 1 \r\n types_of_peeble -= 1 \r\n i += 1\r\n \r\nprint(math.ceil(pocket/2))\r\n \r\n", "n,k=map(int,input().split())\r\nlist_1=[int(i) for i in input().split()]\r\nprint(-(sum([-(i//-k) for i in list_1])//-2))", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left, 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, \\\r\n merge\r\nfrom copy import deepcopy\r\nfrom random import shuffle\r\n\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\ntotal = 1\r\n\r\nfor num in arr:\r\n total += (num+k-1)//k\r\n\r\nprint(total//2)\r\n\r\n\r\n", "n, k = map(int, input().split())\nw = list(map(int, input().split()))\nq=0\nt=0\nfor i in range(n):\n\ta=w[i]//k\n\tw[i]%=k\n\tq+=(a//2)\n\tt+=(a%2)\n#\tprint(a, w[i], t, q)\n\tif t==2:\n\t\tt=0\n\t\tq+=1\n\tif w[i]>0:\n\t\tif t==1:\n\t\t\tt=0\n\t\t\tw[i]=0\n\t\t\tq+=1\n\t\telse:\n\t\t\tw[i]=0\n\t\t\tt+=1\nif t>0:\n\tq+=1\nprint(q)\n\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Mar 29 21:32:29 2017\r\n\r\n@author: vushesh\r\n\"\"\"\r\n\r\nimport math\r\n\r\nn ,k = map(int, input().split(' '))\r\n\r\na = list(map(int,input().split(' ')))\r\n\r\ncount = 0\r\nfor i in range(n):\r\n count += int(math.ceil(a[i]/k))\r\n \r\ncount = int(math.ceil(count/2 )) \r\n \r\nprint(count) \r\n", "n, k = [int(i) for i in input().split()]\r\n#k = 1\r\n#n = 10 ** 5\r\na = [int(i) for i in input().split()]\r\n#a = [10 ** 4] * 10**5\r\ni = 0\r\nc = 0\r\n\r\n\r\nfor i in range(len(a)):\r\n if (a[i] <= k):\r\n continue\r\n \r\n elif (a[i] <= 2 * k):\r\n a[i] = 0\r\n c += 1\r\n \r\n else:\r\n \r\n c += a[i] // (2 * k)\r\n a[i] = a[i] % (2 * k)\r\n\r\nfor i in range(len(a)):\r\n if (a[i] <= k):\r\n continue\r\n \r\n elif (a[i] <= 2 * k):\r\n a[i] = 0\r\n c += 1\r\n \r\n else:\r\n \r\n c += a[i] // (2 * k)\r\n a[i] = a[i] % (2 * k)\r\n \r\n \r\nkc = (len(a) - a.count(0))\r\nkc += 1 if kc % 2 != 0 else 0\r\n\r\n#print(c)\r\n \r\nprint(c + kc // 2)\r\n \r\n", "N, K = map( int, input().split() )\r\nW = map( int, input().split() )\r\nprint( ( sum( ( i + K - 1 ) // K for i in W ) + 1 ) // 2 )\r\n", "from math import ceil\r\n\r\nX = list(map(int, input().split()))\r\nTypes = list(map(int, input().split()))\r\nprint(ceil(sum(ceil(i / X[1]) for i in Types) / 2))\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: So Close man!! Take it easy!!!!\r\n# CodeNumber: 633\r\n", "from sys import stdin\r\nfrom math import ceil\r\n\r\n_, k = map(int, stdin.readline().rstrip().split())\r\npeps = list(map(int, stdin.readline().rstrip().split()))\r\n\r\nfor index, item in enumerate(peps):\r\n peps[index] = ceil(item / k)\r\nprint(ceil(sum(peps) / 2))\r\n", "import math\r\n\r\nn,k = map(int,input().split())\r\nstones = list(map(int, input().split()))\r\n\r\ndays = 0\r\nfor i in range(n):\r\n days += math.ceil(stones[i]/k)\r\n\r\nprint(math.ceil(days/2)) ", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in l:\r\n s+=i//k\r\n if i%k!=0:\r\n s+=1\r\ns=s//2+s%2\r\nprint(s)\r\n", "from math import ceil\r\n\r\nn, k = map(int, input().split())\r\nweights = map(int, input().split())\r\nanswer = ceil(sum(ceil(weight/k) for weight in weights)/2)\r\nprint(answer)\r\n\r\n", "n, k = [int(i) for i in input().split()]\r\n\r\nw = [int(i) for i in input().split()]\r\n\r\ntot = 0\r\nfor wi in w:\r\n tot += (wi+k-1)//k\r\n\r\nans = (tot+1)//2\r\nprint(ans)\r\n", "#problem71\r\nfrom math import ceil\r\nn,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ns = 0\r\nfor i in l:\r\n s += ceil(i/k)\r\nprint(ceil(s/2))", "import math\r\n\r\nn, k = map(int, input().split())\r\n\r\npebbles = map(int, input().split())\r\n\r\nsum = 0\r\n\r\nfor pebble in pebbles:\r\n sum += math.ceil(pebble / k)\r\n\r\nprint(math.ceil(sum / 2))\r\n", "def ceil(a, b):\r\n return -(-a//b)\r\n\r\nip = lambda: [int(i) for i in input().split()]\r\nn, k = ip()\r\nL = ip()\r\nans = 0\r\nfor i in L:\r\n ans += ceil(i, k)\r\n\r\nans = ceil(ans, 2)\r\nprint(ans)\r\n", "import math\r\nqueries = [int(i) for i in input().split()]\r\nn = queries[0]\r\nk = queries[1]\r\nlist = [int(i) for i in input().split()]\r\nnumber_of_days = 0\r\nfor i in range(n): \r\n number_of_days += math.ceil(list[i]/k)\r\nnumber_of_days = math.ceil(number_of_days/2)\r\nprint(number_of_days)", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\nn,k=M()\r\nl=L()\r\nans=0\r\nfor i in range(n):\r\n ans+=mt.ceil(l[i]/k)\r\nprint(int(mt.ceil(ans/2)))\r\n", "import math\r\n\r\nn, k = map(int, input().split())\r\n\r\ndef f(s):\r\n f = int(s)\r\n return math.ceil(f / k)\r\n\r\na = sum(map(f, input().split()))\r\nprint(math.ceil(a / 2))", "# Description of the problem can be found at http://codeforces.com/problemset/problem/789/A\r\n\r\nimport math\r\n\r\nn, k = map(int, input().split())\r\n\r\nl_p = list(map(int, input().split()))\r\n\r\nt = 0\r\n\r\nfor p in l_p:\r\n t += math.ceil(p / k)\r\n\r\nprint(math.ceil(t / 2))", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(n):\r\n cnt += arr[i] // k\r\n if arr[i] % k > 0:\r\n cnt += 1\r\nprint((cnt+1)//2)\r\n", "n, k = map(int, input().split())\r\n\r\nL = list(map(int, input().split()))\r\n\r\nt = 0\r\n\r\nfor l in L:\r\n t += l // k\r\n if l % k != 0:\r\n t += 1\r\n \r\n\r\nif t % 2 == 0:\r\n print(t//2)\r\nelse:\r\n print(t//2 + 1)", "from math import *\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nans=0\r\nfor i in arr:\r\n ans+=ceil(i/k)\r\nprint(ceil(ans/2))", "import math\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = 0\r\nfor i in range(n):\r\n d += math.ceil(a[i] / k)\r\nprint(math.ceil(d / 2))\r\n", "read = lambda: map(int, input().split())\r\nn, k = read()\r\nw = list(read())\r\ncnt = sum((i - 1) // k + 1 for i in w)\r\nans = (cnt + 1) // 2\r\nprint(ans)", "n, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n\tw[i] = w[i] // k + (1 if w[i] % k > 0 else 0)\r\n\r\nt = sum(w)\r\nprint(t // 2 + t % 2)", "import math\r\n\r\nmode, capacity = map(int, input().split())\r\nstones = list(map(int, input().split()))\r\n\r\n\r\npocket = 0\r\nfor i in range(len(stones)):\r\n pocket += math.ceil(stones[i] / capacity)\r\n\r\nprint(math.ceil(pocket / 2))\r\n", "# print(\"Input n and k\")\nn,k = [int(x) for x in input().split()]\n\n# print(\"Input the # of pebbles of each of the n types\")\na = [int(x) for x in input().split()]\n\npocketfuls = 0\nfor x in a:\n if x%k == 0:\n pocketfuls += x//k\n else:\n pocketfuls += x//k + 1\n\nif pocketfuls % 2 == 0:\n print(pocketfuls//2)\nelse:\n print(pocketfuls//2 + 1)\n\n", "n, k = map(int, input().split())\nw = list(map(int, input().split()))\n\nsum = 0\nfor i in range(n):\n if w[i]<=k:\n sum+=1\n else: \n if w[i]%k == 0:\n sum+=w[i]//k\n else:\n sum+=(w[i]//k)+1\nresult = (sum//2)+(sum%2)\n\nprint(result)" ]

[ "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\nmod = pow(10, 9) + 7\r\na = list(map(int, input().split()))\r\ny = [[] for _ in range(n)]\r\nfor i in range(q):\r\n l, x = map(int, input().split())\r\n y[l - 1].append((x, i))\r\nm = pow(2, 20)\r\ndp = [0] * m\r\ndp[0] = 1\r\nnow = 1\r\nans = [0] * q\r\nfor i in range(n):\r\n u = a[i]\r\n if not dp[u]:\r\n for j in range(m):\r\n dp[j] |= dp[j ^ u]\r\n else:\r\n now *= 2\r\n now %= mod\r\n for x, j in y[i]:\r\n ans[j] = now * dp[x]\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "import sys\r\nreadline=sys.stdin.readline\r\n\r\ndef XOR_Basis(lst):\r\n xor_basis=[]\r\n triangulation=[]\r\n idx=[]\r\n for j,x in enumerate(lst):\r\n xx=x\r\n for xb in triangulation:\r\n xx=min(xx,xx^xb)\r\n if xx:\r\n xor_basis.append(x)\r\n for i in range(len(triangulation)):\r\n triangulation[i]=min(triangulation[i],triangulation[i]^xx)\r\n triangulation.append(xx)\r\n idx.append(j)\r\n return xor_basis,triangulation,idx\r\n\r\nN,Q=map(int,readline().split())\r\nA=list(map(int,readline().split()))\r\nmod=10**9+7\r\nbasis,_,lst=XOR_Basis(A)\r\nfor q in range(Q):\r\n l,x=map(int,readline().split())\r\n AA=[]\r\n for i,a in zip(lst,basis):\r\n if i<l:\r\n AA.append(a)\r\n _,tria,_=XOR_Basis(AA)\r\n for a in tria:\r\n x=min(x,x^a)\r\n if x:\r\n ans=0\r\n else:\r\n ans=pow(2,l-len(tria),mod)\r\n print(ans)" ]

[ "def weakness(a, x):\n a = [elem-x for elem in a]\n acumulado = maximo = 0\n for elem in a:\n if acumulado + elem > 0:\n acumulado += elem\n else:\n acumulado = 0\n if acumulado > maximo:\n maximo = acumulado\n acumulado = minimo = 0\n for elem in a:\n if acumulado + elem < 0:\n acumulado += elem\n else:\n acumulado = 0\n if acumulado < minimo:\n minimo = acumulado\n return max(maximo, -minimo)\n\n\nn, a = input(), list(map(int, input().split()))\n\ninf, sup = min(a), max(a)\nfor _ in range(70):\n c1, c2 = (2*inf+sup)/3, (inf+2*sup)/3\n if weakness(a, c1) < weakness(a, c2):\n sup = c2\n else:\n inf = c1\n\nprint(weakness(a, (inf+sup)/2))\n\n \t \t \t \t\t \t \t\t \t\t\t \t\t\t\t\t\t", "n = int(input())\na = list(map(int, input().split()))\n\ndef f(x):\n mx, cur = 0, 0\n for i in range(n):\n cur = max(cur, 0) + a[i] - x\n mx = max(mx, cur)\n cur = 0\n for i in range(n):\n cur = max(cur, 0) + x - a[i]\n mx = max(mx, cur)\n return mx\n\nL, R = min(a), max(a) + 1\n\nfor t in range(100):\n d = (R - L) / 3\n x1, x2 = L + d, R - d\n if f(x1) > f(x2):\n L = x1\n else:\n R = x2\n\nprint('{:.10f}'.format(f(L)))\n" ]

[ "def correct_typos(word):\r\n stack = []\r\n for letter in word:\r\n if len(stack) < 2:\r\n stack.append(letter)\r\n else:\r\n #if len(stack)>=3:\r\n #print(letter,stack[-1],stack[-2],stack[-3],letter == stack[-1], stack[-2] == stack[-3],len(stack)>=3)\r\n if letter == stack[-1] and letter == stack[-2]:\r\n continue\r\n elif len(stack) >= 3 and letter == stack[-1] and stack[-2] == stack[-3]:\r\n #print(\"skipped\",letter)\r\n continue\r\n else:\r\n stack.append(letter)\r\n \r\n return ''.join(stack)\r\n\r\n# Input\r\ns = input().strip()\r\n\r\n# Output\r\nresult = correct_typos(s)\r\nprint(result)\r\n", "def main():\r\n seq = input()\r\n buffer3 = []\r\n buffer4 = []\r\n\r\n indices2remove = set()\r\n for i, e in enumerate(seq):\r\n buffer3.append(e)\r\n buffer4.append(e)\r\n\r\n if len(buffer3) >= 3 and buffer3[-3] == buffer3[-2] == buffer3[-1]:\r\n indices2remove.add(i)\r\n buffer3.pop()\r\n buffer4.pop()\r\n elif len(buffer4) >= 4 and buffer4[-4] == buffer4[-3] and \\\r\n buffer4[-2] == buffer4[-1]:\r\n indices2remove.add(i)\r\n buffer3.pop()\r\n buffer4.pop()\r\n\r\n ans = ''.join(e for i, e in enumerate(seq) if i not in indices2remove)\r\n print(ans)\r\n\r\n\r\n\r\ndef input(): return next(test).strip()\r\ndef read_ints(): return [int(c) for c in input().split()]\r\ndef print_lines(lst): print('\\n'.join(map(str, lst)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n import sys\r\n from os import environ as env\r\n if 'COMPUTERNAME' in env and 'L2A6HRI' in env['COMPUTERNAME']:\r\n sys.stdout = open('out.txt', 'w')\r\n sys.stdin = open('in.txt', 'r')\r\n\r\n test = iter(sys.stdin.readlines())\r\n\r\n main()\r\n", "s=input()\r\nlis=[]\r\nadd=s[0]\r\nfor i in range(1,len(s)):\r\n if add[-1]==s[i]:\r\n add+=s[i]\r\n else:\r\n lis.append(add)\r\n add=s[i]\r\nlis.append(add)\r\nfor i in range(len(lis)):\r\n if len(lis[i])>2:\r\n lis[i]=lis[i][0]*2\r\nfor i in range(1,len(lis)):\r\n if len(lis[i])==2 and len(lis[i-1])==2:\r\n lis[i]=lis[i][0]\r\nprint(\"\".join(lis))", "#Khushal Sindhav\r\n#Indian Institute Of Technology, Jodhpur\r\n# 11 May 2022\r\ndef exe():\r\n global s\r\n ans=\"\"\r\n n=len(s)\r\n i=0\r\n while i<n-2:\r\n if s[i]==s[i+1]==s[i+2]:\r\n ans+=s[i]+s[i+1]\r\n temp=s[i]\r\n while i<n-2:\r\n if s[i]!=temp:\r\n break\r\n i+=1\r\n else:\r\n ans+=s[i]\r\n i+=1\r\n i=0\r\n s=ans\r\n n=len(s)\r\n # print(s)\r\n a=\"\"\r\n while i<n-3:\r\n if s[i]==s[i+1] and s[i+2]==s[i+3]:\r\n a+=s[i]+s[i+1]+s[i+2]\r\n i+=4\r\n else:\r\n a+=s[i]\r\n i+=1\r\n return a\r\ns=input()+\"ABCDE\"\r\nprint(exe())", "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 Fixing_Typos():\r\n stringList = insr()\r\n\r\n answerList = []\r\n\r\n for char in stringList:\r\n if len(answerList) <= 1:\r\n answerList.append(char)\r\n else:\r\n current_answer_length = len(answerList)\r\n typoFound = False \r\n\r\n if answerList[current_answer_length-1] == answerList[current_answer_length-2] and char == answerList[current_answer_length-1]:\r\n typoFound = True \r\n \r\n if current_answer_length >= 3:\r\n if answerList[current_answer_length-2] == answerList[current_answer_length-3] and char == answerList[current_answer_length-1]:\r\n typoFound = True \r\n\r\n if not typoFound:\r\n answerList.append(char)\r\n\r\n\r\n outputStr = ''.join(i for i in answerList)\r\n print(outputStr)\r\n return \r\n\r\nFixing_Typos()", "s = input()\n\ndef get_pairs(s):\n pairs = []\n pair = None\n\n for letter in s:\n if pair and pair[0] != letter:\n pairs.append(pair)\n\n if pair and pair[0] == letter:\n pair[1] += 1\n else:\n pair = [letter, 1]\n \n pairs.append(pair)\n return pairs\n\ndef decrease_to_doubles(pairs):\n result = []\n\n for pair in pairs:\n a, b = pair\n\n if b > 2:\n b = 2\n\n result.append([a, b])\n \n return result\n\ndef decrease_to_ones(pairs):\n start = 0\n finish = start + 2\n\n while finish <= len(pairs):\n a, b = pairs[start:finish]\n\n if a[1] == 2 and b[1] == 2:\n b[1] = 1\n\n start+=1\n finish+=1\n \n return pairs\n\ndef restore_word(pairs):\n letters = []\n for pair in pairs:\n letter, multiplier = pair\n letters.append(letter*multiplier)\n \n result = ''.join(letters)\n return result\n\nprint(restore_word(decrease_to_ones(decrease_to_doubles(get_pairs(s)))))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n s = input().strip()\r\n\r\n prev, cur, res = 0, 0, []\r\n for i in range(len(s)):\r\n cur += 1\r\n if i + 1 == len(s) or s[i + 1] != s[i]:\r\n if prev == 2:\r\n cur = 1\r\n elif cur > 2:\r\n cur = 2\r\n res.append(s[i] * cur)\r\n prev, cur = cur, 0\r\n \r\n print(''.join(res))\r\n \r\nsolve()", "s=input()\r\nl=[]\r\nn=len(s)\r\ni=0\r\nwhile i<n:\r\n if len(l)<2:\r\n l.append(s[i])\r\n i+=1\r\n else:\r\n if s[i]==l[-1]==l[-2]:\r\n i+=1\r\n elif len(l)>=3 and s[i]==l[-1] and l[-2]==l[-3]:\r\n i+=1\r\n else:\r\n l.append(s[i])\r\n i+=1\r\nprint(\"\".join(l))", "# DO NOT EDIT THIS\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ns = [c for c in input()]\r\nj, k, m = 1, 0, -1\r\nfor i in range(2, len(s)):\r\n if s[i] == s[j] == s[k] or (i >= 3 and s[i] == s[j] and s[k] == s[m]):\r\n s[i] = ''\r\n else:\r\n m, k, j = k, j, i\r\n\r\nprint(''.join(s))\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\nimport math\r\nimport copy\r\nimport itertools\r\nimport bisect\r\nfrom heapq import heappop, heappush, heapify\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef ilst():\r\n return list(map(int,input().split()))\r\n \r\ndef islst():\r\n return list(map(str,input().split()))\r\n \r\ndef inum():\r\n return map(int,input().split())\r\n \r\ndef 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\n\r\ns = input()\r\nl = [s[0]]\r\n\r\nprev = l[0]\r\npc,c = 0,1\r\nfor i in range(1,len(s)):\r\n if s[i] == prev:\r\n if pc <= 1 and c == 1:\r\n l.append(s[i])\r\n c += 1\r\n else:\r\n pc = c \r\n c = 1 \r\n l.append(s[i]) \r\n prev = s[i]\r\nprint(''.join(l))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n s = input().strip()\r\n\r\n stack = [['#', 0]]\r\n for c in s:\r\n if c == stack[-1][0]:\r\n stack[-1][1] += 1\r\n else:\r\n stack.append([c, 1]) \r\n \r\n for i in range(1, len(stack)):\r\n while stack[i][1] >= 3 or (stack[i][1] > 1 and stack[i - 1][1] > 1):\r\n stack[i][1] -= 1\r\n \r\n print(''.join(map(lambda x: x[0] * x[1], stack)))\r\n\r\n# for _ in range(int(input())):\r\nsolve()", "def clc(): \r\n s =input()\r\n out = []\r\n for i in range(len(s)):\r\n if i>=2 and out[-1] == out[-2] == s[i]:continue \r\n else:out.append(s[i])\r\n p= \"\"\r\n for i in range(len(out)):\r\n if i>2 and p[-2] == p[-3] and out[i] == p[-1]:continue \r\n else:p+=out[i]\r\n print(p)\r\nclc()\r\n ", "s=input()\r\nuu=list(s)\r\nk=1\r\nm=0\r\nnn=len(s)\r\ns=s+'@'\r\nfor i in range(nn):\r\n if s[i]==s[i+1]:\r\n k+=1\r\n if s[i]!=s[i+1]:\r\n if k>=3 and m==0:\r\n for kk in range(k-2):\r\n uu[i-kk]=''\r\n k=1\r\n else:\r\n k=1\r\nsss=''.join(uu)\r\nuuu=list(sss)\r\nnnn=len(sss)\r\nsss=sss+'@'\r\nk=1\r\nfor i in range(nnn):\r\n if sss[i]==sss[i+1]:\r\n if m==0:\r\n k+=1\r\n m=1\r\n else:\r\n uuu[i]=''\r\n k+=1\r\n m=0\r\n if sss[i]!=sss[i+1]:\r\n if k==2 and m==1:\r\n k=1\r\n else:\r\n m=0\r\n k=1\r\nssss=''.join(uuu)\r\nprint(ssss)\r\n", "\r\ndef solve():\r\n s = input()\r\n # print(len(s))\r\n stack = []\r\n l = 0\r\n for i in range(len(s)):\r\n # print(stack)\r\n if l >= 2 and s[i] == stack[-1] and s[i] == stack[-2]:\r\n continue\r\n elif l >= 3 and s[i] == stack[-1] and stack[-2] == stack[-3]:\r\n stack.pop()\r\n l -= 1\r\n stack.append(s[i])\r\n l += 1\r\n\r\n print(''.join(stack))\r\nsolve()", "def solve():\r\n s = input().strip()\r\n stack = []\r\n for i in range(len(s)):\r\n # three-letters in a row check\r\n if i>=2 and s[i]==stack[-1] and s[i]==stack[-2]:\r\n continue\r\n # two couple of letters in a row check\r\n elif i>=3 and s[i]==stack[-1] and stack[-2]==stack[-3]:\r\n continue\r\n # if no typos are found, store the current letter\r\n stack.append(s[i])\r\n # print the letters we stored, as a single string\r\n print(''.join(stack))\r\nsolve()", "s=input()\r\nstack=[]\r\nfor i in range(len(s)):\r\n if len(stack)<2:\r\n stack.append(s[i])\r\n else:\r\n if len(stack)>=2 and stack[-1]==s[i] and stack[-2]==s[i]:\r\n continue\r\n if len(stack)>=3 and stack[-3]==stack[-2] and stack[-1]==s[i]:\r\n continue\r\n else:\r\n stack.append(s[i])\r\n # print(stack)\r\nprint(''.join(stack))\r\n \r\n", "if __name__ == \"__main__\":\n word = list(input())\n ans = []\n for i in word:\n if len(ans) > 2 and ans[-3] == ans[-2] and ans[-1] == i or len(ans) > 1 and ans[-2] == ans[-1] == i:\n continue\n ans.append(i)\n\n print(''.join(ans))\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 \t", "s = input()\r\nss = [[s[0],1]]\r\nfor i in range(1,len(s)):\r\n if s[i] == ss[-1][0]:\r\n ss[-1][1] = min(ss[-1][1] + 1, 2)\r\n else:\r\n ss.append([s[i],1])\r\nfor i in range(len(ss)-1):\r\n if ss[i][1] == 2 and ss[i+1][1] == 2:\r\n ss[i + 1][1] -= 1\r\nres = []\r\nfor i in ss:\r\n for _ in range(i[1]):\r\n res.append(i[0])\r\nprint(''.join(res))" ]

[ "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#------------------------------------\r\nx,y = map(int,rd().split())\r\nmylist = [''.join(map(str,rd().split())) for _ in range(x)]\r\nwhile x > 1 and x % 2 == 0 :\r\n\tif mylist[:x] != mylist[:x][::-1]:\r\n\t\tbreak\r\n\tx//=2 \r\n\r\nprint(x)", "def issymmetric(n, mat):\r\n if n%2: return False\r\n else:\r\n return mat[:n//2] == mat[n//2:][::-1]\r\n\r\nn, m = map(int, input().split())\r\nmat = []\r\nfor i in range(n):\r\n mat.append(list(map(int, input().split())))\r\n#print(n, mat)\r\nwhile issymmetric(n, mat):\r\n mat = mat[:n//2]\r\n n //= 2\r\nprint(n)", "def symetry(a,n,m):\r\n symmetry = 0\r\n k = n // 2\r\n for x in range(n):\r\n for y in range(m):\r\n k = n - x - 1 \r\n if k < n - 1 and a[x][y] != a[k][y]:\r\n symmetry = 1\r\n return symmetry \r\n \r\nn, m = map(int, input().split())\r\nlist_anmi = [list(map(int, input().split())) for i in range(n)]\r\nsym = 0\r\nwhile n % 2 == 0: \r\n if symetry(list_anmi[0 : n],n,m) == 0:\r\n n = n // 2\r\n else:\r\n break\r\nsym = n\r\nprint(sym)\r\n", "n, m = map(int, input().split())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\n\r\ndef pol(x, y):\r\n if y % 2 != 0:\r\n return False\r\n l, r = 0, y - 1\r\n while l < r:\r\n if a[l][x] != a[r][x]:\r\n return False\r\n l += 1\r\n r -= 1\r\n return True\r\nresult = 1\r\nfor i in range(m):\r\n j = n\r\n while pol(i, j):\r\n j //= 2\r\n result = max(result, j)\r\nprint(result)", "n,m=map(int,input().split())\r\nmatrix=[]\r\n\r\nfor i in range(n):\r\n matrix.append([int(x) for x in input().split()])\r\n\r\ndef mirror(matrix):\r\n mirrormatrix=matrix[:]\r\n matrix.reverse()\r\n mirrormatrix+=matrix[:]\r\n matrix.reverse()\r\n return mirrormatrix\r\n\r\nwhile True:\r\n if len(matrix)%2==0:\r\n if mirror(matrix[:int(len(matrix)/2)])==matrix:\r\n matrix=matrix[:int(len(matrix)/2)]\r\n else:\r\n print(len(matrix))\r\n break\r\n else:\r\n print(len(matrix))\r\n break", "import sys\n\ndef mirror(row, matrix):\n if row % 2:\n return row\n else:\n for i in range(row // 2):\n if matrix[i] != matrix[row - 1 - i]:\n return row\n return mirror(row // 2, matrix)\n\nif __name__ == '__main__':\n n, m = map(int, sys.stdin.readline().split())\n matrix = [list(map(int, i.split())) for i in sys.stdin.readlines()]\n print(mirror(n, matrix))\n\n", "def solve(n, a):\r\n return n if n % 2 == 1 or any(a[i] != a[n - i - 1] for i in range(n // 2)) else solve(n // 2, a)\r\n\r\n\r\ndef main():\r\n n, _ = map(int, input().split())\r\n a = [[int(c) for c in input().split()] for _ in range(n)]\r\n\r\n ans = solve(n, a)\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = list(map(int, input().split()))\na = []\nfor _ in range(n):\n a.append(list(map(int, input().split())))\n\ndef isMirror(l):\n y = len(l)\n if y % 2 != 0:\n return False\n y = y // 2\n lb = l[:y]\n le = l[y:]\n if le[::-1] == lb:\n return True\n else:\n return False\n\nwhile isMirror(a):\n a = a[:len(a) // 2]\nprint(len(a))", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):l.append(\"\".join(list(map(str,input().split()))))\r\nwhile not n%2 and l[:n//2]==l[n//2:n][::-1]:n//=2\r\nprint(n)", "n, m = [int(i) for i in input().split()]\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nresult = n\r\nflag = True\r\nwhile n % 2 == 0:\r\n n = int(n / 2)\r\n x1 = n\r\n x2 = n + 1\r\n while x1 > 0:\r\n if a[x1 - 1] != a[x2 - 1]:\r\n flag = False\r\n break\r\n x1 -= 1\r\n x2 += 1\r\n if flag == False:\r\n break\r\n result = n\r\n\r\n\r\nprint(result)\r\n", "n,m = map(int, input().split())\r\nmat = [ list(map(int, input().split())) for i in range(n)]\r\nwhile n%2 == 0:\r\n i,j = 0,n-1\r\n ok = True\r\n while i<j:\r\n if mat[i] != mat[j]:\r\n ok = False\r\n break\r\n i+=1\r\n j-=1\r\n \r\n if not ok:\r\n break\r\n n //= 2\r\nprint(n)", "import sys\r\nn, m = map(int, input().split())\r\nmat = []\r\ncan = True\r\nfor i in range(n):\r\n mat += [list(map(int, input().split()))]\r\nelse:\r\n while can:\r\n if n % 2 == 1:\r\n print(n)\r\n sys.exit()\r\n for i in range(n // 2):\r\n if mat[i] != mat[n - i - 1]:\r\n can = False\r\n break\r\n else:\r\n n //= 2\r\nprint(n)", "n, m = map(int, input().split())\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\n \r\n\r\ndef ok(ar1, ar2):\r\n l = len(ar1)\r\n for i in range(l):\r\n if ar1[i] != ar2[l-i-1]:\r\n return False\r\n \r\n return True\r\n \r\n \r\ndef process(ar):\r\n if len(ar)%2 == 1:\r\n return len(ar)\r\n \r\n if ok(ar[:len(ar)//2], ar[len(ar)//2:]):\r\n return process(ar[:len(ar)//2])\r\n else:\r\n return len(ar)\r\n \r\ns = process(a)\r\n\r\nprint(s)", "(a,b)=map(int, input().split())\nif a%2==0:\n s=[0]*a\n for i in range(a):\n s[i]=[0]*b\n s[i]=list(map(int, input().split()))\n while s[:a//2]==s[:a//2-1:-1] and len(s)>1:\n a=a//2\n s=s[:a]\nelse:\n for i in range(a):\n n=input()\nprint(a) ", "n, m = [int(i) for i in input().split()]\na = [input().split() for i in range(n)]\nwhile n%2==0:\n if a[:n//2] == a[n//2:n][::-1]:\n n //= 2\n else:\n break\nprint(n)\n", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nwhile n%2 == 0 and a[:n] == list(reversed(a[:n])):\r\n n = n // 2\r\nprint(n)# 1697806988.1422396", "n, m = map(int, input().split())\n\na = []\nfor i in range(n):\n\ta.append(list(map(int, input().split())))\n\nwhile n and n % 2 == 0 and a[:n//2] == a[n-1:n//2-1:-1]:\n\tn //= 2\nprint(n)\n", "a,b=map(int,input().split())\r\nz=[input() for _ in \" \"*a]\r\ns=0\r\nfor i in range(a):\r\n ok=0;p=i+1\r\n while 1:\r\n if p>=a:ok=1;break\r\n if z[:p]==z[p:2*p][::-1]:p*=2\r\n else:break\r\n if ok:print(i+1);exit()\r\n", "def valid(n,arr):\r\n \r\n if n!=int(n):\r\n return len(arr)\r\n n=int(n)\r\n for i in range(0,n):\r\n if arr[i]==arr[2*n-1-i]:\r\n continue \r\n else:\r\n return len(arr) \r\n if n==0:\r\n return 0\r\n curr_ans=n\r\n return min(curr_ans,valid(n/2,arr))\r\ndef main(arr):\r\n return valid(len(arr)/2,arr)\r\n \r\n\r\nn,m=list(map(int,input().split()))\r\narr=[] \r\nfor i in range(n):\r\n arr.append(list(map(int,input().split())))\r\nprint(main(arr))\r\n", "n, m = map(int, input().split())\nmat = [input() for _ in range(n)]\nwhile n > 1 and n % 2 == 0:\n if mat[:n] != list(reversed(mat[:n])):\n break\n n //= 2\nprint(n)\n \t\t \t\t \t\t \t\t \t \t\t \t\t \t", "n, m = map(int, input().split())\r\n\r\nans = n\r\n\r\narr = []\r\nfor i in range(n):\r\n arr.append(input())\r\n\r\nwhile True:\r\n if n & 1:\r\n print(ans)\r\n break\r\n else:\r\n k = n // 2\r\n for i in range(k):\r\n if arr[i] != arr[n - i - 1]:\r\n print(ans)\r\n exit(0)\r\n n = k\r\n ans = n", "mtxSize = list(map(int, input().split()))\nrows = mtxSize[0]\n\ninArray = []\nfor i in range(rows):\n inputs = list(map(int, input().split()))\n inArray.append(inputs)\n\nbRows = rows\n\nrevArray = inArray[::-1]\n\nwhile(rows%2 == 0):\n if inArray == revArray:\n rows //= 2\n bRows = rows \n del(inArray[rows:])\n del(revArray[:rows])\n \n else:\n break \nprint(bRows)\n\t\t \t \t \t\t \t \t \t\t \t \t \t", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(input()))\r\nif n % 2 != 0:\r\n print(n)\r\nelse:\r\n start=n\r\n mid = n//2\r\n while start != 1:\r\n if l[0:mid][::-1] == l[mid:start]:\r\n start//=2\r\n mid=start//2\r\n else:\r\n break\r\n print(start)\r\n", "from math import log\r\n \r\nrow, col = map(int, input().split(\" \"))\r\n \r\nif row % 2 == 1:\r\n print(row)\r\nelse:\r\n matrix = []\r\n for _ in range(row):\r\n matrix.append(input().split(\" \"))\r\n minimum = row\r\n for _ in range(int(log(row, 2))):\r\n if matrix[0:minimum // 2] == matrix[minimum - 1:minimum // 2 - 1:-1]:\r\n minimum //= 2\r\n else:\r\n break\r\n print(minimum)", "n, m = tuple(map(int, str.split(input())))\na = list(map(lambda _: input(), range(n)))\nwhile n % 2 == 0 and all(map(lambda i: a[i] == a[-i - 1], range(n // 2))):\n\n n //= 2\n a = a[:n]\n\nprint(n)\n", "def solve():\r\n rows, cols = list(map(int, input().split(\" \")))\r\n\r\n arr = []\r\n for i in range(rows):\r\n arr.append(list(map(int, input().split(\" \"))))\r\n\r\n # Fold and check\r\n while rows % 2 == 0:\r\n for j in range(rows//2):\r\n if arr[j] != arr[rows - j - 1]:\r\n print(rows)\r\n return\r\n rows = int(rows // 2)\r\n\r\n print(rows)\r\n\r\nsolve()", "def check(n, m, a):\r\n for i in range(n // 2):\r\n for j in range(m):\r\n if a[i][j] != a[-i - 1][j]:\r\n return 0\r\n if n % 2:\r\n return 0\r\n return 1\r\n\r\ndef new(n, a):\r\n return a[:(n + 1) // 2]\r\n\r\nn, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\ncnt = 0\r\nwhile (not (n % 2)) and check(n, m, a):\r\n a = new(n, a)\r\n n //= 2\r\nprint(len(a))", "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\n\r\n\r\nn, m = inp() ; arr= [] \r\nfor i in range(n) : arr.append(list(inp())) \r\nwhile n%2==0 : \r\n if (arr[:n//2] != arr[n//2 : n][::-1]) : break\r\n n//=2 \r\nprint(n)", "n,m=map(int,input().split())\r\narr=[input()for i in range(n)]\r\nwhile n%2==0:\r\n if arr[:n]==list(reversed(arr[:n])):n//=2\r\n else:break\r\nprint(n)", "class CodeforcesTask426BSolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.matrix = []\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.matrix.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n size = self.n_m[0]\n while not size % 2:\n mirrorify = True\n for x in range(size // 2):\n if self.matrix[x] != self.matrix[size - x - 1]:\n mirrorify = False\n break\n if not mirrorify:\n break\n else:\n size //= 2\n self.result = str(size)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask426BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "__author__ = 'Lipen'\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(input())\r\n\r\n\twhile n%2==0:\r\n\t\tif a[:n//2] != a[:n//2-1:-1]:\r\n\t\t\tbreak\r\n\t\tn //= 2\r\n\t\ta = a[:n]\r\n\r\n\tprint(n)\r\n\r\nmain()", "def f(c):\r\n n = len(c)\r\n if (n % 2 == 1):\r\n return n\r\n for i in range(n):\r\n if c[i] != c[n - i - 1]:\r\n return n\r\n return f(c[:n // 2])\r\n\r\nn, m = map(int, input().split())\r\nc = [input() for i in range(n)]\r\nprint(f(c))", "import collections\r\nimport heapq\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport bisect\r\nimport os\r\n\r\n\r\ndef values():\r\n return tuple(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef inp():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef inpstr():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef words():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef chars():\r\n return list(sys.stdin.readline().strip())\r\n\r\n\r\ndef check_sym(mat, end):\r\n if end & 1:\r\n return False\r\n for i in range(end // 2):\r\n if mat[end // 2 - 1 - i] != mat[end // 2 + i]:\r\n return False\r\n return True\r\n\r\n\r\ndef solve():\r\n n, m = values()\r\n mat = []\r\n for i in range(n):\r\n row = values()\r\n r = 0\r\n for j in range(m):\r\n r |= row[j] << j\r\n mat.append(r)\r\n\r\n end = n\r\n\r\n while check_sym(mat, end):\r\n end //= 2\r\n\r\n print(end)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # if os.path.exists('/home/ms/myp/problem-solving/input'):\r\n # sys.stdin = open('/home/ms/myp/problem-solving/input', 'r')\r\n sys.setrecursionlimit(10000000)\r\n solve()\r\n", "def checkMatr(a):\r\n res = True\r\n ln = len(a)\r\n hln = int(ln/2)\r\n if ln % 2 != 0:\r\n res = False\r\n else:\r\n for i in range(hln):\r\n if a[i] != a[ln-1-i]:\r\n res = False\r\n return res\r\n\r\nn, m = map(int, input().split())\r\ntable = []\r\nfor i in range(n):\r\n table.append(str(input()))\r\n\r\nwhile checkMatr(table):\r\n table = table[:int(len(table)/2)]\r\n\r\nprint(len(table))\r\n", "import copy\n\nn,m=map(int,input().split())\na=[]\nfor i in range(n):\n a.append(list(map(int,input().split())))\nans=len(a)\nnew=copy.deepcopy(a)\nwhile True:\n if len(new)%2!=0:\n break\n else:\n mid=len(new)//2\n left=new[0:mid]\n right=new[mid:]\n right=right[::-1]\n if left==right:\n new=copy.deepcopy(left)\n ans=ans//2\n else:\n break\nprint(ans)\n \t \t \t \t \t\t\t\t\t \t \t\t \t\t\t\t\t\t \t", "def main():\n n, m = map(int, input().split())\n a = []\n for _ in range(n):\n row = list(map(int, input().split()))\n a.append(row)\n\n t = n\n while t % 2 == 0:\n f = 1\n i = 0\n while i < t // 2:\n for j in range(m):\n if a[i][j] != a[t - i - 1][j]:\n f = 0\n break\n i += 1\n\n if f:\n t //= 2\n else:\n break\n\n print(t)\n\n\nif __name__ == \"__main__\":\n main()\n\n \t \t\t\t \t\t\t \t\t\t\t \t \t\t\t \t \t", "from sys import stdin\r\n\r\ndef isreversed(a):\r\n if(len(a) % 2 == 0):\r\n if(a[:len(a) // 2] == a[len(a) // 2:][::-1]):\r\n return True\r\n return False\r\n\r\na = []\r\nn, m = list(map(int, stdin.readline().split()))\r\nfor i in range(n):\r\n a.append(list(map(int, stdin.readline().split())))\r\nres = n\r\nwhile(isreversed(a)):\r\n res //= 2\r\n a = a[:len(a) // 2]\r\nprint(res)", "m,n = map(int, input().split())\na = [[i for i in map(int, input().split())] for _ in range(m)]\n\nwhile m % 2 == 0:\n if m % 2:\n print(m)\n exit()\n\n ok,i,j = True,0,m-1\n\n while ok and j > i:\n if a[i]==a[j]:\n i+=1\n j-=1\n else:\n ok = False\n break\n\n if ok:\n m = int(m / 2)\n a = a[:m]\n else:\n break\n\nprint(m)", "n,m=map(int,input().split())\ndef judge(lst,n):\n l=0\n r=n-1\n if n%2==1:\n return n\n while lst[l]==lst[r] and l<r:\n l+=1\n r-=1\n if l>r:\n return min(n//2,judge(lst[:n//2],n//2))\n else:\n return n\nif n%2==1:\n print(n)\nelse:\n lst=[]\n for i in range(n):\n lst.append(list(map(int,input().split())))\n print(judge(lst,n))\n \t\t\t \t \t\t \t \t \t \t \t \t", "n,m = [int(i) for i in input().split()]\nl = []\nfor i in range(n):\n l.append(input().strip())\nwhile len(l)%2 == 0:\n mirror = True\n for i in range(len(l)//2):\n if l[i] != l[len(l)-1-i]:\n mirror = False\n break\n if mirror:\n l = l[:len(l)//2]\n else:\n break\n\nprint(len(l))\n", "def readln(): return tuple(map(int, input().split()))\r\n\r\nn, m = readln()\r\na = [readln() for _ in range(n)]\r\nans = n\r\nwhile ans % 2 == 0:\r\n p1 = a[:ans // 2]\r\n p2 = a[ans // 2:]\r\n p2.reverse()\r\n if p1 != p2:\r\n break\r\n a = p1\r\n ans //= 2\r\nprint(ans)", "def can_mirror(matrix):\r\n if len(matrix) % 2 != 0:\r\n return False\r\n mid = len(matrix) // 2\r\n for i in range(mid):\r\n lower = -i-1\r\n if matrix[mid+lower] != matrix[mid+i]:\r\n return False\r\n return True\r\n\r\n\r\ndef mirror(matrx):\r\n mid = len(matrix) // 2\r\n return matrix[:mid]\r\n\r\n\r\nn, m = map(int, input().split())\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(list(map(int, input().split())))\r\nwhile can_mirror(matrix):\r\n matrix = mirror(matrix)\r\nprint(len(matrix))\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):l.append(\"\".join(list(map(str,input().split()))))\r\nwhile not n%2:\r\n if l[:n//2]!=l[n//2:n][::-1]:break\r\n n//=2\r\nprint(n)", "n, m = map(int, input().split())\r\narr = [input() for i in range(n)]\r\nwhile n % 2 == 0 and arr[:n] == list(reversed(arr[:n])):\r\n n //= 2\r\nprint(n)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ng = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nc = 0\r\nwhile n % 2 == 0:\r\n for i in range(n//2):\r\n if g[i] != g[n-i-1]:\r\n c = 1\r\n break\r\n if c == 0:\r\n n //= 2\r\n else:\r\n break\r\nprint(n)", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append(''.join(input().split()))\r\nwhile n%2==0:\r\n k=0\r\n for i in range(n//2):\r\n if a[i]==a[n-i-1]:\r\n k+=1\r\n if k!=n//2:\r\n break\r\n n=n//2\r\nprint(n)", "def check(i, j):\r\n global a\r\n while i < j:\r\n if a[i] != a[j]:\r\n return False\r\n i += 1\r\n j -= 1\r\n return True\r\nn, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input().strip())\r\nlast = n\r\nwhile last % 2 == 0:\r\n if check(0, last - 1):\r\n last //= 2\r\n else:\r\n break\r\nprint(last)", "string_input = input().split(\" \")\nn, m = int(string_input[0]), int(string_input[1])\nmatrix = []\nrow = n\nfor i in range(0, n):\n matrix.append(input())\nwhile True:\n if n % 2 == 1:\n break\n else:\n row_flag = 1\n n = n//2\n for i in range(0, n):\n if matrix[i] != matrix[2*n-1-i]:\n row_flag = 0\n break\n if row_flag:\n row = n\n else:\n break\nprint(row)\n\t\t\t\t \t\t \t\t \t \t", "n,m=map(int,input().split())\r\nl=[]\r\n\r\nfor i in range(n):\r\n op=list(map(int,input().split()))\r\n l.append(op)\r\n \r\nwhile(n%2==0):\r\n check=True\r\n for i in range(0,n//2):\r\n for j in range(m):\r\n check = check and l[i][j]==l[n-i-1][j]\r\n \r\n if(check):\r\n n=n//2\r\n else:\r\n break\r\n \r\nprint(n)" ]

[ "import sys\r\nfrom heapq import heappop, heappush\r\n\r\nclass Edge:\r\n def __init__(self, u, v, cap, flow, cost, rev) -> None:\r\n self.u = u\r\n self.v = v\r\n self.cap = cap\r\n self.flow = flow\r\n self.cost = cost\r\n self.rev = rev\r\n\r\ndef add_edge(adj, u, v, capv, flowv, costv):\r\n if u == 6 and v == 7:\r\n foo = 0\r\n\r\n adj[u].append(Edge(u, v, capv, flowv, costv, len(adj[v])))\r\n adj[v].append(Edge(v, u, 0, flowv, -costv, len(adj[u])-1))\r\n\r\ndef match(crossword, cw_idx, word):\r\n for k in range(len(word)):\r\n if crossword[cw_idx + k] != word[k]:\r\n return False\r\n \r\n return True\r\n\r\ndef read_input():\r\n '''\r\n 6\r\n abacba\r\n 5\r\n aba 6\r\n ba 3\r\n bac 4\r\n cb 3\r\n c 6\r\n 2\r\n '''\r\n\r\n n = int(sys.stdin.readline())\r\n # n = int('6\\n')\r\n crossword = sys.stdin.readline()[:-1]\r\n # crossword = 'abacba\\n'[:-1]\r\n m = int(sys.stdin.readline())\r\n # m = int('5\\n')\r\n \r\n adj = [[] for _ in range(n+2)]\r\n\r\n # foo\r\n m_words = [\"aba 6\\n\", \"ba 3\\n\", \"bac 4\\n\", \"cb 3\\n\", \"c 6\"]\r\n\r\n # print(len(cost))\r\n for idx in range(m):\r\n word, p = sys.stdin.readline().split()\r\n # word, p = m_words[idx].split()\r\n p = int(p)\r\n\r\n i = 0\r\n while i + len(word) <= n:\r\n if match(crossword, i, word):\r\n u, v = i + 1, i + 1 + len(word)\r\n # print((u, v)) \r\n add_edge(adj, u, v, 1, 0, -p)\r\n\r\n i += 1\r\n\r\n x = int(sys.stdin.readline())\r\n # x = int('2\\n')\r\n\r\n for i in range(n + 1):\r\n u, v = i, i + 1\r\n # print((u, v))\r\n add_edge(adj, u, v, x, 0, 0)\r\n \r\n return adj\r\n\r\ndef bellman_ford(adj, potencial):\r\n for _ in range(len(adj)):\r\n for u in range(len(adj)):\r\n for e in adj[u]:\r\n reduced_cost = potencial[e.u] + e.cost - potencial[e.v]\r\n if e.cap > 0 and reduced_cost < 0:\r\n potencial[e.v] += reduced_cost\r\n\r\ndef dijkstra(adj, potencial, dist, pi, s, t):\r\n oo = float('inf')\r\n for u in range(len(adj)):\r\n dist[u] = +oo\r\n pi[u] = None\r\n\r\n dist[s] = 0\r\n heap = [(0, s)]\r\n\r\n while heap:\r\n du, u = heappop(heap)\r\n\r\n if dist[u] < du: continue\r\n if u == t: break\r\n\r\n for e in adj[u]:\r\n reduced_cost = potencial[e.u] + e.cost - potencial[e.v]\r\n if e.flow < e.cap and dist[e.v] > dist[e.u] + reduced_cost:\r\n dist[e.v] = dist[e.u] + reduced_cost\r\n heappush(heap, (dist[e.v], e.v))\r\n pi[e.v] = e\r\n\r\ndef min_cost_max_flow(adj):\r\n min_cost, max_flow = 0, 0\r\n potencial, oo = [0] * len(adj), float('inf')\r\n dist, pi = [+oo] * len(adj), [None] * len(adj)\r\n\r\n bellman_ford(adj, potencial)\r\n\r\n s, t = 0, len(adj) - 1\r\n while True:\r\n dijkstra(adj, potencial, dist, pi, s, t)\r\n \r\n if dist[t] == +oo:\r\n break\r\n \r\n for u in range(len(adj)):\r\n if dist[u] < dist[t]:\r\n potencial[u] += dist[u] - dist[t]\r\n \r\n limit, v = +oo, t\r\n while v:\r\n e = pi[v]\r\n limit = min(limit, e.cap - e.flow)\r\n v = e.u\r\n \r\n v = t\r\n while v:\r\n e = pi[v]\r\n e.flow += limit\r\n try:\r\n adj[v][e.rev].flow -= limit\r\n except:\r\n adj[v][e.rev].flow -= limit\r\n v = e.u\r\n \r\n min_cost += limit * (potencial[t] - potencial[s])\r\n max_flow += limit\r\n \r\n # path = []\r\n # v = t\r\n # while v:\r\n # path.append(v)\r\n # v = pi[v]\r\n # path.reverse()\r\n # print(path)\r\n \r\n return min_cost, max_flow\r\n\r\nadj = read_input()\r\n# print({\r\n# 'len(adj)': len(adj),\r\n# 'len(cap)': len(cap),\r\n# 'len(cost)': len(cost)\r\n# })\r\n\r\n# print({ 'adj': adj})\r\n# print({ 'cap': cap})\r\n# print({ 'cost': cost})\r\n\r\nmin_cost, _ = min_cost_max_flow(adj)\r\nprint(-min_cost)", "import sys\r\nfrom heapq import heappop, heappush\r\n\r\nclass Edge:\r\n def __init__(self, u, v, cap, flow, cost, rev):\r\n self.u = u\r\n self.v = v\r\n self.cap = cap\r\n self.flow = flow\r\n self.cost = cost\r\n self.rev = rev\r\n\r\ndef add_edge(adj, u, v, capv, flowv, costv):\r\n adj[u].append(Edge(u, v, capv, flowv, costv, len(adj[v])))\r\n adj[v].append(Edge(v, u, 0, flowv, -costv, len(adj[u])-1))\r\n\r\ndef match(crossword, cw_idx, word):\r\n for k in range(len(word)):\r\n if crossword[cw_idx + k] != word[k]:\r\n return False\r\n \r\n return True\r\n\r\ndef read_input():\r\n n = int(sys.stdin.readline())\r\n crossword = sys.stdin.readline()[:-1]\r\n m = int(sys.stdin.readline())\r\n \r\n adj = [[] for _ in range(n+2)]\r\n\r\n for _ in range(m):\r\n word, p = sys.stdin.readline().split()\r\n p = int(p)\r\n\r\n i = 0\r\n while i + len(word) <= n:\r\n if match(crossword, i, word):\r\n u, v = i + 1, i + 1 + len(word)\r\n add_edge(adj, u, v, 1, 0, -p)\r\n\r\n i += 1\r\n\r\n x = int(sys.stdin.readline())\r\n\r\n for i in range(n + 1):\r\n u, v = i, i + 1\r\n add_edge(adj, u, v, x, 0, 0)\r\n \r\n return adj\r\n\r\ndef bellman_ford(adj):\r\n potential = [0] * len(adj)\r\n\r\n for _ in range(len(adj)):\r\n for u in range(len(adj)):\r\n for e in adj[u]:\r\n reduced_cost = potential[e.u] + e.cost - potential[e.v]\r\n if e.cap > 0 and reduced_cost < 0:\r\n potential[e.v] += reduced_cost\r\n \r\n return potential\r\n\r\ndef dijkstra(adj, potential, s, t):\r\n oo = float('inf')\r\n dist, pi = [+oo] * len(adj), [None] * len(adj)\r\n\r\n dist[s] = 0\r\n heap = [(0, s)]\r\n\r\n while heap:\r\n du, u = heappop(heap)\r\n\r\n if dist[u] < du: continue\r\n if u == t: break\r\n\r\n for e in adj[u]:\r\n reduced_cost = potential[e.u] + e.cost - potential[e.v]\r\n if e.cap - e.flow > 0 and dist[e.v] > dist[e.u] + reduced_cost:\r\n dist[e.v] = dist[e.u] + reduced_cost\r\n heappush(heap, (dist[e.v], e.v))\r\n pi[e.v] = e\r\n \r\n return dist, pi\r\n\r\ndef min_cost_max_flow(adj):\r\n min_cost, max_flow = 0, 0\r\n oo = float('inf')\r\n\r\n potential = bellman_ford(adj)\r\n\r\n s, t = 0, len(adj) - 1\r\n while True:\r\n dist, pi = dijkstra(adj, potential, s, t)\r\n \r\n if dist[t] == +oo:\r\n break\r\n \r\n for u in range(len(adj)):\r\n if dist[u] < dist[t]:\r\n potential[u] += dist[u] - dist[t]\r\n \r\n limit, v = +oo, t\r\n while v:\r\n e = pi[v]\r\n limit = min(limit, e.cap - e.flow)\r\n v = e.u\r\n \r\n v = t\r\n while v:\r\n e = pi[v]\r\n e.flow += limit\r\n adj[v][e.rev].flow -= limit\r\n v = e.u\r\n \r\n min_cost += limit * (potential[t] - potential[s])\r\n max_flow += limit\r\n \r\n return min_cost, max_flow\r\n\r\nadj = read_input()\r\n\r\nmin_cost, _ = min_cost_max_flow(adj)\r\nprint(-min_cost)" ]

[ "def solve(x1, y1, x2, y2):\r\n return sum((x2[i] - x1[i] + 1) * (y2[i] - y1[i] + 1) for i in range(len(x1)))\r\n\r\ndef main():\r\n n = int(input())\r\n x1 = []\r\n y1 = []\r\n x2 = []\r\n y2 = []\r\n \r\n for _ in range(n):\r\n x1_i, y1_i, x2_i, y2_i = map(int, input().split())\r\n x1.append(x1_i)\r\n y1.append(y1_i)\r\n x2.append(x2_i)\r\n y2.append(y2_i)\r\n\r\n result = solve(x1, y1, x2, y2)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from cmath import inf\r\n\r\n\r\nn = int(input())\r\nans = 0\r\n\r\nfor _ in range(n):\r\n x1, y1, x2, y2 = [int(i) for i in input().split(' ')]\r\n ans += (abs(x2 - x1) + 1) * (abs(y2 - y1) + 1)\r\n\r\nprint(ans)\r\n", "n, s = int(input()), 0\nfor i in range(n):\n x1, y1, x2, y2 = [int(x) for x in input().split()]\n s += (abs(x1 - x2) + 1) * (abs(y1 - y2) + 1)\nprint(s)\n", "L=[[0]*100]*100\r\nn=int(input())\r\nfor k in range(n):\r\n x1,y1,x2,y2=map(int,input().split())\r\n y=y1\r\n for j in range(y1-1,y2):\r\n for i in range(x1-1,x2):\r\n L[j][i]+=1\r\nsuma=0\r\n\r\nfor k in range(100):\r\n for j in range(100):\r\n suma+=L[k][j]\r\nprint(suma//100)\r\n", "n = int(input())\r\nr = 0\r\nfor i in range(n):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n r += (abs(x1-x2)+1)*(abs(y1-y2)+1)\r\nprint(r)", "n = int(input())\r\nl = []\r\nfor i in range(100): l.append([0] * 100)\r\nfor i in range(n):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n x1 += -1\r\n x2 += -1\r\n y1 += -1\r\n y2 += -1\r\n for i in range(x1, x2 + 1):\r\n for j in range(y1, y2 + 1):\r\n l[i][j] -= -1\r\nans = 0\r\nfor i in range(100):\r\n for j in range(100): ans += l[i][j]\r\nprint(ans)", "n = int(input())\r\nans=0\r\nwhile n>0:\r\n\tx1,y1,x2,y2 = list(map(int, input().split()))\r\n\tans += (x2-x1+1)*(y2-y1+1)\r\n\tn-=1\r\n\r\nprint(ans)", "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 = int(input())\r\nmx = [[0 for i in range(101)] for j in range(1001)]\r\nfor _ in range(cases):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n\r\n for x in range(x1-1, x2):\r\n for y in range(y1-1, y2):\r\n mx[x][y] += 1\r\n\r\nans = 0\r\n\r\nfor row in mx:\r\n ans += sum(row)\r\n\r\nprint(ans)\r\n\r\n", "#!/usr/bin/python3\n# -*- coding: <utf-8> -*-\n\nimport itertools as ittls\nfrom collections import Counter\n\nimport string\n\n\ndef sqr(x):\n return x*x\n\ndef inputarray(func = int):\n return map(func, input().split())\n\n# -------------------------------\n# -------------------------------\n\nN = int(input())\n\ns = 0\n\nfor _ in range(N):\n x1, y1, x2, y2 = inputarray()\n s = s + (x2 - x1 + 1)*(y2 - y1 + 1)\n\nprint(s)\n", "def main():\n n = int(input())\n dct = {}\n for i in range(n):\n x1, y1, x2, y2 = map(int, input().split())\n x_c, y_c = x1, y1\n while y_c <= y2:\n x_c = x1\n while x_c <= x2:\n if (x_c, y_c) in dct:\n dct[(x_c, y_c)] += 1\n else:\n dct[(x_c, y_c)] = 1\n x_c +=1\n y_c += 1\n return sum(dct.values())\nprint(main())\n\n\n\n\n \t \t\t\t\t\t\t\t\t \t \t \t\t \t\t\t \t \t \t", "total = 0\nfor _ in range(int(input().strip())):\n\tx1, y1, x2, y2 = map(int, input().strip().split())\n\ttotal += (x2-x1+1)*(y2-y1+1)\nprint(total)", "n = int(input())\nans = 0\nfor _ in range(n):\n a,b,c,d = map(int,input().split())\n ans+=(c-a+1)*(d-b+1)\nprint(ans)", "n = int(input())\n#n, m = map(int, input().split())\n#s = input()\n#c = list(map(int, input().split()))\nl = 0\nfor i in range(n):\n x1, y1, x2, y2 = map(int, input().split())\n l += (x2 - x1 + 1) * (y2 - y1 + 1)\nprint(l)", "n = int(input())\r\ns=0\r\nfor _ in range(n):\r\n x1,y1,x2,y2 = map(int,input().split())\r\n s=s+abs(x2-x1+1)*abs(y2-y1+1)\r\nprint(s)\r\n ", "n=int(input())\r\nres=0\r\nfor i in range(n):\r\n a,b,c,d=map(int,input().split(' '))\r\n res+=(abs(a-c)+1)*(abs(b-d)+1)\r\nprint(res)", "import sys\nn = int(input())\nans = 0\nfor _ in range(n):\n x1, y1, x2, y2 = map(int, sys.stdin.readline().split())\n ans += (x2+1-x1)*(y2+1-y1)\nprint(ans)\n", "n=int(input())\r\nsum1=0\r\nfor i in range(n):\r\n\tx1,y1,x2,y2=map(int,input().split())\r\n\tsum1+=(x2-x1+1)*(y2-y1+1)\r\nprint(sum1)", "n = int(input())\r\nres = 0\r\nfor j in range(n):\r\n x1,y1,x2,y2 = map(int,input().split())\r\n res += (x2 - x1 + 1) * (y2 - y1 + 1)\r\nprint(res)\r\n", "def readString():\n return input().split(\" \")\n\ndef readInts():\n return list(map(lambda s: int(s), readString()))\n\ndef readInt():\n return int(input())\n\ndef intsToString(ints):\n return \" \".join(intsToStrings(ints))\n\ndef intsToStrings(ints):\n return list(map(lambda i: str(i), ints))\n\n\n#Ваня и таблица\n\nres = 0\nfor _ in range(readInt()):\n a1,a2,b1,b2 = tuple(readInts())\n\n res += (b1-a1+1)*(b2-a2+1)\n\nprint(res)\n", "n = int(input())\r\ntotal = 0\r\nfor i in range(n):\r\n x1, y1, x2, y2 = (int(i) for i in input().split())\r\n total += (x2 + 1 - x1) * (y2 + 1 - y1)\r\nprint(total)", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n x1,y1,x2,y2=map(int,input().split())\r\n ans=ans+(x2-x1+1)*(y2-y1+1)\r\nprint(ans)\r\n", "n,ans=int(input()),0\r\nfor i in range(n):\r\n x1,y1,x2,y2=map(int,input().split())\r\n ans+=(abs(x1-x2)+1)*(abs(y1-y2)+1)\r\nprint(ans)\r\n", "n = int(input())\nsoma = 0\nfor i in range(n):\n\tx,y,z,w = map(int,input().split(\" \"))\n\tsoma += (z-x+1)*(w-y+1)\nprint(soma) \n", "n = int(input())\r\ns = 0\r\nfor i in range (n): \r\n arr = list(map(int, input().split()))\r\n s += ((arr[2]-arr[0]+1)*(arr[3]-arr[1]+1))\r\nprint (s)", "n=int(input())\r\n# a=[[0 for i in range(n)] for j in range(n)]\r\nc=0\r\nfor i in range(n):\r\n x1,y1,x2,y2=map(int,input().split())\r\n c+=(x2-x1+1)*(y2-y1+1)\r\nprint(c)\r\n", "n=int(input())\r\np=0\r\nfor i in range(n):\r\n s = input()\r\n s = s.split(\" \")\r\n x=(int(s[2])-int(s[0])+1)*(int(s[3])-int(s[1])+1)\r\n p+=x\r\nprint(p)\r\n\r\n\r\n", "c = int(input())\nr = []\nfor i in range(c):\n r.append(tuple([int(x) for x in input().split()]))\n\nsum = 0\nfor i in r:\n for y in range(i[1], i[3]+1):\n for x in range(i[0], i[2]+1):\n sum += 1\nprint(sum)\n", "n=int(input())\r\nd={}\r\nfor i in range(1,101):\r\n\tfor j in range(1,101):\r\n\t\td[(i,j)]=0\r\nfor _ in range(n):\r\n\tx1,y1,x2,y2=map(int,input().split())\r\n\tfor i in range(x1,x2+1):\r\n\t\tfor j in range(y1,y2+1):\r\n\t\t\td[(i,j)]+=1\r\ncount=0\r\nfor i in d:\r\n\tcount+=d[i]\r\nprint(count)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/552/A\r\n\r\nn = int(input())\r\n\r\nt = 0\r\nfor _ in range(n):\r\n l_c = list(map(int, input().split()))\r\n t += (abs(l_c[0] - l_c[2]) + 1) * (abs(l_c[1] - l_c[3]) + 1)\r\n \r\nprint(t)", "\r\nn= int(input())\r\n\r\nt=0\r\n\r\nfor i in range(n):\r\n\r\n x1,y1,x2,y2=map(int,input().split())\r\n\r\n t+=(x2-x1+1)*(y2-y1+1)\r\nprint(t)\r\n \r\n", "n=int(input())\r\nb=[[0 for i in range(100)] for i in range(100)]\r\nfor i in range(n):\r\n x1,y1,x2,y2=map(int,input().split())\r\n for j in range(x1-1,x2):\r\n for k in range(y1-1,y2):\r\n b[j][k]+=1\r\nans=0\r\nfor p in range(100):\r\n for q in range(100):\r\n ans+=b[p][q]\r\nprint(ans)", "n = int(input())\r\nr = 0\r\nfor i in range(n):\r\n x1, y1, x2, y2 = list(map(int, input().split()))\r\n r += (x2-x1+1)*(y2-y1+1)\r\nprint(r)", "sum=0\r\nfor _ in range(int(input())):\r\n a,b,c,d=map(int,input().split())\r\n sum+=(c - a + 1) * (d - b + 1)\r\nprint(sum)\r\n", "res = 0\r\nfor _ in range(int(input())):\r\n a, b, c, d = map(int, input().split())\r\n res += (c-a+1)*(d-b+1)\r\nprint(res)", "n = int(input())\r\nll = [list(map(int,input().split())) for _ in range(n)]\r\nprint(sum([(l[2]-l[0]+1)*(l[3]-l[1]+1) for l in ll]))\r\n", "n = int(input())\r\nsum = 0\r\nfor i in range(n):\r\n x1,y1,x2,y2=map(int,input().split())\r\n sum += (x2-x1+1)*(y2-y1+1)\r\nprint(sum)", "area = lambda x1, y1, x2, y2: (x2 - x1 + 1) * (y2 - y1 + 1)\r\n\r\nprint(sum(area(*map(int, input().split())) for _ in range(int(input()))))", "n = int(input())\r\n\r\nan = 0\r\n\r\nfor i in range(n):\r\n x, y, a, b = map(int, input().split())\r\n \r\n area = (abs(x - a) + 1) * (abs(y - b) + 1)\r\n \r\n an += area\r\nprint(an)", "class CodeforcesTask552ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.rects = []\r\n\r\n def read_input(self):\r\n rect_count = int(input())\r\n for x in range(rect_count):\r\n self.rects.append([int(x) for x in input().split(\" \")])\r\n\r\n def process_task(self):\r\n table = [[0 for x in range(100)] for y in range(100)]\r\n for rect in self.rects:\r\n for x in range(rect[0], rect[2]+1):\r\n for y in range(rect[1], rect[3]+1):\r\n table[x-1][y-1] += 1\r\n table_sum = 0\r\n for row in table:\r\n for cell in row:\r\n table_sum += cell\r\n self.result = str(table_sum)\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask552ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "mat=[None]*101\r\nfor i in range(101):\r\n mat[i]=[0]*101\r\nfor i in range(int(input())):\r\n x,y,a,b=map(int,input().split())\r\n for n in range(x,a+1):\r\n for m in range(y,b+1):\r\n mat[n][m]+=1\r\nans=0\r\nfor i in range(101):\r\n ans+=sum(mat[i])\r\nprint(ans)", "MaxColumn, MaxRow = 0, 0\r\nSize = int(input())\r\nRectangles = list()\r\nfor i in range(Size):\r\n Temp = list(map(int, input().split()))\r\n MaxColumn = max(MaxColumn, Temp[3])\r\n MaxRow = max(MaxRow, Temp[2])\r\n Rectangles.append(Temp)\r\nTable = list()\r\nfor i in range(MaxRow):\r\n Table.append([0 for j in range(MaxColumn)])\r\n\r\nfor i in range(Size):\r\n for Row in range(Rectangles[i][0], Rectangles[i][2] + 1):\r\n for Col in range(Rectangles[i][1], Rectangles[i][3] + 1):\r\n Table[Row - 1][Col - 1] += 1\r\nprint(sum(sum(i) for i in Table))\r\n\r\n# UB_CodeForces\r\n# Advice: I'm in the last steps\r\n# Location: Behind my desk\r\n# Caption: What else I can do?\r\n# CodeNumber: 565\r\n", "n = int(input())\n\ntotal = 0\nfor i in range(n):\n x1, y1, x2, y2 = map(int, input().split())\n\n largura = x2-x1+1\n altura = y2-y1+1\n\n total += largura*altura\n\nprint(total)\n\n\t \t\t\t \t\t \t\t \t\t \t\t\t\t\t\t\t\t \t \t\t", "print(sum(map(lambda a:-~(a[2]-a[0])*-~(a[3]-a[1]),(list(map(int,input().split()))for i in range(int(input()))))))\r\n", "n=int(input())\r\narea=0\r\nfor i in range(n):\r\n x1,y1,x2,y2=[int(x) for x in input().split()]\r\n area+=(x2-x1+1)*(y2-y1+1)\r\nprint(area) ", "N=int(input())\r\ns=0\r\nfor i in range(N):\r\n a,b,c,d=map(int,input().split())\r\n s=s+(abs(c-a)+1)*(abs(d-b)+1)\r\nprint(s)\r\n \r\n \r\n \r\n", "print(sum([[(c-a+1)*(d-b+1) for a,b,c,d in [(map(int,input().split()))]][0] for _ in range(int(input()))]))\n\n\n\n# Made By Mostafa_Khaled", "s=int(input())\nlista=[]\nfor i in range(s):\n a,b,c,d=input().split()\n a,b,c,d = int(a),int(b),int(c),int(d)\n \n calculo = ((d-b)+1) * ((c-a)+1)\n lista.append(calculo)\n \n \nprint(sum(lista))\n\t \t\t\t \t\t \t \t\t\t\t\t \t \t \t \t \t", "rect = [[0]*100 for i in range(100)]\n\ndef fill(x1, y1, x2, y2):\n\tglobal rect\n\tfor i in range(x1-1, x2):\n\t\tfor j in range(y1-1, y2):\n\t\t\trect[i][j] += 1\n\nfor _ in range(int(input().strip())):\n\tx1, y1, x2, y2 = map(int, input().strip().split())\n\tfill(x1, y1, x2, y2)\n\ns = 0\nfor row in rect:\n\ts += sum(row)\n\n\nprint(s)\n", "n = int(input())\r\na = []\r\nfor i in range(100):\r\n a.append([])\r\n for j in range(100):\r\n a[i].append(0)\r\nfor i in range(n):\r\n x1, y1, x2, y2 = [int(x) for x in input().split()]\r\n for t in range(x1-1, x2):\r\n for k in range(y1-1, y2):\r\n a[t][k] += 1\r\nnum = 0\r\nfor i in range(100):\r\n num += sum(a[i])\r\nprint(num)", "n,s=int(input()),0\r\nfor i in range(n):\r\n\tx1,y1,x2,y2=[int(x) for x in input().split()]\r\n\ts=s+(abs(x1-x2)+1)*(abs(y1-y2)+1)\r\nprint(s)\r\n", "table = [[0 for i in range(100)] for i in range(100)]\nn = int(input())\nsummi = 0\nfor i in range(n):\n x1,y1,x2,y2 = map(int,input().split())\n for j in range(x1-1,x2,1):\n for k in range(y1-1,y2,1):\n table[j][k] +=1\n\nfor i in range(100):\n for j in range(100):\n summi += table[i][j]\nprint(summi)", "n = int(input())\r\nanswer = 0\r\nfor i in range(n):\r\n x1,y1,x2,y2 = map(int,input().split())\r\n answer += (x2-x1+1) * (y2-y1+1)\r\nprint(answer)\r\n\r\n\r\n", "a = [[0 for i in range(100)] for j in range(100)]\r\nfor cas in range(int(input())):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n for i in range(x1 - 1, x2):\r\n for j in range(y1 - 1, y2):\r\n a[i][j] += 1\r\nans = 0\r\nfor l in a:\r\n ans += sum(l)\r\nprint(ans)", "total = 0\r\nfor _ in range(int(input())):\r\n daf = list(map(int, input().split()))\r\n total += (daf[2] - daf[0] + 1) * (daf[3] - daf[1] + 1)\r\nprint(total)\r\n", "n = int(input())\r\nr = []\r\n\r\nfor i in range(n):\r\n r.append(tuple(map(int, input().split())))\r\n \r\nm = [[0]*100 for i in range(100)]\r\n\r\nfor i in r:\r\n x1, y1, x2, y2 = i\r\n \r\n for y in range(100-y1, 100-y2-1, -1):\r\n for x in range(100-x1, 100-x2-1, -1):\r\n m[y][x] += 1\r\n \r\ns = 0\r\nfor i in m:\r\n s += sum(i)\r\n \r\nprint(s)", "table = [[0 for _ in range(100)] for _ in range(100)]\nr = int(input())\nfor _ in range(r):\n x1,y1,x2,y2 = map(int,input().split(\" \"))\n for y in range(y1-1,y2):\n for x in range(x1-1,x2):\n table[y][x]+=1\nprint(sum([sum(line) for line in table]))\n \t\t \t\t\t\t \t \t \t\t \t\t\t\t", "r=0\r\nfor i in range(int(input())):\r\n x1,y1,x2,y2 = list(map(int,input().split()))\r\n r = r + (x2-x1+1)*(y2-y1+1)\r\nprint(r)", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n li = [int(j) for j in input().split()]\r\n s += (abs(li[2] - li[0]) + 1) * (abs(li[3] - li[1]) + 1)\r\nprint(s)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jan 11 12:38:00 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\na = 0\r\nfor i in range(int(input())):\r\n s = list(map(int,input().split()))\r\n a += (s[2]-s[0]+1)*(s[3]-s[1]+1)\r\nprint(a)", "def build():\n arr = []\n for i in range(100):\n arr.append([0]*100)\n return arr\n\n\n\ndef solve(arr):\n res = build()\n for i,v in enumerate(arr):\n for row in range(v[2]-(v[0]-1)):\n for col in range(v[3]-(v[1]-1)):\n res[row][col] += 1\n tot = 0\n for i in res:\n tot += sum(i)\n return tot\n\n \n\n \n\n \ndef main() :\n n = int(input())\n arr = []\n for _ in range(n):\n i = list(map(int, input().split(' ')))\n arr.append(i)\n print(solve(arr))\nmain()\n", "ans=0\r\nfor _ in range(int(input())):\r\n x1,y1,x2,y2=map(int,input().split())\r\n ans+=(y2-y1+1)*(x2-x1+1)\r\nprint(ans)", "p=0\r\nfor _ in range(int(input())):\r\n x1,y1,x2,y2=map(int,input().split())\r\n p+=(x2-x1+1)*(y2-y1+1)\r\nprint(p) \r\n ", "n=int(input())\r\nt=0\r\nfor i in range (n) :\r\n x1,y1,x2,y2=map(int,input().split())\r\n t+=(x2-x1+1)*(y2-y1+1)\r\nprint (t)\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\nn=int(input())\r\nk=0\r\nfor i in range(n):\r\n x1,y1,x2,y2=map(int,input().split())\r\n k+=(x2-x1+1)*(y2-y1+1)\r\nprint(k)", "num = int(input())\r\n\r\nmatx =[]\r\n\r\nfor i in range(100):\r\n a = [0 for a in range(100)]\r\n matx.append(a)\r\n\r\nfor k in range(num):\r\n angles = [int(a) for a in input().split()]\r\n for i in range(angles[1]-1, angles[3]):\r\n for j in range(angles[0]-1, angles[2]):\r\n matx[i][j] += 1\r\nsumm = 0\r\nfor i in matx:\r\n summ += sum(i)\r\n\r\nprint(summ)\r\n\r\n# for i in range(num):\r\n# rec = [int(a) for a in input().split()]\r\n\r\n\r\n\r\n\r\n", "n = int(input())\nsm = 0\n\nfor _ in range(n):\n\tx, y, xx, yy = map(int, input().split())\n\tsm += (xx - x + 1) * (yy - y + 1)\n\nprint(sm)\n", "n = int(input())\r\na=0\r\nfor i in range(n):\r\n x1,y1,x2,y2 = [int(j) for j in input().split()]\r\n a += (x2 - x1 + 1) * (y2 - y1 + 1);\r\nprint(a)", "n = int(input())\r\ntable = [[0] * 100 for _ in range(100)]\r\n\r\nfor _ in range(n):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n for i in range(y1-1, y2):\r\n for j in range(x1-1, x2):\r\n table[i][j] += 1\r\n\r\ntotal_sum = sum(sum(row) for row in table)\r\nprint(total_sum)\r\n", "table = [[0 for i in range(100)] for i in range(100)]\nn = int(input())\nsummi = 0\n# for i in range(n):\n# x1,y1,x2,y2 = map(int,input().split())\n# for j in range(x1-1,x2,1):\n# for k in range(y1-1,y2,1):\n# table[j][k] +=1\n\n# for i in range(100):\n# for j in range(100):\n# summi += table[i][j]\n# print(summi)\n\nfor i in range(n):\n x1,y1,x2,y2 = map(int,input().split())\n summi += (x2-x1+1) * (y2-y1+1)\n\nprint(summi)\n", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n x1,y1,x2,y2=map(int,input().split())\r\n c+=abs((x2-x1+1)*(y2-y1+1))\r\nprint(c)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jan 24 17:02:55 2022\r\n\r\n@author: sachd\r\n\"\"\"\r\nn=int(input())\r\n#rows,cols=(100,100)\r\n#arr=[[0]*cols]*rows\r\ntotal=0\r\nfor i in range(n):\r\n a=input().split()\r\n x1=int(a[0])\r\n y1=int(a[1])\r\n x2=int(a[2])\r\n y2=int(a[3])\r\n total+=(x2-x1+1)*(y2-y1+1)\r\n '''for j in range(x1-1,x2):\r\n for k in range(y1-1,y2):\r\n print((j,k))\r\n arr[j][k]+=1'''\r\n#print(arr)\r\n#print(sum(map(sum,arr)))\r\nprint(total)\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = 0\r\nfor _ in range(int(input())):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n s += (x2-x1+1)*(y2-y1+1)\r\nprint(s)", "n=int(input())\ns=0\nfor i in range(n):\n a=[int(i) for i in input().split()]\n s+=(a[2]-a[0]+1) * (a[3]-a[1]+1)\n\nprint(s)\n", "c=0 \r\nt = int(input())\r\nfor _ in range(t):\r\n x1,y1,x2,y2 = map(int,input().split())\r\n n=100\r\n mat = []\r\n for i in range(100):\r\n mat.append([0]*100)\r\n \r\n for i in range(n-y1,n-y2-1,-1):\r\n for j in range(abs(x1-x2)+1):\r\n mat[i][j]+=1\r\n \r\n for i in range(100):\r\n for j in range(100):\r\n c+=mat[i][j]\r\nprint(c)\r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n a,b,c,d = map(int,input().split())\r\n ans+=(c-a+1)*(d-b+1)\r\nprint(ans)", "# your code goes here# your code goes here\nm = []\nfor _ in range(100):\n\tm.append([0]*100)\nans = 0\nfor _ in range(int(input())):\n\tx1, y1, x2, y2 = map(int, input().split())\n\t# print((x2-x1+1)*(y2-y1+1))\n\tans = ans + (x2-x1+1)*(y2-y1+1)\nprint(ans)\n \t\t\t\t \t\t \t \t\t\t\t\t \t\t\t \t \t", "n = int(input())\nres = 0\ni=0\nwhile i<n:\n a,b,c,d = map(int, input().split())\n res += (c-a+1)*(d-b+1)\n i+=1\nprint(res)\n\t\t \t \t \t \t \t\t \t\t \t \t", "ans = 0\r\nfor i in range(int(input())):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n ans += (x2 - x1 + 1) * (y2-y1+1)\r\nprint(ans)", "n = int(input())\r\nt = 0\r\nfor i in range(n):\r\n\ta = list(map(int,input().split()))\r\n\tt = t + (a[2]-a[0]+1)*(a[3]-a[1]+1)\r\nprint(t)\r\n", "n=int(input())\r\nans=0\r\nfor _ in range(n):\r\n x1,y1,x2,y2=map(int,input().split())\r\n ans+=(y2-y1+1)*(x2-x1+1)\r\nprint(ans)", "n = int(input())\r\n \r\nresult = 0\r\n \r\nfor _ in range(n):\r\n\tx1, y1, x2, y2 = map(int, input().split())\r\n\tresult += (x2-x1+1)*(y2-y1+1)\r\n \r\nprint(result)", "ans = 0\r\nfor _ in int(input()) * ' ':\r\n q, w, e, r = map(int, input().split())\r\n ans += (r - w + 1) * (e - q + 1)\r\nprint(ans)\r\n", "r=0\r\nfor s in[*open(0)][1:]:\r\n a,b,c,d=map(int,s.split())\r\n r+=(c-a+1)*(d-b+1)\r\nprint(r)", "arr = []\r\nfor x in range(100):\r\n arr.append([])\r\n arr[x] = [0 for i in range(100)]\r\nn = int(input())\r\nans=0\r\nfor x in range(n):\r\n a, b, c, d = map(int, input().split())\r\n ans=ans+(c-a+1)*(d-b+1)\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n x,y,x1,y1=map(int,input().split())\r\n ans+=(x1-x+1)*(y1-y+1)\r\nprint(ans)", "n = int(input())\r\nres = 0\r\nfor i in range(n):\r\n x1, y1, x2, y2 = tuple(map(int, input().split()))\r\n res += (abs(x1-x2) + 1) * (abs(y1-y2) + 1)\r\n \r\nprint(res)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n a=str(input()).split()\r\n x1=int(a[0])\r\n y1=int(a[1])\r\n x2=int(a[2])\r\n y2=int(a[3])\r\n s+=(x2-x1+1)*(y2-y1+1)\r\nprint(s)", "n = int(input())\r\nanswer = 0\r\nfor i in range(n):\r\n yo, xo, yt, xt = map(int, input().split())\r\n \r\n answer += ((yt - yo) + 1) * ((xt - xo) + 1)\r\n\r\nprint(answer)", "ans = 0\r\nfor _ in range(int(input())):\r\n a, b, c, d = map(int, input().split())\r\n ans += (c - a + 1) * (d - b + 1)\r\nprint(ans)\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n x1,y1,x2,y2=list(map(int,input().split()))\r\n count+=(x2-x1+1)*(y2-y1+1)\r\nprint(count)\r\n", "s = 0\r\n\r\nfor _ in range(int(input())):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n s += (abs(x1 - x2) + 1) * (abs(y1 - y2) + 1)\r\n\r\nprint(s)", "number_of_rect = int(input())\r\n\r\nrectangles = []\r\nfor _ in range(number_of_rect):\r\n _x1, _y1, _x2, _y2 = list(map(int, input().split()))\r\n zipped_x_y = list(zip((_x1, _x2), (_y1, _y2)))\r\n rectangles.append(zipped_x_y)\r\n zipped_x_y = []\r\n\r\n\r\ndef rectangle_counter(*rects_arg):\r\n rect_quantity = 0\r\n for rect in rects_arg:\r\n temp_rect_quantity = (rect[1][0] - rect[0][0] + 1) * (rect[1][1] - rect[0][1] + 1)\r\n rect_quantity += temp_rect_quantity\r\n return rect_quantity\r\n\r\n\r\nprint(rectangle_counter(*rectangles))\r\n\r\n", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n x,y,x1,y1=map(int,input().split())\r\n ans+=(abs(x1-x)+1)*(abs(y1-y)+1)\r\nprint(ans)", "n = int(input())\nans = 0\n\nfor i in range(n):\n coord = list(map(int, input().split()))\n ans += (abs(coord[2] - coord[0]) + 1)*(abs(coord[3] - coord[1]) + 1)\n\nprint(ans)\n\n\t\t \t\t \t \t \t\t\t\t\t \t\t\t \t\t\t \t \t\t \t", "# You lost the game.\nn = int(input())\nM = [list(map(int, input().split())) for _ in range(n)]\nT = [[0 for _ in range(100)] for _ in range(100)]\nfor k in range(n):\n R = M[k]\n for i in range(R[0]-1,R[2]):\n for j in range(R[1]-1,R[3]):\n T[i][j] += 1\nprint(sum([sum(T[i]) for i in range(100)]))\n", "n = int(input())\r\nN = 105\r\ns = [[0] * N for _ in range(N)]\r\n\r\nans = 0\r\nfor i in range(n):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n ans += (abs(x1 - x2) + 1) * (abs(y1 - y2) + 1)\r\n\r\nprint(ans)", "import sys\r\n\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n x1, y, x2, y2 = list(map(int, sys.stdin.readline().split()))\r\n ans += (x2-x1+1)*(y2-y+1)\r\nprint(ans)", "n = int(input())\n\ncount = 0\n\nfor i in range(n):\n \n x1, y1, x2, y2 = map(int, input().split())\n count += (x2-x1+1)*(y2-y1+1)\n\nprint(count)\n \n\n \t \t \t \t \t \t\t \t\t\t\t\t\t\t\t \t\t", "def table(lst):\r\n result = 0\r\n for elem in lst:\r\n result += (elem[2] - elem[0] + 1) * (elem[3] - elem[1] + 1)\r\n return result\r\n\r\n\r\nn = int(input())\r\na = list()\r\nfor i in range(n):\r\n x1, y1, x2, y2 = [int(j) for j in input().split()]\r\n a.append([x1, y1, x2, y2])\r\nprint(table(a))\r\n", "def table(a):\r\n sum=0\r\n for i in range(len(a)):\r\n arr=a[i]\r\n x=arr[2]-arr[0]+1\r\n y=arr[3]-arr[1]+1\r\n sum+=x*y\r\n\r\n print(sum)\r\n\r\n\r\n\r\nn=int(input(''))\r\na=[]\r\nfor i in range(n):\r\n b=list(map(int,input('').split()))\r\n a.append(b)\r\n\r\ntable(a)", "n = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n x1,y1,x2,y2 = map(int,input().split())\r\n ans+= (x2-x1+1)*(y2-y1+1)\r\nprint(ans)", "g=[0]*105*105\r\nn=int(input())\r\nfor k in range(n):\r\n x1,y1,x2,y2=map(int,input().split())\r\n for i in range(y1,y2+1):\r\n for j in range(x1,x2+1):\r\n g[i*105+j]+=1\r\nprint(sum(g))", "import math\r\n\r\ndef main_function():\r\n input_data = [[int(l) for l in input().split(\" \")] for i in range(int(input()))]\r\n sums = 0\r\n for i in input_data:\r\n sums += abs(i[3] - i[1] + 1) * abs(i[2] - i[0] + 1)\r\n print(sums)\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "n=int(input())\r\nM=[]\r\nfor i in range(101):\r\n M.append([0]*101)\r\n\r\nfor i in range(n):\r\n x1,y1,x2,y2=map(int,input().strip().split(' '))\r\n for j in range(abs(x2-x1)+1):\r\n for k in range(abs(y2-y1)+1):\r\n \r\n M[j][k]+=1\r\ns=0\r\nfor i in range(101):\r\n for j in range(101):\r\n s=s+M[i][j]\r\nprint(s)\r\n ", "# coding=utf-8\r\n\r\n\r\nif __name__ == '__main__':\r\n value = 0\r\n n = int(input())\r\n for i in range(n):\r\n x1, y1, x2, y2 = str(input()).split()\r\n value += (int(x2) - int(x1) + 1) * (int(y2) - int(y1) + 1)\r\n print(value)\r\n", "area = 0\r\nfor _ in range(int(input())):\r\n a, b, x, y = [int(inp) for inp in input().split(\" \")]\r\n area += (abs(x-a+1)*abs(y-b+1))\r\nprint(area)\r\n", "z=[];s=0\r\nfor i in' '*int(input()):\r\n a,b,c,d=list(map(int,input().split()))\r\n s+=(c-a+1)*(d-b+1)\r\nprint(s)", "n = int(input())\r\ngrid = [0] * (100 ** 2)\r\nfor row in range(n):\r\n x1, y1, x2, y2 = [int(x) for x in input().split(' ')]\r\n for i in range(x1 - 1, x2):\r\n for j in range(y1 - 1, y2):\r\n grid[n * i + j] += 1\r\n\r\nprint(sum(grid))", "n = int(input())\r\ntotal = 0\r\nrects = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\nfor x1, y1, x2, y2 in rects:\r\n total += (x2-x1+1) * (y2-y1+1)\r\n\r\nprint(total)", "t=int(input())\r\nans=0\r\nwhile(t>0):\r\n t-=1\r\n x1,y1,x2,y2=map(int,input().split())\r\n ans+=(x2-x1+1)*(y2-y1+1)\r\nprint(ans)", "\r\nr = lambda: list(map(int,input().split()))\r\nn = int(input())\r\n\r\nc = lambda x: (x[2]-x[0] + 1) *(x[3]-x[1] + 1)\r\ntotal = sum(c(r()) for _ in range(n))\r\nprint (total)", "n = int(input())\r\nmatrix = [[0] * 100 for i in range(100)]\r\nfor t in range(n):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n for i in range(y1 - 1, y2):\r\n for j in range(x1 - 1, x2):\r\n matrix[i][j] += 1\r\nanswer = 0\r\nfor row in matrix:\r\n answer += sum(row)\r\nprint(answer)", "n=int(input())\r\na = [[0 for i in range(1000)] for j in range(1000)] \r\n\r\nans=0\r\nfor i in range(0,n):\r\n x1,y1,x2,y2=map(int,input().split())\r\n # print(\"ghj\")\r\n for i in range (x1,x2+1):\r\n for j in range(y1,y2+1):\r\n \r\n a[i][j]+=1\r\n \r\n \r\nfor i in range(0,1000):\r\n for j in range(0,1000):\r\n \r\n ans+=a[i][j]\r\n \r\n \r\nprint(ans)\r\n ", "sum = 0\r\nN = int(input())\r\nfor i in range(N):\r\n\tx1,y1,x2,y2 = tuple(int(i) for i in input().split())\r\n\tsum+=(x2-x1+1)*(y2-y1+1)\r\nprint (sum)\r\n\t\t\t", "n = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n ans += (x2 - x1 + 1) * (y2 - y1 + 1)\r\nprint(ans)", "n = int(input())\r\n\r\nsum_area = 0\r\n\r\nfor i in range(n):\r\n x1, y1, x2, y2 = [int(x) for x in input().split(\" \")]\r\n area = (x2 - x1 + 1) * (y2 - y1 + 1)\r\n sum_area += area\r\n\r\nprint(sum_area)" ]

[ "import math\r\nval = [\r\n 0, 1, 2, 1, 4, 3, 2, 1, 5, 6, 2, 1, 8, 7, 5, 9, 8, 7, 3, 4, 7, 4, 2, 1,\r\n 10, 9, 3, 6, 11, 12\r\n]\r\nn = int(input())\r\ntaken = [False] * 40005\r\nres = 0\r\nrem = n\r\nfor i in range(2, int(math.sqrt(n)) + 1):\r\n if taken[i]:\r\n continue\r\n sz = 1\r\n a = i\r\n taken[a] = True\r\n while a * i <= n:\r\n a *= i\r\n sz += 1\r\n if a * a <= n:\r\n taken[a] = True\r\n rem -= sz\r\n res ^= val[sz]\r\nres ^= (rem % 2)\r\nprint(\"Vasya\" if res else \"Petya\")# 1692604895.7939215", "from sys import stdin, stdout\r\nimport math, collections\r\nmod = 10**9+7\r\n\r\ndef isPower(n):\r\n if (n <= 1):\r\n return True\r\n for x in range(2, (int)(math.sqrt(n)) + 1):\r\n p = x\r\n while (p <= n):\r\n p = p * x\r\n if (p == n):\r\n return True\r\n\r\n return False\r\nn = int(input())\r\narr = [0,1,2,1,4,3,2,1,5,6,2,1,8,7,5,9,8,7,3,4,7,4,2,1,10,9,3,6,11,12]\r\nans = arr[int(math.log(n, 2))]\r\ns = int(math.log(n, 2))\r\nfor i in range(3, int(n**0.5)+1):\r\n if not isPower(i):\r\n ans^=arr[int(math.log(n, i))]\r\n s+=int(math.log(n, i))\r\nans^=((n-s)%2)\r\nprint(\"Vasya\" if ans else \"Petya\")" ]

[ "# @author Matheus Alves dos Santos\n\nn_balls, n_colors, new_ball = map(int, input().split())\nballs = list(map(int, input().split()))\n\nanswer = 0\n\nfor i in range(n_balls):\n copy = balls[:]\n copy.insert(i, new_ball)\n \n while (len(copy) > 2):\n size = len(copy)\n for j in range(2, len(copy)): \n if ((copy[j - 2] == copy[j - 1]) and (copy[j - 1] == copy[j])):\n cut = j + 1\n while (cut < len(copy)):\n if (copy[j] != copy[cut]):\n break\n cut += 1\n copy = (copy[:j - 2] + copy[cut:])\n break\n \n if (len(copy) == size):\n break\n \n answer = max(answer, n_balls - len(copy)) \n \nprint(answer)", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineering College\r\n\r\n'''\r\nfrom os import path\r\nimport sys\r\nfrom functools import cmp_to_key as ctk\r\nfrom collections import deque,defaultdict as dd \r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil,sqrt,log,gcd\r\ndef ii():return int(input())\r\ndef si():return input()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nabd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nmod=1000000007\r\n#mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\ndef bo(i):\r\n return ord(i)-ord('a')\r\n\r\n\r\n\r\n\r\n\r\ndef solve():\r\n \r\n \r\n \r\n n,k,x=mi()\r\n a=li()\r\n ans=0\r\n x1=[]\r\n c=1\r\n for i in range(1,n):\r\n if a[i]!=a[i-1]:\r\n if c>2:\r\n ans+=c\r\n c=1\r\n continue\r\n x1.append([c,a[i-1]])\r\n c=1\r\n else:\r\n c+=1\r\n if c>2:\r\n ans+=c\r\n else:\r\n x1.append([c,a[n-1]])\r\n \r\n n=len(x1)\r\n ans1=0\r\n for i in range(len(x1)):\r\n c=0\r\n if x1[i][1]==x and x1[i][0]>1:\r\n c+=x1[i][0]\r\n l=i-1\r\n r=i+1\r\n while(l>=0 and r<n):\r\n if x1[l][1]==x1[r][1] and x1[l][0]+x1[r][0]>2:\r\n c+=(x1[l][0]+x1[r][0])\r\n l-=1\r\n r+=1\r\n else:\r\n break\r\n ans1=max(ans1,c)\r\n print(ans+ans1)\r\n \r\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 solve()\r\n", "n, _, x = map(int, input().split())\r\nli = list(map(int, input().split()))\r\n\r\nfreq = []\r\n\r\nlast = li[0]\r\nlast_pos = 1\r\n\r\nfor i in range(n):\r\n if li[i] == last: continue\r\n freq.append((last, i - last_pos + 1))\r\n last = li[i]\r\n last_pos = i + 1\r\n\r\nfreq.append((last, n - last_pos + 1))\r\n\r\nans = 0\r\nfor i in range(len(freq)):\r\n if freq[i][0] != x or freq[i][1] + 1 < 3: continue\r\n \r\n c = freq[i][1]\r\n j = i\r\n k = 1\r\n while j + k < len(freq) and j - k >= 0:\r\n if freq[j + k][0] != freq[j - k][0]:\r\n break\r\n y = freq[j + k][1] + freq[j - k][1]\r\n if y < 3:\r\n break\r\n \r\n c += y\r\n k += 1\r\n\r\n\r\n ans = max(ans, c)\r\n\r\nprint(ans)", "n, k, x = map(int, input().split())\r\nbolas = list(map(int, input().split()))\r\nresp = 0\r\nfor c in range(n):\r\n\ts = bolas.copy()\r\n\ts.insert(c, x)\r\n\twhile len(s) > 2:\r\n\t\tl = len(s)\r\n\t\tfor i in range(2, len(s)):\r\n\t\t\tif s[i-2] == s[i-1] == s[i]:\r\n\t\t\t\tp = i + 1\r\n\t\t\t\twhile p < len(s):\r\n\t\t\t\t\tif s[i] != s[p]:\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\t\tp += 1\r\n\t\t\t\ts = s[:i-2] + s[p:]\r\n\t\t\t\tbreak\r\n\t\tif len(s) == l:\r\n\t\t\tbreak\r\n\tresp = max(resp, n - len(s))\r\nprint(resp)", "def can_destroy(A):\n color_now = A[0]\n num_now = 1\n for i in range(1, len(A)):\n if color_now == A[i]:\n num_now += 1\n if num_now == 3:\n return i - 2\n else:\n color_now = A[i]\n num_now = 1\n return -1\n \n\ndef destroy(A):\n while len(A) > 0 and can_destroy(A) != -1:\n i = can_destroy(A)\n c = A[i]\n while i < len(A) and A[i] == c:\n A.pop(i)\n return A\n\nn, k, x = map(int, input().split())\nA = list(map(int, input().split()))\nres = 0\nfor i in range(len(A) + 1):\n B = A[:]\n B.insert(i, x)\n B = destroy(B)[:]\n res = max(res, len(A) - len(B))\nprint(res)", "from itertools import *\n\nR = lambda: map(int, input().split())\n\nn, k, x = R()\n\nc = [(k, len(list(g))) for k, g in groupby(R())]\n\ncount = 0\n\nfor i in range(len(c)):\n\n if c[i][0] == x and c[i][1] > 1:\n\n a = c[i][1]\n\n l, r = i - 1, i + 1\n\n while l >= 0 and r < len(c) and c[l][0] == c[r][0] and c[l][1] + c[r][1] > 2:\n\n a += c[l][1] + c[r][1]\n\n l -= 1\n\n r += 1\n\n count = max(count, a)\n\nprint(count)\n\n\n\n# Made By Mostafa_Khaled", "n, k, x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nmx = 0\r\nfor i in range(1, n):\r\n if arr[i] == arr[i - 1] == x:\r\n l, r = i - 1, i\r\n\r\n cur = r - l + 1\r\n r += 1\r\n l -= 1\r\n while l >= 0 and r < n:\r\n cnt = 0\r\n if arr[l] != arr[r]:\r\n break\r\n\r\n temp = arr[l]\r\n while l >= 0 and arr[l] == temp:\r\n cnt += 1\r\n l -= 1\r\n\r\n while r < n and arr[r] == temp:\r\n cnt += 1\r\n r += 1\r\n\r\n if cnt >= 3:\r\n cur += cnt\r\n else:\r\n break\r\n mx = max(mx, cur)\r\n\r\nprint(mx)\r\n\r\n", "n, k, x = input().split(\" \")\r\nn = int(n)\r\nballs = [int(x) for x in input().split(\" \")]\r\nans = 0\r\n\r\nfor k in range(len(balls)):\r\n i = k\r\n j = i + 1\r\n cnt = 1\r\n cur = int(x)\r\n while True:\r\n pre_i = i\r\n pre_j = j\r\n \r\n while i >= 0 and balls[i] == cur:\r\n i -=1\r\n cnt += 1\r\n \r\n while j < n and balls[j] == cur:\r\n j += 1\r\n cnt += 1\r\n \r\n if cnt <= 2:\r\n i = pre_i\r\n j = pre_j\r\n break\r\n else:\r\n cur = balls[i]\r\n cnt = 0\r\n ans = max(ans, j - i - 1)\r\nprint(ans)", "n = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nm = 0\r\n#123\r\nfor i in range(n[0]):\r\n\r\n s1 = s[:i]\r\n s1.append(n[2])\r\n s1 += s[i:]\r\n for j in range(100):\r\n for k in range(len(s1) - 2):\r\n if s1[k] == s1[k + 1] == s1[k + 2]:\r\n if k < len(s1) - 3:\r\n if s1[k] == s1[k + 3]:\r\n for p in range(4):\r\n del s1[k]\r\n else:\r\n for p in range(3):\r\n del s1[k]\r\n else:\r\n for p in range(3):\r\n del s1[k]\r\n break\r\n if len(s) - len(s1) > m:\r\n m = len(s) - len(s1)\r\nprint(m)\r\n", "(numero_bolas, k, bola_inserida) = input().split()\r\nnumero_bolas, k = int(numero_bolas), int(k)\r\nsequencia_bolas = input().split()\r\nmaior_pontuacao = 0\r\n\r\nfor i in range(numero_bolas):\r\n copia_sequencia_bolas = sequencia_bolas.copy()\r\n copia_sequencia_bolas.insert(i, bola_inserida)\r\n while len(copia_sequencia_bolas) > 2:\r\n tamanho_sequencia = len(copia_sequencia_bolas)\r\n for j in range(2, len(copia_sequencia_bolas)):\r\n if copia_sequencia_bolas[j-2] == copia_sequencia_bolas[j-1] == copia_sequencia_bolas[j]:\r\n posicao_final = j + 1\r\n while posicao_final < len(copia_sequencia_bolas):\r\n if copia_sequencia_bolas[j] != copia_sequencia_bolas[posicao_final]:\r\n break\r\n posicao_final += 1\r\n copia_sequencia_bolas = copia_sequencia_bolas[:j-2] + copia_sequencia_bolas[posicao_final:]\r\n break\r\n if len(copia_sequencia_bolas) == tamanho_sequencia:\r\n break\r\n maior_pontuacao = max(maior_pontuacao, numero_bolas - len(copia_sequencia_bolas))\r\n\r\nprint(maior_pontuacao)\r\n", "n,k,x,=map(int,input().split())\r\n\r\nL=list(map(int,input().split()))\r\n\r\nans=0\r\nfor i in range(n):\r\n X=list(L[0:i])+[x]+list(L[i:])\r\n a=0\r\n while(1):\r\n cont=False\r\n cnt=1\r\n z=0\r\n for i in range(1,len(X)):\r\n if(X[i]==X[i-1]):\r\n cnt+=1\r\n else:\r\n if(cnt>=3):\r\n X=list(X[0:z])+list(X[i:])\r\n cont=True\r\n break\r\n else:\r\n cnt=1\r\n z=i\r\n if(cont):\r\n continue\r\n if(cnt>=3):\r\n X=list(X[:z])\r\n continue\r\n break\r\n ans=max(ans,n-len(X))\r\nprint(ans)\r\n", "def solve(n, k, x, c):\r\n res = 0 \r\n for i in range(n - 1):\r\n if c[i] == c[i + 1] == x:\r\n temp = c[:i] + c[i+2:]\r\n while True:\r\n flag = True\r\n for l in range(len(temp) - 1):\r\n r = l + 1\r\n while (r < len(temp) and (temp[r] == temp[l])):\r\n r += 1\r\n if (r - l) >= 3:\r\n temp = temp[:l] + temp[r:]\r\n flag = False\r\n break\r\n if flag == True:\r\n break\r\n res = max(res, n - len(temp))\r\n return res\r\n\r\nn, k , x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nans = solve(n, k, x, c)\r\nprint(ans)", "n,m,k = map(int,input().split())\r\nlis = list(map(int,input().split()))+[0]\r\npre=cur=c=ans=0\r\naa=[]\r\nc=1\r\nfor i in range(1,n+1):\r\n if lis[i]==lis[i-1]:\r\n c+=1\r\n else:\r\n aa.append([lis[i-1],c])\r\n c=1\r\naa=[[0,0]]+aa+[[0,0]] \r\nl=len(aa)\r\n#print(aa) \r\nfor i in range(1,l):\r\n cur=0\r\n if aa[i][0]==k:\r\n if aa[i][1]==2:\r\n cur+=2\r\n j=1\r\n# print(aa[i-j][1],i,aa[i+j][1])\r\n while i+j<l and i-j>=0 and aa[i-j][1]+aa[i+j][1]>=3 and aa[i-j][0]==aa[i+j][0]:\r\n cur+=aa[i-j][1]+aa[j+i][1]\r\n# print(aa[i-j][1],i,aa[i+j][1],'ll',cur)\r\n j+=1\r\n ans=max(ans,cur) \r\nprint(ans) \r\n", "def chk(o):\r\n flag = 1\r\n visited = set()\r\n while flag:\r\n # print(o)\r\n prev = -1\r\n cnt = 0\r\n z = []\r\n flag = 0\r\n for i in range(len(o)):\r\n x = o[i]\r\n if x == prev:\r\n z.append(i)\r\n if cnt == 0:\r\n z.append(i-1)\r\n cnt += 1\r\n\r\n cnt += 1\r\n\r\n else:\r\n if x != prev:\r\n prev = x\r\n if cnt >= 3:\r\n for r in z:\r\n visited.add(r)\r\n\r\n z = []\r\n cnt = 0\r\n continue\r\n\r\n prev = x\r\n\r\n if cnt >= 3:\r\n for r in z:\r\n visited.add(r)\r\n\r\n tarray = []\r\n for i in range(len(o)):\r\n if i in visited:\r\n flag = 1\r\n continue\r\n\r\n tarray.append(o[i])\r\n\r\n o = tarray\r\n visited = set()\r\n\r\n return len(o)\r\n\r\nfor _ in range(1):\r\n n,k,x = map(int,input().split())\r\n l = list(map(int,input().split()))\r\n ans = 10**18\r\n for i in range(n+1):\r\n e1 = l[0:i]\r\n e2 = [x]\r\n e3 = l[i:n]\r\n o = e1+e2+e3\r\n ans = min(chk(o),ans)\r\n\r\n if n-ans < 0:\r\n print(0)\r\n continue\r\n\r\n print(n-ans)", "# codeforces.com/problemset/problem/430/B\r\nimport copy\r\n\r\ndef list_sum(matrix):\r\n result = []\r\n aux = matrix[0]\r\n for x in range(1, len(matrix)):\r\n if(aux[0] == matrix[x][0]):\r\n aux[1] += matrix[x][1]\r\n else:\r\n result.append(aux)\r\n aux = matrix[x]\r\n else:\r\n result.append(aux)\r\n\r\n return result\r\n\r\ndef verif(posib, matrix):\r\n del(matrix[posib])\r\n matrix = list_sum(matrix)\r\n print(matrix)\r\n\r\n while True:\r\n pos = ispos(matrix)\r\n if len(pos) == 0:\r\n break\r\n else:\r\n for x in pos:\r\n del(matrix[x])\r\n matrix = list_sum(matrix)\r\n\r\n print(matrix)\r\n\r\n return matrix\r\n\r\ndef ispos(matrix):\r\n posibilidades = []\r\n for x in range(len(matrix)):\r\n if matrix[x][1] >= 3:\r\n posibilidades.append(x)\r\n return posibilidades\r\n\r\nn, colors, boll = [int(x) for x in input().split(' ')]\r\nlista = [int(x) for x in input().split(' ')]\r\n\r\nsoma = []\r\naux = [lista[0], 1]\r\nfor x in range(1, n):\r\n if lista[x] == aux[0]:\r\n aux[1] += 1\r\n else:\r\n soma.append(aux)\r\n aux = [lista[x], 1]\r\nelse:\r\n soma.append(aux)\r\n\r\nposibilidades = []\r\nfor x in range(len(soma)):\r\n if soma[x][0] == boll and soma[x][1] >= 2:\r\n posibilidades.append(x)\r\n\r\nif len(posibilidades) == 0:\r\n print('0')\r\nelse:\r\n result = 0\r\n for x in posibilidades:\r\n #print(x)\r\n #print(soma)\r\n\r\n matrix = copy.deepcopy(soma)\r\n del(matrix[x])\r\n matrix = list_sum(matrix)\r\n #print(matrix)\r\n\r\n while True:\r\n pos = ispos(matrix)\r\n if len(pos) == 0:\r\n break\r\n else:\r\n for i in pos:\r\n del(matrix[i])\r\n if len(matrix) > 0:\r\n matrix = list_sum(matrix)\r\n\r\n #print(matrix)\r\n\r\n aux = 0\r\n for j in matrix:\r\n aux += j[1]\r\n aux = n - aux\r\n if aux > result:\r\n result = aux\r\n \r\n print(result)", "def remover(lista,n):\r\n valor = 0\r\n cont = 0\r\n for i in range(n):\r\n if valor == lista[i]:\r\n cont+=1\r\n else:\r\n valor = lista[i]\r\n cont = 1\r\n if i==n-1 or lista[i+1]!=lista[i]: \r\n if cont >= 3:\r\n for j in range(cont):\r\n del lista[i-j]\r\n return remover(lista,len(lista))\r\n return len(lista)\r\n\r\nn,k,x = map(int,input().split())\r\nb = list(map(int,input().split()))\r\ncont = 0\r\nmaior = 0\r\nfor i in range(n):\r\n if b[i]==x:\r\n cont+=1\r\n else:\r\n cont=0\r\n if cont ==2:\r\n l = b.copy()\r\n l.insert(i,x)\r\n valor = n - remover(l, n + 1)\r\n if valor > maior:\r\n maior = valor\r\nprint(maior)", "nkx = list(map(int, input().split(' ')))\nrow = list(map(int, input().split(' ')))\n\nn = nkx[0]\nk = nkx[1]\nx = nkx[2]\n\nresult = 0\n\nfor i in range(n):\n\n row_copy = row[:]\n\n row_copy.insert(i, x)\n \n while (len(row_copy) > 2):\n size = len(row_copy)\n \n for elem in range(2, len(row_copy)):\n \n if (row_copy[elem - 2] == row_copy[elem - 1]) and (row_copy[elem - 1] == row_copy[elem]): \n row_cut = elem + 1\n\n while row_cut < len(row_copy):\n\n if (row_copy[elem] != row_copy[row_cut]):\n break\n\n row_cut += 1\n\n row_copy = (row_copy[:elem-2] + row_copy[row_cut:])\n break\n \n if len(row_copy) == size:\n break\n \n result = max(result, n - len(row_copy)) \n \nprint(result)\n\t \t\t\t\t\t \t \t \t \t \t \t \t\t \t \t", "n, k, x = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\n\r\ndef destroy(v):\r\n if (len(v) < 3):\r\n return 0\r\n d = 0\r\n while True:\r\n changed = False\r\n for i in range(len(v)-2):\r\n if v[i] == v[i+1] == v[i+2]:\r\n d += 3\r\n if (i+3 < len(v) and v[i+3] == v[i]):\r\n d += 1\r\n del v[i:i+4]\r\n else:\r\n del v[i:i+3]\r\n changed = True\r\n break\r\n if not changed:\r\n break\r\n return d\r\n \r\n\r\ndef solve():\r\n sol = 0\r\n for i in range(len(r) + 1):\r\n r2 = r[:i] + [x] + r[i:]\r\n sol = max(sol, destroy(r2)-1)\r\n return sol\r\n\r\nprint(solve())\r\n\r\n", "def search():\r\n a = b[:]\r\n t = 0\r\n flag = True\r\n while flag:\r\n tmp = len(a)\r\n count = 0\r\n i = 0\r\n while i < len(a) - 1:\r\n if a[i] == a[i + 1]:\r\n count += 1\r\n else:\r\n if count > 1:\r\n t += count + 1\r\n i -= count\r\n while count >= 0:\r\n a.pop(i)\r\n count -= 1\r\n i -= 1\r\n count = 0\r\n i += 1\r\n if count >= 2:\r\n t += count + 1\r\n i -= count\r\n while count >= 0:\r\n a.pop(i)\r\n count -= 1\r\n if tmp == len(a):\r\n flag = False\r\n return t\r\n\r\n\r\n\r\nn, k, x = map(int, input().split())\r\nb = list(map(int, input().split()))\r\nj = 0\r\nmaxi = 0\r\nwhile j < len(b):\r\n if b[j] == x:\r\n while b[j] == x:\r\n j += 1\r\n if j >= len(b):\r\n break\r\n b.insert(j - 1, x)\r\n res = search() - 1\r\n if res > maxi:\r\n maxi = res\r\n b.pop(j - 1)\r\n j += 1\r\nprint(maxi)\r\n", "def count(balls):\r\n stop = False\r\n ans = len(balls)\r\n m = len(balls)\r\n while(not stop and m > 0):\r\n elms2remove = set()\r\n i = 2\r\n stop = True\r\n m = len(balls)\r\n while i < len(balls):\r\n if balls[i] == balls[i - 1] == balls[i - 2]:\r\n elms2remove |= {i, i - 1, i - 2}\r\n stop = False\r\n while i + 1 < m and balls[i + 1] == balls[i]:\r\n elms2remove.add(i + 1)\r\n i += 1\r\n\r\n balls = [b for i, b in enumerate(balls) if i not in elms2remove]\r\n break\r\n\r\n i += 1\r\n\r\n return ans - len(balls) - 1\r\n\r\n\r\ndef main():\r\n n, _k, x = map(int, input().split())\r\n balls = [int(c) for c in input().split()]\r\n\r\n ans = 0\r\n i = 0\r\n while i < n - 1:\r\n if balls[i] == x and balls[i + 1] == x:\r\n conf = balls[:i]\r\n conf.append(x)\r\n conf += balls[i:]\r\n ans = max(ans, count(conf))\r\n while i < n - 1 and balls[i] == x:\r\n i += 1\r\n\r\n i += 1\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def do(l,r):\n li = 0\n ri = 0\n nl = len(l)\n nr = len(r)\n l.append(-1)\n r.append(-1)\n x = 0\n while l[li] > 0 and r[ri]>0:\n a = 0\n c = l[li]\n while l[li] == c:\n a += 1\n li += 1\n while r[ri] == c:\n a += 1\n ri += 1\n if a < 3:\n return li+ri-a-x\n x = 1\n return li+ri-x\ndef s():\n [n,k,x] = list(map(int,input().split()))\n c = list(map(int,input().split()))\n res = 0\n for i in range(n):\n l = [x]\n l.extend(list(reversed(c[:i])))\n res = max(do(l,c[i:]),res)\n print(res)\ns()\n", "n, k, x = map(int, input().split())\ncolors = list(map(int, input().split()))\n\ngroups = []\n\ni = 0\nwhile i < n:\n\tc = colors[i]\n\tnbC = 0\n\twhile i < n and colors[i] == c:\n\t\ti += 1\n\t\tnbC += 1\n\tgroups.append((c, nbC))\n\nmaxNbBallsDestroyed = 0\nfor i, group in enumerate(groups):\n\tif group[0] == x and group[1] >= 2:\n\t\tnbBallsDestroyed = group[1]\n\t\tpast = i-1\n\t\tfuture = i+1\n\t\twhile past >= 0 and future < len(groups) and groups[past][0] == groups[future][0] and groups[past][1] + groups[future][1] >= 3:\n\t\t\tnbBallsDestroyed += groups[past][1] + groups[future][1]\n\t\t\tpast -= 1\n\t\t\tfuture += 1\n\t\tmaxNbBallsDestroyed = max(maxNbBallsDestroyed, nbBallsDestroyed)\n\nprint(maxNbBallsDestroyed)", "import sys\nlines = sys.stdin.readlines()\n(n, k, x) = map(int, lines[0].strip().split(\" \"))\nnums = list(map(int, lines[1].strip().split(\" \")))\n\nmaxD = 0\ncount = []\nfor n in nums:\n if not count: count.append((n, 1)); continue\n if n == count[-1][0]: count[-1] = (count[-1][0],1 + count[-1][1])\n else: count.append((n, 1))\n\nfor i in range(len(count)):\n c = count[i]\n if c[0] == x and c[1] >= 2:\n stack = count[:i]\n destory = count[i][1]\n for j in range(i+1, len(count)):\n if not stack: break\n if count[j][0] == stack[-1][0] and count[j][1] + stack[-1][1] >= 3:\n destory += count[j][1] + stack[-1][1]\n stack.pop()\n else: break\n maxD = max(maxD, destory)\nprint(maxD)\n", "(n, k, x) = map(int, input().split())\r\n\r\nballs = list(map(int, input().split()))\r\n\r\ni = 0\r\nans = 0\r\nfor i in range(len(balls)):\r\n if(balls[i] is x):\r\n l = r = i\r\n cnt = 0\r\n while (balls[l] == balls[r]):\r\n tmp = 2\r\n while (l > 0 and balls[l - 1] == balls[l]):\r\n l-=1\r\n tmp+=1\r\n while (r < (n - 1) and balls[r + 1] == balls[r]):\r\n r+=1\r\n tmp+=1\r\n\r\n l-=1\r\n r+=1\r\n if (tmp < 3):\r\n break\r\n cnt += tmp\r\n if (l < 0 or r >= n):\r\n break\r\n if (cnt - 1 > ans):\r\n ans = cnt-1\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k, x = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nif n == 1:\r\n print(0)\r\n exit(0)\r\n\r\nq = 0\r\nfor i in range(1, n):\r\n s = [-2] + w[:i] + [x] + w[i:] + [-1]\r\n l = r = i\r\n c = 0\r\n while 1:\r\n d = s[l]\r\n while s[l] == d:\r\n l -= 1\r\n while s[r] == d:\r\n r += 1\r\n\r\n if r-l-c-1 > 2:\r\n c = r-l-1\r\n else:\r\n break\r\n q = max(q, c-1)\r\nprint(q)", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split())) + [k + 1]\r\n\r\nfactor = []\r\ninsert_pos = []\r\ncontinuos_ball = 1\r\n\r\nfor i in range(1, n + 1):\r\n if a[i] == a[i - 1]:\r\n continuos_ball += 1\r\n else:\r\n if a[i - 1] == x and continuos_ball >= 2:\r\n insert_pos.append(len(factor))\r\n\r\n factor.append((a[i - 1], continuos_ball))\r\n continuos_ball = 1\r\n\r\nmax_destroy = 0\r\nfor pos in insert_pos:\r\n n_destroy = factor[pos][1]\r\n i, j = pos - 1, pos + 1\r\n\r\n while i >= 0 and j < len(factor):\r\n if factor[i][0] != factor[j][0] or factor[i][1] + factor[j][1] < 3:\r\n break\r\n \r\n n_destroy += factor[i][1] + factor[j][1]\r\n i -= 1\r\n j += 1\r\n \r\n max_destroy = max(max_destroy, n_destroy)\r\n\r\nprint(max_destroy)", "\r\n(n, k, x) = input().split()\r\nn, k = int(n), int(k)\r\nballs = input().split()\r\nans = 0\r\n\r\nfor i in range(n):\r\n s = balls.copy()\r\n s.insert(i, x)\r\n while len(s) > 2:\r\n l = len(s)\r\n for j in range(2, len(s)):\r\n if s[j-2] == s[j-1] == s[j]:\r\n p = j + 1\r\n while p < len(s):\r\n if s[j] != s[p]:\r\n break\r\n p += 1\r\n s = s[:j-2] + s[p:]\r\n break\r\n if len(s) == l:\r\n break\r\n ans = max(ans, n - len(s))\r\n\r\nprint(ans)", "n,k,x=map(int,input().split())\r\nq=list(map(int,input().split()))\r\nw=0\r\nfor i in range(n):\r\n if q[i]!=x: continue\r\n l,r=i,i\r\n v=0\r\n while q[l]==q[r]:\r\n c=2\r\n while l>0 and q[l]==q[l-1]:\r\n c+=1\r\n l-=1\r\n while r<n-1 and q[r]==q[r+1]:\r\n c+=1\r\n r+=1\r\n if c<3:\r\n break\r\n l-=1\r\n r+=1\r\n v+=c\r\n if l<0 or r>=n:\r\n break\r\n w=max(w,v-1)\r\nprint(w)", "def check(a, p, x):\r\n a.insert(p, x)\r\n a = a + [101]\r\n found = True\r\n ans = 0\r\n while found:\r\n found = False\r\n cnt = 1\r\n l = 0\r\n r = 1\r\n # print(a)\r\n for i in range(1, len(a)):\r\n if a[l] == a[i]:\r\n cnt += 1\r\n r = i + 1\r\n else:\r\n if cnt > 2:\r\n found = True\r\n a = a[:l] + a[r:]\r\n ans += r - l\r\n break\r\n else:\r\n cnt = 1\r\n l = i\r\n r = i + 1\r\n\r\n return ans - 1\r\n\r\ndef main():\r\n n, k, x = map(int, input().split())\r\n c = list(map(int, input().split()))\r\n\r\n ans = 0\r\n for i in range(n - 1):\r\n a = c[:]\r\n ans = max(ans, check(a, i, x))\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import copy\r\n\r\nn, k, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nfor i in range(n):\r\n c[i] = (c[i],0)\r\nans = 0\r\nfor i in range(n + 1):\r\n c2 = copy.deepcopy(c)\r\n c2.insert(i, (x,1))\r\n while True:\r\n dq = False\r\n for i in range(len(c2) - 2):\r\n if c2[i][0] == c2[i + 1][0] == c2[i + 2][0]:\r\n le = i\r\n re = i\r\n while re < len(c2) and c2[re][0] == c2[le][0]:\r\n re += 1\r\n c2 = c2[:le] + c2[re:]\r\n dq = True\r\n break\r\n if not dq:\r\n break\r\n cntdel = 0\r\n for a,b in c2:\r\n if b==0:\r\n cntdel+=1\r\n ans = max(ans, n - cntdel)\r\nprint(ans)", "n, k, x = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\n\r\nres = 0\r\nfor i in range(n): \r\n\tcnt = 0\r\n\tif a[i] == x:\r\n\t\tcurcol = x \r\n\t\tl = i\r\n\t\tr = i + 1\r\n\t\twhile l >= 0 and a[l] == curcol:\r\n\t\t\tl -= 1\r\n\t\t\tcnt += 1\r\n\t\twhile r < n and a[r] == curcol:\r\n\t\t\tr += 1\r\n\t\t\tcnt += 1\r\n\t\tif cnt >= 2:\r\n\t\t\twhile True:\r\n\t\t\t\tcount = 0\r\n\t\t\t\tif l >= 0:\r\n\t\t\t\t\tcurcol = a[l]\r\n\t\t\t\tif r < n:\r\n\t\t\t\t\tcurcol = a[r]\r\n\t\t\t\twhile l >= 0 and a[l] == curcol:\r\n\t\t\t\t\tcount += 1\r\n\t\t\t\t\tl -= 1\r\n\t\t\t\twhile r < n and a[r] == curcol:\r\n\t\t\t\t\tcount += 1\r\n\t\t\t\t\tr += 1\r\n\t\t\t\tif count > 2:\r\n\t\t\t\t\tcnt += count\r\n\t\t\t\telse:\r\n\t\t\t\t\tbreak\r\n\t\t\tif res < cnt:\r\n\t\t\t\tres = cnt\r\nprint(res)", "from itertools import groupby\n\ndef destroy(chain):\n\tremaining = []\n\tfor k, v in groupby(chain):\n\t\tL = list(v)\n\t\tif len(L) < 3:\n\t\t\tremaining.extend(L)\n\tif len(chain) == len(remaining):\n\t\treturn len(remaining)\n\telse:\n\t\treturn destroy(remaining)\n\ndef solve():\n\tn, k, x = map(int, input().split())\n\tballs = list(map(int, input().split()))\n\tres = 0\n\tfor i in range(n):\n\t\ttmp = balls[:]\n\t\ttmp.insert(i, x)\n\t\tres = max(res, n-destroy(tmp))\n\treturn res\n\nif __name__ == '__main__':\n\tprint(solve())\n", "numero_bolas, limite_cores, bola_inserida = input().split()\nnumero_bolas = int(numero_bolas)\nlimite_cores = int(limite_cores)\n\nlista_bolas = input().split()\n\nresposta = 0\n\nfor i in range(numero_bolas):\n lista_bolas_copia = lista_bolas.copy()\n lista_bolas_copia.insert(i, bola_inserida)\n while len(lista_bolas_copia) > 2:\n tamanho_anterior = len(lista_bolas_copia)\n for j in range(2, len(lista_bolas_copia)):\n if lista_bolas_copia[j-2] == lista_bolas_copia[j-1] == lista_bolas_copia[j]:\n posicao_proxima_cor = j + 1\n while posicao_proxima_cor < len(lista_bolas_copia):\n if lista_bolas_copia[j] != lista_bolas_copia[posicao_proxima_cor]:\n break\n posicao_proxima_cor += 1\n lista_bolas_copia = lista_bolas_copia[:j-2] + lista_bolas_copia[posicao_proxima_cor:]\n break\n if len(lista_bolas_copia) == tamanho_anterior:\n break\n resposta = max(resposta, numero_bolas - len(lista_bolas_copia))\n\nprint(resposta)\n \t\t \t \t \t \t\t\t\t \t\t\t", "import fileinput\n\ndef rec(n, b, p):\n\tz, c = 0, b[p]\n\tfor i in range(p, n):\n\t\tif b[i] == -1: continue\n\t\tif b[i] != c: break\n\t\tb[i] = -1\n\t\tz += 1\n\n\tp, c, o = -1, -1, 0\n\tfor i in range(n):\n\t\tif b[i] == -1: continue\n\t\tif b[i] == c:\n\t\t\to += 1\n\t\t\tif o > 2: break\n\t\telse:\n\t\t\tp, c, o = i, b[i], 1\n\n\treturn z + (rec(n, b, p) if o > 2 else 0)\n\ndef solve(n, k, x, b):\n\tm = 0\n\tfor p in range(n-1):\n\t\tif b[p] == x and b[p+1] == x:\n\t\t\tm = max(m, rec(n+1, b[:p+1] + [x] + b[p+1:], p)-1)\n\t\t\tif m == n: break\n\treturn m\n\nf = fileinput.input()\nn, k, x = tuple(map(int, f.readline().rstrip().split()))\nb = list(map(int, f.readline().rstrip().split()))\nprint(solve(n, k, x, b))", "import collections\nimport heapq\nimport sys\nimport math\nimport itertools\nimport bisect\nfrom io import BytesIO, IOBase\nimport os\n######################################################################################\n#--------------------------------------Input-----------------------------------------#\n######################################################################################\n \ndef value(): return tuple(map(int, input().split()))\ndef values(): return tuple(map(int, sys.stdin.readline().split()))\ndef inlst(): return [int(i) for i in input().split()]\ndef inlsts(): return [int(i) for i in sys.stdin.readline().split()]\ndef inp(): return int(input())\ndef inps(): return int(sys.stdin.readline())\ndef instr(): return input()\ndef stlst(): return [i for i in input().split()]\n \n \n# ######################################################################################\n# #--------------------------------------code here-------------------------------------#\n# ######################################################################################\n# def cnt(l,x,i):\n# tot=0\n# while i<len(l)-1:\n# if l[i]==x:tot+=1\n# else:return tot\n# i+=1\n# def finish(l,i):\n\n# def get(l,x,i):\n# tem=l.cnt(l,x,i)\n# if tem+1>2:\n# l=l[:i]+l[tem+i:]\n# finih(l,i)\n\n \ndef solve():\n n,k,x=values()\n l=inlsts()\n mx=0\n ele=[]\n elecount=[]\n c=itertools.groupby(l)\n for i ,j in c:\n ele.append(i)\n elecount.append(len(list(j)))\n for i in range(len(ele)):\n if ele[i]==x and elecount[i]==2:\n l,r=i-1,i+1\n temp=2\n while l>=0 and r<=len(ele)-1:\n if ele[l]==ele[r]:\n s=elecount[r]+elecount[l]\n if s>2:\n temp+=s\n l-=1;r+=1\n else:break\n else:break\n mx=max(mx,temp)\n \n\n print (mx)\n\n \nsolve()\n# n,k,x=values()\n# c=inlst()\n# ele=[]\n# elecounters=[]\n# gg=itertools.groupby(c)\n# for key, count in gg:\n# ele.append(key)\n# elecounters.append(len(list(count)))\n# ans=0\n# for i in range(len(ele)):\n# if ele[i]==x and elecounters[i]==2:\n# backward=i-1\n# forward=i+1 \n# temp= 2\n# while backward>=0 and forward <= len(ele)-1:\n# bla=elecounters[backward]+elecounters[forward]\n# if ele[backward]==ele[forward] and bla >=3:\n# temp+=bla\n# backward-=1\n# forward+=1\n# else:\n# break\n# ans=max(ans, temp)\n# #print(temp, i)\n \n# print(ans) #final answer\n", "def getBolasDestruidas(pos, valores):\n\n aux = [valor for valor in valores]\n\n lenInicial = len(valores)\n\n aux.pop(pos)\n aux.pop(pos)\n\n while(True):\n toPop = []\n for i in range(len(aux)-2):\n if(len(toPop) != 0):\n break\n if(aux[i] == aux[i+1] and aux[i+1] == aux[i+2]):\n toPop.append(i)\n toPop.append(i+1)\n toPop.append(i+2)\n j = i+3\n if(j >= len(aux)):\n break\n while(aux[j] == aux[i]):\n toPop.append(j)\n j += 1\n if(j >= len(aux)):\n break\n\n if(len(toPop) != 0):\n toPop.sort(reverse=True)\n for i in toPop:\n aux.pop(i)\n else:\n break\n\n return lenInicial - len(aux)\n\ndef getIndexs(bolaX, valores):\n\n i = 0\n ret = []\n\n while(True):\n\n while(valores[i] != bolaX):\n i += 1\n if(i == len(valores)):\n return ret\n\n if(i+1 >= len(valores)):\n return ret\n\n if(valores[i+1] == bolaX):\n ret.append(i)\n else:\n if(i+1 == len(valores)):\n return ret\n\n if(valores[i+1] == bolaX):\n i += 1\n\n if(i >= len(valores)):\n return ret\n\n while(valores[i] == bolaX):\n i += 1\n if(i >= len(valores)):\n return ret\n\n return ret\n\n\nentrada = input().split()\nvalores = input().split()\n\nbolaX = int(entrada[2])\nvalores = [int(valor) for valor in valores]\n\nlista = getIndexs(bolaX, valores)\nres = []\n\nfor i in lista:\n res.append(getBolasDestruidas(i, valores))\n\nif(len(res) == 0):\n print(0)\nelse:\n print(max(res))", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nz,n,c = None, None, None\r\n\r\ndef DOIT(l, r):\r\n\t#if z[l][r]:\r\n\t#\treturn z[l][r]\r\n\tif l > 0 and r < n:\r\n\t\tll = l-1\r\n\t\trr = r\r\n\t\tx = c[ll]\r\n\t\tif x == c[rr]:\r\n\t\t\twhile ll > 0 and x == c[ll - 1]:\r\n\t\t\t\tll -= 1\r\n\t\t\twhile rr + 1 < n and x == c[rr + 1]:\r\n\t\t\t\trr += 1\r\n\t\t\tif (l-ll)+(rr-r+1) > 2:\r\n\t\t\t\t#print(ll,l,r,rr)\r\n\t\t\t\t#z[l][r] = (l-ll)+(rr-r+1)+DOIT(ll,rr+1)\r\n\t\t\t\t#return z[l][r]\r\n\t\t\t\treturn (l-ll)+(rr-r+1)+DOIT(ll,rr+1)\r\n\t#z[l][r] = 0\r\n\treturn 0\r\n\r\n\r\nn,k,x = mints()\r\nz = [[None]*(n+1) for i in range(n+1)]\r\nc = list(mints())\r\nr = 0\r\ni = 0\r\nwhile i < n:\r\n\tj = i + 1\r\n\twhile j < n and c[j] == c[i]:\r\n\t\tj += 1\r\n\tif x == c[i] and j - i > 1:\r\n\t\tr = max(r, DOIT(i, j) + j - i)\r\n\ti = j\r\nprint(r)", "n, k, x = list(map(int, input().split()))\r\nr = list(map(int, input().split()))\r\n\r\ndef destroy(v):\r\n if (len(v) < 3):\r\n return 0\r\n d = 0\r\n for i in range(len(v)-2):\r\n if v[i] == v[i+1] == v[i+2]:\r\n d += 3\r\n if (i+3 < len(v) and v[i+3] == v[i]):\r\n d += 1\r\n del v[i:i+4]\r\n else:\r\n del v[i:i+3]\r\n d += destroy(v)\r\n break\r\n return d\r\n \r\n\r\ndef solve():\r\n sol = 0\r\n for i in range(len(r) + 1):\r\n r2 = list(r);\r\n r2.insert(i, x)\r\n sol = max(sol, destroy(r2)-1)\r\n return sol\r\n\r\nprint(solve())", "n, k, x = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(n):\r\n t = arr.copy()\r\n t.insert(i, x)\r\n while len(t) > 2:\r\n curr_size = len(t)\r\n for j in range(2, len(t)):\r\n if not (t[j-2] == t[j-1] == t[j]): continue\r\n p = j + 1\r\n while p < len(t) and t[j] == t[p]:\r\n p += 1\r\n t = t[:j-2] + t[p:]\r\n break\r\n if len(t) == curr_size:\r\n break\r\n res = max(res, n - len(t))\r\nprint(res)\r\n", "def balls_game(balls,x):\r\n counts=[]\r\n for b in range(len(balls)):\r\n copy=balls.copy()\r\n copy.insert(b,x)\r\n this_count=0\r\n while True: \r\n i = 0\r\n j = 0\r\n while i < len(copy):\r\n j = i\r\n while j < len(copy) and copy[i] == copy[j]:\r\n j += 1\r\n if j - i > 2:\r\n break\r\n i = j\r\n if i == len(copy): # khong tim duoc doan nao\r\n break\r\n del copy[i:j]\r\n this_count+=(j-i)\r\n counts.append(this_count)\r\n return max(max(counts)-1,0) \r\n\r\nn,k,x=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nprint (balls_game(b,x))", "n, k, x = map(int, input().split())\nballs = list(map(int, input().split()))\n\n\nans = 0\nfor i in range(n - 1):\n if balls[i] == x and balls[i + 1] == x:\n curr = 2\n temp = balls[:i] + balls[i + 2:]\n while True:\n j = 0\n found = False\n while j < len(temp) - 1:\n k = j + 1\n while k < len(temp) and temp[k] == temp[j]:\n k += 1\n if k - j >= 3:\n curr += k - j\n temp = temp[:j] + temp[k:]\n found = True\n break\n j += 1\n if not found:\n break\n ans = max(ans, curr)\nprint(ans)\n", "n, k, x = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n if a[i] == x:\r\n l = r = i\r\n cnt = 0\r\n\r\n while a[l] == a[r]:\r\n balls = 2\r\n\r\n while l > 0 and a[l - 1] == a[l]:\r\n l -= 1\r\n balls += 1\r\n while r < n - 1 and a[r + 1] == a[r]:\r\n r += 1\r\n balls += 1\r\n \r\n if balls < 3:\r\n break\r\n \r\n cnt += balls\r\n l -= 1\r\n r += 1\r\n\r\n if l < 0 or r >= n:\r\n break\r\n \r\n ans = max(ans, cnt - 1)\r\n\r\nprint(ans)\r\n", "def anda_pros_lados(lista_andar, ind):\n\n R = L = ind\n\n Lstop = Rstop = False\n while True:\n L -=1\n if L < 0 or lista_andar[L] != lista_andar[L+1]:\n L += 1\n Lstop = True\n R += 1\n if R >= len(lista_andar) or lista_andar[R] != lista_andar[R-1]:\n R -= 1\n Rstop = True\n if Lstop and Rstop: break\n\n return L, R\n\ndef remove_bolas(lista_remover, L, R, first):\n lista_cp = [n for n in lista_remover]\n explodiu = False\n bolas = R - L + 1\n if bolas == 2 and first:\n first = False\n explodiu = True\n del(lista_cp[L:R+1])\n\n elif not first and bolas >= 3:\n explodiu = True\n del(lista_cp[L:R+1])\n\n if L > 0 and explodiu:\n L -= 1\n R = L\n\n return lista_cp, L, R, explodiu, first\n\ndef explode(lista, ind, first):\n explodiu = True\n lista_cp = [n for n in lista]\n\n while explodiu and len(lista_cp) > 0:\n #andando pra frente e pra trás até poder\n\n if explodiu and first == False:\n ind = L\n\n L, R = anda_pros_lados(lista_cp, ind)\n #BOOOOM!!\n lista_cp, L, R, explodiu, first = remove_bolas(lista_cp, L, R, first)\n\n return len(lista) - len(lista_cp)\n\ndata = input().split()\nn_balls = int(data[0])\nk_colors = int(data[1])\nx = int(data[2])\n\nrow = input().split()\nrow = [int(row[i]) for i in range(n_balls)]\n\nmaior = 0\nif n_balls >=2:\n for j in range(0, n_balls):\n if row[j] == x:\n num = explode(row, j, True)\n if num > maior:\n maior = num\nprint(maior)\n\t \t \t\t\t\t \t \t \t\t \t\t", "(balls, k, new_ball) = input().split()\nballs, k = int(balls), int(k)\nsequencia_bolas = input().split()\nmaior_pontuacao = 0\n \nfor i in range(balls):\n aux_balls = sequencia_bolas.copy()\n aux_balls.insert(i, new_ball)\n while len(aux_balls) > 2:\n tamanho_sequencia = len(aux_balls)\n for j in range(2, len(aux_balls)):\n if aux_balls[j-2] == aux_balls[j-1] == aux_balls[j]:\n posicao_final = j + 1\n while posicao_final < len(aux_balls):\n if aux_balls[j] != aux_balls[posicao_final]:\n break\n posicao_final += 1\n aux_balls = aux_balls[:j-2] + aux_balls[posicao_final:]\n break\n if len(aux_balls) == tamanho_sequencia:\n break\n maior_pontuacao = max(maior_pontuacao, balls - len(aux_balls))\n \nprint(maior_pontuacao)\n \t \t \t\t \t\t \t \t \t \t\t \t\t \t\t\t", "n, k, x = map(int, input().split())\nA = [int(x) for x in input().split()]\nms = []\n\nfor i in range(n):\n if A[i] == x:\n l = i\n j = i\n while j < n and A[j] == x:\n j += 1\n if j-l >= 2:\n ms.append((l, j-1))\n\nans = 0\nfor l, r in ms:\n # print(l, r)\n tt = r-l+1\n l -= 1\n r += 1\n while 1:\n lc, rc = 0, 0\n lv = rv = -1\n if l >= 0:\n lv = A[l]\n while l >= 0 and A[l] == lv:\n lc += 1\n l -= 1\n if r < n:\n rv = A[r]\n while r < n and A[r] == rv:\n rc += 1\n r += 1\n if lv == rv and lv != -1:\n if lc + rc >= 3:\n tt += lc+rc\n else:\n break\n else:\n break\n ans = max(ans, tt)\nprint(ans)\n\n", "n,k,x=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ndef solve(a):\r\n prev=0\r\n # print(a)\r\n while prev!=len(a):\r\n prev=len(a)\r\n # print(a)\r\n for i in range(len(a)):\r\n j=i\r\n while j+1<len(a) and a[i]==a[j+1]:\r\n j+=1\r\n if j-i>=2:\r\n a=a[:i]+a[j+1:]\r\n break\r\n \r\n return a\r\nans=0\r\nfor i in range(n+1):\r\n p=len(solve(arr[:i]+[x]+arr[i:]))\r\n ans=max(ans,n-p)\r\nprint(ans)\r\n\r\n ", "\r\n\r\ndef raise_hell(arr, n):\r\n st = []\r\n arr.append(arr[-1]+1)\r\n m = len(arr)\r\n for i in range(m):\r\n if len(st)>2 and arr[i]!=st[-1]:\r\n if st[-1]==st[-2]==st[-3]:\r\n p = st[-1]\r\n while st and st[-1] == p:\r\n st.pop()\r\n st.append(arr[i])\r\n else:\r\n st.append(arr[i])\r\n st.pop()\r\n return max(n-len(st),0)\r\nn,k,x = map(int, input().split())\r\narr=list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if arr[i]==x:\r\n brr=arr.copy()\r\n brr.insert(i,x)\r\n r = raise_hell(brr,n)\r\n ans = max(ans, r)\r\n \r\nprint(ans)", "n, k, y = map(int, input().split())\nc = list(map(int, input().split()))\nli = [[c[0]]]\nfor i in range(1, n):\n if c[i] == c[i - 1]:\n li[-1].append(c[i])\n else:\n li.append([c[i]])\nmaxm = 0\nfor x in li:\n if len(x) >= 3:\n maxm += len(x)\n li.remove(x)\nm = len(li)\n# print(li)\nfor i in range(m):\n # print(type(li[i][0]),type(x), len(li[i]))\n if (li[i][0] == y) and (len(li[i]) >= 2):\n # print(\"Yes\")\n t = len(li[i])\n j = 1\n # print(t)\n while True:\n if i - j >= 0 and i + j < m and li[i - j][0] == li[i + j][0] and len(li[i - j]) + len(li[i + j]) >= 3:\n t += len(li[i - j]) + len(li[i + j])\n j += 1\n else:\n break\n # print(t)\n # print(t, li[i])\n maxm = max(t, maxm)\nprint(maxm)", "n, k, x = [int(_) for _ in input().split()]\nc = [int(_) for _ in input().split()]\n\n\ndef solve(s):\n while True:\n found = False\n for i in range(len(s) - 1):\n k = i + 1\n while k < len(s) and s[k] == s[i]:\n k += 1\n if k - i >= 3:\n found = True\n s = s[:i] + s[k:]\n break\n if not found:\n break\n return s\n\nbest = 0\nfor i in range(len(c)-1):\n if c[i] == x and c[i+1] == x:\n d = c[:i] + c[i+2:]\n s = solve(d)\n best = max(best, n - len(s))\nprint(best)\n\n\t\t \t \t \t \t \t\t \t \t \t\t \t", "n, k, x = map(int, input().split())\r\nballs = list(map(int, input().split()))\r\n\r\nanswer = 0\r\n\r\nfor i in range(n):\r\n copy = balls[:]\r\n copy.insert(i, x)\r\n \r\n while (len(copy) > 2):\r\n size = len(copy)\r\n for j in range(2, len(copy)):\r\n \r\n if (copy[j-2] == copy[j-1]) and (copy[j-1] == copy[j]):\r\n cut = j + 1\r\n while cut < len(copy):\r\n if (copy[j] != copy[cut]):\r\n break\r\n cut += 1\r\n copy = (copy[:j-2] + copy[cut:])\r\n break\r\n \r\n if len(copy) == size:\r\n break\r\n \r\n answer = max(answer, n - len(copy)) \r\n \r\nprint(answer)", "def busted_balls(balls,idx):\n #print(idx)\n busted=2\n i=idx-1\n j=idx+2\n while(i>=0 and j < len(balls) and balls[i] == balls[j]):\n while(i-1 >= 0 and balls[i] == balls[i-1]):\n i-=1\n while j+1 < len(balls) and balls[j] == balls[j+1]:\n j+=1\n #print('i'+str(i))\n #print('j'+str(j))\n if j-i+1-busted>=3:\n busted=(j-i+1)\n else:\n break\n #print(busted)\n i-=1\n j+=1\n #print('i'+str(i))\n #print('j'+str(j))\n return busted\n\nn,k,x=list(map(int,input().split()))\nballs=list(map(int,input().split()))\nbest=0\nfor i in range(1,n):\n if balls[i]==balls[i-1] and balls[i]==x:\n #copy_balls=balls[:]\n #copy_balls.insert(i)\n res = busted_balls(balls,i-1)\n if(res>best):\n best=res\nprint(best)\n\n\n", "numero_bolas, limite_cores, bola_inserida = input().split()\r\nnumero_bolas = int(numero_bolas)\r\nlimite_cores = int(limite_cores)\r\n\r\n# lendo as bolas e atribuindo à lista lista_bolas\r\nlista_bolas = input().split()\r\n\r\n# inicializando a variável resposta\r\nresposta = 0\r\n\r\n# iterando sobre as posições possíveis para inserir a bola bola_inserida\r\nfor i in range(numero_bolas):\r\n # criando uma cópia da lista lista_bolas\r\n lista_bolas_copia = lista_bolas.copy()\r\n # inserindo a bola bola_inserida na posição i\r\n lista_bolas_copia.insert(i, bola_inserida)\r\n # removendo sequências de 3 bolas consecutivas da lista lista_bolas_copia\r\n while len(lista_bolas_copia) > 2:\r\n tamanho_anterior = len(lista_bolas_copia)\r\n for j in range(2, len(lista_bolas_copia)):\r\n if lista_bolas_copia[j-2] == lista_bolas_copia[j-1] == lista_bolas_copia[j]:\r\n posicao_proxima_cor = j + 1\r\n while posicao_proxima_cor < len(lista_bolas_copia):\r\n if lista_bolas_copia[j] != lista_bolas_copia[posicao_proxima_cor]:\r\n break\r\n posicao_proxima_cor += 1\r\n lista_bolas_copia = lista_bolas_copia[:j-2] + lista_bolas_copia[posicao_proxima_cor:]\r\n break\r\n if len(lista_bolas_copia) == tamanho_anterior:\r\n break\r\n # atualizando a resposta com o tamanho máximo da lista lista_bolas_copia\r\n resposta = max(resposta, numero_bolas - len(lista_bolas_copia))\r\n\r\n# imprimindo a resposta\r\nprint(resposta)", "n, k, x = input().split()\r\nt = input().split() + ['a', 'b']\r\nu, q = -2, 1\r\nfor v in range(int(n) + 1):\r\n if x == t[v]:\r\n if u == -2: u = v - 1\r\n elif u != -2:\r\n s, i, j, y = 0, u, v, t[v]\r\n while j - i - s > 2:\r\n s = j - i\r\n while t[i] == y: i -= 1\r\n while t[j] == y: j += 1\r\n y = t[j]\r\n u, q = -2, max(q, s)\r\nprint(q - 1)", "n, k, x = list(map(int, input().split()))\nl = list(map(int, input().split()))\n\nintervals = []\nsums = [0]\n\n\ndef countballs(array):\n j = 0\n count = 0\n h = 0\n if(array == []): return 0\n while(h < len(array)):\n if(array[h] == array[j]):\n count += 1\n h += 1\n else:\n if(count > 2):\n return count + countballs(array[:j] + array[h:])\n\n j = h\n count = 0\n if(count < 3): return 0\n else:\n return count + countballs(array[:j] + array[h-1:])\n\n\ni = 0\n\nwhile(i < n - 1):\n if(l[i] == l[i + 1]):\n if(l[i] == x):\n intervals.append([i,i+1])\n i += 2\n else:\n i += 1\n\nfor inte in intervals:\n sums.append(countballs(l[:inte[0]] + [x] + l[inte[0]:]))\n\nif(max(sums) > 0):\n print(max(sums) - 1)\nelse: print(0)\n \n ", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Balls Game\"\r\n# Class: B\r\n\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n, k, x = list(map(int, input().split()))\r\n x = str(x)\r\n a = input().split()\r\n list_ = [[a[0], 1]]\r\n for i in range(1, n):\r\n if a[i] == list_[-1][0]:\r\n list_[-1][1]+=1\r\n else:\r\n list_.append([a[i], 1])\r\n \r\n ans = 0\r\n mids = set()\r\n for r in range(len(list_)):\r\n if list_[r][0] == x and list_[r][1] == 2:\r\n mid = r\r\n mids.add(mid)\r\n\r\n\r\n for mididx in mids:\r\n v = 0\r\n mid = list_[mididx]\r\n v+=mid[1]\r\n for i in range(1, min(len(list_)-mididx-1, mididx)+1):\r\n if list_[mididx-i][0] == list_[mididx+i][0] and list_[mididx-i][1] + list_[mididx+i][1] >= 3:\r\n v+=list_[mididx-i][1] + list_[mididx+i][1]\r\n else:\r\n break\r\n ans = max(ans, v)\r\n \r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "n, k, x = [int(x) for x in input().split(' ')]\n \nballs = [int(x) for x in input().split(' ')]\n \ndef balls_game(n, k, x, balls):\n destroyed = 0\n for c in range(n):\n b = balls.copy()\n b.insert(c, x)\n \n while len(b) > 2:\n l = len(b)\n\n for i in range(2, len(b)):\n if b[i-2] == b[i-1] == b[i]:\n p = i + 1\n while p < len(b):\n if b[i] != b[p]:\n break\n p += 1\n b = b[:i-2] + b[p:]\n break\n\n if len(b) == l:\n break\n destroyed = max(destroyed, n - len(b))\n\n print(destroyed)\n\n \n \nballs_game(n, k, x, balls)\n\t\t\t \t\t \t \t \t\t \t \t\t \t \t", "R = lambda: list(map(int, input().split()))\r\n\r\n\r\ndef dfs(a):\r\n cnt = 0\r\n n = len(a)\r\n a.append(10000000)\r\n for i in range(1, n):\r\n if a[i] != a[i - 1]:\r\n cnt = 0\r\n else:\r\n cnt += 1\r\n if cnt >= 2:\r\n j = i\r\n while a[j] == a[i]:\r\n j += 1\r\n\r\n return j - i + 2 + dfs(a[:i - 2] + a[j:n])\r\n return 0\r\n\r\n\r\nn, k, x = R()\r\na = R()\r\nans=1\r\nfor i in range(n+1):\r\n ans=max(ans, dfs(a[:i]+[x]+a[i:]))\r\n\r\nprint(ans-1)", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom collections import Counter, defaultdict\r\nfrom sys import stdin, stdout\r\nimport io\r\nimport math\r\nimport heapq\r\nimport bisect\r\nimport collections\r\ndef ceil(a, b):\r\n return (a + b - 1) // b\r\ninf = float('inf')\r\ndef get():\r\n return stdin.readline().rstrip()\r\nmod = 10 ** 5 + 7\r\n# for _ in range(int(get())):\r\n# n=int(get())\r\n# l=list(map(int,get().split()))\r\n# = map(int,get().split())\r\n#############################################################\r\nn,k,y = map(int,get().split())\r\nl=list(map(int,get().split()))\r\nans=0\r\nfor x in range(n-1):\r\n if l[x]!=y:\r\n continue\r\n i=x\r\n j=x+1\r\n c=1\r\n a=y\r\n while 0<=i and j<n:\r\n while i>=0 and l[i]==a:\r\n c+=1\r\n i-=1\r\n while j<n and l[j]==a:\r\n c+=1\r\n j+=1\r\n if c>=3:\r\n c=0\r\n ans = max(j - i - 1, ans)\r\n a=l[i]\r\n continue\r\n else:\r\n break\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#https://codeforces.com/problemset/problem/430/B\r\n'''\r\nComment\r\n'''\r\nn = 0\r\nk = 0\r\nx = 0\r\nballs = []\r\n\r\ndef cntBall(pos):\r\n l = r = pos\r\n cnt = 0\r\n\r\n while balls[l] == balls[r]:\r\n tmp = 2\r\n\r\n while l > 0 and balls[l - 1] == balls[l]:\r\n l -= 1\r\n tmp += 1\r\n\r\n while r < n - 1 and balls[r + 1] == balls[r]:\r\n r += 1\r\n tmp += 1\r\n\r\n l -= 1\r\n r += 1\r\n\r\n if tmp < 3:\r\n break\r\n\r\n cnt += tmp\r\n\r\n if l < 0 or r >= n:\r\n break\r\n \r\n return cnt - 1\r\n\r\nif __name__ == \"__main__\":\r\n n, k, x = map(int, input().split())\r\n balls = list(map(int, input().split()))\r\n res = 0\r\n \r\n for i in range(n):\r\n if balls[i] == x:\r\n res = max(res, cntBall(i))\r\n\r\n print(res)", "import copy\n\n\ndef main():\n n, x, k = list(map(int, input().strip().split(' ')))\n balls = list(map(int, input().strip().split(' ')))\n original_balls = copy.deepcopy(balls)\n flag = 1\n maxi = 0\n # print(balls)\n for i in range(len(balls)):\n balls = copy.deepcopy(original_balls)\n if i + 1 < len(balls):\n if balls[i] == balls[i + 1] and balls[i] == k:\n # print(balls)\n new_balls = balls[:i + 1] + [k] + balls[i + 1:]\n # print(new_balls)\n flag = 1\n while flag != 0:\n # print(new_balls)\n balls = new_balls\n new_balls = []\n length = len(balls)\n flag = 0\n for i in range(len(balls)):\n if i + 2 < length and balls[i] == balls[i + 1] and balls[i + 1] == balls[i + 2]:\n curr = i + 2\n while curr + 1 < length and balls[i] == balls[curr + 1]:\n curr += 1\n new_balls = balls[:i] + balls[curr + 1:]\n flag = 1\n # print(len(new_balls))\n break\n # print(len(balls))\n maxi = max(maxi, len(original_balls) - len(balls))\n print(maxi)\n\n\nif __name__ == '__main__':\n main()\n\n\t\t\t\t \t \t\t \t\t\t \t\t \t\t \t \t \t", "n, k, bola = [int(x) for x in input().split()]\nfila = [int(x) for x in input().split()]\n\nremovidas = 0\n\nfor i in range(n):\n\tcopia = fila.copy()\n\tcopia.insert(i, bola)\n\twhile len(copia) > 2:\n\t\ttmp = len(copia)\n\t\tfor j in range(len(copia)-2):\n\t\t\tif copia[j] == copia[j+1] == copia[j+2]:\n\t\t\t\tp = j + 3\n\t\t\t\twhile p < len(copia):\n\t\t\t\t\tif copia[j] != copia[p]:\n\t\t\t\t\t\tbreak\n\t\t\t\t\tp += 1\n\t\t\t\tcopia = copia[:j] + copia[p:]\n\t\t\t\tbreak\n\t\tif tmp == len(copia):\n\t\t\tbreak\n\tremovidas = max(removidas, n - len(copia))\nprint(removidas)\n\n\t\t\t \t\t\t \t\t \t\t\t \t\t\t\t\t\t \t", "#! /usr/bin/python3\n\n\ndef remove_contiguous(arr):\n\tleft = 0\n\tright = 1\n\twhile(right < len(arr)):\n\t\twhile(right < len(arr) and arr[left] == arr[right]):\n\t\t\tright += 1\n\t\tif (right - left >= 3):\n\t\t\tdel arr[left:right]\n\t\t\tmodified = True\n\t\t\treturn arr\n\t\tleft = right\n\t\tright += 1\n\treturn arr\n\n\nn, k, x = map(int, input().strip().split())\nc = [int(x) for x in input().strip().split()]\n\nans = 0\n\nfor i in range(1, len(c)):\n\tif c[i - 1] == c[i] and c[i] == x:\n\t\td = c[:i] + [x] + c[i:]\n\t\tlen_prev = len(d)\n\t\twhile(True):\n\t\t\td = remove_contiguous(d)\n\t\t\tif (len_prev == len(d)):\n\t\t\t\tbreak\n\t\t\tlen_prev = len(d)\n\t\tans = max(ans, n - len(d))\n\nprint(ans)", "inp = [int(i) for i in input().split(\" \")]\n\nn = inp[0]\nk = inp[1]\ncor = inp[2]\n\nballsOri = [int(i) for i in input().split(\" \")]\n\nmax_estouradas = 0\n\nfor i in range(n):\n balls = ballsOri.copy()\n balls.insert(i, cor)\n \n modificado = True\n\n while modificado:\n modificado = False\n index = 0\n while index < len(balls):\n qtd_igual = 1\n anterior = balls[index]\n j = index + 1\n while j < len(balls):\n if balls[j] == anterior:\n qtd_igual += 1\n else:\n break\n j += 1\n if qtd_igual >= 3:\n for j in range(0, qtd_igual):\n balls.pop(index)\n modificado = True\n index += 1\n estouradas = n - len(balls)\n if max_estouradas < estouradas:\n max_estouradas = estouradas\n\nprint(max_estouradas)", "n_balls, k_consecutive, new_ball_color = input().split()\nn_balls, k_consecutive = int(n_balls), int(k_consecutive)\nballs = input().split()\nmax_remaining = 0\n\nfor i in range(n_balls):\n current_balls = balls.copy()\n current_balls.insert(i, new_ball_color)\n while len(current_balls) > 2:\n original_len = len(current_balls)\n for j in range(2, len(current_balls)):\n if current_balls[j-2] == current_balls[j-1] == current_balls[j]:\n p = j + 1\n while p < len(current_balls):\n if current_balls[j] != current_balls[p]:\n break\n p += 1\n current_balls = current_balls[:j-2] + current_balls[p:]\n break\n if len(current_balls) == original_len:\n break\n max_remaining = max(max_remaining, n_balls - len(current_balls))\n\nprint(max_remaining)\n\n \t \t \t\t\t\t\t\t\t\t \t\t \t\t\t \t\t", "n, k, x = [ int(x) for x in input().split() ]\nballs = [ int(x) for x in input().split() ]\n\ndef remover(arr):\n len_a = len(arr) \n if len_a > 2:\n a, b = 0, 1\n m, mx = 0, 0\n while b < len_a:\n if arr[a] != arr[b]:\n if b - a > mx - m:\n m = a\n mx = b\n a = b\n b = a\n b += 1\n if arr[a] == arr[b-1] and b - a > mx - m:\n mx = b\n m = a\n\n if mx - m < 3:\n return 0\n else:\n aux = []\n\n for i in range(0, m):\n aux.append(arr[i])\n for i in range(mx, len_a):\n aux.append(arr[i])\n return mx - m + remover(aux)\n return 0\n\nns = [0]\nif n > 1:\n for i in range(0, n - 1):\n if balls[i] == balls[i + 1] == x:\n aux = []\n for j in range(0, i + 1):\n aux.append(balls[j])\n aux.append(x)\n for j in range(i + 1, n):\n aux.append(balls[j])\n ns.append(remover(aux) - 1)\n\nprint(max(ns))", "import sys\nimport math\nfrom collections import defaultdict\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\nASCIILOWER = 97\nASCIIUPPER = 65\n\n\ndef getInt():\n return int(sys.stdin.readline().rstrip())\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef printOutput(ans):\n sys.stdout.write()\n pass\n\n\ndef branch(lst, color, pos):\n #print(lst, color, pos)\n\n l = pos - 1\n r = pos\n curColor = color\n total = 0\n subtotal = 1\n while True:\n while l >= 0 and lst[l] == curColor:\n subtotal += 1\n l -= 1\n while r < len(lst) and lst[r] == curColor:\n subtotal += 1\n r += 1\n #print(\"hi\", l, r)\n #print(subtotal)\n if subtotal < 3:\n break\n total += subtotal\n if l < 0:\n break\n curColor = lst[l]\n subtotal = 0\n return max(total-1, 0)\n\n\ndef solve(balls, x):\n return max(branch(balls, x, i) for i in range(len(balls)))\n\n\ndef readinput():\n n, k, x = getInts()\n balls = list(getInts())\n print(solve(balls, x))\n\n\nreadinput()\n", "n,k,x=map(int,input().split())\nf=list(map(int,input().split()))\nres=0\nif n >= 2:\n for i in range(n-1):\n if f[i] == x and f[i+1] != x:\n new=f[::]\n new.insert(i,x)\n nr=0\n while True:\n pre=0\n lian=0\n flag=1\n for i in range(len(new)):\n if new[i] != pre:\n if lian >= 3:\n del new[i-lian:i]\n nr+=lian\n flag=0\n lian = 0\n break\n else:\n pre = new[i]\n lian = 1\n else:\n lian+=1\n if lian >= 3:\n del new[len(new) - lian:]\n nr += lian\n flag = 0\n if flag:\n break\n res=max(nr-1,res)\n new = f[::]\n new.insert(i, x)\n nr = 0\n while True:\n pre = 0\n lian = 0\n flag = 1\n for i in range(len(new)):\n if new[i] != pre:\n if lian >= 3:\n del new[i - lian:i]\n nr += lian\n flag = 0\n lian = 0\n break\n else:\n pre = new[i]\n lian = 1\n else:\n lian += 1\n if lian >= 3:\n del new[len(new) - lian:]\n nr += lian\n flag = 0\n if flag:\n break\n res = max(nr - 1, res)\nprint(res)\n\n\n\t\t \t\t \t\t\t\t\t \t \t\t \t\t\t \t \t\t \t", "n, k, x = map(int, input().split())\n\ns = list(map(int, input().split()))\n\ndef fl(x, e, c):\n s = x[:e]\n s.append(c)\n s += x[e:]\n for j in range(55):\n for i in range(len(s)-2):\n if s[i] == s[i+1] == s[i+2]:\n if i < len(s)-3:\n if s[i] == s[i+3]:\n del s[i]\n del s[i]\n del s[i]\n del s[i]\n break\n\n return len(s)\n\n\nm = 0\n\nfor i in range(n):\n m = max(m, n - fl(s,i,x))\n\nprint(m)\n" ]

[ "import heapq as h\r\n\r\nn = int(input())\r\nline2 = input().split()\r\na = []\r\nfor i in range(n):\r\n h.heappush(a,int(line2[i]))\r\nif n == 1:\r\n print(0)\r\nelse:\r\n result = 0\r\n if n%2 == 1:\r\n k = n\r\n else:\r\n a.append(0)\r\n k = n + 1\r\n while k > 3:\r\n previous = h.heappop(a) + h.heappop(a)+ h.heappop(a)\r\n result += previous\r\n h.heappush(a, previous)\r\n k -= 2\r\n result += sum(a)\r\n print(result)", "import sys\r\nfrom heapq import *\r\n\r\n\r\ndef get_ints():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef solve(N, nums):\r\n ans = 0\r\n q = []\r\n for n in nums:\r\n heappush(q, n)\r\n\r\n if not (N & 1):\r\n heappush(q, 0)\r\n\r\n while len(q) > 1:\r\n s = heappop(q) + heappop(q) + heappop(q)\r\n ans += s\r\n heappush(q, s)\r\n\r\n return ans\r\n\r\nN = int(input())\r\nnums = get_ints()\r\nprint(solve(N, nums))\r\n", "import heapq\r\nip = lambda: map(int,input().split())\r\nn = ip()\r\nl = list(ip())\r\nif (len(l)%2==0): l.append(0)\r\nheapq.heapify(l)\r\npen = 0\r\nwhile len(l) > 1:\r\n\tx = heapq.heappop(l)\r\n\ty = heapq.heappop(l)\r\n\tz = heapq.heappop(l)\r\n\tpen = pen + x + y + z\r\n\theapq.heappush(l, x + y + z)\r\nprint(pen)", "n=int(input())\r\nimport heapq\r\na=[int(i) for i in input().split()]+[[0],[]][n&1]\r\nheapq.heapify(a)\r\nk=0\r\nwhile len(a)>1:\r\n s=heapq.heappop(a)+heapq.heappop(a)+heapq.heappop(a)\r\n k+=s\r\n heapq.heappush(a,s)\r\nprint(k)", "import heapq as h\nn=int(input())\na=[int(x) for x in input().split()]\nif len(a)%2==0:\n\ta.append(0)\nh.heapify(a)\nans=0\nwhile len(a)>1:\n\ta1=h.heappop(a)\n\ta2=h.heappop(a)\n\ta3=h.heappop(a)\n\tans+=a1+a2+a3\n\th.heappush(a,a1+a2+a3)\nprint(ans)\n", "# Link https://codeforces.com/problemset/problem/884/D\r\n# import sys,os\r\n# if not os.environ.get(\"ONLINE_JUDGE\"):\r\n# sys.stdin = open('in.txt', 'r')\r\n# sys.stdout = open('myout.txt', 'w')\r\n# import time\r\n# start_time = time.time()\r\n\r\nimport heapq\r\n\r\nn = int(input())\r\ncolors = list(map(int, input().strip().split()))\r\n\r\nif n % 2 == 0:\r\n colors.append(0)\r\n\r\npenalty = 0\r\nheapq.heapify(colors)\r\n\r\nwhile(len(colors)>2):\r\n a = heapq.heappop(colors)\r\n b = heapq.heappop(colors)\r\n c = heapq.heappop(colors)\r\n penalty += a + b +c \r\n heapq.heappush(colors, a + b + c)\r\n\r\nprint(penalty)\r\n", "from heapq import *\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nheap = []\r\nres = 0\r\nfor i in range(n):\r\n heappush(heap, a[i])\r\nif n % 2 == 0:\r\n heappush(heap, 0)\r\nwhile n > 1:\r\n cur = heappop(heap)\r\n cur += heappop(heap)\r\n cur += heappop(heap)\r\n res += cur\r\n heappush(heap, cur)\r\n n -= 2\r\nprint(res)", "from heapq import *\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ns=0\r\nif len(a)%2==0:\r\n a=[0]+a\r\n n+=1\r\ndef sc(a,s=0):\r\n heapify(a)\r\n for i in range ((n-1)//2):\r\n k=heappop(a)+heappop(a)+heappop(a)\r\n s+=k\r\n heappush(a,k)\r\n print(s)\r\nsc(a)\r\n", "import heapq\r\n\r\nn = int(input())\r\nheap = list(map(int, input().split())) + ([0] if n % 2 == 0 else [])\r\nn = len(heap)\r\nheapq.heapify(heap)\r\n\r\nans = 0\r\nfor i in range(n, 1, -2):\r\n x = heapq.heappop(heap) + heapq.heappop(heap) + heapq.heappop(heap)\r\n heapq.heappush(heap, x)\r\n ans += x\r\n\r\nprint(ans)", "import heapq\r\n\r\ndef solve(heap, n):\r\n heapq.heapify(heap)\r\n ans = 0\r\n while(n > 1):\r\n x = heapq.heappop(heap)\r\n y = heapq.heappop(heap)\r\n z = heapq.heappop(heap)\r\n heapq.heappush(heap, x + y + z)\r\n ans += x + y + z\r\n n -= 2\r\n \r\n return ans\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nif n % 2 == 0:\r\n delta = a[0] + a[1]\r\n a = [delta] + a[2:]\r\n n -= 1\r\n print(solve(a, n) + delta)\r\nelse:\r\n print(solve(a, n))\r\n", "import heapq\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nheapq.heapify(a)\r\nif (n & 1) == 0:\r\n heapq.heappush(a, 0)\r\nres=0\r\nwhile len(a)>1:\r\n s=heapq.heappop(a)+heapq.heappop(a)+heapq.heappop(a)\r\n res+=s\r\n heapq.heappush(a,s)\r\nprint(res)", "import heapq as h\r\nn = int(input())\r\nai = [int(i) for i in input().split()]\r\nif n % 2 == 0:\r\n ai = [0] + ai\r\nresult = 0\r\nh.heapify(ai)\r\nwhile len(ai) > 1:\r\n\ta1 = h.heappop(ai)\r\n\ta2 = h.heappop(ai)\r\n\ta3 = h.heappop(ai)\r\n\tresult += a1 + a2 + a3\r\n\th.heappush(ai, a1 + a2 + a3)\r\nprint(result)", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n%2==0:\r\n a.append(0)\r\n\r\nfrom heapq import*\r\nhq=[]\r\nfor i in a:\r\n heappush(hq,i)\r\n\r\nans=0\r\nwhile len(hq)!=1:\r\n res=0\r\n for i in range(3):\r\n res+=heappop(hq)\r\n ans+=res\r\n heappush(hq,res)\r\n\r\nprint(ans)", "import heapq\r\nn=int(input())\r\narray=input().split()\r\nfin=[]\r\nfor i in array:\r\n fin.append(int(i))\r\nif(len(fin)%2==0):\r\n fin.append(0)\r\n\r\nheapq.heapify(fin)\r\nsums=0\r\nwhile(len(fin)>1):\r\n temp=0\r\n a=heapq.heappop(fin)\r\n b=heapq.heappop(fin)\r\n c=heapq.heappop(fin)\r\n temp=a+b+c\r\n sums+=temp\r\n heapq.heappush(fin,temp)\r\nprint(sums)", "import heapq\r\n\r\nN = int(input())\r\ncolors = list(map(int,input().strip().split()))\r\nheapq.heapify(colors)\r\n\r\nif(len(colors) % 2 == 0):\r\n colors.append(0)\r\n\r\nans = 0\r\n\r\nwhile(len(colors) > 2):\r\n a = heapq.heappop(colors)\r\n b = heapq.heappop(colors)\r\n c = heapq.heappop(colors)\r\n heapq.heappush(colors,a+b+c)\r\n ans += a+b+c\r\n \r\nprint(ans)", "#!/usr/bin/env python3\n\nfrom heapq import *\n\ndef score(A):\n heapify(A)\n res = 0\n if len(A)%2==0:\n a0,a1 = heappop(A),heappop(A)\n a = a0+a1\n res += a\n heappush(A,a)\n while len(A)>1:\n a0,a1,a2 = heappop(A),heappop(A),heappop(A)\n a = a0+a1+a2\n res += a\n heappush(A,a)\n return res\n\ndef main():\n n = int(input())\n A = list(map(int,input().split()))\n print(score(A))\n\nmain()\n", "import heapq\r\nn = int(input())\r\nl = [int(i) for i in input().split()]\r\nif n % 2 == 0:\r\n l = [0] + l\r\nresult = 0\r\nheapq.heapify(l)\r\nwhile len(l) > 1:\r\n\tx = heapq.heappop(l)\r\n\ty = heapq.heappop(l)\r\n\tz = heapq.heappop(l)\r\n\tresult += x + y + z\r\n\theapq.heappush(l, x + y + z)\r\nprint(result)\r\n", "import heapq\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nh = []\r\nfor i in a:\r\n heapq.heappush(h, i)\r\nif not n % 2:\r\n heapq.heappush(h, 0)\r\nans = 0\r\nwhile len(h) ^ 1:\r\n s = 0\r\n for _ in range(3):\r\n s += heapq.heappop(h)\r\n ans += s\r\n heapq.heappush(h, s)\r\nprint(ans)", "n=int(input())\r\ncolors=list(map(int,input().strip().split()))\r\n\r\nif n%2==0:\r\n colors.append(0)\r\n\r\nimport heapq\r\n\r\nheapq.heapify(colors)\r\npenalty=0\r\n\r\nwhile(len(colors)>2):\r\n a=heapq.heappop(colors)\r\n b=heapq.heappop(colors)\r\n c=heapq.heappop(colors)\r\n penalty+=(a+b+c)\r\n \r\n heapq.heappush(colors,a+b+c)\r\n\r\nprint(penalty)\r\n ", "class heap:\r\n def __init__(self, maxn):\r\n self.a = [0] * maxn\r\n self.size = 0\r\n \r\n def shift_down(self, i):\r\n while 2 * i + 1 < self.size:\r\n l = 2 * i + 1\r\n r = 2 * i + 2\r\n j = l\r\n if r < self.size and self.a[r] < self.a[l]:\r\n j = r\r\n if self.a[i] <= self.a[j]:\r\n break\r\n self.a[i], self.a[j] = self.a[j], self.a[i]\r\n i = j\r\n\r\n def shift_up(self, i):\r\n while i and self.a[i] < self.a[(i - 1) // 2]:\r\n self.a[i], self.a[(i - 1) // 2] = self.a[(i - 1) // 2], self.a[i]\r\n i = (i - 1) // 2\r\n\r\n def erase_min(self):\r\n mn = self.a[0]\r\n self.a[0] = self.a[self.size - 1]\r\n self.size -= 1\r\n self.shift_down(0)\r\n return mn\r\n\r\n def insert(self, val):\r\n self.size += 1\r\n self.a[self.size - 1] = val\r\n self.shift_up(self.size - 1)\r\n\r\n\r\nn = int(input())\r\nans = 0\r\ns = heap(400000 + 100)\r\nfor i in [int(j) for j in input().split()]:\r\n s.insert(i)\r\nif s.size % 2 == 0:\r\n s.insert(0)\r\nwhile s.size > 1:\r\n t = s.erase_min() + s.erase_min()\r\n if s.size:\r\n t += s.erase_min()\r\n ans += t\r\n s.insert(t)\r\nprint(ans)\r\n", "import heapq\r\nn = int(input())\r\nresp=0\r\ntest = [int(i) for i in input().split()]\r\ntest.sort()\r\nif(n%2==0):\r\n test = [0]+test\r\n n+=1\r\nwhile n!=1:\r\n c = heapq.heappop(test) + heapq.heappop(test) + heapq.heappop(test)\r\n resp+=c\r\n heapq.heappush(test,c)\r\n n-=2\r\nprint(resp)\r\n \r\n\r\n\r\n\r\n\r\n", "r = lambda: map(int, input().split())\r\n\r\nimport heapq\r\n\r\ndef main():\r\n\tn, = r()\r\n\ta = list(r())\r\n\tif len(a) % 2 == 0:\r\n\t\ta.append(0)\r\n\theapq.heapify(a)\r\n\tret = 0\r\n\twhile len(a) > 1:\r\n\t\tx = heapq.heappop(a)\r\n\t\ty = heapq.heappop(a)\r\n\t\tz = heapq.heappop(a)\r\n\t\tret += x + y + z\r\n\t\theapq.heappush(a, x + y + z)\r\n\tprint(ret)\r\n\r\nmain()", "import heapq\r\n\r\nn = int(input())\r\ncolors_lens = list(map(int, input().split()))\r\n\r\nif len(colors_lens) % 2 == 0:\r\n colors_lens.append(0)\r\n\r\nheapq.heapify(colors_lens)\r\n\r\nans = 0\r\nl = len(colors_lens)\r\nwhile l > 1:\r\n su = 0\r\n su += heapq.heappop(colors_lens)\r\n su += heapq.heappop(colors_lens)\r\n su += heapq.heappop(colors_lens)\r\n ans += su\r\n heapq.heappush(colors_lens, su)\r\n l -= 2\r\n\r\nprint(ans)\r\n", "n = int(input())\r\ncolors = list(map(int, input().strip().split()))\r\n\r\nif n % 2 == 0:\r\n colors.append(0)\r\n\r\nimport heapq\r\n\r\nheapq.heapify(colors)\r\npenalty = 0\r\n\r\nwhile (len(colors) > 2):\r\n a = heapq.heappop(colors)\r\n b = heapq.heappop(colors)\r\n c = heapq.heappop(colors)\r\n penalty += (a + b + c)\r\n\r\n heapq.heappush(colors, a + b + c)\r\n\r\nprint(penalty)", "import heapq\r\nn = input()\r\nA = list(map(int, input().split())) \r\nif (len(A) % 2 == 0):\r\n A.append(0)\r\nst = 0\r\nheapq.heapify(A)\r\nwhile (len(A) > 1):\r\n abc = 0\r\n a = heapq.heappop(A)\r\n b = heapq.heappop(A)\r\n c = heapq.heappop(A)\r\n abc = a + b + c\r\n st = st + abc\r\n heapq.heappush(A, abc)\r\nprint(st)", "import heapq\r\n\r\nN=int(input())\r\ncolors=list(map(int,input().split()))\r\n\r\nif (N%2==0):\r\n colors.append(0)\r\npenalty=0\r\nheapq.heapify(colors)\r\nwhile (len(colors)>2):\r\n a = heapq.heappop(colors)\r\n b = heapq.heappop(colors)\r\n c = heapq.heappop(colors)\r\n\r\n penalty+=a+b+c \r\n \r\n heapq.heappush(colors,a+b+c)\r\n \r\nprint(penalty)\r\n" ]

[ "n=int(input())\r\nif n>=-128 and n<=127:print('byte')\r\nelif n>=-32768 and n<=32767:print('short')\r\nelif n>=-2147483648 and n<=2147483647:print('int')\r\nelif n>=-9223372036854775808 and n<=9223372036854775807:print('long')\r\nelse: print('BigInteger')\r\n", "n = int(input())\n\nif (n >= -128) and (n <= 127):\n print(\"byte\")\n\nelif (n >= -32768) and (n <= 32767):\n print(\"short\")\n\nelif (n >= -2147483648) and (n <= 2147483647):\n print(\"int\")\n\nelif (n >= -9223372036854775808) and (n <= 9223372036854775807):\n print(\"long\")\n\nelse:\n print(\"BigInteger\")\n \t \t \t \t \t\t\t\t \t \t\t\t\t\t", "a = int(input())\r\nif(a >= -128 and a <= 127):\r\n print(\"byte\")\r\nelif(a >= -32768 and a <= 32767):\r\n print(\"short\")\r\nelif(a >= -2147483648 and a <= 2147483647):\r\n print(\"int\")\r\nelif(a >= -9223372036854775808 and a <= 9223372036854775807):\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")\r\n# _/_/ _/_/_/ _/_/_/ _/_/_/_/_/ _/_/\r\n# _/ _/ _/ _/ _/ _/ _/ _/\r\n# _/ _/ _/_/_/ _/ _/ _/ _/\r\n# _/ _/ _/ _/ _/ _/ _/ _/\r\n# _/_/ _/_/_/ _/_/_/ _/ _/_/\r\n#この現実は救う価値がありません。世界はすでに死んでいます。\r\n#この世界は根底まで腐っていて、苦しみ以外に何も残っていません", "a=int(input())\nif a > -128 and a < 128:\n print('byte')\nelif a > -32768 and a < 32768:\n print('short')\nelif a > -2147483648 and a < 2147483648:\n print('int')\nelif a > -9223372036854775808 and a < 9223372036854775808:\n print('long')\nelse:\n print('BigInteger')", "num = int(input());\r\nlong = len(str(abs(num)));\r\nif(num<0): num = abs(num+1);\r\nif(num<=127 and long<=3): print(\"byte\");\r\nelse:\r\n if(num<=32767 and long<=5):print(\"short\");\r\n else:\r\n if( num<=2147483647 and long<=10):print(\"int\");\r\n else:\r\n if(num<=9223372036854775807 and long<=19):print(\"long\");\r\n else:print(\"BigInteger\");\r\n\r\n", "n = int (input())\r\n\r\nans = \"\"\r\nif (n <= 127):\r\n ans = \"byte\"\r\nelif (n <= 32767):\r\n ans = \"short\"\r\nelif (n <= 2147483647):\r\n ans = \"int\"\r\nelif (n <= 9223372036854775807):\r\n ans = \"long\"\r\nelse:\r\n ans = \"BigInteger\"\r\n\r\nprint (ans)\r\n", "n = input()\r\n\r\nif len(n) <= 3:\r\n\tx = int(n)\r\n\tif -128 <= x <= 127:\r\n\t\tprint(\"byte\")\r\n\telse:\r\n\t\tprint(\"short\")\r\nelif len(n) <= 5:\r\n\tx = int(n)\r\n\tif -32768 <= x <= 32767:\r\n\t\tprint(\"short\")\r\n\telse:\r\n\t\tprint(\"int\")\r\nelif len(n) <= 10:\r\n\tx = int(n)\r\n\tif -2147483648 <= x <= 2147483647:\r\n\t\tprint(\"int\")\r\n\telse:\r\n\t\tprint(\"long\")\r\nelif len(n) <= 19:\r\n\tx = int(n)\r\n\tif -9223372036854775808 <= x <= 9223372036854775807:\r\n\t\tprint(\"long\")\r\n\telse:\r\n\t\tprint(\"BigInteger\")\r\nelse:\r\n\tprint(\"BigInteger\")", "num = int(input());\r\nlong = len(str(abs(num)));\r\nif(num>=-128 and num<=127 and long<=3): print(\"byte\");\r\nelse:\r\n if(num>=-32768 and num<=32767 and long<=5):print(\"short\");\r\n else:\r\n if(num>=-2147483648 and num<=2147483647 and long<=10):print(\"int\");\r\n else:\r\n if(num>=-9223372036854775808 and num<=9223372036854775807 and long<=19):print(\"long\");\r\n else:print(\"BigInteger\");\r\n\r\n", "if __name__ == \"__main__\":\n n = int(input())\n \n if n <= 127 and n >= -128:\n print(\"byte\")\n elif n <= 32767 and n >= -32768:\n print(\"short\")\n elif n <= 2147483647 and n >= -2147483648:\n print(\"int\")\n elif n <= 9223372036854775807 and n >= -9223372036854775808:\n print(\"long\")\n else:\n print(\"BigInteger\")\n \t \t \t \t \t\t \t \t\t \t\t \t\t\t", "# LUOGU_RID: 101875206\nclass Type:\r\n type_name: str\r\n min_value: int\r\n max_value: int\r\n def __init__(self, k, l, m):\r\n self.type_name = k\r\n self.min_value = l\r\n self.max_value = m\r\n \r\ntypes = [\r\n Type('byte', -128, 127),\r\n Type('short', -32768, 32767),\r\n Type('int', -2147483648, 2147483647),\r\n Type('long', -9223372036854775808, 9223372036854775807),\r\n Type('BigInteger', -10 ** 100, 10 ** 100)\r\n ]\r\nn = int(input())\r\nfor i in range(len(types)):\r\n if types[i].min_value <= n <= types[i].max_value:\r\n print(types[i].type_name)\r\n exit()", "import collections\nimport math\nimport fractions\nimport re\nimport random\nimport bisect\nimport sys\nimport os\n\nv = int(input())\nif -128 <= v <= 127:\n print(\"byte\")\nelif -32768 <= v <= 32767:\n print(\"short\")\nelif -2147483648 <= v <= 2147483647:\n print(\"int\")\nelif -9223372036854775808 <= v <= 9223372036854775807:\n print(\"long\")\nelse:\n print(\"BigInteger\")\n \t \t \t \t\t \t\t\t \t \t\t\t", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ni = int(input())\r\nif i in range(-128, 128):\r\n\tprint(\"byte\")\r\nelif i in range(-32768, 32768):\r\n\tprint(\"short\")\r\nelif i in range(-2147483648, 2147483648):\r\n\tprint(\"int\")\r\nelif i in range(-9223372036854775808, 9223372036854775808):\r\n\tprint(\"long\")\r\nelse:\r\n\tprint(\"BigInteger\")", "def main():\n n = int(input())\n if n < 0:\n n = 1 - n\n for i in range(5):\n if not n >> (8 * 2 ** i - 1):\n break\n print((\"byte\", \"short\", \"int\", \"long\", \"BigInteger\")[i])\n\n\nif __name__ == '__main__':\n main()\n", "import math\nn = int(input())\nif n <= 127 & n >= -128:\n\tprint(\"byte\")\nelif n >= -32768 & n <= 32767:\n\tprint(\"short\")\nelif n >= -2147483648 & n <= 2147483647:\n\tprint(\"int\")\nelif n >= -9223372036854775808 & n <= 9223372036854775807:\n\tprint(\"long\")\nelse :\n\tprint(\"BigInteger\")", "n = input()\r\nif len(n)>19:\r\n print(\"BigInteger\")\r\nelse:\r\n a = int(n)\r\n if -128<=a<=127:\r\n print(\"byte\")\r\n elif -32765<=a<=32767:\r\n print(\"short\")\r\n elif -2147483648<=a<=2147483647:\r\n print('int')\r\n elif -9223372036854775808<=a<=9223372036854775807:\r\n print(\"long\")\r\n else:\r\n print(\"BigInteger\")\r\n \r\n", "a=int(input())\nif a in range(-128,128):\n print('byte')\nelif a in range(-32768,32768):\n print('short')\nelif a in range(-2147483648,2147483648):\n print('int')\nelif a in range(-9223372036854775808,9223372036854775808):\n print('long')\nelse:\n print('BigInteger')", "a=int (input());\r\nb = 9223372036854775808\r\nd = 2147483648\r\ne = 32768\r\nf = 128\r\nif (-f-1) < a < f:\r\n print('byte');\r\nelif (-e-1) < a < e:\r\n print ('short');\r\nelif (-d-1) < a < d:\r\n print('int');\r\nelif (-b - 1) < a < b:\r\n print('long');\r\nelse:\r\n print ('BigInteger');", "x = input()\r\nif ((-128 <= int(x)) and (int(x) <= 127)):\r\n print(\"byte\")\r\nelif (-32768 <= int(x)) and (int(x) <= 32767):\r\n print('short')\r\nelif ((-2147483648 <= int(x)) and (int(x) <= 2147483647)):\r\n print('int')\r\nelif ((-9223372036854775808 <= int(x)) and (int(x) <= 9223372036854775807)):\r\n print('long')\r\nelse:\r\n print('BigInteger')", "n=int(input())\r\nif n<128:\r\n print(\"byte\")\r\nelif n<32768:\r\n print(\"short\")\r\nelif n<=2147483647:\r\n print(\"int\")\r\nelif n<=9223372036854775807:\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")\r\n", "n = int(input())\r\nif 127 >= n >= -128:\r\n print(\"byte\")\r\nelif 32767 >= n >= -32768:\r\n print(\"short\")\r\nelif 2147483647 >= n >= -2147483648:\r\n print(\"int\")\r\nelif 9223372036854775807 >= n >= -9223372036854775808:\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")", "n = int(input())\r\nif n <= 127: print(\"byte\")\r\nelif n <= 32767: print(\"short\")\r\nelif n <= 2147483647: print(\"int\")\r\nelif n <= 9223372036854775807: print(\"long\")\r\nelse: print(\"BigInteger\")", "n = int(input())\r\nif(-128 <= n <= 127): print(\"byte\")\r\nelif(-32768 <= n <= 32767): print(\"short\")\r\nelif(-2147483648 <= n <= 2147483647): print(\"int\")\r\nelif(-9223372036854775808 <= n <= 9223372036854775807): print(\"long\")\r\nelse: print(\"BigInteger\")", "from bisect import bisect_right\r\nimport math\r\nfrom queue import PriorityQueue\r\nfrom sys import stdin, stdout\r\nimport collections\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 = int(input())\r\n if n >= -128 and n <= 127:\r\n print(\"byte\\n\")\r\n elif n >= -32768 and n <= 32767:\r\n print(\"short\\n\")\r\n elif n >= -2147483648 and n <= 2147483647:\r\n print(\"int\\n\")\r\n elif n >= -9223372036854775808 and n <= 9223372036854775807:\r\n print(\"long\\n\")\r\n else:\r\n print(\"BigInteger\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\ndef solve():\n digit = input()\n if len(digit) > 20:\n print(\"BigInteger\")\n return\n digit = int(digit)\n\n if digit <= 127 and digit >=-128:\n print(\"byte\")\n return\n if digit <= 32767 and digit >=-32768:\n print(\"short\")\n return\n if digit <= 2147483647 and digit >=-2147483648:\n print(\"int\")\n return\n if digit <= 9223372036854775807 and digit >=-9223372036854775808:\n print(\"long\")\n return\n else:\n print(\"BigInteger\")\n\nsolve()\n\t \t \t\t \t\t \t\t\t \t \t\t \t", "n = int(input())\r\n\r\nif(-128 <= n and n <= 127):\r\n print('byte')\r\nelif(-32768 <= n and n <= 32767):\r\n print('short')\r\nelif(-2147483648 <= n and n <= 2147483647):\r\n print('int')\r\nelif(-9223372036854775808 <= n and n <= 9223372036854775807):\r\n print('long')\r\nelse: \r\n print('BigInteger')\r\n", "item=input()\n\ndef LTE(a,b):\n if(len(a)!=len(b)):\n #smaller length always smaller\n return len(a)<len(b)\n #same len\n for i in range(len(a)):\n if(a[i]<b[i]):\n return True\n elif(a[i]>b[i]):\n return False\n #equal\n return True\n\nif(item[0]!='-'):\n #positive\n if LTE(item,'127'):\n print(\"byte\")\n elif LTE(item,'32767'):\n print(\"short\")\n elif LTE(item,'2147483647'):\n print(\"int\")\n elif LTE(item,'9223372036854775807'):\n print(\"long\")\n else:\n print(\"BigInteger\")\nelse:\n #negative\n item=item[1:]\n if LTE(item,'128'):\n print(\"byte\")\n elif LTE(item,'32768'):\n print(\"short\")\n elif LTE(item,'2147483648'):\n print(\"int\")\n elif LTE(item,'9223372036854775808'):\n print(\"long\")\n else:\n print(\"BigInteger\")\n \t \t\t\t \t \t\t\t \t\t\t\t\t\t\t\t\t", "# Wadea #\r\n\r\nn = int(input())\r\nif -128 <= n <= 127:\r\n print(\"byte\")\r\nelif -32768 <= n < -128 or 127 < n <= 32767:\r\n print(\"short\")\r\nelif -2147483648 <= n < -32768 or 32767 < n <= 2147483647:\r\n print(\"int\")\r\nelif -9223372036854775808 <= n < -2147483648 or 2147483647 < n <= 9223372036854775807 :\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")\r\n", "n = int(input())\r\nif 0 <= n <= 127:\r\n\tprint(\"byte\")\r\nelif 128 <= n <= 32767:\r\n\tprint(\"short\")\r\nelif 32768 <= n <= 2147483647:\r\n\tprint(\"int\")\r\nelif 2147483648 <= n <= 9223372036854775807:\r\n\tprint(\"long\")\r\nelse:\r\n\tprint(\"BigInteger\")\r\n", "a=int(input())\r\nif a>-128 and a<128:\r\n print(\"byte\")\r\nelif(a>-32768 and a<32768):\r\n\tprint(\"short\")\r\nelif(a>-2147483648 and a<2147483648):\r\n\tprint(\"int\")\r\nelif(a>-9223372036854775808 and a<9223372036854775808):\r\n print('long')\r\nelse:\r\n print(\"BigInteger\")", "n=int(input())\r\ns=str(n)\r\nif(len(s)>=20 or n>9223372036854775807):\r\n print('BigInteger')\r\nelif(-128<=n<=127):\r\n print('byte')\r\nelif(-32768<=n<=32767):\r\n print('short')\r\nelif(-2147483648<=n<=2147483647): \r\n print('int')\r\nelif(-9223372036854775808<=n<= 9223372036854775807):\r\n print('long')", "# LUOGU_RID: 116645376\na=int(input())\r\nif -128<a<128:\r\n print('byte')\r\nelif -32768<a<32768:\r\n print('short')\r\nelif -2147483648<a<2147483648:\r\n print('int')\r\nelif -9223372036854775808<a<9223372036854775808:\r\n print('long')\r\nelse:\r\n print('BigInteger')\r\n", "n = int(input())\r\n\r\nif n < 128:\r\n print(\"byte\")\r\nelif n < 32768:\r\n print(\"short\")\r\nelif n < 2147483648:\r\n print(\"int\")\r\nelif n < 9223372036854775808:\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")\r\n", "n=int(input())\r\nif(n>=(-128) and n<=127):\r\n print(\"byte\")\r\nelif(n>=(-32768) and n<=32767):\r\n print(\"short\")\r\nelif(n>=(-2147483648) and n<=2147483647):\r\n print(\"int\")\r\nelif(n>=(-9223372036854775808) and n<=9223372036854775807):\r\n print(\"long\")\r\nelif(n>9223372036854775807):\r\n print(\"BigInteger\")\r\n\r\n\r\n", "a=int(input()) \r\nif a > -128 and a < 128: \r\n print('byte')\r\nelif a > -32768 and a < 32768:\r\n print('short')\r\nelif a > -2147483648 and a < 2147483648:\r\n print('int')\r\nelif a > -9223372036854775808 and a < 9223372036854775808:\r\n print('long')\r\nelse:\r\n print('BigInteger')", "import sys\n\nn = int(input())\n\nif(n<128 and n>=-128):\n print(\"byte\")\nelif(n<32768 and n>=-32768):\n print(\"short\")\nelif(n<2147483648 and n>=-2147483648):\n print(\"int\")\nelif(n<9223372036854775808 and n>=-9223372036854775808):\n print(\"long\")\nelse:\n print(\"BigInteger\")\n\n \t \t \t\t\t\t\t \t \t\t\t\t\t \t \t\t \t", "num=int(input())\n\nif num>=-128 and num <=127:\n print(\"byte\")\nelif num>=-32768 and num <=32767:\n print(\"short\")\nelif num>=- 2147483648 and num <= 2147483647:\n print(\"int\")\nelif num>=- 9223372036854775808 and num <= 9223372036854775807:\n print(\"long\")\nelse:\n print(\"BigInteger\")\n\t \t \t \t \t \t \t\t\t \t \t \t\t", "n=int(input())\r\nif n in range(-128,128):\r\n print(\"byte\")\r\nelif n in range(-32768,32768):\r\n print(\"short\")\r\nelif n in range(-2147483648,2147483648):\r\n print(\"int\")\r\nelif n in range(-9223372036854775808,9223372036854775808 ):\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")", "#ROUNIAAUDI\r\nnum1=int(input())\r\nset1=(('byte',7),\r\n ('short', 15),\r\n ('int',31),\r\n ('long',63),\r\n ('BigInteger',1000))\r\nfor a,b in set1:\r\n if num1<=2**b-1:\r\n print(a)\r\n break\r\n\r\n", "num = int(input())\r\nif -128<=num<=127:\r\n print(\"byte\")\r\nelif -32768<=num<=32767:\r\n print(\"short\")\r\nelif -2147483648<=num<=2147483647:\r\n print(\"int\") \r\nelif -9223372036854775808<=num<=9223372036854775807:\r\n print(\"long\")#- 9223372036854775808 to 9223372036854775807\r\nelse:\r\n print(\"BigInteger\")", "import sys\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\na = inpu().rstrip('\\n')\r\nl = len(a)\r\nif a[0] == \"-\" :\r\n if '0'*(4 - l) + a[1:] <= '0'*(l - 4) + \"128\" :\r\n prin(\"byte\\n\")\r\n elif '0'*(6 - l) + a[1:] <= '0'*(l - 6) + \"32768\" :\r\n prin(\"short\\n\")\r\n elif '0'*(len(\"2147483647\") + 1 - l) + a[1:] <= '0'*(l - 1 - len(\"2147483648\")) + \"2147483648\" :\r\n prin(\"int\\n\")\r\n elif '0'*(len(\"9223372036854775807\") + 1 - l) + a[1:] <= '0'*(l - 1 - len(\"9223372036854775808\")) + \"9223372036854775808\" :\r\n prin(\"long\\n\")\r\n else :\r\n prin(\"BigInteger\\n\")\r\nelse :\r\n if '0'*(3 - l) + a <= '0'*(l - 3) + \"127\" :\r\n prin(\"byte\\n\")\r\n elif '0'*(5 - l) + a <= '0'*(l - 5) + \"32767\" :\r\n prin(\"short\\n\")\r\n elif '0'*(len(\"2147483647\") - l) + a <= '0'*(l - len(\"2147483647\")) + \"2147483647\" :\r\n prin(\"int\\n\")\r\n elif '0'*(len(\"9223372036854775807\") - l) + a <= '0'*(l - len(\"9223372036854775807\")) + \"9223372036854775807\" :\r\n prin(\"long\\n\")\r\n else :\r\n prin(\"BigInteger\\n\")", "n = int(input()) \n\nif (n <= 127):\n print(\"byte\")\n exit()\nelif (n <= 32767):\n print(\"short\")\n exit()\nelif (n <= 2147483647):\n print(\"int\")\n exit()\nelif (n <= 9223372036854775807):\n print(\"long\")\n exit()\nelse:\n print(\"BigInteger\")\n \t\t \t \t\t \t \t\t\t \t\t \t \t\t\t\t\t", "n = int(input())\nif n<128:\n print(\"byte\")\nelif n<32768:\n print(\"short\")\nelif n<2147483648:\n print(\"int\")\nelif n<9223372036854775808:\n print(\"long\")\nelse:\n print(\"BigInteger\")\n\t\t\t \t \t\t\t\t \t\t \t \t\t \t\t \t", "n = int(input())\nif -128 <= n <= 127: print(\"byte\")\nelif -32768 <= n <= 32767: print(\"short\")\nelif -2147483648 <= n <= 2147483647: print(\"int\")\nelif -9223372036854775808 <= n <= 9223372036854775807: print(\"long\")\nelse: print(\"BigInteger\")\n\t \t \t \t \t \t\t \t \t \t \t \t\t", "n = int(input())\nif n > 2**63 - 1:\n\tprint(\"BigInteger\")\nelif n > 2**31 - 1:\n\tprint(\"long\")\nelif n > 2**15 - 1:\n\tprint(\"int\")\nelif n > 2**7 - 1:\n\tprint(\"short\")\nelse:\n\tprint(\"byte\")\n \t\t\t \t\t \t \t\t \t\t\t \t\t\t", "import io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn = int(input().decode())\r\nif(n>=-128 and n<=127):\r\n\tprint(\"byte\")\r\nelif(n>=-32768 and n<=32767):\r\n\tprint(\"short\")\r\nelif(n>=-2147483648 and n<=2147483647):\r\n\tprint(\"int\")\r\nelif(n>=-9223372036854775808 and n<=9223372036854775807):\r\n\tprint(\"long\")\r\nelse:\r\n\tprint(\"BigInteger\")", "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\nif -128 <= n <= 127:\r\n print('byte')\r\nelif -32768 <= n <= 32767:\r\n print('short')\r\nelif -2147483648 <= n <= 2147483647:\r\n print('int')\r\nelif -9223372036854775808 <= n <= 9223372036854775807:\r\n print('long')\r\nelse:\r\n print('BigInteger')\r\n", "n = int(input())\n\ntype_byte = [-128, 127]\ntype_short = [-32768, 32767]\ntype_int = [-2147483648, 2147483647]\ntype_long = [-9223372036854775808, 9223372036854775807]\n\n\ndef isIn(n, lst):\n return (n <= lst[1] and n >= lst[0])\n\n\nif isIn(n, type_byte):\n print('byte')\nelif isIn(n, type_short):\n print('short')\nelif isIn(n, type_int):\n print('int')\nelif isIn(n, type_long):\n print('long')\nelse:\n print('BigInteger')\n\n\t \t\t\t \t\t \t\t\t \t\t \t \t\t\t\t\t \t\t", "#Python\ns=int(input())\nif s>=-128 and s<=127:\n print(\"byte\")\nelif s>=-32768 and s<=32767:\n print(\"short\")\nelif s>=-2147483648 and s<=2147483647:\n print(\"int\")\nelif s>=-9223372036854775808 and s<=9223372036854775807:\n print(\"long\")\nelse:\n print(\"BigInteger\")", "\"\"\"\nBrandt Smith, Lemuel Gorion and Peter Haddad\n\ncodeforces.com\n\nProblem 66A\n\"\"\"\n\nn = int(input())\n\nbits = len(bin(n)) - 2\n\nif(bits < 8):\n print('byte')\nelif(bits < 16):\n print('short')\nelif(bits < 32):\n print('int')\nelif(bits < 64):\n print('long')\nelse:\n print('BigInteger')\n \n", "q = int(input())\n\nif q >= -128 and q <= 127:\n print(\"byte\")\nelif q >=-32768 and q<=32767:\n print(\"short\")\nelif q>= -2147483648 and q<= 2147483647:\n print(\"int\")\nelif q>=-9223372036854775808 and q<=9223372036854775807:\n print(\"long\")\n\nelse:\n print(\"BigInteger\")\n\n\t \t\t\t \t \t\t\t \t\t\t \t\t\t \t\t\t \t \t\t\t", "n=int(input())\r\nif(n<=127):\r\n\tprint(\"byte\")\r\nelif(n<=32767):\r\n\tprint(\"short\")\r\nelif(n<=2147483647):\r\n\tprint(\"int\")\r\nelif(n<=9223372036854775807):\r\n\tprint(\"long\")\r\nelse:\r\n\tprint(\"BigInteger\")", "u = int(input())\r\nif u < 128:\r\n print('byte')\r\nelif u < 32768:\r\n print('short')\r\nelif u < 2147483648:\r\n print('int')\r\nelif u < 9223372036854775808:\r\n print('long')\r\nelse:\r\n print('BigInteger')", "from math import log\r\nx=int(input())\r\nif -128<=x<=127:\r\n\tprint('byte')\r\nelif (-1)*32768<=x<=32767:\r\n\tprint('short')\r\nelif -2147483648<=x<=2147483647:\r\n\tprint('int')\r\nelif -9223372036854775808<=x<=9223372036854775807:\r\n\tprint('long')\r\nelse:\r\n\tprint('BigInteger')", "from random import *\nfrom math import *\n\nn=eval(input())\nif -127<=n<=127:\n print('byte')\nelif -32768<=n<= 32767:\n print('short')\nelif -2147483648<=n<=2147483647:\n print('int')\nelif -9223372036854775808<=n<=9223372036854775807:\n print('long')\nelse:\n print('BigInteger');\n\n\n\n \t \t \t \t\t\t\t\t \t\t\t \t\t \t\t\t \t\t", "k = int(input()) #INTEIRO?\nans=''\nif k >= -128 and k<=127: ans='byte'\nelif k >= -32768 and k<=32767: ans='short'\nelif k >= -2147483648 and k<=2147483647: ans='int'\nelif k >= -9223372036854775808 and k<= 9223372036854775807: ans='long'\nelse: ans = 'BigInteger'\nprint(ans)\n\n \t \t\t\t \t \t\t\t \t \t\t \t\t", "n = int(input())\r\nif n < -9223372036854775808 or n > 9223372036854775807:\r\n print(\"BigInteger\")\r\nelif n < -2147483648 or n > 2147483647:\r\n print(\"long\")\r\nelif n < -32768 or n > 32767:\r\n print(\"int\")\r\nelif n < -128 or n > 127:\r\n print(\"short\")\r\nelse:\r\n print(\"byte\")", "num = int(input())\r\nn = [\"byte\",\"short\",\"int\",\"long\",\"BigInteger\"]\r\ni=0\r\nif(num<0): num = abs(num+1)\r\nif(num<=127): print(n[0])\r\nelif(num<=32767): print(n[1])\r\nelif(num<=2147483647): print(n[2])\r\nelif(num<=9223372036854775807): print(n[3])\r\nelse: print(n[4])# 1697818099.9983222", "a=int(input())\r\nb=-2147483648\r\nc=- 9223372036854775808\r\nif (a>=-128 and a<=127):\r\n print(\"byte\\n\")\r\nelif (a>=-32768 and a<=32767):\r\n print(\"short\\n\")\r\nelif (a>= b and a<=2147483647):\r\n print(\"int\\n\")\r\nelif (a>= c and a<=9223372036854775807):\r\n print(\"long\\n\")\r\nelse:\r\n print(\"BigInteger\\n\")", "n=int(input())\r\ns=\"byte\"\r\nif n>127:s=\"short\"\r\nif n>32767:s=\"int\"\r\nif n>=2**31:s=\"long\"\r\nif n>=2**63:s=\"BigInteger\"\r\nprint(s)\r\n", "a=int(input())\r\n \r\nif -128<=a<=127:\r\n\tprint (\"byte\")\r\nelif -32768<=a<=32767:\r\n\tprint (\"short\")\r\nelif -2147483648<=a<=2147483647:\r\n\tprint (\"int\")\r\nelif -9223372036854775808<=a<=9223372036854775807:\r\n\tprint (\"long\")\r\nelse:\r\n\tprint (\"BigInteger\")\r\n", "n=eval(input())\r\nif -128<=n<=127:\r\n print(\"byte\")\r\nelif -32768<=n<=32767:\r\n print(\"short\")\r\nelif -2147483648<=n<=2147483647:\r\n print(\"int\")\r\nelif -9223372036854775808<=n<=9223372036854775807:\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")", "a = int(input())\nif -128<=a<=127:\n print(\"byte\")\nelif -32768<=a<= 32767:\n print(\"short\")\nelif -2147483648 <=a<= 2147483647:\n print(\"int\")\nelif -9223372036854775808 <=a<= 9223372036854775807:\n print(\"long\")\nelse:\n print(\"BigInteger\")\n\t \t\t \t \t\t\t\t \t \t \t \t", "n = int(input())\r\nif n in range(-128, 128):\r\n print(\"byte\")\r\nelif n in range(-32768, 32768):\r\n print(\"short\")\r\nelif n in range(-2147483648 , 2147483648 ):\r\n print(\"int\")\r\nelif n in range(-9223372036854775808 , 9223372036854775808):\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")", "# Parse the input\r\nn = int(input())\r\n\r\n# Check which data type can store the given number\r\nif n >= -128 and n <= 127:\r\n # The byte data type can store numbers from -128 to 127\r\n print(\"byte\")\r\nelif n >= -32768 and n <= 32767:\r\n # The short data type can store numbers from -32768 to 32767\r\n print(\"short\")\r\nelif n >= -2147483648 and n <= 2147483647:\r\n # The int data type can store numbers from -2147483648 to 2147483647\r\n print(\"int\")\r\nelif n >= -9223372036854775808 and n <= 9223372036854775807:\r\n # The long data type can store numbers from -9223372036854775808 to 9223372036854775807\r\n print(\"long\")\r\nelse:\r\n # The BigInteger data type can store any integer number\r\n print(\"BigInteger\")", "x = int(input())\r\nnames = [\"byte\", \"short\", \"int\", \"long\"]\r\n\r\np = 8;\r\n\r\nfor s in names:\r\n l = -(2**(p - 1))\r\n r = (2**(p - 1)) - 1;\r\n if ((l <= x) and (x <= r)): \r\n print(s);\r\n exit();\r\n p *= 2;\r\n \r\nprint(\"BigInteger\");", "p=input()\r\na=int(p)\r\nif((a>=-128)&(a<=127)):\r\n print(\"byte\");\r\nelif((a>=-32768)&(a<=32767)):\r\n print(\"short\");\r\n\r\nelif((a>=-2147483648)&(a<=2147483647)):\r\n print(\"int\");\r\nelif((a>=-9223372036854775808)&(a<=9223372036854775807)):\r\n print(\"long\");\r\n\r\nelse:\r\n print(\"BigInteger\")\r\n", "bits = len(bin(int(input()))) - 2\r\n\r\nprint('byte' if bits < 8 else 'short' if bits < 16 else\r\n 'int' if bits < 32 else 'long' if bits < 64 else 'BigInteger')", "x=int(input())\nif x>=-128 and x<=127:\n print(\"byte\")\nelif x>= -32768 and x <=32767:\n print(\"short\")\nelif x>= -2147483648 and x<=2147483647:\n print(\"int\")\nelif x>=-9223372036854775808 and x<=9223372036854775807:\n print(\"long\")\nelse:\n print(\"BigInteger\")\n\n \t\t \t \t\t\t\t \t\t \t \t \t\t", "x=int(input())\r\nif(x<=127 and x>=-128):\r\n print(\"byte\")\r\nelif(x<=32767 and x>= -32768):\r\n print(\"short\")\r\nelif(x<=2147483647 and x>= -2147483648 ):\r\n print(\"int\") \r\nelif(x<=9223372036854775807 and x>= -9223372036854775808 ):\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\") ", "n = int(input())\n\nif n >= -128 and n <= 127: answer = 'byte'\nelif n >= -32768 and n <= 32767: answer = 'short'\nelif n >= -2147483648 and n <= 2147483647: answer = 'int'\nelif n >= -9223372036854775808 and n <= 9223372036854775807: answer = 'long'\nelse: answer = 'BigInteger'\n\nprint(answer)", "n=int(input())\n\nif n>=-128 and n<=127:\n\tprint('byte')\nelif n>=-32768 and n<=32767:\n\tprint('short')\nelif n>=-2147483648 and n<=2147483647:\n\tprint('int')\nelif n>=-9223372036854775808 and n<=9223372036854775807:\n\tprint('long')\nelse:\n\tprint('BigInteger')", "\r\nvalores_maximos = ['127','32767','2147483647','9223372036854775807']\r\ntipos = ['byte','short','int','long','BigInteger']\r\nrespuesta = 'BigInteger'\r\n\r\nn = input()\r\n\r\ni = 0\r\nwhile i < len(valores_maximos):\r\n if len(n) < len(valores_maximos[i]):\r\n respuesta = tipos[i]\r\n break\r\n elif len(n) == len(valores_maximos[i]):\r\n if n <= valores_maximos[i]:\r\n respuesta = tipos[i]\r\n break\r\n else:\r\n respuesta = tipos[i+1]\r\n break\r\n i = i+1\r\n\r\nprint(respuesta)", "def petya_and_java(n):\n if (n >= -128 and n <= 127):\n return 'byte'\n \n if (n >= -32768 and n <= 32767):\n return 'short'\n \n if (n >= -2147483648 and n <= 2147483647):\n return 'int'\n\n if (n >= -9223372036854775808 and n <= 9223372036854775807):\n return 'long'\n \n return 'BigInteger'\n\n# Inputs\nn = int(input())\nprint(petya_and_java(n))\n\t \t\t\t \t \t\t \t \t\t \t \t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nu = [127, 32767, 2147483647, 9223372036854775807]\r\nv = [\"byte\", \"short\", \"int\", \"long\"]\r\nans = \"BigInteger\"\r\nfor i in range(4):\r\n if -u[i] - 1 <= n <= u[i]:\r\n ans = v[i]\r\n break\r\nprint(ans)", "n = int(input())\r\n\r\nif n in range(-128 ,127+1 ):\r\n print('byte')\r\n\r\nelif n in range(-32768 , 32767+1):\r\n print('short')\r\n\r\nelif n in range(-2147483648 , 2147483647+1):\r\n print('int ')\r\n\r\nelif n in range(-9223372036854775808 , 9223372036854775807+1):\r\n print('long')\r\n\r\nelse:\r\n print('BigInteger')\r\n\r\n\r\n\r\n", "istr = input()\n\npos = [\"127\", \"32767\", \"2147483647\", \"9223372036854775807\"]\nif(len(istr) < 3):\n\tprint(\"byte\")\nelif(len(istr) == 3):\n\tif(istr > pos[0]):\n\t\tprint(\"short\")\n\telse:\n\t\tprint(\"byte\")\nelif(len(istr) == 4):\n\tprint(\"short\")\nelif(len(istr) == 5):\n\tif(istr > pos[1]):\n\t\tprint(\"int\")\n\telse:\n\t\tprint(\"short\")\nelif(len(istr) < 10):\n\tprint(\"int\")\nelif(len(istr) == 10):\n\tif(istr > pos[2]):\n\t\tprint(\"long\")\n\telse:\n\t\tprint(\"int\")\nelif(len(istr) < 19):\n\tprint(\"long\")\nelif(len(istr) == 19):\n\tif(istr > pos[3]):\n\t\tprint(\"BigInteger\")\n\telse:\n\t\tprint(\"long\")\nelse:\n\tprint(\"BigInteger\")", "s=input()\r\nfrom sys import exit\r\nleng=len(s)\r\nif s[0]=='-':\r\n s=s[1:]\r\n if leng<3:print('byte');exit()\r\n if leng==3 and s<='128':print('byte');exit()\r\n if leng<5:print('short');exit()\r\n if leng==5 and s<='32768':print('short');exit()\r\n if leng<10:print('int');exit()\r\n if leng==10 and s<='2147483648':print('int');exit()\r\n if leng<19:print('long');exit()\r\n if leng==19 and s<='9223372036854775808':print('long');exit()\r\n print('BigInteger')\r\nelse:\r\n if leng<3:print('byte');exit()\r\n if leng==3 and s<='127':print('byte');exit()\r\n if leng<5:print('short');exit()\r\n if leng==5 and s<='32767':print('short');exit()\r\n if leng<10:print('int');exit()\r\n if leng==10 and s<='2147483647':print('int');exit()\r\n if leng<19:print('long');exit()\r\n if leng==19 and s<='9223372036854775807':print('long');exit()\r\n print('BigInteger')", "# https://codeforces.com/problemset/problem/66/A\r\n\r\ndef func_sol(lines):\r\n n = int(lines[0])\r\n if -128 <= n <= 127:\r\n return 'byte'\r\n if -32768 <= n <= 32767:\r\n return 'short'\r\n if -2147483648 <= n <= 2147483647:\r\n return 'int'\r\n if -9223372036854775808 <= n <= 9223372036854775807:\r\n return 'long'\r\n return 'BigInteger'\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read().split('\\n')[:-1]))\r\n\r\n\r\nmain()\r\n", "number = int(input())\n\nif(number <= 127):\n print(\"byte\")\nelif(number <= 32767):\n print(\"short\")\nelif(number<=2147483647):\n print(\"int\")\nelif(number<=9223372036854775807):\n print(\"long\")\nelse:\n print(\"BigInteger\")\n\n\t\t \t\t \t\t \t\t\t\t \t\t \t\t\t\t\t \t\t\t\t\t\t\t", "def main():\r\n n = int(input())\r\n if -128 <= n <= 127:\r\n print(\"byte\")\r\n elif -32768 <= n <= 32767:\r\n print(\"short\")\r\n elif -2147483648 <= n <= 2147483647:\r\n print(\"int\")\r\n elif -9223372036854775808 <= n <= 9223372036854775807:\r\n print(\"long\")\r\n else:\r\n print(\"BigInteger\")\r\n #define INT8_MIN (-128)\r\n #define INT16_MIN (-32768)\r\n #define INT32_MIN (-2147483647 - 1)\r\n #define INT64_MIN (-9223372036854775807LL - 1)\r\n\r\n #define INT8_MAX 127\r\n #define INT16_MAX 32767\r\n #define INT32_MAX 2147483647\r\n #define INT64_MAX 9223372036854775807LL\r\n\r\nif __name__ == '__main__':\r\n main()", "b = [1, 2, 4, 8]\r\nnm = ['byte', 'short', 'int', 'long']\r\nn = int(input())\r\nfor bi, nmi in zip(b, nm):\r\n maxv = 2 ** (8 * bi - 1)\r\n if n >= -maxv and n < maxv:\r\n print(nmi), exit()\r\nprint('BigInteger')", "import math\r\nn =eval( input())\r\nn = abs(n)\r\nif n>=0 and n<=127:\r\n print(\"byte\")\r\nelif n>127 and n<=32767:\r\n print(\"short\")\r\nelif n>32767 and n<=2147483647:\r\n print(\"int\")\r\nelif n>2147483647 and n<=9223372036854775807:\r\n print(\"long\")\r\nelse: print(\"BigInteger \")\r\n\r\n", "n = input()\nif len(n) <= 3 and int(n) <= 127:\n print('byte')\nelif len(n) <= 4 and abs(int(n)) <= 128 and int(n) < 0:\n print('byte')\nelif 3 <= len(n) <= 5 and 128 <= int(n) <= 32767:\n print('short')\nelif 4 <= len(n) <= 6 and abs(int(n)) <= 32767 and int(n) < 0:\n print('short')\nelif 5 <= len(n) <= 10 and 32767 <= int(n) <= 2147483647:\n print('int')\nelif 6 <= len(n) <= 11 and abs(int(n)) <= 2147483647 and int(n) < 0:\n print('int')\nelif 10 <= len(n) <= 19 and 2147483647 <= int(n) <= 9223372036854775807:\n print('long')\nelif 11 <= len(n) <= 20 and abs(int(n)) <= 9223372036854775807 and int(n) < 0:\n print('long')\nelse:\n print('BigInteger')\n", "n = int(input())\nif n<128:\n print('byte')\nelif n>=128 and n<=32767:\n print('short')\nelif n>32767 and n<=2147483647:\n print('int')\n\nelif n>2147483647 and n<=9223372036854775807:\n print('long')\nelse:\n print('BigInteger')\n", "def solve(n):\r\n if n <= 127:\r\n return 'byte'\r\n if n <= 32767:\r\n return 'short'\r\n if n <= 2147483647:\r\n return 'int'\r\n if n <= 9223372036854775807:\r\n return 'long'\r\n return 'BigInteger'\r\n\r\n\r\nx = int(input())\r\nprint(solve(x))\r\n", "# import sys\n# sys.stdin=open('input.txt', 'r')\n# sys.stdout=open('output.txt', 'w')\n\nn=int(input())\nif -128<=n<=127:\n print('byte')\nelif -32768<=n<=32767:\n print('short')\nelif -2147483648<=n<=2147483647:\n print('int')\nelif -9223372036854775808<=n<=9223372036854775807:\n print('long')\nelse:\n print('BigInteger')", "l=list(input())\r\nif(len(l)<=3 and int(\"\".join(l))>(-129) and int(\"\".join(l))<=127):\r\n print(\"byte\")\r\nelif(len(l)<=5 and int(\"\".join(l))>(-32769) and int(\"\".join(l))<=32767):\r\n print(\"short\")\r\nelif(len(l)<=10 and int(\"\".join(l))>(-2147483649) and int(\"\".join(l))<=2147483647):\r\n print(\"int\")\r\nelif(len(l)<=19 and int(\"\".join(l))>(-9223372036854775809 ) and int(\"\".join(l))<=9223372036854775807 ):\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")\r\n", "n=int(input())\r\nif n>=-(1<<7) and n<(1<<7):\r\n\tprint('byte')\r\nelif n>=-(1<<15) and n<(1<<15):\r\n\tprint('short')\r\nelif n>=-(1<<31) and n<(1<<31):\r\n\tprint('int')\r\nelif n>=-(1<<63) and n<(1<<63):\r\n\tprint('long')\r\nelse:\r\n\tprint('BigInteger')\r\n", "x = int(input())\nif x < 128:\n\tprint(\"byte\")\nelif x < 32768:\n\tprint(\"short\")\nelif x <= 2147483647:\n\tprint(\"int\")\nelif x <= 9223372036854775807:\n\tprint(\"long\")\nelse:\n\tprint(\"BigInteger\")\n \t \t\t \t \t\t \t \t\t\t \t\t\t \t", "x = int(input())\r\nif x < 0 :\r\n x = x * - 1 - 1\r\nif x < 128 :\r\n print(\"byte\")\r\nelif x < 32768 :\r\n print(\"short\")\r\nelif x < 2147483648 :\r\n print(\"int\")\r\nelif x < 9223372036854775808 :\r\n print(\"long\")\r\nelse :\r\n print(\"BigInteger\")", "a = -128\r\nb = 127\r\nc = -32768\r\nd = 32767\r\ne = -2147483648\r\nf = 2147483647\r\ng = -9223372036854775808\r\nh = 9223372036854775807\r\n\r\nn = int(input())\r\n\r\nif(n >= a and n <= b):\r\n print(\"byte\")\r\nelif(n >= c and n <= d):\r\n print(\"short\")\r\nelif(n >= e and n <= f):\r\n print(\"int\")\r\nelif(n >= g and n <= h):\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")\r\n ", "n = int(input())\ns = bin(n)\ntam = len(s) - 2\n\nif tam < 8:\n ans = \"byte\"\nelif tam < 16:\n ans = \"short\"\nelif tam < 32:\n ans = \"int\"\nelif tam < 64:\n ans = \"long\"\nelse:\n ans = \"BigInteger\"\n\nprint(ans)\n\t \t \t\t \t \t\t \t \t \t \t \t \t\t", "num = int(input());\r\nlong = len(str(abs(num)));\r\nif(num<0): num = abs(num+1);\r\nif(num<=127): print(\"byte\");\r\nelse:\r\n if(num<=32767):print(\"short\");\r\n else:\r\n if( num<=2147483647):print(\"int\");\r\n else:\r\n if(num<=9223372036854775807):print(\"long\");\r\n else:print(\"BigInteger\");\r\n\r\n", "import sys \nn = int(sys.stdin.readline()[:-1])\nn = abs(n)\nif(n <= 127):\n\tprint(\"byte\")\nelif(n <= 32767):\n\tprint(\"short\")\nelif(n <= 2147483647):\n\tprint(\"int\")\nelif(n <= 9223372036854775807):\n\tprint(\"long\")\nelse:\n\tprint(\"BigInteger\")\n\t \t \t \t\t\t\t \t \t\t \t \t \t", "n = int(input())\r\nif n <= 127 and n >= -128 :\r\n print(\"byte\")\r\nelif n <= 32767 and n >= -32768 :\r\n print(\"short\")\r\nelif n <= 2147483647 and n >= -2147483648 :\r\n print(\"int\")\r\nelif n <= 9223372036854775807 and n >= -9223372036854775808 :\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n'''\r\n1) byte occupies 1 byte and allows you to store numbers from  - 128 to 127\r\n\r\n2) short occupies 2 bytes and allows you to store numbers from  - 32768 to 32767\r\n\r\n3) int occupies 4 bytes and allows you to store numbers from  - 2147483648 to 2147483647\r\n\r\n4) long occupies 8 bytes and allows you to store numbers from  - 9223372036854775808 to 9223372036854775807\r\n\r\n5) BigInteger can store any integer number, but at that it is not a primitive type, and operations with it are much slower.\r\n\r\n\r\n'''", "value = int(input())\n\nif value < 128:\n\tprint('byte')\nelif value < 32768:\n\tprint('short')\nelif value < 2147483648:\n\tprint('int')\nelif value < 9223372036854775808:\n\tprint('long')\nelse:\n\tprint('BigInteger')\n \t\t\t \t\t \t \t \t \t \t\t \t \t\t", "import math as m\r\nimport decimal\r\n \r\nt = (int)(input())\r\n \r\nif -128 <= t and t <= 127:\r\n\tprint(\"byte\")\r\nelif -32768 <= t and t <= 32767:\r\n\tprint(\"short\")\r\nelif -2147483648 <= t and t <= 2147483647:\r\n\tprint(\"int\")\r\nelif -9223372036854775808 <= t and t <= 9223372036854775807:\r\n\tprint(\"long\")\r\nelse:\r\n\tprint(\"BigInteger\")", "x=int(input())\r\nif -128<=x and x<=127:\r\n\tprint('byte')\r\nelif -32768<=x and x<=32767:\r\n\tprint('short')\r\nelif -2147483648<=x and x<=2147483647:\r\n\tprint('int')\r\nelif -9223372036854775808<=x and x<=9223372036854775807:\r\n\tprint('long')\r\nelse:\r\n\tprint('BigInteger')", "i = int(input())\r\n\r\nif i <= 127 and i >= -128:\r\n print(\"byte\")\r\n \r\nelif i <= 32767 and i >= -32768:\r\n print(\"short\")\r\n \r\nelif i <= 2147483647 and i >= -2147483648:\r\n print(\"int\")\r\n\r\nelif i <= 9223372036854775807 and i >= -9223372036854775808:\r\n print(\"long\")\r\n \r\nelse:\r\n print(\"BigInteger\")", "import sys\nbounds = [127, 32767, 2147483647, 9223372036854775807]\nnames = [\"byte\", \"short\", \"int\", \"long\", \"BigInteger\"]\nn = sys.stdin.readline().rstrip(\"\\n\")\nnLength = len(n)\nn = int(n)\nif nLength > 19:\n print(names[4])\n exit()\nfor i in range(4):\n if n <= bounds[i]:\n print(names[i])\n exit()\nprint(names[4])\n\t \t\t \t\t\t\t \t\t \t \t \t \t\t \t \t\t\t", "n1=input()\r\nn1=int(n1)\r\nif(n1<= 127 and n1>= -127):\r\n print(\"byte\")\r\nelif(n1<=32767 and n1>=-32767):\r\n print('short')\r\nelif (n1 <= 2147483647 and n1 >= -2147483648):\r\n print('int')\r\nelif (n1 <= 9223372036854775807 and n1 >= -9223372036854775807):\r\n print('long')\r\nelse:\r\n print(\"BigInteger \")\r\n\r\n", "n=int(input())\r\nif -(2**7)<=n<=2**7-1:\r\n print(\"byte\")\r\nelse:\r\n if -(2**15)<=n<=2**15-1:\r\n print(\"short\")\r\n else:\r\n if -(2**31)<=n<=2**31-1:\r\n print(\"int\")\r\n else:\r\n if -(2**63)<=n<=2**63-1:\r\n print(\"long\")\r\n else:\r\n print(\"BigInteger\")", "def validacion(nume):\r\n if nume>=-128 and nume<=127:\r\n return \"byte\"\r\n elif nume>=-32768 and nume<=32767 and nume>127 and nume>-128:\r\n return \"short\"\r\n elif nume>=-2147483648 and nume<=2147483647 and nume>32767 and nume>-32768:\r\n return \"int\"\r\n elif nume>=-9223372036854775808 and nume<=9223372036854775807 and nume>-2147483648 and nume>2147483647:\r\n return \"long\"\r\n else:\r\n return \"BigInteger\"\r\n\r\nwhile True:\r\n try:\r\n num=int(input())\r\n print (validacion(num))\r\n except:\r\n break", "a=int(input())\n\n\nif(-128<=a<=127):\n print('byte')\nelif(-32768<=a<=32767):\n print('short')\nelif(-2147483648<=a<=2147483647):\n print('int')\nelif(-9223372036854775808<=a<=9223372036854775807):\n print('long')\nelse:\n print('BigInteger')\n\n \t\t\t \t\t \t\t\t\t\t\t\t \t \t\t \t\t \t", "def main():\r\n n=int(input())\r\n if n>=-128 and n<= 127:\r\n print('byte')\r\n elif n>=-32768 and n<=32767:\r\n print('short')\r\n elif n>=-2147483648 and n<=2147483647:\r\n print('int')\r\n elif n>=-2**63 and n<=2**63-1:\r\n print('long')\r\n else:\r\n print('BigInteger')\r\nmain()", "a=int(input())\nb=-2147483648\nc=- 9223372036854775808\nif (a>=-128 and a<=127):\n print(\"byte\\n\")\nelif (a>=-32768 and a<=32767):\n print(\"short\\n\")\nelif (a>= b and a<=2147483647):\n print(\"int\\n\")\nelif (a>= c and a<=9223372036854775807):\n print(\"long\\n\")\nelse:\n print(\"BigInteger\\n\")\n\n \t \t\t\t \t\t\t \t \t\t \t \t \t\t \t\t \t", "n = int(input())\n\nif n <= 127:\n\tprint('byte')\n\nelif n <= 32767:\n\tprint('short')\n\nelif n <= 2147483647:\n\tprint('int')\n\nelif n <= 9223372036854775807:\n\tprint('long')\n\nelse:\n\tprint('BigInteger')\n\t\t\t\t \t\t \t\t\t\t \t \t \t \t", "n = int(input())\n\nif n >= - 2 ** 7 and n < 2 ** 7:\n print(\"byte\")\nelif n >= - 2 ** 15 and n < 2 ** 15:\n print(\"short\")\nelif n >= - 2 ** 31 and n < 2 ** 31:\n print(\"int\")\nelif n >= - 2 ** 63 and n < 2 ** 63:\n print(\"long\")\nelse:\n print(\"BigInteger\")\n\n\n \t\t \t\t\t \t \t \t \t\t \t \t \t\t\t", "n = int(input())\r\n\r\nif (n <= 127 and n >= -128):\r\n print('byte')\r\nelif (n <= 32767 and n >= -32768):\r\n print('short')\r\nelif (n <= 2147483647 and n >= -2147483648):\r\n print('int')\r\nelif (n <= 9223372036854775807 and n >= -9223372036854775808):\r\n print('long')\r\nelse:\r\n print('BigInteger')\r\n", "n = int (input())\r\n\r\nif (n >= -128 and n <= 127):\r\n print (\"byte\")\r\nelif (n >= -32768 and n <= 32767):\r\n print (\"short\")\r\nelif (n >= -2147483648 and n <= 2147483647):\r\n print (\"int\")\r\nelif (n >= -9223372036854775808 and n <= 9223372036854775807):\r\n print (\"long\")\r\nelse:\r\n print (\"BigInteger\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 10 20:28:35 2020\r\n\r\n@author: Equipo\r\n\"\"\"\r\n# Python program to convert decimal to binary \r\n \r\n# Function to convert Decimal number \r\n# to Binary number \r\ndef decimalToBinary(n): \r\n return bin(n).replace(\"0b\", \"\") \r\n \r\n# Driver code \r\nif __name__ == '__main__': \r\n n = int(input())\r\n n_bits = decimalToBinary(n)\r\n\r\n if (n == -128):\r\n print(\"byte\")\r\n elif (n == -32768):\r\n print(\"short\")\r\n elif (n == -2147483648):\r\n print(\"int\")\r\n elif (n == -9223372036854775808):\r\n print(\"long\")\r\n elif (len(n_bits)<8):\r\n print(\"byte\")\r\n elif (len(n_bits)<16):\r\n print(\"short\")\r\n elif (len(n_bits)<32):\r\n print(\"int\")\r\n elif (len(n_bits)<64):\r\n print(\"long\")\r\n else:\r\n print(\"BigInteger\")", "number=int(input())\r\nif(number>=-128 and number<=127):\r\n print(\"byte\")\r\nelif(number >=-32768 and number<=32767):\r\n print(\"short\")\r\nelif(number>= -2147483648 and number<=2147483647):\r\n print(\"int\")\r\nelif(number>=-9223372036854775808 and number<=9223372036854775807):\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")\r\n", "n = int(input())\r\nans = 'byte'\r\nif n > 127:\r\n ans = 'short'\r\nif n > 32767:\r\n ans = 'int'\r\nif n > 2147483647:\r\n ans = 'long'\r\nif n > 9223372036854775807:\r\n ans = 'BigInteger'\r\nprint(ans)", "t = int(input())\r\nif (t>=-128 and t<=127):\r\n print(\"byte\")\r\nelif(t>=-32768 and t<=32767):\r\n print(\"short\")\r\nelif(t>=-2147483648 and t<=2147483647):\r\n print(\"int\")\r\nelif(t>=-9223372036854775808 and t<=9223372036854775807):\r\n print(\"long\") \r\nelse:\r\n print(\"BigInteger\")", "#B - Petya and Java\ninpt = int(input())\nif inpt > 9223372036854775807:\n print(\"BigInteger\")\nelif inpt > 2147483647:\n print(\"long\")\nelif inpt > 32767:\n print(\"int\")\nelif inpt > 127:\n print(\"short\")\nelse:\n print(\"byte\")\n\n \t\t \t\t \t\t\t\t\t\t\t \t\t\t\t \t\t \t\t \t\t \t", "a=int(input())\r\nif a>=-128 and a<=127:print(\"byte\")\r\nelif a>=-32768 and a<=32767:print(\"short\")\r\nelif a>= -2147483648 and a<= 2147483647:print(\"int\")\r\nelif a>=-9223372036854775808 and a<=9223372036854775807:print(\"long\")\r\nelse:print(\"BigInteger\")", "n = int(input())\r\n\r\ndef byte(q):\r\n if q<=127 and q>=-128: return True\r\n return False\r\n\r\ndef short(q):\r\n if q>=-32768 and q<=32767: return True\r\n return False\r\n\r\ndef inte(q):\r\n if q>=-2147483648 and q<=2147483647: return True\r\n return False\r\n\r\ndef long(q):\r\n if q>=-9223372036854775808 and q<=9223372036854775807: return True\r\n return False\r\n\r\nif (byte(n)): print(\"byte\")\r\nelif short(n): print(\"short\")\r\nelif inte(n): print(\"int\")\r\nelif long(n): print(\"long\")\r\nelse: print(\"BigInteger\")\r\n", "n=int(input())\nif(n>= -128 and n<=127): print(\"byte\")\nelif (n>= -32768 and n<=32767): print(\"short\")\nelif (n>= -2147483648 and n<=2147483647): print(\"int\")\nelif (n>= -9223372036854775808 and n<=9223372036854775807): print(\"long\")\nelse : print(\"BigInteger\")\n \t\t\t\t\t \t\t\t \t \t\t \t\t\t\t \t", "byte = [-128, 127]\r\nshort = [-32768, 32767]\r\nint_type = [-2147483648, 2147483647]\r\nlong = [-9223372036854775808, 9223372036854775807]\r\nn = int(input())\r\n\r\nif byte[0] <= n <= byte[1]:\r\n print(\"byte\")\r\nelif short[0] <= n <= short[1]:\r\n print(\"short\")\r\nelif int_type[0] <= n <= int_type[1]:\r\n print(\"int\")\r\nelif long[0] <= n <= long[1]:\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")\r\n", "x=int(input())\r\nif(-128<=x and x<=127):\r\n print(\"byte\")\r\nelif(-32768 <=x and x<=32767 ):\r\n print(\"short\")\r\nelif(-2147483648 <=x and x<=2147483647 ):\r\n print(\"int\")\r\nelif(-9223372036854775808 <=x and x<=9223372036854775807 ):\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")\r\n\r\n", "def main():\r\n data = input()\r\n negative = 0\r\n if data[0] == '-':\r\n negative = 1\r\n data = data.replace('-','')\r\n if int(data) <= 127 + negative:\r\n print(\"byte\")\r\n elif int(data) <= 32767 + negative:\r\n print(\"short\")\r\n elif int(data) <= 2147483647 + negative:\r\n print(\"int\")\r\n elif int(data) <= 9223372036854775807 + negative:\r\n print(\"long\")\r\n else:\r\n print(\"BigInteger\")\r\nif __name__ == \"__main__\":\r\n main()", "n = input()\n\ndef smaller_equal(a, b):\n if len(a) < len(b):\n return True\n if len(a) > len(b):\n return False\n for i in range(len(a)):\n if int(a[i]) > int(b[i]):\n return False\n if int(a[i]) < int(b[i]):\n return True\n return True\n\ndef main(n, flag):\n if smaller_equal(n, str(127 + flag)):\n return 'byte'\n if smaller_equal(n, str(32767 + flag)):\n return 'short'\n if smaller_equal(n, str(2147483647 + flag)):\n return 'int'\n if smaller_equal(n, str(9223372036854775807 + flag)):\n return 'long'\n return 'BigInteger'\n\nif n[0] == '-':\n print(main(n[1:], 1))\nelse:\n print(main(n, 0))\n\n", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# import math\r\n# from itertools import *\r\n# import random\r\n# import calendar\r\n# import datetime\r\n# import webbrowser\r\n\r\nn = int(input())\r\nif -128 <= n <= 127:\r\n print(\"byte\")\r\nelif 128 <= n <= 32767 or -32768 <= n <= 2767:\r\n print(\"short\")\r\nelif 32768 <= n <= 2147483647 or -2147483648 <= n <= 2147483647:\r\n print(\"int\")\r\nelif 2147483648 <= n <= 9223372036854775807 or -9223372036854775808 <= n <= 9223372036854775807:\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")\r\n", "from sys import stdin\r\nimport math\r\n\r\ndef main():\r\n x = int(stdin.readline().strip())\r\n if x <= 127:\r\n print(\"byte\", end = \"\")\r\n elif x <= 32767:\r\n print(\"short\", end = \"\")\r\n elif x <= 2147483647:\r\n print(\"int\", end = \"\")\r\n elif x <= 9223372036854775807:\r\n print(\"long\", end = \"\")\r\n else:\r\n print(\"BigInteger\", end = \"\")\r\n\r\nmain()", "n = int(input())\n\nif -128 <= n < 128:\n print(\"byte\")\nelif -32768 <= n < 32768:\n print(\"short\")\nelif -2147483648 <= n < 2147483648:\n print(\"int\")\nelif -9223372036854775808 <= n < 9223372036854775808:\n print(\"long\")\nelse:\n print(\"BigInteger\")\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=int(input())\r\nif -128 <= a <= 127:\r\n print(\"byte\")\r\nelif a>=(-32768) and a <= (32767):\r\n print(\"short\")\r\nelif a>=(-2147483648) and a<=(2147483647):\r\n print(\"int\")\r\nelif a>=(-9223372036854775808) and a<=(9223372036854775807):\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")", "n=int(input())\r\nif n<=127: print(\"byte\")\r\nelif n<=32767: print(\"short\")\r\nelif n<=2147483647: print(\"int\")\r\nelif n<=9223372036854775807: print(\"long\")\r\nelse: print(\"BigInteger\")", "def solve():\r\n # n,m = (int(i) for i in input().split(\" \"))\r\n n = int(input())\r\n\r\n if n>=-128 and n<=127:\r\n print(\"byte\")\r\n elif n>=-32768 and n<=32767:\r\n print(\"short\")\r\n elif n>=-2147483648 and n<= 2147483647:\r\n print(\"int\")\r\n elif n>=-9223372036854775808 and n<= 9223372036854775807 :\r\n print(\"long\")\r\n else:\r\n print(\"BigInteger\")\r\n \r\nt = 1#int(input())\r\n\r\nfor _ in range(t):\r\n solve()\r\n \r\n", "n = int(input())\r\nprint(\"byte\" if n < 128 else \"short\" if n < 32768 else \"int\" if n < 2147483648 else \"long\" if n < 9223372036854775808 else \"BigInteger\")", "N=int(input())\nif(-128<=N<=127):\n print('byte')\nelif(-32768<=N<=32767):\n print('short')\nelif(-2147483648<=N<=2147483647):\n print('int')\nelif((-(2**63))<=N<=(2**63-1)):\n print('long')\nelse:\n print('BigInteger')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nprint('byte' if -129 < n < 128 else 'short' if -32769 < n < 32768 else 'int' if -2147483649 < n < 2147483648 else 'long' if -9223372036854775809 < n < 9223372036854775808 else 'BigInteger')\r\n", "# cook your dish here\nimport math \nn=int(input())\nif(n>=-128 and n<=127):\n print(\"byte\")\nelif((n>=-32768 and n<-128) or (n>127 and n<=32767)):\n print(\"short\")\nelif((n>=-2147483648 and n<-32768) or (n>32767 and n<=2147483647)):\n print(\"int\")\nelif((n>=-9223372036854775808 and n<-2147483648 ) or (n>2147483647 and n<=9223372036854775807)):\n print(\"long\")\nelse:\n print(\"BigInteger\")\n \n\n \n \n \t\t \t \t\t\t\t\t \t\t \t \t\t \t", "n=int(input())\nif(n<=127 and n>=-128):print(\"byte\")\nelif(n<=32767 and n>=-32768):print(\"short\")\nelif(n<=2147483647 and n>=-2147483648):print(\"int\")\nelif(n<=9223372036854775807 and n>=-9223372036854775808):print(\"long\")\nelse:print(\"BigInteger\")\n \t\t\t \t\t\t \t\t\t\t\t \t\t \t", "x=abs(int(input()))\nif -128<=x<=127:\n print('byte')\nelif -32768<=x<=32767:\n print('short')\nelif -2147483648<=x<=2147483647:\n print('int')\nelif -9223372036854775808<=x<=9223372036854775807:\n print('long')\nelse:\n print('BigInteger')\n\n\t \t \t \t \t \t \t\t\t\t\t \t \t\t\t", "def main():\r\n \r\n Num = input()\r\n if (int(Num) >= -127) and (int(Num) <= 127):\r\n print(\"byte\")\r\n \r\n elif (int(Num) >= -32768) and (int (Num) <= 32767):\r\n print(\"short\")\r\n \r\n elif (int(Num) >= -2147483648) and (int (Num) <= 2147483647):\r\n print(\"int\")\r\n \r\n elif (int(Num) >= -9223372036854775808) and (int (Num) <= 9223372036854775807):\r\n print(\"long\")\r\n \r\n else:\r\n print(\"BigInteger\")\r\n \r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nif n>=-128 and n<=127:print(\"byte\")\r\nelif n>=-32768 and n<=32767:print(\"short\")\r\nelif n>= -2147483648 and n<= 2147483647:print(\"int\")\r\nelif n>=-9223372036854775808 and n<=9223372036854775807:print(\"long\")\r\nelse:print(\"BigInteger\")", "x=int(input())\r\nif(x>=-128 and x<=127):\r\n print(\"byte\")\r\nelif(x>=-32768 and x<=32767):\r\n print(\"short\")\r\nelif(x>=-2147483648 and x<=2147483647):\r\n print(\"int\")\r\nelif(x>=-9223372036854775808 and x<=9223372036854775807):\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")\r\n\r\n", "s = int(input())\r\na = 0 - 32768\r\nb = 0 - 2147483648\r\nc = 0 -9223372036854775808\r\nif (-128) <= s and s <= 127:\r\n print(\"byte\")\r\nelif a <=s and s<= 32767:\r\n print(\"short\")\r\nelif b<=s and s<= 2147483647:\r\n print(\"int\")\r\nelif c<=s and s<= 9223372036854775807:\r\n print(\"long\")\r\nelse :\r\n print(\"BigInteger\")", "x=int(input())\r\nif (x >= -128 and x<= 127):\r\n print (\"byte\")\r\nelif (x >= -32768 and x<= 32767):\r\n print(\"short\")\r\nelif (x>= -2147483648 and x<= 2147483647 ):\r\n print(\"int\")\r\nelif(x>=-9223372036854775808 and x<= 9223372036854775807):\r\n print(\"long\")\r\n \r\nelse:\r\n print(\"BigInteger\")\r\n", "n = int(input())\r\nif -128 <= n <= 127: print(\"byte\")\r\nelif -32768 <= n <= 32767: print(\"short\")\r\nelif -2147483648 <= n <= 2147483647: print(\"int\")\r\nelif -9223372036854775808 <= n <= 9223372036854775807: print(\"long\")\r\nelse: print(\"BigInteger\")", "n = int(input())\r\nb = [-128, 127]\r\ns = [-32768, 32767]\r\ni = [-2147483648, 2147483647]\r\nl = [-9223372036854775808, 9223372036854775807]\r\nif n <= max(b) and n >= min(b):\r\n print('byte')\r\nelif n <= max(s) and n >= min(s):\r\n print('short')\r\nelif n <= max(i) and n >= min(i):\r\n print('int')\r\nelif n <= max(l) and n >= min(l):\r\n print('long')\r\nelse:\r\n print('BigInteger')\r\n", "x = int(input())\r\nif(x >= -128 & x <= 127):\r\n print (\"byte\")\r\nelif(x >= -32768 & x <= 32767):\r\n print(\"short\")\r\nelif(x >= -2147483648 & x <= 2147483647):\r\n print(\"int\")\r\nelif(x >= -9223372036854775808 & x <= 9223372036854775807 ):\r\n print(\"long\")\r\nelse:\r\n print(\"BigInteger\")\r\n", "while True:\n try:\n a=int(input())\n if a<=127:\n print(\"byte\")\n elif a<=32767:\n print(\"short\")\n elif a<=2147483647:\n print(\"int\")\n elif a<=9223372036854775807:\n print(\"long\")\n else:\n print(\"BigInteger\")\n except:\n break\n\n \t \t \t\t\t \t \t \t\t", "s=int(input())\r\nif s>0:\r\n s*=-1;s-=1\r\nif s>=-128:print('byte')\r\nelif s>=-32768:print('short')\r\nelif s>=-2147483648: print('int')\r\nelif s>=-9223372036854775808: print('long')\r\nelse: print('BigInteger')", "import sys\n \nn=int(sys.stdin.readline())\n\nif (n >= -128 & n <= 127):\n print('byte')\nelif (n >= -32768 & n <= 32767):\n print('short')\nelif (n >= -2147483648 & n <= 2147483647):\n print('int')\nelif (n >= -9223372036854775808 & n <= 9223372036854775807):\n print('long')\nelse:\n print('BigInteger')\n\n\t\t\t \t\t \t\t\t \t\t \t\t \t \t \t \t" ]

[ "s = 'abcdefghijklmnopqrstuvwxyz';\r\n\r\nword = input();\r\n\r\nresult = 0;\r\nptr = 0;\r\n\r\nfor i in range(len(word)):\r\n from_st = s.index(word[i]);\r\n from_end = s[::-1].index(word[i]);\r\n if(from_st > from_end):\r\n ptr = from_end;\r\n start = s[26 - ptr-1::];\r\n end = s[0:26-ptr-1];\r\n else:\r\n ptr = from_st;\r\n start = s[ptr:];\r\n end = s[0:ptr];\r\n if(len(start) < len(end)):\r\n result += len(start);\r\n else:\r\n result += len(end);\r\n s = start + end;\r\n\r\nprint(result);", "ch=input()\r\nch=ch.lower()\r\nch=\"a\"+ch\r\nl=list()\r\nfor i in range(97,97+26):\r\n a=chr(i)\r\n l.append(a)\r\nn=0\r\nfor i in range(1,len(ch)):\r\n x=l.index(ch[i-1])\r\n y=l.index(ch[i])\r\n a=abs(y-x)\r\n if a>13:\r\n n=n+abs(a-26)\r\n else:\r\n n=n+a\r\nprint(n)", "alph = ['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\nname = input()\r\nrotations = 0\r\nprevious = alph.index('a')\r\nfor letter in name:\r\n afterwards = alph.index(letter)\r\n distance = min((previous - afterwards) % 26, (afterwards - previous) % 26)\r\n rotations += distance\r\n previous = afterwards\r\nprint(rotations)\r\n", "wheel = input()\n\ncounter = 0 \npointer = 'a'\n\nfor c in wheel:\n distance = abs(ord(pointer) - ord(c))\n \n if distance < 13:\n counter += distance\n else:\n counter += (26 - distance)\n pointer = c\n \nprint(counter)", "s = input()\r\ncounter = 0\r\ncounter += min(abs(ord('a') - ord(s[0])), 26 - abs(ord('a') - ord(s[0])))\r\nfor i in range(1,len(s)):\r\n counter += min(abs(ord(s[i-1]) - ord(s[i])), 26 - abs(ord(s[i-1]) - ord(s[i])))\r\nprint(counter)", "s=input()\r\nstart='a'\r\ncount=0\r\nfor i in s:\r\n diff=abs(ord(i)-ord(start))\r\n count+=min(diff,26-diff)\r\n start=i\r\nprint(count)\r\n ", "ans = 0 ; pre = ord('a')\r\nfor i in input():\r\n x = ord(i)\r\n m = abs(x-pre)\r\n if m>13: m = 26-m\r\n ans += m ; pre = x\r\nprint(ans)", "\r\n# a1 , a2 , a3,a4 = [int(x) for x in input().split()]\r\n# d = {\r\n# 1:int(a1),\r\n# 2:int(a2),\r\n# 3:int(a3),\r\n# 4:int(a4)\r\n \r\n# }\r\n# s = input()\r\n# count = 0\r\n# for i in s:\r\n# count = count +d[int(i)]\r\n# print(count)\r\ns = input()\r\np = 'a'\r\ncnt = 0\r\nfor i in s:\r\n x = abs(ord(p) - ord(i))\r\n if( x>13):\r\n x = 26-x\r\n \r\n cnt +=x \r\n p = i\r\nprint(cnt) ", "lst = [chr(i) for i in range(97, 123)]\r\n\r\ns = input()\r\ncount = 0\r\ncurrent = 'a'\r\nfor i in s:\r\n count += min(26 - abs(lst.index(current) - lst.index(i)), abs(lst.index(current) - lst.index(i)))\r\n current = i\r\nprint(count)", "word = input()\r\nsum = 0\r\ntable = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\nbias = 0\r\nfor step in word:\r\n num = abs(bias - table.find(step))\r\n bias = table.find(step)\r\n if num <= (26-num):\r\n sum += num\r\n else:\r\n sum += 26-num\r\n\r\nprint(sum)", "s = list(input())\nr = 0\ncurrent = \"a\"\n\nfor l in s:\n d = min((ord(l) - ord(current)) % 26, (ord(current) - ord(l)) % 26)\n r += d\n current = l\n\nprint(r)\n\n# This porblem was solved with a lot of help from ChatGPT,\n# I could not figure out who to rotate around and it gave me two big hints:\n# I can rotate around using module arithmetic, and\n# I can use `ord()` function to get a number of a ASCII character instead of defining\n# my own list of letters in the alphabet.", "a=input()\r\nk=0\r\nn=0\r\nwhile True :\r\n\tif k==len(a):\r\n\t\tprint(n)\r\n\t\tbreak\r\n\telif k==0 :\r\n\t\tn=min(abs(ord('a')-ord(a[k])),26-abs(ord('a')-ord(a[k])))\r\n\t\tk=1\r\n\telif k>0 :\r\n\t\tn+=min(abs(ord(a[k-1])-ord(a[k])),26-abs(ord(a[k-1])-ord(a[k])))\r\n\t\tk+=1", "s=str(input())\r\nl=len(s)\r\nc=0\r\nfor i in range(l-1):\r\n x=ord(s[i])\r\n y=ord(s[i+1])\r\n a=(x-y)%26\r\n b=(y-x)%26\r\n c+=min(a,b)\r\ns=(ord(s[0])-ord(\"a\"))%26\r\nt=26-s\r\nc+=min(s,t)\r\nprint(c)\r\n", "Q = input()\r\n\r\nW = \"abcdefghijklmnopqrstuvwxyz\"\r\nW1=''\r\nresult =0\r\n\r\nfor i in range(len(Q)):\r\n result += min(W.index(Q[i]),abs(26-W.index(Q[i])))\r\n W1= W[W.index(Q[i]):]+W[:W.index(Q[i])]\r\n W=W1\r\n\r\nprint(result)", "\r\ndef solve(str):\r\n str = 'a' + str\r\n totalMoves = 0\r\n\r\n for i in range(1, len(str)):\r\n prevChar = str[i-1]\r\n curChar = str[i]\r\n\r\n forwardMove = abs(ord(prevChar) - ord(curChar))\r\n backwardMove = 26 - forwardMove\r\n totalMoves += min(forwardMove, backwardMove)\r\n\r\n return totalMoves\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n str = input()\r\n print(solve(str))", "s=input()\r\nt=27\r\nr=[]\r\nfor i in s:\r\n x=abs(t-(ord(i)-96))\r\n r.append(min(x,26-x))\r\n t=ord(i)-96\r\nprint(sum(r))", "n=input()\r\nrotations=0\r\nstarting_point=\"a\"\r\nfor i in n:\r\n r=(abs(ord(i)-ord(starting_point)))%26\r\n if r>13:\r\n rotations+=26-r\r\n else:\r\n rotations+=r\r\n starting_point=i\r\nprint(rotations)", "a = \"a\" + input()\r\nk = 0\r\nfor i in range(len(a)-1):\r\n b = ord(a[i])\r\n c = ord(a[i+1])\r\n s = abs(b-c)\r\n if s > 13:\r\n k += 26-s\r\n else:\r\n k += s\r\nprint(k)", "# # t = int(input())\n# t = 1\n# # # n, m = map(int, input().split())\n# # # a = list(map(int, input().split()))\n# # # a.sort()\n# import math\n# from collections import Counter\n\n# a = []\n# while t != 0:\n# # cook your dish here\n# n = int(input())\n# ans = 0\n# for i in range(1, n):\n# if n % i == 0:\n# ans += 1\n# print(ans)\n# t -= 1\ndef rotations_needed(ch1, ch2):\n # Calculate the minimum number of rotations needed to move from ch1 to ch2\n return min((ord(ch2) - ord(ch1)) % 26, (ord(ch1) - ord(ch2)) % 26)\n\ndef min_rotations_to_print(name):\n # Initialize the total number of rotations to 0\n total_rotations = 0\n\n # Set the initial pointer to 'a'\n current_char = 'a'\n\n for ch in name:\n # Calculate the rotations needed to move from current_char to ch\n rotations = rotations_needed(current_char, ch)\n\n # Add the rotations to the total\n total_rotations += rotations\n\n # Update the current_char\n current_char = ch\n\n return total_rotations\n\n# Read the input string\nname = input()\n\n# Calculate the minimum rotations needed\nmin_rotations = min_rotations_to_print(name)\n\n# Print the result\nprint(min_rotations)\n", "s=input()\r\nans=0\r\ni='a'\r\nfor c in s:\r\n l=abs(ord(c)-ord(i))\r\n ans=ans+min(l,26-l)\r\n i=c\r\nprint(ans)", "s = input()\r\nres = 0\r\nsp = 'a'\r\n\r\nfor x in s:\r\n h = abs(ord(x) - ord(sp))\r\n if h <= 13:\r\n res += h\r\n else:\r\n res += (26 - h)\r\n sp = x\r\n\r\n# for x in range(len(s)):\r\n# h = 0\r\n# if s[x]>sp:\r\n# h += ord(sp) - ord('a') + 1\r\n# h += ord('z') - ord(s[x])\r\n# else:\r\n# h += ord(s[x]) - ord('a') + 1\r\n# h += ord('z') - ord(sp)\r\n#\r\n# res += min(h,abs(ord(s[x])-ord(sp)))\r\n# sp = s[x]\r\nprint(res)\r\n\r\n# for x in range(ord('a'), ord('z')+1):\r\n# print(x - ord('a'),end=' ')\r\n", "a = 'abcdefghijklmnopqrstuvwxyz'\r\nans = 0\r\nx = 0\r\nfor c in input():\r\n y = (a.index(c) - x)%26\r\n ans += min(y, 26-y)\r\n x = a.index(c)\r\nprint(ans)", "s = list(map(lambda x: ord(x) - 97, list(input())))\r\nans = 0\r\nprev = 0\r\nfor val in s:\r\n ans += min(abs(prev - val), 26 - abs(prev - val))\r\n prev = val\r\nprint(ans)", "inp = input()\nstart = ord('a')\nsteps = 0\nfor i in inp:\n inner_dis = abs(ord(i)-start)\n outer_dis = 26-inner_dis\n \n steps += min(outer_dis, inner_dis)\n start = ord(i)\n\nprint(steps)", "import string # to get abc instead of typing it in a varibel\r\n\r\nabc = string.ascii_lowercase\r\n\r\n# take word from user to calculate n of steps in both directations\r\nword = input() # note that input always returns a string\r\ncounter = 0 # to counter n of rotations\r\npointer = 'a' # pointer starts from a as mentined in the probelm\r\nfor letter in word: # for each letter in word\r\n # x to store n _of_ steps if get the letter from pointer in clockwise direction in abc\r\n x = abs(abc.index(letter) - abc.index(pointer))\r\n \r\n # y stores n _of_ steps to get the letter starting from pointer till letter in counterclockwise \r\n y = abs(x - len(abc)) # to invert rotating substract it from full rotation like in cartizian substract from 360 degrees\r\n \r\n # take direction with the least n of steps\r\n \r\n counter += min(x, y)\r\n \r\n # update the pointer with the new one to start rotating from\r\n pointer = letter\r\nprint(counter)", "n=str(input())\r\nl=len(n)\r\nm=0\r\nstart=0\r\nfor i in range(0,l):\r\n index = ord(n[i])-97\r\n walk = abs(start-index)\r\n if walk < 13:\r\n m+=walk\r\n else:\r\n m+=26-walk\r\n start =index\r\nprint(m)\r\n", "p=input(\"\")\r\nsum=0\r\nq=0\r\nfor i in p:\r\n num=ord(i)-96\r\n if q==0:\r\n if (num-1)>abs(27-num):\r\n sum+=(27-num)\r\n else:\r\n sum+=(num-1)\r\n q+=1\r\n else:\r\n pnum=ord(p[q-1])-96\r\n\r\n if num>pnum:\r\n num,pnum=pnum,num\r\n\r\n\r\n if abs(pnum-num)>abs(26-pnum+num):\r\n sum+=(26-pnum+num)\r\n\r\n else:\r\n sum+=abs(pnum-num)\r\n\r\n q+=1\r\n\r\nprint(sum)\r\n\r\n", "s = input()\r\nans = 0\r\n\r\ncur = 'a'\r\nfor i in s:\r\n ans += min(abs(ord(cur) - ord(i)), 26 - abs(ord(cur) - ord(i)))\r\n cur = i\r\nprint(ans)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Sep 10 14:31:30 2021\n\n@author: dell\n\"\"\"\n\n\ndef search_min_rot(x,y):\n return min(abs(ord(x)-ord(y)), 26-abs(ord(x)-ord(y)))\n\nwhile True:\n ch = input()\n if ch == ch.lower():\n break\n\nval = search_min_rot(ch[0], 'a')\n\nfor i in range(len(ch)-1):\n d = search_min_rot(ch[i], ch[i+1])\n val+=d\n \nprint(val)\n", "\r\nn=['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# 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25\r\n \r\na= str(input()).lower()\r\na='a'+a\r\nln = len(a)\r\nt=0\r\nfor i in range(ln-1):\r\n n1=a[i]\r\n n2=a[i+1]\r\n n11= n.index(n1)\r\n n22 =n.index(n2)\r\n diff = abs(n22 -n11)\r\n if diff>13:\r\n t+=26-diff\r\n else:\r\n t+=diff\r\nprint (t)", "s=input()\r\ncount=0\r\ntemp='a'\r\nfor i in range(0,len(s)):\r\n count=count+(26-abs(ord(temp)-ord(s[i]))) if abs(ord(temp)-ord(s[i]))>13 else count+abs(ord(temp)-ord(s[i]))\r\n temp=s[i]\r\nprint(count)", "s = str(input())\n\nmoves = 0\nindx = 0\nfor i in range(len(s)):\n point = abs(ord(s[i]) - 97)\n if (abs(indx - point) < 13):\n moves += abs(indx - point)\n else:\n moves += 26 - abs(indx - point)\n indx = point\nprint(moves)\n", "def solve(s):\r\n start = 'a'\r\n sum = 0\r\n for i in range(len(s)):\r\n x = abs(ord(s[i]) - ord(start))\r\n y = 26 - abs(x)\r\n sum += min(x, y)\r\n start = s[i]\r\n print(sum)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve(input())\r\n", "\r\nx=input()\r\ny=\"a\"\r\nz=y+x\r\nn=len(z)\r\n# print(z)\r\nc=0\r\nv=[]\r\nfor i in range(n-1):\r\n a=abs(ord(z[i+1])-ord(z[i])) \r\n if a<=13:\r\n c=a\r\n v.append(c)\r\n elif a>13: \r\n c=26-a \r\n v.append(c) \r\nprint(sum(v)) ", "s = input()\r\na = ['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\nidx1 = 0\r\nsm = 0\r\nfor i in s:\r\n idx2 = a.index(i)\r\n # print(idx2, idx21)\r\n if idx2 > idx1:\r\n dis = (25 - idx2) + idx1 + 1\r\n else:\r\n dis = (25 - idx1) + idx2 + 1\r\n dis = abs(dis)\r\n if abs(idx1 - idx2) < dis:\r\n sm += abs(idx1 - idx2)\r\n else:\r\n sm += dis\r\n idx1 = idx2\r\n # print(sm)\r\nprint(sm)\r\n", "\r\nfrom string import*\r\n\r\ndefult_string = ascii_lowercase *3\r\ninput_string = \"a\" + input()\r\nsum = 0\r\n\r\nfor i in range(len(input_string)-1):\r\n a = defult_string.find(input_string[i])\r\n\r\n v = defult_string.find(input_string[i+1])\r\n v1 = v+26\r\n value = min(abs(a-v),abs(a-v1))\r\n value1 = min(abs((a+26)-v),abs((a+26)-v1))\r\n sum = sum + (min(value1,value))\r\n\r\nprint(sum)\r\n\r\n\r\n", "def f(c):\r\n return abs(ord(c)-ord('a'))\r\n\r\ns = input()\r\nans = 0\r\nprev = 'a'\r\n\r\nfor c in s:\r\n numcur, numprev = f(c), f(prev)\r\n small,big = min(numcur, numprev), max(numcur, numprev)\r\n ans += min(big-small, small+26-big)\r\n prev = c \r\n\r\nprint (ans)\r\n ", "import string\r\nv=list(string.ascii_lowercase)\r\nv2=\"a\"+input();c=0\r\nfor i in range(len(v2)-1):\r\n w=abs(v.index(v2[i])-v.index(v2[i+1]))\r\n if w<26-w:\r\n c+=w\r\n else:\r\n c+=26-w \r\nprint(c) ", "import string\r\n\r\nw = input()\r\na = abs(string.ascii_lowercase.index(w[0]))\r\nb = 26 - string.ascii_lowercase.index(w[0])\r\ncount = min(a, b)\r\n\r\nfor i in range(1, len(w)):\r\n a, b = string.ascii_lowercase.index(w[i - 1]), string.ascii_lowercase.index(w[i])\r\n c = abs(a - b)\r\n d = 26 - max(a, b) + min(a, b)\r\n count += min(c, d)\r\n\r\nprint(count)", "def solve(string):\r\n result = 0\r\n prev = 'a'\r\n\r\n for char in string:\r\n diff = abs(ord(prev) - ord(char))\r\n result += min(26 - diff, diff)\r\n prev = char\r\n\r\n return result\r\n\r\ndef main():\r\n t = 1 #int(input())\r\n for _ in range(t):\r\n print(solve(input()))\r\n\r\nmain()", "#!/usr/bin/env python3\r\n# coding:utf-8\r\n\r\nif __name__ == \"__main__\":\r\n n = input()\r\n t = \"a\"\r\n s = 0\r\n for item in n:\r\n delta = abs(ord(item) - ord(t))\r\n if delta >= 13:\r\n delta = 26 - delta\r\n s += delta\r\n t = item\r\n\r\n print(s)\r\n", "a = input()\r\nisn = 1\r\ns = 0\r\nfor i in a:\r\n code = ord(i)-96\r\n s += min(abs(isn-code), 26-abs(isn-code))\r\n isn = code\r\nprint(s)", "word = input()\r\nletters = {chr(i):(i-97) for i in range(97,123)}\r\nstarting_letter = 'a'\r\nsum = 0\r\nfor char in word:\r\n distance = abs(letters[starting_letter] - letters[char])\r\n starting_letter = char\r\n if(distance>=len(letters)/2):\r\n sum+=len(letters)-distance;\r\n else:\r\n sum+=distance;\r\n\r\nprint(sum)", "name, alphabet = input(), \"abcdefghijklmnopqrstuvwxyz\"\r\nres, l = 0, \"a\"\r\nfor i in range(len(name)):\r\n a = alphabet.find(name[i])\r\n b = alphabet.find(l)\r\n res += min([abs(a-b), len(alphabet) - abs(a-b)])\r\n l = name[i]\r\nprint(res)\r\n", "n = input()\r\nalfavit = \"abcdefghijklmnopqrstuvwxyz\"\r\ntekushaya = \"a\"\r\nres = 0\r\nfor i in n:\r\n n1 = alfavit.find(tekushaya)\r\n n2 = alfavit.find(i)\r\n ker = abs(n1-n2)\r\n kergold = 26 - ker\r\n res += min(ker, kergold)\r\n tekushaya = i\r\nprint(res)\r\n", "__author__ = 'X230874'\r\n\r\nstr = input()\r\nlen = len(str)\r\nans = int(0)\r\n\r\nans = min( abs(ord(str[0])-ord('a')) , 26-abs(ord(str[0])-ord('a')) )\r\n#print(ans)\r\nfor i in range(len-1):\r\n # print( abs(ord(str[i])-ord(str[i+1]) ) , (26-abs(ord(str[i])-ord(str[i+1])) ) )\r\n ans += min( abs(ord(str[i])-ord(str[i+1]) ) , (26-abs(ord(str[i])-ord(str[i+1])) ) )\r\n\r\nprint(ans)", "*a,=\"abcdefghijklmnopqrstuvwxyz\"\r\nr=pos=0\r\nfor i in input():\r\n distance= abs(pos-a.index(i)) \r\n r+= min(distance ,len(a)-distance )\r\n pos= a.index(i)\r\nprint(r)", "def minRotations(text):\r\n rotations = 0\r\n text = text.lower()\r\n prev = 'a'\r\n for ch in text:\r\n rotations += minRotation(ch, prev)\r\n prev = ch\r\n return rotations\r\n\r\ndef minRotation(ch1, ch2):\r\n v1 = ord(ch1)-ord('a')+1; v2 = ord(ch2)-ord('a')+1\r\n s = min(v1, v2); l = max(v1, v2)\r\n return min(l-s, 26-l+s)\r\n\r\ntext = input()\r\nprint(minRotations(text))\r\n", "x = input(\"\")\r\ndist = \"a\"\r\ntotal = 0\r\nfor i in range (0,len(x)):\r\n a = abs(ord(dist)-ord(x[i]))\r\n b = 26 - abs(ord(dist)-ord(x[i]))\r\n if a >= b:\r\n total = total + b\r\n else:\r\n total = total + a\r\n dist = x[i]\r\nprint(total)", "# https://codeforces.com/problemset/problem/731/A\r\n\r\ndef check(w):\r\n cnt = 0\r\n w = 'a' + w\r\n for i in range(1, len(w)):\r\n if w[i] == w[i-1]:\r\n continue\r\n if ord(w[i]) > ord(w[i-1]):\r\n cnt += min(122-ord(w[i])+ord(w[i-1])-97+1, ord(w[i])-ord(w[i-1]))\r\n else:\r\n cnt += min(122-ord(w[i-1])+ord(w[i])-97+1, ord(w[i-1])-ord(w[i]))\r\n return cnt\r\n\r\nprint(check(input()))", "c = 97\r\ntotal = 0\r\nfor i in map(ord, input()):\r\n val = abs(c - i)\r\n total += min(val, 26 - val)\r\n c = i\r\nprint(total)\r\n", "s = input()\r\n\r\npin = 'a'\r\ncount = 0\r\nfor char in s:\r\n if abs(ord(pin) - ord(char)) > 13:\r\n count+= 26 - abs(ord(char) - ord(pin))\r\n else:\r\n count+= abs(ord(char) - ord(pin))\r\n pin = char\r\nprint(count)\r\n", "A = list(input())\nR = 0\nC = 'a'\nfor c in A:\n\tk = abs(ord(c) - ord(C))\n\tR += min(k, 26 - k)\n\tC = c\nprint(R)\n \t\t\t\t\t \t \t \t\t \t \t \t\t \t", "word=input()\r\nsum=0\r\npastletter='a'\r\nfor letter in word:\r\n distance=abs(ord(pastletter)- ord(letter))\r\n if distance>13:\r\n sum+=abs(26-distance)\r\n else:\r\n sum+=distance\r\n\r\n pastletter=letter\r\nprint(sum)", "a = input()\r\ns = 0\r\nb = ord('a')\r\nfor i in range(len(a)):\r\n s += min(abs(ord(a[i])-b),26-abs(ord(a[i])-b))\r\n b = ord(a[i])\r\nprint(s)", "import string\r\ntext=string.ascii_lowercase\r\ncounter=0\r\nword=input()\r\nstarted_letter='a'\r\nfor i in word:\r\n if abs(text.find(started_letter)-text.find(i))>13:\r\n counter+=26-abs(text.find(started_letter)-text.find(i))\r\n started_letter=i\r\n else:\r\n counter+=abs(text.find(started_letter)-text.find(i))\r\n started_letter=i\r\n\r\nprint(counter)", "from math import fabs\r\n\r\nword = input()\r\n\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nstartingPointer = 0\r\nresult = 0\r\n\r\n\r\ndef findDistance(letter):\r\n global alpha, startingPointer\r\n leftDistance = rightDistance = 0\r\n current = alpha[startingPointer]\r\n balance = 26\r\n # right\r\n while current != letter:\r\n rightDistance += 1\r\n if startingPointer + rightDistance < len(alpha):\r\n current = alpha[startingPointer + rightDistance]\r\n continue\r\n current = alpha[startingPointer + rightDistance - balance]\r\n\r\n current = alpha[startingPointer]\r\n # left\r\n while current != letter:\r\n leftDistance += 1\r\n if startingPointer - leftDistance > -1:\r\n current = alpha[startingPointer - leftDistance]\r\n continue\r\n current = alpha[startingPointer - leftDistance + balance]\r\n\r\n return (leftDistance, rightDistance)\r\n\r\n\r\nfor letter in word:\r\n result += min(findDistance(letter))\r\n startingPointer = alpha.index(letter)\r\n\r\nprint(result)\r\n", "s = [i for i in input()]\r\nrot = min(abs(ord('a') - ord(s[0])), 26 - abs(ord('a') - ord(s[0])))\r\nfor i in range(len(s) - 1):\r\n a = abs(ord(s[i]) - ord(s[i+1]))\r\n rot += min(a, 26 - a)\r\nprint(rot)\r\n\r\n", "def distance_between_characters(ch1, ch2):\r\n distance_clockwise = abs(ord(ch1) - ord(ch2))\r\n distance_counterclockwise = 26 - distance_clockwise\r\n return min(distance_clockwise, distance_counterclockwise)\r\n\r\n\r\nname = input()\r\ntotal_rotations = 0\r\ncurrent_position = 'a'\r\nfor letter in name:\r\n total_rotations += distance_between_characters(current_position, letter)\r\n current_position = letter\r\n\r\nprint(total_rotations)\r\n", "import math\r\ns=input()\r\nstart='a'\r\nsteps=0\r\nfor letter in s:\r\n diff=int(math.fabs(ord(start) - ord(letter)))\r\n steps+=min(diff,26-diff)\r\n start=letter\r\nprint(steps)\r\n", "arr = input()\r\nlst = []\r\ncount = 0\r\nfor i in range(len(arr)):\r\n lst.append(ord(arr[i]))\r\nif abs(lst[0] - 97) <= 13:\r\n count += abs(lst[0] - 97)\r\nelse:\r\n count += 26 - abs(lst[0] - 97)\r\nfor j in range(len(lst)-1):\r\n if abs(lst[j] - lst[j+1]) <= 13:\r\n count += abs(lst[j] - lst[j+1])\r\n else:\r\n count += 26 - abs(lst[j] - lst[j+1])\r\nprint(count)", "a=input() #zeus\r\ns='abcdefghijklmnopqrstuvwxyz'\r\nk=0\r\nh=0\r\nfor x in a:\r\n p=s.index(x)\r\n if k<=p:\r\n z1=p-k\r\n z2=k+(26-p)\r\n else:\r\n z1=k-p\r\n z2=p+(26-k)\r\n h+=min(z1,z2)\r\n k=p\r\nprint(h)\r\n \r\n \r\n ", "s=input()\r\nl=[]\r\nfor i in range(97,97+26):\r\n l.append(chr(i))\r\nt=0\r\np=1\r\nfor i in s:\r\n if i==ord(i):\r\n continue\r\n idx=ord(i)-96\r\n m1=abs(idx-p)\r\n m2=26-m1\r\n t+=min(m1,m2)\r\n p=idx\r\nprint(t)", "import string\r\nalphabet = string.ascii_lowercase\r\na=input()\r\np = \"a\"\r\nh = 0\r\nif a[0] == \"z\":\r\n a = a[1:]\r\n h = 1\r\n p = \"z\"\r\n\r\nfor i in a:\r\n n = alphabet.index(p)\r\n k = alphabet.index(i)\r\n u = min(len(alphabet[:n]) + len(alphabet[k:]), len(alphabet[n:]) + len(alphabet[:k]), abs(n-k))\r\n p = i\r\n h += u\r\nprint(h)", "count = 0\nn = ord(\"a\")\nword = input()\nfor i in word:\n if ord(i) == n:\n continue\n elif ord(i) < n:\n count += min(n-ord(i), (ord(i)-ord(\"a\")) + (ord(\"z\")+1-n))\n n = ord(i)\n continue\n else:\n count += min(ord(i)-n, (n-ord(\"a\")) + (ord(\"z\")+1-ord(i)))\n n = ord(i)\n continue\nprint(count)\n \t \t\t \t \t\t\t\t\t \t \t \t\t \t\t\t", "l = \"abcdefghijklmnopqrstuvwxyz\"\r\na = \"a\" + input()\r\ns = 0\r\nfor i in range(len(a) - 1):\r\n x= abs(l.find(a[i]) - l.find(a[i + 1]))\r\n if x > 13:\r\n x = 26 - x\r\n s += x\r\nprint(s)", "\r\ns = input()\r\na = 97 # for first character only \r\ncounter = 0\r\nfor i in range (len(s)):\r\n\r\n sub = abs((ord (s[i]))-a)\r\n if sub<=13:\r\n counter +=sub\r\n a = ord(s[i]) # for next char \r\n else :\r\n counter+=(abs(26-sub)) # rotate \r\n a = ord(s[i])\r\nprint(counter)\r\n\r\n", "s = input()\r\ntotal = 0\r\nfor i in range(len(s)):\r\n prev = 97 if i == 0 else ord(s[i-1])\r\n total += min(abs(ord(s[i])-prev), 26-abs(ord(s[i])-prev))\r\nprint(total)\r\n", "exhibit_name = input()\r\n\r\nrotations = 0\r\ncurrent = 'a'\r\n\r\nfor c in exhibit_name:\r\n dist = abs(ord(c) - ord(current))\r\n rotations += min(dist, 26 - dist)\r\n current = c\r\n\r\nprint(rotations)\r\n", "import itertools\nimport bisect\nfrom string import ascii_lowercase\n\ndef function(*args):\n s = input()\n key = {e:i+1for i,e in enumerate(ascii_lowercase)}\n f1 = lambda p, q: abs(p-q)\n f2 = lambda l, p, q: abs(l - (abs(p-q)))\n p = 1\n res = 0\n for e in s:\n a = f1(p, key[e])\n b = f2(max(key.values()), p, key[e])\n res+= min(a,b)\n p = key[e]\n return res\n\n\nif __name__ == '__main__':\n res = function()\n print(res)", "letters = ['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\nrotations = 0 \r\ncurrent = 0 \r\nfor i in range(len(word)):\r\n temp = abs(current - letters.index(word[i]))\r\n if temp > 13:\r\n temp = abs(temp -26)\r\n current = letters.index(word[i])\r\n rotations += temp\r\n \r\nprint(rotations)\r\n", "def rotations_required(char1, char2):\r\n return min((ord(char2) - ord(char1) + 26) % 26, (ord(char1) - ord(char2) + 26) % 26)\r\n\r\nexhibit_name = input()\r\nrotations = 0\r\ncurrent_char = 'a'\r\n\r\nfor char in exhibit_name:\r\n rotations += rotations_required(current_char, char)\r\n current_char = char\r\n\r\nprint(rotations)\r\n", "import sys\r\ndef inp() : return sys.stdin.readline().strip()\r\ndef get_ints(): return map(int, inp().split())\r\ndef get_arr(): return list(map(int, inp().split()))\r\ndef get_int(): return int(inp())\r\ns=inp()\r\ntemp='a'\r\nans=0\r\nfor c in s:\r\n ans+=min(26-abs(ord(c)-ord(temp)),abs(ord(c)-ord(temp)))\r\n temp=c\r\nprint(ans)", "def clockwise(a, b):\n if b >= a:\n return b - a\n else:\n # a -> \"z\" -> \"a\" -> b\n return 122 - a + 1 + b - 97\n\n\ndef counterclockwise(a, b):\n if b <= a:\n return a - b\n else:\n # a -> \"a\" -> \"z\" -> b\n return a - 97 + 1 + 122 - b\n\n\n# Night in the Museam\ns = input()\n\nptr = 97\nans = 0\nfor i in range(len(s)):\n next = ord(s[i])\n # count CW\n cw = clockwise(ptr, next)\n # count CCW\n ccw = counterclockwise(ptr, next)\n ans += min(cw, ccw)\n ptr = next\n\nprint(ans)\n\t\t \t \t\t \t\t \t \t\t\t\t\t \t\t \t", "import math\r\ndef stringsprblmbrootal(s):\r\n set1=[x for x in \"abcdefghijklmnopqrstuvwxyz\"]\r\n alist=[t for t in s]\r\n count=min(26-set1.index(alist[0]),set1.index(alist[0]))\r\n for f in range(1,len(alist)):\r\n count+=abs(min(26-abs((set1.index(alist[f])-set1.index(alist[f-1]))),abs(set1.index(alist[f])-set1.index(alist[f-1]))))\r\n return count\r\nt=input()\r\nprint(stringsprblmbrootal(t))", "import string\n\ninp = input().lower()\n\nliters = list(string.ascii_lowercase)\nrot = 0\ncounter_1 = counter_2 = 0\nx1 = x2 = 0\nfor i in inp:\n\n while liters[x1] != i and x1 <= 25:\n x1 += 1\n if x1 == 26:\n x1 = 0\n counter_1 += 1\n\n while liters[x2] != i and x2 >= -26:\n x2 += -1\n counter_2 += 1\n rot += min(counter_1, counter_2)\n x2 = x1\n counter_1 = counter_2 = 0\n\nprint(rot)\n\n", "s = input()\r\nn = len(s)\r\nlal = ord(s[0])-ord('a')\r\nscore = min(26-lal,lal)\r\n\r\nfor i in range(1,n):\r\n if s[i]>=s[i-1]:\r\n lal = ord(s[i])-ord(s[i-1])\r\n score += min(lal,26-lal)\r\n else:\r\n lal = 26+ord(s[i])-ord(s[i-1])\r\n score += min(lal,26-lal)\r\n \r\nprint(score)", "word = input()\r\npre = \"a\"\r\nro = 0\r\nfor l in word:\r\n dif = abs(ord(l) - ord(pre))\r\n ro += min(dif, 26 - dif)\r\n pre = l\r\n\r\nprint(ro)\r\n", "s=input()\r\ns=list(s)\r\n\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\nalpha=alpha.split(', ')\r\n\r\na='a'\r\ne=0\r\nfor i in s:\r\n r=abs(((alpha.index(i)) - (alpha.index(a))))\r\n if r >= 13 :\r\n e+= (26- r)\r\n else :\r\n e+=r\r\n a=i\r\n \r\nprint(e)", "c=97\r\ns=0\r\nfor x in input():\r\n\ti=abs(c-ord(x))\r\n\ts+=min(i,26-i)\r\n\tc=ord(x)\r\nprint(s)", "#Night at the Museum\nname = input()\nj = 'a'\ntotal = 0\nfor i in name:\n turns = abs(ord(i) - ord(j))\n if turns>13:\n total += 26-turns\n\n else:\n total += turns\n j = i\nprint(total)\n ", "s = input()\r\nstart = 0\r\nans = 0\r\nfor i in s:\r\n index = ord(i) - 97\r\n walk = abs(start - index)\r\n if walk < 13:\r\n ans += walk\r\n else:\r\n ans += 26 - walk\r\n start = index\r\nprint(ans)\r\n ", "s = list(input())\ncount = 0\nlst = ['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']\nfirst = 'a'\nfor i in range(len(s)):\n then = s[i]\n value = lst.index(then) - lst.index(first)\n if abs(value) < (26 - abs(value)):\n count += abs(value)\n else:\n count += (26 - abs(value))\n first = s[i]\nprint(count)", "res=0; c=1; \r\nfor i in input(): \r\n r = ord(i) - 96 ;res += min(abs(c -r), abs(26 - abs(c-r))) ;c = r\r\nprint(res)\r\n ", "s = input()\r\n\r\nsol = 0\r\nx = 'a'\r\nfor i in range(len(s)):\r\n cost = min(abs(ord(s[i]) - ord(x)), abs(ord(x) + 26 - ord(s[i])), abs(ord(s[i]) + 26 - ord(x)))\r\n sol += cost\r\n # print(x, s[i], cost)\r\n x = s[i]\r\nprint(sol)", "import string\r\n\r\ndict ={}\r\nfor i, letter in enumerate(list(string.ascii_lowercase)):\r\n dict[letter] = i\r\n\r\ns = input()\r\n\r\nsum = 0\r\nstart = \"a\"\r\nfor char in s:\r\n end = char\r\n sum += min([abs(dict[end] - dict[start]), abs(dict[end] + 26 - dict[start]), abs(dict[end] - dict[start] - 26)]) \r\n start = char\r\n\r\nprint(sum)", "a=input()\r\nc=\"a\"+a\r\ncount=0\r\nfor i in range(len(c)-1):\r\n if ord(c[i])<=109:\r\n if ord(c[i])-ord(c[i+1])+26>abs(ord(c[i])-ord(c[i+1])):\r\n count+=abs(ord(c[i])-ord(c[i+1]))\r\n else:\r\n count+=ord(c[i])-ord(c[i+1])+26\r\n else:\r\n if ord(c[i+1])-ord(c[i])+26>abs(ord(c[i])-ord(c[i+1])):\r\n count+=abs(ord(c[i])-ord(c[i+1]))\r\n else:\r\n count+=ord(c[i+1])-ord(c[i])+26\r\nprint(count)\r\n", "def findMin(letter1 , letter2) :\r\n right = abs(ord(letter1) - ord(letter2)) - 1\r\n left1 = abs(ord(letter1) - ord(\"a\")) + abs(ord(letter2) - ord(\"z\"))\r\n left2 = abs(ord(letter1) - ord(\"z\")) + abs(ord(letter2) - ord(\"a\"))\r\n return sorted([right , left1 , left2])[0] + 1\r\n\r\ntext = list(input())\r\ncount = 0\r\nif text[0] != \"a\" :\r\n count += findMin(\"a\" , text[0])\r\nfor letter in range(len(text) - 1) :\r\n count += findMin(text[letter] , text[letter + 1])\r\nprint(count)", "from math import *\r\ns=input()\r\nres=0\r\nind='a'\r\nfor i in range(len(s)):\r\n if int(fabs(ord(s[i])-ord(ind)))>=13:\r\n res+=26-int(fabs(ord(s[i])-ord(ind)))\r\n else:\r\n res+=int(fabs(ord(s[i])-ord(ind)))\r\n ind=s[i]\r\nprint(res)", "st=input()\r\nd={}\r\nj=1\r\nfor i in 'abcdefghijklmnopqrstuvwxyz':\r\n d[i]=j\r\n j+=1\r\ntot=0\r\npointer=1\r\n#zeus\r\n# z - 26 , e 5\r\n# 5 - 26 or \r\n# 21 -5 or 26 - 21 - 5\r\nfor i in st:\r\n if abs(d[i]-pointer) > 26-abs(d[i]-pointer):\r\n tot+=26-abs(d[i]-pointer)\r\n \r\n else:\r\n tot+=abs(d[i]-pointer)\r\n\r\n pointer=d[i]\r\nprint(tot)", "wheel = \"abcdefghijklmnopqrstuvwxyz\" # я бы хотела, вернуть указатели...\r\n # да простит меня бог за эти слова...\r\nword = input()\r\n\r\ncount = 0\r\nfor i in word:\r\n index_left = wheel.find(i)\r\n index_right = wheel.rfind(i) - 26\r\n if abs(index_right) > index_left:\r\n count += index_left\r\n else:\r\n count += abs(index_right)\r\n wheel = wheel[index_left:] + wheel[:index_right]\r\n # print(index_left, -index_right)\r\n #print(count, wheel)\r\nprint(count)", "word = input()\r\npa = 97\r\npz = 122\r\nlit = 97\r\ns = 0\r\nfor i in word:\r\n if lit - pa + pz - int(ord(i))+1 <= abs(int(ord(i))-lit) and lit - pa + pz - int(ord(i))+1 <= pz - lit + 1 + int(ord(i)) - pa:\r\n s+=lit - pa + pz - int(ord(i))+1\r\n lit = int(ord(i))\r\n elif abs(int(ord(i))-lit) <= pz - lit + 1 + int(ord(i)) - pa:\r\n s+= abs(int(ord(i))-lit)\r\n lit = int(ord(i))\r\n else: \r\n s+= pz - lit + 1 + int(ord(i)) - pa\r\n lit = int(ord(i))\r\n\r\nprint(s)\r\n\r\n\r\n", "l=\"abcdefghijklmnopqrstuvwxyz\"\r\na=\"a\"+input()\r\nSUM=0\r\nfor i in range(len(a)-1):\r\n x=abs(l.find(a[i])-l.find(a[i+1]))\r\n if x>13:\r\n x=26-x\r\n SUM+=x\r\nprint(SUM)", "a=input()\r\ns1=0;diff=0\r\nx='a'\r\nfor i in range(len(a)):\r\n diff=abs(ord(a[i])-ord(x))\r\n if diff<=13:\r\n s1+=diff\r\n else:\r\n s1+=(26-diff)\r\n x=a[i]\r\nprint(s1)", "word = input()\r\nb = 'abcdefghijklmnopqrstuvwxyz'\r\nsumm = 0\r\nc = 0\r\nfor i in word:\r\n p = b.index(i)\r\n summ += min(abs(abs(p - 25) + c + 1), min(abs(p - c), abs(c - 25) + p + 1))\r\n c = p\r\nprint(summ)", "import string\r\n\r\nalph = string.ascii_lowercase\r\n\r\nptr = 'a'\r\nans = 0\r\ns = input()\r\nfor i in range(len(s)):\r\n ans += min(abs(alph.index(ptr) - alph.index(s[i])), abs(26 + min(alph.index(ptr),alph.index(s[i])) - max(alph.index(ptr),alph.index(s[i]))))\r\n ptr = s[i]\r\n\r\n\r\nprint(ans)\r\n", "dict={'a':1,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8,'i':9,'j':10,'k':11,'l':12,'m':13,'n':14,'o':15,'p':16,'q':17,'r':18,'s':19,'t':20,'u':21,'v':22,'w':23,'x':24,'y':25,'z':26}\r\ns=input()\r\ns1=dict['a']\r\nresult=0\r\nfor i in s:\r\n s2=abs(dict[i]-s1)\r\n if s2>13:\r\n result+=(26-s2)\r\n else:\r\n result+=s2\r\n s1=dict[i]\r\nprint(result)", "n = str(input())\r\nem = 'abcdefghijklmnopqrstuvwxyz'\r\npol = 0\r\nsum = 0\r\nfor i in range(len(n)):\r\n if abs((em.index(n[i]) - pol)) < 26 -abs(em.index(n[i]) - pol):\r\n sum += abs(em.index(n[i]) - pol)\r\n else:\r\n sum += 26 - abs(em.index(n[i]) - pol)\r\n pol = em.index(n[i])\r\n\r\nprint(sum)", "s = input()\n\nprev = 'a'\ncount = 0\nfor c in s:\n nextnum = min((ord(c) - ord(prev)) % 26, (ord(prev) - ord(c)) % 26)\n count += nextnum\n prev = c\nprint(count)\n", "exhibit_name = input() \n\nrotations = 0 \n\ncurrent_letter = 'a' \n\nfor letter in exhibit_name:\n distance = abs(ord(letter) - ord(current_letter)) \n rotations += min(distance, 26 - distance) \n current_letter = letter \n\nprint(rotations)\n\t \t \t\t\t \t\t\t \t \t\t\t \t\t \t\t", "s = input()\r\ncurrent = \"a\"\r\ncount = 0\r\nfor i in s:\r\n if abs(ord(i)-ord(current)) < 26 - abs(ord(i)-ord(current)):\r\n count += abs(ord(i)-ord(current))\r\n else:\r\n count += (26 - abs(ord(i)-ord(current)))\r\n current = i\r\n\r\nprint(count)", "letters = 'abcdefghijklmnopqrstuvwxyz'\r\nmax_of_turn = 0\r\nword = input()\r\n\r\ncur_pos = 0\r\ni = 0\r\nend = len(word)\r\nwhile i < end:\r\n\tcur_turn = abs(cur_pos - letters.index(word[i]))\r\n\tif cur_turn > 13:\r\n\t\tcur_turn = 26 - abs(cur_pos - letters.index(word[i]))\r\n\tmax_of_turn += cur_turn\r\n\tcur_pos = letters.index(word[i])\r\n\ti += 1\r\nprint(max_of_turn)", "w=input()\r\nc=0\r\npointer='a'\r\nfor i in w:\r\n x=ord(pointer)-97\r\n y=ord(i)-97\r\n c+=min(abs(x-y),26-abs(x-y))\r\n pointer=i\r\nprint(c)\r\n ", "while True:\r\n try:\r\n str0 = input()\r\n sum1 = 0\r\n t = 'a'\r\n for i in range(len(str0)):\r\n x = abs(ord(str0[i]) - ord(t))\r\n y = 26 - x\r\n if x < y:\r\n sum1 += x\r\n else:\r\n sum1 += y\r\n t = str0[i]\r\n print(sum1)\r\n except:\r\n break", "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\nb = input()\r\nf =0\r\nfor i in b:\r\n c = a.index(i)\r\n d = 26 - c\r\n a = a[a.index(i):] + a[:a.index(i)]\r\n f += min(c,d)\r\nprint(f)", "s = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n if i == 0:\r\n ans += min(abs(ord(s[i]) - ord('a')), 26 - abs(ord(s[i]) - ord('a')))\r\n else:\r\n ans += min(abs(ord(s[i]) - ord(s[i - 1])), 26 - abs(ord(s[i]) - ord(s[i - 1])))\r\n\r\nprint(ans)\r\n", "s=str(input())\r\nrotations=min(abs(ord(\"a\")-ord(s[0])),26-abs(ord(\"a\")-ord(s[0])))\r\nfor i in range(1,len(s)):\r\n rotations=rotations+min(abs(ord(s[i-1])-ord(s[i])),26-abs(ord(s[i-1])-ord(s[i])))\r\nprint(rotations)", "def main():\r\n\r\n s = input()\r\n start = ord('a')\r\n\r\n count = 0\r\n\r\n for i in range(len(s)):\r\n diff1 = abs(ord(s[i]) - start)\r\n diff2 = 26 - abs(diff1)\r\n count += min(diff1, diff2)\r\n start = ord(s[i])\r\n\r\n print(count)\r\n \r\nif __name__ == \"__main__\":\r\n main()", "word = input()\r\nimport string\r\nletters = string.ascii_lowercase\r\n\r\ndist=0\r\ntemp = 'a'\r\nfor i in word:\r\n clockwise =abs(letters.index(i) - letters.index(temp))\r\n counter_clock = 26 - clockwise\r\n if clockwise < counter_clock:\r\n dist = dist +clockwise\r\n else:\r\n dist = dist +counter_clock\r\n temp = i\r\n\r\nprint(dist)\r\n", "chars = 'abcdefghijklmnopqrstuvwxyz'\r\nchars = list(chars)\r\ns = input()\r\nprev = s[0]\r\nres = min(chars.index(prev), 26 - chars.index(prev))\r\nfor i in range(1, len(s)):\r\n prev_idx = chars.index(prev)\r\n curr_idx = chars.index(s[i])\r\n d1 = abs(curr_idx - prev_idx)\r\n d2 = 26 - d1\r\n res += min(d1,d2)\r\n prev = s[i]\r\nprint(res)", "start = ord('a')\r\nword = input()\r\ncount = 0\r\n\r\nfor letter in word :\r\n if letter == start:\r\n continue \r\n elif ord(letter) > start : \r\n count+= min((ord(letter)-start,abs(abs(ord(letter)-start)-26)))\r\n start = ord(letter)\r\n continue;\r\n else :\r\n count+=min((start-ord(letter),abs(abs(ord(letter)-start)-26)))\r\n start=ord(letter)\r\n continue;\r\n \r\nprint(count)", "def solve():\n s = str(input())\n result = 0\n t = 'a'\n for i in range(len(s)):\n result+=min(abs(ord(s[i])-ord(t)), 26-abs(ord(s[i])-ord(t)))\n t = s[i]\n print(result)\n\n\nif __name__ == '__main__':\n solve()", "def NightAtTheMeuseum(s):\r\n count=0\r\n for i in range(0,len(s)):\r\n if i==0:\r\n count += min(abs(ord(s[i]) - 97), abs(abs(ord(s[i]) - 97) - 26))\r\n else:\r\n count += min(abs(ord(s[i]) - ord(s[i-1])), abs(abs(ord(s[i]) - ord(s[i-1])) - 26))\r\n return count\r\ns=input()\r\nprint(NightAtTheMeuseum(s))", "def distance_between_characters(ch1, ch2):\r\n distance_clockwise = abs(ord(ch1) - ord(ch2))\r\n distance_counterclockwise = 26 - distance_clockwise\r\n\r\n return min(distance_counterclockwise, distance_clockwise)\r\n\r\n\r\ns = input()\r\n\r\ntotal_rotations = 0\r\ncurrent = 'a'\r\n\r\nfor ch in s:\r\n total_rotations += distance_between_characters(current, ch)\r\n current = ch\r\n\r\nprint(total_rotations)\r\n", "def letret(x):\r\n y = ord(x)\r\n return y-96\r\n\r\ndef mindis(x, y):\r\n if x==y:\r\n return 0\r\n ma = max(x, y)\r\n mi = min(x, y)\r\n return min((ma-mi), (mi-ma+26))\r\n\r\ns = str(input())\r\n\r\nans = 0\r\n\r\ns = \"a\" + s\r\n\r\nfor i in range(len(s)-1):\r\n ans = ans + mindis(letret(s[i]), letret(s[i+1]))\r\n\r\nprint(ans)\r\n", "c = 97\ns = 0\nfor x in map(ord, input()):\n i = abs(c - x)\n s += min(i, 26 - i)\n c = x\nprint(s)\n", "mydic = {\r\n 'A': 1,\r\n 'B': 2,\r\n 'C': 3,\r\n 'D': 4,\r\n 'E': 5,\r\n 'F': 6,\r\n 'G': 7,\r\n 'H': 8,\r\n 'I': 9,\r\n 'J': 10,\r\n 'K': 11,\r\n 'L': 12,\r\n 'M': 13,\r\n 'N': 14,\r\n 'O': 15,\r\n 'P': 16,\r\n 'Q': 17,\r\n 'R': 18,\r\n 'S': 19,\r\n 'T': 20,\r\n 'U': 21,\r\n 'V': 22,\r\n 'W': 23,\r\n 'X': 24,\r\n 'Y': 25,\r\n 'Z': 26,\r\n}\r\nstr = input().upper()\r\npointer = 'A'\r\nrotations= 0\r\n\r\nfor char in str :\r\n go = abs(mydic[pointer] - mydic[char])\r\n if go<13:\r\n rotations+= go\r\n else :\r\n rotations+=26- go\r\n pointer= char\r\nprint(rotations)", "value = list(input())\nalphabet = {\n 'a' : '1', 'b' : '2','c' : '3','d' : '4','e' : '5',\n 'f' : '6','g' : '7','h' : '8','i' : '9','j' : '10', \n 'k' : '11','l' : '12','m' : '13','n' : '14','o' : '15', \n 'p' : '16','q' : '17','r' : '18','s' : '19','t' : '20', \n 'u' : '21','v' : '22','w' : '23', 'x' : '24','y' : '25', \n 'z' : '26'}\nflag=0\ncurrent = int(alphabet['a'])\nfor i in value:\n temp=int(alphabet[i])\n\n if abs(current-int(alphabet[i]))<(26-abs(current-int(alphabet[i]))):\n flag+=abs(current-int(alphabet[i]))\n else:\n flag+=(26-abs(current-int(alphabet[i])))\n current=temp\nprint(flag)\n\n\n", "s=input()\r\npointer='a'\r\nsteps=0\r\nfor i in range(0,len(s),1):\r\n steps+=min(abs(ord(pointer)-ord(s[i])),26-abs(ord(pointer)-ord(s[i])))\r\n pointer=s[i]\r\nprint(steps)", "import sys\r\nimport string\r\ns = sys.stdin.readline()[:-1]\r\n\r\nabc = string.ascii_lowercase\r\n\r\n\r\n\r\nrotate_count = 0\r\nlast_index = 0\r\n\r\nfor x in s:\r\n current_index = abc.index(x)\r\n \r\n if abs(current_index - last_index) <= 12:\r\n rotate_count += abs(current_index - last_index)\r\n else:\r\n rotate_count += 25 - max(current_index, last_index) + min(current_index, last_index) + 1\r\n \r\n last_index = current_index\r\n\r\nprint(rotate_count)\r\n", "name = input() \r\nstart_of_wheel = 'a' \r\nfirst_letter = name[0] \r\nsum = 0 \r\n\r\nfor i in range(1, len(name)):\r\n difference = abs(ord(start_of_wheel) - ord(first_letter))\r\n sum = sum + min(difference, 26 - difference)\r\n start_of_wheel = first_letter\r\n first_letter = name[i]\r\n\r\ndifference = abs(ord(start_of_wheel) - ord(first_letter))\r\nsum = sum + min(difference, 26 - difference)\r\n\r\nprint(sum)# 1698327970.4218972", "char_Arr=['a',\r\n 'b',\r\n 'c',\r\n 'd',\r\n 'e',\r\n 'f',\r\n 'g',\r\n 'h',\r\n 'i',\r\n 'j',\r\n 'k',\r\n 'l',\r\n 'm',\r\n 'n',\r\n 'o',\r\n 'p',\r\n 'q',\r\n 'r',\r\n 's',\r\n 't',\r\n 'u',\r\n 'v',\r\n 'w',\r\n 'x',\r\n 'y',\r\n 'z'\r\n\r\n]\r\n\r\nstaticPointer=char_Arr[0]\r\nword=input()\r\nword_array=list(word)\r\naccumaltiveCounter=0\r\nfor i in range(0,len(word_array)):\r\n secondPointer=word_array[i]\r\n indexstatic=char_Arr.index(staticPointer)\r\n indexsecond=char_Arr.index(secondPointer)\r\n accumaltiveCounter+=min(abs(indexstatic-indexsecond),26-(abs(indexstatic-indexsecond)))\r\n staticPointer=word_array[i]\r\n\r\nprint(accumaltiveCounter)", "exhibits = list(input())\r\ncounter = 0\r\nstatic = 'a'\r\n\r\nfor exhibit in exhibits:\r\n nexti = exhibit\r\n distance = abs(ord(static) - ord(nexti))\r\n counter += min(distance, 26 - distance)\r\n static = nexti\r\n\r\nprint(counter)", "s = input()\na = 'a'\ns1 = 0\nfor i in s:\n a1 = a\n while i != a and i != a:\n if a == 'z' :\n a = 'a'\n else:\n a = chr(ord(a) + 1)\n if a1 == 'a':\n a1 = 'z'\n else:\n a1 = chr(ord(a1) - 1)\n s1 += 1\n if a == i or i == a1:\n break\n a = i\nprint(s1)\n", "s=input()\r\ncnt,last=0,0\r\nfor i in s:\r\n cur = ord(i)-ord('a')\r\n a,b=min(last,cur),max(last,cur)\r\n cnt+=min(b-a,26+a-b)\r\n last=cur\r\nprint(cnt)", "s = input()\ninit = 'a'\nfinal = s[0]\nout = 0\n\nfor i in range(len(s)):\n final = s[i]\n value = ord(final) - ord(init)\n if value >= 0:\n out += min(value , 26 - value)\n else:\n out += min(-value , 26 + value)\n init = final\n \nprint(out)\n\n\t \t \t \t\t\t \t \t \t \t\t \t \t\t", "def distant(t,i):\r\n s = 'abcdefghijklmnopqrstuvwxyz'\r\n r1 = abs(s.index(t) - s.index(i))\r\n r2 = 26-r1\r\n return(min(r1,r2))\r\n\r\ns = input()\r\nk = 0\r\nt='a'\r\nfor i in s:\r\n k += distant(t,i)\r\n t = i\r\n\r\nprint(k)", "c=97;s=0;\r\nfor x in map(ord,input()):\r\n\ti=abs(c-x)\r\n\ts+=min(i,26-i)\r\n\tc=x\r\nprint(s)\r\n\r\n", "def main():\n word = input()\n\n rotations = 0\n current_letter = 'a'\n for letter in word:\n a = (ord(current_letter) - ord(letter)) % 26\n b = (ord(letter) - ord(current_letter)) % 26\n rotations += min(a, b)\n current_letter = letter\n\n print(rotations)\n\n\nif __name__ == '__main__':\n main()\n", "x=input()\r\nref=ord('a')\r\nSol=0\r\nfor i in x:\r\n temp=13-abs(13-abs(ord(i)-ref))\r\n Sol+=temp\r\n ref=ord(i)\r\nprint(Sol)", "import sys\r\nimport heapq\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n abjad = list(\"abcdefghijklmnopqrstuvwxyz\")\r\n s = [item for item in list(input())]\r\n hitung = 0\r\n titik = \"a\"\r\n for x in s:\r\n depan = abs(abjad.index(x) - abjad.index(titik))\r\n bealkang = 26 - depan\r\n titik = x\r\n hitung += min(depan,bealkang)\r\n print(hitung)\r\n \r\n\r\n \r\nif __name__ == '__main__':\r\n main()", "s = input()\r\nctr = 0\r\ncur = 'a'\r\n\r\nfor x in s:\r\n\td = abs(ord(x) - ord(cur))\r\n\tctr += min(d, 26-d)\r\n\tcur = x\r\n\t\r\nprint(ctr)", "import sys\n\ninput = sys.stdin.readline\n\nMOD = 26\ns = input()\nletters = list(s[: len(s) - 1])\narrow = 0\nturns = 0\n\nfor letter in letters:\n target = ord(letter) - ord(\"a\")\n if arrow != target:\n turns = turns + min((target - arrow + MOD) % MOD, (-target + arrow + MOD) % MOD)\n\n arrow = target\n\nprint(turns)\n", "from string import ascii_lowercase as alph\r\n\r\ns = input()\r\nind = 0\r\nans = 0\r\nfor x in s:\r\n if alph.index(x) == ind:\r\n continue\r\n #Left side\r\n if alph.index(x) < ind:\r\n l = ind - alph.index(x)\r\n else:\r\n l = ind + 26 - alph.index(x)\r\n #Right side\r\n if ind < alph.index(x):\r\n r = alph.index(x) - ind\r\n else:\r\n r = alph.index(x) + 26 - ind\r\n ans += min(l, r)\r\n ind = alph.index(x)\r\nprint(ans)", "from bisect import bisect_right\r\nimport math\r\nfrom queue import PriorityQueue\r\nfrom sys import stdin, stdout\r\nimport collections\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 chk(s):\r\n for i in range(1, len(s)):\r\n if s[i] >= s[i-1]:\r\n return False\r\n return True\r\n\r\n\r\ndef nc2(val):\r\n return val*(val-1)//2\r\n\r\n\r\ndef main():\r\n s = str_input()\r\n cur = 'a'\r\n ans = 0\r\n for ch in s:\r\n ind1 = ord(cur)-ord('a')\r\n ind2 = ord(ch)-ord('a')\r\n if ind1 > ind2:\r\n ind1, ind2 = ind2, ind1\r\n ans += min(ind2-ind1, 26-ind2+ind1)\r\n cur = ch\r\n print(f\"{ans}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "string = input()\r\nrotations = 0\r\ninitial = 'a'\r\n\r\nfor char in string:\r\n\r\n x = abs((ord(char) - ord(initial)))\r\n\r\n if x < 13:\r\n rotations += x\r\n\r\n else:\r\n rotations += (26 - x)\r\n initial = char\r\n\r\n\r\n\r\nprint(rotations)", "import sys, math, cmath, time, collections\r\nfrom collections import *\r\nfrom heapq import *\r\nfrom math import *\r\nfrom bisect import *\r\n\r\n\r\n# SOLUTION BEGINS HERE\r\n\r\nstart_time = time.time()\r\n\r\n\r\ndef solve(string):\r\n \"\"\"\r\n Actual solution\r\n \"\"\"\r\n alpha = 'abcdefghijklmnopqrstuvwxyz'\r\n alpha = [c for c in alpha]\r\n limit = list(range(0, 26))\r\n hmap = dict(zip(alpha, limit))\r\n\r\n cnt = 0\r\n\r\n\r\n start = 'a'\r\n\r\n for ch in string:\r\n candidates = [hmap[start], hmap[start] + 26, hmap[ch], hmap[ch] + 26]\r\n candidates = sorted(candidates)\r\n\r\n total = float('inf')\r\n for c in zip(candidates, candidates[1:]):\r\n res = abs(c[0]-c[1])\r\n if res < total:\r\n total = res\r\n\r\n start = ch\r\n cnt += total\r\n\r\n print(cnt)\r\n\r\n\r\ndef main():\r\n \"\"\"\r\n Main function dedicated to get the I/P\r\n a, b = map(int, input().split())\r\n solve(a, b)\r\n \"\"\"\r\n s = input()\r\n solve(s)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n LOCAL = False\r\n\r\n # If it's Local - Get I/P from file\r\n if LOCAL:\r\n sys.stdin = open(\"../io/data.in\", \"r\")\r\n sys.stdout = open(\"../io/data.out\", \"w\")\r\n\r\n testcases = 1\r\n for i in range(testcases):\r\n main()\r\n\r\n # If it's local - Print this O/P\r\n if LOCAL:\r\n print(f\"Time Elapsed: {time.time() - start_time} seconds\")\r\n sys.stdout.close()", "letters = input()\r\ncurrent = 'a'\r\nturns = 0\r\n \r\nfor letter in letters:\r\n temp = abs(ord(letter) - ord(current))\r\n \r\n if temp < 13:\r\n turns += temp\r\n else:\r\n turns += 26 - temp\r\n \r\n current = letter\r\n \r\nprint(turns)", "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\"\na = a.replace(\" \", \"\")\nt = 0\nc = 0\nfor x in input():\n l = c\n r = c\n while True:\n if x == a[l]:\n c = l\n break\n if x == a[r]:\n c = r\n break\n t += 1\n l -= 1\n if l < 0:\n l = 25\n r += 1\n if r > 25:\n r = 0\nprint(t)\n", "c = 97\ns = 0\nword = input()\nfor x in word:\n\tk = abs(c-ord(x))\n\ti = min(k, 26-k)\n\ts += i\n\tc=ord(x)\nprint(s)\n\t \t \t\t \t \t \t \t \t\t\t \t", "import string\r\n\r\ndict ={}\r\nfor i, letter in enumerate(list(string.ascii_lowercase)):\r\n dict[letter] = i\r\n\r\ns = input()\r\n\r\nstart = \"unassigned\"\r\n\r\ndef find_min_length(char):\r\n global start\r\n if start == \"unassigned\":\r\n start = \"a\"\r\n end = char\r\n number = min([abs(dict[end] - dict[start]), abs(dict[end] + 26 - dict[start]), abs(dict[end] - dict[start] - 26)])\r\n start = char\r\n return number \r\n\r\nsum = sum([find_min_length(char) for char in s])\r\n\r\nprint(sum)", "n = input()\r\n\r\ndef solve(n ) :\r\n sum = 0 \r\n init = 'a'\r\n for i in range(len(n)) :\r\n step = min(abs(ord(init) - ord(n[i])) , abs(26 - abs(ord(init) - ord(n[i])) ) )\r\n sum += step\r\n init = n[i]\r\n 101 - 122 , 101 + 26 - 122\r\n \r\n\r\n \r\n return sum\r\n\r\nprint(solve(n ))", "s = list(input())\r\nl = len(s)\r\nc = 0\r\nd = abs(ord(s[0])-ord('a'))\r\nif d<=13:\r\n c+=d\r\nelse:\r\n c+=(26-d)\r\nfor i in range(l-1):\r\n d = abs(ord(s[i])-ord(s[i+1]))\r\n if d<=13:\r\n c+=d\r\n else:\r\n c+=(26-d)\r\nprint(c)", "a = 'a'+input()\r\nr = 0\r\nfor i in range(1,len(a)):\r\n x = abs(ord(a[i]) - ord(a[i-1]))\r\n y = abs(x - 26)\r\n r += min(x,y)\r\nprint(r)\r\n", "a = \"abcdefghijklmnopqrstuvwxyz\"\nb = input()\nson = 0\nfor i in range(len(b)-1):\n c = a.index(b[i])\n d = a.index(b[i+1])\n liste = [abs(d-c),26-abs(d-c)]\n s = min(liste)\n son += s\nx = a.index(b[0]) - 0\ny = 26 - x\nson += min(x,y)\nprint(son)\n \n \n\n", "seq = input()\r\n\r\ndef main(seq: str):\r\n res = 0\r\n res += min(abs(ord(seq[0]) - ord('a')), 26 - abs(ord('a') - ord(seq[0])))\r\n for i in range(1 , len(seq)):\r\n res += min(abs( ord(seq[i]) - ord(seq[i-1]) ), 26 - abs( ord(seq[i-1]) - ord(seq[i]) ))\r\n return res\r\n\r\nprint(main(seq))", "x = input()\r\nchar = 'a'\r\ns = 0\r\nfor i in range(len(x)):\r\n c = abs(ord(x[i]) - ord(char))\r\n a = abs(26 - c)\r\n if a >= c:\r\n s = s + c\r\n else:\r\n s = s + a\r\n char = x[i]\r\nprint(s)", "wheel = input()\r\ncurrent = 'a'\r\ncount = 0\r\n\r\nfor c in wheel:\r\n dist = abs(ord(current) - ord(c))\r\n\r\n if dist < 13:\r\n count = count + dist\r\n else:\r\n count = count + (26 - dist)\r\n current = c\r\nprint(count)", "def distance_betweens_characters(char1, char2):\r\n clockwise_distance = abs(ord(char1) - ord(char2))\r\n counterclockwise_distance = 26 - clockwise_distance\r\n return min(clockwise_distance, counterclockwise_distance)\r\n\r\n\r\ndef solve(name):\r\n current_position = 'a'\r\n total_rotations = 0\r\n\r\n for char in name:\r\n total_rotations += distance_betweens_characters(current_position, char)\r\n current_position = char\r\n\r\n return total_rotations\r\n\r\n\r\nname = input()\r\nresult = solve(name)\r\nprint(result)\r\n", "l=input()\r\nans=0\r\ns=ord('a')\r\n\r\nfor i in range(len(l)):\r\n d=ord(l[i])\r\n dist=abs(s-d)\r\n if dist>13:\r\n ans+=26-dist\r\n else:\r\n ans+=dist\r\n s=ord(l[i])\r\n\r\nprint(ans)", "s = input()\r\np_c = 'a'\r\nt = 0\r\n\r\nfor c in s:\r\n t += min(abs(ord(c) - ord(p_c)), 26 - abs(ord(c) - ord(p_c)))\r\n p_c = c\r\n \r\nprint(t)", "f=input()\r\n\r\nr=0\r\nprev=ord('a')\r\nfor i in f:\r\n diff=abs(ord(i)-prev)\r\n if diff>13:\r\n r+=26-diff\r\n else:\r\n r+=diff\r\n prev=ord(i)\r\nprint(r)", "s = list(\"a\" + input())\r\nprint(sum([min(abs(ord(s[i]) - ord(s[i - 1])), 26 - abs(ord(s[i]) - ord(s[i - 1]))) for i in range(1, len(s))]))\r\n", "a,s=97,0\r\nfor i in map(ord,input()):\r\n s+=min(abs(i-a),26-abs(i-a))\r\n a=i\r\nprint(s)", "s=input()\r\nc=0\r\ncur='a'\r\nfor i in s:\r\n n1=abs(ord(cur)-ord(i))\r\n n2=26-n1\r\n if n1>n2:\r\n c+=n2\r\n else:\r\n c+=n1\r\n cur=i\r\nprint(c)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n#can use ord of x and then - with y\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): # one integer input\r\n return(int(input()))\r\ndef inlt(): # list input\r\n return(list(map(int,input().split())))\r\ndef insr(): # string input\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr(): # muliple integer variables input\r\n return(map(int,input().split()))\r\n\r\nline_1 = insr()\r\nrotations = 0\r\ndistance = ord(line_1[0]) - ord(\"a\")\r\n\r\nif distance < 13:\r\n rotations += distance\r\nelse:\r\n rotations += 26 - distance\r\n\r\n\r\nfor i in range(len(line_1) - 1):\r\n if ord(line_1[i + 1]) >= ord(line_1[i]):\r\n distance = ord(line_1[i + 1]) - ord(line_1[i])\r\n \r\n if ord(line_1[i + 1]) < ord(line_1[i]):\r\n distance = ord(line_1[i]) - ord(line_1[i + 1])\r\n\r\n if distance < 13:\r\n rotations += distance\r\n else:\r\n rotations += 26 - distance\r\n\r\nprint(rotations)", "word = list(input())\r\nword.insert(0, \"a\")\r\ntotal = 0\r\nfor i in range(len(word)-1):\r\n difference = abs(ord(word[i]) - ord(word[i+1]))\r\n temp_total = min(difference, 26-difference)\r\n total += temp_total\r\nprint(total)\r\n \r\n", "def solve():\r\n slovar = 'abcdefghijklmnopqrstuvwxyz'\r\n l = len(slovar)\r\n c, x, y = 0, 0, 0\r\n s = input()\r\n for i in range(len(s) - 1):\r\n for j in range(len(slovar)):\r\n if s[i] == slovar[j]:\r\n x = j\r\n break\r\n for j in range(len(slovar)):\r\n if s[i + 1] == slovar[j]:\r\n y = j\r\n break\r\n c += min(abs(x - y), l - abs(x - y))\r\n x, y = 0, 0\r\n for j in range(len(slovar)):\r\n if s[0] == slovar[j]:\r\n y = j\r\n break\r\n c += min(y, l - y)\r\n print(c)\r\n return\r\nsolve()", "s=input()\r\nx=97\r\ny=0\r\nfor i in range(0,len(s)):\r\n diff=abs(x-ord(s[i]))\r\n y+=min(diff,26-diff)\r\n x=ord(s[i])\r\nprint(y)", "s=input()\r\nf=0\r\npre='a'\r\nfor i in s:\r\n a=abs(ord(i)-ord(pre))\r\n f+=min(a,26-a)\r\n pre=i\r\nprint(f)", "import string\r\nl=list(string.ascii_lowercase)\r\ns=input()\r\ncursor='a'\r\nm=''\r\ncount=0\r\nn=0\r\nwhile s!=m:\r\n if cursor==s[n]:\r\n m+=cursor\r\n n+=1\r\n else:\r\n ic=l.index(cursor)\r\n ir=l.index(s[n])\r\n if s[n]>cursor:\r\n p1=ir-ic\r\n p2=(26-ir)+ic\r\n count+=min(p1,p2)\r\n cursor=s[n]\r\n m+=cursor\r\n n+=1\r\n else:\r\n p1=ic-ir\r\n p2=(26-ic)+ir\r\n count+=min(p1,p2)\r\n cursor=s[n]\r\n m+=cursor\r\n n+=1\r\nprint(count)", "def night_at_the_museum():\r\n name = input()\r\n moves = 0\r\n current = 'a'\r\n for letter in name:\r\n moves += min(\r\n abs(ord(current) - ord(letter)), 26-abs(ord(current) - ord(letter))\r\n )\r\n current = letter\r\n return moves\r\nprint(night_at_the_museum())\r\n \r\n", "s = input()\r\nans = 0\r\np = 0\r\nfor t in s:\r\n c = ord(t)-97\r\n ans += min((26+p-c)%26,(26+c-p)%26)\r\n p = c\r\nprint(ans)\r\n", "import string\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\nfirst = insr()\r\n\r\npos = 0\r\nans = 0\r\n\r\nfor char in first:\r\n newpos = string.ascii_lowercase.index(char)\r\n diff = abs(newpos - pos)\r\n if diff > 13:\r\n ans += abs(26 - diff)\r\n else:\r\n ans += diff\r\n\r\n pos = newpos\r\n\r\n\r\nprint(ans)\r\n", "def main():\r\n pointer='a'\r\n nameOfStatue=input()\r\n coubter=0\r\n for i in range(len(nameOfStatue)):\r\n range1=abs(ord(pointer)-ord(nameOfStatue[i]))\r\n if(range1 < abs(26-(range1)) ):\r\n coubter+=range1\r\n else:\r\n coubter+=abs(26-range1) \r\n pointer=nameOfStatue[i]\r\n \r\n\r\n \r\n \r\n\r\n\r\n print(coubter)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "q = 'abcdefghijklmnopqrstuvwxyz'\r\ns = input()\r\nans = 0\r\nfor i in range(1, len(s)):\r\n ans0 = q. index(s[i - 1])\r\n ans1 = q. index(s[i])\r\n absans01 = abs(ans0 - ans1)\r\n kol0 = 26 - q. index(max(s[i - 1], s[i]))\r\n kol1 = q. index(min(s[i - 1], s[i]))\r\n pluskol01 = kol0 + kol1\r\n ans += min(absans01, pluskol01)\r\nzz = q. index(s[0])\r\nxx = 26 - zz\r\nmn = min(zz, xx)\r\nprint(ans + mn)\r\n", "Alph = list('abcdefghijklmnopqrstuvwxyz')\r\nS = list(input().lower())\r\nZero = 0\r\nsum = 0\r\nfor i in S:\r\n Tar = Alph.index(i)\r\n sum += min(abs(Tar-Zero), len(Alph) - abs(Tar-Zero))\r\n Zero = Tar\r\nprint(sum)", "class Node:\r\n\r\n def __init__(self, node):\r\n self.node = node\r\n self.previous = None\r\n self.next = None\r\n\r\n\r\nclass CircularLinkedList:\r\n\r\n def __init__(self):\r\n array = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p',\r\n 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\n self.temp_head = None\r\n prev_node = None\r\n for idx, item in enumerate(array):\r\n node = Node(item)\r\n if idx == 0:\r\n self.head = node\r\n else:\r\n node.previous = prev_node\r\n if idx == len(array) - 1:\r\n node.next = self.head\r\n self.head.previous = node\r\n prev_node.next = node\r\n prev_node = node\r\n\r\n def get_from_back(self, node):\r\n if self.head == node:\r\n return 0\r\n if self.head.previous == node:\r\n self.head = self.temp_head\r\n return 1\r\n self.head = self.head.previous\r\n return self.get_from_back(node) + 1\r\n\r\n def get_from_front(self, node):\r\n if self.head == node:\r\n return 0\r\n if self.head.next == node:\r\n self.head = self.temp_head\r\n return 1\r\n self.head = self.head.next\r\n return self.get_from_front(node) + 1\r\n\r\n def get_node(self, node):\r\n current = self.head\r\n while current.node != node:\r\n current = current.next\r\n return current\r\n\r\n def get_optimal_steps(self, node):\r\n n = self.get_node(node)\r\n self.temp_head = self.head\r\n opt = min(self.get_from_front(n), self.get_from_back(n))\r\n self.head = n\r\n return opt\r\n\r\n\r\nname = input()\r\nmoves = 0\r\nlst = CircularLinkedList()\r\nfor char in name:\r\n move = lst.get_optimal_steps(char)\r\n moves += move\r\nprint(moves)", "dict1={'a':1,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8,'i':9,'j':10,'k':11,'l':12,'m':13,'n':14,'o':15,'p':16,'q':17,'r':18,'s':19,'t':20,'u':21,'v':22,'w':23,'x':24,'y':25,'z':26}\r\ndict2={'a':27,'b':28,'c':29,'d':30,'e':31,'f':32,'g':33,'h':34,'i':35,'j':36,'k':37,'l':38,'m':39,'n':40,'o':41,'p':42,'q':43,'r':44,'s':45,'t':46,'u':47,'v':48,'w':49,'x':50,'y':51,'z':52}\r\ns=input()\r\ncnt=0\r\ncnt+=min(abs(dict1['a']-dict1[s[0]]),abs(dict1['a']-dict2[s[0]]),abs(dict1[s[0]]-dict2['a']))\r\nfor i in range(1,len(s)):\r\n cnt+=min(abs(dict1[s[i-1]]-dict1[s[i]]),abs(dict1[s[i-1]]-dict2[s[i]]),abs(dict1[s[i]]-dict2[s[i-1]]))\r\nprint(cnt)", "name = input()\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nsum = 0\r\n\r\nif abs(alpha.index('a') - alpha.index(name[0])) < 13:\r\n sum += abs(alpha.index('a') - alpha.index(name[0]))\r\nelse:\r\n sum += 26 - abs(alpha.index('a') - alpha.index(name[0]))\r\n\r\nfor i in range(0, len(name) - 1):\r\n if abs(alpha.index(name[i]) - alpha.index(name[i + 1])) < 13:\r\n sum += abs(alpha.index(name[i]) - alpha.index(name[i + 1]))\r\n else:\r\n sum += 26 - abs(alpha.index(name[i]) - alpha.index(name[i + 1]))\r\n\r\nprint(sum)", "word = input()\r\nresult = pos = 0\r\nfor letter in word:\r\n pos2 = ord(letter) - 97\r\n r = abs(pos - pos2)\r\n l = 26 - r\r\n result += min(l, r)\r\n pos = pos2\r\nprint(result)", "a, s = 0, 0\r\nfor i in map(lambda a: ord(a)-97, list(input())):\r\n\ts += min(abs(a-i), 26-abs(a-i))\r\n\ta = i\r\nprint(s)", "A = ord('a')\r\nss = ord('z') - A + 1\r\nB = A\r\nOTBET = 0\r\n\r\nfor letter in input():\r\n p = ord(letter) - A\r\n c = B - A\r\n if c < p:\r\n dist = min(p - c, c + ss - p)\r\n else:\r\n dist = min(c - p, p + ss - c)\r\n\r\n B = ord(letter)\r\n\r\n OTBET += dist\r\n\r\nprint(OTBET)", "string = list(\"a\")+list(input())\r\ntotal = 0 \r\n\r\nfor i in range(len(string)-1) :\r\n first = ord(string[i])\r\n second = ord(string[i+1])\r\n if first > second and first -second < 13:\r\n total += first - second\r\n elif first > second and first - second > 13:\r\n total += abs((first-second)-25)+1\r\n elif first < second and second - first > 13:\r\n total += abs((second-first)-25)+1\r\n elif first < second and second - first < 13:\r\n total += second-first\r\n else:\r\n total += abs(second-first)\r\n \r\n\r\nprint(total)\r\n", "s = input()\r\ns = 'a' + s\r\ndef mins(first, second):\r\n m1 = min(abs(ord(first)-ord('z')), abs(ord(first)-ord('a')))\r\n m2 = min(abs(ord(second)-ord('z')), abs(ord(second)-ord('a')))\r\n return min(abs(ord(first)-ord(second)), m2+m1+1)\r\n\r\nres=0\r\nfor i in range(len(s)-1):\r\n res+=mins(s[i],s[i+1])\r\nprint(res)", "letters = input()\r\ncurrent_position = 0 #a letter\r\nletter_position = 0\r\ntotal = 0\r\n\r\nleft = 0\r\nright = 0\r\n\r\nfor letter in letters:\r\n letter_position = ord(letter) - 97 # 0-25\r\n\r\n if letter_position > current_position:\r\n right = letter_position - current_position\r\n left = current_position + (26 - letter_position)\r\n else:\r\n right = (26 - current_position) + letter_position\r\n left = current_position - letter_position\r\n\r\n current_position = letter_position\r\n\r\n if right > left:\r\n total += left\r\n else:\r\n total += right\r\n\r\nprint(total)", "s = input()\nc = 0\nprev = 'a'\nfor i in s:\n a = abs(ord(i) - ord(prev))\n c += min(a,26-a)\n prev = i\nprint(c)", "name = input()\npointer = ord('a')\nnumber_of_rotations = 0\nfor next_letter in name:\n next_letter_decimal = ord(next_letter)\n distance_between = abs(pointer - next_letter_decimal)\n number_of_rotations += distance_between if distance_between <= 13 else 26 - distance_between\n pointer = next_letter_decimal\nprint(number_of_rotations)\n", "n=input()\r\nal=\"abcdefghijklmnopqrstuvwxyz\"\r\nal=list(al)\r\nl=\"a\"\r\ncount=0\r\nfor i in range(len(n)):\r\n k=al.index(l)\r\n m=al.index(n[i])\r\n l=n[i]\r\n d=abs(k-m)\r\n if d>13:\r\n d=26-d \r\n count+=d\r\nprint(count)", "try:\r\n exhibit = input()\r\n sum = abs(ord(exhibit[0]) - ord('a'))\r\n if sum > 13:\r\n sum = 26 - sum\r\n for i in range(len(exhibit) - 1):\r\n temp = abs(ord(exhibit[i]) - ord(exhibit[i+1]))\r\n if temp > 13:\r\n temp = 26 - temp\r\n sum += temp\r\n print(sum)\r\n \r\nexcept:\r\n pass", "embosser = 'abcdefghijklmnopqrstuvwxyz'\n\ndef dist(x,y):\n clock = abs(embosser.index(x) - embosser.index(y))\n cclock = 26 - clock\n return min(clock, cclock)\n\nip = input()\nans = 0\nfor i in range(len(ip)):\n if i == 0:\n ans+= dist('a', ip[i])\n else:\n ans+= dist(ip[i-1], ip[i])\nprint(ans)\n", "input_string = input().strip()\r\ncurrent_position = 'a'\r\nrotations = 0\r\n\r\nfor char in input_string:\r\n target_position = ord(char) - ord('a')\r\n \r\n clockwise_rotations = (target_position - (ord(current_position) - ord('a'))) % 26\r\n \r\n counterclockwise_rotations = (26 - clockwise_rotations) % 26\r\n \r\n rotations += min(clockwise_rotations, counterclockwise_rotations)\r\n current_position = char\r\n\r\nprint(rotations)\r\n", "c=97\r\na=0\r\ns=input()\r\nfor z in s:\r\n z=ord(z)\r\n i=abs(c-z)\r\n a+=min(i,26-i)\r\n c=z\r\nprint(a)", "n=input()\r\na=\"abcdefghijklmnopqrstuvwxyz\"\r\nb=len(a)\r\ncnt=0\r\ntemp=0\r\nfor i in n:\r\n for j in range(26):\r\n if i == a[j]:\r\n cnt+=min(abs(j-temp),(26-abs(temp-j)))\r\n temp=j\r\nprint(cnt)", "s=input()\r\ni='a'\r\np=0\r\nfor j in s:\r\n p=p+min(abs(ord(j)-ord(i)),(26-abs(ord(j)-ord(i))))\r\n i=j\r\nprint(p)\r\n\r\n\r\n\r\n\r\n", "s = input()\ncount = 0\nprev = 'a'\nfor i in s:\n a = abs(ord(i) - ord(prev))\n b = 26 - a\n count += min(a, b)\n prev = i\nprint(count)\n\n \t \t\t\t \t\t\t\t \t\t\t\t\t \t \t\t \t", "s = input()\r\nc = 0\r\nt = ord('a')\r\nfor i in range(len(s)):\r\n t1 = ord(s[i])\r\n mi = min(abs(t1 - t), t + 26 - t1, t1 + 26 - t)\r\n c += mi\r\n t = t1\r\nprint(c)\r\n\r\n", "n=input()\r\ns=0\r\nc='a'\r\nfor i in n:\r\n s=s+min(abs(ord(c)-ord(i)),abs(26-abs(ord(c)-ord(i))))\r\n c=i\r\nprint(s)", "n = input()\r\nx = 'abcdefghijklmnopqrstuvwxyz'\r\nc = 0\r\nsum = 0\r\nfor i in n:\r\n y = x.index(i)\r\n z = abs(y-c)\r\n sum += min(z,abs(26-z))\r\n c = y\r\nprint(sum)", "alphabet = \"abcdefghijklmnopqrstuvwxyz\"\r\nletter = 'a'\r\nword = input()\r\nindex = 0\r\nindex1 = 0\r\nmovements = 0\r\n\r\nfor i in range(len(word)):\r\n index = abs(alphabet.find(letter) - alphabet.find(word[i]))\r\n index1 = 26 - index\r\n if index > index1:\r\n movements += index1\r\n else:\r\n movements += index\r\n letter = word[i]\r\nprint(movements)\r\n", "name=input()\r\ninitial='a'\r\ns1='abcdefghijklmnopqrstuvwxyz'\r\nrotations=0\r\nfor i in range(len(name)):\r\n rotations+=min(abs(s1.index(name[i])-s1.index(initial)),26-abs(s1.index(name[i])-s1.index(initial)))\r\n initial=name[i]\r\nprint(rotations)", "s1='abcdefghijklmnopqrstuvwxyz'\r\ns=input()\r\nj=0\r\nk=0\r\nfor i in range(len(s)):\r\n j1=s1.index(s[i])\r\n a=abs(j-j1)\r\n if a <=13:\r\n k+=a\r\n j=j1\r\n else:\r\n k+=26-a\r\n j=j1\r\nprint(k)\r\n", "def distance_between_characters(char1, char2):\r\n clockwise_distance = abs(ord(char1) - ord(char2))\r\n counterclockwise_distance = 26 - clockwise_distance\r\n return min(counterclockwise_distance, clockwise_distance)\r\n\r\n\r\ndef solve(name):\r\n current_point = 'a'\r\n total_rotations = 0\r\n for ch in name:\r\n total_rotations += distance_between_characters(ch, current_point)\r\n current_point = ch\r\n return total_rotations\r\n\r\n\r\nname = input()\r\nprint(solve(name))\r\n", "from sys import stdin,stdout\r\nfrom collections import Counter,defaultdict \r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n # write your code here \r\n name = input()\r\n \r\n def minuse(char,cur):\r\n \r\n val1 = ord(char)-97 \r\n val2 = abs(25-val1)\r\n x = max(val1,cur)-min(val1,cur)\r\n val = min(x,26-x)\r\n \r\n return val1,val\r\n x = 0\r\n count = 0\r\n for i in name:\r\n x,y = minuse(i,x)\r\n count += y\r\n \r\n \r\n return count\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\nprint(solve())\r\n", "from sys import stdout\r\ns = map(ord, input())\r\nresult = 0\r\npos = 0\r\nA = ord(\"a\")\r\nZ = ord(\"z\")\r\n\r\nfor x in s:\r\n if A <= x <= Z:\r\n x -= A\r\n result += min(abs(x - pos), 26-abs(x - pos))\r\n pos = x\r\n else:\r\n break\r\nstdout.write(str(result))", "exhibit_name = input()\r\nNUMBER_LETTERS = 26\r\npointer = 'a'\r\nmin_rotations = 0\r\n\r\nfor char in exhibit_name:\r\n r = abs(ord(char) - ord(pointer))\r\n min_rotations += r if r <= NUMBER_LETTERS - r else NUMBER_LETTERS - r\r\n pointer = char\r\n\r\nprint(min_rotations)", "text = \"a\" +input()\r\nsum_=0\r\n\r\nfor i in range(len(text) - 1):\r\n s=ord(text[i+1])-ord(text[i])\r\n\r\n if abs(s) <= 13 :\r\n sum_+=abs(s)\r\n if abs(s) > 13:\r\n sum_+= abs( abs(s)-26 )\r\n\r\n\r\n\r\n\r\nprint(sum_)", "text = input()\r\n\r\npos = 1\r\ntot_move = 0\r\nfirst_move = True\r\n\r\nfor i in text:\r\n to_go = ord(i) - ord('a') + 1\r\n move = abs(pos - to_go)\r\n if move > 13:\r\n tot_move += (26 - move)\r\n else:\r\n tot_move += move\r\n pos = to_go\r\n\r\nprint(tot_move)\r\n", "s=input()\r\nsum=0\r\np=97\r\nfor c in s:\r\n sum+=min(abs(ord(c)-p),26-abs(ord(c)-p))\r\n p=ord(c)\r\nprint(sum)", "from string import ascii_lowercase\nstring = input()\nposition = 0\nmoves = 0\nfor char in string:\n char_pos = ascii_lowercase.find(char)\n right = abs(char_pos - position)\n left = abs(26 - right)\n if right > left:\n moves += left\n else:\n moves += right\n position = char_pos\nprint(moves)\n", "exhibit = input()\nrot = 0\n\ntemp = \"a\"\nfor c in exhibit:\n cw = abs(ord(c) - ord(temp))\n ccw = 26 - abs(ord(temp) - ord(c))\n rot += cw if cw < ccw else ccw\n temp = c\n \nprint(rot)", "t=0;a=97\r\nfor i in input():\r\n b=abs(ord(i)-a)\r\n t+=min(b,26-b)\r\n a=ord(i)\r\nprint(t)", "A = \"a\"\r\ncounter = 0\r\nfor i in input():\r\n straight = abs(ord(i)-ord(A))\r\n counter += min(straight, 26-straight)\r\n A = i\r\nprint(counter)\r\n", "# 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# word = input()\n#\n# upper_word = []\n# lower_word = []\n#\n# for char in word:\n# if char.isupper():\n# upper_word.append(char)\n# else:\n# lower_word.append(char)\n#\n# if len(upper_word) > len(lower_word):\n# print(word.upper())\n# else:\n# print(word.lower())\n\n# problem 7\n\n# num_of_magnets = input()\n# magnets = []\n# num_of_groups = 1\n# for i in range(int(num_of_magnets)):\n# magnet = input()\n# magnets.append(magnet)\n#\n# for i in range(len(magnets)):\n# current_char = i\n# next_char = 0\n# if current_char + 1 != len(magnets):\n# next_char = magnets.index(magnets[current_char + 1])\n# else:\n# next_char = i\n#\n# if magnets[current_char] != magnets[next_char]:\n# num_of_groups = num_of_groups + 1\n#\n# print(num_of_groups)\n\n# problem 8\n\n# num_of_cards = input()\n# cards = input().split()\n# int_cards = []\n# for card in cards:\n# int_cards.append(int(card))\n#\n# sereja_score = 0\n# dima_score = 0\n# for i in range(len(int_cards)):\n# big_num = max([int_cards[0], int_cards[-1]])\n# if i % 2 == 0:\n# sereja_score += big_num\n# int_cards.remove(big_num)\n# else:\n# dima_score += big_num\n# int_cards.remove(big_num)\n#\n# print(str(sereja_score) + ' ' + str(dima_score))\n\n# problem 9\n\n# num_of_stones = input()\n# stones = input()\n# stones_list = []\n# prop_of_solves = 0\n#\n# for stone in stones:\n# stones_list.append(stone)\n#\n# for i in range(len(stones_list)):\n# current_stone = stones_list[i]\n# next_stone = ''\n# if i < len(stones_list) - 1:\n# next_stone = stones_list[i + 1]\n#\n# if current_stone == next_stone:\n# prop_of_solves += 1\n#\n# print(prop_of_solves)\n\n\n# problem 10\n\n# num_of_events = input()\n# events = input().split()\n# events_int = []\n#\n# for event in events:\n# events_int.append(int(event))\n#\n# i = 0\n# solved_events = 0\n# while i < len(events_int):\n# current_event = events_int[i]\n#\n# if current_event != -1:\n# i += current_event\n# else:\n# solved_events += 1\n# i = i + 1\n#\n#\n# print(solved_events)\n\n# problem 11\n\n# calories = input().split()\n# s = input()\n#\n# caloriesMap = {\n# '1': calories[0],\n# '2': calories[1],\n# '3': calories[2],\n# '4': calories[3],\n# }\n# total = 0\n# for char in s:\n# total += int(caloriesMap[char])\n#\n# print(total)\n\n# problem 12\n\nuser_input = input().lower()\n\nalphabet = ['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\npointer_index = 0\nleft_list, right_list = [], []\n\nminimum_round = 0\n\nfor i in range(len(user_input)):\n index = alphabet.index(user_input[i].upper())\n walk = abs(pointer_index - index)\n\n if walk < 13:\n minimum_round += walk\n else:\n minimum_round += len(alphabet) - walk\n\n pointer_index = index\n\nprint(minimum_round)\n", "s = input()\r\nk = 'a'\r\nsumm = 0\r\nfor i in s:\r\n j = abs(ord(i)-ord(k))\r\n j = min(j,26-j)\r\n summ += j\r\n k = i\r\nprint(summ)", "\r\nimport string\r\nstr1=list(input())\r\n\r\nalp=string.ascii_lowercase\r\nalpr=alp[::-1]\r\n# min(|x - y|, l - |x - y|).\r\np,sum=0,0\r\nfor i in range(len(str1)):\r\n x=(min(abs(p-alp.index(str1[i])),26-abs(p-alp.index(str1[i]))))\r\n \r\n sum+=x\r\n p=alp.index(str1[i])\r\nprint(sum)\r\n\r\n\r\n", "s = input()\r\nres = 0\r\ncurr = 0\r\n\r\nA = ord('a')\r\nZ = ord('z')\r\n\r\nfor i in s:\r\n x = ord(i)\r\n if A <= x <= Z:\r\n x -= A\r\n res += min(abs(x-curr), 26-abs(x-curr))\r\n curr = x;\r\n else:\r\n break\r\nprint(res)", "t=0;a=97\r\nfor i in input():\r\n b=abs(ord(i)-a);t+=min(b,26-b);a=ord(i)\r\nprint(t)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef input_list_numbers():\r\n return(list(map(int, input().split())))\r\n\r\nabc = \"abcdefghijklmnopqrstuvwxyz\"\r\nidx = list(range(len(abc)))\r\nzip_iterator = zip(abc, idx)\r\nabc_dictionary = dict(zip_iterator)\r\n\r\ntext = input()\r\ntext = text[:-1]\r\ntext = 'a' + text\r\ntext_idx = [None] * len(text)\r\n\r\nfor i, l in enumerate(text):\r\n text_idx[i] = abc_dictionary[l]\r\n\r\ntotal_rotations = 0\r\n\r\nfor i in range(1, len(text_idx)):\r\n d1 = abs((text_idx[i - 1] + len(abc)) - text_idx[i])\r\n d2 = abs(text_idx[i - 1] - (text_idx[i] + len(abc)))\r\n d3 = abs(text_idx[i - 1] - text_idx[i])\r\n\r\n total_rotations += min(d1, d2, d3)\r\n\r\nprint(total_rotations)\r\n\r\n", "s = input()\r\nw = 'a'\r\nj = 0\r\nfor lett in s:\r\n if ord(lett) > ord(w):\r\n stra = ord(lett) - ord(w)\r\n back = ord(w) - (ord(lett) - 26)\r\n j += min(stra, back)\r\n w = lett\r\n else:\r\n stra = ord(w) - ord(lett)\r\n back = ord(lett) - (ord(w) - 26)\r\n j += min(stra, back)\r\n w = lett\r\nprint(j)\r\n", "# https://codeforces.com/problemset/problem/731/A\r\n\r\nimport string\r\nfrom itertools import cycle\r\n\r\nname = input()\r\n# name = 'abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuv'\r\n# name = 'zeus'\r\n\r\n\r\neng_alphabet = list(string.ascii_lowercase)\r\ncurrent_position = 0\r\nrotations = 0\r\n\r\nfor c in name:\r\n clock_rotation = 0\r\n clock_counter = 0\r\n \r\n c_position = eng_alphabet.index(c)\r\n\r\n # Clockwise\r\n min_pos = min(current_position, c_position)\r\n max_pos = max(current_position, c_position)\r\n\r\n for i in range(min_pos, max_pos):\r\n clock_rotation += 1\r\n\r\n # Counter clockwise\r\n clock_counter = 26 - clock_rotation\r\n\r\n\r\n rotations += min(clock_rotation, clock_counter)\r\n\r\n current_position = c_position\r\n\r\nprint(rotations)\r\n", "dic = {}\r\nfor i in range(97,123):\r\n dic[chr(i)]=i-97\r\n\r\na= input()\r\nb=[]\r\nfor j in a:\r\n b.append(j)\r\n\r\nactual = 0\r\ntotal = 0\r\nfor i in b:\r\n obj = dic[i]\r\n clock = obj - actual\r\n if clock<0:\r\n clock=(26-actual)+(obj)\r\n anticlock = actual - obj\r\n if anticlock<0:\r\n anticlock=actual+(26-obj)\r\n if clock > anticlock:\r\n total += anticlock\r\n actual = obj\r\n else:\r\n total += clock\r\n actual = obj\r\n\r\nprint(total)", "s = input()\r\nflag = 97\r\nrot = 0\r\nfor i in range(len(s)):\r\n diff = abs(flag-ord(s[i]))\r\n if diff > 13:\r\n diff = 26-diff\r\n rot += diff\r\n flag = ord(s[i])\r\nprint(rot)\r\n", "s = str(input())\n\na = \"abcdefghijklmnopqrstuvwxyz\"\nb = a[::-1]\npos = 'a'\nans = 0\n\nfor key in s:\n c1 = 0\n c2 = 0\n m = a.index(key)\n n1 = a.index(pos)\n n2 = a.index(pos)\n while a[n1] != key:\n n1 = (n1 + 1) % 26\n c1 += 1\n while a[n2] != key:\n n2 = n2 - 1\n c2 += 1\n\n pos = key\n ans = ans + min(c1, c2)\n\nprint(ans)\n \n \n ", "a = input()\r\nans = 0\r\nlast = 'a'\r\nfor i in a:\r\n d = abs(ord(last) - ord(i))\r\n ans += min(d, 26-d)\r\n last = i\r\nprint(ans)", "s = input()\r\nif len(s) >= 1 and len(s) <= 100:\r\n s_moves = 0\r\n start = 0\r\n for i in range(len(s)):\r\n '''The function ord() gets the int value of the char. \r\n And in case you want to convert back after playing with the number, \r\n function chr() does the trick.'''\r\n pointer = ord(s[i]) - 97\r\n walk = abs(start - pointer)\r\n if(walk <= 13):\r\n s_moves += walk\r\n else:\r\n s_moves += 26 - walk\r\n start = pointer\r\n print(s_moves)\r\nelse:\r\n print('Error: The string input must be the non-empty string consisting of no more than 100 characters')", "l=list('abcdefghijklmnopqrstuvwxyz')\r\ny=0\r\nz=input()\r\na='a'\r\nfor i in z:\r\n y+=min(abs(abs(l.index(a)-l.index(i))-26),abs(l.index(i)-l.index(a)))\r\n a=i\r\nprint(y)", "x=list(input())\r\ny,c,a,b=97,0,0,0\r\nfor i in x:\r\n z=ord(i)\r\n a=abs(z-y)\r\n b=26-abs(a)\r\n c+=min(a,b)\r\n y=z\r\nprint(c)\r\n\r\n", "a = input()\nrot = 0\nrefletter = 'a'\nlist = ['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']\nfor i in a:\n diff = list.index(i)-list.index(refletter)\n if diff>0:\n if(diff>13):\n rot+=26-diff\n \n refletter = i\n\n else:\n rot+=diff\n \n refletter = i\n else:\n diff = (-1*diff)\n if(diff>13):\n rot+=26-diff\n \n refletter = i\n\n else:\n rot+=diff\n \n refletter = i\n\nprint(rot)\n \t \t \t \t \t\t \t\t\t\t\t", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\ndc = {chr(ord('a') + i): i for i in range(26)}\r\nb = 'a'\r\ncnt = 0\r\nfor c in input():\r\n cnt += min((dc[b] - dc[c] + 26) % 26, (dc[c] - dc[b] + 26) % 26)\r\n b = c\r\nprint(cnt)", "s=input()\r\nc=0\r\na=97\r\nfor i in range(len(s)):\r\n b=abs(ord(s[i])-a)\r\n c+=min(b,26-b)\r\n a=ord(s[i])\r\nprint(c)", "s = input()\r\nprint(sum([i for i in [min(abs(ord(s[j])-ord(s[j+1])), 26-abs(ord(s[j])-ord(s[j+1]))) for j in range(len(s)-1)]])+min(abs(ord('a')-ord(s[0])),26-abs(ord('a')-ord(s[0]))))", "from string import ascii_lowercase as z\r\ns=input()\r\nv=0\r\nn=0\r\nfor i in s:\r\n u=abs(z.index(i)-v)\r\n x=abs(len(z)-u)\r\n if u>x:\r\n n+=x\r\n else:\r\n n+=u\r\n v=z.index(i)\r\n \r\nprint(n)", "#https://codeforces.com/problemset/problem/731/A\r\n\r\nword = str(input())\r\nlst = 'a'\r\nsum = 0\r\nfor i in word:\r\n if ord(i) >= ord('n'):\r\n lx = ord(i) - ord('n')\r\n else:\r\n lx = ord(i) - ord('a') + 13\r\n if ord(i) <= ord('m'):\r\n rx = ord(i) - ord('a') + 13 + 26\r\n else:\r\n rx = ord(i) - ord('a') + 13\r\n lstIndx = ord(lst) - 97 + 13\r\n sum += min(abs(lstIndx - rx), abs(lstIndx - lx))\r\n\r\n lst = i\r\n\r\nprint(sum)", "input1 = input()\ninput1 = \"a\" + input1\n\nimport string\n\ndef clockwiseTurn(one, two):\n alphabet_string = string.ascii_lowercase\n distance = abs(alphabet_string.index(two) - alphabet_string.index(one))\n return distance\n\n\nsum = 0\n\nfor i in range(len(input1) - 1):\n min1 = min(clockwiseTurn(input1[i], input1[i + 1]), 26 - clockwiseTurn(input1[i], input1[i + 1]))\n sum += min1\n\nprint(sum)", "w = input()\r\np = 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\nm=0\r\n\r\nfor i in w.lower():\r\n tp = a.index(i)\r\n \r\n if p > tp:\r\n g = p\r\n s = tp\r\n else:\r\n g = tp\r\n s = p\r\n c = len(a[g:])+len(a[:s])\r\n cc = len(a[s:g])\r\n \r\n m += (c if c<cc else cc)\r\n p = tp\r\n\r\nprint(m)", "def main():\r\n s = input()\r\n st, res = 0, 0\r\n for c in s:\r\n c = ord(c) - 97\r\n res += min((c - st) % 26, (st - c) % 26)\r\n st = c\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = input()\r\nb = 0\r\nd = 0\r\ne = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\nfor i in range(len(a)):\r\n f = e.index(a[i])\r\n b += min(abs(f - d), abs(26 - f + d), abs(26 - d + f))\r\n d = f\r\nprint(b)", "def getDistance(a: str, b: str) -> int:\r\n ans = abs(ord(a) - ord(b))\r\n ans = ans if ans < 14 else 26 - ans\r\n return ans\r\n\r\n\r\ndef solve(w: str):\r\n dist = 0\r\n pointer = 'a'\r\n for i in w:\r\n newDist = getDistance(pointer, i)\r\n dist += newDist\r\n pointer = i\r\n return dist\r\n\r\n# for _ in range(int(input())):\r\nfor _ in range(1):\r\n # n, m = map(int, input().split())\r\n word = input()\r\n ans = solve(word)\r\n print(ans)\r\n", "word = input()\r\nres = 0\r\ncurr = 'a'\r\nfor target in word:\r\n y,x = ord(target), ord(curr)\r\n r1 = abs(x-y)\r\n r2 = 26-r1\r\n res += min(r1,r2)\r\n curr = target\r\nprint(res)", "st = input()\r\n\r\nli = [0] * 26\r\n\r\nk = 0\r\nk1 = 0\r\nmn = 0\r\npos = 0\r\npos1 = 0\r\n\r\nfor i in range(26):\r\n li[i] = chr(ord('a') + i)\r\n\r\nfor i in range(len(st)):\r\n while li[pos] != st[i]:\r\n pos += 1\r\n k += 1\r\n if pos == 26:\r\n pos = 0\r\n while li[pos1] != st[i]:\r\n pos1 -= 1\r\n k1 += 1\r\n if pos1 == -1:\r\n pos1 = 25\r\n mn += min(k, k1)\r\n if k < k1:\r\n pos = pos1\r\n else:\r\n pos1 = pos\r\n k = 0\r\n k1 = 0\r\n\r\nprint(mn)", "c='a'\r\nans=0\r\ns=input()\r\nfor i in s:\r\n\td=abs(ord(i)-ord(c))\r\n\tans+=min(d,26-d)\r\n\tc=i\r\nprint(ans)\r\n", "import string\r\ni=0\r\nz=[]\r\nl=[]\r\nk=[]\r\nfor letter in string.ascii_lowercase:\r\n z.append(i)\r\n l.append(letter)\r\n i=i+1\r\ns=input()\r\nfor let in s:\r\n k.append(let)\r\nn=len(k)\r\nj=0\r\nf=0\r\ncw=0\r\nccw=0\r\ntot=0\r\nwhile n:\r\n cw = l.index(k[j])-f\r\n ccw= f-l.index(k[j])\r\n if cw < 0: cw=cw+26\r\n if ccw < 0: ccw=ccw+26\r\n if cw > ccw :\r\n tot=tot+ccw\r\n else: tot=tot+cw\r\n f=l.index(k[j])\r\n n=n-1\r\n j=j+1\r\nprint(tot)\r\n", "s = input()\r\nl = 97\r\nc = 0\r\nfor i in s:\r\n c += abs(min(abs(ord(i) - l), 26 - abs(ord(i) - l)))\r\n l = ord(i)\r\nprint(c)", "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']\nch=input()\np='a'\nx=0\nfor i in ch:\n if abs(l.index(p)-l.index(i))>13:\n x=x+abs(abs(l.index(p)-l.index(i))-25)+1\n else:\n x=x+abs(l.index(p)-l.index(i))\n \n p=i\n\nprint(x)", "kq = input().lower()\r\ndem = 0\r\n\r\ndau = ord('a')\r\nsua = ord('z')\r\nbandau = ord('a')\r\nfor i in kq:\r\n foo = ord(i)\r\n dem = dem + min((bandau - foo + 26) % 26 ,(foo - bandau + 26) % 26)\r\n bandau = foo\r\nprint(dem)", "def solve(s):\r\n start = 'a'\r\n sum = 0\r\n for i in range(len(s)):\r\n clockwise = abs(ord(s[i]) - ord(start))\r\n antiClockwise = 26 - clockwise\r\n sum += min(clockwise, antiClockwise)\r\n start = s[i]\r\n print(sum)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve(input())\r\n", "def count_step(name_exhibit: str) -> int:\n index_start = 0\n count = 0\n for letter in name_exhibit:\n index_end = ord(letter) - 97\n\n if abs(index_end - index_start) > 13:\n count += 26 % abs(index_end-index_start)\n else:\n count += abs(index_end-index_start)\n index_start = index_end\n\n return count\n\nif __name__ == '__main__':\n name_exhibit = input()\n print(count_step(name_exhibit=name_exhibit))\n \n \n \n", "user_input = input()\r\nalph = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nres, diff, pointer = 0, 0, 0\r\n\r\nfor i in user_input:\r\n index = alph.find(i) \r\n diff = abs(pointer-index)\r\n res += min(diff, abs(26-diff))\r\n pointer = index\r\n\r\n\r\nprint(res)", "l=list(input())\r\n\r\nprev='a'\r\ncount=0\r\n\r\nfor i in l:\r\n clock=ord(i)-ord(prev)\r\n if clock<0:\r\n clock*=-1\r\n d=26-clock\r\n g=min(clock,d)\r\n count+=g\r\n prev=i\r\nprint(count)", "s = input()\r\ne = 'abcdefghijklmnopqrstuvwxyz'\r\nnow = 'a'\r\nx = 0 \r\nfor i in s:\r\n steps = abs(e.find(i) - e.find(now))\r\n if steps >= 26 - steps:\r\n x += 26 - steps\r\n else:\r\n x += steps\r\n now = i\r\n steps = 0\r\nprint(x)\r\n\r\n", "s = input()\r\ncur_char = 'a'\r\nval = 0\r\nfor i in s:\r\n val += min(abs(ord(cur_char) - ord(i)), (26 - abs(ord(cur_char) - ord(i))))\r\n cur_char = i\r\nprint(val)", "string = input()\nSmoves = 0\nstart = 0\nfor i in range(len(string)):\n\tindex = ord(string[i]) - 97 # to make a = 0\n\twalk = abs(start - index)\n\tif walk < 13:\n\t\tSmoves += walk \n\telse:\n\t\tSmoves += 26 - walk\n\tstart = index\nprint(Smoves)\n\n", "s = input()\r\n\r\nprog_number = 1\r\nans = 0\r\n\r\nfor i in s:\r\n code = ord(i) - 96\r\n clockwise_move = (code + 26 - prog_number) % 26\r\n counter_clockwise_move = (prog_number + 26 - code) % 26\r\n\r\n ans += min(clockwise_move, counter_clockwise_move)\r\n\r\n prog_number = code\r\n\r\nprint(ans)", "word, letters, count, current = list(input()), list('abcdefghijklmnopqrstuvwxyz'), 0, 0\r\nfor letter in word:\r\n new = abs(letters.index(letter) - current)\r\n count += min(new, 26 - new)\r\n current = letters.index(letter)\r\nprint(count)", "def positive(number):\r\n if number < 0:\r\n return -1 * number\r\n else:\r\n return number\r\n\r\n\r\nword = input()\r\nletters = ['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\nprev = 'a'\r\nnew = 'a'\r\nanswer = 0\r\n\r\nfor a in word:\r\n new = a\r\n diff = positive(letters.index(new) - letters.index(prev))\r\n if diff < 14:\r\n answer += diff\r\n else:\r\n answer += (26 - diff)\r\n prev = new\r\nprint(answer)", "# n = int(input())\r\n# lst = list(map(int, input().split()))\r\n# lst.sort()\r\n# print(*lst)\r\nimport math\r\nst = input()\r\nsu = 0\r\ncu = 1\r\nfor i in range(len(st)):\r\n r = (cu - (ord(st[i])-96)) % 26\r\n l = ((ord(st[i])-96) - cu) % 26\r\n su += min(r,l)\r\n cu = ord(st[i])-96\r\nprint(su)", "import string\r\nalphabets = string.ascii_lowercase\r\n\r\ndef comb(n, target):\r\n if n > target:\r\n return min(abs(n - target), abs(26 - n + target))\r\n return min(abs(n - target), abs(26 + n - target))\r\n\r\ns = input()\r\ncount = 0\r\ncurr = \"a\"\r\nfor i in range(len(s)):\r\n count += comb(alphabets.find(curr), alphabets.find(s[i]))\r\n curr = s[i]\r\nprint(count)", "Reloj=['abcdefghijklmnopqrstuvwxyz','bcdefghijklmnopqrstuvwxyza',\r\n 'cdefghijklmnopqrstuvwxyzab','defghijklmnopqrstuvwxyzabc',\r\n 'efghijklmnopqrstuvwxyzabcd','fghijklmnopqrstuvwxyzabcde',\r\n 'ghijklmnopqrstuvwxyzabcdef','hijklmnopqrstuvwxyzabcdefg',\r\n 'ijklmnopqrstuvwxyzabcdefgh','jklmnopqrstuvwxyzabcdefghi',\r\n 'klmnopqrstuvwxyzabcdefghij','lmnopqrstuvwxyzabcdefghijk',\r\n 'mnopqrstuvwxyzabcdefghijkl','nopqrstuvwxyzabcdefghijklm',\r\n 'opqrstuvwxyzabcdefghijklmn','pqrstuvwxyzabcdefghijklmno',\r\n 'qrstuvwxyzabcdefghijklmnop','rstuvwxyzabcdefghijklmnopq',\r\n 'stuvwxyzabcdefghijklmnopqr','tuvwxyzabcdefghijklmnopqrs',\r\n 'uvwxyzabcdefghijklmnopqrst','vwxyzabcdefghijklmnopqrstu',\r\n 'wxyzabcdefghijklmnopqrstuv','xyzabcdefghijklmnopqrstuvw',\r\n 'yzabcdefghijklmnopqrstuvwx','zabcdefghijklmnopqrstuvwxy']\r\ndef Cuenta(A,Abc):\r\n Ind=[0,1,2,3,4,5,6,7,8,9,10,11,12,13,12,11,10,9,8,7,6,5,4,3,2,1]\r\n Pos=Abc.index(A)\r\n return(Ind[Pos])\r\nAbc=\"abcdefghijklmnopqrstuvwxyz\"\r\nCad=input()\r\nCont=Cuenta(Cad[0],Abc)\r\nfor K in range(len(Cad)-1):\r\n Pos=Abc.index(Cad[K])\r\n Cont=Cont+Cuenta(Cad[K+1],Reloj[Pos])\r\nprint(Cont)\r\n", "word = input()\r\nrotations =0\r\ncurrent = 'a'\r\nfor x in word:\r\n diff = abs(ord(current)-ord(x))\r\n rotations += min(diff, 26-diff)\r\n current = x\r\n\r\nprint(rotations)", "string = input()\r\nstring = list(string)\r\nsums = 0\r\n\r\n\r\nstart = 'a'\r\nfirst_char = string[0]\r\n\r\nif start != first_char:\r\n diff = abs( ord(start) - ord(first_char) )\r\n if diff > 13:\r\n v = 26 - diff\r\n sums += v\r\n else:\r\n sums += diff\r\n\r\n\r\nfor i in range(len(string) - 1):\r\n diff = abs( ord(string[i]) - ord(string[i+1]) )\r\n\r\n if diff > 13:\r\n v = 26 - diff\r\n sums+= v\r\n else:\r\n sums += diff\r\n\r\n\r\nprint(sums)", "s = input()\r\nsumm = 0\r\n\r\nx = abs(ord(s[0]) - ord('a'))\r\nsumm = summ + min(x,26-x)\r\n\r\nfor i in range(1,len(s)):\r\n x = abs(ord(s[i]) - ord(s[i-1]))\r\n summ = summ + min(x,26-x)\r\nprint(summ)", "s = input()\nres = 0\nfor i, e in enumerate(s):\n diff = abs(ord(s[i]) - ord(s[i - 1] if i > 0 else \"a\"))\n res += min(diff, 26 - diff)\nprint(res)\n", "i = 'a'+input()\ne = 0\nfor x in range(len(i)-1):\n if abs(ord(i[x])-ord(i[x+1])) > 13:\n e += 26 - abs(ord(i[x])-ord(i[x+1]))\n else:e += abs(ord(i[x])-ord(i[x+1]))\nprint(e)\n\t \t \t \t \t\t\t\t\t\t \t \t", "s = str(input())\r\n\r\nres = 0\r\nfor i in range(len(s)):\r\n if i == 0:\r\n res += min(abs(ord(s[i]) - ord(\"a\")), abs((ord(s[i]) - 26) - ord(\"a\")))\r\n else:\r\n res += min(abs(ord(s[i]) - ord(s[i-1])), abs((ord(s[i]) + 26) - ord(s[i-1])), abs((ord(s[i]) - 26) - ord(s[i-1])))\r\n \r\nprint(res)", "characters = 'abcdefghijklmnopqrstuvwxyz'\r\nposition = {characters[x] : x for x in range(len(characters))}\r\nsequence = str(input())\r\neffort = 0\r\nthis = 'a'\r\nfor item in sequence:\r\n tuda = abs(position[item] - position[this])\r\n suda = 26 - tuda\r\n effort += min(tuda,suda)\r\n this = item\r\nprint (effort)", "s = input()\r\nnow = 'a'\r\nans = 0\r\n\r\nfor x in s:\r\n if now == x:\r\n continue\r\n\r\n if now < x:\r\n ans += min(ord(x) - ord(now), ord(now) - ord(x) + 26)\r\n else:\r\n ans += min(ord(x) - ord(now) + 26, ord(now) - ord(x))\r\n\r\n now = x\r\n \r\nprint(ans)", "s=input()\r\ncount=0\r\nres=0\r\nfor i in s:\r\n ss=ord(i)-97\r\n res+=min(max(ss,count)-min(ss,count),\r\n 26-max(ss,count)+min(ss,count))\r\n count=ss\r\nprint(res)\r\n", "s = input()\r\nn = len(s)\r\n\r\nans = 0\r\nlast = 97\r\nfor i in range(n):\r\n c = abs(ord(s[i])-last)\r\n ans += min(c, 26-c)\r\n last = ord(s[i])\r\n\r\nprint(ans)", "s = input()\r\nc = 0\r\nt1 = 1\r\nfor i in range(len(s)):\r\n t2 = ord(s[i]) - 96\r\n if abs(t2 - t1) < (26 + min(t1, t2) - max(t1, t2)):\r\n c += abs(t2 - t1)\r\n else:\r\n c += (26 + min(t1, t2) - max(t1, t2))\r\n t1 = t2\r\nprint(c)", "def short_path(string:str):\r\n counter=0\r\n index=97\r\n for char in string:\r\n if abs(ord(char)-index)<=13:\r\n counter+=abs(ord(char)-index)\r\n index=ord(char)\r\n else:\r\n counter+=26-abs(ord(char)-index)\r\n index=ord(char)\r\n return counter\r\nword =input()\r\nprint(short_path(word))", "rotation = 0\r\nname = [97] + [ord(i) for i in input()]\r\nfor i in range(len(name)-1):\r\n if name[i] > name[i+1]:\r\n if name[i] - name[i+1] > name[i+1] - name[i] + 26:\r\n rotation += name[i+1] - name[i] + 26\r\n else:\r\n rotation += name[i] - name[i+1]\r\n else:\r\n if name[i+1] - name[i] > name[i] - name[i+1] + 26:\r\n rotation += name[i] - name[i+1] + 26\r\n else:\r\n rotation += name[i+1] - name[i]\r\nprint(rotation)", "look = \"\".join([\"abcdefghijklmnopqrstuvwxyz\" for i in range(3)])\r\nword = input()\r\nsteps = 0\r\ni = 26\r\nfor c in word:\r\n if c != look[i]:\r\n \t# go forward in look\r\n \tforward = 0\r\n \tfor j in range(0, 25):\r\n \t\tif c != look[i + j]: forward += 1\r\n \t\telse: break\r\n \t# go backwards in look\r\n \tbackwards = 0\r\n \tfor k in range(0, 25):\r\n \t\tif c != look[i - k]: backwards += 1\r\n \t\telse: break\r\n \t# determine the shortest path\r\n \tif forward < backwards: \r\n \t\tsteps += forward\r\n \t\tif i + j > 51: i += j - 26\r\n \t\telse: i += j \r\n \telse:\r\n \t\tsteps += backwards\r\n \t\tif i - k < 26: i += 26 - k\r\n \t\telse: i -= k\r\nprint(steps)", "s=input()\r\nn=0\r\na=97\r\nfor i in s:\r\n b=abs(ord(i)-a)\r\n n+=min(b,26-b)\r\n a=ord(i)\r\nprint(n)\r\n", "#!/usr/bin/python3\n\nimport sys\n\nclass Input:\n \"\"\" Integer inputs \"\"\"\n @staticmethod\n def inp():\n return(int(input()))\n\n \"\"\" List inputs \"\"\"\n @staticmethod\n def inlt():\n return(list(map(int, input().split())))\n\n \"\"\" String inputs \"\"\"\n @staticmethod\n def ins():\n return(input())\n\n \"\"\" List of characters \"\"\"\n @staticmethod\n def insr():\n return(list(input()))\n\n \"\"\" Integer variable inputs \"\"\"\n @staticmethod\n def invr():\n return(map(int, input().split()))\n\nclass NightAtTheMuseum:\n def solve(self, s):\n chars = 'abcdefghijklmnopqrstuvwxyz';\n moves = 0\n cursor = 0\n for c in s:\n new_cursor = chars.index(c)\n idx1 = abs(new_cursor - cursor)\n idx2 = abs(idx1 - len(chars))\n move = min(idx1, idx2)\n moves += move\n cursor = new_cursor\n print(moves)\n\nif __name__ == \"__main__\":\n s = Input.ins()\n nightAtTheMuseum = NightAtTheMuseum()\n nightAtTheMuseum.solve(s)\n", "s=input()\r\n\r\nth=0\r\nprev=ord('a')\r\nfor i in s:\r\n diff=abs(ord(i)-prev)\r\n if diff>13:\r\n th+=26-diff\r\n else:\r\n th+=diff\r\n prev=ord(i)\r\nprint(th)", "# Author <<< MAVERICK >>>\r\nimport os, sys, math\r\nii = lambda : int(input()) # integer \r\nsi = lambda : input() # string\r\nmi = lambda : map(int,input().strip().split(\" \")) # mapping integer\r\nmsi = lambda : map(str,input().strip().split(\" \")) # mapping string\r\nli = lambda : list(mi()) # list integer input\r\nlsi = lambda : list(msi()) # list string input\r\niseven = lambda num : num%2==0 # checks even number\r\nisodd = lambda num : num%2==1 # checks odd number\r\n'''\r\nSet Methods >>>\r\nset.add()\r\nset.discard()\r\nset.intersection()\r\nset.issubset()\r\nset.pop()\r\nset.remove(item)\r\nset.union()\r\nGap before printing >>>\r\nprint(f\"{1000:10}\",end=\"\\n\")\r\nprint(f\"{100:10}\",end=\"\\n\")\r\n'''\r\n\r\nclass Maverick:\r\n def __init__(self):\r\n self.LOCAL = \"D:\\\\Python\\\\CompetitiveProgramming\\\\Portable\\\\MAVERICK\\\\CPP\"\r\n self.inputFile,self.outputFile,self.debugFile = f\"{self.LOCAL}/input.txt\",f\"{self.LOCAL}/output.txt\",f\"{self.LOCAL}/debug.txt\"\r\n self.counter,self.summation,self.store,self.dick,self.alphabets = 0,0,[],{},\"abcdefghijklmnopqrstuvwxyz\"\r\n def debug(self, var):\r\n with open(f\"{self.debugFile}\",\"w\") as f: f.write(str(var))\r\n def read(self): sys.stdin = open(F'{self.inputFile}', 'r'); sys.stdout = open(F'{self.outputFile}', 'w')\r\n def process(self):\r\n try: self.read(); self.solve()\r\n except FileNotFoundError: self.solve()\r\n def clearAll(self): self.counter, self.summation = 0,0; self.dick.clear(); self.store.clear()\r\n def solve(self):\r\n start = 97\r\n for x in map(ord,input()):\r\n i=abs(start-x)\r\n self.counter+=min(i,26-i)\r\n start=x\r\n print(self.counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\nclass Node:\r\n def __init__(self,data = None): self.data,self.next,self.prev=data,None,None\r\nclass SinglyLinkedList:\r\n def __init__(self): self.head = None\r\n def listPrint(self):\r\n printval = self.head\r\n while printval is not None:print(f\"{printval.data}\",end=\"\\n\");printval = printval.next\r\n def insertAtBeginning(self, newData): NewNode=Node(newData);NewNode.next=self.head;self.head=NewNode\r\n def insertAtLast(self, newData):\r\n NewNode = Node(newData)\r\n if self.head is None: self.head=NewNode;return\r\n last = self.head\r\n def Inbetween(self,middle_node,newdata):\r\n if middle_node is None:print(\"The mentioned node is absent\");return\r\n NewNode = Node(newdata)\r\n NewNode.nextval = middle_node.nextval\r\n middle_node.nextval = NewNode\r\n\r\nclass DoublyLinkedList:\r\n def __init__(self):self.head = None\r\n def insertAtBeginning(self, new_data):\r\n new_node = Node(new_data)\r\n new_node.next = self.head\r\n if self.head is not None:\r\n self.head.prev = new_node\r\n self.head = new_node\r\n def insertAfter(self, prev_node, new_data):\r\n if prev_node is None:\r\n print(\"the given previous node cannot be NULL\")\r\n return\r\n new_node = Node(new_data)\r\n new_node.next = prev_node.next\r\n prev_node.next = new_node\r\n new_node.prev = prev_node\r\n if new_node.next:\r\n new_node.next.prev = new_node\r\n def insertAtLast(self, new_data):\r\n new_node = Node(new_data)\r\n if self.head is None:\r\n self.head = new_node\r\n return\r\n last = self.head\r\n while last.next:\r\n last = last.next\r\n last.next = new_node\r\n new_node.prev = last\r\n return\r\n def printListForward(self):\r\n forward = []\r\n node = self.head\r\n while node:\r\n forward.append(node.data)\r\n last = node\r\n node = node.next\r\n return forward\r\n def printListBackward(self):\r\n backward = []\r\n while last:\r\n backward.append(last.data)\r\n last = last.prev\r\n return backward\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__\": Maverick().process()\r\n", "a = input(\"\")\r\nb = 0\r\nx = \"a\"\r\nfor i in a:\r\n xx = ord(x) - 97\r\n xi1 = ord(i) - 97\r\n xi2 = xi1 + 26\r\n if x < i:\r\n xx += 26\r\n b += min(abs(xi2 - xx),abs(xx-xi1))\r\n x = i\r\nprint(b)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ns = input().strip()\r\ncount = 0\r\nprev_char = 'a'\r\nfor char in s:\r\n a = abs(ord(char) - ord(prev_char))\r\n b = 26 - a\r\n count += min(a, b)\r\n prev_char = char\r\nprint(count)\r\n", "s=\"abcdefghijklmnopqrstuvwxyz\"\r\ns=list(s)\r\nn=input()\r\nans=0\r\nk=\"a\"\r\nfor i in range(len(n)):\r\n j=s.index(k)\r\n l=s.index(n[i])\r\n dif=abs(l-j)\r\n k=n[i]\r\n if dif<=13:\r\n ans+=dif\r\n else:\r\n ans+=(26-dif)\r\nprint(ans)\r\n ", "v=['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\nv2=\"a\"+input()\r\nc=0\r\nfor i in range(len(v2)-1):\r\n w=abs(v.index(v2[i])-v.index(v2[i+1]))\r\n if w<26-w:\r\n c+=w\r\n else:\r\n c+=26-w \r\nprint(c) ", "alphabets = \"abcdefghijklmnopqrstuvwxyz\"\r\ns = input()\r\nstart = 0\r\nmoves = 0\r\n\r\nfor i in s:\r\n move = abs(start - alphabets.find(i))\r\n if move < 13:\r\n moves += move\r\n else:\r\n moves += 26-move\r\n start = alphabets.find(i)\r\n\r\nprint(moves)", "a = \"abcdefghijklmnopqrstuvwxyz\"\r\ns = input().lower()\r\no = 0\r\npoint = 0\r\nfor i in range(len(s)):\r\n if abs(a.index(s[i])-point) < 13:\r\n\r\n o += (abs(a.index(s[i])-point))\r\n else:\r\n o += 26-(abs(a.index(s[i])-point))\r\n point = a.index(s[i])\r\n\r\nprint(o)\r\n", "s = input()\r\nalpha = [chr(i) for i in range(ord('a'), ord('z') + 1)]\r\nx = [i + 1 for i in range(len(alpha))]\r\ndp = dict()\r\nfor i in range(len(alpha)):\r\n dp[alpha[i]] = x[i]\r\np = 'a'\r\nres = 0\r\nfor i in s:\r\n res += min(len(alpha) - abs((dp[i] - dp[p])),abs(dp[p]-dp[i]) )\r\n p=i\r\nprint(res)", "s = input()\r\nl = ord('a')\r\nc = 0\r\nfor i in s:\r\n d = abs(ord(i)-l)\r\n if d > 13:\r\n c+= 26-d\r\n else:\r\n c+=d\r\n l = ord(i)\r\nprint(c)", "def night_at_museum():\r\n name = input()\r\n n = len(name)\r\n moves = 0\r\n for i in range(n):\r\n if i == 0:\r\n sum = abs(ord(\"a\") - ord(name[i]))\r\n if sum <= 13:\r\n moves += sum\r\n else:\r\n moves += 26 - sum\r\n else:\r\n sum2 = abs(ord(name[i]) - ord(name[i -1]))\r\n if sum2 <= 13:\r\n moves += sum2\r\n else:\r\n moves += 26 - sum2 \r\n return moves \r\n\r\nprint(night_at_museum())", "def min_rotations(target, current):\r\n def char_distance(c1, c2):\r\n return min(abs(ord(c1) - ord(c2)), 26 - abs(ord(c1) - ord(c2)))\r\n rotations = 0\r\n for i in range(len(target)):\r\n rotations += char_distance(target[i], current)\r\n current = target[i]\r\n return rotations\r\nexhibit_name = input().strip()\r\ncurrent_letter = 'a'\r\nresult = min_rotations(exhibit_name, current_letter)\r\nprint(result)\r\n", "t = input()\r\nstart = 97\r\ns=0\r\nfor i in t:\r\n path1 = abs(ord(i)-start)\r\n path2 = 26 - path1\r\n s+= min(path1, path2)\r\n start = ord(i)\r\nprint(s)", "import string\r\nstng = input().lower()\r\nstrng = [element for element in stng]\r\nalphabet = string.ascii_lowercase\r\ny = 0\r\ncur_letter = \"a\"\r\nfor i in strng:\r\n ind1 = alphabet.index(cur_letter)\r\n ind2 = alphabet.index(i)\r\n dist = abs(ind2-ind1)\r\n\r\n if dist < 13:\r\n y += dist\r\n else:\r\n y += 26 - dist\r\n cur_letter = i\r\nprint(y)", "from sys import stdin\ndef input(): return stdin.readline()[:-1]\n\n# list(map(int,input().split()))\n\n\ndef solve():\n x = str(input())\n a = 0 \n pos1 = 1 \n\n for letter in x: \n pos2 = ord(letter)-96 \n if pos2 > pos1: \n val = min(pos2-pos1, abs(pos1-pos2+26))\n a += val\n # print (letter, pos1, pos2, \"value:\", val)\n else: \n val = min(pos1-pos2, abs(pos2-pos1+26))\n a+= val \n # print (letter, pos1, pos2, \"value:\", val)\n pos1 = pos2 \n\n \n\n return a\n \n\n\n\n\n # x = str(input())\n # a = 0 \n \n # y1 = 'a'\n # y2 = x[0] \n\n\n # a += min(abs(ord(y1)-ord(y2)), abs(ord(y2)-ord(y1)))\n\n # for i in range (2, len(x)): \n # y1 = x[i-1]\n # y2 = x[i] \n\n # a += min(abs(ord(y1)-ord(y2)), abs(ord(y2)-ord(y1)))\n # print (a) \n\n\nprint(solve())\n", "wheel = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\ntotal_rotations = 0\r\nname = input()\r\n\r\ncurrent_letter = 'a'\r\nfor c in name:\r\n current_index = wheel.index(current_letter)\r\n target_index = wheel.index(c)\r\n \r\n distance = min((target_index - current_index) % 26, (current_index - target_index) % 26)\r\n total_rotations += distance\r\n \r\n current_letter = c\r\n\r\nprint(total_rotations)", "exhibit =input()\r\nalpha='abcdefghijklmnopqrstuvwxyz'\r\nmoves=min(alpha.index(exhibit[0]),abs(26-alpha.index(exhibit[0])))\r\nfor i in range(1,len(exhibit)) :\r\n f=abs(alpha.index(exhibit[i-1])-alpha.index(exhibit[i]))\r\n moves+=min(f,26-f)\r\nprint(moves)", "Word = input()\r\nCurrent = 'a'\r\nCounter = 0\r\nTemp = 0\r\nfor i in range (0,len(Word)):\r\n Next = Word[i]\r\n Temp = abs(ord(Current)-ord(Next))\r\n if Temp >= 13:\r\n Temp = 26 - Temp\r\n Counter += Temp \r\n Current = Next\r\nprint(Counter) \r\n", "word = input()\r\ncount= 0\r\ncurr = ord(\"a\")\r\n\r\nfor l in word:\r\n walk = abs(curr - ord(l))\r\n if walk > 13:\r\n walk = abs(26 - walk)\r\n count += walk \r\n curr = ord(l)\r\n\r\nprint(count)", "#name=input(\" \")\r\n#sum=0\r\n\"\"\"name1=\"a\"\r\ni=0\r\nfor s[i] in name\r\n l1=abs(s-name1)\r\n l2=abs(name1-s)\r\n sum+=min(l1,l2)\r\n name1=s[i+1]\r\n\r\n\r\nprint(sum)\"\"\"\r\n\r\ndef min_rotations(s):\r\n start = 'a'\r\n rotations = 0\r\n for c in s:\r\n \r\n dist = abs(ord(c)-ord(start))\r\n revdist=26-dist\r\n rotations += min(dist, revdist) \r\n start= c \r\n \r\n return rotations\r\n\r\n# example usage\r\nprint(min_rotations(s=input()))\r\n# output: 2\r\n\r\n\r\n \r\n\r\n\r\n", "import string\r\n\r\ndef rotate_clockwise(alphapit_list,index, word):\r\n alphapit_list_rotate_clockwise = [] \r\n for r in range(0, index ):\r\n \r\n alphapit_list_rotate_clockwise = alphapit_list[index:] + alphapit_list[:index]\r\n return alphapit_list_rotate_clockwise \r\n\r\ndef rotate_counterwise(alphapit_list,index, word):\r\n \r\n alphapit_list_rotate_counterwise = []\r\n for r in range(0, index ):\r\n alphapit_list_rotate_counterwise = alphapit_list[-index:] + alphapit_list[:-index]\r\n return alphapit_list_rotate_counterwise \r\n\r\ndef night_sol():\r\n word = list(input())\r\n \r\n alphapit_lower = sorted( string.ascii_lowercase)\r\n\r\n alphapit_lower_copy = alphapit_lower\r\n sum = 0\r\n\r\n for w,char in enumerate(word):\r\n index_i, index_j = 0,0 \r\n \r\n for i in range(0, len(alphapit_lower_copy)): \r\n if char == alphapit_lower_copy[i]:\r\n index_i = i\r\n for j in range(0, len(alphapit_lower_copy)):\r\n if char == alphapit_lower_copy[-j]:\r\n index_j = j\r\n # this condition (index_i !=0 and index_j !=0) to pass the char 'a'\r\n # if it comes at first character in the word \r\n \r\n if index_i <= index_j and (index_i !=0 and index_j !=0):\r\n sum += index_i \r\n alphapit_lower_copy = rotate_clockwise(alphapit_list=alphapit_lower_copy,\r\n index= index_i, word=word)\r\n elif index_j < index_i:\r\n sum += (index_j) \r\n alphapit_lower_copy = rotate_counterwise(alphapit_list=alphapit_lower_copy,\r\n index= index_j, word=word)\r\n\r\n return sum\r\n\r\n\r\nprint(night_sol())", "import sys, math, cmath, time, collections\r\nfrom collections import deque, Counter, OrderedDict, defaultdict\r\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush, heapreplace\r\nfrom math import ceil, floor, log, log2, sqrt, gcd, factorial, pow, pi\r\nfrom bisect import bisect_left, bisect_right\r\n\r\n# BEGIN FASTIO\r\n\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n\r\n# region fastio\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n\r\n\r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n# END FASTIO\r\n\r\n# SOLUTION BEGINS HERE\r\n\r\nstart_time = time.time()\r\n\r\n\r\ndef solve(string):\r\n \"\"\"\r\n Actual solution\r\n \"\"\"\r\n alpha = 'abcdefghijklmnopqrstuvwxyz'\r\n alpha = [c for c in alpha]\r\n limit = list(range(0, 26))\r\n hmap = dict(zip(alpha, limit))\r\n\r\n cnt = 0\r\n\r\n\r\n start = 'a'\r\n\r\n for ch in string:\r\n candidates = [hmap[start], hmap[start] + 26, hmap[ch], hmap[ch] + 26]\r\n candidates = sorted(candidates)\r\n\r\n total = float('inf')\r\n for c in zip(candidates, candidates[1:]):\r\n res = abs(c[0]-c[1])\r\n if res < total:\r\n total = res\r\n\r\n start = ch\r\n cnt += total\r\n\r\n print(cnt)\r\n\r\n\r\ndef main():\r\n \"\"\"\r\n Main function dedicated to get the I/P\r\n a, b = map(int, input().split())\r\n solve(a, b)\r\n \"\"\"\r\n s = input()\r\n solve(s)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n LOCAL = False\r\n\r\n # If it's Local - Get I/P from file\r\n if LOCAL:\r\n sys.stdin = open(\"../io/data.in\", \"r\")\r\n sys.stdout = open(\"../io/data.out\", \"w\")\r\n\r\n testcases = 1\r\n for i in range(testcases):\r\n main()\r\n\r\n # If it's local - Print this O/P\r\n if LOCAL:\r\n print(f\"Time Elapsed: {time.time() - start_time} seconds\")\r\n sys.stdout.close()\r\n", "s = input()\r\nres = 0\r\nlast = ord(\"a\")\r\nfor elem in s:\r\n dif = abs(ord(elem) - last)\r\n res += min(dif, 26 - dif)\r\n last = ord(elem)\r\nprint(res)\r\n", "str1=input()\r\narr=['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\ncur='a'\r\nmoves=0\r\nfor i in range(len(str1)):\r\n\tn = arr.index(cur)\r\n\tn1 = arr.index(str1[i])\r\n\tmoves += min(abs(n-n1),26-abs(n-n1))\r\n\tcur=str1[i]\r\nprint(moves)", "s = input()\r\nini = 'a'\r\nn, r = len(s), 0\r\nfor i in range(n):\r\n w = abs(ord(s[i]) - ord(ini))\r\n r+= min(w, abs(26 - w))\r\n ini = s[i]\r\nprint(r)", "name=input()\r\nd=ord(name[0])-ord(\"a\")\r\nif(d>13):\r\n s=26-d\r\nelse:\r\n s=d\r\nfor i in range(len(name)-1):\r\n n1=ord(name[i])\r\n n2=ord(name[i+1])\r\n mx=max(n1,n2)\r\n mn=min(n1,n2)\r\n d=mx-mn\r\n if(d>13):\r\n s+=26-d\r\n \r\n else:\r\n s+=d\r\nprint(s)", "s = str(input())\r\ncur = ord('a')\r\nans = 0\r\nfor i in range(0, len(s)):\r\n diff = abs(cur - ord(s[i]))\r\n ans += min(diff, 26 - diff)\r\n cur = ord(s[i])\r\nprint(ans)", "w=input()\nc=min((ord(w[0])+7)%26,26-(ord(w[0])+7)%26)\nfor i in range(1,len(w)):\n c+=min((abs((ord(w[i])+7)%26-(ord(w[i-1])+7)%26)),(26-abs((ord(w[i])+7)%26-(ord(w[i-1])+7)%26)))\nprint(c)\n", "def calculate_rotations(name):\r\n current_letter = 'a'\r\n rotations = 0\r\n for letter in name:\r\n clockwise_rotations = (ord(letter) - ord(current_letter) + 26) % 26\r\n counterclockwise_rotations = (ord(current_letter) - ord(letter) + 26) % 26\r\n rotations += min(clockwise_rotations, counterclockwise_rotations)\r\n current_letter = letter\r\n return rotations\r\n\r\nname = input()\r\nresult = calculate_rotations(name)\r\nprint(result)\r\n", "# Wadea #\r\n\r\na = \"abcdefghijklmnopqrstuvwxyz\"\r\ns = list(a)\r\nw1 = \"a\"\r\nw = str(input())\r\nw2 = w1 + w \r\nlst = list(w2)\r\nw3 = len(w2)\r\na = 0\r\nb = 1\r\nr1 = 0\r\nq = 0\r\nfor i in range(w3-1):\r\n m = lst[a]\r\n n = lst[b]\r\n m1 = s.index(m)\r\n n1 = s.index(n)\r\n r1 = m1 - n1\r\n a += 1\r\n b += 1\r\n \r\n if r1 > 0:\r\n r1 = r1\r\n r2 = r1 -26 \r\n if r2 > 0:\r\n r2 = r2\r\n if r1 > r2:\r\n q += r2\r\n r1 = 0\r\n r2 = 0\r\n else:\r\n q += r1\r\n r1 = 0\r\n r2 = 0\r\n \r\n else:\r\n r2 = -1 * r2\r\n if r1 > r2:\r\n q += r2\r\n r1 = 0\r\n r2 = 0\r\n else:\r\n q += r1\r\n r1 = 0\r\n r2 = 0\r\n else:\r\n r1 = -1 * r1\r\n r2 = r1 - 26\r\n if r2 > 0:\r\n r2 = r2\r\n if r1 > r2:\r\n q += r2\r\n r1 = 0\r\n r2 = 0\r\n else:\r\n q += r1\r\n r1 = 0\r\n r2 = 0\r\n else:\r\n r2 = -1 *r2\r\n if r1 > r2:\r\n q += r2\r\n r1 = 0\r\n r2 = 0\r\n else:\r\n q += r1\r\n r1 = 0\r\n r2 = 0\r\nprint(q)\r\n", "a = list(input())\r\ns = 0\r\nq = 'a'\r\nfor i in range(len(a)):\r\n if ord(q) > ord(a[i]):\r\n s += min(abs(ord(a[i]) - ord(q)), 26 - ord(q) + ord(a[i]))\r\n q = a[i]\r\n else:\r\n s += min(abs(ord(a[i]) - ord(q)), 26 + ord(q) - ord(a[i]))\r\n q = a[i]\r\nprint(s)", "a = list(input())\r\ns, p = 0, 97\r\nfor i in a:\r\n b = ord(i)\r\n c = abs(b - p)\r\n d = 26 - c\r\n s += min(c, d)\r\n p = b\r\nprint(s)", "s = input()\r\n\r\np, c = 'a', 0\r\nfor i in s:\r\n l, r = ord(i)-97, ord(p)-97\r\n n = min(l, r)\r\n m = max(l, r)\r\n\r\n s1 = n-m+26\r\n s2 = m-n\r\n \r\n c += min(s1, s2)\r\n p = i\r\n\r\nprint(c)\r\n", "def inc(x,y='a'):\r\n\tf=abs(ord(x)-ord(y))\r\n\tr=26-f\r\n\tif f<r:\r\n\t\treturn f\r\n\treturn r\r\nx=['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=input()\r\nc=inc(y[0],'a')\r\nfor i in range(len(y)-1):\r\n\tc+=inc(y[i],y[i+1])\r\nprint(c)", "s = input()\r\na = 0\r\nb = 1\r\nfor i in range(len(s)):\r\n a += min(abs(ord(s[i]) - 96 - b), b + 26 - (ord(s[i]) - 96), 26 - b + (ord(s[i]) - 96))\r\n b = ord(s[i]) - 96\r\nprint(a)", "s=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ns=s.lower()\r\ny=input()\r\ny=\"a\"+y\r\n \r\ntotal=0\r\nfor i in range(len(y)-1):\r\n x=0\r\n y2=0\r\n xe=0\r\n ye=0\r\n \r\n for j in range(len(s)):\r\n\r\n if y[i]==s[j]:\r\n xe=j+1\r\n if y[i+1]==s[j]:\r\n ye=j+1\r\n x=xe-ye\r\n \r\n if xe<ye:\r\n y2=xe+(26-ye)\r\n else:\r\n y2=ye+(26-xe)\r\n\r\n if abs(x)<abs(y2):\r\n total=total+abs(x)\r\n else:\r\n total=total+abs(y2)\r\n \r\nprint(total)", "string=input()\r\ndis=lambda a,b:abs(ord(a)-ord(b))\r\ndistance=0\r\ncurrent='a'\r\nfor i in string:\r\n dist=dis(i,current)\r\n current=i\r\n distance+=min(dist,26-dist)\r\n\r\nprint(distance)", "s = str(input())\r\nstate = \"a\"\r\nsum = 0\r\nfor i in s:\r\n a = abs(((ord(i)-96) - (ord(state)-96)))\r\n if ord(i) > ord(state):\r\n b = abs((ord(i)-96) - (ord(state)-70))\r\n else:\r\n b = abs((ord(i)-70) - (ord(state)-96))\r\n sum += (min([a, b]))\r\n state = i\r\nprint(sum)", "a='abcdefghijklmnopqrstuvwxyz'\r\ns=input()\r\ncount=min(a.index(s[0]),26-a.index(s[0]))\r\n\r\nfor i in range(1,len(s)):\r\n dif=abs(a.index(s[i])-a.index(s[i-1]))\r\n count+=min(dif,26-dif)\r\n \r\nprint(count)", "import string\r\nalpha = list(string.ascii_lowercase)\r\nexhibit = input()\r\nno_rotations = 0\r\nsteps = abs(alpha.index('a') - alpha.index(exhibit[0]))\r\n\r\nfor i in range(len(exhibit)): \r\n if steps < 13:\r\n no_rotations += steps \r\n else:\r\n no_rotations += (26 - steps)\r\n if i == len(exhibit) - 1:\r\n break \r\n steps = abs(alpha.index(exhibit[i+1]) - alpha.index(exhibit[i]))\r\nprint(no_rotations)", "name_of_something = input()\r\nprevious = \"a\"\r\nanswer = 0\r\nfor i in name_of_something:\r\n q = abs(ord(i) - ord(previous))\r\n b = min(q, 26-q)\r\n answer += b\r\n previous = i\r\nprint(answer)", "a=list(range(1,27))\r\nt=input(\"\")\r\nch1=1\r\ndem=0\r\nfor i in range (len(t)):\r\n ch2=ord(t[i])-96\r\n if ch1>14:\r\n if ch2>14:\r\n dem+=abs(ch2-ch1)\r\n else:\r\n dem+=min(((26-ch1)+1)+(ch2-1),abs(ch1-ch2))\r\n else:\r\n if ch2<=14:\r\n dem+=abs(ch2-ch1)\r\n else:\r\n dem+=min(((26-ch2)+1)+(ch1-1),abs(ch1-ch2))\r\n ch1=ch2\r\nprint(dem)", "def Min_Turns(a,b):\n turn = abs(ord(a) - ord(b))\n return min(turn, abs(26-turn))\n\ns = input().strip()\nturns = Min_Turns(\"a\",s[0])\nfor i in range(1,len(s)):\n turns += Min_Turns(s[i],s[i-1])\nprint(turns)\n \t \t \t \t \t \t\t\t \t\t \t\t\t", "alpha = ['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\ns = str(input())\r\nsum1 = 0\r\nfor i in s:\r\n index = alpha.index(i)\r\n if index <= 13:\r\n sum1 += index\r\n else:\r\n sum1 += abs(index - 26)\r\n alpha = alpha[index:len(alpha)] + alpha[0:index]\r\nprint(sum1) \r\n", "a = \"abcdefghijklmnopqrstuvwxyz\"\r\nb = a[::-1]\r\ns = input()\r\n\r\nstart_pos = \"a\"\r\nrots = 0\r\nactual_pos = 0\r\nfor i in s:\r\n pos_a = a.find(i) \r\n pos_b = b.find(i) + 1\r\n\r\n best_pos = min(pos_a, pos_b)\r\n rots += best_pos\r\n\r\n a = a[a.find(i):] + a[:a.find(i)]\r\n b = a[::-1]\r\n\r\nprint(rots)\r\n", "n=input()\r\nc=0\r\na=0\r\nb=0\r\nf='abcdefghijklmnopqrstuvwxyz'\r\nfor x in range(len(n)):\r\n q=0\r\n w=0\r\n while f[a]!=n[x]:\r\n a+=1\r\n if a==26:\r\n a=0\r\n q+=1\r\n while f[b]!=n[x]:\r\n b-=1\r\n if b==-1:\r\n b=25\r\n w+=1\r\n c+=min(q,w)\r\nprint(c)", "ascii = \"abcdefghijklmnopqrstuvwxyz\"\nletters = input(\"\")\n\"\"\"\n#zeus\n1. z: 1 step\n2. e: 5 step\n3. u: 10 step\n4. s: 2 step\n\"\"\"\n\n\n\npointer = 0 #at beginning, pointer is at 0 (point to 'a')\n\n#do not use single character to name a variable\n#why? no meaning\nresult = 0\nfor letter in letters:\n pos = ascii.index(letter)\n diff = abs(pos - pointer)\n if diff > 13:\n steps = 26 - diff\n else:\n steps = diff\n result += steps\n pointer = pos\nprint(result)", "alph = []\r\nfor i in range(97,123):\r\n alph.append(chr(i))\r\n\r\ns = input()\r\nn,l = len(s),26\r\nstart = 0\r\ni = 0\r\nc = 0\r\nwhile i < n:\r\n idx = alph.index(s[i])\r\n c += (min(abs(start - idx),l - abs(start-idx)))\r\n start = idx\r\n i += 1\r\nprint(c)", "w = input()\r\ns = 0\r\ncurr_val = ord('a')\r\nfor c in w:\r\n vals = abs(ord(c) - curr_val)\r\n s = s + min(vals, 26-vals)\r\n curr_val = ord(c)\r\nprint(s)", "alpha1 = 'abcdefghijklmnopqrstuvwxyz'\r\ntotal = 0\r\npointer = 'a'\r\nfor l in input():\r\n val = abs(alpha1.index(l) - alpha1.index(pointer))\r\n if val > 13:\r\n val = 26 - val\r\n total += val\r\n pointer = l\r\nprint(total)", "x = input()\r\nnb=0\r\nf='a'\r\nfor s in range(0,len(x)):\r\n nb+=min(abs(ord(x[s])-ord(f)),26-abs(ord(x[s])-ord(f)))\r\n f=x[s]\r\nprint(nb)\r\n\r\n", "string = input()\r\nx = [97]\r\nfor i in range(len(string)):\r\n x.append(ord(string[i]))\r\n\r\nsum1 = 0\r\nsum2 = 0\r\nk = 0\r\nayirma = 0\r\n\r\nA = ord('a')\r\nZ = ord('z')\r\nfor i in range(len(x)-1):\r\n ayirma = abs(x[i+1] - x[i])\r\n if 26-ayirma<13:\r\n sum1 = ayirma\r\n else :\r\n sum1 = 26-ayirma\r\n k+= 26 - sum1\r\nprint(k)", "x = input()\r\ns = 0\r\nf = 0\r\nfor i in range(len(x)):\r\n t = ord(x[i])-97\r\n a = 0\r\n if f < t:\r\n a = f+(26-t)\r\n else :\r\n a = f - t\r\n b = 0\r\n if f <= t:\r\n b = t - f\r\n else:\r\n b = (26-f)+t\r\n if a>b :\r\n s = s+b\r\n else :\r\n s = s+a\r\n f = t\r\nprint(s) ", "s = map(ord, input())\n\nr = 0\nc = 0\n\na = ord('a')\nz = ord('z')\n\nfor x in s:\n if a <= x <= z:\n x -= a\n r += min(abs(x - c), 26 - abs(x - c))\n c = x\n else:\n break\n\nprint(r)\n", "def distance_between_characters(chr1, chr2):\r\n distance_clockwise = abs(ord(chr1) - ord(chr2))\r\n distance_counterclockwise = 26 - distance_clockwise\r\n return min(distance_counterclockwise, distance_clockwise)\r\n\r\n\r\ns = input()\r\nans = 0\r\ncurrent_letter = 'a'\r\n\r\nfor ch in s:\r\n ans += distance_between_characters(current_letter, ch)\r\n current_letter = ch\r\n\r\nprint(ans)\r\n", "s = input()\r\nc = ord('a')\r\nn = 0 \r\nfor i in range(len(s)):\r\n d1 = c - ord(s[i])\r\n d2 = - d1\r\n if d2 < 0:\r\n d2 += 26\r\n else:\r\n d1 += 26\r\n n += min(d1, d2)\r\n c = ord(s[i])\r\nprint(n)\r\n \r\n", "letters = {\"a\" : 1, \"b\" : 2, \"c\" : 3, \"d\" : 4, \"e\" : 5, \"f\" : 6, \"g\" : 7, \"h\" : 8, \"i\" : 9, \"j\" : 10, \"k\" : 11, \"l\" : 12, \"m\" : 13, \"n\" : 14, \"o\" : 15, \"p\" : 16, \"q\" : 17, \"r\" : 18, \"s\" : 19, \"t\" : 20, \"u\" : 21, \"v\" : 22, \"w\" : 23, \"x\" : 24, \"y\" : 25, \"z\" : 26}\r\nn = input()\r\ni = 1\r\nr = 0\r\nfor l in n:\r\n d = letters[l]\r\n r += min(abs(d - i), abs(26 - d + i), abs(26 - i + d))\r\n i = d\r\nprint(r)", "letters = \"abcdefghijklmnopqrstuvwxyz\"\nlabel = \"a\" + input()\ntotal = 0\nfor i in range(len(label) - 1):\n\tdist = abs(letters.index(label[i]) - letters.index(label[i+1]))\n\ttotal += min(dist, 26-dist)\nprint(total)", "name = input()\r\nspell = \"a\"+name\r\nans = 0\r\n\r\nfor i in range(1,len(spell)):\r\n ans += min(abs(ord(spell[i])-ord(spell[i-1])),abs(26-abs(ord(spell[i])-ord(spell[i-1]))))\r\n\r\nprint(ans)", "name = str(input())\r\nembossor = \"abcdefghijklmnopqrstuvwxyz\"\r\npointer = 0\r\nnumber_of_rotations = 0\r\n\r\nfor name_character_index in range(0,len(name)):\r\n char = name[name_character_index]\r\n for char_index in range(0,len(embossor)):\r\n if embossor[char_index] == char:\r\n break\r\n if abs(pointer - char_index) <= 13:\r\n number_of_rotations += abs(pointer - char_index)\r\n else:\r\n number_of_rotations += 26 - (abs(pointer - char_index))\r\n pointer = char_index\r\nprint(number_of_rotations)\r\n\r\n \r\n \r\n", "s = input()\nlastLetter = \"a\"\n\nturns = 0\nfor char in s:\n #first is clockwise, second counter\n clockwise = abs(ord(char) - ord(lastLetter))\n turns += min(clockwise, 26 - clockwise)\n lastLetter = char \n \nprint(turns)\n", "s = input()\r\n\r\nletter = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\ninitial = 'a'\r\nfinal = 0\r\n\r\nfor i in range(len(s)):\r\n e = ord(s[i]) - ord(initial)\r\n\r\n if e < 0:\r\n e *= (-1)\r\n\r\n d = 26-e\r\n\r\n g = min(d,e)\r\n\r\n final += g\r\n\r\n initial = s[i]\r\n\r\nprint(final)\r\n", "s=input()\r\nc=0\r\nx='a'\r\nfor i in s:\r\n c+=min(abs(ord(i)-ord(x)),abs(26-abs(ord(i)-ord(x))))\r\n x=i\r\nprint(c)\r\n ", "s=input()\r\n\r\nt=0\r\nprev=ord('a')\r\nfor i in s:\r\n diff=abs(ord(i)-prev)\r\n if diff>13:\r\n t+=26-diff\r\n else:\r\n t+=diff\r\n prev=ord(i)\r\nprint(t)", "s=input()\r\nt=0\r\np=ord('a')\r\nfor i in s:\r\n d = abs(ord(i)-p)\r\n if d>13:\r\n t+=26-d\r\n else:\r\n t+=d\r\n p=ord(i)\r\nprint(t) ", "alphabet = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\r\ns = input()\r\nb = alphabet.index(s[0])+1\r\nk1 = abs(1-b)\r\nk2 = 26-abs(1-b)\r\nc=min(k1, k2)\r\nfor i in range(0, len(s)-1):\r\n a = alphabet.index(s[i])+1\r\n b = alphabet.index(s[i+1])+1\r\n k1 = abs(a-b)\r\n k2 = 26-abs(a-b)\r\n c+=min(k1, k2)\r\nprint(c)", "n = input()\r\ns = 0\r\nm = [0] * (len(n) + 1)\r\nfor i in range(0,len(n)):\r\n m[i + 1] = ord(n[i]) - ord('a')\r\nfor j in range(0,len(m)-1):\r\n if m[j+1] > m[j]:\r\n if 26 - (m[j + 1] - m[j]) < 13:\r\n s = s + (26 - (m[j+1] - m[j]))\r\n else:\r\n s = s + (m[j+1] - m[j])\r\n else:\r\n if 26 - (m[j] - m[j+1]) < 13:\r\n s = s + (26 - (m[j] - m[j+1]))\r\n else:\r\n s = s + (m[j] - m[j+1])\r\nprint(s)", "name = input()\r\nletters = \"abcdefghijklmnopqrstuvwxyz\"\r\nprev = 0\r\nrotation = 0\r\nfor i in name:\r\n cur = letters.index(i)\r\n dist = abs(prev - cur)\r\n if dist<13:\r\n prev = cur\r\n else:\r\n prev=cur\r\n rotation+=min(dist,26-dist)\r\nprint(rotation)", "s=input()\r\nstart='a'\r\nsteps=0\r\nfor letter in s:\r\n diff=ord(start) - ord(letter)\r\n if diff<0:\r\n diff=-(diff)\r\n steps+=min(diff,26-diff)\r\n start=letter\r\nprint(steps)\r\n", "word = input()\r\nans = 0\r\ncurrent = 'a'\r\n\r\nfor x in word:\r\n way = abs(ord(x) - ord(current))\r\n ans += way if way <= 13 else 26 - way\r\n current = x\r\nprint(ans)\r\n", "alphabets=['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\nz=len(alphabets)\r\nn=list(input())\r\nx1=0\r\ns=0\r\nfor char in n:\r\n x=alphabets.index(char)\r\n delta1=abs(x-x1)\r\n delta2=abs(z-x)+x1\r\n delta3=abs(z-x1)+x\r\n s+=min(delta1,delta2,delta3)\r\n x1=x\r\nprint(s)\r\n\r\n\r\n", "s = input()\r\nres = 0\r\ncurrent_number = 0\r\nchr_array = [i for i in s]\r\n\r\nfor i in chr_array:\r\n index = ord(i)-97\r\n walk = abs(current_number-index)\r\n if walk < 13:\r\n res += walk\r\n else:\r\n res += 26 - walk\r\n current_number = index\r\nprint(res)", "s = input().strip()\r\ncurrent_letter = 'a'\r\nrotations = 0\r\nfor letter in s:\r\n clockwise = abs(ord(letter) - ord(current_letter))\r\n counterclockwise = 26 - clockwise\r\n rotations += min(clockwise, counterclockwise)\r\n current_letter = letter\r\nprint(rotations)\r\n", "x=input()\r\nseperator=' '\r\ny =seperator.join(x)\r\nz=y.split()\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\na = 0\r\nb = 0\r\nc = 0\r\ne=[]\r\na=a+min(l.index(z[0]),(26-l.index(z[0])))\r\ne.append(z[0])\r\nfor i in range(1,len(z)):\r\n if l.index(e[0])>l.index(z[i]):\r\n b=b+min((l.index(e[0]))-l.index(z[i]),26-((l.index(e[0]))-(l.index(z[i]))))\r\n e.remove(z[i-1])\r\n e.append(z[i])\r\n else:\r\n c=c+min((l.index(z[i])-l.index(e[0])),26-((l.index(z[i]))-(l.index(e[0]))))\r\n e.remove(z[i-1])\r\n e.append(z[i])\r\n\r\nprint(a+b+c)", "word = input()\r\npointer = \"a\"\r\ntotal_steps = 0\r\nfor i in range(len(word)):\r\n steps = abs(ord(word[i]) - ord(pointer))\r\n total_steps += 13 - abs(steps-13)\r\n pointer = word[i]\r\n\r\nprint(total_steps)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Apr 13 11:05:11 2022\r\n\r\n@author: dehon\r\n\"\"\"\r\n\r\na=input()\r\nres=0\r\nx=1\r\nfor i in a:\r\n result=ord(i)-96\r\n result1=26-abs(result-x)\r\n res+=min(abs(result-x),result1) \r\n x=result \r\nprint(res)\r\n\t\t ", "from math import *\r\ndef main():\r\n c = 97\r\n s = 0\r\n for x in map(ord,input()): \r\n i = fabs(c - x)\r\n s += min(i, 26 - i)\r\n c = x\r\n print(int(s))\r\nif __name__ == '__main__':\r\n main()\r\n", "#731A - Night at the Museum\r\nx,a=\"a\"+input(),0\r\nc=ord(x[0])\r\nfor i in range(len(x)-1):\r\n b,c=c,ord(x[i+1])\r\n z=abs(b-c)\r\n a+=min(z,26-z)\r\nprint(a)", "s = input()\r\ncur = 0\r\ntotal = 0\r\nfor c in s:\r\n target = ord(c) - ord('a')\r\n diff = abs(target-cur)\r\n total += min(diff, 26-diff)\r\n cur = target\r\nprint(total)\r\n", "w = input()\r\nl = len(w)\r\nstart = 0\r\nmove2 = 0\r\nfor i in w:\r\n order = ord(i) - 97\r\n move = abs(start-order)\r\n start = order\r\n if move <= 13:\r\n move2 += move\r\n else:\r\n move2 += (26-move)\r\nprint(move2)", "s = input()\r\nt = 'a'\r\nk = 0\r\nfor i in s:\r\n k+=min(abs((ord(i)-ord(t))),26-(abs((ord(i)-ord(t)))))\r\n t = i\r\nprint(k)\r\n", "current = ord(\"a\")\r\nuserInput = input()\r\nsteps = 0\r\nfor char in userInput: \r\n targetChar = ord(char)\r\n directSteps = abs(targetChar - current)\r\n if directSteps <= 13:\r\n steps += directSteps\r\n else:\r\n steps += -directSteps + 26\r\n current = targetChar\r\nprint(steps)", "t = 'a' + input()\r\n\r\ncount = 0\r\nfor i in range(1, len(t)):\r\n\r\n a = abs(ord(t[i]) - ord(t[i - 1]))\r\n if a <= 13:\r\n count += a\r\n else:\r\n count += (26-a)\r\n\r\nprint(count)\r\n", "name = input()\r\ncurr = 0\r\nshifts_count = 0\r\na = ord('a')\r\nfor c in name:\r\n c = ord(c) - a\r\n diff = abs(c - curr)\r\n shifts_count += min(diff, 26 - diff)\r\n curr = c\r\nprint(shifts_count)", "alphabet=[chr(num) for num in range(97,123)]\r\nrotations=0\r\ns1=input()\r\ni1=1\r\nfor i in range(len(s1)):\r\n i2=alphabet.index(s1[i])+1\r\n dist=max(i1,i2)-min(i1,i2)\r\n if dist>13:\r\n rotations+=26-dist\r\n else:\r\n rotations+=dist\r\n i1=i2\r\nprint(rotations)\r\n \r\n", "def mesum(st):\r\n su = 0;\r\n start = 'a'\r\n for ch in st:\r\n l1 = abs(ord(ch)-ord(start));\r\n l2 = abs(26-l1);\r\n su+=min(l1,l2);\r\n start = ch;\r\n return su;\r\n \r\n \r\n\r\nst = input();\r\nprint(mesum(st));", "s = 'a' + input().strip()\r\nanswer = 0\r\nfor i in range(1, len(s)):\r\n a = ord(s[i - 1]) - 97\r\n b = ord(s[i]) - 97\r\n answer += min((a - b) % 26, (b - a) % 26)\r\nprint(answer)", "alphabet = [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\",\r\n \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\"]\r\ncount = 0\r\ns = input()\r\nstart = 0\r\nfor i in range(len(s)):\r\n if (abs(alphabet.index(s[i])-start) < 14):\r\n count += abs(alphabet.index(s[i])-start)\r\n else:\r\n minValue = min(start, alphabet.index(s[i]))\r\n maxValue = max(start, alphabet.index(s[i]))\r\n count += minValue+(26-maxValue)\r\n start = alphabet.index(s[i])\r\nprint(count)", "s=input()\r\noutput=0\r\npointer='a'\r\nfor i in s:\r\n output+=abs(ord(pointer)-ord(i)if(abs(ord(pointer)-ord(i))<13)else 26-abs(ord(pointer)-ord(i)))\r\n pointer=i\r\nprint(output)", "def night_at_the_museum():\r\n a=input()\r\n ans=0\r\n b=1\r\n for i in range(len(a)):\r\n s=ord(a[i])-96\r\n c=abs(b-s)\r\n d=abs(26-c)\r\n ans+=min(c,d)\r\n b=s\r\n print(ans)\r\nnight_at_the_museum()\r\n", "word=\"a\"+input()\r\nans=0\r\nfor i in range(1,len(word)):\r\n\tlet1=ord(word[i-1])-96\r\n\tlet2=ord(word[i])-96\r\n\tif abs(let1-let2)<=13:\r\n\t\tans+=abs(let1-let2)\r\n\telse:\r\n\t\tans+=26-abs(let1-let2)\r\nprint(ans)", "list = ['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\nnum = range(len(list))\r\ninput = input()\r\ntemp = 0\r\nfor k in input :\r\n for m, n in enumerate(list) :\r\n if k == n :\r\n temp += min(m, 26 - m)\r\n list = list[m:] + list[:m]\r\nprint(temp)", "strng=input()\r\nsize=len(strng)\r\ncount=0\r\nalpha=abs(ord('a')-96)\r\nfor i in range(size):\r\n ltr= ord( strng[i] )\r\n pos= abs( ltr-96 )\r\n diff=abs(pos-alpha)\r\n if(13<diff):\r\n count+= 26-diff\r\n else:\r\n count+=diff\r\n alpha=pos\r\nprint(count)", "n=input()\r\nb='a'\r\ns=0\r\nfor i in n:\r\n c=b\r\n while i!=b:\r\n if b=='z':\r\n b='a'\r\n else:\r\n b=chr(ord(b)+1)\r\n if c =='a':\r\n c='z'\r\n else:\r\n c=chr(ord(c)-1)\r\n s+=1\r\n if b==i or i==c:\r\n break\r\n b=i\r\nprint(s)", "a = input()\r\nalf = \"abcdefghijklmnopqrstuvwxyz\"\r\nans = 0\r\nnow = ans\r\nfor i in range(len(a)):\r\n if now <= alf.index(a[i]):\r\n ans += min(alf.index(a[i]) - now, now + 26 - alf.index(a[i]))\r\n else:\r\n ans += min(now - alf.index(a[i]), alf.index(a[i]) + 26 - now)\r\n now = alf.index(a[i])\r\nprint(ans)", "s = input().strip()\r\ncurr = 'a'\r\nrotations = 0\r\n\r\nfor c in s:\r\n dist = abs(ord(c) - ord(curr))\r\n rotations += min(dist, 26 - dist)\r\n curr = c\r\n\r\nprint(rotations)\r\n", "s = input()\r\nl = 'abcdefghijklmnopqrstuvwxyz'\r\nl2 = [str(x) for x in l]\r\nc = 0\r\nfor i in s:\r\n for j in range(len(l2)):\r\n if i == l2[j]:\r\n if j<13:\r\n c+=j\r\n else:\r\n c+= (26-j)\r\n m = l2[j:]\r\n m2 = l2[:j]\r\n l2 = m+m2\r\nprint(c)", "n=input()\r\nx=\"a\"\r\nb=0\r\ns=0\r\nfor i in n:\r\n\tb=abs(ord(x)-ord(i))\r\n\ts+=min(b,26-b)\r\n\tx=i\r\nprint(s)\r\n", "word = input()\r\narr = ['a']\r\nfor i in range(1,26):\r\n arr.append(chr(ord(arr[-1])+1))\r\n\r\ncurrent_p = arr.index('a')\r\ndistance = 0\r\nfor i in range(len(word)):\r\n next_p = arr.index(word[i])\r\n if abs(current_p - next_p) <= 12:\r\n distance += abs(current_p - next_p)\r\n else:\r\n if current_p <= next_p:\r\n distance += current_p + (26 - next_p)\r\n else:\r\n distance += next_p + (26 - current_p)\r\n current_p = next_p\r\nprint(distance)\r\n", "# import string\r\n# x = string.ascii_lowercase\r\n# y = []\r\n# for i in range(0,len(x)):\r\n# y.append(x[i])\r\n\r\nz = str(input())\r\nt = 0\r\nprev = ord('a')\r\nfor i in z:\r\n diff=abs(ord(i)-prev)\r\n \r\n if diff>13:\r\n t+=26-diff\r\n else:\r\n t+=diff\r\n prev=ord(i)\r\n\r\nprint(t)", "s=input();total=0\r\nfor i in range(len(s)-1):\r\n val=abs(ord(s[i])-ord(s[i+1]))\r\n if val>=13:\r\n val=26-val\r\n total+=val\r\nval=abs(ord('a')-ord(s[0]))\r\nif val>=13: val=26-val\r\ntotal+=val\r\nprint(total)", "s = list(input())\r\nlst = ['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\nrotation = 0\r\nfor char in s:\r\n new_i = lst.index(char)\r\n distance = min(abs(i-new_i), 26-abs(i-new_i))\r\n rotation += distance\r\n i = new_i\r\nprint(rotation)", "def find_letter(string, letter,need):\r\n x = 0\r\n y,counter = string.index(letter),0\r\n while True:\r\n if string[y] == need:\r\n break\r\n elif string[y] == \"a\":\r\n counter += 1\r\n y = 25\r\n else:\r\n y -= 1\r\n counter += 1\r\n\r\n x = 0\r\n y= string.index(letter)\r\n while True:\r\n if string[y] == need:\r\n break\r\n elif string[y] == \"z\":\r\n x += 1\r\n y = 0\r\n else:\r\n y += 1\r\n x += 1\r\n \r\n return min(counter,x)\r\n\r\nstring = input()\r\nletters = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\ncounter = 0\r\n\r\nfirst = \"a\"\r\nfor i in string:\r\n counter += find_letter(letters,first,i)\r\n first = i\r\n\r\nprint(counter)\r\n", "x=ord('a')\r\nc=0\r\ns=input()\r\nfor i in s:\r\n if(abs(ord(i)-x)>13):\r\n c+=(26-abs(ord(i)-x))\r\n else:\r\n c+=abs(ord(i)-x)\r\n x=ord(i)\r\nprint(c)", "#4\r\nalp = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\nname = input()\r\nnumber = []\r\nfor i in name:\r\n for idj, j in enumerate(alp):\r\n if i == j:\r\n number.append(int(idj))\r\ndef distance(x):\r\n n1 = min(number[x], number[x+1])\r\n n2 = max(number[x], number[x+1])\r\n d1 = n2-n1\r\n d2 = (25-n2)+(n1+1)\r\n return min(d1, d2)\r\nsum = min((26-number[0]), number[0])\r\nfor j in range(len(name)-1):\r\n sum +=distance(j)\r\nprint(sum)\r\n", "def char_distance(c1, c2):\r\n distance = abs(ord(c1) - ord(c2))\r\n return min(distance, 26 - distance)\r\n\r\ndef calculate_rotations(exhibit):\r\n total_rotations = 0\r\n current_char = 'a'\r\n\r\n for c in exhibit:\r\n dist = char_distance(current_char, c)\r\n total_rotations += dist\r\n current_char = c\r\n\r\n return total_rotations\r\n\r\n\r\nexhibit = input().strip()\r\n\r\nrotations = calculate_rotations(exhibit)\r\nprint(rotations)\r\n\r\n\r\n", "\n# Problem: http://codeforces.com/contest/731/problem/A\n# Time: ms\n# Space: KB\n\n\n\n# String -> int\n# returns minimum no. of rotations of the wheel (either c.w. or a.c.w starting from a) needed to print the given string\n\n# stub\n# def countSteps(string):\n# return 0\n\n# unit tests\n# def test():\n# assert countSteps(\"zeus\") == 18\n# assert countSteps(\"map\") == 35\n# assert countSteps(\"ares\") == 34\n\n# solution\ndef countSteps(string):\n wheel = [\"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 currentIndex = 0\n steps = 0\n for letter in string:\n newIndex = wheel.index(letter)\n dist = abs(currentIndex - newIndex)\n if dist < 13:\n steps += dist\n else:\n steps += 26 - dist\n currentIndex = newIndex\n return steps\n# main\nif __name__ == \"__main__\":\n # test()\n string = input()\n print(countSteps(string))", "def f(s, t):\r\n dif = abs(ord(s) - ord(t))\r\n return min(26 - dif, dif)\r\n\r\ns = 'a' + input()\r\nprint(sum([f(s[i - 1], s[i]) for i in range(1, len(s))]))", "s = input()\r\nans = 0\r\nans += min((ord(s[0]) - ord('a')) % 26 , (ord('a') - ord(s[0])) % 26)\r\n\r\nfor i in range(len(s) - 1):\r\n ans += min((ord(s[i]) - ord(s[i + 1])) % 26 , (ord(s[i + 1]) - ord(s[i])) % 26)\r\n\r\n\r\nprint(ans)", "s=str(input())\r\na=list(\"abcdefghijklmnopqrstuvwxyz\")\r\nc=0\r\nt=0\r\nfor i in s:\r\n b=abs(a.index(i)-c)\r\n t+=min(b,26-b)\r\n c=a.index(i)\r\nprint(t) ", "s=input()\r\nh=len(s)\r\nt=[1]\r\ntong=0\r\nfor i in range(h):\r\n t.append(ord(s[i])-96)\r\n #print(t[i])\r\nfor i in range(h):\r\n if(t[i]<t[i+1]):\r\n tong+=min(t[i+1]-t[i],t[i]-t[i+1]+26)\r\n else:\r\n tong+=min(t[i]-t[i+1],t[i+1]-t[i]+26)\r\nprint(tong)", "import string\r\n\r\n\r\nword = input()\r\nwheels = 0\r\nstart = 0\r\nsteps = 0\r\n\r\nfor i in word:\r\n result1 = abs(string.ascii_lowercase.index(i) - start) \r\n if result1 <= 13:\r\n steps += result1\r\n else:\r\n steps += 26 - result1 \r\n start = string.ascii_lowercase.index(i)\r\nprint(steps) ", "s = input()\r\nrotation = 0\r\nfor i in range(len(s) - 1):\r\n t1 = abs(ord(s[i]) - ord(s[i + 1]))\r\n t2 = 26 - t1\r\n rotation = rotation + min(t1, t2)\r\nt1 = abs(ord(s[0]) - ord('a'))\r\nt2 = 26 - t1\r\nrotation = rotation + min(t1, t2)\r\nprint(rotation)", "t=input()\r\nx=ord(\"a\")-96\r\ny=ord(t[0])-96\r\ncount=min(abs(x-y),abs(26-abs((x-y))))\r\n\r\nfor i in range(0,len(t)-1):\r\n m=ord(t[i])-96\r\n n=ord(t[i+1])-96\r\n count+=min(abs(m-n),abs(26-abs(m-n)))\r\n\r\nprint(count)\r\n ", "c = 0\r\na = list(map(chr, range(97, 123)))\r\nt = 'a'\r\nfor i in input():\r\n c += min((abs(a.index(t) - a.index(i))), abs((26 - abs((a.index(t) - a.index(i))))))\r\n t = i\r\n\r\nprint(c)\r\n", "def loc(c):\n return ord(c)-97\ncurrent = 0\nword = input()\nres = 0\nfor c in word:\n dest = loc(c)\n res += min(\n abs(dest-current)\n ,\n 26-abs(current-dest))\n current = dest\nprint(res)", "s = input(); ans = min( abs(ord(s[0]) - ord('a')) , 26 - abs(ord(s[0]) - ord('a')))\r\nfor i in range(1, len(s)):\r\n l = abs(ord(s[i]) - ord(s[i-1]))\r\n ans += min(l, 26 - l)\r\nprint(ans)", "import string\r\ns = input()\r\ncircle = string.ascii_lowercase\r\n#print(circle)\r\npointer = 0\r\ncount = 0\r\nfor i in range(len(s)):\r\n\tif circle[pointer] != s[i]:\r\n\t\t#print(circle[pointer+1:] , circle[:pointer])\r\n\t\tforw = circle[pointer+1:] + circle[:pointer]\r\n\t\trev = forw[::-1]\r\n\t\t\r\n\t\tcount = count + min(forw.index(s[i]), rev.index(s[i]))+1\r\n\t\tpointer = circle.index(s[i])\r\n\t\t#print(s[i],forw, rev, circle[pointer], 1+min(forw.index(s[i]), rev.index(s[i])))\r\nprint(count)", "ch=input()\r\n#97=a 122=z\r\n\r\ndef howfar(a,b): \r\n fin=ord(b)-ord(a)\r\n far=fin%26\r\n x=26-far\r\n if x< far:\r\n far=x\r\n return far\r\nc=0\r\na='a'\r\nfor i in range(len(ch)):\r\n c+=howfar(a,ch[i])\r\n a=ch[i]\r\n \r\n\r\n\r\nprint(c)\r\n", "def distance_between_characters(ch1, ch2):\r\n distance_clockwise = abs(ord(ch1) - ord(ch2))\r\n distance_counterclockwise = 26 - distance_clockwise\r\n return min(distance_counterclockwise, distance_clockwise)\r\n\r\n\r\ns = input()\r\nres = 0\r\ncurrent_character = 'a'\r\n\r\nfor ch in s:\r\n res += distance_between_characters(ch, current_character)\r\n current_character = ch\r\n\r\nprint(res)\r\n", "def rotate(a,b):\n ans = abs(ord(a)-ord(b))\n if ans >13:\n ans = 26-ans\n return(ans)\ndef output(a):\n count = 0\n pointer = 'a'\n for i in range(len(a)):\n count = count + rotate(pointer, a[i])\n pointer = a[i]\n print(count)\na = input()\noutput(a)\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\n\r\ninput = sys.stdin.readline\r\n\r\ns = input().strip()\r\n\r\ncount = 0\r\nprev = 'a'\r\nfor i in s:\r\n a = abs(ord(i) - ord(prev))\r\n b = 26 - a\r\n\r\n count += min(a, b)\r\n prev = i\r\n\r\nprint(count)\r\n", "a = input()\r\nt = 1\r\nk = 0\r\nfor i in a:\r\n x = ord(i) - 96\r\n poc = abs(t - x)\r\n if poc < 26-poc:\r\n k += poc\r\n else:\r\n k += 26-poc\r\n t = x\r\nprint(k)", "name = input()\npoint = 'a'\nsteps = 0\n\nfor l in name:\n if(point == l):\n continue \n\n path1 = abs(ord(point) - ord(l))\n path2 = abs(ord(\"a\") - ord(point)) + abs(ord(\"z\") - ord(l)) + 1 if point < l else abs(ord(\"a\") - ord(l)) + abs(ord(\"z\") - ord(point)) + 1\n\n steps += path1 if path1 < path2 else path2\n point = l\n\nprint(steps)\n\t\t\t\t \t\t \t\t \t \t \t \t \t\t\t\t \t\t", "a=input()\r\nl='abcdefghijklmnopqrstuvwxyz'\r\nfrom_='a'\r\nm=0\r\nfor to in a:\r\n n=l.find(from_)\r\n n1=l.find(to)\r\n j=abs(n-n1)\r\n f=26-j\r\n m+=min(j,f)\r\n from_=to\r\nprint(m)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nline = insr()\r\nalph = \"abcdefghijklmnopqrstuvwxyz\"\r\ncur = 0\r\ncount = 0\r\nfor c in line:\r\n if c != alph[cur]:\r\n fr = ord(alph[cur])-97\r\n to = ord(c)-97\r\n left = 0\r\n right = 0\r\n if fr > to:\r\n # calculate left turn distance\r\n left = fr - to\r\n # calculate right turn distance\r\n right = 26 - fr + to\r\n if fr < to:\r\n # calculate right turn distance\r\n right = to - fr\r\n # calculate left turn distance\r\n left = fr + (26 - to)\r\n count += min(left, right)\r\n cur = to\r\n\r\nprint(count)", "s = input()\r\nans = 0\r\nstart = ord('a')\r\nfor i in s:\r\n val = ord(i)\r\n diff = abs(start-val)\r\n ans += min(diff,26-diff)\r\n start = val\r\nprint(ans)", "s = str(input())\r\ns = \"a\" + s\r\nsum = 0\r\nfor i in range(len(s) -1):\r\n if (abs(ord(s[i + 1]) - ord(s[i]))) > 13:\r\n sum += 26 - abs(ord(s[i]) - ord(s[i+1]))\r\n else:\r\n sum += abs(ord(s[i +1]) - ord(s[i]))\r\nprint(sum)\r\n", "# tc = int(input())\r\nfor i in range(1):\r\n # n = int(input())\r\n # li = list(map(int,input().split()))\r\n s = input()\r\n ans = min(ord(s[0]) - ord('a'),26+ord('a')-ord(s[0]))\r\n \r\n for i in range(1,len(s)):\r\n t = 0\r\n if s[i]>s[i-1]:\r\n t += min( ord(s[i])-ord(s[i-1]) ,26+ord(s[i-1]) - (ord(s[i])))\r\n else:\r\n t += min(ord(s[i-1])-ord(s[i]),26+ord(s[i]) - (ord(s[i-1])))\r\n ans+=t\r\n print(ans)\r\n", "from string import ascii_lowercase\r\nletters = [e for e in ascii_lowercase]\r\nfront = 0\r\nsteps = 0\r\nword = list(input())\r\nfor e in word:\r\n step1 = abs(letters.index(e) - front)\r\n step2 = 26-step1\r\n steps += min(step1, step2)\r\n front = letters.index(e)\r\nprint(steps)", "#Haphazard solution\r\nartName = input()\r\nnoMoves = 0\r\ncurrent = 'a'\r\n\r\n#Distance to the first letter\r\nif(abs(ord('a')-ord(artName[0])) <= 13):\r\n noMoves = noMoves + abs(ord('a')-ord(artName[0]))\r\nelse:\r\n noMoves = noMoves + (26 - abs(ord('a')-ord(artName[0])))\r\n\r\n#Now change the index to start processing the name\r\ncurrent = artName[0]\r\n\r\nfor x in range(len(artName)-1):\r\n current = artName[x]\r\n if(abs(ord(current)-ord(artName[x+1])) <= 13):\r\n noMoves = noMoves + abs(ord(current)-ord(artName[x+1]))\r\n else:\r\n noMoves = noMoves + (26 - abs(ord(current)-ord(artName[x+1])))\r\n\r\nprint(noMoves)", "ring=\"abcdefghijklmnopqrstuvwxyz\"\r\nind=1\r\ntxt=input()\r\nans=0\r\nfor i in txt :\r\n aso=ring.index(i)+1\r\n k=ind-aso\r\n if k<=0 :\r\n k=-k\r\n sait=min(k,26-k)\r\n ans+=sait\r\n ind=aso\r\nprint(ans)", "s=list(input())\r\ntemp=\"a\"\r\nsu=0\r\nfor i in range(len(s)):\r\n diff=abs(ord(s[i])-ord(temp))\r\n if(diff<=13):\r\n su+=diff\r\n else:\r\n su+=26-diff\r\n temp=s[i]\r\nprint(su)", "word = input()\r\nd={}\r\nfor i in range(97,123):\r\n d[chr(i)]=i-96\r\ncount = min(abs(d['a']-d[word[0]]),abs(26-abs(d['a']-d[word[0]])))\r\nfor i in range(1,len(word)):\r\n count+=min(abs(d[word[i-1]]-d[word[i]]),abs(26-abs(d[word[i-1]]-d[word[i]])))\r\nprint(count)", "w = \"a\" + input()\r\nans = 0\r\nfor i in range(1, len(w)):\r\n ans += min((abs(ord(w[i])- ord(w[i-1])), (ord(w[i-1])-97) + (26-(ord(w[i])-97)), 26-(ord(w[i-1])-97) + ord(w[i])-97))\r\nprint(ans)", "prev = 'a'\r\ncount = 0\r\nfor c in input():\r\n count += min(abs(ord(c) - ord(prev)), 26 - abs(ord(c) - ord(prev)))\r\n prev = c\r\nprint(count)", "\r\nexhibit_name = input()\r\n\r\npointer_position = ord('a')\r\n\r\ntotal_rotations = 0\r\n\r\nfor char in exhibit_name:\r\n target_position = ord(char) \r\n\r\n \r\n clockwise_rotations = (target_position - pointer_position + 26) % 26\r\n counterclockwise_rotations = (pointer_position - target_position + 26) % 26\r\n\r\n \r\n min_rotations = min(clockwise_rotations, counterclockwise_rotations)\r\n\r\n\r\n total_rotations += min_rotations\r\n pointer_position = target_position\r\n\r\nprint(total_rotations)\r\n", "s = input()\r\nans = min(ord(s[0])-97, 26 - ord(s[0]) + 97)\r\nfor i in range(1, len(s)):\r\n if s[i - 1] > s[i]:\r\n ans += min( abs( (ord(s[i]) - 97) - (ord(s[i - 1]) - 97)), abs(26 + (ord(s[i]) - 97) - (ord(s[i - 1]) - 97)))\r\n else:\r\n ans += min(abs((ord(s[i]) - 97) - (ord(s[i - 1]) - 97)), abs(26 - (ord(s[i]) - 97) + (ord(s[i - 1]) - 97)))\r\n\r\nprint(ans)", "wor=input()\r\nt=0\r\npos_a=ord('a')\r\npos_z=ord('z')\r\npoz=ord('a')\r\n\r\n\r\n\r\n\r\nfor i in wor:\r\n\ta=ord(i)\r\n\tb=abs(a-poz)\r\n\tpoz=a\r\n\tif b>13:\r\n\t\tb=26-b\r\n\tt+=b\r\nprint(t)\r\n", "def min_rotations_to_print(exhibit):\r\n current_letter = 'a'\r\n rotations = 0\r\n\r\n for ch in exhibit:\r\n diff = abs(ord(current_letter) - ord(ch))\r\n rotations += min(diff, 26 - diff)\r\n current_letter = ch\r\n\r\n return rotations\r\nexhibit_name = input().strip()\r\nprint(min_rotations_to_print(exhibit_name))\r\n", "wheel = input()\r\n \r\npointer = 'a'\r\ncount = 0\r\n \r\nfor c in wheel:\r\n dist = abs(ord(pointer) - ord(c))\r\n \r\n if dist < 13:\r\n count = count + dist\r\n else:\r\n count = count + (26 - dist)\r\n \r\n pointer = c\r\n \r\nprint(count)", "a=[1,'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=input()\r\nt=1\r\nsum1=0\r\nfor i in range(len(b)):\r\n r=a.index(b[i])\r\n #print(min(abs(r-t),abs(t+26-r)),abs(r-t),t+26-r)\r\n sum1+=min(abs(r-t),t+26-r,r+26-t)\r\n t=r\r\nprint(sum1)", "letters=\"abcdefghijklmnopqrstuvwxyz\"\r\nnow=0;nr=0;nl=0;c1=0;c2=0;co=0\r\ny=input()\r\nfor i in y:\r\n c1=0;c2=0\r\n nl=now;nr=now\r\n while letters[nl]!=i :\r\n nl-=1\r\n c1+=1\r\n while letters[nr]!=i :\r\n nr+=1\r\n c2+=1\r\n if nr==len(letters):\r\n nr=0\r\n co+=min(c1,c2) \r\n now=letters.find(i)\r\nprint(co)", "string=input()\r\nl1='a'\r\nl2=0\r\nans=0\r\n\r\nfor i in string:\r\n l2=abs(ord(i)-ord(l1))\r\n if l2>13:\r\n ans+=26-l2\r\n else:\r\n ans+=l2\r\n l1=i\r\nprint(ans)", "s=input()\r\nd=ord(\"a\")\r\nx=0\r\nfor i in s:\r\n p=abs(ord(i)-d)\r\n if p>13:\r\n x+=26-p\r\n else:\r\n x+=p\r\n d=ord(i)\r\n\r\nprint(x) ", "\"\"\"\r\ninput().split()\r\n\"\"\"\r\nalphabet = [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\"]\r\nn = input()\r\n\r\npointer = 0\r\ncounter = 0\r\n\r\nfor x in n:\r\n index = alphabet.index(x)\r\n resultStraight = abs(pointer - index)\r\n resultConverted = abs(25 - resultStraight) + 1\r\n if(resultConverted > resultStraight):\r\n counter = counter + resultStraight\r\n else:\r\n counter = counter + resultConverted\r\n pointer = index\r\n\r\nprint(counter)\r\n", "def pos(i):\r\n l=list()\r\n ch=\"abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz\"\r\n for j in range(len(ch)):\r\n if ch[j]==i:\r\n l.append(j)\r\n return(l)\r\nch=input()\r\nch1=\"a\"+ch\r\ns=0\r\nfor i in range(len(ch1)-1):\r\n l=list()\r\n l.append(abs(max(pos(ch1[i+1]))-max(pos(ch1[i]))))\r\n l.append(abs(max(pos(ch1[i+1]))-min(pos(ch1[i]))))\r\n l.append(abs(min(pos(ch1[i+1]))-max(pos(ch1[i]))))\r\n l.append(abs(min(pos(ch1[i+1]))-min(pos(ch1[i]))))\r\n s=s+min(l)\r\nprint(s)\r\n", "turns, words = 0, 'a' + input()\nfor i in range(1, len(words)):\n diff = abs((ord(words[i]) - ord(words[i-1])))\n turns += min(diff, 26-diff)\nprint(turns)\n", "s = str(input())\r\na = [ord(i)-97 for i in s]\r\nans = 0\r\nfor j in range(len(s)):\r\n if j == 0:\r\n ans += min(a[j], 26-a[j])\r\n else:\r\n ans += min(abs(a[j]-a[j-1]),abs(26-abs(a[j]-a[j-1])))\r\nprint(ans)", "a = input()\r\nch = 'a'\r\nans = 0\r\nfor i in a:\r\n ans += min(abs(ord(i)-ord(ch)),26-abs(ord(i)-ord(ch)))\r\n ch = i\r\nprint(ans)", "a_ascii = 97\ntotal = 0\nfor asc_value in map(ord, input()):\n\ti = abs(a_ascii - asc_value)\n\ttotal += min(i, 26 - i)\n\ta_ascii = asc_value\nprint(total)", "from collections import deque\r\nfrom collections import OrderedDict\r\nimport queue\r\nimport heapq\r\nimport math\r\nfrom re import I\r\nimport sys\r\nsys.setrecursionlimit(10**6)\r\n \r\ndef sf(): return [int(x) for x in input().split(\" \")]\r\ndef sfi(): return int(input())\r\ndef sfs(): return input()\r\ndef printf(x):\r\n print(x)\r\n sys.stdout.flush()\r\n\r\n\r\ndef main():\r\n s = sfs()\r\n l = 'a'\r\n sum = 0\r\n for i in s:\r\n if (i < l): cw = ord('z')-ord(l) + ord(i)-ord('a') + 1\r\n else: cw = ord(i)-ord(l)\r\n if (i > l): ccw = ord(l)-ord('a') +1+ ord('z') - ord(i)\r\n else: ccw = ord(l)-ord(i)\r\n sum += min(cw,ccw)\r\n l = i\r\n print(sum)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "last_index=0;res=0;alphabet=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\nlist_string = list(input())\r\nfor i in list_string:\r\n v=alphabet.index(i)\r\n res+=min(26-abs(v-last_index),abs(v-last_index))\r\n last_index=v\r\nprint(res)", "alpha = ['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\nalpha.extend(alpha)\r\ns = list(input())\r\ns.insert(0,'a')\r\ndistance = []\r\nfor i in range(1,len(s)):\r\n target = alpha.index(s[i])\r\n ref = alpha.index(s[i-1])\r\n cwlst = alpha[ref:] \r\n cw = cwlst.index(s[i])\r\n unticwlst = alpha[target:]\r\n unticw = unticwlst.index(s[i-1])\r\n distance.append(min([cw,unticw]))\r\n\r\nprint(sum(distance))", "n = input().upper()\r\ncount = 0\r\nstraight = 65\r\nfor i in range(len(n)):\r\n if abs(straight - ord(n[i])) <= 13:\r\n count += abs(straight - ord(n[i]))\r\n else:\r\n count += 26 - abs(straight - ord(n[i]))\r\n straight = ord(n[i])\r\nprint(count)\r\n", "x = input()\r\ntemp = \"a\"\r\ntot = 0\r\nfor c in x:\r\n\tdiff = abs(ord(temp) - ord(c))\r\n\tif diff > 12:\r\n\t\tdiff = 26 - diff\r\n\ttot = tot + diff\r\n\ttemp = c\r\nprint(tot)\r\n", "s = 'a' + input()\nans = 0\nfor i in range(1,len(s)):\n ans += min(abs(ord(s[i])-ord(s[i-1])),26-abs(ord(s[i])-ord(s[i-1])))\nprint(ans)", "s=\"abcdefghijklmnopqrstuvwxyz\"\r\np=0\r\nc=0\r\nx=input()\r\nfor g in x:\r\n cp=0\r\n cn=0\r\n p2=p\r\n p3=p\r\n while s[p2]!=g:\r\n cp+=1\r\n p2+=1\r\n if p2>25:\r\n p2=0\r\n while s[p3]!=g:\r\n cn+=1\r\n p3-=1\r\n if p3<0:\r\n p3=25\r\n if cp<cn:\r\n c+=cp\r\n p=p2\r\n else:\r\n c+=cn\r\n p=p3\r\nprint(c)\r\n", "\r\nz=input()\r\npos=0\r\n\r\nprev='a'\r\nfor i in z:\r\n diff=abs(ord(prev)-ord(i))\r\n pos+=min(diff,26-diff)\r\n prev=i\r\n\r\nprint(pos) \r\n", "def min_distance(x, y):\r\n d = abs(x - y)\r\n return min(d, 26 - d)\r\n\r\np = ans = 0\r\nfor c in input():\r\n g = ord(c) - 97\r\n ans += min_distance(p, g)\r\n p = g\r\nprint(ans)\r\n", "ans=0\r\ns=input()\r\na=26\r\nfor i in s:\r\n k=ord(i)-97\r\n if abs(a-k)>26-abs(a-k):\r\n ans+=26-abs(a-k)\r\n else:\r\n ans+=abs(a-k)\r\n a=ord(i)-97\r\nprint(ans)", "#https://codeforces.com/problemset/problem/731/A\r\n\r\nword = \"a\"+input()\r\nspins = 0\r\nfor letter in range(len(word[:-1])):\r\n letter_value = ord(word[letter])-96\r\n next_letter_value = ord(word[letter+1]) - 96\r\n difference = abs(letter_value - next_letter_value)\r\n if(difference <= (26-1)//2):\r\n spins += difference\r\n else:\r\n spins += 26-difference\r\nprint(spins)", "alp = ['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\nini = 'a'\r\ncount = 0\r\nfor i in s:\r\n inix = alp.index(ini)\r\n inito = alp.index(i)\r\n if(abs(inito - inix) > 13):\r\n x = 26 - abs(inito - inix)\r\n else:\r\n x = abs(inito - inix)\r\n count+= x\r\n ini = i\r\nprint(count)", "s=input()\r\ni=0\r\nc=0\r\npre=1\r\nn=len(s)\r\nwhile i<n:\r\n x=((ord(s[i])-96)-pre)%26\r\n #print(x)\r\n y=(26-x)%26\r\n #print(x,y)\r\n c=c+min(x,y)\r\n pre=ord(s[i])-96\r\n i=i+1\r\n \r\nprint(c)\r\n", "exhibit = input()\r\nsum = 0\r\nlst = []\r\n\r\nfor i in range(len(exhibit)):\r\n lst.append(exhibit[i])\r\n\r\n\r\nif exhibit[0] != \"a\":\r\n if abs(ord(lst[0]) - 97) <= 13:\r\n sum += abs(ord(lst[0]) - 97)\r\n else:\r\n sum += 26 - abs(ord(lst[0]) - 97)\r\n for i in range(1, len(exhibit)):\r\n if abs(ord(lst[i]) - ord(lst[i-1])) <= 13:\r\n sum += abs(ord(lst[i]) - ord(lst[i-1]))\r\n else:\r\n sum += 26 - abs(ord(lst[i]) - ord(lst[i-1]))\r\nelse:\r\n for i in range(1, len(exhibit)):\r\n if abs(ord(lst[i]) - ord(lst[i-1])) <= 13:\r\n sum += abs(ord(lst[i]) - ord(lst[i-1]))\r\n else:\r\n sum += 26 - abs(ord(lst[i]) - ord(lst[i-1]))\r\n\r\n \r\nprint(sum)", "\"\"\"\r\nm=input()\r\nz = '{}{}'.format('a', m)\r\nsum1=0\r\na = {'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,\r\n'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\n\r\nx = abs(a[z[0]] - a[z[i]])\r\n\r\nfor i in range(len(z)-1):\r\n sum1 = sum1 + min(abs(a[z[i]] - a[z[i+1]]), abs(a[z[i]]-a[z[i+1]]))\r\n\r\nprint(sum1)\r\n\"\"\"\r\n\r\ni = ord('a')\r\ns=0\r\n\r\nfor c in input():\r\n j = ord(c)\r\n d=abs(j-i)\r\n s += min(d, 26 - d)\r\n i = j\r\nprint(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "name = input()\r\nalphabet = [chr(i) for i in range(97,123)]\r\nlast = 0\r\nnum = 0\r\nfor x in name:\r\n i = alphabet.index(x)\r\n num1 = abs(i-last)\r\n if i < last:\r\n num2 = abs(i+26-last)\r\n else:\r\n num2 = abs(last+26-i)\r\n num += min(num1,num2)\r\n last = i\r\nprint(num)", "st=input()\r\n\r\nd=0\r\np=ord('a')\r\nfor i in st:\r\n di=abs(ord(i)-p)\r\n if di>13:\r\n d+=26-di\r\n else:\r\n d+=di\r\n p=ord(i)\r\nprint(d)", "def c(letter):\r\n return ord(letter) - 96\r\nn=input()\r\nn=\"a\"+n\r\nbuoc=0\r\nfor i in range(0,len(n)-1):\r\n buoc+=min(abs(c(n[i+1])-c(n[i])),26-(abs(c(n[i+1])-c(n[i]))))\r\nprint(buoc)\r\n", "s=input()\r\nans,a=0,97\r\nfor i in s:\r\n ans+=min(abs(ord(i)-a),26-(abs(ord(i)-a)))\r\n a=ord(i)\r\nprint(ans)", "word = input()\r\n\r\nlast = 'a'\r\nrotations =0\r\nfor i in range(len(word)):\r\n if word[i] == last:\r\n continue\r\n temp1 = abs(ord(last) - ord(word[i])) \r\n temp2 = (ord(last) - ord('a')) + (ord('z')-ord(word[i])) +1\r\n temp3 = ( (ord('z')-ord(last)) + (ord(word[i]) - ord('a')) +1)\r\n rotations += min(temp1,temp2,temp3)\r\n last = word[i]\r\n\r\nprint(rotations)\r\n", "def calculare_nr_miscari(current_letter, desired_letter):\r\n direct_distance = abs(ord(current_letter) - ord(desired_letter))\r\n inversed_distance = 26 - direct_distance\r\n return (min(direct_distance, inversed_distance))\r\n\r\nlist1 = list(input())\r\n\r\nsum = 0\r\n\r\ncurrent_letter = 'a'\r\nwhile len(list1) > 0:\r\n desired_letter = list1[0]\r\n sum += calculare_nr_miscari(current_letter, desired_letter)\r\n current_letter = list1.pop(0)\r\n\r\nprint(sum)", "ap='abcdefghijklmnopqrstuvwxyz'\r\ns=input()\r\ni,wk=1,0\r\nfor j in s:\r\n dx=ap.index(j)+1\r\n wk+=min(26-abs(dx-i),abs(dx-i))\r\n i=dx\r\nprint(wk)", "word = input()\r\na = \"abcdefghijklmnopqrstuvwxyz\"\r\ns = {a[i]: i+1 for i in range(26)}\r\nres = 0\r\ncurr = \"a\"\r\nfor letter in word:\r\n if letter > curr:\r\n dist1 = s[letter]-s[curr]\r\n dist2 = s[curr]+26-s[letter]\r\n else:\r\n dist1 = s[curr]-s[letter]\r\n dist2 = s[letter]+26-s[curr]\r\n res += min(dist1, dist2)\r\n curr = letter\r\nprint(res)\r\n", "import math\r\ns=input()\r\nst='a'\r\nsts=0\r\nfor i in s:\r\n sts+=min(int(math.fabs(ord(st) - ord(i))),26-int(math.fabs(ord(st) - ord(i))))\r\n st=i\r\nprint(sts)\r\n", "lastChar = \"a\"\r\nsumm = 0\r\nfor char in input():\r\n summ += - abs(((ord(lastChar) - ord(char)) % 26 ) - 13) + 13\r\n lastChar = char\r\nprint(summ)", "ans = 0\r\na = 'a'\r\nfor el in input():\r\n f = ord(a) - ord('a')\r\n s = ord(el) - ord('a')\r\n z = ord('z') - ord('a') + 1\r\n ans += min(abs(s - f), z - abs(s - f))\r\n a = el\r\nprint(ans)", "#problem link : https://codeforces.com/contest/731/problem/A\r\nx = input()\r\nz =0\r\ny = 'a'\r\nm = 0\r\nfor i in x :\r\n m = abs(ord(i) -ord(y))\r\n if m > 12 :\r\n z+= abs(26-m)\r\n y = i\r\n else :\r\n z+= m\r\n y = i\r\n\r\nprint(z)", "ans = 0\r\nstr = \"a\" + input()\r\nfor i in range(1,len(str)):\r\n ans += abs(ord(str[i-1]) - ord(str[i])) if abs(ord(str[i-1]) - ord(str[i])) % 26 < 13 else 26 - abs(ord(str[i-1]) - ord(str[i]))\r\nprint(ans)", "li = ['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\nsum = 0\r\nfor letter in word:\r\n x= min(li.index(letter), len(li)-li.index(letter))\r\n sum += x\r\n taking = li[li.index(letter):]\r\n del li[li.index(letter):]\r\n for item in reversed(taking):\r\n li.insert(0, item)\r\nprint(sum)", "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\ndef fun(x,y):\r\n if ord(x)>ord(y):\r\n x,y=y,x\r\n k1=len(l[l.index(x):l.index(y)])\r\n k2=len(l[:l.index(x)])+len(l[l.index(y):])\r\n k=min(k1,k2)\r\n return k\r\n# print(fun('u','s'))\r\ns=input()\r\nc=0\r\nk='a'\r\nfor i in range(len(s)):\r\n c+=fun(k,s[i])\r\n k=s[i]\r\nprint(c)", "# map\nword = input()\nword = [char for char in word]\ncount=0\nstring = 'abcdefghijklmnopqrstuvwxyz'\narr = [char for char in string]\nfor i in range(len(word)):\n ind = string.index(word[i])\n if i==0 and word[i]!='a':\n count+=min(len(arr[:ind:-1])+1, len(arr[:ind]))\n temp = ind\n if i==0 and word[i]=='a':\n count+=min(0, len(arr[:ind]))\n temp = ind\n elif i>0:\n if temp > ind: \n count+=min(len(arr[temp:ind:-1]), (len(arr[temp:]))+(len(arr[:ind])))\n temp = ind\n elif temp < ind:\n count+=min((len(arr[temp::-1]))+(len(arr[:ind:-1])), len(arr[temp:ind]))\n temp = ind \n elif temp==ind:\n count+=min((len(arr[temp:ind:-1])), len(arr[temp:ind]))\n temp = ind \nprint(count)\n\n", "def main(s):\r\n sm = run = 0\r\n for i in range(len(s)):\r\n indexx = ord(s[i]) - 97\r\n walk = abs(run - indexx)\r\n if walk < 13: sm += walk\r\n else: sm += 26 - walk\r\n run = indexx\r\n return sm\r\n\r\n\r\ns = input()\r\nprint(main(s))", "def main():\r\n s = input()\r\n previous = 0\r\n rotations = 0\r\n for characters in s:\r\n current = ord(characters)-ord('a')\r\n if current > previous:\r\n rotations += min(current - previous, 26 - (current - previous))\r\n else:\r\n rotations += min(previous - current, 26 - (previous - current))\r\n previous = current\r\n print(rotations)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def min_dist(actual, next):\r\n va, vn = ord(actual), ord(next)\r\n cw, ccw = 0, 0\r\n if va > vn:\r\n cw = 26 - va + vn\r\n ccw = va - vn\r\n elif vn > va:\r\n cw = 26 - vn + va\r\n ccw = vn - va\r\n else:\r\n cw, ccw = 0, 0\r\n return min(cw, ccw)\r\n\r\n\r\ns = input()\r\nans = 0\r\nfor i in range(0, len(s)):\r\n if i == 0:\r\n ans += min_dist('a', s[i])\r\n else:\r\n ans += min_dist(s[i-1], s[i])\r\nprint(ans)\r\n", "t=0\r\ns=97\r\na=input()\r\nfor i in a:\r\n b=abs(ord(i)-s)\r\n t+=min(b,26-b)\r\n s=ord(i)\r\nprint(t)\r\n", "first_position=\"a\"\r\ncount=0\r\nfor i in input():\r\n straight=abs(ord(i)-ord(first_position))\r\n count+=min(straight,26-straight)\r\n first_position=i\r\nprint(count) ", "import string\r\nx = string.ascii_lowercase\r\n\r\nrotations = 0\r\ntarget = input()\r\n\r\nfor char in target:\r\n count1 = 0\r\n count2 = 0\r\n index1 = 0\r\n index2 = 0\r\n if char != x[0]:\r\n for j in range(1, 26):\r\n count1 += 1\r\n if char == x[j]:\r\n index1 = j\r\n break\r\n\r\n for k in range(25, 0, -1):\r\n count2 += 1\r\n if char == x[k]:\r\n index2 = k\r\n break\r\n\r\n if count1 < count2:\r\n rotations += count1\r\n x = x[index1:] + x[:index1]\r\n else:\r\n rotations += count2\r\n x = x[index2:] + x[:index2]\r\n\r\nprint(rotations)\r\n", "n = input()\r\nnow = 1\r\ncount = 0\r\n\r\nfor i in n:\r\n if abs(now - (ord(i)-96)) < (26 - abs(now-(ord(i)-96))):\r\n count += abs(now - (ord(i)-96))\r\n now = ord(i)-96\r\n else:\r\n count += (26 - abs(now-(ord(i)-96)))\r\n now = ord(i)-96\r\n \r\nprint(count)\r\n ", "def no_of_rotations(word):\r\n current_asc=97\r\n rotations=0\r\n for i in word:\r\n wanted_asc=ord(i)\r\n diff=abs(current_asc-wanted_asc)\r\n if(diff<=13):\r\n rotations+=diff\r\n else:\r\n rotations+=26-diff\r\n current_asc=wanted_asc\r\n return(rotations)\r\n\r\ndef main():\r\n inp_word=input()\r\n print(no_of_rotations(inp_word))\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "states = input()\r\n\r\nfrom_A = {\r\n 'a' : 0, \r\n 'b' : 1,\r\n 'z' : 1,\r\n 'y' : 2,\r\n 'c' : 2,\r\n 'd' : 3,\r\n 'x' : 3,\r\n 'e' : 4,\r\n 'w' : 4,\r\n 'f' : 5,\r\n 'v' : 5,\r\n 'g' : 6,\r\n 'u' : 6,\r\n 'h' : 7,\r\n 't' : 7,\r\n 's' : 8,\r\n 'i' : 8,\r\n 'r' : 9,\r\n 'j' : 9,\r\n 'q' : 10,\r\n 'k' : 10,\r\n 'p' : 11,\r\n 'l' : 11,\r\n 'o' : 12,\r\n 'm' : 12,\r\n 'n' : 13\r\n\r\n}\r\n\r\n\r\ninitial_state = 'a'\r\nnum_roatations = 0\r\nfst_half = 'abcdefghijklm'\r\nscnd_half = 'nopqrstuvwxyz'\r\nalphabets = fst_half + scnd_half\r\nold_state = initial_state\r\n\r\nfor state in states:\r\n num_roatations += min(abs(alphabets.index(state) - alphabets.index(old_state)), (from_A[state])+ from_A[old_state])\r\n old_state = state\r\n\r\nprint(num_roatations)", "letters = 'abcdefghijklmnopqrstuvwxyz'\n\ndef getsmaller(n1,n2,t):\n x = abs(n1- n2)\n y = t- abs(n1-n2)\n\n return min(x,y)\n\nword = input(\"\")\nn1 = 0\nn2 = letters.index(word[0])\nnum = 0\nfor i in word[1:]:\n num+=getsmaller(n1,n2,26)\n n1 = n2\n n2 = letters.index(i)\nnum+=getsmaller(n1,n2,26)\n\nprint(num)\n\n\n \t\t \t \t \t\t \t\t\t \t \t \t", "#n=int(input())\r\ndict1={}\r\ns='abcdefghijklmnopqrstuvwxyz'\r\nfor i in range(len(s)):\r\n dict1[s[i]]=i\r\nstring1=input()\r\ncounter=0\r\nif(dict1[string1[0]]<26-dict1[string1[0]]):\r\n counter+=dict1[string1[0]]\r\nelse:\r\n counter+=26-dict1[string1[0]]\r\nfor i in range(1,len(string1)):\r\n if(abs(dict1[string1[i-1]]-dict1[string1[i]])<26-abs(dict1[string1[i-1]]-dict1[string1[i]])):\r\n counter+=abs(dict1[string1[i-1]]-dict1[string1[i]])\r\n else:\r\n counter+=26-abs(dict1[string1[i-1]]-dict1[string1[i]])\r\nprint(counter)\r\n ", "s=input()\r\nl=list(s)\r\na=abs(ord('a')-ord(l[0]))\r\nb=abs(26-a)\r\nc=min(a,b)\r\n\r\nfor i in range(len(s)-1):\r\n z=abs(ord(l[i])-ord(l[i+1]))\r\n y=abs(26-z)\r\n c=c+min(z,y)\r\n\r\nprint(c)\r\n", "dic = {chr(a): a - 96 for a in range(97, 123)}\r\n\r\nword = input()\r\ncounter = 0\r\ncur_position = 1\r\n\r\nfor letter in word:\r\n next_position = dic.get(letter)\r\n\r\n diff = abs(cur_position - next_position)\r\n if diff <= 13:\r\n counter += diff\r\n else:\r\n counter += 26 - diff\r\n\r\n cur_position = next_position\r\n\r\nprint(counter)", "string = input()\r\ndct = {ch: idx for idx, ch in enumerate(\"abcdefghijklmnopqrstuvwxyz\", 1)}\r\ncurrent = 'a'\r\nres = 0\r\nfor c in string:\r\n if dct[c] > dct[current]:\r\n if dct[c] - dct[current] <= dct[\"z\"] - dct[c] + dct[current]:\r\n res += dct[c] - dct[current]\r\n else:\r\n res += dct[\"z\"] - dct[c] + dct[current]\r\n else:\r\n if dct[current] - dct[c] <= dct['z'] - dct[current] + dct[c]:\r\n res += dct[current] - dct[c]\r\n else:\r\n res += dct['z'] - dct[current] + dct[c]\r\n current = c\r\nprint(res)", "# https://codeforces.com/contest/731/problem/A\r\n\r\nw = list(input())\r\nw.insert(0, 'a')\r\ncount = 0\r\nfor i in range(1, len(w)):\r\n count += min(abs(ord(w[i]) - ord(w[i-1])), 26 - abs(ord(w[i]) - ord(w[i-1])))\r\nprint(count)", "x = input()\r\nabc = 'abcdefghijklmnopqrstuvwxyz'\r\nans = 0\r\np = 1\r\nfor i in x:\r\n t = abc.find(i) + 1\r\n ans += min(abs(t - p), 26 - t + p, 26 - p + t)\r\n p = t\r\nprint(ans)", "a='abcdefghijklmnopqrstuvwxyz'\r\nb=input()\r\nn=0\r\nans=0\r\nfor x in b:\r\n f=a.index(x)\r\n if f>=n:\r\n k1=f-n\r\n k2=n+26-f\r\n else:\r\n k1=n-f\r\n k2=f+26-n\r\n ans+=min(k1,k2)\r\n n=f\r\nprint(ans)\r\n", "s = input()\r\n\r\nn = len(s)\r\n\r\nref = ord('a')\r\nN = 26\r\nsuma = 0\r\n\r\nfor i in range(n):\r\n\tl = ord(s[i])\r\n\t\r\n\tsuma += min(abs(l - ref), N - abs(l - ref))\r\n\tref = l\r\n\r\nprint(suma)", "##\r\n\r\n\r\nc=97;s=0;\r\nfor j in map(ord,input()):\r\n\ti=abs(c-j)\r\n\ts+=min(i,26-i)\r\n\tc=j\r\nprint(s)", "import string\r\n\r\nletters = dict((v, k) for k, v in enumerate(string.ascii_lowercase))\r\ncurrent_pos = 0\r\ntotal_rotations = 0\r\n\r\nexhibit_name = input()\r\n\r\nfor letter in exhibit_name:\r\n clockwise_rotations_from_a = letters[letter]\r\n\r\n rotations1 = (current_pos - clockwise_rotations_from_a) % 26\r\n rotations2 = (clockwise_rotations_from_a - current_pos) % 26\r\n\r\n if rotations1 > rotations2:\r\n total_rotations += rotations2\r\n else:\r\n total_rotations += rotations1\r\n\r\n current_pos = clockwise_rotations_from_a\r\n\r\nprint(total_rotations)\r\n", "name = input()\r\ncu = 0 \r\nro = 0\r\n\r\nfor char in name:\r\n ta = ord(char) - ord('a') \r\n cl = (ta - cu + 26) % 26\r\n cd = (cu - ta + 26) % 26\r\n ro += min(cl, cd)\r\n cu = ta \r\n\r\nprint(ro)\r\n", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\na=list(input())\nsu=min(ord(a[0])-97,123-ord(a[0]))\nfor i in range(1,len(a)):\n k=abs(ord(a[i])-ord(a[i-1]))\n su+=min(k,26-k)\nprint(su) ", "import string\n\ns = input()\nA = {}\ni = 0\nfor c in string.ascii_lowercase:\n A[c] = i\n i += 1\n\ndef solve(s):\n n = 26\n x, i = 0, 0\n for c in s:\n j = A[c]\n if i <= j:\n d = min(j-i,i+n-j)\n else:\n d = min(i-j,n-i+j)\n #print(d)\n x += d\n i = j\n print(x)\n\nsolve(s)\n", "a = \"abcdefghijklmnopqrstuvwxyz\"\r\ns = input()\r\nlast = \"a\"\r\ni = 0\r\nfor y in s:\r\n j = abs(a.index(y)-a.index(last))\r\n i += min(j, 26-j)\r\n last = y\r\n\r\nprint(i)", "exhibit=input()\r\nsum=0\r\nstart=\"a\"\r\nfor i in exhibit:\r\n d=abs(ord(i)-ord(start))\r\n if d > 13:\r\n sum+=(26-d)\r\n else:\r\n sum+=d\r\n start=i\r\nprint(sum)", "c, t, a = 0, 'a', list(map(chr, range(97, 123)))\r\nfor i in input():\r\n c += min((abs(a.index(t) - a.index(i))), abs((26 - abs((a.index(t) - a.index(i))))))\r\n t = i\r\n\r\nprint(c)\r\n", "# 97 == unicode a\r\n# 26 letters in alphabet\r\n# 97(a) - 122 (z) = 25\r\n# 26 - 25 = 1\r\n# 1 of the 26 letters in alphabet is a\r\n\r\ns = input()\r\np = ord(s[0]) - 97 # getting starting position unicode if z = 122, then starting position is 122-97\r\nc = min(p, 26-p) # getting shorter path to letter min(beginning-to-end, end-to-beginning)\r\nfor i in range(1, len(s)):\r\n h = abs(ord(s[i]) - ord(s[i-1])) \r\n l = 26 - h \r\n if h < l:\r\n c += h\r\n else:\r\n c += l\r\nprint(c)\r\n\r\n", "a = input()\r\nif abs(ord(a[0]) - ord('a')) > 13:\r\n s = 26 - abs(ord(a[0]) - ord('a'))\r\nelse:\r\n s = abs(ord(a[0]) - ord('a'))\r\nalf = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\nfor f in range(1, len(a)):\r\n m = ord(a[f - 1]) - ord(a[f])\r\n m1 = ord(a[f]) - ord(a[f - 1])\r\n if abs(ord(a[f - 1]) - ord(a[f])) > 13:\r\n s = s + (26 - abs(m))\r\n else:\r\n s = s + abs(m)\r\nprint(s)\n# Tue Jul 04 2023 09:13:52 GMT+0300 (Moscow Standard Time)\n", "def process_inputs():\r\n name = input()\r\n return name\r\n\r\n\r\ndef distance_between_characters(ch1, ch2):\r\n distance_clockwise = abs(ord(ch1) - ord(ch2))\r\n distance_counterclockwise = 26 - distance_clockwise\r\n return min(distance_counterclockwise, distance_clockwise)\r\n\r\n\r\ndef solve():\r\n name = process_inputs()\r\n current_pointer = 'a'\r\n minimum_rotations = 0\r\n\r\n for ch in name:\r\n minimum_rotations += distance_between_characters(ch, current_pointer)\r\n current_pointer = ch\r\n\r\n return minimum_rotations\r\n\r\n\r\ndef result():\r\n print(solve())\r\n\r\n\r\nresult()\r\n", "s = input()\r\na = 'abcdefghijklmnopqrstuvwxyz'\r\nans = 0\r\nprev = 'a'\r\nfor i in s:\r\n t = abs(a.index(prev) - a.index(i))\r\n ans += min(t, 26 - t)\r\n prev = i\r\nprint(ans)", "def calculate_rotations(s):\r\n rotations = 0\r\n currentChar = 'a'\r\n\r\n for c in s:\r\n clockwise = (ord(c) - ord(currentChar) + 26) % 26\r\n counterclockwise = (ord(currentChar) - ord(c) + 26) % 26\r\n rotations += min(clockwise, counterclockwise)\r\n currentChar = c\r\n\r\n return rotations\r\n\r\n\r\nexhibit_name = input().strip()\r\n\r\nprint(calculate_rotations(exhibit_name))\r\n\r\n \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\nans=0\r\nflag='a'\r\nfor i in s:\r\n ans+=min(abs(ord(flag)-ord(i)),26-abs(ord(flag)-ord(i)))\r\n flag=i\r\nprint(ans)", "import math\r\nname = 'a' + input()\r\nlis = ['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\ncount = 0\r\n\r\nfor i in range(len(name)-1):\r\n be = lis.index(name[i])\r\n af = lis.index(name[i+1])\r\n if abs(be-af)<= 13:\r\n count += abs(be-af)\r\n else:\r\n count += 26-abs(af-be)\r\n \r\n \r\nprint(count)\r\n\r\n", "\r\nword = input()\r\nsteps = 0\r\nchrs = ['n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y',\r\n 'z', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm']\r\n\r\n\r\nfor i in range(len(word)):\r\n\r\n if word[i] in chrs[:14]:\r\n steps += chrs.index(chrs[13]) - chrs.index(word[i])\r\n a = chrs.index(chrs[13]) - chrs.index(word[i])\r\n for i in range(a):\r\n l = chrs[25]\r\n chrs = chrs[:25]\r\n chrs.insert(0, l)\r\n\r\n else:\r\n steps += chrs.index(word[i]) - chrs.index(chrs[13])\r\n a = chrs.index(word[i]) - chrs.index(chrs[13])\r\n for i in range(a):\r\n l = chrs[0]\r\n chrs = chrs[1:]\r\n chrs.insert(25, l)\r\n\r\n\r\nprint(steps)\r\n", "s = input()\r\narr = ['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\na = 0\r\nb = 0\r\nfor i in s:\r\n b = arr.index(i)\r\n n = abs(a-b)\r\n m = 26-max(a,b)+min(a,b)\r\n c += min(n,m)\r\n a = b\r\n\r\nprint(c)", "from string import ascii_lowercase\r\nalfabeto = list(ascii_lowercase)\r\nalfabeto_index = {c: i for i, c in enumerate(ascii_lowercase)}\r\n\r\ndef generar_x(c, i) -> dict:\r\n x = 0\r\n res = {}\r\n \r\n while alfabeto[i] != c or x == 0:\r\n res[alfabeto[i]] = x\r\n x += 1\r\n i += 1\r\n if i > 25:\r\n i = 0\r\n\r\n return res \r\n\r\ndef generar_y(c, i) -> dict:\r\n x = 0\r\n res = {}\r\n\r\n while alfabeto[i] != c or x == 0:\r\n res[alfabeto[i]] = x\r\n x += 1\r\n i -= 1\r\n if i < 0:\r\n i = 25\r\n\r\n return res\r\n\r\nif __name__ == '__main__':\r\n s = input()\r\n r = 0\r\n x = generar_x('a', 0)\r\n y = generar_y('a', 0)\r\n\r\n for c in s:\r\n i = alfabeto_index[c]\r\n r += min(x[c], y[c])\r\n x = generar_x(c, i)\r\n y = generar_y(c, i)\r\n\r\n print(r)\r\n", "a=\"a\"\r\ns=input()\r\ns1=\"abcdefghijklmnopqrstuvwxyz\"\r\nc=0\r\nfor i in s:\r\n d=s1.index(a)-s1.index(i)\r\n d=abs(d)\r\n b=min(d,26-d)\r\n c+=b\r\n a=i\r\nprint(c)", "def main():\r\n s = input()\r\n start = 'a'\r\n count = 0\r\n for ch in s:\r\n d1 = abs(ord(ch)-ord(start))\r\n d2 = 26 - d1\r\n count += min(d1, d2)\r\n start = ch\r\n print(count)\r\n\r\n\r\nmain()", "n = input()\r\nab = 'abcdefghijklmnopqrstuvwxyz'\r\nres = 0\r\ncurrent = 'a'\r\nfor i in n:\r\n x = abs(ab.index(current) - ab.index(i))\r\n y = 26 - x\r\n res += min(x, y)\r\n current = i\r\nprint(res)\r\n\r\n", "al = \"abcdefghijklmnopqrstuvwxyz\"\r\nname=input()\r\nro=0\r\nfor i in range(0,len(name)):\r\n ind=al.index(name[i])\r\n al = al[ind:] + al[:ind]\r\n if ind > len(al)-ind-1:\r\n ind=len(al)-ind\r\n ro = ind + ro\r\n\r\n\r\nprint(ro)", "n = list(input())\r\nx = 0\r\nhuruf = 'a'\r\n\r\nfor i in range(len(n)):\r\n a = abs(ord(n[i]) - ord(huruf))\r\n b = 26 - abs(a)\r\n x += min(a, b)\r\n huruf = n[i]\r\n\r\nprint(x)\r\n", "def min_rotations_to_print(name):\r\n total_rotations = 0\r\n current_letter = 'a'\r\n\r\n for letter in name:\r\n clockwise_rotations = (ord(letter) - ord(current_letter)) % 26\r\n counterclockwise_rotations = (ord(current_letter) - ord(letter)) % 26\r\n\r\n total_rotations += min(clockwise_rotations, counterclockwise_rotations)\r\n current_letter = letter\r\n\r\n return total_rotations\r\n\r\n# Read input\r\nexhibit_name = input().strip()\r\n\r\n# Calculate and print the minimum number of rotations\r\nresult = min_rotations_to_print(exhibit_name)\r\nprint(result)\r\n", "x=0\r\nv=97\r\nb=0\r\nfor i in input():\r\n x=abs(ord(i)-v)\r\n v=ord(i)\r\n b+=min(x,26-x)\r\nprint(b)", "lst = []\r\nalpha = 'a'\r\nfor i in range(0, 26):\r\n lst.append(alpha)\r\n alpha = chr(ord(alpha) + 1)\r\n\r\ns = input()\r\n\r\nans = 0\r\nans = min(lst.index(s[0]),26-lst.index(s[0]))\r\n\r\nfor i in range(1,len(s)):\r\n\tif(lst.index(s[i]) >= lst.index(s[i-1])):\r\n\t\tdiff = lst.index(s[i])-lst.index(s[i-1])\r\n\t\tans += min(diff, 26-diff)\r\n\r\n\telse:\r\n\t\tdiff = lst.index(s[i-1])-lst.index(s[i])\r\n\t\tans += min(diff, 26-diff)\r\n\r\nprint(ans)", "n=input()\ncnt=0\na=97\nfor i in n:\n b=abs(ord(i)-a)\n cnt+=min(b,26-b)\n a=ord(i)\nprint(cnt) \n \n", "def min_rotations(exhibit_name):\r\n current_position = ord('a')\r\n rotations = 0\r\n\r\n for letter in exhibit_name:\r\n target_position = ord(letter)\r\n clockwise_distance = (target_position - current_position) % 26\r\n counterclockwise_distance = (current_position - target_position) % 26\r\n\r\n rotations += min(clockwise_distance, counterclockwise_distance)\r\n current_position = target_position\r\n\r\n return rotations\r\n\r\n# Read input\r\nexhibit_name = input()\r\n\r\n# Calculate and print the minimum number of rotations\r\nprint(min_rotations(exhibit_name))\r\n", "s = input()\r\ncurrent = \"a\"\r\nsteps = 0\r\n \r\nfor c in s:\r\n ccw = 26-abs((ord(current)-ord(c)))\r\n cw = abs(ord(current)-ord(c))\r\n steps += cw if cw < ccw else ccw\r\n current =c\r\n\r\nprint(steps)", "a,t = 97,0\r\nfor i in map(ord,input()):\r\n x = abs(a-i)\r\n t+=min(x,26-x)\r\n a = i\r\nprint(t)", "a=input()\r\ns=0\r\nx='a'\r\nfor i in a:\r\n t=ord(i)-ord('a')\r\n c=ord(x)-ord('a')\r\n #print(i,t,c,abs(t-c),abs(26-abs(t-c)))\r\n s+= min(abs(t-c),abs(26-abs(t-c)))\r\n x=i\r\nprint(s)", "word = input()\r\nsteps = score = 0\r\nsp = \"a\"\r\nfor i in range (0, len(word)):\r\n if abs(ord(word[i]) - ord(sp)) <= 13 :\r\n steps = abs(ord(word[i]) - ord(sp))\r\n sp = word[i]\r\n elif abs(ord(word[i]) - ord(sp)) > 13 :\r\n steps = 26 - abs((ord(word[i]) - ord(sp)))\r\n sp = word[i]\r\n score += steps\r\nprint(score)", "dict_of_letters = {'a': 0, 'b': 1, 'c': 2, 'd': 3,\r\n 'e': 4, 'f': 5, 'g': 6, 'h': 7,\r\n 'i': 8, 'j': 9, 'k': 10, 'l': 11,\r\n 'm': 12, 'n': 13, 'o': 14, 'p': 15,\r\n 'q': 16, 'r': 17, 's': 18, 't': 19,\r\n 'u': 20, 'v': 21, 'w': 22, 'x': 23,\r\n 'y': 24, 'z': 25}\r\n\r\nword = input()\r\nnumber_of_steps = min(abs(dict_of_letters[word[0]]-0),26-abs(dict_of_letters[word[0]]-0))\r\nposition =dict_of_letters[word[0]]\r\n\r\nfor i in range(1,len(word)):\r\n next_position = min(abs(dict_of_letters[word[i]]-position),26-abs(dict_of_letters[word[i]]-position))\r\n number_of_steps += next_position\r\n position = dict_of_letters[word[i]]\r\n\r\nprint(number_of_steps)\r\n", "s=input()\nans=0\nk=1\nfor i in s:\n res=ord(i)-96\n res1=26-abs(res-k)\n ans+=min(abs(res-k),res1) \n k=res \nprint(ans)\n \t\t\t\t \t \t \t\t \t \t \t \t", "c='a'\r\nk=0\r\ns=input()\r\nfor i in s:\r\n\td=abs(ord(i)-ord(c))\r\n\tk+=min(d,26-d)\r\n\tc=i\r\nprint(k)\r\n", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x)+'\\n')\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10\r\n# from functools import cmp_to_key\r\n\r\ndef get(x):\r\n return ord(x)-ord('a')\r\n\r\ns=input()\r\ncnt=0\r\ni=0\r\nfor j in range(len(s)):\r\n x=get(s[j])\r\n y=abs(x-i)\r\n cnt+=min(y,26-y)\r\n i=x\r\nprint(cnt)\r\n", "initial = 'a'\r\nsum=0\r\nstr=input()\r\nfor i in str:\r\n diff=abs(ord(i)-ord(initial))\r\n if diff>=14:\r\n sum=sum+(26-diff)\r\n else:\r\n sum=sum+diff\r\n initial=i\r\nprint(sum)", "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 = input()\r\n li = []\r\n for i in range(26):\r\n li.append(i)\r\n\r\n ans, curr = 0, 'a'\r\n for c in s:\r\n prev = ord(curr) - ord('a')\r\n pre = ord(c) - ord('a')\r\n dist = abs(li[prev] - li[pre])\r\n\r\n dist = min(dist, abs(26-li[pre] + li[prev]))\r\n dist = min(dist, abs(li[pre] + 26 - li[prev]))\r\n ans += dist\r\n curr = c\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1\r\n #t = int(input())\r\n for _ in range(t):\r\n solve()\r\n", "str = list(input())\r\n\r\ninitial_position = 'a'\r\nrotations = 0\r\n\r\nfor i in range(len(str)):\r\n clck = abs(ord(str[i]) - ord(initial_position))\r\n counter_clck = 26 - clck\r\n if clck < counter_clck:\r\n rotations += clck\r\n else:\r\n rotations += counter_clck\r\n initial_position = str[i]\r\n\r\nprint(rotations)", "x= 'a' + input()\r\nalpha =[chr(i)for i in range(97,123)]\r\nvalue = 0\r\nfor i in range(len(x)-1):\r\n y = abs(alpha.index(x[i])-alpha.index(x[i+1]))\r\n m = abs(abs(alpha.index(x[i])-alpha.index('a'))+abs(alpha.index(x[i+1])-alpha.index('z')))+1\r\n z = abs(abs(alpha.index(x[i])-alpha.index('a'))-abs(alpha.index(x[i+1])+alpha.index('z')))+1\r\n value += min(y,m,z)\r\nprint(value)", "sumof=0\r\nk=97\r\nword=input()\r\nfor i in word:\r\n if(ord(i)==k):\r\n continue\r\n elif(ord(i)<k):\r\n sumof+=min(k-ord(i),(ord(i)-97)+(123-k))\r\n k=ord(i)\r\n continue\r\n else:\r\n sumof+=min(ord(i)-k,(k-97)+(123-ord(i)))\r\n k=ord(i)\r\n continue\r\nprint(sumof)", "n=input()\r\ni=\"a\"\r\nans=0\r\nfor ii in n:\r\n ans+=min(abs(ord(i)-ord(ii)),26-abs(ord(i)-ord(ii)))\r\n i=ii\r\nprint(ans)", "word=str(input())\r\np=ord('a')\r\nsum=0\r\nfor i in word:\r\n if ord(i)-p>=13 and ord(i)>p:\r\n p+=26\r\n sum+=(p-ord(i))\r\n p=ord(i)\r\n elif ord(i)-p<13 and ord(i)>p:\r\n sum+=ord(i)-p\r\n p=ord(i)\r\n elif p-ord(i)>=13 and ord(i)<p:\r\n p-=26\r\n sum+=(ord(i)-p)\r\n p=ord(i)\r\n elif p-ord(i)<13 and ord(i)<p:\r\n sum+=p-ord(i)\r\n p=ord(i)\r\nprint(sum)", "s = input()\np = 'a'\ncounter = 0\nfor i in range(len(s)):\n r = abs(ord(s[i]) - ord(p))\n p = s[i]\n if r < (26 - r):\n counter += r\n else:\n counter += 26 - r\nprint(counter)", "s = input()\r\ncurrent = 'a'\r\ncounter = 0 \r\nfor i in range(len(s)):\r\n # print(i)\r\n ans = abs(ord(s[i]) - ord(current))\r\n counter += min(ans,26 - ans)\r\n \r\n current = s[i]\r\nprint(counter)\r\n \r\n", "s = input()\r\nres = 0\r\ncur = 'a'\r\n\r\nfor c in s:\r\n sub = abs(ord(cur) - ord(c))\r\n res += sub if sub < abs(sub - 26) else abs(sub - 26)\r\n cur = c\r\n\r\nprint(res)\r\n", "def min_rotations(s):\r\n current_char = 'a' \r\n rotations = 0\r\n \r\n for target_char in s:\r\n clockwise_rotations = (ord(target_char) - ord(current_char) + 26) % 26\r\n counterclockwise_rotations = (ord(current_char) - ord(target_char) + 26) % 26\r\n \r\n min_rotation = min(clockwise_rotations, counterclockwise_rotations)\r\n \r\n current_char = target_char\r\n rotations += min_rotation\r\n \r\n return rotations\r\n\r\n# Example usage:\r\ns = input()\r\nresult = min_rotations(s)\r\nprint(result)\r\n", "s = input()\r\nsm = 0\r\nbase = ord(\"a\")\r\nfor i in s:\r\n first_way = abs(ord(i) - base)\r\n second_way = 26 - abs(ord(i) - base)\r\n sm += min(first_way, second_way)\r\n base = ord(i)\r\nprint(sm)\r\n", "nameOfSomeExhibit = input()\r\nnumOfRotations=0\r\nnameOfSomeExhibit = list(nameOfSomeExhibit)\r\nprvChar = 'a'\r\nfor x in nameOfSomeExhibit:\r\n check = abs(ord(prvChar) - ord(x))\r\n if check >= 13: \r\n numOfRotations+= 26 - check \r\n else:\r\n numOfRotations+= check\r\n prvChar = x\r\n\r\nprint(numOfRotations)\r\n", "\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\n\r\ns = input()\r\nmoves = 0\r\ns = list(s)\r\ns.insert(0, 'a')\r\nfor j in range(0, len(s)-1):\r\n d1 = abs((a.index(s[j])+1)-(a.index(s[j+1])+1))\r\n d2 = 26-d1\r\n moves += (min(d1,d2))\r\nprint(moves)\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n TOTAL_CHAR_LENGTH:int = 26\r\n\r\n\r\n NAME:str = input().rstrip()\r\n\r\n totalMinRotationCount:int = 0\r\n currentChar:str = \"a\"\r\n for targetChar in NAME :\r\n minRotationCount:int = 0\r\n\r\n CURRENT_CHAR_INDEX:int = ord(currentChar)-97\r\n TARGET_CHAR_INDEX:int = ord(targetChar)-97\r\n\r\n minRotationCount = min(\r\n abs(CURRENT_CHAR_INDEX-TARGET_CHAR_INDEX),\r\n (TOTAL_CHAR_LENGTH-CURRENT_CHAR_INDEX) + TARGET_CHAR_INDEX,\r\n (TOTAL_CHAR_LENGTH-TARGET_CHAR_INDEX) + CURRENT_CHAR_INDEX\r\n )\r\n currentChar = targetChar\r\n totalMinRotationCount += minRotationCount\r\n\r\n print(totalMinRotationCount)\r\n\r\nmain()", "def main():\r\n string = input()\r\n current_char = \"a\"\r\n\r\n counter = 0\r\n for character in string:\r\n cost = abs(ord(character) - ord(current_char))\r\n counter += min(cost, 26 - cost)\r\n current_char = character\r\n print(counter)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "str1=input()\r\nstr='a'+str1\r\nans=0\r\nfor i in range (len(str)-1):\r\n n=abs(ord(str[i])-ord(str[i+1]))\r\n if n<13:\r\n ans+=n\r\n else:\r\n ans+=26-n\r\nprint(ans)", "r=0\r\nm=97\r\nfor i in input():\r\n k=abs(m-ord(i))\r\n r+=min(abs(k-26),k)\r\n m=ord(i)\r\nprint(r)", "ar = list(map(chr, range(97, 123)))\r\nstr = input()\r\nls = 'a'\r\nc = 0\r\nfor s in str:\r\n c += min(abs(ar.index(s)-ar.index(ls)), 26 - abs(ar.index(s)-ar.index(ls)))\r\n ls = s\r\n\r\nprint(c)", "total = 0\nprev = \"a\"\nfor x in input():\n d = (ord(x) - ord(prev)) % 26\n total += min(d, 26 - d)\n prev = x\nprint(total)\n", "s = input()\r\ncurr = 'a'\r\nsum = 0\r\nfor i in s:\r\n k = abs(ord(i)-ord(curr))\r\n sum+=min(k,26-k)\r\n #print(sum)\r\n curr = i\r\n #print(curr)\r\nprint(sum)", "def min_rotations(char1, char2):\r\n return min((ord(char1) - ord(char2)) % 26, (ord(char2) - ord(char1)) % 26)\r\n\r\ndef calculate_rotations(exhibit_name):\r\n total_rotations = 0\r\n current_letter = 'a'\r\n\r\n for char in exhibit_name:\r\n total_rotations += min_rotations(current_letter, char)\r\n current_letter = char\r\n\r\n return total_rotations\r\n\r\n# Read the input exhibit name\r\nexhibit_name = input()\r\n\r\n# Calculate and print the minimum number of rotations\r\nrotations = calculate_rotations(exhibit_name)\r\nprint(rotations)\r\n", "import sys\r\nimport string\r\n\r\ninput = sys.stdin.readline\r\nlower_case = string.ascii_lowercase\r\n\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\n\r\ndef solve(a: list, base: int) -> str:\r\n c = 0\r\n for i in a:\r\n c += min(abs(base - i), abs(base - (i - 26) if base < i else base - (i + 26)))\r\n base = i\r\n\r\n print(c)\r\n\r\n\r\ndef main() -> None:\r\n *a, = map(ord, input().strip())\r\n base = 97\r\n solve(a, base)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "def ClockWise(start, end, alphabet):\r\n total = 0\r\n position = alphabet.index(start)\r\n while end != alphabet[position]:\r\n if position == len(alphabet) - 1:\r\n position = -1\r\n total += 1\r\n position += 1\r\n return total\r\n\r\ndef CounterClockWise(start, end, alphabet):\r\n position = alphabet.index(start)\r\n total = 0\r\n while end != alphabet[position]:\r\n if position == -len(alphabet):\r\n position = 0\r\n total += 1\r\n position -= 1\r\n return total\r\n\r\ndef main():\r\n from sys import stdin\r\n total = 0\r\n alphabet = 'abcdefghijklmnopqrstuvwxyz'\r\n word = stdin.readline().strip()\r\n start = 'a'\r\n for i in word:\r\n clockw = ClockWise(start, i, alphabet)\r\n counter = CounterClockWise(start, i, alphabet)\r\n if clockw < counter:\r\n total += clockw\r\n else:\r\n total += counter\r\n start = i\r\n print(total)\r\n\r\nmain()", "n = input()\r\ncnt = 0\r\nm = 1\r\nfor i in range(len(n)):\r\n b = ord(n[i]) - 96\r\n c = abs(m-b)\r\n d = abs(26-c)\r\n cnt += min(c,d)\r\n m = b\r\nprint(cnt)\r\n", "inp = list(input())\r\n\r\nalph = \"abcdefghijklmnopqrstuvwxyz\"\r\ni = {a:i for i, a in enumerate(list(alph))}\r\n\r\na = \"a\"\r\ns = 0\r\n\r\nfor b in inp:\r\n j = abs(i[a] - i[b])\r\n if j > 13:\r\n j = 26 - j\r\n \r\n s += j\r\n a = b\r\n\r\nprint(s)", "#!/bin/env python3\n\ns = input()\ns = \"a\" + s\n\nslen = len(s);\nnrotations = 0\n\nfor i in range(1,slen):\n #print(s[i-1], \"--\", s[i])\n a = ord(s[i-1]) - ord('a')\n b = ord(s[i]) - ord('a')\n if (b > a):\n a, b = b, a\n nrotations += min(a-b, 26-(a-b))\n\nprint(nrotations)\n", "import string\nascii = string.ascii_lowercase\npointer = 0\ntotal = 0\ninput_str = input() \nfor char in input_str:\n\tposition = ascii.index(char)\n\tdistance = abs(position - pointer)\n\tif distance > 13:\n\t\tdistance = 26 - distance \n\ttotal += distance\n\tpointer = position\nprint(total)\n\n\n\n\n\n\n", "s = input()\r\na = \"abcdefghijklmnopqrstuvwxyz\"\r\nc = 0\r\nx = 1\r\nfor i in range(len(s)): \r\n y = a.index(s[i])+1\r\n c += min(abs(x-y),26-abs(x-y))\r\n x = y\r\nprint(c)", "a='abcdefghijklmnopqrstuvwxyz'\r\nb=input()\r\ncount=0\r\nindex=0\r\nfor i in b:\r\n if i!=a[index]:\r\n x=abs(a.index(i)-index)\r\n y=26+index-a.index(i)\r\n z=26-index+a.index(i)\r\n count+=min(x,y,z)\r\n index=a.index(i)\r\nprint(count)", "# Link: https://codeforces.com/contest/731/problem/A\n\nimport string\n\ndef calc_right_path_distance(alphabet, initial_letter, target_letter):\n initial_letter_index = alphabet.index(initial_letter)\n target_letter_index = alphabet.index(target_letter)\n \n if target_letter_index < initial_letter_index:\n distance_right_path = (len(alphabet) - initial_letter_index) + target_letter_index\n else:\n distance_right_path = target_letter_index - initial_letter_index\n \n return distance_right_path\n\ndef calc_left_path_distance(alphabet, initial_letter, target_letter):\n initial_letter_index = alphabet.index(initial_letter)\n target_letter_index = alphabet.index(target_letter)\n\n if target_letter_index > initial_letter_index:\n distance_left_path = initial_letter_index + (len(alphabet) - target_letter_index)\n else:\n distance_left_path = initial_letter_index - target_letter_index\n \n return distance_left_path\n\ninitial_letter = 'a'\nalphabet = list(string.ascii_lowercase)\n\nexhibit = input()\nmoves = 0\n\nfor target_letter in exhibit:\n right_path_distance = calc_right_path_distance(alphabet, initial_letter, target_letter)\n left_path_distance = calc_left_path_distance(alphabet, initial_letter, target_letter)\n \n if (right_path_distance <= left_path_distance):\n moves += right_path_distance\n else:\n moves += left_path_distance\n \n initial_letter = target_letter\n\nprint(moves)", "alphabet = {\r\n \"a\": 1, \"b\": 2, \"c\": 3, \"d\": 4, \"e\": 5, \"f\": 6, \"g\": 7, \"h\": 8, \"i\": 9, \"j\": 10,\r\n 'k': 11, \"l\": 12, \"m\": 13, \"n\": 14, \"o\": 15, \"p\": 16, \"q\": 17, \"r\": 18, \"s\": 19,\r\n \"t\": 20, \"u\": 21, \"v\": 22, \"w\": 23, \"x\": 24, \"y\": 25, \"z\": 26}\r\n\r\ndef get_turns(current_letter, next_letter):\r\n if abs(alphabet[current_letter] - alphabet[next_letter]) > (26 - abs(alphabet[next_letter] - alphabet[current_letter])):\r\n return 26 - abs(alphabet[next_letter] - alphabet[current_letter])\r\n else:\r\n return abs(alphabet[current_letter] - alphabet[next_letter])\r\n\r\nname = input()\r\ncurrent_letter = name[0]\r\nrotations = 0\r\nrotations += get_turns(\"a\", name[0])\r\n\r\nfor i in range(len(name) - 1):\r\n rotations += get_turns(name[i], name[i + 1])\r\n\r\n\r\nprint(rotations)", "abc = [\"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 = list(map(str,input()))\r\ndis = 0\r\ntotal = 0\r\nfor x in l:\r\n pos = abc.index(x)\r\n forward = abs(dis-pos)\r\n backward = abs(len(abc)-forward)\r\n total += min(forward,backward)\r\n dis = pos\r\nprint(total)\r\n\r\n", "import string\r\ns=input()\r\nalphabet = list(string.ascii_lowercase)\r\na=0\r\nt=0\r\ni=1\r\nfor j in range(len(s)):\r\n a=(alphabet.index(s[j])+1)\r\n if a>=i:\r\n t+=min((a-i),(26-a)+i)\r\n else:\r\n t+=min((i-a),(26-i+a))\r\n i=a\r\nprint(t)", "def main():\r\n s=input()\r\n cnt=0\r\n a=ord(s[0])-ord('a')\r\n if a>13:\r\n cnt+=(26-a)\r\n else:\r\n cnt+=a\r\n for i in range(len(s)-1):\r\n \r\n if ord(s[i])>ord(s[i+1]):\r\n a=(ord(s[i])-ord(s[i+1]))\r\n else:\r\n a=ord(s[i+1])-ord(s[i])\r\n \r\n if a>13:\r\n cnt+=(26-a)\r\n else:\r\n cnt+=a\r\n \r\n print(cnt)\r\n\r\nif __name__==\"__main__\":\r\n main()", "exhibit_name = input().strip()\r\n\r\ntotal_rotations = 0\r\ncurrent_position = 0\r\n\r\nfor char in exhibit_name:\r\n target_position = ord(char) - ord('a')\r\n clockwise = (target_position - current_position + 26) % 26\r\n counterclockwise = (current_position - target_position + 26) % 26\r\n rotations_needed = min(clockwise, counterclockwise)\r\n total_rotations += rotations_needed\r\n current_position = target_position\r\n\r\nprint(total_rotations)\r\n", "'''\r\na = 0\r\nb = 1\r\n...\r\nz = 25\r\n k n (min(k, n)) \r\na->c = 0->2 = 2 или 24 (мин. 2)\r\na->z = 0->25 = 25 или 1 (мин. 1)\r\nc->b = 2->1 = 1 или 25 (мин. 1)\r\n\r\na -> 97 -> 0\r\nb -> 98 -> 1\r\n'''\r\ndef rast(x, y):\r\n x = ord(x) - 97\r\n y = ord(y) - 97\r\n k = abs(x - y)\r\n n = 26 - k\r\n mn = min(k, n)\r\n return mn\r\n# rast('b', 'e') = 3\r\n\r\ns = input()\r\nr = 0\r\nst = 'a'\r\nfor i in range(len(s)):\r\n r += rast(st, s[i])\r\n st = s[i]\r\nprint(r)\r\n", "alphabet1= {'a':1, 'b':2, 'c':3, 'd':4, 'e':5, 'f':6, 'g':7, 'h':8, 'i':9, 'j':10, 'k':11, 'l':12, 'm':13,\r\n 'n':14, 'o':15, 'p':16, 'q':17, 'r':18, 's':19,\r\n 't':20, 'u':21, 'v':22, 'w':23, 'x':24, 'y':25, 'z':26}\r\ns = input()\r\nfrom_ = 'a'\r\nattemps = 0\r\nfor i in s:\r\n ft = abs(alphabet1[from_]-alphabet1[i])\r\n ft1 = abs(26-ft)\r\n from_=i\r\n attemps+=min(ft, ft1)\r\nprint(attemps)", "import string\r\nalphapet = list(string.ascii_lowercase)\r\nstr = str(input())\r\nrotations = 0\r\nprev = ord('a')\r\nfor i in str:\r\n diff = abs(ord(i)-prev)\r\n if diff < 13:\r\n rotations = diff + rotations\r\n else:\r\n rotations = 26 - diff + rotations\r\n prev = ord(i)\r\n\r\n\r\n\r\nprint(rotations)", "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\ndef minlength(list,n1,n2):\r\n l1 = abs(l.index(n1)-l.index(n2)) \r\n l2 = abs(26-l1)\r\n return min(l1,l2)\r\nn1 = \"a\"\r\ntotal = 0\r\nfor x in input():\r\n n2 = x\r\n length = minlength(l,n1,n2)\r\n total += length\r\n n1 = x\r\nprint(total)", "a=input()\nres=0\nx=1\nfor i in a:\n result=ord(i)-96\n result1=26-abs(result-x)\n res+=min(abs(result-x),result1) \n x=result \nprint(res)\n\t\t \t \t \t\t\t\t \t \t \t \t \t\t \t", "word = input()\r\ndic = {}\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nfor a in range(len(alpha)):\r\n dic[alpha[a]] = a + 1\r\nmin_dis = 0\r\nstart = \"a\"\r\nfor w in word:\r\n min_dis = min_dis + min(abs(dic[start] - dic[w]), abs(26 - dic[w] + dic[start]), abs(26 - dic[start] + dic[w]))\r\n start = w\r\nprint(min_dis)", "name = input()\r\nd = {}\r\nfor i in range(ord('a'), ord('z') + 1):\r\n d[chr(i)] = i - ord('a')\r\n\r\ncurr = 'a'\r\nans = 0\r\nfor ch in name:\r\n if d[ch] >= d[curr]:\r\n clk = d[ch] - d[curr]\r\n aclk = 26 - d[ch] + d[curr]\r\n else:\r\n # print(f'{curr} > {ch}')\r\n clk = 26 - d[curr] + d[ch]\r\n aclk = d[curr] - d[ch]\r\n # print(f'prev: {curr}, ch: {ch}, clk: {clk}, aclk: {aclk}')\r\n ans += clk if clk < aclk else aclk\r\n curr = ch\r\n \r\nprint(ans)", "s = input()\r\ncur = 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\nans = 0\r\nfor el in s:\r\n\tcur1, ind = min(cur, a.index(el)), max(cur, a.index(el))\r\n\tans += min(ind - cur1, cur1 + 26 - ind)\r\n\tcur = a.index(el)\r\nprint(ans)", "s=input()\r\nc=0\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\nstart=1\r\nfor i in range(0,len(s)):\r\n index=l.index(s[i])+1\r\n f=abs(start-index)\r\n ss=abs(26-f)\r\n start=l.index(s[i])+1\r\n c+=min(f,ss)\r\nprint(c)", "alph=\"abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz\"\r\nthe_list=list(map(str,input()))\r\nmoves=0\r\nfirst='a'\r\n\r\nfor secound in the_list:\r\n if first<=secound:\r\n f=first\r\n s=secound\r\n \r\n else :\r\n f=secound\r\n s=first\r\n \r\n moves+=min(len(alph[alph.index(f):alph.index(s)]) ,len(alph[alph.index(f,26):alph.index(s):-1]))\r\n first=secound\r\nprint(moves)", "b=input()\r\noo=\"a\"\r\nz=0\r\nfor j in b:\r\n z+=min(abs(ord(oo)-ord(j)),26-abs(ord(oo)-ord(j)))\r\n oo=j\r\nprint(z)", "word = input()\r\ncurrent = 'a'\r\ncycles = 0\r\nfor char in word:\r\n number = abs(ord(current)-ord(char))\r\n if number <13:\r\n cycles += number\r\n else:\r\n cycles += abs(number -26)\r\n current = char\r\nprint(cycles)", "word = input()\r\n \r\nN = len(word)\r\npointer = 'a'\r\nans = 0\r\n \r\nfor i in range(N):\r\n ch = word[i]\r\n rotate1 = ord(pointer) - ord(ch)\r\n if rotate1 > -1:\r\n rotate2 = abs(rotate1 - 26)\r\n else:\r\n rotate2 = abs(rotate1 + 26)\r\n \r\n ans = ans + min(abs(rotate1), abs(rotate2))\r\n pointer = ch\r\n \r\nprint(ans)", "s=input()\r\ns='a'+s\r\nout=0\r\nfor i in range(len(s)-1):\r\n if (abs(ord(s[i+1]) - ord(s[i]))) < (26-abs((ord(s[i+1])-ord(s[i])))):\r\n out=out+abs(ord(s[i+1]) - ord(s[i]))\r\n else:\r\n out=out+26-abs((ord(s[i+1])-ord(s[i])))\r\n\r\nprint(out)\r\n", "import string\r\nalph = list(string.ascii_lowercase)\r\n\r\na = list(\"a\" + input())\r\ncount = 0\r\nfor i in range(len(a) - 1):\r\n now = alph.index(a[i]) + 1\r\n goto = alph.index(a[i+1]) + 1\r\n dif = abs(goto - now)\r\n\r\n if dif <= 13:\r\n count += dif\r\n else:\r\n count += 26 - dif\r\n\r\nprint(count)", "k = 0\r\nx = ord('a')\r\nfor c in input():\r\n c = ord(c)\r\n v1 = c - x if c >= x else c + 26 - x\r\n v2 = x - c if x >= c else x + 26 - c\r\n k += min(v1, v2)\r\n x = c\r\nprint(k)\r\n", "string1=\"abcdefghijklmnopqrstuvwxyz\"\r\ntotal=0\r\nsummary=0\r\nprevious=0\r\ncurrent=0\r\ncount=0\r\ns=input()\r\nfor x in s:\r\n summary=0\r\n if count==0:\r\n current=string1.index(x)\r\n if current<=12:\r\n previous=current\r\n total+=(current)\r\n count+=1\r\n else:\r\n previous=current\r\n total=(abs(25-current))+1\r\n count+=1\r\n else:\r\n current=string1.index(x)\r\n summary=abs(current-previous)\r\n if summary<=12:\r\n total+=summary\r\n previous=current\r\n else:\r\n big=max(current,previous)\r\n small=min(current,previous)\r\n summary=abs(25-big)+abs(0-small)+1\r\n total+=summary\r\n previous=current\r\n\r\n\r\nprint(total)\r\n\r\n\r\n", "s = input().strip()\r\ncount = 0\r\nprev = 'a'\r\nfor i in s:\r\n diff = abs(ord(i) - ord(prev))\r\n count += min(diff, 26 - diff)\r\n prev = i\r\nprint(count)\r\n", "s = input()\np, c = 'a', 0\nfor i in range(len(s)):\n x = abs(ord(s[i]) - ord(p))\n c += min(x, 26 - x)\n p = s[i]\nprint(c)", "s=input()\r\na=[]\r\nfor i in range(len(s)):\r\n b=ord(s[i])-96\r\n a.append(b)\r\nc=a[0]-1\r\nif(c>13):\r\n c=26-c\r\ncount=c\r\nfor i in range(len(s)-1):\r\n if(abs(a[i]-a[i+1])>13):\r\n count+=26-abs(a[i]-a[i+1])\r\n else:\r\n count+=abs(a[i]-a[i+1])\r\nprint(count) ", "def min_rotations_to_print(name):\r\n rotations = 0\r\n current_letter = 'a'\r\n\r\n for letter in name:\r\n \r\n clockwise_distance = (ord(letter) - ord(current_letter) + 26) % 26\r\n counterclockwise_distance = (ord(current_letter) - ord(letter) + 26) % 26\r\n\r\n rotations += min(clockwise_distance, counterclockwise_distance)\r\n current_letter = letter\r\n\r\n return rotations\r\n\r\n# Read input\r\nexhibit_name = input().strip()\r\n\r\n# Calculate and print the minimum number of rotations\r\nrotations = min_rotations_to_print(exhibit_name)\r\nprint(rotations)\r\n", "s = input()\ntotal = 0\nanterior = 0\n\nfor letter in s:\n pasos = abs(ord(letter) - 97 - anterior)\n if pasos > 12:\n total += abs(pasos - 26)\n else:\n total += pasos\n anterior = ord(letter) - 97\nprint(total)\n", "total_number_of_rotations = 0\r\nword = input()\r\nlast_char = 'a'\r\nfor char in word:\r\n front = abs((ord(char) - 96) - (ord(last_char) - 96))\r\n last = 26 - abs((ord(last_char) - 96) - (ord(char) - 96))\r\n if front < last:\r\n total_number_of_rotations = total_number_of_rotations + front\r\n else:\r\n total_number_of_rotations = total_number_of_rotations + last\r\n last_char = char\r\nprint(total_number_of_rotations)", "s= input()\r\nres=0\r\nst='a'\r\nfor x in s : \r\n s=abs(ord(x)-ord(st))\r\n if s < 13: \r\n res+=s\r\n else : \r\n res+=26-s\r\n st=x\r\nprint(res)", "n=input()\r\ns=0\r\ninitial=ord(\"a\")\r\nfor i in n:\r\n first= abs(initial-ord(i))\r\n second= 26 - abs(initial-ord(i))\r\n s+=min(first,second)\r\n initial=ord(i)\r\nprint(s)\r\n", "N_LETTERS = 26\ns = input()\nd = abs(ord(s[0]) - ord('a'))\nrot = min(d, N_LETTERS - d)\nfor i in range(1, len(s)):\n\td = abs(ord(s[i]) - ord(s[i - 1]))\n\trot += min(d, N_LETTERS - d)\n\t# print(rot)\nprint(rot)\n\t\n", "s=input()\r\na=[chr(i) for i in range(97,97+26)]\r\nst='a'\r\nco=0\r\nfor i in s:\r\n c=abs(a.index(st)-a.index(i))\r\n co+=min(c,abs(26-c))\r\n st=i\r\nprint(co)", "from sys import stdin, stdout\r\ns = 'a' + stdin.readline().strip()\r\nstdout.write(str(sum(min(abs(ord(s[i]) - ord(s[i+1])), 26 - abs(ord(s[i]) - ord(s[i+1]))) for i in range(len(s)-1))))", "s=input();c=0\r\nc=min(abs((ord('a')+25)-ord(s[0]))+1,abs(ord(s[0])-ord('a')))\r\nfor i in range(len(s)-1):\r\n c=c+min(min(abs(ord(s[i+1])-(ord(s[i])+25))+1,abs(ord(s[i])-ord(s[i+1]))),min((abs(ord(s[i+1])+25)-(ord(s[i])))+1,abs(ord(s[i])-ord(s[i+1]))))\r\nprint(c)", "sb=97\r\nk=0\r\nfor i in input():\r\n if abs(ord(i)-sb)>13:\r\n k+=26-abs(ord(i)-sb)\r\n sb=ord(i)\r\n else:\r\n k +=abs(ord(i) - sb)\r\n sb = ord(i)\r\nprint(k)", "a = input()\r\na = 'a' + a\r\nb = 0\r\nfor i in range(len(a)-1):\r\n af = abs(ord(a[i])-ord(a[i+1]))\r\n bf = 26 - af\r\n b += min(af, bf)\r\nprint(b)", "s=input()\r\nc=0\r\na=ord('a')-96\r\ni=0\r\nwhile i<len(s):\r\n a1=((ord(s[i])-96)-a)%26\r\n a2=(26-a1)%26\r\n c=c+min(a1,a2)\r\n a=ord(s[i])-96\r\n i=i+1\r\nprint(c)", "n = input()\r\ncount = 0\r\nstart = ord('a')\r\nfor i in range(0,len(n)):\r\n x = min(abs(start-ord(n[i])),26-abs(start-ord(n[i])))\r\n start = ord(n[i])\r\n count += x\r\nprint(count)", "def min_rotation(s):\r\n letters = 'abcdefghijklmnopqrstuvwxyz'\r\n current_letter = 'a'\r\n rotations = 0\r\n for c in s :\r\n distance=abs(letters.index(c)-letters.index(current_letter))\r\n rotations+=min(distance,26-distance)\r\n current_letter=c\r\n return rotations\r\ns=input().strip()\r\nprint(min_rotation(s))", "palavra = input(\"\")\r\nalfabeto = ['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\npassos = 0\r\nposicaoAtual = 0\r\nfor i in range(len(palavra)):\r\n letra=palavra[i]\r\n achou=0\r\n j=posicaoAtual\r\n passosHorario=0\r\n #sentido horario\r\n while achou==0:\r\n if letra == alfabeto[j]:\r\n posicaoAchouHorario=j\r\n achou=1\r\n break\r\n if j==len(alfabeto)-1:\r\n j=0\r\n else:\r\n j=j+1\r\n passosHorario=passosHorario+1\r\n #print('horario',letra,alfabeto[j],j,passosHorario)\r\n achou=0\r\n j=posicaoAtual\r\n passosAnti=0\r\n #sentido anti-horario\r\n while achou==0:\r\n if letra == alfabeto[j]:\r\n posicaoAchouAnti=j\r\n achou=1\r\n break\r\n if j==0:\r\n j=len(alfabeto)-1\r\n else:\r\n j=j-1\r\n passosAnti=passosAnti+1\r\n #print('anti-horario', letra, alfabeto[j], j, passosAnti)\r\n posicaoAtual=posicaoAchouHorario\r\n if passosAnti<passosHorario:\r\n passos=passos+passosAnti\r\n else:\r\n passos=passos+passosHorario\r\n #print(letra,posicaoAtual,passosAnti,passosHorario,passos)\r\nprint(passos)", "def distant(t,i):\r\n s = \"abcdefghijklmnopqrstuvwxyz\"\r\n r1 = abs(s.index(t) - s.index(i)) # если ближе вправо\r\n r2 = 26-r1 #если ближе вдругую сторону\r\n return min(r1, r2)\r\n\r\n\r\ns = input()\r\nk = 0\r\nt = \"a\"\r\nfor i in s:\r\n k += distant(t, i)\r\n t = i\r\nprint(k)", "s=input()\r\ncount=max(ord('a'),ord(s[0]))-min(ord('a'),ord(s[0]))\r\nif count>13:\r\n count=26-count\r\nfor i in range(0,len(s)-1):\r\n x=max(ord(s[i]),ord(s[i+1]))-min(ord(s[i]),ord(s[i+1]))\r\n if x>13:\r\n x=26-x\r\n count +=x\r\nprint(count) \r\n", "from dis import dis\r\n\r\n\r\ns = input()\r\ns = \"a\" + s\r\ntotal = 0\r\nfor i in range(len(s)-1):\r\n num1 = ord(s[i]) - ord(\"a\")\r\n num2 = ord(s[i+1]) - ord(\"a\")\r\n if num2 > num1:\r\n distance = num2 - num1\r\n else:\r\n distance = num1 - num2\r\n if distance < 13:\r\n total = total + distance\r\n else:\r\n total = total + (26 - distance)\r\nprint(total)", "def calculate_rotations(s):\n current_letter = 'a'\n total_rotations = 0\n\n for letter in s:\n clockwise_rotations = (ord(letter) - ord(current_letter)) % 26\n counterclockwise_rotations = (ord(current_letter) - ord(letter)) % 26\n\n total_rotations += min(clockwise_rotations, counterclockwise_rotations)\n current_letter = letter\n\n return total_rotations\n\n\ns = input()\nrotations = calculate_rotations(s)\nprint(rotations)\n\t \t \t\t \t \t\t \t \t\t \t\t\t\t", "def calculate_rotations(name):\r\n rotations = 0\r\n current_letter = 'a'\r\n\r\n for char in name:\r\n target_letter = char\r\n clockwise_rotations = (ord(target_letter) - ord(current_letter) + 26) % 26\r\n counterclockwise_rotations = (ord(current_letter) - ord(target_letter) + 26) % 26\r\n rotations += min(clockwise_rotations, counterclockwise_rotations)\r\n current_letter = target_letter\r\n\r\n return rotations\r\n\r\n# Read the input\r\nname = input().strip()\r\n\r\n# Calculate and print the minimum number of rotations\r\nmin_rotations = calculate_rotations(name)\r\nprint(min_rotations)\r\n", "arr=['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\np=input()\r\nposi,aux=0,0\r\nfor i in p:\r\n if arr.index(i) > posi:\r\n if ((26 - arr.index(i)) + posi) < (arr.index(i) - posi): aux += ((26 - arr.index(i)) + posi)\r\n else: aux += (arr.index(i) - posi)\r\n else:\r\n if ((26 - posi) + arr.index(i)) < (posi - arr.index(i)): aux += ((26 - posi) + arr.index(i))\r\n else: aux += (posi - arr.index(i))\r\n posi = arr.index(i)\r\nprint(aux)", "from sys import stdin, stdout\r\n\r\nref = \"0abcdefghijklmnopqrstuvwxyz\"\r\n\r\ns = stdin.readline().strip(); ans = 0\r\n\r\ndef clockwise(start, end):\r\n a = 0\r\n i = ref.index(start)\r\n while (ref[i] != end):\r\n a += 1\r\n i += 1\r\n if i > 26:\r\n i = 1\r\n \r\n return a\r\n\r\ndef counterclockwise(start, end):\r\n a = 0\r\n i = ref.index(start)\r\n while (ref[i] != end):\r\n a += 1\r\n i -= 1\r\n if i < 1:\r\n i = 26\r\n \r\n return a\r\n\r\nstart = \"a\"\r\n\r\nfor i in range(len(s)):\r\n ans += min(clockwise(start,s[i]), counterclockwise(start,s[i]))\r\n start = s[i]\r\n\r\nstdout.write(str(ans))", "a=0;a1=97\r\nfor i in input():\r\n x=abs(ord(i)-a1);a+=min(x,26-x);a1=ord(i)\r\nprint(a)", "abc = 'abcdefghijklmnopqrstuvwxyz'\r\ncurr = 0\r\ns = input()\r\nsu = 0\r\nfor x in s:\r\n i = abc.find(x)\r\n if i >= curr:\r\n su += min(i-curr, abc.find('z')-i+curr+1)\r\n else:\r\n su += min(curr-i, abc.find('z')-curr+i+1)\r\n curr = i\r\nprint(su)", "dict1 = {'a': '1', 'b': '2', 'c': '3', 'd': '4', 'e': '5', 'f': '6', 'g': '7', 'h': '8', 'i': '9', 'j': '10', 'k': '11', 'l': '12', 'm': '13',\r\n 'n': '14', 'o': '15', 'p': '16', 'q': '17', 'r': '18', 's': '19', 't': '20', 'u': '21', 'v': '22', 'w': '23', 'x': '24', 'y': '25', 'z': '26'}\r\n\r\n\r\nstr = input()\r\nrot_counter = 0\r\nz = dict1['a']\r\n# print(z)\r\nfor i in str:\r\n e = int(dict1[i])-int(z)\r\n if (e < 0):\r\n e *= -1\r\n d = 26-e\r\n g = min(e, d)\r\n rot_counter += g\r\n z = dict1[i]\r\nprint(rot_counter)\r\n", "import string\r\n\r\na = list(string.ascii_lowercase)\r\nx = input()\r\nindices=[]\r\n\r\nfor i in range(0,len(x)):\r\n for j in range(0,len(a)):\r\n if x[i] == a[j]:\r\n \r\n indices.append(j)\r\n break\r\n\r\nn=[]\r\nfor i in range(0,len(indices)):\r\n if i == 0:\r\n if indices[0] >= 13:\r\n n.append(26-indices[0])\r\n else:\r\n n.append(indices[0])\r\n elif i > 0:\r\n if abs(indices[i]-indices[i-1]) >= 13:\r\n n.append(26-(abs(indices[i]-indices[i-1])))\r\n else:\r\n n.append((abs(indices[i]-indices[i-1])))\r\n\r\nprint(sum(n))", "s=input()\r\nans=0\r\nprev=97\r\nfor i in range(len(s)):\r\n ans+=min(abs(ord(s[i])-prev),26-(abs(ord(s[i])-prev)))\r\n prev=ord(s[i])\r\nprint(ans)", "s=input()\r\nc=97\r\nx=0\r\nfor i in s:\r\n z=abs(c-ord(i))\r\n x+=min(z,26-z)\r\n c=ord(i)\r\nprint(x)", "x=input()\r\nx=\"a\"+x\r\nsum=0\r\nfor i in range(len(x)-1):\r\n a=abs(ord(x[i])-ord(x[i+1]))\r\n b=26-a\r\n sum=sum+min(a,b)\r\nprint(sum)", "import sys\r\n\r\ns = sys.stdin.readline().strip()\r\nlast = 'a'\r\nres = 0\r\n\r\nfor c in s:\r\n dis = abs(ord(last) - ord(c))\r\n res += min(dis, 26 - dis)\r\n last = c\r\n\r\nprint(res)\r\n", "s = input()\r\ns = 'a' + s\r\nn = len(s)\r\nans = 0\r\nfor i in range(n-1):\r\n asc1 = ord(s[i]) - ord('a')\r\n asc2 = ord(s[i+1])-ord('a')\r\n rot1 = abs(asc1-asc2)\r\n rot2 = 26 - rot1\r\n ans += min(rot1,rot2)\r\nprint(ans)", "\"\"\"\r\nGrigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosser and was to take stock of the whole exposition.\r\n\r\nEmbosser is a special devise that allows to \"print\" the text of a plastic tape. Text is printed sequentially, character by character. The device consists of a wheel with a lowercase English letters written in a circle, static pointer to the current letter and a button that print the chosen letter. At one move it's allowed to rotate the alphabetic wheel one step clockwise or counterclockwise. Initially, static pointer points to letter 'a'. Other letters are located as shown on the picture:\r\n\r\n\r\nAfter Grigoriy add new item to the base he has to print its name on the plastic tape and attach it to the corresponding exhibit. It's not required to return the wheel to its initial position with pointer on the letter 'a'.\r\n\r\nOur hero is afraid that some exhibits may become alive and start to attack him, so he wants to print the names as fast as possible. Help him, for the given string find the minimum number of rotations of the wheel required to print it.\r\n\r\nInput\r\nThe only line of input contains the name of some exhibit — the non-empty string consisting of no more than 100 characters. It's guaranteed that the string consists of only lowercase English letters.\r\n\r\nOutput\r\nPrint one integer — the minimum number of rotations of the wheel, required to print the name given in the input.\r\n\"\"\"\r\n\r\nword = input()\r\nprev = 'a'\r\nresult = 0\r\nfor c in word:\r\n result += min(abs(ord(c) - ord(prev)), 26 - abs(ord(c) - ord(prev)))\r\n prev = c\r\n\r\nprint(result)\r\n", "if __name__ == '__main__':\r\n alphabet = 'abcdefghijklmnopqrstuvwxyz'\r\n word = input()\r\n count = 0\r\n index=0\r\n for i in word:\r\n x=alphabet.rfind(i)\r\n if x > index:\r\n count +=min(abs(x-index),26-x+index)\r\n else:\r\n count +=min(26-index+x,abs(x-index))\r\n index=x\r\n print(count)\r\n", "s=input()\r\nc=0\r\nt='a'\r\nfor i in s:\r\n k=abs(ord(t)-ord(i))\r\n h=min(k,26-k)\r\n c=c+h\r\n t=i\r\nprint(c)", "s,c,t=input(),0,1\r\nfor i in range(len(s)):\r\n a=ord(s[i])-96\r\n if abs(a-t)<(26+min(t,a)-max(t,a)):\r\n c+=abs(a-t)\r\n else:\r\n c+=(26+min(t,a)-max(t,a))\r\n t=a\r\nprint(c)", "s = input()\r\nk = 0\r\nfor i in range (len(s)-1):\r\n if abs(ord(s[i])-ord(s[i+1])) >13:\r\n d = abs(26 - abs(ord(s[i])-ord(s[i+1])))\r\n else:\r\n d = abs(ord(s[i])-ord(s[i+1]))\r\n k+=d\r\nif abs(ord('a')-ord(s[0])) >13:\r\n print (k+abs(26 - abs(ord('a')-ord(s[0]))))\r\nelse:\r\n print (k+abs(ord('a')-ord(s[0])))", "word = input()\r\nalphabet = \"abcdefghijklmnopqrstuvwxyz\"\r\nfirst_char = 'a'\r\nans = 0\r\nfor i in word:\r\n idx1 = alphabet.index(first_char)\r\n idx2 = alphabet.index(i)\r\n #print(first_char, i, idx1, idx2)\r\n ans+= min(abs(idx1-idx2), 26 - abs(idx1-idx2))\r\n first_char = i\r\n\r\nprint(ans)\r\n", "word = str(input())\r\nstart = 0\r\ncount = 0\r\n\r\nfor x in word:\r\n index = ord(x) - 97\r\n walk = abs(start-index)\r\n if walk < 13:\r\n count += walk\r\n else:\r\n count += 26-walk\r\n start = index\r\n\r\nprint(count)", "name = input()\r\nwheel = \"abcdefghijklmnopqrstuvwxyz\"\r\ncounter = 0\r\npointer = 0\r\n\r\nfor i in range(len(name)):\r\n clockwise = abs(pointer - wheel.index(name[i]))\r\n counterclockwise = abs(26 - clockwise)\r\n counter += min(clockwise, counterclockwise)\r\n pointer = wheel.index(name[i])\r\n\r\nprint(counter)\r\n", "string = input()\r\nrotations = 0\r\npresent = 1\r\nfor i in string:\r\n\tmove = ord(i) - 96\r\n\tcount = abs(present - move)\r\n\tif count > 13 and present > move:\r\n\t\trotations += 26 - present + move\r\n\telif count > 13 and present < move:\r\n\t\trotations += 26 - move + present\r\n\telse:\r\n\t\trotations += count\r\n\tpresent = move\r\nprint(rotations)", "s = input()\r\na = \"abcdefghijklmnopqrstuvwxyz\"\r\np = 0\r\nm = a.index(s[0])\r\nfor i in range(len(s)-1):\r\n q = abs(a.index(s[i]) - a.index(s[i+1]))\r\n if q>12:\r\n p+=26-q\r\n else:\r\n p+=q\r\n\r\nif m>12:\r\n m = 26-m\r\n\r\nprint(p+m)", "s = 'a' + str(input())\r\nl = []\r\nfor i in s:\r\n\tl.append(ord(i))\r\nm = 0\r\nfor k in range(0,len(s)-1):\r\n\tb = l[k]-l[k+1]\r\n\tif 0<b<=13:\r\n\t\tb = b\r\n\telif -13<=b<=0:\r\n\t\tb = -b\r\n\telif 13<b:\r\n\t\tb = 26 - b\r\n\telse:\r\n\t\tb = 26 + b\r\n\tm +=b\r\nprint(m)\r\n\r\n\r\n\t", "\r\n#for _ in range(int(input())):\r\ns = (input())\r\nnn = abs(ord('a')-ord(s[0]))\r\nk = min(nn, 26-nn)\r\nfor i in range(0, len(s)-1):\r\n ss = abs(ord(s[i])-ord(s[i+1]))\r\n k += min(ss, 26-ss)\r\nprint(k)\r\n\r\n\r\n\r\n\r\n\r\n", "s, res = input(), 0\r\nif abs(ord('a') - ord(s[0])) > 13: res += 26 - abs(ord('a') - ord(s[0]))\r\nelse: res += abs(ord('a') - ord(s[0]))\r\nfor i in range(len(s) - 1):\r\n if abs(ord(s[i]) - ord(s[i+1])) > 13: res += 26 - abs(ord(s[i]) - ord(s[i+1]))\r\n else: res += abs(ord(s[i]) - ord(s[i+1]))\r\nprint(res)", "word = input()\r\npos_1 = 1\r\npos_2 = 0\r\nmoves = 0\r\nfor letter in word:\r\n pos_2 = ord(letter) - 96\r\n if pos_1 == pos_2:\r\n continue\r\n elif pos_2 > pos_1:\r\n moves1 = pos_2 - pos_1\r\n moves2 = pos_1 - pos_2 + 26\r\n if moves2 > moves1:\r\n moves = moves + moves1\r\n else:\r\n moves = moves + moves2\r\n pos_1 = pos_2\r\n elif pos_1 > pos_2:\r\n moves1 = pos_1 - pos_2\r\n moves2 = pos_2 - pos_1 + 26\r\n if moves2 > moves1:\r\n moves = moves + moves1\r\n else:\r\n moves = moves + moves2\r\n pos_1 = pos_2\r\n\r\nprint(moves)", "import string\r\n\r\nletterToNumber = dict(zip(list(string.ascii_lowercase), range(0, 26)))\r\ncurr = \"a\"\r\nrotations = 0\r\nfor i in input():\r\n dist = abs(letterToNumber[curr] - letterToNumber[i])\r\n rotations += min(dist, 26 - dist)\r\n curr = i\r\n\r\nprint(rotations)\r\n", "def main():\n s = input()\n l = len(s)\n counter = 0\n for i in range(l):\n if i == 0:\n x = ord(\"a\") - 98\n y = ord(s[i]) - 98\n a = abs(x-y)\n b = abs(26-a)\n counter += min(a,b)\n else:\n x = ord(s[i-1]) - 98\n y = ord(s[i]) - 98\n a = abs(x-y)\n b = abs(26-a)\n counter += min(a,b)\n print(counter)\nmain()\n \t\t \t \t \t \t \t \t\t\t \t \t\t\t\t", "x = input()\r\nd = {}\r\nfor i in range(97,123):\r\n d[chr(i)] = i-96\r\na = 0\r\nb = \"a\"\r\nfor i in x:\r\n p = abs(d[i]-d[b])\r\n a += min(p,26-p)\r\n b = i\r\nprint(a)", "# A night at museum\r\nimport string\r\n\r\n#Getting String From User\r\n#list of alphabets\r\nlowercase_alphabet = list(string.ascii_lowercase)\r\nInputString = input()\r\nInputString = 'a' + InputString\r\n\r\nsummation = 0\r\n\r\n\r\n\r\nfor i in range(1,len(InputString)):\r\n diff = abs(ord(InputString[i]) - ord(InputString[i-1]))\r\n summation += min(abs(diff) , 26-diff)\r\n\r\nprint(summation)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#yousef\r\na=\"a\"+input()\r\nm=0\r\nfor i in range(len(a)-1):\r\n c=abs(ord(a[i])-ord(a[i+1]))\r\n m+=min(c,26-c)\r\nprint(m)\r\n ", "class solution:\r\n def __init__(self,s):\r\n self.s = s\r\n self.alph = {'a':1,'b':2,'c':3,'d':4,'e':5,'f':6,'g':7,'h':8,'i':9,'j':10,'k':11,'l':12,'m':13,'n':14,'o':15,'p':16,'q':17,'r':18,'s':19,'t':20,'u':21,'v':22,'w':23,'x':24,'y':25,'z':26}\r\n self.answer = 0\r\n def caluclation(self):\r\n c = 'a'\r\n for i in s:\r\n d = abs(self.alph[c] - self.alph[i]) \r\n e = 26 - abs(self.alph[c] - self.alph[i])\r\n self.answer+=self.minnum(d,e)\r\n c=i\r\n def minnum(self,d,e):\r\n if d >= e:\r\n return e\r\n else:\r\n return d\r\ns=input()\r\nroot = solution(s)\r\nroot.caluclation()\r\nprint(root.answer)", "import math\r\n\r\n\r\ns=input()\r\ncount=0\r\nl1=[]\r\nfor x in range(len(s)):\r\n if x==0:\r\n k=ord(s[x])\r\n l1.append(k)\r\n if k-97<=13:\r\n m=k-97\r\n else :\r\n m=123-k\r\n count=count+m\r\n else :\r\n l=l1[x-1]\r\n k=ord(s[x])\r\n l1.append(k)\r\n if k-l>0:\r\n m=k-l\r\n else :\r\n m=l-k\r\n if m<=13:\r\n count=count+m\r\n else :\r\n n=26-m\r\n count=count+n\r\nprint(count)", "pointer,maxi = 97,0\r\nfor c in list(input()):\r\n maxi +=min(abs(pointer-ord(c)),26-(abs(pointer-ord(c))))\r\n pointer = ord(c)\r\nprint(maxi)", "s=input()\r\nalp=\"abcdefghijklmnopqrstuvwxyz\"\r\nans=0\r\nstart='a'\r\nfor i in s:\r\n xx=int(str(ord(start)-ord(i)))\r\n yy=int(str(ord(i)-ord(start)))\r\n if xx<0: xx+=26\r\n if yy<0: yy+=26 \r\n ans+=min(xx,yy)\r\n start=i\r\nprint(ans) ", "stringo = input()\nindex = ord('a')%97\n\n# z = 25 = index, -> e, \n# alphabet.index('e') = 4,\n# something => abs(index - alphabet.index('e')),\n# something else => len(alphabet) - abs(index - alphabet.index('e')),\n\nn = 0\n\nfor letter in stringo:\n a = abs(index - ord(letter)%97)\n b = 26 - abs(index - ord(letter)%97)\n n += min(a, b)\n index = ord(letter)%97\n\nprint(n)\n", "s = input()\r\nall = \"abcdefghijklmnopqrstuvwxyz\"\r\npointer = 0\r\nsteps = 0\r\nfor i in s:\r\n index = all.index(i)\r\n steps += min(abs(index-pointer), 26 - index + pointer, 26 + index - pointer)\r\n pointer = index\r\nprint(steps)\r\n", "while True:\n ch=input()\n if ch.islower()==True and len(ch)!=0:\n break\n\ns=0\np=0\nfor i in range(len(ch)):\n index=ord(ch[i])-97\n route=abs(p-index)\n if route<13:\n s+=route\n else:\n s+=(26-route)\n p=index\nprint(s)\n\n\n", "s = str(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\nnew_s = 'a' + s\r\nx = 26\r\ncount = 0\r\nfor i in range(len(new_s)-1):\r\n res = abs(l.index(new_s[i]) - l.index(new_s[i+1]))\r\n count += min(res,x-res)\r\nprint(count)", "a=97\r\ncnt=0\r\ns=input()\r\nfor x in s:\r\n i=abs(a-ord(x))\r\n cnt+=min(i,26-i)\r\n a=ord(x)\r\nprint(cnt)", "s=input()\r\nans=0\r\nv=abs(ord(s[0])-ord('a'))\r\nv=min(v,26-v)\r\nans+=v\r\nfor i in range(1,len(s)):\r\n v=abs(ord(s[i])-ord(s[i-1]))\r\n v=min(v,26-v)\r\n ans+=v\r\nprint(ans)\r\n\r\n\r\n\r\n", "leters = \"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\ndig = 0\r\ncount = 0\r\ns = input()\r\nj = 0\r\nfor i in range(len(s)):\r\n c = 0\r\n while s[i] != leters[j]:\r\n j += 1\r\n c += 1\r\n j = j % 26\r\n if c > 13:\r\n c = 26 - c\r\n count += c\r\nprint(count)", "s=input()\r\nstart=0\r\nsumMove=0\r\nfor x in range(len(s)) :\r\n index=ord(s[x])-97\r\n walk=abs(start-index)\r\n if walk <13 :\r\n sumMove+=walk\r\n else:\r\n sumMove+=26-walk\r\n start=index\r\nprint(sumMove)\r\n", "alfa = {'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8, 'i': 9, 'j': 10, 'k': 11, 'l': 12, 'm': 13, 'n': 14, 'o': 15, 'p': 16, 'q': 17, 'r': 18, 's': 19, 't': 20, 'u': 21, 'v': 22, 'w': 23, 'x': 24, 'y': 25, 'z': 26}\r\n\r\nname = input()\r\nsum = 0\r\n\r\nif (alfa[name[0]] - 1 > 13):\r\n sum += 27 - alfa[name[0]]\r\nelse:\r\n sum += alfa[name[0]] - 1\r\n\r\nfor i in range(1, len(name)):\r\n dif = abs(alfa[name[i]] - alfa[name[i - 1]])\r\n if (dif > 13):\r\n sum += 26 - dif\r\n else:\r\n sum += dif\r\n\r\nprint(sum)", "st = input()\r\nst = 'a' + st\r\nres = 0\r\nfor i in range(1, len(st)):\r\n m = abs(ord(st[i]) - ord(st[i - 1]))\r\n bToZ = ord(st[i - 1]) - ord('a')\r\n ZToN = ord('z') - ord(st[i])\r\n res += min(m, ord(st[i - 1]) - ord('a') + ord('z') - ord(st[i]) + 1, ord('z') - ord(st[i - 1]) + ord(st[i]) - ord('a') + 1)\r\nprint(res)", "s = input()\r\ncurrent = 97\r\nsteps = 0\r\nfor c in s:\r\n asc = ord(c)\r\n diff = abs(current - asc)\r\n if diff <= 13:\r\n steps += diff\r\n else:\r\n steps += 26 - diff\r\n current = ord(c)\r\n\r\nprint(steps)", "x=input()\r\nc=min(abs(ord(x[0])-ord('a')),26-abs(ord(x[0])-ord('a')))\r\nfor i in range(1,len(x)):\r\n c+=min(abs(ord(x[i])-ord(x[i-1])),26-abs(ord(x[i])-ord(x[i-1])))\r\nprint(c)\r\n", "embossor = \"abcdefghijklmnopqrstuvwxyz\"\r\nletters = input()\r\n\r\npointer = 0\r\n\r\ntotal = 0\r\nfor letter in letters:\r\n pos = embossor.index(letter)\r\n diff = abs(pos - pointer)\r\n if diff > 13:\r\n steps = 26 - diff\r\n else:\r\n steps = diff\r\n total += steps\r\n pointer = pos\r\n\r\nprint(total)", "from string import ascii_lowercase as abc \r\n\r\nsstr = input()\r\ncur = 0\r\namount = 0\r\na = len(abc)\r\n\r\nfor s in sstr:\r\n gg = abc.index(s) \r\n amount += min(abs(gg - cur), abs(min(cur, a - cur) + min(a - gg, gg)))\r\n cur = gg\r\n \r\nprint(amount)\r\n", "import math\r\nn=input()\r\nt=0\r\ne=len(n)\r\np=ord('a')\r\nfor i in range(0,e):\r\n j=ord(n[i])\r\n l=min([abs(j-p),j+(122-p)-97+1,p-97+1+122-j])\r\n #print(l)\r\n t+=l\r\n p=j\r\nprint(t)\r\n\r\n\r\n\r\n\r\n", "pos = ord('a') - 96\r\nnewpos = 0\r\ncounter = 0\r\nword = list(map(str, input()))\r\n\r\nfor i in range(len(word)):\r\n newpos = ord(f'{word[i]}') - 96 # to the new letter\r\n\r\n clockwise = abs(pos - newpos)\r\n if pos > newpos:\r\n counterclockwise = abs((newpos) + (26 - pos))\r\n\r\n else:\r\n counterclockwise = abs((pos) + (26 - newpos))\r\n\r\n counter += clockwise if clockwise < counterclockwise else counterclockwise # the counter\r\n\r\n pos = newpos #new start\r\n\r\nprint(counter)\r\n", "lcChars = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nword, c, res = input(), \"a\", 0\r\nfor ch in word:\r\n dist = abs(lcChars.index(ch) - lcChars.index(c))\r\n res += min(dist, 26 - dist)\r\n c = ch\r\nprint(res)", "b = input(\"\")\r\nc = 0\r\ne = \"a\"\r\nfor i in range(0, len(b)):\r\n d = abs(ord(b[i]) - ord(e))\r\n if abs(26 - d) < d:\r\n c += 26 - d\r\n else:\r\n c += d\r\n e = b[i]\r\nprint(c)\r\n", "alph = 'abcdefghijklmnopqrstuvwxyz'\r\nword = input()\r\nnowind = 0\r\nfindind = 0\r\nres = 0\r\nfor i in range(len(word)):\r\n findind = alph.find(word[i])\r\n res += min(abs(findind-nowind), 26-abs(findind-nowind))\r\n nowind = findind\r\nprint(res)\r\n", "st = input().strip()\r\n \r\noutput = 0\r\n \r\nstart = ord('a')\r\n\r\nfor ch in st:\r\n output+= min( abs(ord(ch) - start) , 26 - abs(ord(ch) - start) )\r\n start = ord(ch)\r\n \r\nprint(output)", "n=input()\r\nl=len(n)\r\ntot=0\r\nfor i in range(0,len(n)):\r\n if n[0]!='a':\r\n if i==0 :\r\n c=ord(n[i])\r\n len1=c-97\r\n if len1<=14:\r\n tot+=len1\r\n else:\r\n tot+=(26-len1)\r\n elif i<l:\r\n c=ord(n[i])\r\n d=ord(n[i-1])\r\n len1=c-d\r\n if len1<0:\r\n len1=len1*-1\r\n if len1<14:\r\n tot+=len1\r\n else:\r\n tot+=(26-len1)\r\n else:\r\n if i<l-1:\r\n c=ord(n[i+1])\r\n d=ord(n[i])\r\n len1=c-d\r\n if len1<0:\r\n len1=len1*-1\r\n if len1<14:\r\n tot+=len1\r\n else:\r\n tot+=(26-len1)\r\nprint(tot) ", "def solve(s):\r\n\ts = 'a' + s\r\n\tcount = 0\r\n\tfor i in range(1,len(s)):\r\n\t\tpre = s[i-1]\r\n\t\tcur = s[i]\r\n\t\tforward = abs(ord(cur)-ord(pre))\r\n\t\tbackward = 26 - forward\r\n\t\tcount += min(forward,backward)\r\n\treturn count\r\ns = input()\r\nprint(solve(s))", "s=input()\r\np=abs(ord(s[0])-97)\r\nc=min(p,26-p)\r\nfor i in range(1,len(s)):\r\n h=abs(ord(s[i])-ord(s[i-1]))\r\n l=26-h\r\n if h<l:\r\n c+=h\r\n else:\r\n c+=l\r\nprint(c)", "def Museum(nameObj):\r\n pos = 'a'\r\n cost = 0\r\n for x in nameObj:\r\n case = abs(ord(x) - ord(pos))\r\n if case < 26 - case:\r\n cost += case\r\n else:\r\n cost += 26 - case\r\n pos = x\r\n return cost\r\n\r\n\r\nl = input()\r\nprint(Museum(l))", "s=input()\r\nt,c='a',0\r\nfor i in s:\r\n if abs(ord(i)-ord(t))>13:\r\n c+=26-abs(ord(i)-ord(t))\r\n else:\r\n c+=abs(ord(i)-ord(t))\r\n t=i\r\nprint(c)\r\n", "a={\"a\":1,\"b\":2,\"c\":3,\"d\":4,\"e\":5,\"f\":6,\"g\":7,\"h\":8,\"i\":9,\"j\":10,\"k\":11,\"l\":12,\"m\":13,\"n\":14,\"o\":15,\"p\":16,\"q\":17,\"r\":18,\"s\":19,\"t\":20,\"u\":21,\"v\":22,\"w\":23,\"x\":24,\"y\":25,\"z\":26}\r\ns=input()\r\nn=len(s)\r\nini=\"a\"\r\nmoves=0\r\nfor i in range(0,n):\r\n\tnow=s[i]\r\n\tval1=abs(a[now]-a[ini])\r\n\tval2=abs(26-abs(a[ini]-a[now]))\r\n\tini=now\r\n\tmoves+=(min(val2,val1))\r\nprint(moves)", "t=input()\r\ndi={}\r\na=1\r\nans=0\r\nfor i in range(97,123):\r\n di[chr(i)]=a\r\n a+=1\r\nx='a'\r\nfor i in range(0,len(t)):\r\n ans+=min(abs(di[x]-di[t[i]]),26-abs(di[x]-di[t[i]]))\r\n x=t[i]\r\n\r\nprint(ans)", "from builtins import range\r\nimport string\r\n\r\nif __name__ == '__main__':\r\n b = input()\r\n a = list(string.ascii_lowercase)\r\n sum = 0\r\n b = list(b)\r\n b.insert(0, 'a')\r\n\r\n\r\n for i in range(len(b) - 1):\r\n forward = a.index(b[i]) - a.index(b[i + 1]) # 20\r\n backward = a.index(b[i + 1]) - a.index(b[i]) # -20\r\n if abs(forward) > 13:\r\n temp = min(forward, backward)\r\n sum = sum + (temp % 13)\r\n else:\r\n sum = sum + max(forward,backward)\r\n\r\n print(sum)\r\n", "letters = ['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']\nentered = str(input())\ns = \"a\" + entered\ntotalDist = 0\nfor x in range(len(s)-1):\n dist = abs(ord(s[x]) - ord(s[x+1]))\n #print(\"from\", dist,\"to\")\n if(dist < 13):\n #On Correct Side Of Wheel\n totalDist += dist\n #print(\"On Correct Side!\")\n if(dist == 13): \n #Doesn't Matter\n totalDist += dist\n #print(\"In The Middle!\")\n if(dist > 13):\n #On Other Side Of Wheel\n dist *= -1\n dist += 26\n totalDist += dist\n #print(\"On Other Side!\")\n #print(dist)\nprint(totalDist)\n\n#a -> z 1 output: 25 # 25-> -25 + 26 = 1\n#a -> y 2 output: 24 # 24-> -24 + 26 = 2\n", "word=input()\r\nposition='a'\r\nsteps=0\r\nfor i in word:\r\n distance1=abs(ord(position)-ord(i))\r\n distance2=26-distance1\r\n least=min(distance1,distance2)\r\n steps+=least\r\n position=i\r\nprint(steps)", "s = input()\r\nc = 0\r\nstart = 0\r\nfor i in range(len(s)) :\r\n index = ord(s[i]) - 97\r\n walk = abs(start - index)\r\n if walk < 13 :\r\n c += walk\r\n else :\r\n c += 26 - walk\r\n start = index\r\n\r\n\r\nprint(c)\r\n\r\n", "from math import fabs\r\nembosser = {chr(_ + 97): _ for _ in range(0, 26)}\r\n# print(embosser)\r\n\r\nname = input()\r\npointer = 0\r\nrotates = 0\r\nfor i in name:\r\n rotate = fabs(pointer - embosser[i])\r\n if rotate <= 13:\r\n rotates += rotate\r\n else:\r\n rotates += 26 - rotate\r\n pointer = embosser[i]\r\n\r\nprint(int(rotates))\r\n", "s=input().strip()\r\nalph=['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\np=0\r\nk=0\r\nfor i in s:\r\n x=alph.index(i)\r\n v1=p-x\r\n if v1<0:\r\n v1+=26\r\n v2=x-p\r\n if v2<0:\r\n v2+=26\r\n if v1<v2:\r\n k+=v1\r\n p=x\r\n else:\r\n k+=v2\r\n p=x\r\nprint(k)", "all = \"abcdefghijklmnopqrstuvwxyz\"\r\nword = input()\r\nhsl = all.index(word[0])\r\nif hsl>13:\r\n hsl=26-hsl\r\nfor i in range(1,len(word)):\r\n smtr = abs(all.index(word[i])-all.index(word[i-1]))\r\n if smtr>13:\r\n smtr=26-smtr\r\n hsl+=smtr\r\nprint(hsl)", "def q(a):\r\n if a>=0:\r\n return a\r\n else:\r\n return a*(-1)\r\n \r\nA='abcdefghijklmnopqrstuvwxyz'\r\nA=list(A)\r\ni=[0]\r\nS=list(input())\r\nc=0\r\nfor s in S:\r\n i+=[A.index(s)]\r\n\r\nfor x in range(1,len(S)+1):\r\n p1=i[x-1]\r\n p2=i[x]\r\n c+=min(q(p2-p1),26-q(p1-p2))\r\n\r\n\r\nprint(c)\r\n \r\n \r\n", "word = input()\r\nspell_list = list(word)\r\n\r\npoint = 'a'\r\ncount = 0\r\n\r\nfor spell in spell_list:\r\n one = abs(ord(point)-ord(spell))\r\n two = 26 - one\r\n if one < two:\r\n count += one\r\n else:\r\n count += two \r\n point = spell\r\n\r\nprint(count)", "s=input()\r\nt=0\r\nprev=ord('a')\r\nfor i in s:\r\n d=abs(ord(i)-prev)\r\n if d>13:\r\n t+=26-d\r\n else:\r\n t+=d\r\n prev=ord(i)\r\nprint(t)", "def min_rotations_to_print(exhibit):\r\n current_letter = 'a'\r\n rotations = 0\r\n \r\n for letter in exhibit:\r\n clockwise_distance = (ord(letter) - ord(current_letter) + 26) % 26\r\n counterclockwise_distance = (ord(current_letter) - ord(letter) + 26) % 26\r\n min_distance = min(clockwise_distance, counterclockwise_distance)\r\n rotations += min_distance\r\n current_letter = letter\r\n \r\n return rotations\r\n\r\nexhibit_name = input().strip()\r\nresult = min_rotations_to_print(exhibit_name)\r\nprint(result)\r\n", "n = str(input())\r\nval = 'a'\r\nans = 0\r\nfor i in range(len(n)):\r\n ans+=min(abs((ord(n[i])-96) - (ord(val)-96)), abs(26 - abs((ord(n[i])-96) - (ord(val)-96))))\r\n val = n[i]\r\nprint(ans)", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n#############################################################################################################################\r\na = input()\r\ncount = 0\r\nabc = 'a'\r\nfor i in a:\r\n count += (min(abs((ord(i))-(ord(abc))),26-(abs((ord(i))-(ord(abc))))))\r\n abc = i\r\nprint(count)", "a=input()\r\nb=min(ord(a[0])-ord('a'),26-(ord(a[0])-ord('a')))\r\nfor i in range(1,len(a)):\r\n\tb+=min(abs(ord(a[i])-ord(a[i-1])),26-abs(ord(a[i])-ord(a[i-1])))\r\nprint(b)", "#a->z 26 letter\nans=0\ninit = 'a'\nst= input()\n# ord in python s used to get ASCII\nfor i in range(len(st)):\n a = abs(ord(st[i]) - ord(init))\n b = 26 - abs(a)\n minn= min(a, b)\n init = st[i]#reposition\n ans+=minn\n\nprint(ans)\n\t \t\t \t \t \t \t \t\t \t \t \t \t\t\t", "inpt1 = input().strip()\r\ninput1 = list(inpt1)\r\n\r\nstarts_with = ord('a')\r\nends_with = ord('z')\r\n\r\nsum = 0\r\nprev= \"a\"\r\nfor char in input1:\r\n curr = ord(char)\r\n prev_ord = ord(prev)\r\n if curr >= prev_ord:\r\n sum += min(prev_ord-starts_with+ends_with-curr + 1, curr - prev_ord)\r\n else:\r\n sum += min(prev_ord-curr, ends_with-prev_ord + curr-starts_with+1)\r\n prev = char\r\nprint(sum)", "chars = ['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']\r\nword = input()\r\nrotations = 0\r\nadd =list()\r\n\r\nfor x in word:\r\n diff = chars.index(x) - 12\r\n rotations += abs(diff)\r\n if diff < 0 :\r\n add = chars[26+diff : 26]\r\n del chars[26+diff : 26]\r\n chars = add + chars\r\n else :\r\n add = chars[0 : diff]\r\n del chars[0 : diff]\r\n chars = chars + add\r\n\r\n \r\n\r\nprint(rotations)\r\n ", "from string import ascii_lowercase\r\n# link: https://codeforces.com/contest/731/problem/A\r\n\r\nletters_locator = {letter: idx for idx, letter in enumerate(ascii_lowercase)}\r\n\r\nword = input()\r\n\r\ntotal_moves = 0\r\ncurrent_letter = 'a'\r\nfor letter in word:\r\n current_idx = letters_locator[current_letter]\r\n target_idx = letters_locator[letter]\r\n\r\n val_1 = abs(target_idx - current_idx)\r\n val_2 = 26 - val_1\r\n\r\n total_moves += min(val_1, val_2)\r\n\r\n current_letter = letter\r\n\r\nprint(total_moves)\r\n", "import math\r\n\r\nal = {'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8, 'i': 9, 'j': 10, 'k': 11, 'l': 12, 'm': 13, 'n': 14, 'o': 15, 'p': 16, 'q': 17, 'r': 18, 's': 19, 't': 20, 'u': 21, 'v': 22, 'w':23, 'x': 24, 'y': 25, 'z': 26}\r\n\r\ns = 'a'\r\ninp = input()\r\ns = s + inp\r\nsummation = 0\r\n\r\nfor i in range(0, len(inp)):\r\n\tdist = min(abs(al[s[i]] - al[s[i + 1]]), 26 - abs(al[s[i]] - al[s[i + 1]]))\r\n\tsummation += dist\r\n\r\nprint(summation)", "if __name__ == '__main__':\r\n x = 'a' + input()\r\n count = 0\r\n for i in range(1, len(x)):\r\n if abs((ord(x[i]) - ord('a')) - (ord(x[i - 1]) - ord('a'))) < 13:\r\n count += (abs((ord(x[i]) - ord('a')) - (ord(x[i - 1]) - ord('a'))))\r\n else:\r\n count += (26 - abs((ord(x[i]) - ord('a')) - (ord(x[i - 1]) - ord('a'))))\r\n\r\n print(count)", "str1=input()\r\ndict1=['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\nres=0\r\ncurr=0\r\nfor i in str1:\r\n required=dict1.index(i)\r\n work=abs(required-curr)\r\n work1=abs(work-26)\r\n res+=(min(work,work1))\r\n if work<0:\r\n work=work+26\r\n curr=required\r\nprint(res)", "s='a'+input();k=len(s);t=0\r\nfor i in range(k-1):\r\n x=abs(ord(s[i])-ord(s[i+1]));t+=min(x,26-x)\r\nprint(t)\r\n ", "def solve():\r\n s = input()\r\n start, ans = 'a', 0\r\n for i in s:\r\n ans += min(abs(ord(i)-ord(start)), 26-abs(ord(i)-ord(start)))\r\n start = i\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 = 'a' + input()\r\nmoves = 0\r\nfor i in range(1, len(n)):\r\n c1 = ord(n[i-1])\r\n c2 = ord(n[i])\r\n l = abs(c1-c2)\r\n r = 26-l\r\n moves += min(l, r)\r\nprint(moves)", "import string\r\ncharater_map={}\r\nx=1\r\ncharacter=string.ascii_lowercase\r\nfor i in character:\r\n charater_map[i]=x\r\n x+=1\r\n#print(charater_map)\r\np='a'\r\nres=0\r\ns=input()\r\nfor i in range(len(s)):\r\n res+=min(abs(charater_map[p]-charater_map[s[i]]),len(charater_map)-abs(charater_map[p]-charater_map[s[i]]))\r\n p=s[i]\r\nprint(res)", "c = 0\r\nt = 'a'\r\nfor i in input():\r\n c += min((abs(list(map(chr, range(97, 123))).index(t) - list(map(chr, range(97, 123))).index(i))), abs((26 - abs((list(map(chr, range(97, 123))).index(t) - list(map(chr, range(97, 123))).index(i))))))\r\n t = i\r\n\r\nprint(c)\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nd = {}\r\nfor i in range(97, 123):\r\n d[chr(i)] = i - 96\r\nprev = 1\r\ns = input().rstrip()\r\nc = 0\r\nfor i in s:\r\n c += min(abs(d[i] - prev), abs(26 - abs(d[i] - prev)))\r\n prev = d[i]\r\nprint(c)", "def main():\r\n aname = input()\r\n anum = []\r\n for char in aname:\r\n num = ord(char) - 96\r\n anum.append(num)\r\n steps = 0\r\n stnum = 1\r\n for i in range(len(anum)):\r\n let1 = stnum\r\n let2 = anum[i]\r\n a1 = abs(let1 - let2)\r\n a2 = 26 - a1\r\n step1 = min(a1, a2)\r\n steps += step1\r\n stnum = let2\r\n print(steps)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "word = input()\r\n\r\ntotal = 0\r\n\r\nif abs(ord(\"a\")-ord(word[0])) > 13:\r\n total += 26-abs(ord(\"a\")-ord(word[0]))\r\nelse:\r\n total += abs(ord(\"a\")-ord(word[0]))\r\n\r\nfor i in range(len(word)-1):\r\n if abs(ord(word[i])-ord(word[i+1])) > 13:\r\n total += 26-abs(ord(word[i])-ord(word[i+1]))\r\n else:\r\n total += abs(ord(word[i])-ord(word[i+1]))\r\n\r\nprint(total)", "n = input()\r\ncounter = 0\r\npointer = 97\r\nfor i in range(len(n)):\r\n if abs(ord(n[i]) - pointer) <= 13:\r\n counter +=abs(ord(n[i]) - pointer)\r\n pointer = ord(n[i])\r\n elif abs(ord(n[i]) - pointer) > 13 and pointer > ord(n[i]) :\r\n counter += 122 - pointer + 1 + ord(n[i]) - 97\r\n pointer = ord(n[i])\r\n else:\r\n counter += pointer - 97 + 1 + 122 - ord(n[i])\r\n pointer = ord(n[i])\r\nprint (counter)", "exhibit = input()\r\n\r\nrotations = 0\r\npointer = ord('a')\r\n\r\ni = 0\r\nwhile i < len(exhibit):\r\n r = abs(pointer - ord(exhibit[i]))\r\n\r\n rotations += [26 - r, r][r <= 13]\r\n\r\n pointer = ord(exhibit[i])\r\n \r\n i += 1 \r\n\r\nprint(rotations)", "def distance(c1, c2):\r\n if ord(c1) >= ord(c2):\r\n a = ord(c1) - ord(c2)\r\n b = ord(c2) - ord(c1) + 26\r\n else:\r\n a = ord(c2) - ord(c1)\r\n b = ord(c1) - ord(c2) + 26\r\n return min(a ,b)\r\n\r\ns = input()\r\nn = len(s)\r\n\r\nm = distance('a', s[0])\r\nfor i in range(1, n):\r\n m += distance(s[i - 1], s[i])\r\nprint(m)", "s = input()\nc = 0\np = 'a'\nfor letra in s:\n if abs(ord(letra)-ord(p))<=12:\n c+=abs(ord(letra)-ord(p))\n else:\n c+=26-abs(ord(letra)-ord(p))\n p=letra\nprint(c)", "str = input()\r\n\r\ncurrent = 'a'\r\n\r\nrotation = 0\r\n\r\nfor dest in str:\r\n\r\n path = abs(int(ord(dest) - ord(current)))\r\n\r\n rotation += min(26 - path, path)\r\n\r\n current = dest\r\n\r\nprint(rotation)\r\n", "s = 'a' + input().lower()\r\nm = 0\r\nfor i in range(1, len(s)):\r\n diff = abs(ord(s[i])-ord(s[i-1]))\r\n m += min(diff, 26 - diff)\r\nprint(m)", "s = [i for i in input()]\r\nab = ['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\nstart = 'a'\r\nans = 0\r\nfor i in s:\r\n lr = abs(ab.index(i) - ab.index(start))\r\n rl = 26 - abs(ab.index(i) - ab.index(start))\r\n ans += min(lr, rl)\r\n start=i\r\nprint(ans)\r\n", "def my_solution(str):\r\n str = [ord(char)-96 for char in str]\r\n \r\n rotates = 0\r\n arrow_char = ord('a')-96\r\n\r\n\r\n for char in str:\r\n\r\n steps = abs(char - arrow_char)\r\n if steps > 13:\r\n rotates += 26 - steps\r\n else:\r\n rotates += steps\r\n arrow_char = char\r\n print(rotates)\r\n\r\nstr = input()\r\nmy_solution(str)", "t='a'\r\ns=0\r\nd=0\r\nmy_str=input()\r\n\r\nfor i in range(len(my_str)):\r\n \r\n if my_str[i]>t:\r\n d=ord(my_str[i])-ord(t)\r\n \r\n else:\r\n d=ord(t)-ord(my_str[i])\r\n \r\n \r\n if d>13:\r\n d = 26-d\r\n \r\n s += d\r\n \r\n t=my_str[i]\r\n\r\nprint(s)\r\n ", "m=0\r\na=0\r\nv=[]\r\nx=[str(z)for z in input()]\r\nif len(x)<=100:\r\n for c in x:\r\n if c.islower():\r\n v.append(c)\r\n if len(v)==len(x):\r\n v.insert(0,'a')\r\n # print('list of v',v)\r\n \r\n for b in range(len(v)-1):\r\n # print('range(len(v)-1)',range(len(v)-1))\r\n m=ord(v[0])-ord(v[1])\r\n if m<0:\r\n m=m*-1\r\n # print('m b3d t3del',m)\r\n v.remove(v[0])\r\n # print('vvvv',v)\r\n if m<=13:\r\n a=a+m\r\n else:\r\n s=26-m\r\n a=a+s\r\n # print('a=',a) \r\n \r\n print(a) ", "b = input()\r\na = 97\r\nc = 0\r\nfor i in b:\r\n t = abs(a-ord(i))\r\n j = min(t, 26-t)\r\n c += j\r\n a = ord(i)\r\nprint(c)", "s = input()\r\nc, d = 0, abs(ord(s[0]) - 97)\r\nif d <= 13:\r\n c += d\r\nelse:\r\n c += (26 - d)\r\nfor i in range(len(s) - 1):\r\n d = abs(ord(s[i]) - ord(s[i + 1]))\r\n if d <= 13:\r\n c += d\r\n else:\r\n c += (26 - d)\r\nprint(c)", "def char_check(arr,idx,val):\r\n temp1 = temp2 = 0\r\n index1 = index2 = idx\r\n while arr[index1] != val:\r\n temp1 += 1\r\n if index1 == 0:\r\n index1 = 26\r\n index1 -= 1\r\n\r\n while arr[index2] != val:\r\n temp2 += 1\r\n if index2 == 25:\r\n index2 = -1\r\n index2 += 1\r\n\r\n if temp1 < temp2:\r\n return (temp1,index1) \r\n else: return(temp2,index2)\r\n\r\n\r\nalph = []\r\n\r\n\r\nfor i in range(97,123):\r\n alph.append(chr(i))\r\n\r\nstart_idx = 0\r\ns = input()\r\nc = 0\r\nfor i in s:\r\n x = char_check(alph,start_idx,i)\r\n c += x[0]\r\n start_idx = x[1]\r\nprint(c)", "t = 'abcdefghijklmnopqrstuvwxyz'\r\nx=0\r\ns = input()\r\ns = 'a'+s\r\nfor i in range(1,len(s)):\r\n\td = abs(t.find(s[i]) - t.find(s[i-1]))\r\n\tif d>13:\r\n\t\tx+=(26-d)\r\n\telse:\r\n\t\tx+=d\r\nprint(x)\r\n", "s=input()\r\nz=0\r\ny=ord(s[0])-97\r\nx=min(y,26-y)\r\nfor i in range(len(s)-1):\r\n z=abs(ord(s[i+1])-ord(s[i]))\r\n x+=min(z,26-z)\r\nprint(x)\r\n\r\n \r\n", "def I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\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\treturn print('\\n'.join(map(str, out)))\r\n\r\n'''\r\n1 100 if 1 = 0\r\n2 2, 0\r\n5 5 0 2 0 3 0\r\n2 10\r\n\r\n2 1\r\n4 3\r\n\r\n2 1\r\n3 1 2\r\n4 1 2 3\r\n2 1 5 3 4\r\n\r\n2 1 4 3 6 5\r\n\r\n2 1\r\n3 1 2\r\n4 3 1 2\r\n\r\n1 2 3 4\r\n4 3 2 1\r\n\r\n1 2 3\r\n3 2 1\r\n\r\n\r\n1 2 3 4 5\r\n5 4 3 2 1\r\n\r\n5 4 1 2 3\r\n\r\n'''\r\n\r\ns = I()\r\nans = 0\r\ncur = ord('a')\r\nfor c in s:\r\n abs_dist = abs(ord(c) - cur)\r\n ans += min(26 - abs_dist, abs_dist)\r\n cur = ord(c)\r\nprint(ans)\r\n", "a = input()\r\nal = 'abcdefghijklmnopqrstuvwxyz'\r\nb = 'a'\r\nans = 0\r\nfor i in a:\r\n ans += min(abs(ord(b) - ord(i)), 26 - abs(ord(b) - ord(i)))\r\n b = i\r\nprint(ans)", "word = list(map(lambda x: ord(x)-97, list(input())))\r\nclick = 0\r\ncur = 0\r\nfor i in range(len(word)):\r\n\tdif = abs(cur - word[i])\r\n\tclick += min(dif % 26, - dif % 26)\r\n\tcur = word[i]\r\nprint(click)", "name = input()\npointer = ord('a')\ncounter = 0\nfor letter in name:\n d = abs(pointer - ord(letter))\n ad = abs(26 - d)\n if d > ad:\n counter += ad\n else:\n counter += d\n pointer = ord(letter)\n\nprint(counter)", "s = input()\r\na = [chr(i) for i in range(97, 123)]\r\n\r\np, c = 'a', 0\r\nfor i in s:\r\n n = min(a.index(i), a.index(p))\r\n m = max(a.index(i), a.index(p))\r\n\r\n s1 = (n+1) + 25-m\r\n s2 = m-n\r\n \r\n c += min(s1, s2)\r\n p = i\r\n\r\nprint(c)\r\n", "s = input()\r\nx = ord('a')\r\nc = 0\r\nfor i in s:\r\n y = abs(ord(i)-x)\r\n if y > 13:\r\n c+= 26-y\r\n else:\r\n c+=y\r\n x = ord(i)\r\nprint(c)", "import string\r\n\r\nword = input()\r\nalphabet = string.ascii_lowercase * 200\r\ntotal = 0\r\n\r\npointer = 2600\r\nfor letter in word:\r\n letters_index = []\r\n for index in range(len(alphabet)):\r\n if alphabet[index] == letter:\r\n letters_index.append(index)\r\n distances = {}\r\n for index in letters_index:\r\n distances[abs(index - pointer)] = (index)\r\n min_distance = 27\r\n for distance in distances:\r\n if distance < min_distance:\r\n min_distance = distance\r\n pointer = distances[min_distance]\r\n total += min_distance\r\n\r\nprint(total)", "string = input()\r\n\r\ncounter = 0\r\npointer = 'a'\r\n\r\nfor i in range(len(string)):\r\n r = abs(ord(string[i]) - ord(pointer))\r\n if r <= 13:\r\n counter += r\r\n else:\r\n counter += 26 -r\r\n\r\n pointer = string[i]\r\nprint(counter)", "a = input()\r\ns = 0\r\nans = 0\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 range(len(a)):\r\n c = abs(b.index(a[i]) - s)\r\n d = c - len(b)\r\n if c < abs(d) or c == abs(d):\r\n ans += c\r\n elif c > abs(d):\r\n ans += abs(d)\r\n s = b.index(a[i])\r\nprint(ans)\r\n \r\n", "x=input()\r\ncurrent_char=0\r\nmoves=0\r\nfor i in range (len(x)):\r\n strt =int( ord(x[i]) - 97)\r\n walk = int(abs(current_char - strt ))\r\n current_char = strt\r\n if walk < 13 :\r\n moves+= walk\r\n else :\r\n moves+= 26 - walk \r\nprint (moves)\r\n \r\n ", "b = [i for i in input()]\r\nk, u, f = 0, 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\nfor i in range(0, len(b)):\r\n t = a.index(b[i])\r\n f = 99\r\n if u != a.index(b[i]):\r\n t1 = u + abs(26 - t)\r\n if t1 > 0:\r\n f = t1\r\n t2 = t - u\r\n if t2 > 0 and t2 < f:\r\n f = t2\r\n t3 = u - t\r\n if t3 > 0 and t3 < f:\r\n f = t3\r\n t4 = 26 - u + t\r\n if t4 >0 and t4 < f:\r\n f = t4\r\n u = t\r\n k += f\r\nprint(k)", "s = list(map(ord,input()))\r\ncounter = 0\r\na = 97\r\nfor i in s:\r\n t = abs(a - i)\r\n counter += min(t, 26 - t)\r\n a = i\r\nprint(counter)", "import string\r\ndef getMinRotation(name):\r\n wheel = list(string.ascii_lowercase)\r\n rotation = 0\r\n poiter = 'a'\r\n\r\n for i in range(len(name)):\r\n cur = name[i]\r\n distant = abs(ord(poiter) - ord(cur))\r\n if distant < 13:\r\n rotation += distant\r\n else:\r\n rotation += (26-distant)\r\n \r\n poiter = cur\r\n \r\n return rotation\r\n \r\nname = input()\r\nprint(getMinRotation(name))", "a = \"abcdefghijklmnopqrstuvwxyz\"\r\nc = {}\r\ni = 0\r\ntrr = False\r\nfor d in a : \r\n c[d] = i\r\n if not trr : \r\n i+=1\r\n else :\r\n i-=1\r\n if d == \"n\" :\r\n i=12\r\n trr = True\r\n \r\n\r\nn = input()\r\ncurr = \"a\"\r\nr = 0\r\nfor i in n : \r\n e= abs(c[i] + c[curr])\r\n d = abs(a.index(curr) - a.index(i))\r\n if d > e : \r\n r+=e \r\n else : \r\n r+=d\r\n curr = i \r\n \r\nprint(r)", "s = input()\n\nimport string\n\nletters = string.ascii_lowercase\n\ndic = {}\n\ncount = 1\nfor char in letters:\n dic[char] = count\n count+=1\n\n\n\ncount_steps = 0\n\ncurrent = 1\n\nfor char in s:\n\n need = 0\n \n if abs(dic[char] - current) > 13:\n need = 26 - abs(current-dic[char])\n count_steps+=need\n\n else:\n need = abs(current - dic[char])\n count_steps+=need\n\n current = dic[char]\n\nprint(count_steps)", "import string\r\n\r\nword = list(input())\r\ncurr_letter = 'a'\r\nnext_letter = ''\r\nclc_moves = 0\r\nanticlc_moves = 0\r\ntotal_moves = 0\r\nletters_wheel = list(string.ascii_lowercase)\r\n\r\n\r\ndef rotateClck(wheel, start, end):\r\n count = 0\r\n while wheel[0] != start:\r\n wheel = (wheel[-1:] + wheel[:-1]) # rotates one step clock-wise\r\n while wheel[0] != end:\r\n wheel = (wheel[-1:] + wheel[:-1]) # rotates one step clock-wise\r\n count += 1\r\n return wheel, count\r\n\r\n\r\ndef rotateAntiClock(wheel, start, end):\r\n count = 0\r\n while wheel[0] != start:\r\n wheel = (wheel[1:] + wheel[:1]) # rotates one step anti clock-wise\r\n while wheel[0] != end:\r\n wheel = (wheel[1:] + wheel[:1]) # rotates one step anti clock-wise\r\n count += 1\r\n return wheel, count\r\n\r\n\r\nfor l in word:\r\n next_letter = l\r\n letters_wheel, clc_moves = rotateClck(letters_wheel, curr_letter, next_letter)\r\n if clc_moves > 13:\r\n letters_wheel, anticlc_moves = rotateAntiClock(letters_wheel, curr_letter, next_letter)\r\n total_moves += anticlc_moves\r\n else:\r\n total_moves += clc_moves\r\n\r\n\r\n curr_letter = next_letter\r\n\r\nprint(total_moves)\r\n", "\r\nstring = input()\r\n\r\na = 1\r\nnew_string = dict()\r\n\r\nfor i in range(97, 123):\r\n new_string[chr(i)] = a\r\n a += 1\r\n\r\n\r\n\r\n\r\nminN = 0\r\nl = 26\r\nfirst_str = new_string['a']\r\n\r\nfor i in string:\r\n\r\n minN += min(abs(first_str - new_string[i]), l - abs(first_str - new_string[i]))\r\n first_str = new_string[i]\r\n\r\nprint(minN)\r\n", "s = input()\r\n\r\ndef dist(a, b):\r\n return min(abs(ord(b) - ord(a)), 26 - abs(ord(b) - ord(a)))\r\n\r\nn = len(s)\r\nres = dist('a', s[0])\r\n\r\nfor i in range(n - 1):\r\n res += dist(s[i], s[i + 1])\r\n\r\nprint(res)\r\n", "alphabet = \"abcdefghijklmnopqrstuvwxyz\"\r\nword = input()\r\ntotalMoves = 0\r\ncurrentLetter = \"a\"\r\nfor nextLetter in word:\r\n totalMoves = totalMoves + min(abs(alphabet.index(nextLetter) - alphabet.index(currentLetter)),26 - abs(alphabet.index(nextLetter) - alphabet.index(currentLetter)))\r\n currentLetter = nextLetter\r\nprint(totalMoves)", "c = 97\r\ns = 0;\r\nfor x in map(ord,input()):\r\n\ti = abs(c-x)\r\n\ts += min(i,26-i)\r\n\tc = x\r\nprint(s)\r\n", "s=input()\r\nnumRotations=0\r\nstarPoint=0\r\nfor i in range(len(s)) :\r\n place = ord(s[i])-97\r\n dis = abs(starPoint-place) \r\n if(dis < 13):\r\n numRotations+=dis\r\n else:\r\n numRotations+=26-dis\r\n starPoint=place \r\nprint(numRotations) ", "def main():\r\n\tfrom sys import stdin, stdout\r\n\r\n\t# stdin = open(\"input.txt\", \"r\")\r\n\r\n\ts = map(ord, stdin.read())\r\n\r\n\tres = 0\r\n\tcurr = 0\r\n\r\n\tA = ord('a')\r\n\tZ = ord('z')\r\n\r\n\tfor x in s:\r\n\t\tif A <= x <= Z:\r\n\t\t\tx -= A\r\n\t\t\tres += min(abs(x-curr), 26-abs(x-curr))\r\n\t\t\tcurr = x;\r\n\t\telse:\r\n\t\t\tbreak\r\n\r\n\tstdout.write(str(res) + '\\n')\r\n\t\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "#li = list(map(int, input().strip().split()))\n\ns = input()\n\na = []\nfor c in s:\n\ta.append(ord(c) - ord('a'))\n\t#print (c)\n\npre = 0\ncnt = 0\nfor i in a:\n\tcnt += min(abs(pre-i), 26-abs(pre-i))\n\tpre = i\n\nprint(cnt)\n", "stringinput = list(\"a\" + input())\r\n\r\narray = [\"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 = len(stringinput) \r\noutputsum = 0\r\nfor i in range(1,n):\r\n character1 = stringinput[i-1]\r\n character2 = stringinput[i]\r\n array_diff = int(array.index(character2)) - int(array.index(character1))\r\n if abs(array_diff) > 13:\r\n outputsum = outputsum + abs((26 - abs(array_diff)))\r\n else:\r\n outputsum = outputsum + abs(array_diff)\r\nprint(outputsum)\r\n\r\n\r\n", "a=input()\r\nprev='a'\r\ns=0\r\nfor i in a:\r\n x=abs(ord(prev)-ord(i))\r\n s+=min(26-x,x)\r\n prev=i\r\nprint(s)", "from string import ascii_lowercase as arr\r\nchars = dict()\r\npointer = 0\r\n\r\nfor i in range(len(arr)): chars[arr[i]] = i\r\n\r\nans = 0\r\nfor i in input():\r\n p1 = abs(chars[i] - pointer)\r\n p2 = abs(26 - p1)\r\n ans += min(p1, p2)\r\n pointer = chars[i]\r\n\r\nprint(ans)", "s = input()\r\nprev = 'a'\r\nsum = 0\r\nfor i in s:\r\n diff = abs(ord(i) - ord(prev))\r\n if(diff > 12):\r\n diff = 25-diff+1\r\n sum += diff\r\n prev = i\r\nprint(sum)\r\n", "from math import*\r\nfrom string import*\r\n\r\nalf = ascii_lowercase\r\na = input()\r\nind0 = 0\r\nt = 0\r\nfor i in a:\r\n ind1 = alf.index(i)\r\n if abs(ind1-ind0) <= 12:\r\n t+= abs(ind1-ind0)\r\n else:\r\n t+=25-max(ind1,ind0)+min(ind1,ind0)+1\r\n ind0 = ind1\r\nprint(t)", "def solution(input):\r\n result = 0\r\n start_pointer = 'a'\r\n end_pointer = input[0]\r\n for i in range(len(input)):\r\n result += min(abs(ord(start_pointer)-ord(end_pointer)), 26-abs(ord(start_pointer)-ord(end_pointer)))\r\n start_pointer = input[i]\r\n if i < len(input)-1:\r\n end_pointer = input[i+1]\r\n else:\r\n pass\r\n return result\r\n\r\nn = list(input())\r\nprint(solution(n))", "a='abcdefghijklmnopqrstuvwxyz'\r\nb=a[::-1]\r\neng = input()\r\ns = 0\r\nsum=0\r\nwhile s<len(eng):\r\n #print(a.index(eng[s]),b.index(eng[s])+1)\r\n sum+=min(a.index(eng[s]),b.index(eng[s])+1)\r\n if min(a.index(eng[s]),b.index(eng[s]))==b.index(eng[s]):\r\n #print(a[a.index(eng[s])],b[:b.index(eng[s])][::-1],a[:a.index(eng[s])])\r\n a=a[a.index(eng[s])]+b[:b.index(eng[s])][::-1]+a[:a.index(eng[s])]\r\n b=a[::-1]\r\n else:\r\n #print(b,b[b.index(eng[s])],a[:a.index(eng[s])][::-1],b[:b.index(eng[s])])\r\n a=b[b.index(eng[s])]+a[:a.index(eng[s])][::-1]+b[:b.index(eng[s])]\r\n b=a[::-1]\r\n \r\n s+=1\r\nprint(sum)\r\n", "s = input()\r\nres = 0\r\ncurrent = 'a'\r\nfor c in s:\r\n if(ord(current) < ord(c)):\r\n v = -1\r\n else:\r\n v=1\r\n if(abs(ord(current) - ord(c) ) < abs(ord(current) - (ord(c) + 26 *v))):\r\n res += abs(ord(current) - ord(c) )\r\n else:\r\n res+=abs(ord(current) - (ord(c) + 26 * v)) \r\n current = c\r\nprint(res)\r\n \r\n \r\n ", "s = str(input())\r\no = 97\r\nt = 0\r\nfor i in range(0, len(s)):\r\n a = ord(s[i])\r\n t += min(abs(a - o), 26 - abs(a - o))\r\n o = a\r\nprint(t)", "s=input()\r\nc=0\r\na=97\r\nfor x in map(ord,s):\r\n\ti=abs(a-x)\r\n\tc+=min(i,26-i)\r\n\ta=x\r\nprint(c)\r\n\r\n", "s=input()\r\nans=0\r\nk=1\r\nfor i in s:\r\n res=ord(i)-96\r\n res1=26-abs(res-k)\r\n ans+=min(abs(res-k),res1) \r\n k=res \r\nprint(ans)", "al = {'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8, 'i': 9, 'j': 10, 'k': 11, 'l': 12, 'm': 13, 'n': 14, 'o': 15, 'p': 16, 'q': 17, 'r': 18, 's': 19, 't': 20, 'u': 21, 'v': 22, 'w': 23, 'x': 24, 'y': 25, 'z': 26}\r\nstr1 = input().lower()\r\nstr1 = \"a\"+str1\r\ncount=0\r\nfor i in range(len(str1)-1):\r\n if (abs(al[str1[i]]-al[str1[i+1]])) > 13:\r\n count += 26 - (abs(al[str1[i]]-al[str1[i+1]]))\r\n else:\r\n count += (abs(al[str1[i]]-al[str1[i+1]]))\r\nprint(count)", "x = input()\n#abs(from - to), 26 - abs(from- to)\nbegin = 0\nans = 0\nfor c in x:\n\tend = 97 - ord(c)\n\tans += min(abs(begin -end), 26 - abs(begin - end))\n\tbegin = end\nprint(ans)\n \t \t\t \t \t\t\t\t\t\t \t \t\t \t \t", "alpha=\"opqrstuvwxyzabcdefghijklmn\"\r\nn=input()\r\ni,j=12,12\r\nt=True\r\nl,r=0,0\r\nans=0\r\nfor k in n:\r\n while t:\r\n if alpha[i]==k:\r\n None\r\n else:\r\n if i+1==26:\r\n i=0\r\n r+=1\r\n else:\r\n i+=1\r\n r+=1\r\n if alpha[j]==k:\r\n None\r\n else:\r\n if j-1==-1:\r\n j=25\r\n l+=1\r\n else:\r\n j-=1\r\n l+=1\r\n if alpha[i]==k and alpha[j]==k:\r\n ans+=min(l,r)\r\n l,r=0,0\r\n break\r\nprint(ans)", "s = input()\r\nlast = ord('a')\r\nc=0\r\nfor i in range(len(s)):\r\n su = abs(ord(s[i])-last)\r\n if su > 13:\r\n c+= 26-su\r\n else:\r\n c+=su\r\n last = ord(s[i])\r\nprint(c)", "import string\r\na = string.ascii_lowercase\r\n\r\nx = input()\r\npred = 0\r\nc = 0\r\n\r\nfor i in x:\r\n ind = a.index(i)\r\n c+=min(abs(pred-ind), 26-pred+ind,26+pred-ind)\r\n pred = ind\r\n\r\nprint(c)", "def rotation(word):\r\n current=ord('a')\r\n sum=0\r\n for letter in word:\r\n target=ord(letter)\r\n X = (target - current) % 26\r\n Y = (current - target)%26\r\n sum+=min(X,Y)\r\n current =target\r\n print(sum)\r\n \r\nrotation(input().lower())", "s = input().strip()\r\n\r\ncurrent = 'a'\r\ntotal_distance = 0\r\n\r\nfor c in s:\r\n clockwise_distance = (ord(c) - ord(current) + 26) % 26\r\n counterclockwise_distance = (ord(current) - ord(c) + 26) % 26\r\n if clockwise_distance <= counterclockwise_distance:\r\n total_distance += clockwise_distance\r\n else:\r\n total_distance += counterclockwise_distance\r\n current = c\r\n\r\nprint(total_distance)\r\n", "def min_rotations_to_print(name):\r\n current_position = 0\r\n total_rotations = 0\r\n\r\n for char in name:\r\n target_position = ord(char) - ord('a')\r\n rotations_clockwise = (target_position - current_position) % 26\r\n rotations_counterclockwise = (current_position - target_position) % 26\r\n total_rotations += min(rotations_clockwise, rotations_counterclockwise)\r\n current_position = target_position\r\n\r\n return total_rotations\r\n\r\nif __name__ == \"__main__\":\r\n # Input\r\n name = input().strip()\r\n\r\n # Output\r\n result = min_rotations_to_print(name)\r\n print(result)\r\n", "n=input()\r\na='abcdefghijklmnopqrstuvwxyz'\r\ncount=0\r\nindex1=0\r\nfor i in n:\r\n count+=min(abs(index1-a.index(i)),26-abs(index1-a.index(i)))\r\n index1=a.index(i)\r\nprint(count)\r\n \r\n \r\n", "n = input()\nl = 0\nmove = 0\nfor i in n:\n v = ord(i)-ord('a')\n # clockwise\n c1 = abs(l-v)\n # counter-clockwise\n c2 = 26 - abs(l-v)\n l = v\n move += min(c1,c2)\nprint(move)", "exhibit_name= input()\r\n\r\ndef find_shortest_path(s):\r\n current_char=\"a\"\r\n res=0\r\n for char in s:\r\n target_char= char\r\n first_option= abs(ord(current_char)-ord(target_char))\r\n second_option= abs(26-first_option)\r\n res+= min(first_option,second_option)\r\n current_char=char\r\n return res\r\n\r\nprint(find_shortest_path(exhibit_name))", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n#\r\n# ------------------------------------------------------------------------------\r\n# Author: Mohammad Mohsen\r\n# Date: Sat Dec 18 18:56:38 2021\r\n# problem name: Night_at_the_Museum\r\n# contest: 731-Codeforces Round #376 (Div. 2)\r\n# problem difficulty: A-D2\r\n# problem url: https://codeforces.com/contest/731/problem/A\r\n# ------------------------------------------------------------------------------\r\n\r\nfrom typing import *\r\nfrom string import ascii_lowercase\r\n\r\nclass Problem(object):\r\n\r\n def __init__(self, name: str) -> None:\r\n self.name = name\r\n self.alpha= len(ascii_lowercase)\r\n\r\n def solution(self) -> Union[str, int, float]:\r\n string: str = input().strip()\r\n last_letter: str = \"a\"\r\n moves: int = 0\r\n \r\n for letter in string:\r\n diff: int = abs(ord(letter) - ord(last_letter))\r\n if diff > self.alpha // 2:\r\n moves += self.alpha - diff\r\n else:\r\n moves += diff\r\n \r\n last_letter = letter\r\n \r\n return moves\r\n\r\nproblem = Problem(\"Night_at_the_Museum\")\r\n\r\nif __name__ == \"__main__\":\r\n solution: Union[str, int, float] = problem.solution()\r\n print(solution)\r\n\r\n", "def Clockwise(char1, char2):\r\n\tm = 0\r\n\tif abs(ord(char2) - ord(char1)) < 13:\r\n\t\tm = abs(ord(char2) - ord(char1))\r\n\telse:\r\n\t\tm = 26 - abs(ord(char2) - ord(char1))\r\n\treturn m\r\n\r\n\r\nstring = list(map(str, input()))\r\nrotat = 0\r\n\r\nrotat += Clockwise(string[0], \"a\")\r\n\r\nfor i in range(0, len(string)-1):\r\n\trotat += Clockwise(string[i], string[i+1])\r\n\r\nprint(rotat)\r\n", "def d(letter1: str, letter2: str) -> int:\r\n dist = abs(ord(letter1) - ord(letter2))\r\n # print(letter1, letter2, dist, 26 - dist)\r\n return min(dist, 26 - dist)\r\n\r\n\r\nw = 'a' + input()\r\nans = 0\r\nfor i in range(1, len(w)):\r\n ans += d(w[i], w[i - 1])\r\n\r\nprint(ans)", "def solve(s):\r\n s='a'+s\r\n ans=0\r\n for i in range(1,len(s)):\r\n tmp=abs(ord(s[i])-ord(s[i-1]))\r\n ans+=min(tmp,26-tmp)\r\n return ans\r\n\r\ns=input()\r\nprint(solve(s))\r\n", "# 97 - a\r\n# 122 - z\r\n\r\ndef main():\r\n s = input()\r\n cnt = 0\r\n l = len(s)\r\n if l == 1:\r\n cnt = (ord(s) - 97 if (ord(s) - 97 < 13) else abs(26-ord(s)+97))\r\n else:\r\n temp = 'a' + s\r\n # print(s, temp)\r\n size = len(temp)\r\n for i in range(size-1):\r\n a = ord(temp[i]) - 97\r\n b = ord(temp[i+1]) - 97\r\n # print(a, chr(a + 97), b, chr(b + 97))\r\n large = a if a > b else b\r\n small = a if a <= b else b\r\n\r\n diff = (large - small) if large - \\\r\n small < 13 else (small + 26 - large)\r\n cnt += diff\r\n print(cnt)\r\n\r\n\r\nmain()\r\n", "s = input().strip()\n\"\"\"\na:97 - z:122\n\"\"\"\ncost = 0\np = 0\nfor c in s:\n p_new = ord(c)-97\n cost += min(\n (p_new - p) % 26,\n (p - p_new) % 26,\n )\n p = p_new\n\n\nprint(cost)\n", "from string import ascii_lowercase as alph\r\ns = input()\r\nx = 0\r\nres = 0\r\nfor i in s:\r\n y = alph.index(i)\r\n res += min(abs(x - y), 26 - abs(x - y))\r\n x = y\r\nprint(res)", "k=('a'+input())\r\nletters={}\r\n\r\nfor i in range(97,123):\r\n letters[chr(i).lower()]=i-96\r\n \r\ns=0\r\n\r\nfor i in range(len(k)):\r\n f=[]\r\n if i!=0:\r\n f.append(26-abs(letters[k[i]]-letters[k[i-1]]))\r\n f.append(abs(letters[k[i]]-letters[k[i-1]]))\r\n s+=min(f)\r\n\r\nprint(s)\r\n", "text = input()\r\nresult = 0\r\ncurrent = 0\r\nlength = len(text)\r\nfor i in range(length):\r\n value = ord(text[i]) - 97\r\n tmp = abs(value - current)\r\n result += min(tmp, 26 - tmp)\r\n current = value\r\nprint(result)", "s = input()\r\nans = 0\r\ni = 0\r\nfor x in s:\r\n g = ord(x) - 97\r\n j = abs(g-i)\r\n k = 26 - j\r\n ans += min(j, k)\r\n i = g\r\nprint(ans)\r\n", "word = list(input())\r\n\r\nwordDecimalASCII = []\r\n\r\nfor letter in word:\r\n actual = ord(letter)\r\n wordDecimalASCII.append(actual)\r\n\r\nprevious = 97\r\n\r\nsum = 0\r\n\r\nfor actual in wordDecimalASCII:\r\n distance = []\r\n distance.append(abs(previous - actual))\r\n complement = 26 if actual >= previous else (-26)\r\n distance.append(abs(actual - (previous+complement)))\r\n sum += distance[0] if distance[0] < distance[1] else distance[1]\r\n previous = actual\r\n\r\nprint(sum)", "a='abcdefghijklmnopqrstuvwxyz'\r\nc=0\r\nind=1\r\nfor i in input():\r\n u=a.find(i)+1\r\n c+=min(z:=abs(u-ind),26-z)\r\n ind=u\r\nprint(c)", "str = input()\r\nans = 0\r\nprev = ord('a')\r\n\r\nfor char in str:\r\n # find current distance from [char -> prev]\r\n curr_dist = abs(ord(char) - prev)\r\n\r\n # rotate CW or CCW\r\n if curr_dist > 13:\r\n ans += 26 - curr_dist\r\n else:\r\n ans += curr_dist\r\n\r\n # update to new character position\r\n prev = ord(char)\r\n\r\nprint(ans)\r\n", "s=input('')\r\nr=0\r\nini='a'\r\nfor i in s:\r\n #zeus\r\n if abs(ord(ini)-ord(i))>13:\r\n r+=(26-abs(ord(ini)-ord(i)))\r\n \r\n else:\r\n r+=abs(ord(ini)-ord(i))\r\n \r\n ini=i\r\nprint(r)", "pointer = 'a'\nrotations = 0\nname = input()\nfor char in name:\n next = char\n pointer = ord(pointer)%97 +1\n char = ord(char)%97 + 1\n steps = abs(char % 26 - pointer % 26)\n if steps > 13:\n steps = 26 - steps\n rotations += steps\n pointer = next\nprint(rotations)", "s = input().strip()\r\nn = len(s)\r\ndist = lambda a, b: min(abs(ord(a)-ord(b)), 26 - abs(ord(a)-ord(b)))\r\nrotations = dist('a', s[0])\r\nfor i in range(n-1):\r\n rotations += dist(s[i], s[i+1])\r\nprint(rotations)", "word = input()\r\nword = [*word]\r\ncurrent_position = 0 \r\nmoves = 0\r\nfor i in range(1,len(word)+1):\r\n index = ord(word[i-1]) - 97\r\n walk = abs(current_position - index )\r\n if walk < 13 :\r\n moves += walk\r\n else:\r\n moves += 26 - walk\r\n\r\n current_position = index\r\n\r\nprint(moves) ", "s=input()\r\nr=0\r\np='a'\r\nfor i in s:\r\n c=abs(ord(i)-ord(p))\r\n a=26-c\r\n r=r+min(a,c)\r\n p=i\r\nprint(r)", "wheel = input()\r\npointer = 'a'\r\ncount = 0\r\nfor i in wheel:\r\n dist = abs(ord(pointer) - ord(i))\r\n if dist < 13:\r\n count = count + dist\r\n else:\r\n count = count + (26 - dist)\r\n pointer = i\r\n\r\nprint(count)", "s=input()\r\nlen=len(s)\r\nsmove=0\r\nstart=0\r\nfor i in range(len):\r\n index= ord(s[i])-97\r\n walk=abs(start-index)\r\n if walk<13:\r\n smove+=walk\r\n else:\r\n smove+=26-walk\r\n start=index \r\n\r\nprint(smove) ", "inp = 'a'+input()\r\nmoves = 0\r\n\r\nfor i in range(0, len(inp)-1):\r\n turn = abs(ord(inp[i]) - ord(inp[i+1]))\r\n if turn < 13:\r\n moves += turn\r\n else:\r\n moves += 26 - turn\r\n\r\nprint(moves)", "name = 'a' + input()\r\ncount = 0\r\n\r\nfor a in range(len(name) - 1):\r\n\r\n x = ord(name[a])\r\n y = ord(name[a+1])\r\n z = abs(x - y)\r\n m = min(z , 26-z)\r\n\r\n count += m\r\n\r\n\r\n\r\nprint(count)\r\n\r\n", "s='a'+input()\r\nsum=0\r\nfor i in range(len(s)-1):\r\n uff=(abs(ord(s[i+1])-ord(s[i])))\r\n sum+=min(uff,26-uff)\r\nprint(sum)", "s=input()\r\np=1\r\nsum=0\r\nfor i in s:\r\n value=ord(i)-96\r\n p1=value-p\r\n p2=26-value+p\r\n #print(p,value,p1%26,p2%26)\r\n sum+=min(abs(p1%26),abs(p2%26))\r\n p=value \r\n \r\nprint(sum)", "alpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nname = input()\r\nrot = 0\r\npointer = 0\r\nfor l in name:\r\n space = abs(alpha.index(l) - pointer)\r\n if space > 13:\r\n space = 26 - space\r\n rot += space\r\n pointer = alpha.index(l)\r\nprint(rot)\r\n", "s='abcdefghijklmnopqrstuvwxyz'\r\nword = input()\r\nc,b = 0,0\r\nfor i in word:\r\n if c == s.index(i):\r\n continue\r\n else:\r\n b += min(abs(c - s.index(i)),26 - abs(c - s.index(i)))\r\n c = s.index(i) \r\nprint(b)\r\n ", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ns = input()\r\na = \"abcdefghijklmnopqrstuvwxyz\"\r\nn = len(s)\r\nu = 0\r\nans = 0\r\nx = 0\r\nfor i in range(n):\r\n x = a.index(s[i]) + 1\r\n ans += min(abs(u + 1 - x), 26 - abs(u + 1 - x))\r\n u = x - 1\r\nprint(ans)\r\n", "alphabet = [x for x in \"abcdefghijklmnopqrstuvwxyz\"]\nname = 'a' + input()\nrotations = 0\nfor i in range(1,len(name)):\n if abs(alphabet.index(name[i-1]) - alphabet.index(name[i])) > 13:\n rotations += (26 - abs((alphabet.index(name[i-1]) - alphabet.index(name[i]))))\n else:\n rotations += abs(alphabet.index(name[i-1]) - alphabet.index(name[i]))\n\nprint(rotations)\n \t \t \t\t \t \t \t\t \t \t\t", "alph = 'abcdefghijklmnopqrstuvwxyz'\r\na = input()\r\ncurrent_lett = 'a'\r\no = 0\r\nfor i in a:\r\n n = alph.find(current_lett)\r\n n1 = alph.find(i)\r\n o += min(abs(n-n1),26-abs(n-n1))\r\n current_lett = i\r\nprint(o)", "exhibit_name = input()\r\n\r\n\r\ntotal_rotaions = 0\r\ncurrent_char = 'a'\r\n\r\nfor char in exhibit_name:\r\n clockwise = (ord(char) - ord(current_char)) % 26\r\n counterclockwise = 26 - clockwise\r\n\r\n min_rotations = min(clockwise, counterclockwise)\r\n\r\n total_rotaions += min_rotations\r\n\r\n current_char = char\r\n\r\nprint(total_rotaions)", "chars = \"abcdefghijklmnopqrstuvwxyz\"\r\ns = input()\r\ni = chars.index(s[0])\r\nspins = min(i, 26 - i)\r\nfor _ in range(1, len(s)):\r\n j = chars.index(s[_])\r\n if(i < j):\r\n spins += min(i + 26 - j, abs(i - j))\r\n else:\r\n spins += min(26 - i + j, abs(i - j))\r\n i = j\r\nprint(spins)", "etalon, res = 'abcdefghijklmnopqrstuvwxyz', 0\narr = [letter for letter in etalon]\nfor letter in input():\n res += min(pos:=arr.index(letter), 26 - pos)\n arr = arr[pos:] + arr[:pos]\nprint(res)\n\n\n", "str1=input()\r\ns1=0;diff=0\r\nx='a'\r\nfor i in range(len(str1)):\r\n diff=abs(ord(str1[i])-ord(x))\r\n if diff<=13:\r\n s1+=diff\r\n else:\r\n s1+=(26-diff)\r\n x=str1[i]\r\nprint(s1)", "def f():\r\n\ts = 'a' + input()\r\n\trots = 0\r\n\r\n\tfor i in range(1, len(s)):\r\n\t\tx = abs(ord(s[i-1]) - ord(s[i]))\r\n\t\tif x > 13:\r\n\t\t\tx = 26 - x\r\n\t\trots += x\r\n\tprint(rots)\r\n\r\nf()", "#1.5 min so far reading\r\n # bruh you type like a fucking retard \r\n\r\nstring = input()\r\ncurrent = 97\r\nsum = 0\r\nfor i in string:\r\n sum += min(abs(current - ord(i)), 26-abs(current - ord(i)))\r\n current = ord(i) \r\n\r\nprint(sum)", "# 코드포스 731A Night at the Museum\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nalphabet = dict([(chr(i+97), i) for i in range(26)])\r\ns = put().strip()\r\ncnt = 0\r\nidx = 0\r\n\r\nfor i in s:\r\n move = abs(alphabet[i] - idx)\r\n cnt += min(move, 26 - move)\r\n idx = alphabet[i]\r\n\r\nprint(cnt)", "letters_list = [\"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\nname = input().strip()\r\nposition = 0\r\ncount = 0\r\nfor i in name : # salah \r\n pointer = letters_list.index(i) - position\r\n if pointer < 0 :\r\n pointer = pointer * -1\r\n if pointer > 13 : \r\n count = count + (26 - pointer)\r\n position = letters_list.index(i)\r\n else :\r\n count = count + pointer\r\n position = letters_list.index(i)\r\nprint(count)", "pointer = 1\r\nres = 0\r\nword = input()\r\nsteps = 0\r\nletters = ['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 word:\r\n index = letters.index(i) + 1\r\n \r\n way1 = (pointer - index)%26\r\n way2 = (index - pointer)%26\r\n \r\n steps += min( way1 , way2 )\r\n \r\n pointer = index\r\nprint(steps)\r\n ", "import string\n\nlist_alpha=\"abcdefghijklmnopqrstuvwxyz\"\nstart_letter='a'\n\nname =input()\ntotal = 0\nfor x in name:\n if abs(list_alpha.index(x) - list_alpha.index(start_letter)) > 13:\n rot = abs(26 - abs(list_alpha.index(x) - list_alpha.index(start_letter)))\n else:\n rot = abs((list_alpha.index(x) - list_alpha.index(start_letter)))\n total += rot\n start_letter = x\n\n\nprint(total)", "s = input()\r\nsum = 0\r\nz = \"a\"\r\nfor i in s:\r\n x = min(abs(ord(i)-ord(z)),26-abs(ord(i)-ord(z)))\r\n z = i\r\n sum+=x\r\nprint(sum)", "def solve():\r\n s = input()\r\n ans = min(abs(ord(s[0])-ord('a')),26-abs(ord(s[0])-ord('a')))\r\n for i in range(1,len(s)):\r\n ans += min(abs(ord(s[i-1])-ord(s[i])),26-abs(ord(s[i-1])-ord(s[i])))\r\n print(ans)\r\n\r\nt = 1\r\n\r\n#t = int(input())\r\n\r\nfor _ in range(t): solve()", "import string\n\ns = input()\nA = {}\ni = 0\nfor c in string.ascii_lowercase:\n A[c] = i\n i += 1\n\ndef solve(s):\n n = 26\n x, i = 0, 0\n for c in s:\n j = A[c]\n x += min(abs(i-j),n-abs(i-j))\n i = j\n print(x)\n\nsolve(s)\n", "import sys\ninput = sys.stdin.readline\n\nSTR = \"a\" + input().rstrip()\nminRotate = 0\nfor strIndex in range(len(STR)-1) :\n A, B = STR[strIndex], STR[strIndex+1]\n if A == B : continue\n \n R = ord(A) - ord(B)\n RIGHT_ROTATE_COST = R if R > 0 else R + 26\n\n R = ord(B) - ord(A)\n LEFT_ROTATE_COST = R if R > 0 else R + 26\n\n minRotate += min(RIGHT_ROTATE_COST, LEFT_ROTATE_COST)\nprint(minRotate)\n", "def main():\r\n moves = 0\r\n word = input()\r\n previous_letter = 'a'\r\n\r\n for i in word:\r\n moves_if_forward = abs( ( ord(i) -96 ) - ( ord(previous_letter) -96) )\r\n moves_if_backward = 26 - abs ( ( ord(i) - 96 ) - ( ord(previous_letter) - 96) )\r\n \r\n moves += min( moves_if_forward, moves_if_backward )\r\n\r\n previous_letter = i\r\n\r\n print(moves)\r\n\r\nmain()", "import string\r\nstrr=string.ascii_lowercase\r\nn=input()\r\nstart=strr.find('a')\r\nc=0\r\nfor i in n:\r\n if abs(start-strr.find(i))>13:\r\n c+=(26-abs(start-strr.find(i)))\r\n start=strr.find(i)\r\n else:\r\n c+=abs(start-strr.find(i))\r\n start=strr.find(i)\r\nprint(c) ", "a = 'a'+str(input())\r\nans = 0\r\nfor i in range(len(a)-1):\r\n b,c = ord(a[i])-97,ord(a[i+1])-97\r\n ans += min(abs(c-b),26-abs(c-b))\r\nprint(ans)", "s = input()\nabc = ['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']\nnrm = 0\nfor letter in s:\n p = abc.index(letter)\n abc = abc[p:] + abc[:p]\n nrm += min(p, abs(p - 26))\nprint(nrm)\n", "l=[]\r\nfor i in range(97, 123):\r\n l.append(chr(i))\r\nf=input()\r\nb=list(f)\r\ng=0\r\nb.insert(0,\"a\")\r\nfor i in range (int(len(b)-1)):\r\n d=l.index(b[i+1])-l.index(b[i])\r\n if (d**2)>169:\r\n if d<0:\r\n g+=(26+d)\r\n if d>0:\r\n g+=(26-d)\r\n else:\r\n if d<0:\r\n g+=(-d)\r\n if d>=0:\r\n g+=d\r\n\r\nprint(g)\r\n\r\n", "s,data,p,z=input(),list(\"abcdefghijklmnopqrstuvwxyz\"),0,0\r\nfor i in range(len(s)):\r\n d=abs(p-data.index(s[i]))\r\n z+=d if d<=len(data)/2 else len(data)-d\r\n p=data.index(s[i])\r\nprint(z)", "rotation_count = 0\r\nprev_c = 'a'\r\nstring = input()\r\n\r\nfor c in string:\r\n right_rotation = abs(ord(prev_c) - ord(c))\r\n left_rotation = abs(26 - right_rotation)\r\n rotation_count += min(right_rotation, left_rotation)\r\n prev_c = c\r\n\r\nprint(rotation_count)\r\n", "# -*- coding: utf-8 -*-\r\n\r\ns = input()\r\nr = 0\r\nasci = [1,]\r\n\r\nfor ele in s:\r\n asci.extend(ord(letter) - 96 for letter in ele)\r\n \r\nfor i in range(len(s)):\r\n temp1 = abs(asci[i+1]-asci[i])\r\n #print(temp1)\r\n r+= temp1 if temp1<13 else 26 - temp1\r\n #print()\r\n \r\nprint(r)\r\n \r\n ", "from sys import stdin, stdout\r\n\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\ndef get_string(): return stdin.readline().strip()\r\n\r\ndef solve():\r\n s = get_string()\r\n curr = 'a'\r\n ans = 0\r\n for i in s:\r\n ans+=min((ord(i)-ord(curr))%26,26-((ord(i)-ord(curr))%26))\r\n curr=i\r\n stdout.write(str(ans)+\"\\n\")\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n ", "def countercw(a, b):\r\n return 26 - abs(data[prev] - data[i])\r\n\r\ndef cw(a, b):\r\n return abs(data[prev] - data[i])\r\n\r\ndata = {\"a\":1, \"b\":2, \"c\":3, \"d\":4, \"e\":5, \"f\":6, \"g\":7, \"h\":8, \"i\":9, \"j\":10, \"k\":11, \"l\":12, \"m\":13,\r\n \"n\":14, \"o\":15, \"p\":16, \"q\":17, \"r\":18, \"s\":19, \"t\":20, \"u\":21, \"v\":22, \"w\":23, \"x\":24, \"y\":25, \"z\":26}\r\ntext = input()\r\nres = 0\r\nprev = \"a\"\r\nfor i in text:\r\n if abs(data[prev] - data[i]) > 13:\r\n res += countercw(prev, i)\r\n else:\r\n res += cw(prev, i)\r\n prev = i\r\nprint(res)", "value = 97\r\ncount = 0\r\nfor i in map(ord,input()):\r\n c = abs(value-i)\r\n count+=min(c,26-c)\r\n value = i\r\nprint(count)", "n = 0\r\nimport string \r\nlower_alphabet = list(string.ascii_lowercase)\r\nx = list(input())\r\nx.insert(0 , \"a\")\r\n\r\nfor i in range(1,len(x)):\r\n if abs(lower_alphabet.index(x[i]) - lower_alphabet.index(x[i-1])) < 14 :\r\n n += abs(lower_alphabet.index(x[i]) - lower_alphabet.index(x[i-1]))\r\n else :\r\n n += len(lower_alphabet)-abs(lower_alphabet.index(x[i]) - lower_alphabet.index(x[i-1]))\r\nprint(n)\r\n", "import sys\r\n\r\ndef solve():\r\n \r\n smb='a'+str(input())\r\n turns=0\r\n for i in range(len(smb)-1):\r\n \r\n turns+=min(abs(ord(smb[i+1])-ord(smb[i])),\\\r\n abs(ord(smb[i+1])-26-ord(smb[i])),\\\r\n abs(ord(smb[i])-ord(smb[i+1])),\\\r\n abs(ord(smb[i])-26-ord(smb[i+1])))\r\n \r\n print(turns)\r\n return\r\n \r\ndef main():\r\n \r\n #for _ in range(int(input())):\r\n solve()\r\n \r\n\r\nif __name__ == '__main__':\r\n main()", "s= input()\r\ncnt = 0\r\nif abs(97 - ord(s[0])) > 13:\r\n cnt += 26 -abs(97 - ord(s[0]))\r\nelse:\r\n cnt += abs(97 - ord(s[0]))\r\nfor i in range(len(s)-1):\r\n if abs(ord(s[i]) - ord(s[i+1])) > 13:\r\n cnt += 26 -abs(ord(s[i]) - ord(s[i+1]))\r\n else:\r\n cnt += abs(ord(s[i]) - ord(s[i+1]))\r\nprint(cnt)", "s = str(input())\r\ns1 = \"abcdefghijklmnopqrstuvwxyz\"\r\ns2 = \"a\"\r\nsum = 0\r\nfor i in s:\r\n j = s1.find(s2)\r\n k = s1.find(i)\r\n l = abs(j-k)\r\n sum = sum + min(l, 26-l)\r\n s2 = i\r\nprint(sum)", "q='abcdefghijklmnopqrstuvwxyz'\r\na=input()\r\ns=0\r\nfor i in range(1,len(a)):\r\n b=q.index(a[i-1])\r\n c=q.index(a[i])\r\n d=abs(b-c)\r\n e= 26 - q.index(max(a[i - 1],a[i]))\r\n f=q. index(min(a[i - 1], a[i]))\r\n g=e+f\r\n s+=min(d, g)\r\nh=q.index(a[0])\r\ni=26-h\r\nj=min(h,i)\r\nprint(s+j)", "w = input()\r\ncnt = 0\r\nm = 0\r\nprev = 'a'\r\nfor i in w:\r\n m = abs(ord(i) - ord(prev))\r\n if(m <=13):\r\n cnt += m\r\n else:\r\n cnt += abs(26-m)\r\n prev = i\r\nprint(cnt)", "t = input()\r\nt1=[]\r\nfor j in t:\r\n t1.append(ord(j)) #ord tells the ascii number\r\n\r\n\r\nfor i in range(len(t1)):\r\n t1[i] = t1[i] - 96 # bringing numbering to 0\r\n\r\nl3=[abs(min(t1[0]-1, 27 - t1[0]))] #difference between first letter and a\r\n\r\n\r\nfor i in range(len(t1)-1):\r\n c = abs(t1[i+1]-t1[i]) # These three lines show difference between element ans its \r\n d = abs(26+ t1[i+1] - t1[i]) # next element. all values are in abs\r\n e = abs(26- t1[i+1] + t1[i]) #\r\n r = min(c,d,e)\r\n l3.append(r)\r\n \r\nprint(sum(l3))", "w = input()\r\nprev = 0\r\nsteps = 0\r\nfor i in w:\r\n cur = ord(i) - ord('a')\r\n move = abs(prev-cur)\r\n prev = cur\r\n if move <= 13:\r\n steps += move\r\n else:\r\n steps += (26-move)\r\nprint(steps)", "n=input()\r\nc=0\r\na='abcdefghijklmnopqrstuvwxyz'\r\nfor i in range(len(n)):\r\n f=a.find(n[i])\r\n if f>13:\r\n c+=13-f%13\r\n else:\r\n c+=f\r\n a=a[f:]+a[:f]\r\nprint(c)", "\r\ns=input().upper()\r\nk=0\r\nl=65\r\nfor i in s:\r\n k+=min(abs(l-ord(i)),26-abs(l-ord(i)))\r\n l=ord(i)\r\n\r\n\r\nprint(k)\r\n", "s=input()\r\nmaxi=ord('z')\r\nmini=ord('a')\r\n\r\nx=abs(mini-ord(s[0]))\r\ny=26-x\r\ncount=min(x,y)\r\n\r\nfor i in range(0,len(s)-1):\r\n x=abs(ord(s[i])-ord(s[i+1]))\r\n y=26-x\r\n count+=min(x,y)\r\nprint(count)\r\n\r\n", "from collections import defaultdict\r\nv = 1\r\nd= defaultdict(int)\r\nabc = 'abcdefghijklmnopqrstuvwxyz'\r\nfor i in range(len(abc)):\r\n d[abc[i]]=v\r\n v+=1\r\ns='a'+input()\r\nl=0\r\n\r\nfor i in range(1,len(s)):\r\n absv = abs(d[s[i]]-d[s[i-1]])\r\n if absv>13:\r\n a=26-absv\r\n l=l+a\r\n # print(s[i],a)\r\n else:\r\n a=absv\r\n # print(s[i],a)\r\n l=l+a\r\nprint(l)\r\n", "s = input()\r\n\r\ncount = 0\r\nletter = 'a'\r\nfor c in s:\r\n count += min(abs(ord(letter)-ord(c)), 26-abs(ord(letter)-ord(c)))\r\n letter = c\r\nprint(count)\r\n\r\n\r\n", "string = str(input())\r\n\r\ncurrent = \"a\"\r\ntotal = 0\r\n\r\nfor char in string:\r\n current = ord(current)\r\n new = ord(char)\r\n temp_one = abs(new - current)\r\n temp_two = abs(26-temp_one)\r\n \r\n if(temp_one <= temp_two):\r\n total += temp_one\r\n else:\r\n total += temp_two\r\n current = char\r\n \r\nprint(total)\r\n\r\n", "s=input()\nanswer=0\nk=1\nfor i in s:\n result=ord(i)-96\n result1=26-abs(result-k)\n answer+=min(abs(result-k),result1) \n k=result \nprint(answer)\n \t \t\t \t \t\t \t\t \t\t \t\t", "s, res, lst, mx, x = input(), 0, [], 0, 'a'\r\nfor i in range(97, 123): lst.append(chr(i))\r\nfor i in s:\r\n tmp, dem = x, 0\r\n while tmp != i:\r\n if tmp == 'a': tmp = 'z'\r\n else: tmp = chr(ord(tmp) - 1)\r\n dem += 1\r\n mx, tmp = dem, x\r\n dem = 0\r\n while tmp != i:\r\n if tmp == 'z': tmp = 'a'\r\n else: tmp = chr(ord(tmp) + 1)\r\n dem += 1\r\n mx, x = min(mx, dem), i\r\n res += mx\r\nprint(res)", "lettersMap = {}\r\nk = 1\r\nfor c in list(map(chr, range(ord('a'), ord('z') + 1))):\r\n lettersMap[c] = k\r\n k += 1\r\n\r\nstring = input()\r\nd_s = lettersMap[string[0]]\r\ntotal = 0 if string[0] == 'a' else min(abs(1 - d_s), 26 - abs(1 - d_s))\r\nfor idx in range(len(string) - 1):\r\n s, e = lettersMap[string[idx]], lettersMap[string[idx + 1]]\r\n total += min(abs(s - e), 26 - abs(s - e))\r\n\r\nprint(total)", "import string\r\ns = input()\r\ne = string.ascii_lowercase\r\nm = 0\r\nsum = 0\r\nfor i in range(len(s)):\r\n n = e.index(s[i])\r\n p = abs(m - n)\r\n if p > 12:\r\n sum += 26 - p\r\n else:\r\n sum += p\r\n m = n\r\nprint(sum)\r\n", "a=97;b=0;\r\nfor j in map(ord,input()):\r\n\ti=abs(a-j)\r\n\tb+=min(i,26-i)\r\n\ta=j\r\nprint(b)", "from sys import stdin, stdout\r\n\r\ns = stdin.readline().strip()\r\nchar = 'a'\r\nrotations = 0\r\n\r\nfor ch in s:\r\n n = abs(ord(char) - ord(ch))\r\n rotations += min(n, 26 - n)\r\n char = ch\r\n\r\nstdout.write(str(rotations))", "wheel1=list()\r\n\r\ntext=input()\r\nstatic='a'\r\ncount=0\r\nfor i in range(26):\r\n wheel1.append(chr(ord('a')+i))\r\n\r\nfor i in range(len(text)):\r\n tmp=text[i]\r\n count+=min(abs(ord(tmp)-ord(static)),26-abs(ord(tmp)-ord(static)))\r\n static=tmp\r\nprint(count)", "str = input()\r\nc = 0\r\nfor i in range(len(str)):\r\n if i == 0:\r\n # print(ord(str[i])-ord('a'), (ord('a')-ord(str[i])) % 26)\r\n # c += min(ord(abs(str[i])-ord('a')), abs(26-ord('a')-ord(str[i])))\r\n c+=min(abs(ord(str[i])-ord('a')), 26 -\r\n abs((ord('a')-ord(str[i]))))\r\n else:\r\n # print(ord(str[i])-ord(str[i-1]), (ord(str[i-1])-ord(str[i])) % 26)\r\n c += min(abs(ord(str[i])-ord(str[i-1])), 26-abs(ord(str[i-1])-ord(str[i])))\r\n \r\nprint(c)", "import string\r\nalphabet = string.ascii_lowercase\r\nc = 0\r\ncurrent = 0\r\nfor letter in input():\r\n i = alphabet.find(letter)\r\n c += min(abs(i - current), 26 - abs(i - current))\r\n current = i\r\nprint(c)\r\n", "n=input()\r\ncnt=0\r\na=97\r\nfor i in n:\r\n b=abs(ord(i)-a)\r\n cnt+=min(b,26-b)\r\n a=ord(i)\r\nprint(cnt) \r\n", "s=list(input())\ni=0\nfor x,y in zip(s,s[1:]):\n a_p_x=ord(x)-96\n a_p_y=ord(y)-96\n r_p_x=123-ord(x)\n r_p_y=123-ord(y)\n a=abs(a_p_x-a_p_y)\n b=a_p_x+r_p_y-1\n c=r_p_x+a_p_y-1\n i=i+min(a,b,c)\nprint(i+min((123-ord(s[0]),(ord(s[0])-97))))\n \t \t\t\t\t\t\t\t \t \t\t\t \t\t \t \t\t", "c = 97\r\ns = 0\r\nword = input()\r\nfor x in word:\r\n\tk = abs(c-ord(x))\r\n\ti = min(k, 26-k)\r\n\ts += i\r\n\tc=ord(x)\r\nprint(s)", "o='a'\r\np=0\r\ns=input()\r\nfor i in s:\r\n p+=min(abs(ord(o)-ord(i)),26-abs(ord(o)-ord(i)))\r\n o=i\r\nprint(p)", "# URL: https://codeforces.com/problemset/problem/731/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\nans = 0\npre = ord('a')\nfor x in inp():\n ans += min(abs(pre - x), 26 - abs(pre - x))\n pre = x\nout(f\"{ans}\")\n", "d={'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8, 'i': 9, 'j': 10, 'k': 11, 'l': 12, 'm': 13, 'n': 14, 'o': 15, 'p': 16, 'q': 17, 'r': 18, 's': 19, 't': 20, 'u': 21, 'v': 22, 'w': 23, 'x': 24, 'y': 25, 'z': 26}\r\nx=input()\r\nc=0\r\ncurr='a'\r\nfor i in x:\r\n idd=d[i]\r\n currd=d[curr]\r\n p1=abs(currd-idd)\r\n p2=(abs(currd-idd))*-1\r\n if p1%26<p2%26:\r\n c+=(p1%26)\r\n else:\r\n c+=(p2%26)\r\n curr=i\r\nprint(c)", "def night_at_the_museum():\n a = input()\n s = 0\n previous_letter = \"a\"\n for i in a:\n s = s+min((26-abs(ord(previous_letter)-ord(i))),(abs(ord(previous_letter)-ord(i))))\n previous_letter = i\n print(s)\nnight_at_the_museum()", "name = input()\r\n\r\nletters = \"abcdefghijklmnopqrstuvwxyz\"\r\nptr = 0\r\n\r\ntotal_rotations = 0\r\nfor char in name:\r\n rot = 0\r\n while rot < 14:\r\n n_ptr = (ptr + rot) % 26\r\n if letters[n_ptr] == char:\r\n total_rotations += rot\r\n ptr = n_ptr\r\n break\r\n rot += 1\r\n if letters[ptr] == char:\r\n continue\r\n rot = 0\r\n while rot < 14:\r\n n_ptr = ptr - rot if ptr - rot >= 0 else 26 + ptr - rot\r\n if letters[n_ptr] == char:\r\n total_rotations += rot\r\n ptr = n_ptr\r\n break\r\n rot += 1\r\nprint(total_rotations)\r\n", "s = input()\r\ncurr_pos = 1\r\nalphas = 'abcdefghijklmnopqrstuvwxyz'\r\nrotates = 0\r\nfor char in s:\r\n i = alphas.index(char) + 1\r\n cl = (26 - (curr_pos - i)) % 26\r\n anticl = 26 - cl\r\n sm = min(cl, anticl)\r\n rotates += sm\r\n curr_pos = alphas.index(char) + 1\r\nprint(rotates)", "s=input()\r\nsum=0\r\nlastLetterPos='a'\r\nfor i in s:\r\n tmp1= (ord(i)-ord(lastLetterPos))%26\r\n tmp2= (ord(lastLetterPos)-ord(i))%26\r\n # print(tmp1,tmp2)\r\n lastLetterPos = i\r\n sum = sum + min(tmp1,tmp2)\r\nprint(sum)", "s = int()\r\nref_wheel = int(97)\r\n \r\nfor d in input() :\r\n \r\n if ord(d) == ref_wheel :\r\n continue\r\n elif ord(d) < ref_wheel :\r\n s += min( ref_wheel - ord(d), (ord(d) - 97) + (123 - ref_wheel) )\r\n ref_wheel = ord(d)\r\n continue\r\n else :\r\n s += min(ord(d) - ref_wheel, (ref_wheel - 97) + (123 - ord(d)) )\r\n ref_wheel = ord(d)\r\n continue\r\n \r\nprint(s)", "def get_min(x, y):\r\n if x < y:\r\n return x\r\n return y\r\n\r\nkey = input()\r\nlength = len(key)\r\nalphabet = \"abcdefghijklmnopqrstuvwxyz\"\r\ncurr = answer = 0\r\nfor i in range(length):\r\n ind = alphabet.index(key[i])\r\n path1 = abs(ind - curr)\r\n path2 = 26 - path1\r\n answer += get_min(path1, path2)\r\n curr = ind\r\nprint(answer)", "x=input()\r\ns=\"a\"\r\nsum=0\r\nfor i in x:\r\n g=min(((ord(s)-ord(i))+26)%26,((ord(i)-ord(s))+26)%26)\r\n sum+=g\r\n s=i\r\nprint(sum)", "arr=list(map(chr, range(97, 123)))\r\na=input()\r\npointer=0\r\ntotal=0\r\nfor i in a:\r\n total=total+min(abs(arr.index(i)-pointer),abs(26-arr.index(i)+pointer) ,abs(26-pointer+arr.index(i)))\r\n pointer=arr.index(i) \r\nprint(total) \r\n", "s = input()\r\ncurr = 0\r\nres = 0\r\nfor c in s:\r\n dist = abs(ord(c) - ord('a') - curr)\r\n res += min(dist, 26 - dist)\r\n curr = ord(c) - ord('a')\r\nprint(res)", "c = 97;s = 0\r\nfor j in map(ord, input()):\r\n\ti = abs(c - j)\r\n\ts += min(i, 26 - i)\r\n\tc = j\r\nprint(s)", "text = input()\r\nsum = 0\r\nstart = ord(\"a\")\r\nfor i in range(len(text)):\r\n if ord(text[i]) >= start:\r\n sum += min(start - 97 + 123 - ord(text[i]), ord(text[i])-start)\r\n else:\r\n sum += min(start - ord(text[i]), 123 - start + ord(text[i]) - 97)\r\n start = ord(text[i])\r\n \r\nprint(sum)", "s = input()\r\ncount = 0\r\ni = 0\r\nd = {'a': 1, 'c': 3, 'b': 2, 'e': 5, 'd': 4, 'g': 7, 'f': 6, 'i': 9, 'h': 8, 'k': 11, 'j': 10, 'm': 13, 'l': 12, 'o': 15, 'n': 14, 'q': 17, 'p': 16, 's': 19, 'r': 18, 'u': 21, 't': 20, 'w': 23, 'v': 22, 'y': 25, 'x': 24, 'z': 26}\r\nk = min(abs(d[s[i]]-d['a']) ,26-abs((d[s[i]]-d['a'])))\r\ncount+=k\r\ni+=1\r\nwhile(i<len(s)):\r\n k = min(abs(d[s[i]]-d[s[i-1]]) ,26-abs((d[s[i]]-d[s[i-1]])))\r\n count+=k\r\n i+=1\r\nprint(count)", "al=[\"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=list(map(str,input()))\r\nc=0\r\nstart=0\r\nfor i in s:\r\n pos=al.index(i)\r\n forward=abs(start-pos)\r\n backward=abs(len(al)-forward)\r\n c+=min(forward,backward)\r\n start=pos\r\nprint(c)", "def rotations_required(name):\r\n current_letter = 'a'\r\n total_rotations = 0\r\n\r\n for letter in name:\r\n clockwise_distance = abs(ord(letter) - ord(current_letter))\r\n counterclockwise_distance = 26 - clockwise_distance\r\n total_rotations += min(clockwise_distance, counterclockwise_distance)\r\n current_letter = letter\r\n\r\n return total_rotations\r\n\r\ndef main():\r\n name = input().strip()\r\n min_rotations = rotations_required(name)\r\n print(min_rotations)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a=0\r\nb=97\r\nfor i in input():\r\n x=abs(ord(i)-b)\r\n a+=min(x,26-x)\r\n b=ord(i)\r\nprint(a)", "s = input()\r\nc = 0\r\nif s[0] <= 'a':\r\n x = ord('a') - ord(s[0])\r\n if x <= 13:\r\n c += x\r\n else:\r\n x += 26 - x\r\nelse:\r\n x = ord(s[0]) - ord('a')\r\n if x <= 13:\r\n c += x\r\n else:\r\n c += 26 - x\r\nfor i in range(len(s)-1):\r\n if s[i] <= s[i+1]:\r\n x = ord(s[i]) - ord(s[i+1]) + 26\r\n if x <= 13:\r\n c += x\r\n else:\r\n c += 26 - x\r\n else:\r\n x = ord(s[i+1]) - ord(s[i]) + 26\r\n if x <= 13:\r\n c += x\r\n else:\r\n c += 26 - x\r\nprint(c)\r\n", "s=input()\r\nc,f=0,1\r\nfor i in s:\r\n\to=ord(i)-96\r\n\tc+=min(abs(f-o),26-abs(f-o))\r\n\tf=o\r\nprint(c)", "n = [*input()]\n\ncount = 0\nlist1 = []\nif n[0] == 'a':\n list1.append(0)\nelse:\n if abs(ord('a') - ord(n[0])) >= 26 - abs(ord('a') - ord(n[0])):\n list1.append(26 - abs(ord('a') - ord(n[0])))\n else:\n list1.append(abs(ord('a') - ord(n[0])))\n\n\nfor i in range(len(n)-1):\n if abs(ord(n[i]) - ord(n[i+1])) >= 26 - abs(ord(n[i]) - ord(n[i+1])):\n list1.append(26 - abs(ord(n[i]) - ord(n[i+1])))\n else:\n list1.append(abs(ord(n[i]) - ord(n[i+1])))\n\nprint(sum(list1))\n", "s = input()\r\nans = 0 \r\np = 'a'\r\nfor i in s:\r\n f = abs(ord(i) - ord(p))\r\n if(f > 13):\r\n ans += 26 % f \r\n else:\r\n ans += f \r\n p = i\r\nprint(ans)", "r = 'a'\r\nx = input()\r\nz = 0\r\n \r\nfor i in x:\r\n y = abs(ord(i) - ord(r))\r\n z += min(y,26-y)\r\n r = i\r\nprint(z)", "a=0\r\na1=97\r\nfor i in input():\r\n x=abs(ord(i)-a1)\r\n a+=min(x,26-x)\r\n a1=ord(i)\r\nprint(a)", "s = 'a' + input()\r\nk = 0\r\nfor i in range(1, len(s)):\r\n p = abs(ord(s[i - 1]) - ord(s[i]))\r\n k += min(p, 26 - p)\r\nprint(k)", "a=input()\r\nm,s=0,0\r\nfor i in range(len(a)):\r\n ind=ord(a[i])-97\r\n w=abs(s-ind)\r\n if w<13:\r\n m+=w\r\n else:\r\n m+=26-w\r\n s=ind\r\nprint(m)", "s=input()\r\nprev=ord('a')\r\nt=0\r\nfor i in s:\r\n diff=abs(ord(i)-prev)\r\n if diff>13:\r\n t+=abs(26-diff)\r\n else:\r\n t+=diff\r\n prev=ord(i)\r\nprint(t)", "name = input()\r\ncurrent = \"a\"\r\nturns = 0\r\ntotalTurns = 0\r\nfor i in name:\r\n turns = abs(ord(i) - ord(current))\r\n totalTurns += min(turns , 26 - turns)\r\n current = i\r\nprint(totalTurns)\r\n", "a = input()\r\nx = 0\r\nk = 1\r\nfor i in a:\r\n b = ord(i) - 96\r\n if abs(b - k) < 26-abs(b - k):\r\n x += abs(b - k)\r\n else:\r\n x += 26-abs(b - k)\r\n k = b\r\n\r\nprint(x)", "from sys import stdin\r\ns = stdin.readline().rstrip()\r\ncurr = 0\r\nans = 0\r\nfor i in range(len(s)):\r\n\tvalue = ord(s[i])-97\r\n\tans += min(abs(value-curr),26-abs(value-curr))\r\n\tcurr = value\r\nprint(ans)", "c=97\ns=0\n\na = input()\naa = map(ord,a)\n\nfor x in aa:\n\ti=abs(c-x)\n\ts+=min(i,26-i)\n\tc=x\n\nprint(s)\n\t\t \t \t \t \t \t\t \t\t \t \t", "\n\n\nx = [ '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\nstring1 = \"a\" + (str(input()))\n\n\n\n\t\ny = 0\n\t\nfor z1 in range(len(string1) - 1 ) :\n\t\n\t\n\t\t\n\t\n\tif ( len(string1) > 0 ) :\n\t\t\n\t\ts1 = x.index( string1[ z1 ] )\n\t\ts2 = x.index( string1[ z1 + 1 ] )\n\t\t\n\t\ts3 = ( len(x) - abs( s1 - s2 ) )\n\t\ts4 = abs( ( s1 - len(x) ) + abs( s2 - len(x) ) )\n\t\t\n\t\tif ( s3 <= s4 ) :\n\t\t\t\n\t\t\ty = y + s3\n\t\t\t\n\t\tif ( s3 > s4 ) :\n\t\t\t\n\t\t\ty = y + s4\n\t\t\t\nprint(y)\n\t\t\t\n\t\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\t\t\t\n\n\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t\n\t\t\n\t\t\t\n\t\t\t\n\t\t\n\t\t\n\t\t", "s=input()\r\nl=['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\nk=0\r\nc=0\r\nfor i in range(len(s)):\r\n a=l.index(s[i])\r\n k=min(26-a,a)\r\n l=l[a:]+l[:a]\r\n c=c+k\r\nprint(c)", "import math\r\ndef getMin(i,f):\r\n if i == f :\r\n return 0\r\n return min( abs(ord(f) - ord(i)) , 26 - abs(ord(f) - ord(i)) )\r\n \r\ndef solve(s):\r\n ans = 0\r\n curr = 'a'\r\n for i in s:\r\n ans += getMin( i,curr )\r\n # print(ans)\r\n curr = i\r\n return ans\r\n# n,k = map(int,input().split())\r\n# a = int(input())\r\n# b = int(input())\r\n# c = int(input())\r\n# l = list(map(int,input().split()))\r\ns = input()\r\nprint(solve(s))\r\n\r\n\r\n\r\n\r\n", "def solve(F):\r\n pre = 0;S=0\r\n L=f\"{''.join([chr(i) for i in range(97,123)])}\"\r\n for e in F:\r\n if abs(L.index(e)-pre) <=13:\r\n S=S+abs((L.index(e))-pre)\r\n else:\r\n S=S+26-abs((L.index(e))-pre)\r\n pre = L.index(e)\r\n return(S)\r\nprint(solve(input()))", "\r\nalphabet=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\nname=input()\r\n\r\ncurrentPosition=0\r\nnumberOfRotations=0\r\ndef tour_directe(nombre,depart,arrive): #(25,25,0)\r\n if depart<=arrive:\r\n return arrive-depart\r\n else:\r\n return arrive-depart+nombre\r\n\r\n\r\n\r\n\r\nfor i in name:\r\n arrive=alphabet.index((i))\r\n depart=currentPosition\r\n if tour_directe(25,depart,arrive) < tour_directe(26,arrive,depart):\r\n #print(\"directe\")\r\n numberOfRotations+=tour_directe(26,depart,arrive)\r\n else:\r\n numberOfRotations += tour_directe(26,arrive,depart)\r\n #print(\"indirecte\")\r\n currentPosition=alphabet.index(i)\r\nprint(numberOfRotations)", "current_ord = ord(\"a\") # = 97\r\nNUM_ALPHA = 26 # 26 letters a-z\r\n\r\nanswer = 0\r\nstring = input()\r\n\r\nfor c in string:\r\n _ord_c = ord(c)\r\n dist = abs(_ord_c - current_ord)\r\n answer += min(dist, NUM_ALPHA - dist)\r\n current_ord = _ord_c\r\n\r\nprint(answer)", "nodes = {\r\n 'a' : ['z','b'], \r\n 'b' : ['a','c'],\r\n 'c' : ['b','d'],\r\n 'd' : ['c','e'],\r\n 'e' : ['d','f'],\r\n 'f' : ['e','g'], \r\n 'g' : ['f','h'],\r\n 'h' : ['g','i'], \r\n 'i' : ['h','j'],\r\n 'j' : ['i','k'], \r\n 'k' : ['j','l'], \r\n 'l' : ['k','m'], \r\n 'm' : ['l','n'], \r\n 'n' : ['m','o'], \r\n 'o' : ['n','p'],\r\n 'p' : ['o','q'],\r\n 'q' : ['p','r'],\r\n 'r' : ['q','s'],\r\n 's' : ['r','t'],\r\n 't' : ['s','u'], \r\n 'u' : ['t','v'],\r\n 'v' : ['u','w'], \r\n 'w' : ['v','x'],\r\n 'x' : ['w','y'],\r\n 'y' : ['x','z'], \r\n 'z' : ['y','a']\r\n}\r\n\r\ndef get_distance(target_node, start_point):\r\n result = []\r\n if target_node == start_point:\r\n return 0\r\n \r\n for i in range(2):\r\n distance = 0\r\n current_node = start_point\r\n \r\n while nodes[current_node][i] != target_node:\r\n distance += 1\r\n current_node = nodes[current_node][i]\r\n \r\n result.append(distance+1)\r\n\r\n return min(result)\r\ndef solve(word):\r\n minimum_distance = 0\r\n\r\n for i in range(len(word)):\r\n if i == 0:\r\n current = 'a'\r\n else:\r\n current = word[i-1]\r\n \r\n minimum_distance += get_distance(word[i], current)\r\n \r\n return minimum_distance\r\n \r\n\r\n \r\nx=input()\r\ny=solve(x)\r\nprint(y)", "def distance_between_characters(ch1, ch2):\r\n distance_clockwise = abs(ord(ch1) - ord(ch2))\r\n distance_counterclockwise = 26 - distance_clockwise\r\n return min(distance_counterclockwise, distance_clockwise)\r\n\r\n\r\ncurrent_ch = 'a'\r\ns = input()\r\n\r\ntotal_steps = 0\r\n\r\nfor ch in s:\r\n total_steps += distance_between_characters(current_ch, ch)\r\n current_ch = ch\r\n\r\nprint(total_steps)\r\n", "a=input()\r\na=\"a\"+a\r\ng=0\r\nfor i in range(0,len(a)-1):\r\n if abs(ord(a[i])-ord(a[i+1]))>26-abs(ord(a[i])-ord(a[i+1])):\r\n g+=26-abs(ord(a[i])-ord(a[i+1]))\r\n else:\r\n g+=abs(ord(a[i])-ord(a[i+1]))\r\nprint(g)\r\n", "def jarak(s1,s2) :\r\n a = ord(s1)-96\r\n b = ord(s2)-96\r\n if b>=a :\r\n return min(b-a,a+26-b)\r\n else :\r\n return min(a-b,b+26-a)\r\ns = input()\r\nn = len(s)\r\nans = jarak(\"a\",s[0])\r\nfor i in range(1,n) :\r\n ans+=jarak(s[i],s[i-1])\r\nprint(ans)\r\n", "\r\nword = input()\r\nanswer = 0\r\nprev = 'a'\r\nfor letter in word:\r\n inc = abs(ord(letter) - ord(prev))\r\n answer += min(abs(26 - inc), inc)\r\n prev = letter\r\nprint(answer)\r\n ", "s = input() \r\ncurrent = ord('a')\r\nrotations = 0 \r\nfor c in s:\r\n target = ord(c)\r\n dist_right = (target - current) % 26\r\n dist_left = (current - target) % 26\r\n rotations += min(dist_right, dist_left)\r\n current = target\r\n\r\nprint(rotations)\r\n", "z=input()\r\npoint=97\r\nsteps=0\r\nfor i in range(len(z)):\r\n if abs(ord(z[i])-point) <= 13 :\r\n steps += abs(ord(z[i])-point)\r\n point=ord(z[i])\r\n else:\r\n steps+=26-abs(ord(z[i])-point)\r\n point=ord(z[i])\r\nprint(steps)\r\n", "s = input()\r\nstar = ord(\"a\")\r\n\r\nx = abs(star - ord(s[0]))\r\ny = 26 - x\r\n\r\ncount = min( x , y )\r\nfor i in range(len(s) -1 ):\r\n x = abs(ord( s[i] ) - ord( s[i+1] ) )\r\n y = 26 - x\r\n count += min(x , y)\r\n\r\nprint(count)", "s=input()\r\ncheck=ord('a')\r\nrot=0\r\nfor i in range(len(s)):\r\n diff=abs(check-ord(s[i]))\r\n if diff >13:\r\n diff=26-diff\r\n rot+=diff\r\n check=ord(s[i])\r\nprint(rot)", "def indd(m):\r\n alphabets = \"abcdefghijklmnopqrstuvwxyz\"\r\n index = 0\r\n while index < 26:\r\n if alphabets[index] == m:\r\n return index + 1\r\n index = index + 1\r\n\r\ndef abss(n):\r\n if n < 0:\r\n return (-1) * n\r\n return n\r\n\r\ndef dist(m, n):\r\n v = abss(indd(m) - indd(n))\r\n u = 26 - v\r\n if v > u:\r\n return u\r\n return v\r\n\r\ns = input()\r\ni = 1\r\nval = dist('a', s[0])\r\nwhile i < len(s):\r\n val = val + dist(s[i], s[i - 1])\r\n i = i + 1\r\nprint(val)", "s = input()\r\ni = 'a'\r\na = 0\r\nb = 0\r\nfor j in s:\r\n a = abs(ord(i)-ord(j))\r\n b = b + min(a, 26-a)\r\n i = j\r\nprint(b) ", "# https://codeforces.com/contest/731/problem/A\n\ns=input()\n\nall=['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\ni=0\np=0\ncout=0\n# zeus\nwhile i<len(s):\n\n idx=all.index(s[i])\n if idx>p:\n z= len(all)-idx+p\n if z<13:\n cout += z\n else:\n cout += len(all)-z\n i+=1\n p=idx\n\n elif idx<p:\n z= len(all)-p+idx\n if z<13:\n cout += z\n else:\n cout += len(all)-z\n i+=1\n p=idx\n else:\n cout+=0\n i+=1\nprint(cout)\n ", "import math\r\n\r\n# test = int(input())\r\n# for q in range(test):\r\n# n, m = map(int, input().split())\r\n# n = int(input())\r\ns = input()\r\nx = 0\r\na = \"a\"\r\nfor i in range(len(s)):\r\n x += min((ord(s[i])-ord(a))%26, 26 - ((ord(s[i])-ord(a))%26) )\r\n a = s[i]\r\nprint(x)", "s=input()\r\nans=0\r\ncur='a'\r\nfor i in s:\r\n tmp=ord(i)-ord(cur)\r\n if tmp<0:\r\n tmp+=26\r\n if tmp>13:\r\n ans+=26-tmp\r\n else:\r\n ans+=tmp\r\n cur=i\r\nprint(ans)", "# import sys\r\n\r\n# sys.stdin = open('./input.txt', 'r')\r\n# sys.stdout = open('./output.txt', 'w')\r\n\r\ns = input()\r\nl = {chr(x): x-96 for x in range(97, 123)}\r\nresult = 0\r\nindex = 1\r\nfor i in s:\r\n forward = abs(l[i] - index)\r\n backward = 26 - forward\r\n if forward < backward:\r\n result += forward\r\n else:\r\n result += backward\r\n index = l[i]\r\nprint(result)", "s=input()\r\ncm=0\r\nhd=\"a\"\r\nfor c in s :\r\n if c==hd:\r\n continue\r\n else:\r\n n=abs(ord(c)-ord(hd))\r\n cm+=min(n,26-n)\r\n hd=c\r\nprint(cm)", "import string\r\n\r\n\r\ndef solve(l):\r\n\r\n t = list(string.ascii_lowercase)\r\n\r\n count = 0\r\n for i in range(len(l)-1):\r\n dif = abs(t.index(l[i+1]) - t.index(l[i]))\r\n if dif > 13:\r\n count += 26-dif\r\n else:\r\n count += dif\r\n\r\n return count\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\r\n l = list(input())\r\n l.insert(0, 'a')\r\n print(solve(l))\r\n", "def split(string, sep=\" \"):\n prev = 0\n for i, char in enumerate(string):\n if char == sep:\n if i != prev:\n yield string[prev:i]\n prev = i + 1\n\n ret = string[prev:]\n if ret:\n yield ret\n\ns = input()\nprev = ord(\"a\")\nrot = 0\n\nfor c in s:\n co = ord(c)\n r = abs(prev - co)\n if r > 13:\n r = 26 - r\n rot += r\n prev = co\n\nprint(rot) \n", "letters = ''.join([chr(i) for i in range(97, 123)])\r\nword = input()\r\nresult = 0\r\npos = 0\r\nfor letter in word:\r\n indx = letters.find(letter)\r\n l, r = abs(26-abs(pos-indx)), abs(indx-pos)\r\n result += min(l, r)\r\n pos = indx\r\nprint(result)", "import sys\r\n\r\nword = sys.stdin.readline().lower()\r\nlst = []\r\nmoves = 0\r\nfor i in word:\r\n lst.append(ord(i) - 97)\r\nlst.remove(lst[-1])\r\nst =0\r\nfor i in range(len(lst)):\r\n if abs(st - lst[i]) < 13:\r\n moves += abs(st - lst[i])\r\n else:\r\n moves += 26 - abs(st - lst[i])\r\n st = lst[i]\r\nprint(moves)", "s = input()\r\n\r\nabc = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\nm = 0\r\n\r\nind = 0\r\n\r\nfor i in s:\r\n\r\n d = 0\r\n\r\n for j in range (26):\r\n\r\n if i != abc[ind]:\r\n\r\n ind += 1\r\n\r\n d += 1\r\n\r\n if ind > 25:\r\n \r\n ind = 0\r\n\r\n else:\r\n break\r\n\r\n if d > 13:\r\n\r\n m = m + 26 - d\r\n \r\n else:\r\n \r\n m = m + d\r\n\r\nprint(m)", "name = input()\r\nalphabets = 'abcdefghijklmnopqrstuvwxyz'\r\ntotal = 0\r\ncurrent_position = 0\r\nactual_position = 0\r\n\r\nfor i in name:\r\n forward = 0\r\n backward = 0\r\n minimum = float(\"inf\")\r\n actual_position = alphabets.index(i)\r\n forward = abs(actual_position - current_position)\r\n backward = 26 - abs(actual_position - current_position)\r\n\r\n if forward < backward:\r\n minimum = forward\r\n elif forward >= backward:\r\n minimum = backward\r\n\r\n total += minimum\r\n current_position = actual_position\r\n\r\nprint(total)\r\n", "def solve():\r\n x = \"abcdefghijklmnopqrstuvwxyz\"\r\n a = 0\r\n \r\n string = input()\r\n z = \"a\"+string\r\n for i in range(len(z)-1):\r\n b = abs((x.index(z[i])+1)-(x.index(z[i+1])+1))\r\n if b >= 13:\r\n a+=(26-b)\r\n else:\r\n a+=b\r\n \r\n \r\n \r\n\r\n print(a)\r\n#case = int(input())\r\n#for _ in range(case):\r\nsolve()\r\n", "def run_code():\r\n msg = input()\r\n\r\n \"\"\"\r\n 1. от a до z (1 поворот против часовой стрелки),\r\n 2. от z до e (5 поворотов по часовой стрелке),\r\n 3. от e до u (10 поворотов против часовой стрелки),\r\n 4. от u до s (2 поворотa против часовой стрелки)\r\n \"\"\"\r\n\r\n prev = 'a'\r\n total = 0\r\n for i in range(len(msg)):\r\n if ord(prev) - ord(msg[i]) > 0:\r\n num = ord(prev) - ord(msg[i])\r\n else:\r\n num = ord(msg[i]) - ord(prev)\r\n\r\n total += 26 - num if num > 12 else num\r\n prev = msg[i]\r\n\r\n print(total)\r\n\r\n\r\nif __name__ == '__main__':\r\n run_code()\r\n", "constant=97\r\nanswer=0\r\nfor x in map(ord, input()):\r\n places=abs(constant-x)\r\n i=min(places, 26-places)\r\n answer+=i\r\n constant=x\r\nprint(answer)", "\r\n\r\nstring = input()\r\ncur = 'a'\r\nans = 0\r\nfor i in range(len(string)):\r\n temp = abs(ord(cur) - ord(string[i]))\r\n if temp > 13:\r\n ans += 26 - temp\r\n else:\r\n ans += temp\r\n cur = string[i]\r\n\r\nprint(ans)", "inputStr = input()\r\nrotationsCnt = 0\r\nstartChar = 'a'\r\nfor char in inputStr:\r\n rotationsCnt += min(abs(ord(startChar)-ord(char)),26-abs(ord(startChar)-ord(char)))\r\n startChar = char\r\nprint(rotationsCnt)", "c=0 ;x='a'\r\nfor i in str(input()):c+=min(abs(ord(x)-ord(i)),26-abs(ord(x)-ord(i))) ; x=i\r\nprint(c)", "a=input()\r\ns=0\r\nt=ord(\"a\")\r\nfor i in range(len(a)):\r\n #a=list(map(int,input().split()))\r\n k=abs(ord(a[i])-t)\r\n if(k>13):\r\n k=26-k\r\n s+=k\r\n else:\r\n s+=k\r\n t=ord(a[i]) \r\nprint(s)\r\n", "#NightattheMuseum\r\n\r\nalphabetList = []\r\nfor value in range(96,(97+26)):\r\n\r\n\talphabetList.append(chr(value))\r\n\r\n# ?print(alphabetList)\r\n\r\nexhibit = input()\r\nResult = 0\r\npointerValue1 = 1\r\nfor letter in exhibit:\r\n\r\n\t\r\n\tindexvalue = alphabetList.index(letter)\r\n\r\n\tvalue1 = abs((pointerValue1 - indexvalue))\r\n\tvalue2 = abs(value1 - 26)\r\n\r\n\tif(value1 > value2):\r\n\t\tResult +=value2\r\n\telse:\r\n\t\tResult +=value1\r\n\t\r\n\tpointerValue1 = indexvalue\r\n\r\n\t\r\n\t\r\n\r\n\r\n\t\r\n\t\r\n\r\n\t\r\n# print(\"-----------\")\r\nprint(Result)\r\n\r\n\r\n\r\n", "s = input()\r\ncurrent_pos = ord('a')\r\ntotal_rotations = 0\r\n\r\nfor c in s:\r\n distance = abs(ord(c) - current_pos)\r\n total_rotations += min(distance, 26 - distance)\r\n current_pos = ord(c)\r\n\r\nprint(total_rotations)\r\n", "def solve():\r\n s = input()\r\n l = len(s)\r\n cur,sum = 97,0\r\n for x in s:\r\n d = abs(ord(x) - cur)\r\n sum += min(26-d, d)\r\n cur = ord(x)\r\n print(sum)\r\n\r\nT = 1\r\n# T = int(input())\r\nfor _ in range(T):\r\n solve()", "s=input()\r\nsteps=0\r\ncurrent=0\r\nfor i in s:\r\n index=ord(i)-ord('a')\r\n if abs(current-index)>13:\r\n steps=steps+(26-abs(current-index))\r\n else:\r\n steps=steps+abs(current-index)\r\n\r\n \r\n current=index\r\nprint(steps)\r\n\r\n", "liste=['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\nch=input()\r\nref='a'\r\nnb=0\r\nwhile ch:\r\n ref_ind=liste.index(ref)\r\n comp=ch[0]\r\n com_ind=liste.index(comp)\r\n if ref_ind>com_ind:\r\n if (ref_ind-com_ind)>13:\r\n nb+=26-(ref_ind-com_ind)\r\n else:\r\n nb+=ref_ind-com_ind\r\n else:\r\n if (com_ind-ref_ind)>13:\r\n nb+=(26-com_ind)+ref_ind\r\n else:\r\n nb+=com_ind-ref_ind \r\n ref=ch[0]\r\n ch=ch[1:]\r\nprint(nb)", "letters = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\ndef getsmaller(n1,n2,t):\r\n x = abs(n1- n2)\r\n y = t- abs(n1-n2)\r\n\r\n return min(x,y)\r\n\r\nword = input(\"\")\r\nn1 = 0\r\nn2 = letters.index(word[0])\r\nnum = 0\r\nfor i in word[1:]:\r\n num+=getsmaller(n1,n2,26)\r\n n1 = n2\r\n n2 = letters.index(i)\r\nnum+=getsmaller(n1,n2,26)\r\n\r\nprint(num)\r\n\r\n", "def Night_at_the_Museum(name) :\r\n alpha = [\"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\n sumRank = 0\r\n point = 1\r\n for i in name :\r\n rank1 = ( alpha.index(i) + 1 ) - point \r\n rank2 = point - ( alpha.index(i) + 1 ) \r\n\r\n if rank1 < 0 :\r\n rank1 += len(alpha)\r\n elif rank2 < 0 :\r\n rank2 += len(alpha)\r\n\r\n if rank1 >= rank2 :\r\n sumRank += rank2\r\n elif rank1 < rank2 :\r\n sumRank += rank1\r\n else :\r\n print(\"Error\")\r\n\r\n point = ( alpha.index(i) + 1 )\r\n\r\n return sumRank\r\n\r\nname = input().strip().lower()\r\nprint(Night_at_the_Museum(name))", "def minMove(a, b):\r\n clockright = abs(ord(b) - ord(a))\r\n clockleft = abs(26 - clockright)\r\n return min(clockleft, clockright)\r\n\r\nip = input()\r\nr = minMove(\"a\", ip[0])\r\nfor i in range(0, len(ip)):\r\n if(i == len(ip) - 1):\r\n continue\r\n else:\r\n r += minMove(ip[i], ip[i+1])\r\nprint(r)\r\n\r\n", "x= 'a' + input()\r\nalpha =[chr(i)for i in range(97,123)]\r\nvalue = 0\r\nfor i in range(len(x)-1):\r\n y = abs(alpha.index(x[i])-alpha.index(x[i+1]))\r\n if y>=13:\r\n y=26-y\r\n value += y\r\nprint(value)", "import string\r\nl = string.ascii_lowercase\r\nl = [i for i in l]\r\n\r\nS = input()\r\ntemp = 'a'\r\n\r\n\r\nnum = 0\r\nfor s in S:\r\n g = abs(l.index(s) - l.index(temp))\r\n h = abs(26 - g)\r\n if g <= h and g>=0:\r\n num += g\r\n elif h <= g and h>=0:\r\n num += h\r\n temp = s\r\n #print(g,h,temp)\r\n \r\nprint(num)\r\n", "s=input()\nx=ord('a')\nans=0\nfor i in range(0, len(s)):\n y=ord(s[i])\n mn=10**18\n if y>=x: mn=min(mn, y-x)\n else: mn=min(mn, x-y)\n mn=min(mn, ord('z')-x+y-ord('a')+1)\n mn=min(mn, x-ord('a')+1+ord('z')-y)\n x=ord(s[i])\n ans=ans+mn\nprint(ans)\n\n\t\t\t \t \t \t \t\t\t \t \t\t \t\t \t \t", "str1 = input()\r\n\r\ncur = 0\r\nans = 0\r\na = ord('a')\r\nfor ch in str1:\r\n ans += min((cur-(ord(ch)-a))%26, ((26-cur)+(ord(ch)-a))%26)\r\n cur = ord(ch) - a\r\n \r\nprint(ans)\r\n", "string = input()\r\n\r\nalph = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nmoves = 0\r\nprev = \"a\"\r\nfor char in string:\r\n if (26-abs(alph.index(char)-alph.index(prev))) > (abs(alph.index(char)-alph.index(prev))):\r\n moves += (abs(alph.index(char)-alph.index(prev)))\r\n prev = char\r\n elif(26-abs(alph.index(char)-alph.index(prev))) == (abs(alph.index(char)-alph.index(prev))):\r\n moves += (abs(alph.index(char)-alph.index(prev)))\r\n prev = char\r\n elif(26-abs(alph.index(char)-alph.index(prev))) < (abs(alph.index(char)-alph.index(prev))):\r\n moves += (26-abs(alph.index(char)-alph.index(prev)))\r\n prev = char\r\nprint(moves)", "import sys\n\nword = list(sys.stdin.readline())[0:-1]\n\nletterNumbers = {\n \"a\" : 1,\n \"b\" : 2,\n \"c\" : 3,\n \"d\" : 4,\n \"e\" : 5,\n \"f\" : 6,\n \"g\" : 7,\n \"h\" : 8,\n \"i\" : 9,\n \"j\" : 10,\n \"k\" : 11,\n \"l\" : 12,\n \"m\" : 13,\n \"n\" : 14,\n \"o\" : 15,\n \"p\" : 16,\n \"q\" : 17,\n \"r\" : 18,\n \"s\" : 19,\n \"t\" : 20,\n \"u\" : 21,\n \"v\" : 22,\n \"w\" : 23,\n \"x\" : 24,\n \"y\" : 25,\n \"z\" : 26}\n\nturns = 0\npos = 1\nfor i in word:\n turns += min(min(pos - letterNumbers[i], letterNumbers[i] - pos) + 26, max(letterNumbers[i] - pos, pos - letterNumbers[i]))\n pos = letterNumbers[i]\nprint(turns)\n\n", "s=list(input())\r\nb=0\r\nc='a'\r\nfor i in range(len(s)):\r\n a=abs(ord(s[i])-ord(c))\r\n \r\n if(a>13):\r\n a=26-a\r\n b=b+a\r\n c=s[i]\r\n else:\r\n b=b+a\r\n c=s[i]\r\nprint(b)", "a = ['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\nindex = 0\r\nans = 0\r\nfor i in input():\r\n ans += min(abs(index - a.index(i)), 26 - abs(index - a.index(i)))\r\n index = a.index(i)\r\nprint(ans)\r\n", "s=input()\nmoves=0\nk=\"a\"\nfor i in s:\n if(abs(ord(i)-ord(k))>13):\n moves=moves+(26-abs(ord(i)-ord(k)))\n else:\n moves=moves+abs(ord(i)-ord(k))\n k=i\nprint(moves)\n\n\t \t\t\t\t\t \t \t\t \t\t \t \t\t", "def get(c1, c2):\n o_c1, o_c2 = ord(c1), ord(c2)\n o_c1, o_c2 = min(o_c1, o_c2), max(o_c1, o_c2)\n return min(o_c2 - o_c1, dist_over_z(o_c1, o_c2))\n\n\n# c1 < c2\ndef dist_over_z(c1, c2):\n return c1 - ord(\"a\") + ord(\"z\") - c2 + 1\n\n\nname = input()\nlast, ans = \"a\", 0\nfor c in name:\n ans += get(last, c)\n last = c\nprint(ans)\n", "def Night_at_the_Museum(name):\r\n name = input()\r\n rotations = 0\r\n pointer = \"a\"\r\n for letter in name:\r\n rotations_clock = abs(ord(letter)-ord(pointer))\r\n rotations_anti = abs(26-rotations_clock)\r\n rotations += min(rotations_clock,rotations_anti)\r\n pointer = letter\r\n return rotations\r\n\r\nprint(Night_at_the_Museum(\"name\"))", "strings = {\r\n \"a\":1,\"z\":2,\"y\":3,\"x\":4,\"w\":5,\"v\":6,\"u\":7,\"t\":8,\r\n \"s\":9,\"r\":10,\"q\":11,\"p\":12,\"o\":13,\"n\":14,\"m\":15,\r\n \"l\":16,\"k\":17,\"j\":18,\"i\":19,\"h\":20,\"g\":21,\"f\":22,\r\n \"e\":23,\"d\":24,\"c\":25,\"b\":26,\r\n} \r\nstring = input()\r\nx = \"a\"\r\nk =0\r\nsums = 0\r\nfor i in string:\r\n if k ==0:\r\n if strings[i]<= 14:\r\n sums = strings[i] - strings[x]\r\n else:\r\n sums = 26 - strings[i] +1 \r\n x = i \r\n k+=1 \r\n else:\r\n if strings[i] > strings[x] and strings[i]> 13 and strings[x] < 13:\r\n aa = strings[i] - strings[x]\r\n bb = (strings[x] - 1) + (26-strings[i] +1)\r\n sums += min(aa,bb)\r\n x = i\r\n elif strings[i] < strings[x] and strings[i]< 13 and strings[x] > 13:\r\n aa = abs(strings[i] - strings[x])\r\n bb = (strings[i] - 1) + (26-strings[x] +1)\r\n sums += min(aa,bb)\r\n x = i\r\n else:\r\n sums += abs(strings[x]-strings[i])\r\n x = i\r\nprint(sums)", "#CIRCULAR PROBLEM\r\n# Length of circle = 26 \r\n# formula to find small path circle min(|(x-y)| l -|(x-y))\r\n\r\nword = input()\r\nstart ='a'\r\nrotations =0\r\n\r\nfor letter in word:\r\n distance1 = abs(ord(start) - ord(letter)) # |x-y|\r\n distance2 = 26 - distance1 # L - |x-y|\r\n start = letter\r\n rotations += min(distance1,distance2)\r\nprint(rotations)", "'''\r\n# Submitted By [email protected]\r\nDon't Copy This Code, Try To Solve It By Yourself\r\n'''\r\n# Problem Name = \"Night at the Museum\"\r\n# Class: A\r\n\r\nfrom string import ascii_lowercase\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n word = input().strip(\"\\n\")\r\n alpha = ascii_lowercase\r\n char = \"a\"\r\n ans = 0\r\n for i in word:\r\n min_ = min(alpha.index(char), alpha.index(i))\r\n max_ = max(alpha.index(char), alpha.index(i))\r\n ans += min(max_-min_, len(alpha)+(min_- max_))\r\n char = i\r\n \r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "x=input()\nres=0\nk=1\nfor i in x:\n result=ord(i)-96\n result1=26-abs(result-k)\n res+=min(abs(result-k),result1) \n k=result \nprint(res)\n\t \t\t \t\t \t \t \t\t \t\t \t \t \t", "import string\n\n\ndef solution(word):\n letters = string.ascii_lowercase\n count = 0\n current_char = letters[0]\n for c in word:\n tmp = abs(ord(current_char) - ord(c))\n count += 26 - tmp if tmp > 13 else tmp\n current_char = c\n\n return count\n\nif __name__ == \"__main__\":\n word = [c for c in input()]\n print(solution(word))\n", "def l (a, b):\r\n return min((a - b) % 26, (b - a) % 26)\r\n\r\ns = 'a' + input()\r\nans = 0\r\n\r\nfor i in range(len(s) - 1):\r\n ans += l(ord(s[i]), ord(s[i + 1]))\r\n\r\nprint(ans)", "a=97\r\nsum=0\r\nfor i in input():\r\n b=abs(ord(i)-a)\r\n a=ord(i)\r\n sum+=min(b,26-b)\r\nprint(sum)", "counter, alp_num = 0, 97\r\n\r\nfor i in input(): b = abs(ord(i)-alp_num); counter += min(b,26-b); alp_num = ord(i)\r\n\r\nprint(counter)", "s = list(input())\r\ncurrent = ord('a')\r\ncount = 0\r\nfor i in s:\r\n diff = abs(current-ord(i))\r\n count += min(diff, 26-diff)\r\n current = ord(i)\r\n\r\nprint(count)\r\n\r\n", "myStr = input()\r\nold = ord('a')\r\ncount = 0\r\nfor c in myStr:\r\n neededPos = ord(c)\r\n distance = abs(neededPos-old)\r\n if(distance>13):\r\n distance = 26-distance\r\n count += distance\r\n old = neededPos\r\nprint(count)", "import string \ns = str(input())\nlower = string.ascii_lowercase\npos = 'a'\nmin_rot = 0\nfor key in s:\n clock = 0\n anti_clock = 0\n p1 = lower.index(pos)\n p2 = lower.index(pos)\n while lower[p1] != key:\n p1 = (p1 + 1) % 26\n clock += 1\n while lower[p2] != key:\n p2 = p2 - 1\n anti_clock += 1\n pos = key\n min_rot = min_rot + min(clock, anti_clock)\nprint(min_rot)\n \n \n ", "name = input()\r\nintial_value = 'a'\r\nnum_of_rotaions = 0\r\n\r\nfor i in name:\r\n cw = abs(ord(intial_value) - ord(i))\r\n ccw = 26 - cw\r\n num_of_rotaions += min(ccw, cw)\r\n intial_value = i\r\nprint(num_of_rotaions)\r\n", "s = 0\r\nx = input()\r\na = 'a'\r\nfor i in range(len(x)) :\r\n b = x[i]\r\n if a > b :\r\n a , b = b , a\r\n m = min( abs(ord(a) - ord(b)), abs(ord(b) - ord('z')) + abs(ord('a') - ord(a)) + 1 )\r\n s += m\r\n a = x[i]\r\nprint(s)", "import string\r\nfrom math import *\r\nx = [t for t in str(input())]\r\nlist1 = [i for i in string.ascii_lowercase]\r\ns = 0\r\nif int(list1.index(x[0])) >= int(25 - list1.index(x[0])):\r\n s = s + (26 - int(list1.index(x[0])))\r\nelse:\r\n s = s + int(list1.index(x[0]))\r\nfor j in range(len(x)-1):\r\n if fabs(list1.index(x[j+1])-list1.index(x[j])) >= (26 - fabs(list1.index(x[j+1])-list1.index(x[j]))):\r\n s = s + int(26 - fabs(list1.index(x[j+1])-list1.index(x[j])))\r\n else:\r\n s = s + fabs(list1.index(x[j+1])-list1.index(x[j]))\r\nprint(int(s))\r\n\r\n\r\n\r\n\r\n", "s = input()\r\nd=\"abcdefghijklmnopqrstuvwxyz\"\r\nr = 0\r\nf = \"a\"\r\nfor i in s:\r\n c =max(d.index(f), d.index(i))-min(d.index(f), d.index(i))\r\n if c+1>13:\r\n r += 26-c\r\n else:\r\n r+=c\r\n f=i\r\nprint(r)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 7 21:37:04 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=input()\r\nstart=\"a\"\r\ns=0\r\nfor char in n:\r\n diff=ord(char)-ord(start)\r\n if abs(diff)>13:\r\n s=s+(26-abs(diff))\r\n else:\r\n s=s+abs(diff)\r\n \r\n start=char\r\n \r\nprint(s)", "key = list('abcdefghijklmnopqrstuvwxyz')\r\nvalue = [x for x in range(1,27)]\r\nmy_dict = dict(zip(key,value))\r\ncount = 0\r\ntemp = 'a'\r\nfor i in input():\r\n x = abs(my_dict[i]-my_dict[temp])\r\n count+= x if x <=13 else (26-x)\r\n temp = i\r\nprint(count)", "s = input()\r\ncurrent = ord(\"a\")\r\nrotation = 0\r\nfor i in s:\r\n diff = abs(current-ord(i))\r\n if diff > 13:\r\n diff = 26-diff\r\n rotation += diff\r\n current = ord(i)\r\nprint(rotation)", "alpha=['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\nstr1=input().lower()\r\nsub=0\r\nsum=0\r\nfor i in range(len(str1)):\r\n if(i==0):\r\n sub=abs(alpha.index('a')-alpha.index(str1[i]))\r\n \r\n if(sub>len(alpha)/2):\r\n sub=len(alpha)-sub\r\n \r\n sum=sum+sub\r\n else:\r\n sum=sum+sub\r\n else:\r\n \r\n sub=abs(alpha.index(str1[i-1])-alpha.index(str1[i]))\r\n \r\n if(sub>len(alpha)/2):\r\n sub=len(alpha)-sub\r\n \r\n sum=sum+sub\r\n else:\r\n sum=sum+sub\r\n\r\nprint(sum) ", "a = input()\r\nt = 0\r\nl=0\r\nfor i in a:\r\n o = ord(i)-97\r\n d = abs(l-o)\r\n l=o\r\n t += min([(26-d),d])\r\nprint(t)", "\r\n\r\n# t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n # n, c = map(int, input().split())\r\n # n = int(input())\r\n # a = list(map(int, input().split()))\r\n # b = list(map(int, input().split()))\r\n s = input()\r\n pos = 0\r\n ans = 0\r\n # 97\r\n # 122\r\n for i in range(len(s)):\r\n new_pos = ord(s[i]) - 97\r\n if new_pos > pos:\r\n ans += min(new_pos - pos, pos + 123 - 97 - new_pos)\r\n else:\r\n ans += min(123 -97 - pos + new_pos, pos - new_pos)\r\n # print(ans)\r\n pos = new_pos\r\n # print(ord(s))\r\n # print(ord(\"z\"))\r\n print(ans)\r\n", "ch=input()\r\np=abs(ord(ch[0])-ord('a'))\r\ns=min(p,26-p)\r\nfor i in range(1,len(ch)):\r\n p=abs(ord(ch[i])-ord(ch[i-1]))\r\n s+=min(p,26-p)\r\nprint(s) ", "string = input().strip()\r\n'''\r\nzeus, ares, map\r\n'''\r\nsteps = 0\r\ncurrent = 'a'\r\n\r\nfor character in string:\r\n \r\n difference = abs(ord(current) - ord(character))\r\n from_left = 26 - difference #total chars - diff\r\n \r\n if difference > from_left:\r\n steps += from_left\r\n else:\r\n steps += difference\r\n \r\n current = character\r\n\r\nprint(steps)\r\n", "word = input()\r\nindex = 0\r\nmoves = 0\r\nfor i in word:\r\n t = ord(i) - 97\r\n walk = abs(t - index)\r\n if walk < 13:\r\n moves = moves + walk\r\n else:\r\n moves = moves+ (26 - walk)\r\n index = ord (i) - 97\r\n\r\nprint(moves)", "s = input()\r\nd = { 'a':1, 'b':2, 'c':3, 'd':4, 'e':5, 'f':6, 'g':7, 'h':8, 'i':9, 'j':10,\r\n 'k':11, 'l':12, 'm':13, 'n':14, 'o':15, 'p':16, 'q':17, 'r':18, 's':19, 't':20,\r\n 'u':21, 'v':22, 'w':23, 'x':24, 'y':25, 'z':26 }\r\nlast = 1\r\nresult = 0\r\nfor i in s:\r\n current = d[i]\r\n if abs(current - last) < 13:\r\n result += abs(current - last)\r\n else:\r\n result += 26 - abs(current - last)\r\n last = current\r\nprint(result)\r\n", "b=input()\r\n#a=97\r\n#z=122\r\nm=\"a\"\r\nz=0\r\nfor j in b:\r\n z+=min(abs(ord(m)-ord(j)),26-abs(ord(m)-ord(j)))\r\n m=j\r\nprint(z)\r\n", "s = list(str(input()))\r\nk = list(map(ord, s))\r\nk = list(map(lambda x : x - 96, k))\r\n\r\nans = 0\r\npos = 1\r\n\r\n\r\nfor i in range(len(k)):\r\n where = k[i]\r\n check1 = abs(where-pos)\r\n check2 = abs((max(where, pos) - min(where,pos)) - 26)\r\n adding = min(check1, check2)\r\n ans += adding\r\n pos = k[i]\r\nprint(ans)\r\n", "s=input()\r\nel=\"a\"\r\ns1=0\r\nfor i in range(len(s)):\r\n a1=abs(ord(s[i])-ord(el))\r\n a2=26-a1\r\n s1+=min(a1,a2)\r\n el=s[i]\r\nprint(s1)\r\n", "string = input()\n\ntotal = 0\ncurrent_letter = 0\nfor c in string:\n\tnew_letter = ord(c) - 97\n\n\tdiff1 = abs(new_letter - current_letter) % 26\n\tdiff2 = 26 - diff1\n\ttotal += min(diff1, diff2)\n\n\tcurrent_letter = new_letter\n\nprint(total)\n", "initial='a'\nsum=0\nstr=input()\nfor i in str:\n diff=abs(ord(i)-ord(initial))\n if diff>=14:\n sum=sum+(26-diff)\n else:\n sum=sum+diff\n initial=i\nprint(sum)\n \t\t\t \t\t \t\t\t\t \t\t\t \t \t\t \t\t\t \t", "f = open(0)\n\nmoves = 0\n\ncur = 0\nc = f.read(1)\n\nwhile c != \"\" and c != \"\\n\":\n c_v = ord(c) - 97\n min_m = min(abs(c_v - cur), abs(26 - cur) + c_v, abs(26 - c_v) + cur)\n moves += min_m\n cur = c_v\n c = f.read(1)\n \nprint(moves)\n", "t=0\r\na=97\r\nfor i in map(ord,input()):\r\n b=abs(a-i)\r\n t+=min(b,26-b)\r\n a=i\r\nprint(t)", "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\ns=str(input());b='a';p=0;l=26\r\nfor i in s:\r\n x=a.index(i)\r\n y=a.index(b)\r\n p+=min(abs(x-y),l-abs(x-y))\r\n b=i\r\nprint(p)\r\n", "s=input()\r\na=\"abcdefghijklmnopqrstuvwxyz\"\r\nb=list(range(1,27))\r\ntemp=1\r\nsum=0\r\nfor i in s:\r\n for j in range(26):\r\n if i==a[j]:\r\n sum+=min(abs(b[j]-temp),26-abs(b[j]-temp))\r\n temp=b[j]\r\nprint(sum)\r\n ", "s = input()\r\nstart = 'a'\r\nans = 0\r\n\r\nfor i in range(len(s)):\r\n ch = s[i]\r\n r1 = ord(start) - ord(ch)\r\n if r1 > -1:\r\n r2 = abs(r1 - 26)\r\n else:\r\n r2 = abs(r1 + 26)\r\n ans = ans + min(abs(r1), abs(r2))\r\n start = ch\r\n\r\nprint(ans)\r\n", "t = input()\r\nc = 97\r\nans = 0\r\n\r\nfor x in map(ord, t):\r\n ans += min(abs(x - c), 26 - abs(x - c))\r\n c = x\r\n\r\nprint(ans)", "s=input()\r\nx=0\r\nnow='a'\r\nfor i in range(len(s)):\r\n if s[i]!=now:\r\n if ord(s[i])>ord(now):\r\n if abs((ord(s[i])-26)-ord(now))<abs(ord(s[i])-ord(now)):\r\n x+=abs(ord(s[i])-26-ord(now))\r\n now=s[i]\r\n else :\r\n x+=abs(ord(s[i])-ord(now))\r\n now=s[i]\r\n else :\r\n if abs((ord(now)-26)-ord(s[i]))<abs(ord(now)-ord(s[i])):\r\n x+=abs(ord(now)-26-ord(s[i]))\r\n now=s[i]\r\n else :\r\n x+=abs(ord(now)-ord(s[i]))\r\n now=s[i]\r\n\r\nprint(x)", "list = {'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8, 'i': 9, \r\n 'j': 10, 'k': 11, 'l': 12, 'm': 13, 'n': 14, 'o': 15, 'p': 16, 'q': 17, \r\n 'r': 18, 's': 19, 't': 20, 'u': 21, 'v': 22, 'w': 23, 'x': 24, 'y': 25, 'z': 26}\r\n\r\ninput = input()\r\n\r\nsum = 0\r\ntemp = 0\r\n\r\nif ((list[input[0]] - list['a']) > 13):\r\n sum += (26 - (list[input[0]] - list['a']))\r\nelse:\r\n sum = (list[input[0]] - list['a'])\r\n\r\n\r\nfor i in range(1, len(input)):\r\n if (list[input[i]] > list[input[i - 1]]):\r\n temp = list[input[i]] - list[input[i - 1]]\r\n else:\r\n temp = list[input[i - 1]] - list[input[i]]\r\n \r\n if temp <= 13:\r\n sum += temp\r\n else:\r\n sum += (26 - temp)\r\n\r\nprint(sum)", "\r\na=input()\r\nb=\"a\"+a\r\nc=0\r\nfor i in range(len(b)-1):\r\n d=abs(ord(b[i+1])-ord(b[i]))\r\n if d>13:\r\n d=26-d\r\n\r\n c=c+d\r\nprint(c)", "letters = ['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\nword = input()\r\ncounter = 0\r\nstart = 0\r\nfor i in range(len(word)):\r\n next = letters.index(word[i])\r\n forward = abs(start - next )\r\n backword = 26 - forward\r\n counter+= min(forward,backword)\r\n start = next\r\n\r\nprint(counter)", "s = input()\r\ns = \"a\"+s\r\nl = [chr(i) for i in range(ord('a'),ord('z')+1)]\r\nn=26\r\nptr = 0\r\nc=0\r\nfor i in range(len(s)-1):\r\n p=min(abs(l.index(s[i])-l.index(s[i+1])), n-abs(l.index(s[i])-l.index(s[i+1])))\r\n c+=p\r\n #print(\"c:\",p)\r\nprint(c)", "x=\"a\"+str(input())\r\ns=0\r\nfor i in range(len(x)-1):\r\n if abs(ord(x[i+1])-ord(x[i]))>13:\r\n s=s+(26-abs(ord(x[i+1])-ord(x[i])))\r\n if abs(ord(x[i+1])-ord(x[i]))<=13:\r\n s=s+(abs(ord(x[i+1])-ord(x[i])))\r\nprint(s)", "c=97;s=0\r\nfor i in map(ord,input()):\r\n x=abs(c-i)\r\n s+=min(x,26-x)\r\n c=i\r\nprint(s)", "letters=[\"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\ni=0\r\nj=0\r\ntotal=0\r\nfor j in range(len(word)):\r\n shift=0\r\n while letters[i]!=word[j]:\r\n shift=shift+1\r\n if i==25: i=i-25\r\n else: i=i+1\r\n if shift>=13: shift=26-shift\r\n total=total+shift\r\nprint(total)\r\n", "name = input()\r\ncount = min(abs(ord(name[0]) - ord('a')), 26 - abs(ord(name[0]) - ord('a')))\r\nfor i in range(len(name) - 1):\r\n count += min(abs(ord(name[i + 1]) - ord(name[i])), 26 - abs(ord(name[i + 1]) - ord(name[i])))\r\nprint(count)", "from sys import stdin, stdout\r\nfrom collections import Counter, deque\r\nfrom itertools import permutations, combinations, accumulate\r\nfrom functools import reduce\r\nfrom heapq import *\r\nfrom operator import itemgetter\r\nfrom math import *\r\n\r\ninput_int = lambda: int(stdin.readline())\r\ninput_ints = lambda: map(int, stdin.readline().split())\r\ninput_array = lambda: list(input_ints())\r\ninput_str = lambda: stdin.readline()[:-1]\r\n\r\ns = input_str()\r\nw = list(range(26))\r\nc = 0\r\nr = 0\r\nfor i in s:\r\n n = ord(i) - 97\r\n if c < n:\r\n r += min(n - c, abs(n - 26) + c)\r\n elif n < c:\r\n r += min(c - n, n + 26 - c)\r\n c = n\r\nstdout.write(f'{r}')\r\n", "Alphapit =['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\nword = input()\r\ncount = 0\r\ncurent = 'a'\r\nfor i in word:\r\n \r\n if (26 - abs(Alphapit.index(i)- Alphapit.index(curent))) >=(abs(Alphapit.index(i)- Alphapit.index(curent))):\r\n count += abs(Alphapit.index(i)- Alphapit.index(curent))\r\n else:\r\n count +=(26 - abs(Alphapit.index(i)- Alphapit.index(curent)))\r\n curent = i\r\n\r\nprint(count)", "isx='abcdefghijklmnopqrstuvwxyz'\r\nsr=input()\r\nf=0\r\nrot=0\r\nfor x in sr:\r\n g=isx.find(x)\r\n a1=abs(f-g)\r\n a2=26-a1\r\n rot+=min(a1,a2)\r\n f=g \r\n\r\nprint(rot)", "x= input().lower()\r\nalpha = 'abcdefghijklmnopqrstuvwxyz'\r\ncurrent_letter = 'a'\r\ncnt = 0\r\nsteps = 0\r\nfor i in x:\r\n wanted_letter = x[cnt]\r\n dist = abs(alpha.index(current_letter) - alpha.index(wanted_letter))\r\n if dist<13:\r\n steps+=dist\r\n else :\r\n steps+=(26-dist)\r\n current_letter=i\r\n cnt+=1\r\nprint(steps)", "a= input()\r\non = \"a\"\r\ncount = 0\r\nfor i in range(len(a)):\r\n d = abs(ord(on)-ord(a[i]))\r\n count += min(d, 26-d)\r\n on = a[i]\r\nprint(count)", "alphabets = 'abcdefghijklmnopqrstuvwxyz'\r\nalphabet_dict = {}\r\ncounter = 1\r\nfor alphabet in alphabets:\r\n alphabet_dict[alphabet] = counter\r\n counter += 1\r\n\r\nname = list(input())\r\nnum_1 = 1\r\ntotal_distance = 0\r\nfor alphabet in name:\r\n num_2 = alphabet_dict[alphabet]\r\n distance_1 = abs(num_1 - num_2)\r\n distance_2 = 26 - distance_1\r\n if distance_1 >= distance_2:\r\n total_distance += distance_2\r\n else:\r\n total_distance += distance_1\r\n num_1 = num_2\r\nprint(total_distance)", "w = [l for l in input()]\r\nalp = []\r\nini = 0\r\nans = 0\r\n\r\nfor i in range(ord('a'), ord('z')+1):\r\n alp.append(chr(i))\r\n\r\nfor i in range(len(w)):\r\n c = alp.index(w[i])\r\n t = min((abs(c - ini)), (26 - abs(ini - c)))\r\n ini = c\r\n ans += t\r\n \r\nprint(ans)\r\n\r\n", "alphabet = 'abcdefghijklmnopqrstuvwxyz'\r\nindex = dict()\r\n\r\nfor i in range(26):\r\n index[alphabet[i]] = i\r\n\r\ns = input()\r\nans = 0\r\n\r\nfor i in range(len(s)):\r\n if i > 0:\r\n ans += min(abs(index[s[i]] - index[s[i - 1]]), 26 - abs(index[s[i]] - index[s[i - 1]]) )\r\n else:\r\n ans += min(index[s[i]], abs(26 - index[s[i]]))\r\n \r\nprint(ans)", "x=input()\r\ny=\"abcdefghijklmnopqrstuvwxyz\"\r\nz=y[::-1]\r\ne=0\r\nb=len(x)\r\nfor i in range(0,b):\r\n if x[i] in y:\r\n c=y.index(x[i])\r\n if x[i] in z:\r\n d=z.index(x[i])+1\r\n if c<=d:\r\n e=e+c\r\n if d<c:\r\n e=e+d\r\n f=y[:c]\r\n g=y[c::]\r\n y=g+f\r\n z=y[::-1]\r\nprint(e) ", "s = ['a'] + list(input())\r\n\r\ndef dist(a, b):\r\n a, b = ord(a)-96, ord(b)-96 \r\n\r\n if a - b > 13 or b - a > 13:\r\n a, b = (max(a, b) - 26), min(a, b)\r\n res = a - b if a - b > 0 else b - a\r\n return res\r\n\r\nsm = 0\r\nfor i in range(len(s)-1):\r\n sm += dist(s[i],s[i+1])\r\nprint(sm)", "w = input()\r\ninit = 'a'\r\nrot = 0\r\nfor c in w:\r\n temp = abs(ord(c) - ord(init)) # no of clockwise rotations (n)\r\n rot += temp if temp <= 13 else (26-temp) # if clockwise > 13 do (26 - n) anticlockwise rotations\r\n init = c\r\nprint(rot)\r\n", "s = map(ord, input())\r\n\r\nA = ord('a')\r\nZ = ord('z')\r\n\r\nn = 0\r\nres = 0\r\n\r\nfor x in s:\r\n if A <= x <= Z:\r\n x -= A\r\n res += min(abs(x-n), 26 - abs(x - n))\r\n n = x\r\n else:\r\n break\r\n \r\nprint(res)", "word = 'a' + input()\r\nmoves = 0\r\n\r\nfor i in range(len(word)-1):\r\n c1 = ord(word[i])\r\n c2 = ord(word[i+1])\r\n maxi = max(c1, c2)\r\n mini = min(c1, c2)\r\n if c1 == c2:\r\n moves += min( abs(c1 - c2) , (122 - maxi) + (mini - 97) + 1)\r\n else:\r\n moves += min( abs(c1 - c2) , (122 - maxi) + (mini - 97) + 1)\r\n\r\nprint(moves)\r\n", "s=input()\r\nsom=0\r\nres=ord(s[0])-ord(\"a\")\r\nsom+=min(res,26-res)\r\nfor i in range(len(s)-1):\r\n res=abs(ord(s[i+1])-ord(s[i]))\r\n som+=min(res,26-res)\r\nprint(som)", "wheel = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\ndef dist(c1, c2):\r\n d1 = abs(wheel.index(c1) - wheel.index(c2))\r\n return min(d1, 26 - d1)\r\n\r\nword=input()\r\ndistances = [dist(c1, c2) for (c1, c2) in zip('a' + word, word)]\r\nprint(sum(distances))\r\n", "s = input()\r\ncount = 0\r\ncu = \"a\"\r\nfor c in s:\r\n a = abs(ord(c)- ord(cu))\r\n if a > 13:\r\n count += 26-a\r\n else:\r\n count += a\r\n cu = c\r\nprint(count)", "s = list(input())\r\ncurr = ord('a') - 97\r\nt = 0\r\nfor elem in s:\r\n a = curr - (ord(elem)-97)\r\n t += min(abs(a), 26 - abs(a))\r\n curr = ord(elem) - 97\r\nprint(t)\r\n", "from string import ascii_letters\r\nlistik = list(ascii_letters[:26])\r\nspins = 0\r\nfor bykva in input():\r\n right = listik.index(bykva)\r\n left = listik[::-1].index(bykva) + 1\r\n\r\n if right < left:\r\n spins += right\r\n else:\r\n spins += left\r\n\r\n listik = listik[right:] + listik[:right]\r\n\r\nprint(spins)", "n=input()\r\ni=\"a\"\r\nb=0\r\ns=0\r\nfor j in n:\r\n\tb=abs(ord(i)-ord(j))\r\n\ts+=min(b,26-b)\r\n\ti=j\r\nprint(s)", "string = input()\r\nstart = 97\r\nmoves = 0\r\nfor i in string:\r\n result = abs(ord(i) - start)\r\n if result <= 13:\r\n moves += result\r\n else:\r\n moves += 26-result\r\n start = ord(i)\r\nprint(moves)", "x = input()\r\nn = ord('a')\r\ncnt = 0\r\nfor i in range(len(x)):\r\n cnt += min(abs(ord(x[i])-n), 26 - abs(ord(x[i])-n))\r\n n = ord(x[i])\r\nprint(cnt)", "import math\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations\r\n \r\n \r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\ndef getRight(char: str, embosser: List[str], index: int) -> int:\r\n\r\n distance = 0\r\n\r\n while embosser[index] != char:\r\n\r\n index += 1\r\n\r\n distance += 1\r\n\r\n if index == len(embosser):\r\n index = 0\r\n \r\n return distance\r\n\r\n\r\ndef getLeft(char: str, embosser: List[str], index: int) -> int:\r\n\r\n distance = 0\r\n while embosser[index] != char:\r\n\r\n index -= 1\r\n\r\n distance += 1\r\n \r\n if index == -1:\r\n index = len(embosser)-1\r\n\r\n \r\n return distance\r\n\r\nembosser = [char for char in \"abcdefghijklmnopqrstuvwxyz\"]\r\n\r\ns = input()\r\n\r\nindex = 0\r\n\r\nans = 0\r\n\r\nfor char in s:\r\n\r\n rightDistance = getRight(char, embosser, index)\r\n leftDistance = getLeft(char, embosser, index)\r\n\r\n index = embosser.index(char)\r\n\r\n ans += min(rightDistance, leftDistance)\r\n\r\nprint(ans)\r\n\r\n\r\n", "\"\"\"\r\ncontest= https://codeforces.com/contest/731/problem/A\r\ndate= Thursday, May 11, 2023\r\nVerdict =\r\n\"\"\"\r\nw='a'+input()\r\nx=0\r\nfor i in range(len(w)-1):\r\n tem_1= abs((ord(w[i])%ord('a') ) -(ord(w[i+1])%ord('a') ))\r\n tem_2= abs(tem_1-26)\r\n x+= min (tem_1 , tem_2 )\r\nprint(x)", "def rotating(a,b):\r\n rotation=0\r\n singleDir= abs(ord(a)-ord(b))\r\n if singleDir>13:\r\n rotation=26-singleDir\r\n else:\r\n rotation=singleDir\r\n return rotation\r\nname=input().lower()\r\nfirstRotation=abs(ord(\"a\")-ord(name[0]))\r\nif firstRotation > 13:\r\n count = 26 - firstRotation\r\nelse:\r\n count = firstRotation\r\nfor i in range(len(name)-1):\r\n count=count+rotating(name[i],name[i+1])\r\nprint(count)", "\r\nimport string\r\n\r\n\r\ndef count_steps(word: str):\r\n\r\n alphabets = string.ascii_lowercase\r\n pivot = 'a'\r\n\r\n distance = 0\r\n steps = 0\r\n\r\n for char in word:\r\n distance = abs(alphabets.index(char) - alphabets.index(pivot))\r\n if (distance > (len(alphabets) // 2)):\r\n distance = len(alphabets) - distance\r\n\r\n pivot = char\r\n steps += distance\r\n\r\n return steps\r\n\r\n\r\nif __name__ == '__main__':\r\n word = input()\r\n print(count_steps(word))\r\n", "s=input()\r\npos=ord('a')\r\ns1=0\r\nfor i in s:\r\n s1+=min(26-abs(ord(i)-pos),abs(ord(i)-pos))\r\n pos=ord(i)\r\n \r\n\r\nprint(s1)\r\n", "s=input()\r\nstart=\"a\"\r\nx=0\r\nfor i in s:\r\n x=x+min(abs(ord(start)-ord(i)),26-abs(ord(start)-ord(i)))\r\n start=i\r\nprint(x)", "word = input()\r\ndefault = 'a'\r\nnum_of_rotation = 0\r\nfor c in word:\r\n num_clockwise = abs(ord(default)-ord(c))\r\n num_counterclockwise = 26-num_clockwise\r\n if num_clockwise >= num_counterclockwise:\r\n num_of_rotation += num_counterclockwise\r\n else:\r\n num_of_rotation += num_clockwise\r\n default = c\r\nprint(num_of_rotation)", "import string\r\nletters = dict(zip(string.ascii_lowercase, range(1, 27)))\r\n\r\na = input()\r\npos = letters[\"a\"]\r\ntotal = 0\r\n\r\nfor k in a:\r\n total += min(abs(pos - letters[k]), 26 - abs(pos - letters[k]))\r\n pos = letters[k]\r\n\r\nprint(total)", "from string import *\r\n\r\nalp = list(ascii_lowercase)\r\n\r\ns = list(input())\r\n\r\ncount = 0\r\nx = 0\r\nfor i in s:\r\n y = alp.index(i)\r\n count += min(abs(x-y), 26-(abs(x-y)))\r\n x = y\r\n\r\nprint(count) ", "\r\n\r\ndef night_at_the_museum():\r\n \r\n\r\n \r\n get_position = lambda letter: ord(letter) - ord('a')\r\n\r\n s = input()\r\n\r\n\r\n \r\n start_letter = 'a'\r\n current_position = get_position(start_letter)\r\n\r\n turns = 0\r\n for letter in s:\r\n\r\n letter_position =get_position(letter)\r\n\r\n way_one = (current_position - letter_position) % 26\r\n way_two = (letter_position - current_position) % 26\r\n\r\n minimum_way = min(way_one,way_two)\r\n turns += minimum_way\r\n current_position = letter_position\r\n\r\n print(turns)\r\n\r\n\r\n\r\nnight_at_the_museum()\r\n\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=97;r=0;\r\nfor x in map(ord,input()):\r\n\ti=abs(s-x)\r\n\tr+=min(i,26-i)\r\n\ts=x\r\nprint(r)", "alpha = \"nopqrstuvwxyzabcdefghijklm\"\r\ncurrent_index = 13\r\nword = input()\r\noutput = 0\r\nfor i in range(len(word)):\r\n index = alpha.index(word[i])\r\n output += abs(index - 13)\r\n alpha = alpha[(index + 13) % 26:] + alpha[:(index + 13) % 26]\r\n\r\nprint(output)\r\n", "from sys import stdin\r\n \r\ns = map(ord,stdin.readline().rstrip())\r\n \r\ntemp = 97\r\nres = 0\r\nfor x in s:\r\n d1 = abs(x-temp)\r\n d2 = 26-d1\r\n temp = x\r\n res += min(d1,d2)\r\nprint(res)", "n = list(input())\r\nn.insert(0,'a')\r\nalpha = list('abcdefghijklmnopqrstuvwxyz')\r\nalpha.extend(alpha)\r\n\r\ntot = []\r\nfor i in range(1,len(n)):\r\n ind = alpha.index(n[i])\r\n rev = alpha.index(n[i-1])\r\n # forward\r\n x = alpha[rev:] \r\n y = x.index(n[i])\r\n # reverse\r\n xx = alpha[ind:]\r\n yy = xx.index(n[i-1])\r\n tot.append(min([y,yy]))\r\n\r\nprint(sum(tot))", "str = input()\r\nsum = 0\r\ndemp = ord('a')\r\nfor i in str:\r\n if (26 - abs(ord(i) - demp)) < abs(ord(i) - demp):\r\n sum += 26 - abs(ord(i) - demp)\r\n demp = ord(i)\r\n else:\r\n sum += abs(ord(i) - demp)\r\n demp = ord(i)\r\nprint(sum)", "s = 'a' + input()\r\nans = 0\r\nfor i in range(1, len(s)):\r\n ans += min(abs(ord(s[i]) - ord(s[i - 1])), 26 - abs(ord(s[i]) - ord(s[i - 1])))\r\nprint(ans)\r\n", "s = input()\r\npointer = \"a\"\r\nans = 0\r\nfor char in s:\r\n newp = min(abs(ord(char)-ord(pointer)),((abs(ord(\"z\")-ord(char))+1+abs(ord(\"a\")-ord(pointer)))),((abs(ord(\"z\")-ord(pointer))+1+abs(ord(\"a\")-ord(char))))) \r\n ans+= newp\r\n pointer = char\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n", "def distance(A,B):\r\n add26 = 26 - abs(ord(B) - ord(A))\r\n dontAdd = abs(ord(B) - ord(A))\r\n\r\n if(add26 < dontAdd):\r\n return add26\r\n else:\r\n return dontAdd\r\n\r\ninputName = input()\r\nname = [i for i in inputName]\r\nname.insert(0,'a')\r\n\r\n\r\nrotations = 0\r\n\r\n\r\nfor i in range(0, len(name)-1):\r\n rotations += distance(name[i], name[i+1])\r\n\r\nprint(rotations)", "word = input ()\r\nalpha = 'abcdefghijklmnopqrstuvwxyz'\r\nturns = 0\r\ncurrent = 0\r\nfor char in word:\r\n pos = alpha.find (char)\r\n turns += min ((pos - current) % 26, (current - pos) % 26)\r\n current = pos\r\nprint (turns)", "start = ['a']\r\nalphabet = ['','a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\nn = input()\r\nlength = 26\r\nturns = 0\r\nfor i in n:\r\n start.append(i)\r\n\r\nx, y = 0, 1\r\n\r\nwhile x < len(start) - 1 and y < len(start):\r\n turns += min(abs(alphabet.index(start[x]) - (alphabet.index(start[y]))), length - (abs(alphabet.index(start[x]) - (alphabet.index(start[y])))))\r\n x += 1\r\n y += 1\r\nprint(turns)\r\n", "x=input()\r\na=min(ord(x[0])-97, 26 - ord(x[0])+97)\r\nfor i in range(1,len(x)):\r\n b=(ord(x[i])-97)\r\n c=(ord(x[i-1])-97)\r\n if(x[i-1]>x[i]):\r\n a+=min(abs( b-c ), abs(26+ b-c ))\r\n else:\r\n a+=min(abs( b-c ), abs(26- b+c ))\r\nprint(a)", "s = 0\r\nh = \"abcdefghijklmnopqrstuvwxyz\"\r\nstrs = input()\r\nfor i in range(len(strs)):\r\n if i == 0:\r\n s += min(26 - h.index(strs[i]), h.index(strs[i]))\r\n else:\r\n s += min(26 - abs(h.index(strs[i-1]) - h.index(strs[i])), abs(h.index(strs[i-1]) - h.index(strs[i])))\r\nprint(s)", "x=input()\r\ninc_=0\r\nl=[\"a\"]\r\nfor i in range(len(x)):\r\n\td=abs(ord(x[i])-ord(l[-1]))\r\n\tl.append(x[i])\r\n\tif d>13:\r\n\t\tinc_=inc_+26-d\r\n\telse:\r\n\t\tinc_=inc_+d\r\nprint(inc_)", "import string\n\nif __name__ == '__main__':\n inp = input()\n\n low = string.ascii_lowercase\n ref_dict = {low[i]: i+1 for i in range(26)}\n min_len = 0\n inp = 'a' + inp\n for i in range(len(inp) - 1):\n min_len += min(abs(ref_dict[inp[i]] - ref_dict[inp[i+1]]), 26 - abs(ref_dict[inp[i]] - ref_dict[inp[i+1]]))\n\n print(min_len)", "from io import BytesIO, IOBase\r\nimport os\r\n\r\nfrom collections import defaultdict,Counter\r\nfrom sys import stdin,stdout,setrecursionlimit\r\nfrom math import *\r\n\r\n\r\n############################################################\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 = \"A\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\ndef I(): return stdin.readline().rstrip('\\r\\n')\r\ndef ari(): return list(map(int,I()))\r\ndef ars(): return list(map(str,I()))\r\ndef arf(): return list(map(float,I()))\r\ndef mpi(): return map(int,I())\r\ndef mps(): return map(str,I())\r\ndef mpf(): return map(float,I())\r\n\r\n############################################################\r\n\r\nmod = 10**9+7\r\nsetrecursionlimit(10**8)\r\ninf = float('inf')\r\nstdin = IOWrapper(stdin)\r\nstdout = IOWrapper(stdout)\r\n\r\n############################################################\r\n\r\ndef power(A, B, p):\r\n\r\n res = 1 # Initialize result\r\n A = A % p # Update A if it is more , than or equal to p\r\n if A == 0:\r\n return 0\r\n while B > 0:\r\n if (B & 1) == 1: # If B is odd, multiply, A with result\r\n res = (res * A) % p\r\n\r\n B = B >> 1 # B = B/2\r\n A = (A * A) % p\r\n return res\r\n\r\n############################################################\r\n\r\nS = input()\r\nans = 0\r\nini = ord('a')\r\n\r\nfor i in range(len(S)):\r\n\r\n ans += min(abs(ord(S[i]) - ini),min(ini-97 + 122 - ord(S[i])+1,122-ini + ord(S[i])-97 + 1))\r\n #print(ans)\r\n ini = ord(S[i])\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s=input()\na=0\nk=1\nfor i in s:\n res=ord(i)-96\n res1=26-abs(res-k)\n a+=min(abs(res-k),res1) \n k=res \nprint(a)\n\t\t \t\t \t\t\t\t\t \t \t \t \t\t \t\t\t\t", "import sys\r\n\r\nword = sys.stdin.readline().lower()\r\nlst = []\r\nmoves = 0\r\nfor i in word:\r\n lst.append(ord(i) - 97)\r\nlst.remove(lst[-1])\r\n\r\nfor i in range(len(lst)-1):\r\n if abs(lst[i] - lst[i+1]) < 13:\r\n moves += abs(lst[i] - lst[i+1])\r\n else:\r\n moves += 26 - abs(lst[i] - lst[i+1])\r\n\r\n# from a to lst[0] [a:0, b12m ,n:13, o12z ,z:25]\r\nif lst[0] > 13:\r\n moves += (26 - lst[0])\r\nelif lst[0] < 13:\r\n moves += (lst[0])\r\nelif lst[0] == 13:\r\n moves += 13\r\nprint(moves)\r\n", "string = input()\r\nletters = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\nj = 0\r\nmoves = 0\r\n\r\na = ord('a')\r\nz = ord('z')\r\n\r\nfor i in string:\r\n if a <= ord(i) and ord(i) <= z:\r\n order = ord(i) - a\r\n moves += min(abs(order-j), 26-abs(order-j))\r\n j = order\r\n else:\r\n break\r\nprint(moves) \r\n \r\n ", "x = 'a'+input()\r\ncount = 0\r\nfor i in range(0, len(x)-1):\r\n if abs(ord(x[i])-ord(x[i+1])) < abs(26-abs(ord(x[i])-ord(x[i+1]))):\r\n count += abs(ord(x[i])-ord(x[i+1]))\r\n else:\r\n count += abs(26-abs(ord(x[i])-ord(x[i+1])))\r\nprint(count)", "def Get_Min(a,b):\r\n lenght1=int(abs(ord(a)-ord(b)))\r\n length2=26-lenght1\r\n return min(lenght1,length2)\r\n\r\ndef addLenght(string):\r\n letters_List=list(string)\r\n count=Get_Min(\"a\",letters_List[0])\r\n for i in range(0,len(letters_List)-1):\r\n count=count+Get_Min(letters_List[i],letters_List[i+1])\r\n return count\r\n\r\nx=input()\r\nprint(addLenght(x))", "letters = [chr(i) for i in range(ord('a'), ord('z')+1)]\r\nword = input()\r\nans = 0\r\npos = 0\r\nfor l in word:\r\n il = letters.index(l)\r\n ans += min(max(il, pos)-min(il, pos), 26+min(il, pos)-max(il, pos))\r\n pos = letters.index(l)\r\nprint(ans) ", "\r\ns=input()\r\nprev=ord(\"a\")\r\nc=0\r\nfor i in s:\r\n d=abs(ord(i)-prev)\r\n if d>13:\r\n c+=26-d\r\n else:\r\n c+=d\r\n prev=ord(i)\r\nprint(c)", "s = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\nz = input()\r\n#\"gg\"\r\n#26 - index(r) + index ( l)\r\nj = 'a'\r\nans = 0\r\nfor i in z:\r\n x = s.find(i)\r\n y = s.find(j)\r\n ans += min(abs(x - y) , 26 - max(x, y) + min(x, y))\r\n j = i\r\nprint(ans)", "s = input()\r\n\r\n'''\r\nz -> clockwise = 1 + \r\n'''\r\n\r\ncurrent_pos = 1\r\nrounds = 0\r\nclockwise = 0\r\nanti_clockwise = 0\r\nfor ch in s:\r\n\t# clockwise = ord(ch) - 96 - current_pos\r\n\tnext_pos = ord(ch) - 96\r\n\tif next_pos > current_pos:\r\n\t\tclockwise = next_pos - current_pos\r\n\t\tanti_clockwise = current_pos - next_pos + 26\r\n\telse:\r\n\t\tclockwise = next_pos - current_pos + 26\r\n\t\tanti_clockwise = current_pos - next_pos\r\n\trounds += min(clockwise, anti_clockwise)\r\n\r\n\tcurrent_pos = next_pos\r\n\r\nprint(rounds)", "s=input()\r\nrep=0\r\nlast=\"a\"\r\nfor c in s:\r\n rep+=min(abs(ord(last)-ord(c)),26-abs(ord(last)-ord(c)))\r\n last=c\r\nprint(rep)", "a = list(map(chr, range(97, 123)))\r\nn = str(input())\r\nc = 0\r\ns = 0\r\nr = 0\r\nfor i in n:\r\n r = abs(s - a.index(i))\r\n if r > 13:\r\n c += 26 - r\r\n else :\r\n c += r\r\n s = a.index(i)\r\nprint(c)\r\n", "import string\nalphabet = list(string.ascii_lowercase)\ns = 'a' + input()\nrotations = 0\n\nfor i in range(len(s) - 1):\n rotations += min(abs(alphabet.index(s[i]) - alphabet.index(s[i + 1])), len(alphabet) - abs(alphabet.index(s[i]) - alphabet.index(s[i + 1])))\n\nprint(rotations)\n\n", "def main():\r\n letters = ['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 word = input()\r\n first = \"a\"\r\n ans = 0\r\n for letter in word:\r\n x = abs(letters.index(letter) - letters.index(first))\r\n ans += min(x, 26 - x)\r\n first = letter\r\n print(ans)\r\n\r\n\r\nmain()", "def min_rotations_to_print(name):\r\n current_letter = 'a'\r\n rotations = 0\r\n\r\n for letter in name:\r\n clockwise_rotations = (ord(letter) - ord(current_letter) + 26) % 26\r\n counterclockwise_rotations = (ord(current_letter) - ord(letter) + 26) % 26\r\n min_rotations = min(clockwise_rotations, counterclockwise_rotations)\r\n current_letter = letter\r\n rotations += min_rotations\r\n\r\n return rotations\r\nexhibit_name = input().strip()\r\nresult = min_rotations_to_print(exhibit_name)\r\nprint(result)\r\n", "def min_rotations_to_print(text):\r\n total_rotations = 0\r\n current_char = 'a'\r\n\r\n for char in text:\r\n clockwise_dist = (ord(char) - ord(current_char) + 26) % 26\r\n counterclockwise_dist = (ord(current_char) - ord(char) + 26) % 26\r\n rotations_needed = min(clockwise_dist, counterclockwise_dist)\r\n total_rotations += rotations_needed\r\n current_char = char\r\n \r\n return total_rotations\r\n\r\nexhibit_name = input().strip()\r\n\r\nresult = min_rotations_to_print(exhibit_name)\r\nprint(result)\r\n", "alpha = ['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\nsum1 = 0\r\nls = list(s)\r\nls.insert(0,'a')\r\nfor i in range(len(ls)-1):\r\n diff = abs(alpha.index(ls[i])-alpha.index(ls[i+1]))\r\n if diff > 13:\r\n diff = 26 - diff\r\n sum1 += diff\r\nprint(sum1)\r\n", "def main():\r\n s = input()\r\n step = 0\r\n j = 'a'\r\n for i in s:\r\n if (abs(ord(i) - ord(j))) > 13:\r\n step += (26 - abs(ord(i) - ord(j)))\r\n else:\r\n step += abs(ord(i) - ord(j))\r\n j = i\r\n print(step)\r\n\r\n\r\nmain()", "s = input()\r\nl = 0\r\nc = 0\r\nfor i in range (len(s)):\r\n if ord(s[i]) - 97 == l:\r\n c += 0\r\n elif abs(ord(s[i])-97-l) < 13:\r\n c += abs(ord(s[i]) - 97 - l)\r\n else:\r\n c += 26 - abs(ord(s[i])-97 - l)\r\n l = ord(s[i]) - 97\r\nprint (c)\r\n", "word = str(input())\r\n\r\npos = 0\r\nrotations = 0\r\nfor char in word:\r\n index = ord(char) - 97\r\n distance = abs(pos - index)\r\n if distance < 13:\r\n rotations += distance\r\n else:\r\n rotations += 26 - distance\r\n\r\n pos = index\r\nprint(rotations)\r\n", "s = str(input())\r\nans = min(abs(ord(s[0]) - ord('a')), abs(ord(s[0])-26 - ord('a')))\r\nfor i in range(len(s)-1):\r\n o1 = min(ord(s[i+1]), ord(s[i]))\r\n o2 = max(ord(s[i+1]), ord(s[i]))\r\n ans += min(abs(o1-o2), abs(o1+26-o2))\r\nprint(ans)\r\n", "str = input()\nlength = len(str)\nnow = 'a'\nnow = ord(now)\nX = 0\nY = 0\nfor i in range(0, length):\n X = min(abs(ord(str[i])-now + 26), abs(now - ord(str[i])+26))\n Y += min(abs(ord(str[i]) - now), X)\n now = ord(str[i])\nprint(Y)\n\t \t\t\t\t \t\t \t \t\t\t \t \t\t \t\t\t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n TOTAL_CHAR_LENGTH:int = 26\r\n\r\n\r\n NAME:str = input().rstrip()\r\n \r\n\r\n CHAR_INDEXES:list[int] = [ord(char)-97 for char in NAME]\r\n ROTATION_TARGET_INDEXES:list[int] = [0] + CHAR_INDEXES\r\n\r\n minRotationCounts:list[int] = []\r\n for rotationPosIndex in range(len(ROTATION_TARGET_INDEXES)-1) :\r\n minRotationCounts.append(min(\r\n abs(ROTATION_TARGET_INDEXES[rotationPosIndex+1]-ROTATION_TARGET_INDEXES[rotationPosIndex]),\r\n TOTAL_CHAR_LENGTH-abs(ROTATION_TARGET_INDEXES[rotationPosIndex+1]-ROTATION_TARGET_INDEXES[rotationPosIndex])\r\n ))\r\n\r\n\r\n print(sum(minRotationCounts))\r\n\r\nmain()", "s = input()\r\n\r\ncurrent = 'a'\r\nsum = 0\r\nfor i in s:\r\n dif = abs(ord(current) - ord(i))\r\n if dif > 13:\r\n dif = 26 - dif\r\n current = i\r\n sum += dif\r\nprint(sum)", "str = input()\r\ncurrent_char = 'a'\r\nrotations = 0\r\n\r\nfor ch in str:\r\n difference_btwn_chars = abs(ord(ch) - ord(current_char))\r\n rotations += min(difference_btwn_chars, (26-difference_btwn_chars) )\r\n current_char = ch\r\n\r\nprint(rotations)\r\n", "def Nigh_at_the_Museum(s):\r\n letters = 'abcdefghijklmnopqrstuvwxyz'\r\n \r\n counter = 0\r\n start = 0\r\n for i in range(len(s)):\r\n x = abs(letters.index(s[i])- letters.index(letters[start]))\r\n if x <= 13:\r\n counter += x\r\n else :\r\n counter +=(26 - x)\r\n start = letters.index(s[i])\r\n return counter\r\ns = input()\r\nprint(Nigh_at_the_Museum(s))\r\n", "import string\r\ns = \"a\" + input(); str_l = string.ascii_lowercase\r\ncount = 0\r\n\r\nfor i in range(len(s)-1):\r\n diff = abs(str_l.index(s[i]) - str_l.index(s[i+1]))\r\n if diff < 26 - diff:\r\n count += diff\r\n else:\r\n count += 26 - diff\r\nprint(count)", "exhibit_name = input().strip()\ncurrent_position = ord('a')\ntotal_rotations = 0\nfor char in exhibit_name:\n target_position = ord(char)\n clockwise_rotations = min(abs(target_position - current_position), 26 - abs(target_position - current_position))\n total_rotations += clockwise_rotations\n current_position = target_position\nprint(total_rotations)\n \t\t\t\t \t\t \t\t\t\t \t\t\t\t \t\t \t\t\t", "x=97;s=0\r\nfor i in map(ord,input()):\r\n l=abs(x-i)\r\n s+=min(l,26-l)\r\n x=i\r\nprint(s)\r\n\r\n\r\n", "x = input()\r\nans = 0\r\npon = 'a'\r\nfor i in x :\r\n ans += min(abs(ord(i)-ord(pon)),26-abs(ord(i) - ord(pon)))\r\n pon = i\r\nprint(ans)", "a = input()\r\n\r\nalphabet = \"abcdefghijklmnopqrstuvwxyz\"\r\nstatement = \"a\"\r\nbc = []\r\nres = 0\r\n\r\nfor i in a:\r\n bc.append(abs(alphabet.find(i) - alphabet.find(statement)))\r\n bc.append(26 - abs(alphabet.find(i) - alphabet.find(statement)))\r\n res += min(bc)\r\n bc.clear()\r\n statement = i\r\n\r\nprint(res)\r\n", "kolo=\"abcdefghijklmnopqrstuvwxyz\"\r\nz=list(input())\r\nile=poz=0\r\nfor i in range(len(z)):\r\n ile+=min(abs(poz-kolo.index(z[i])),26-max(poz,kolo.index(z[i]))+min(poz,kolo.index(z[i])))\r\n poz=kolo.index(z[i])\r\nprint(ile)", "n = input()\r\nstart = 'a'\r\nanswer =0\r\nfor i in n:\r\n if abs(ord(start)- ord(i)) < 13:\r\n answer +=abs(ord(start)- ord(i))\r\n start = i\r\n else:\r\n answer+= 13-(abs(ord(start)- ord(i)) - 13)\r\n start = i\r\n\r\nprint(answer)", "abc=\"abcdefghijklmnopqrstuvwxyz\"\r\ns=input()\r\nc=\"a\"\r\nres=0\r\nfor j in s:\r\n res+=min(abs(abc.index(j)-abc.index(c)), 26-abs(abc.index(j)-abc.index(c)))\r\n c=j\r\nprint(res)", "def minimum_rotations(exhibit):\r\n rotations = 0\r\n current = 'a'\r\n\r\n for c in exhibit:\r\n clockwise_distance = (ord(c) - ord(current)) % 26\r\n counterclockwise_distance = (ord(current) - ord(c)) % 26\r\n rotations += min(clockwise_distance, counterclockwise_distance)\r\n current = c\r\n\r\n return rotations\r\n\r\nexhibit = input()\r\nresult = minimum_rotations(exhibit)\r\nprint(result)\r\n", "x=input()\r\nz=0\r\nfor i in range(len(x)):\r\n if i == 0:\r\n diff = (abs(ord(x[i]) - ord('a')))\r\n if diff > 13:\r\n z += (26-diff)\r\n else:\r\n z += diff\r\n else:\r\n diff=(abs(ord(x[i]) - ord(x[i - 1])))\r\n if diff > 13:\r\n z += (26-diff)\r\n else:\r\n z += diff\r\nprint(z)", "import string\r\nn = list(input())\r\nalphabet = list(string.ascii_lowercase)\r\nres = 0\r\nindex = 0\r\n\r\nfor i in n:\r\n res += min(abs(index - alphabet.index(i)), 26 - abs(index - alphabet.index(i)))\r\n index = alphabet.index(i)\r\n\r\nprint(res)", "\r\nstr_in = str(input())\r\n#122, 97\r\nmin_num = 0\r\nprev_ascii = 97\r\nfor e in str_in:\r\n min_num += min(abs(ord(e)-prev_ascii), 26-(abs(ord(e)-prev_ascii)))\r\n prev_ascii = ord(e)\r\n\r\nprint(min_num)\r\n", "alpha = ['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 = str(input().upper())\r\n\r\nkitu = alpha[0]\r\nd = 0\r\nfor i in range(0,len(s)):\r\n thutu = alpha.index(s[i])\r\n thutu = abs(thutu-alpha.index(kitu))\r\n d += min(thutu,26-thutu)\r\n kitu = s[i]\r\n\r\nprint(d)", "\r\ns=input()\r\nalpha = 'abcdefghijklmnopqrstuvwxyz'\r\nk=0\r\ns1=0\r\n\r\nwhile k<len(s):\r\n for i in range(len(alpha)):\r\n if alpha[i]==s[k]:\r\n k=k+1\r\n s1+=i\r\n alpha=alpha[i:]+alpha[:i]\r\n break\r\n elif alpha[-(i+1)]==s[k]:\r\n k=k+1\r\n s1+=i+1\r\n alpha = alpha[-(i+1):] + alpha[:-(i+1)]\r\n break\r\n\r\n\r\nprint(s1)\r\n\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']\ns = input()\nanswer = 0\np = 0\nfor i in s:\n n = a.index(i)\n temp = abs(n - p)\n answer += min(temp, abs(26- temp))\n p = n\nprint(answer)", "last = res = 0\nfor c in input():\n loc = ord(c) - 97\n res += min(abs(loc - last), 26 + loc - last, 26 + last - loc)\n last = loc\nprint(res)\n", "s = input()\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\ncurrent = 'a'\r\nmoves = 0\r\nfor c in s:\r\n\tif abs(alpha.index(c) - alpha.index(current)) > 13:\r\n\t\tmoves += 26 - abs(alpha.index(c) - alpha.index(current))\r\n\telse:\r\n\t\tmoves += abs(alpha.index(c) - alpha.index(current))\r\n\tcurrent = c\r\nprint(moves) ", "string = input()\r\nr = 0\r\ninitialpos = ord('a')\r\n\r\nfor s in string:\r\n r += min(abs(initialpos-ord(s)), 26-abs(initialpos-ord(s)))\r\n initialpos = ord(s)\r\n \r\nprint(r)", "string = input()\r\nletters = [chr(i) for i in range(97, 123)]\r\ncount = 0\r\nlast_index = 0\r\nfor char in string:\r\n count += min(abs(letters.index(char) - last_index), abs(26 - abs(letters.index(char) - last_index)))\r\n last_index = letters.index(char)\r\n\r\nprint(count)\r\n", "s = input()\r\nprev = 0\r\nans = 0\r\nfor i in range(len(s)):\r\n k = ord(s[i]) - ord('a')\r\n diff = abs(k - prev)\r\n if diff <= 13:\r\n ans += diff\r\n else:\r\n swapped = False\r\n if k < prev:\r\n tmp = prev\r\n swapped = True\r\n prev = k\r\n k = tmp\r\n dis = (prev + 1) + ((ord('z') - ord('a')) - k)\r\n ans += dis\r\n if swapped:\r\n tmp = prev\r\n prev = k\r\n k = tmp\r\n prev = k\r\nprint(ans)", "def solution(s):\r\n sum = 0\r\n diff = 0\r\n ref = ord('a')\r\n for c in s:\r\n diff = abs(ref - ord(c))\r\n if (diff > 13):\r\n diff = 26 - diff\r\n sum = sum + diff\r\n ref = ord(c)\r\n return sum\r\n\r\n\r\ni = input()\r\nprint(solution(i))", "s = input()\r\ns = 'a' + s\r\nmove = 0\r\nfor i in range(1,len(s)):\r\n cur = s[i]\r\n pre = s[i-1]\r\n fw = abs(ord(s[i-1])-ord(s[i]))\r\n bw = 26 - fw\r\n move+= min(fw,bw)\r\nprint(move) ", "c=0 ;x='a'\nfor i in str(input()):c+=min(abs(ord(x)-ord(i)),26-abs(ord(x)-ord(i))) ; x=i\nprint(c)\n \t \t \t\t\t \t \t \t\t \t\t \t\t\t \t\t \t", "start = 'a'\r\nword = input()\r\nlength = len(word)\r\nsteps = 0\r\nfor i in range (0,(length)):\r\n m1 = abs(ord(word[i]) - ord(start))\r\n m2 = 26 - m1\r\n steps += min(m1,m2)\r\n start = word[i]\r\nprint(steps)\r\n\r\n ", "alphabet = [chr(item) for item in range(ord(\"a\"), ord(\"z\") + 1)]\ncount=0\nk=[\"a\"]; k.extend(list(input()))\nfor i in range(len(k)-1):\n ind_1,ind_2=alphabet.index(k[i]),alphabet.index(k[i+1])\n if abs(ind_2-ind_1)<(26-max(ind_1,ind_2)+min(ind_1,ind_2)):\n count+=abs(ind_2-ind_1)\n else:\n count+=(26-max(ind_1,ind_2)+min(ind_1,ind_2))\nprint(count)\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']\ns = list(map(str,input()))\npointer = 0\nc = 0\nfor each in s:\n pos = a.index(each)\n fd = abs(pointer-pos)\n bd = abs(len(a)-fd)\n c += min(fd,bd)\n pointer = pos\nprint(c)\n\n", "z=input()\r\ni=97\r\nh=[]\r\nk=[]\r\nwhile i<=122:\r\n if i>=97 and i<=109:\r\n h.append(chr(i))\r\n i=i+1\r\n else:\r\n k.append(chr(i))\r\n i=i+1\r\nc=h+k\r\nj=['a']\r\nw=len(k)-1\r\nwhile w>=0:\r\n j.append(k[w])\r\n w=w-1\r\ne=\"a\"\r\ns=0\r\nfor i in z:\r\n if e in h and i in h:\r\n s = s + ((h.index(e) - h.index(i)) ** 2) ** .5\r\n e = i\r\n elif e in j and i in j:\r\n s = s + ((j.index(e) - j.index(i)) ** 2) ** .5\r\n e = i\r\n else:\r\n if (((c.index(e) - c.index(i)) ** 2) ** .5) > 13:\r\n s = s + 26 - (((c.index(e) - c.index(i)) ** 2) ** .5)\r\n e = i\r\n else:\r\n s = s + ((c.index(e) - c.index(i)) ** 2) ** .5\r\n e = i\r\nprint(int(s))", "a = 97\r\no = 0\r\nfor c in map(ord, input()):\r\n m = abs(a-c)\r\n o += min(m,26-m)\r\n a = c\r\nprint(o)", "name = input()\r\npos = 'a'\r\ndist = 0\r\nfor ch in name:\r\n dist += min(abs(ord(pos) - ord(ch)), 26-abs(ord(pos) - ord(ch)))\r\n pos = ch\r\nprint(dist)", "name = input()\r\nrot = 0\r\nif name[0] != 'a' :\r\n name = 'a' + name\r\nfor i in range(len(name)-1) :\r\n if abs(ord(name[i])-ord(name[i+1])) > abs(abs(ord(name[i+1])-ord(name[i])) -26) :\r\n rot += abs(abs(ord(name[i+1])-ord(name[i])) -26)\r\n else :\r\n rot += abs(ord(name[i])-ord(name[i+1])) \r\n\r\nprint(rot) ", "s = input()\r\ncurr = 'a'\r\ncount = 0\r\nfor i in s:\r\n # count += min(abs(ord(i) - ord(curr)), ord(curr) - 96 + 26 - ord(i) - 97)\r\n count += min(abs(ord(i) - ord(curr)), 26 - abs((ord(i) - ord(curr))))\r\n curr = i\r\nprint(count)", "x=input()\r\nx='a'+x\r\nk,s=0,0\r\nfor i in range(1,len(x)):\r\n k=ord(x[i])-ord(x[i-1])\r\n if k<0:\r\n k=26+k\r\n if k>13:\r\n k=26-k\r\n s+=k\r\nprint(s)", "n = input()\r\np = 'a'\r\nr = 0\r\n\r\nfor i in range(len(n)):\r\n c = abs(ord(n[i]) - ord(p))\r\n a = 26 - c\r\n r += min(a, c)\r\n p = n[i]\r\n\r\nprint(r)\r\n", "s = input()\r\nn = len(s)\r\nl = \"a\"\r\nc = 0\r\nfor i in range(n):\r\n x = abs(ord(l)-ord(s[i]))\r\n c += min(x, 26-x)\r\n l = s[i]\r\nprint(c)\n# Tue Jul 04 2023 11:20:01 GMT+0300 (Moscow Standard Time)\n", "n = input();\r\nsum = 0;\r\nstart = 97;\r\n\r\nfor i in range(len(n)):\r\n k = abs(ord(n[i]) - start);\r\n if k <= 13: sum+=k;\r\n else: sum+=(26 - k);\r\n start = ord(n[i]);\r\n\r\nprint(sum);", "import string\r\n\r\na = list(string.ascii_lowercase)\r\n\r\nx = input()\r\n\r\nindices=[]\r\nfor i in range(0,len(x)):\r\n for j in range(0,len(a)):\r\n if x[i] == a[j]:\r\n \r\n indices.append(j)\r\n break\r\n\r\nn=[]\r\nfor i in range(0,len(indices)):\r\n if i == 0:\r\n if indices[0] >= 13:\r\n n.append(26-indices[0])\r\n else:\r\n n.append(indices[0])\r\n else:\r\n \r\n n.append(abs(indices[i]-indices[i-1]))\r\n \r\n\r\n\r\nfor i in range(0,len(n)):\r\n if n[i] >= 13:\r\n n[i] = 26 - n[i]\r\nn \r\nprint(sum(n))", "s = int()\r\nref_wheel = int(97)\r\n \r\nfor c in input() :\r\n \r\n if ord(c) == ref_wheel :\r\n continue\r\n elif ord(c) < ref_wheel :\r\n s += min( ref_wheel - ord(c), (ord(c) - 97) + (123 - ref_wheel) )\r\n ref_wheel = ord(c)\r\n continue\r\n else :\r\n s += min(ord(c) - ref_wheel, (ref_wheel - 97) + (123 - ord(c)) )\r\n ref_wheel = ord(c)\r\n continue\r\n \r\nprint(s)", "s = 0\r\nx = input()\r\na = 'a'\r\nfor i in x :\r\n b = i\r\n if a > b :\r\n a , b = b , a\r\n m = min(ord(b) - ord(a) , ord('z') - ord(b) + ord(a) - ord('a') + 1)\r\n s += m\r\n a = i\r\nprint(s)\r\n", "exhibit=input()\r\nsum=0\r\nif ord(exhibit[0])-ord(\"a\") >13:\r\n haha=26-(ord(exhibit[0])-ord(\"a\"))\r\nelse:\r\n haha=ord(exhibit[0])-ord(\"a\")\r\nsum=haha\r\nfor i in range(1,len(exhibit)):\r\n if abs(ord(exhibit[i])-ord(exhibit[i-1])) <= 13:\r\n sum+=abs(ord(exhibit[i])-ord(exhibit[i-1])) \r\n else:\r\n if ord(exhibit[i])>ord(exhibit[i-1]):\r\n sum+=26-(ord(exhibit[i])-ord(exhibit[i-1]))\r\n else: \r\n sum+=26-(ord(exhibit[i-1])-ord(exhibit[i])) \r\nprint(sum)", "string = input()\n\nsum = 0\nstring = \"a\" + string\nfor i in range(len(string) - 1):\n if(abs(ord(string[i]) - ord(string[i+1])) < 13):\n sum += abs(ord(string[i]) - ord(string[i+1]))\n else:\n sum += 26 - abs(ord(string[i]) - ord(string[i+1]))\n\nprint(sum)\n \t \t\t \t \t \t \t \t\t \t\t \t \t", "import string\nclass Solution():\n\n def number_of_rotations_of_the_wheel():\n abc = string.ascii_lowercase\n word = input()\n rotations_of_the_wheel = 0\n left_index, right_index = 0, 0\n\n for letter in word:\n left_counter, right_counter = 0, 0\n\n while abc[left_index] != letter and abc[right_index] != letter:\n right_index -= 1\n left_counter += 1\n right_counter += 1\n\n if left_index == len(abc)-1:\n left_index = 0\n else:\n left_index += 1\n\n if left_counter < right_counter:\n rotations_of_the_wheel += left_counter\n else:\n rotations_of_the_wheel += right_counter\n\n left_index, right_index = abc.index(letter), abc.index(letter)\n \n return rotations_of_the_wheel\n\n\nif __name__ == '__main__':\n print(Solution.number_of_rotations_of_the_wheel())", "s = input()\r\n\r\ncount = 0\r\n\r\nn1 = abs(ord('a') - ord(s[0]))\r\nn2 = 26 - n1\r\nif n1 > n2:\r\n count += n2\r\nelse:\r\n count += n1\r\n\r\nfor i in range(len(s) - 1):\r\n n1 = abs(ord(s[i]) - ord(s[i + 1]))\r\n n2 = 26 - n1\r\n if n1 > n2:\r\n count += n2\r\n else:\r\n count += n1\r\n\r\nprint(count)\r\n", "a_ord = 97\r\nresult = 0\r\n\r\nfor word in map(ord, input()):\r\n s = abs(a_ord - word)\r\n result += min(s, 26-s)\r\n a_ord = word\r\n\r\nprint(result)", "s = input()\r\nlen = len(s)\r\nSmoves = 0\r\nstrt = 0 # a\r\nfor i in range(len):\r\n index = ord(s[i]) - 97\r\n walk = abs(strt - index)\r\n if walk > 13:\r\n Smoves += 26 - walk\r\n else:\r\n Smoves += walk\r\n strt = index\r\nprint(Smoves)", "'''\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. Night at the Museum\r\n SOLUTATOIN....\r\n\r\n ************************************************************************\r\n'''\r\n\r\nm=input(\"\")\r\nt=0\r\na=\"a\"\r\nfor i in range(len(m)):\r\n r=abs(ord(m[i])-ord(a))\r\n if abs(26-r)<r:\r\n t+=26-r\r\n else:\r\n t+=r\r\n a=m[i]\r\nprint(t)", "s = str(input())\r\nmoves = 0\r\ncurrent = 0\r\n\r\nA = ord('a')\r\nZ = ord(\"z\")\r\n\r\nfor i in range(len(s)):\r\n x = ord(s[i])\r\n if A <= x <= Z:\r\n x -= A\r\n moves += min(abs(x-current), 26 - abs(x-current))\r\n current = x\r\n else:\r\n break\r\nprint(moves)", "s = input().strip()\r\ncurr = 'a'\r\nmoves = 0\r\nfor c in s:\r\n dist = abs(ord(c) - ord(curr))\r\n moves += min(dist, 26 - dist)\r\n curr = c\r\nprint(moves)\r\n", "c = ord(\"a\")\r\nans = 0\r\nfor x in map(ord, input()):\r\n d = abs(x - c)\r\n ans += min(d, 26 - d)\r\n c = x\r\nprint(ans) ", "def displacement(a,b):\r\n a=ord(a)-97\r\n b=ord(b)-97\r\n return min(abs(a-b),26-abs(a-b))\r\na=input()\r\nk=0\r\nd='a'\r\nfor i in a:\r\n k+=displacement(i,d)\r\n d=i\r\nprint(k)", "s=input()\r\ns='a'+s\r\nans=0\r\nfor i in range(1,len(s)):\r\n ans=ans+min((ord(s[i])-ord(s[i-1])+26)%26,(ord(s[i-1])-ord(s[i])+26)%26)\r\nprint(ans)\r\n", "s=input()\r\ns='a'+s\r\nans=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\nfor i in range(len(s)-1):\r\n if s[i+1]<s[i]:\r\n ans+=min(26-a.index(s[i])+a.index(s[i+1]),a.index(s[i])-a.index(s[i+1]))\r\n else:\r\n ans+=min(a.index(s[i])-a.index(s[i+1])+26,a.index(s[i+1])-a.index(s[i]))\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef checker(n):\r\n return ord(n)\r\n\r\n\r\ndef main():\r\n str_ = list(map(checker, input().rstrip()))\r\n distance = 0\r\n start = 97\r\n end = 122\r\n last_place = start\r\n for i in str_:\r\n if i < last_place:\r\n small = i\r\n big = last_place\r\n else:\r\n small = last_place\r\n big = i\r\n distance += min(big - small, ((end - big) + (small - start) + 1))\r\n last_place = i\r\n output(str(distance))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# 731\r\n\r\n# If the number of moves is greater than 13, we take that number\r\n# and subtract 26 from it. If it's = or less, we take that number.\r\n\r\n# I feel like a damn genius for solving this with the ascii codes.\r\n\r\n\r\nword = list(input())\r\nstart = \"a\"\r\ntarget = \"\"\r\nminMoves = 0\r\n\r\nfor i in range(len(word)):\r\n target = word[i]\r\n \r\n distance = abs(ord(start) - ord(target))\r\n \r\n if distance > 13:\r\n minMoves += (26-distance)\r\n else:\r\n minMoves += distance\r\n \r\n start = word[i]\r\n\r\noutput = minMoves\r\n\r\nprint(output)\r\n ", "name = input()\r\nrotation = 0\r\ncurrent = \"a\"\r\nfor letter in name:\r\n if abs(ord(current) - ord(letter)) > 13:\r\n rotation += 26 - abs(ord(current) - ord(letter))\r\n else:\r\n rotation += abs(ord(current) - ord(letter))\r\n current = letter\r\nprint(rotation)\r\n\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip())\r\nx = 0\r\nans = 0\r\nfor i in s:\r\n u = i - 97\r\n ans += min((x - u) % 26, (u - x) % 26)\r\n x = u\r\nprint(ans)", "def distance_between_characters(char1, char2):\r\n clockwise_distance = abs(ord(char1) - ord(char2))\r\n counterclockwise_distance = 26 - clockwise_distance\r\n return min(clockwise_distance, counterclockwise_distance)\r\n\r\n\r\ndef solve(name):\r\n current_pointer = 'a'\r\n total_rotations = 0\r\n for ch in name:\r\n total_rotations += distance_between_characters(current_pointer, ch)\r\n current_pointer = ch\r\n return total_rotations\r\n\r\n\r\nname = input()\r\nprint(solve(name))\r\n", "import string\nabc = list(string.ascii_lowercase)\nword = str(input())\n\nx = abc.index('a')\nl = len(abc)\ndistance = 0\n\nfor char in word:\n\ty = abc.index(char)\n\tdistance += min(abs(x - y), l - abs(x - y))\n\tx = y\n\nprint(distance)\n", "s = \"a\" + input().lower()\r\nsm = 0\r\nfor i in range(1,len(s)):\r\n diff = abs(ord(s[i])-ord(s[i - 1]))\r\n sm += min(diff, 26 - diff)\r\nprint(sm)", "s = input()\r\nc = 0\r\nd = 'a'\r\nfor i in s:\r\n j = abs(ord(i) - ord(d))\r\n c += min(j, 26-j)\r\n d = i\r\nprint(c)" ]

[ "import math\r\n\r\n\r\ndef solve():\r\n def can_place(x, y):\r\n for dx in range(-1, 2):\r\n for dy in range(-1, 2):\r\n if [dx, dy] == [0, 0] or dx * dy != 0:\r\n continue\r\n if abs(f[x + dx][y + dy] - f[x][y]) == 1:\r\n return False\r\n return True\r\n\r\n n, m = map(int, input().split())\r\n if [min(n, m), max(n, m)] in [[1, 2], [1, 3], [2, 2]]:\r\n print(-1)\r\n else:\r\n f = [[-1 for i in range(m + 2)] for j in range(n + 2)]\r\n pattern = []\r\n used = set()\r\n order = 0\r\n for i in range(2, n * m + 1, 2): pattern.append(i)\r\n for i in range(1, n * m + 1, 2): pattern.append(i)\r\n\r\n for i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n not_place = True\r\n while not_place:\r\n f[i][j] = pattern[order]\r\n if can_place(i, j) and pattern[order] not in used:\r\n used.add(pattern[order])\r\n not_place = False\r\n order = (order + 1) % (m * n)\r\n\r\n for i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n print(f[i][j], end=\" \")\r\n print()\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n, m = map(int, input().split())\r\n\r\ndef solve0(n, m):\r\n swapped = False\r\n if n < m:\r\n n, m = m, n\r\n swapped = True\r\n ret = solve(n, m)\r\n\r\n new_ret = [[0 for i in range(n)] for j in range(m)]\r\n if swapped and ret != -1:\r\n for i in range(m):\r\n for j in range(n):\r\n new_ret[i][j] = ret[j][i]\r\n\r\n ret = new_ret\r\n\r\n return ret\r\n\r\n\r\n\r\ndef solve(n, m):\r\n if m == 1 and n == 4:\r\n return [[3], [1], [4], [2]]\r\n if m == 2 and n == 3:\r\n return [[5, 3], [1, 6], [4, 2]]\r\n field = [[0 for i in range(m)] for j in range(n)]\r\n\r\n def adv(i, j):\r\n j += 1\r\n if j == m:\r\n j = 0\r\n i += 1\r\n return i, j\r\n\r\n def arrange(vals0, vals1):\r\n i, j = 0, 0\r\n for val in vals0:\r\n field[i][j] = val\r\n i, j = adv(i, j)\r\n for val in vals1:\r\n field[i][j] = val\r\n i, j = adv(i, j)\r\n\r\n good = True\r\n for i in range(n):\r\n for j in range(m):\r\n if i + 1 < n:\r\n good &= abs(field[i + 1][j] - field[i][j]) > 1\r\n if j + 1 < m:\r\n good &= abs(field[i][j + 1] - field[i][j]) > 1\r\n return good\r\n\r\n all_odd = list(range(1, n * m + 1, 2))\r\n all_even = list(range(2 , n * m + 1, 2))\r\n\r\n g = arrange(all_odd, all_even)\r\n if g:\r\n return field\r\n all_odd = all_odd[::-1]\r\n if g:\r\n return field\r\n all_even = all_even[::-1]\r\n if g:\r\n return field\r\n all_odd = all_odd[::-1]\r\n if g:\r\n return field\r\n\r\n return -1;\r\n\r\nret = solve0(n, m)\r\nif ret == -1:\r\n print(ret)\r\nelse:\r\n for x in ret:\r\n print(' '.join(map(str, x)))" ]

[ "from decimal import *\r\nx,y,z=map(Decimal,input().split())\r\nprint(max((y**z*x.ln(),9,'x^y^z'),(z**y*x.ln(),8,'x^z^y'),(y*z*x.ln(),7,'(x^y)^z'),\r\n(x**z*y.ln(),6,'y^x^z'),(z**x*y.ln(),5,'y^z^x'),(z*x*y.ln(),4,'(y^x)^z'),(x**y*z.ln(),3,'z^x^y'),(y**x*z.ln(),2,'z^y^x'),(y*x*z.ln(),1,'(z^x)^y'))[2])", "from decimal import *\r\n\r\nmyothercontext = Context(prec=60, rounding=ROUND_HALF_DOWN, Emin=-999999, Emax=999999)\r\nsetcontext(myothercontext)\r\n\r\nx,y,z = [Decimal(x) for x in input().split()]\r\n\r\n\r\nansVal=0\r\n\r\n\r\na= [\"x^y^z\", \"x^z^y\", \"(x^y)^z\", \"(x^z)^y\", \"y^x^z\",\"y^z^x\", \"(y^x)^z\", \"(y^z)^x\", \"z^x^y\", \"z^y^x\", \"(z^x)^y\", \"(z^y)^x\"]\r\n#print(len(a))\r\neps=Decimal(1e-9)\r\n\r\nevil = False\r\nfor u in a:\r\n \r\n #print(u,eval(u.replace(\"^\",\"**\")))\r\n try:\r\n if eval(u.replace(\"^\",\"**\"))-eps>ansVal:\r\n ans=u\r\n ansVal=eval(u.replace(\"^\",\"**\"))\r\n except:\r\n evil = True\r\n \r\nif not evil:\r\n print(ans)\r\nelse:\r\n guys = [s for s in a if s.find('(')==-1]\r\n def f(s):\r\n return eval(\"(\"+ s.replace('^',',')+\")\")\r\n \r\n guys2 = [f(s) for s in guys]\r\n \r\n ansVal = (Decimal(2000),Decimal(2000),Decimal(2000))\r\n for x,y in zip(guys,guys2):\r\n if y<ansVal:\r\n ansVal=y\r\n ans=x\r\n print(ans)\r\n \r\n", "from decimal import Decimal\r\nx,y,z = map(Decimal, input().split())\r\na = ['x^y^z', 'x^z^y', '(x^y)^z', 'y^x^z', 'y^z^x', '(y^x)^z',\r\n 'z^x^y', 'z^y^x', '(z^x)^y']\r\nf = [y ** z * x.ln(), z ** y * x.ln(), y * z * x.ln(), x ** z * y.ln(),\r\n z ** x * y.ln(), x * z * y.ln(), x ** y * z.ln(), y ** x * z.ln(),\r\n x * y * z.ln()]\r\nmax, res = -10**18, 0\r\nfor i, j in enumerate(f):\r\n if j > max:\r\n max, res = j, i\r\nprint(a[res])", "from math import log\n\ndef solver1(x, y, z):\n max_num = (y ** z) * log(x)\n ans = 'x^y^z'\n\n num = (z ** y) * log(x)\n if max_num < num:\n max_num = num\n ans = 'x^z^y'\n\n num = (y * z) * log(x)\n if max_num < num:\n max_num = num\n ans = '(x^y)^z'\n\n num = (x ** z) * log(y)\n if max_num < num:\n max_num = num\n ans = 'y^x^z'\n\n num = (z ** x) * log(y)\n if max_num < num:\n max_num = num\n ans = 'y^z^x'\n\n num = (x * z) * log(y)\n if max_num < num:\n max_num = num\n ans = '(y^x)^z'\n\n num = (x ** y) * log(z)\n if max_num < num:\n max_num = num\n ans = 'z^x^y'\n\n num = (y ** x) * log(z)\n if max_num < num:\n max_num = num\n ans = 'z^y^x'\n\n num = (x * y) * log(z)\n if max_num < num:\n max_num = num\n ans = '(z^x)^y'\n\n return ans\n\ndef solver2(x, y, z):\n max_num = z * log(y) + log(log(x))\n ans = 'x^y^z'\n\n num = y * log(z) + log(log(x))\n if max_num < num:\n max_num = num\n ans = 'x^z^y'\n\n num = log(y) + log(z) + log(log(x))\n if max_num < num:\n max_num = num\n ans = '(x^y)^z'\n\n num = z * log(x) + log(log(y))\n if max_num < num:\n max_num = num\n ans = 'y^x^z'\n\n num = x * log(z) + log(log(y))\n if max_num < num:\n max_num = num\n ans = 'y^z^x'\n\n num = log(x) + log(z) + log(log(y))\n if max_num < num:\n max_num = num\n ans = '(y^x)^z'\n\n num = y * log(x) + log(log(z))\n if max_num < num:\n max_num = num\n ans = 'z^x^y'\n\n num = x * log(y) + log(log(z))\n if max_num < num:\n max_num = num\n ans = 'z^y^x'\n\n num = log(x) + log(y) + log(log(z))\n if max_num < num:\n max_num = num\n ans = '(z^x)^y'\n\n return ans\n\ndef solverX(x, y, z):\n max_num = z * log(x) + log(log(y))\n ans = 'y^x^z'\n\n num = x * log(z) + log(log(y))\n if max_num < num:\n max_num = num\n ans = 'y^z^x'\n\n num = log(x) + log(z) + log(log(y))\n if max_num < num:\n max_num = num\n ans = '(y^x)^z'\n\n num = y * log(x) + log(log(z))\n if max_num < num:\n max_num = num\n ans = 'z^x^y'\n\n num = x * log(y) + log(log(z))\n if max_num < num:\n max_num = num\n ans = 'z^y^x'\n\n num = log(x) + log(y) + log(log(z))\n if max_num < num:\n max_num = num\n ans = '(z^x)^y'\n\n return ans\n\ndef solverY(x, y, z):\n max_num = z * log(y) + log(log(x))\n ans = 'x^y^z'\n\n num = y * log(z) + log(log(x))\n if max_num < num:\n max_num = num\n ans = 'x^z^y'\n\n num = log(y) + log(z) + log(log(x))\n if max_num < num:\n max_num = num\n ans = '(x^y)^z'\n\n num = y * log(x) + log(log(z))\n if max_num < num:\n max_num = num\n ans = 'z^x^y'\n\n num = x * log(y) + log(log(z))\n if max_num < num:\n max_num = num\n ans = 'z^y^x'\n\n num = log(x) + log(y) + log(log(z))\n if max_num < num:\n max_num = num\n ans = '(z^x)^y'\n\n return ans\n\ndef solverZ(x, y, z):\n max_num = z * log(y) + log(log(x))\n ans = 'x^y^z'\n\n num = y * log(z) + log(log(x))\n if max_num < num:\n max_num = num\n ans = 'x^z^y'\n\n num = log(y) + log(z) + log(log(x))\n if max_num < num:\n max_num = num\n ans = '(x^y)^z'\n\n num = z * log(x) + log(log(y))\n if max_num < num:\n max_num = num\n ans = 'y^x^z'\n\n num = x * log(z) + log(log(y))\n if max_num < num:\n max_num = num\n ans = 'y^z^x'\n\n num = log(x) + log(z) + log(log(y))\n if max_num < num:\n max_num = num\n ans = '(y^x)^z'\n\n return ans\n\nx, y, z = map(float, input().split())\nif x <= 1 and y <= 1 and z <= 1:\n ans = solver1(x, y, z)\nelif x > 1 and y > 1 and z > 1:\n ans = solver2(x, y, z)\nelif x > 1 and y <= 1 and z <= 1:\n ans = solver1(x, y, z)\nelif x <= 1 and y > 1 and z <= 1:\n ans = solver1(x, y, z)\nelif x <= 1 and y <= 1 and z > 1:\n ans = solver1(x, y, z)\nelif x > 1 and y > 1 and z <= 1:\n ans = solverZ(x, y, z)\nelif x > 1 and y <= 1 and z > 1:\n ans = solverY(x, y, z)\nelif x <= 1 and y > 1 and z > 1:\n ans = solverX(x, y, z)\n\nprint (ans)", "import math\r\nar=list(map(float,input().split()))\r\nmn=-float('inf')\r\nmns=\"\"\r\ndef xyz(x,y,z,op):\r\n if(op==1):\r\n return (x**y**z,\"x^y^z\")\r\n elif(op==2):\r\n return (x**z**y,\"x^z^y\")\r\n elif(op==5):\r\n return (y**x**z,\"y^x^z\")\r\n elif(op==6):\r\n return (y**z**x,\"y^z^x\")\r\n elif(op==9):\r\n return (z**x**y,\"z^x^y\")\r\n elif(op==10):\r\n return (z**y**x,\"z^y^x\")\r\n elif(op==3):\r\n return ((x**y)**z,\"(x^y)^z\")\r\n elif(op==4):\r\n return ((x**z)**y,\"(x^z)^y\")\r\n elif(op==7):\r\n return ((y**x)**z,\"(y^x)^z\")\r\n elif(op==8):\r\n return ((y**z)**x,\"(y^z)^x\")\r\n elif(op==11):\r\n return ((z**x)**y,\"(z^x)^y\")\r\n elif(op==12):\r\n return ((z**y)**x,\"(z^y)^x\")\r\ndef xyz2(x,y,z,op):\r\n if(op==1):\r\n try:\r\n vl=math.log2(math.log2(x))+math.log2(y)*z\r\n except:\r\n vl=-float('inf')\r\n return (vl,\"x^y^z\")\r\n elif(op==2):\r\n try:\r\n vl=math.log2(math.log2(x))+math.log2(z)*y\r\n except:\r\n vl=-float('inf')\r\n return (vl,\"x^z^y\")\r\n elif(op==5):\r\n try:\r\n vl=math.log2(math.log2(y))+math.log2(x)*z\r\n except:\r\n vl=-float('inf')\r\n return (vl,\"y^x^z\")\r\n elif(op==6):\r\n try:\r\n vl=math.log2(math.log2(y))+math.log2(z)*x\r\n except:\r\n vl=-float('inf')\r\n return (vl,\"y^z^x\")\r\n elif(op==9):\r\n try:\r\n vl=math.log2(math.log2(z))+math.log2(x)*y\r\n except:\r\n vl=-float('inf')\r\n return (vl,\"z^x^y\")\r\n elif(op==10):\r\n try:\r\n vl=math.log2(math.log2(z))+math.log2(y)*x\r\n except:\r\n vl=-float('inf')\r\n return (vl,\"z^y^x\")\r\n elif(op==3):\r\n try:\r\n vl=math.log2(math.log2(x))+math.log2(y)+math.log2(z)\r\n except:\r\n vl=-float('inf')\r\n return (vl,\"(x^y)^z\")\r\n elif(op==4):\r\n try:\r\n vl=math.log2(math.log2(x))+math.log2(z)+math.log2(y)\r\n except:\r\n vl=-float('inf')\r\n return (vl,\"(x^z)^y\")\r\n elif(op==7):\r\n try:\r\n vl=math.log2(math.log2(y))+math.log2(x)+math.log2(z)\r\n except:\r\n vl=-float('inf')\r\n return (vl,\"(y^x)^z\")\r\n elif(op==8):\r\n try:\r\n vl=math.log2(math.log2(y))+math.log2(x)+math.log2(z)\r\n except:\r\n vl=-float('inf')\r\n return (vl,\"(y^z)^x\")\r\n elif(op==11):\r\n try:\r\n vl=math.log2(math.log2(z))+math.log2(x)+math.log2(y)\r\n except:\r\n vl=-float('inf')\r\n return (vl,\"(z^x)^y\")\r\n elif(op==12):\r\n try:\r\n vl=math.log2(math.log2(z))+math.log2(x)+math.log2(y)\r\n except:\r\n vl=-float('inf')\r\n return (vl,\"(z^y)^x\")\r\nE=[[0,1,2],[0,2,1],[1,0,2],[1,2,0],[2,0,1],[2,1,0]]\r\nif(max(ar)<4.1):\r\n for i in range(1,13):\r\n a=xyz(ar[0],ar[1],ar[2],i)\r\n #print(a)\r\n if(a[0]-1e-7>mn):\r\n mn=a[0]\r\n mns=a[1]\r\nelse:\r\n for i in range(1,13):\r\n a=xyz2(ar[0],ar[1],ar[2],i)\r\n #print(a)\r\n if(a[0]-1e-7>mn):\r\n mn=a[0]\r\n mns=a[1]\r\nprint(mns)\r\n \r\n" ]

[ "from itertools import permutations\r\nv = []\r\nfor p in permutations(input() for i in range(6)):\r\n if len(p[1]) != len(p[0]) + len(p[2]) - 1 or len(p[4]) != len(p[3]) + len(p[5]) - 1:\r\n continue\r\n elif p[0][0] != p[3][0] or p[0][-1] != p[4][0]:\r\n continue\r\n elif p[1][0] != p[3][-1] or p[1][len(p[0]) - 1] != p[4][len(p[3]) - 1] or p[1][-1] != p[5][0]:\r\n continue\r\n elif p[2][0] != p[4][-1] or p[2][-1] != p[5][-1]:\r\n continue\r\n else:\r\n x, y, c = '.' * (len(p[1]) - len(p[0])), '.' * \\\r\n (len(p[1]) - len(p[2])), []\r\n c.append(p[0] + x)\r\n for i in range(1, len(p[3]) - 1):\r\n c.append(p[3][i] + '.' * (len(p[0]) - 2) + p[4][i] + x)\r\n c.append(p[1])\r\n for i in range(1, len(p[5]) - 1):\r\n c.append(y + p[4][len(p[3]) + i - 1] +\r\n '.' * (len(p[2]) - 2) + p[5][i])\r\n c.append(y + p[2])\r\n v.append(c)\r\nprint('\\n'.join(sorted(v)[0]) if v else 'Impossible')\r\n", "import sys\r\nfrom array import array # noqa: F401\r\nfrom itertools import permutations\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\na = [input().rstrip() for _ in range(6)]\r\nans = ['z' * 100 for _ in range(6)]\r\ninf = ['z' * 100 for _ in range(6)]\r\n\r\nfor words in permutations(a):\r\n if (\r\n len(words[0]) + len(words[4]) - 1 == len(words[2])\r\n and len(words[1]) + len(words[5]) - 1 == len(words[3])\r\n and words[0][0] == words[1][0]\r\n and words[1][-1] == words[2][0]\r\n and words[0][-1] == words[3][0]\r\n and words[2][len(words[0]) - 1] == words[3][len(words[1]) - 1]\r\n and words[2][-1] == words[5][0]\r\n and words[3][-1] == words[4][0]\r\n and words[4][-1] == words[5][-1]\r\n ):\r\n res = [['.'] * len(words[2]) for _ in range(len(words[3]))]\r\n\r\n for i in range(len(words[0])):\r\n res[0][i] = words[0][i]\r\n for i in range(len(words[1])):\r\n res[i][0] = words[1][i]\r\n for i in range(len(words[2])):\r\n res[len(words[1]) - 1][i] = words[2][i]\r\n for i in range(len(words[3])):\r\n res[i][len(words[0]) - 1] = words[3][i]\r\n for i in range(len(words[4])):\r\n res[len(words[3]) - 1][len(words[0]) - 1 + i] = words[4][i]\r\n for i in range(len(words[5])):\r\n res[len(words[1]) - 1 + i][len(words[2]) - 1] = words[5][i]\r\n\r\n res = [''.join(row) for row in res]\r\n if ans > res:\r\n ans = res\r\n\r\nif ans == inf:\r\n print('Impossible')\r\nelse:\r\n print('\\n'.join(ans))\r\n" ]

[ "\"\"\"\r\nCreated on Fri Jan 18 12:23:03 2019\r\n\r\n@author: nm57315\r\n\"\"\"\r\n\r\nn = int(input())\r\na,b,c = (list(map(int,input().strip().split())) for x in range(3))\r\nd,e = a[0],b[0]\r\nfor x in range(1,n):\r\n d,e = max(e+a[x],d+b[x]),max(e+b[x],d+c[x])\r\nprint(d)", "n = int(input())\r\na, b, c = (list(map(int, input().split())) for i in range(3))\r\nd1, d2 = a[0], b[0]\r\nfor i in range(1, n):\r\n d1, d2 = max(d2 + a[i], d1 + b[i]), max(d2 + b[i], d1 + c[i])\r\nprint(d1)", "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nfed_left = {0 : a[0]}\nnot_fed_left = {0 : b[0]}\n\nfor i in range(1, n):\n\tfed_left[i] = max(fed_left[i-1] + b[i], not_fed_left[i-1] + a[i]) # max(fed left, fed right)\n\tnot_fed_left[i] = max(fed_left[i-1] + c[i], not_fed_left[i-1] + b[i]) # max(fed left and right, fed right)\n\nprint(fed_left[n-1])\n", "\n\nclass Solution():\n\tdef max_radiance(n, a, b, c):\n\t\tdp = [[0 for i in range(2)] for j in range(n+1)]\n\t\tdp[n-1][0] = a[n-1]\n\t\tdp[n-1][1] = b[n-1]\n\n\n\t\t# dp[i][0] - Max radiance for range [i:] when none on the left is yet fed\n\t\t# dp[i][1] - Max radiance for range [i:] when one of the left is fed\n\t\t\n\t\tfor i in range(n-2, -1, -1):\n\t\t\tdp[i][0] = max(a[i]+dp[i+1][1], b[i]+dp[i+1][0])\n\t\t\tdp[i][1] = max(b[i]+dp[i+1][1], c[i]+dp[i+1][0])\n\n\t\treturn dp[0][0]\n\nn = int(input())\n\na = list(map(int, input().strip(' ').split(' ')))\nb = list(map(int, input().strip(' ').split(' ')))\nc = list(map(int, input().strip(' ').split(' ')))\n\nprint(Solution.max_radiance(n, a, b, c))\n", "I = lambda:list(map(int, input().split()))\r\nn,= I()\r\na = I()\r\nb = I()\r\nc = I()\r\nbefore = a[0] # choosing this before the next element\r\nafter = b[0] # choosing this after the next element\r\nfor i in range(1,n):\r\n before, after = max(after + a[i], before + b[i]), max(after + b[i], before + c[i])\r\nprint(before)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\ndp=[[0]*2 for i in range(n+1)]\r\ndp[0][0]=-10**9\r\nfor i in range(n):\r\n dp[i+1][0]=max(dp[i+1][0],dp[i][0]+b[i],dp[i][1]+a[i])\r\n dp[i+1][1]=max(dp[i+1][1],dp[i][0]+c[i],dp[i][1]+b[i])\r\nprint(dp[n][0])", "n = int( input() )\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\nc = [int(x) for x in input().split()]\n\nDD = a[0]\nDP = b[0]\nPD = a[0]\nPP = b[0]\n\nfor i in range(1,n):\n\ttDD = max(DP+a[i], PP+a[i])\n\ttPD = max(PD+b[i], DD+b[i])\n\ttDP = max(DP+b[i], PP+b[i])\n\ttPP = max(PD+c[i], DD+c[i])\n\t\n\tDD = tDD\n\tPD = tPD\n\tDP = tDP\n\tPP = tPP\n\t\nif n==1:\n\tsol = DD\nelse:\n\tsol = max(DD, PD)\n\nprint( sol )\n", "def rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\n\r\ndef main():\r\n n=ri()\r\n dp=[[0 for j in range(2)]for i in range(n)]\r\n a,b,c=rl(),rl(),rl()\r\n dp[0][0]=a[0];dp[0][1]=b[0]\r\n for i in range(1,n):\r\n dp[i][0]=max(dp[i-1][1]+a[i],dp[i-1][0]+b[i])\r\n dp[i][1]=max(dp[i-1][1]+b[i],dp[i-1][0]+c[i])\r\n return dp[n-1][0]\r\nprint(main())", "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\nimport os,sys\r\nfrom io import BytesIO, IOBase\r\n\r\n# Fast IO Region\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n# print([[0,0]]*2)\r\n\r\ndef main():\r\n n=int(input())\r\n a,b,c=list(map(int,input().split())),list(map(int,input().split())),list(map(int,input().split()))\r\n f=[[_ for _ in range(4)] for i in range(n)]\r\n f[0][0],f[0][1],f[0][2],f[0][3]=a[0],float('-inf'),b[0],float('-inf')\r\n #print(f)\r\n for i in range(1,n):\r\n f[i][0]=max(f[i-1][2],f[i-1][3])+a[i]\r\n f[i][1]=max(f[i-1][0],f[i-1][1])+b[i]\r\n f[i][2]=max(f[i-1][2],f[i-1][3])+b[i]\r\n f[i][3]=max(f[i-1][0],f[i-1][1])+c[i]\r\n #print(f)\r\n print(max(f[n-1][0],f[n-1][1]))\r\n\r\nmain()\r\n\r\n\r\n\r\n", "n=int(input())\r\na=[int(v) for v in input().split()]\r\nb=[int(v) for v in input().split()]\r\nc=[int(v) for v in input().split()]\r\nf=[[-100000000, -100000000] for v in range(3010)]\r\nf[0][1]=0\r\nfor i in range(1,n+1):\r\n f[i][1]=max(f[i-1][1] + b[i-1], f[i-1][0] + c[i-1])\r\n f[i][0]=max(f[i-1][1] + a[i-1], f[i-1][0] + b[i-1])\r\nprint(f[n][0])", "# for I/O for local system\nimport sys\nfrom os import path\nif(path.exists('Input.txt')):\n sys.stdin = open('Input.txt','r')\n sys.stdout = open('Output.txt','w')\n \n# For fast I/O\ninput = sys.stdin.buffer.readline\n# input = sys.stdin.readline\nprint = sys.stdout.write\n \n# Import libraries here whenever required\nfrom random import randint\n \n# Use this because normal dict can sometimes give TLE\nclass mydict:\n def __init__(self, func=lambda: 0):\n self.random = randint(0, 1 << 32)\n self.default = func\n self.dict = {}\n def __getitem__(self, key):\n mykey = self.random ^ key\n if mykey not in self.dict:\n self.dict[mykey] = self.default()\n return self.dict[mykey]\n def get(self, key, default):\n mykey = self.random ^ key\n if mykey not in self.dict:\n return default\n return self.dict[mykey]\n def __setitem__(self, key, item):\n mykey = self.random ^ key\n self.dict[mykey] = item\n def getkeys(self):\n return [self.random ^ i for i in self.dict]\n def __str__(self):\n return f'{[(self.random ^ i, self.dict[i]) for i in self.dict]}'\n \n# learnings:\n# 1. dp states are [idx][prev] --> meaning\n# if at some idx than find out if prev element already taken or not\n# if taken then what will be the answer to the current idx \n# if not taken then what will be the answer to the current idx\n# like this have a for loop in reverse and find out answer for the 1st idx\n# because the prev element won't have any effect on after elements of the current idx\n# hence it will always work\n\n# what a cool technique\n\n# Solver function\ndef solve():\n n = int(input())\n a = [int(x) for x in input().split()]\n b = [int(x) for x in input().split()]\n c = [int(x) for x in input().split()]\n dp = [[0 for i in range(2)] for i in range(n)]\n dp[n - 1][0] = a[n - 1]\n dp[n - 1][1] = b[n - 1]\n for i in range(n - 2, -1, -1):\n dp[i][0] = max(a[i] + dp[i + 1][1], b[i] + dp[i + 1][0])\n dp[i][1] = max(b[i] + dp[i + 1][1], c[i] + dp[i + 1][0])\n print(str(dp[0][0]) + \"\\n\")\n \n# Main \nfor _ in range(1):\n solve()", "n = int(input())\r\nt = [list(map(int, input().split())) for i in range(3)]\r\nt = list(zip(*t))\r\n\r\nF = {}\r\ndef g(i, j, k):\r\n if j - i == 1: return t[i][1]\r\n a, b, c = t[k]\r\n t[k] = (b, c, 0)\r\n s = f(i, j)\r\n t[k] = (a, b, c)\r\n return s\r\n \r\ndef f(i, j):\r\n if (i, j, t[i], t[j - 1]) in F: return F[(i, j, t[i], t[j - 1])]\r\n if j - i == 1: return t[i][0]\r\n k = (i + j) // 2\r\n F[(i, j, t[i], t[j - 1])] = max(f(i, k) + g(k, j, k), g(i, k, k - 1) + f(k, j))\r\n return F[(i, j, t[i], t[j - 1])]\r\n\r\nprint(f(0, n)) ", "n = int(input())\r\nR = lambda: [int(i) for i in input().split()]\r\na, b, c = R(), R(), R()\r\nx, y = a[0], b[0]\r\nfor i in range(1, n):\r\n x, y = max(a[i] + y, b[i] + x), max(b[i] + y, c[i] + x)\r\nprint(x)" ]

[ "n=int(input())\r\na,b=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nif(a==b):\r\n for i in range(a): print(1,end=\" \")\r\n for i in range(b-1): print(2,end=\" \")\r\n print(2)\r\nelse:\r\n vec=[[i,j] for i,j in enumerate(t)]\r\n if(a<b):\r\n vec.sort(key=lambda x:(x[1],-x[0]))\r\n for i in range(-a,0): vec[i][1]=1\r\n for i in range(b): vec[i][1]=2 \r\n else:\r\n vec.sort(key=lambda x:(x[1],x[0]))\r\n for i in range(-b,0): vec[i][1]=2\r\n for i in range(a): vec[i][1]=1\r\n arr=[0]*n\r\n for i in range(n): arr[vec[i][0]]=vec[i][1]\r\n print(* arr)", "from functools import cmp_to_key\r\n\r\n\r\nI=lambda :map(int,input().split())\r\ndef fun(x,y):\r\n if x[0]==y[0]:\r\n if x[1]<y[1]:\r\n return -1\r\n if x[0]<y[0]:\r\n return -1\r\n return 1\r\n\r\ndef fun1(x,y):\r\n if x[0]==y[0]:\r\n if x[1]<y[1]:\r\n return 1\r\n else:\r\n return -1\r\n if x[0]<y[0]:\r\n return -1\r\n return 1\r\n\r\n\r\nn=int(input())\r\na,b=I()\r\narr=list(I())\r\ntemp=[[] for _ in range(n)]\r\nfor i in range(n):\r\n temp[i]=[arr[i],i]\r\nif a>b:\r\n temp.sort(key=cmp_to_key(fun))\r\n for i in range(a):\r\n temp[i][0]=1\r\n for i in range(a,n):\r\n temp[i][0]=2\r\n temp.sort(key=lambda ele:ele[1])\r\n for x,y in temp:\r\n print(x,end=\" \")\r\nelif a==b:\r\n for i in range(a):\r\n print(1,end=\" \")\r\n for i in range(a,n):\r\n print(2,end=\" \")\r\nelse:\r\n temp.sort(key=cmp_to_key(fun1))\r\n for i in range(b):\r\n temp[i][0]=2\r\n for i in range(b,n):\r\n temp[i][0]=1\r\n temp.sort(key=lambda ele:ele[1])\r\n for x,y in temp:\r\n print(x,end=\" \")\r\n \r\n \r\n \r\n \r\n \r\n ", "n=int(input())\r\na,b=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nif a<b:\r\n d=[1 for i in range(n)]\r\n e=[[] for i in range(5)]\r\n for i in range(n):\r\n e[c[i]-1].append(i)\r\n e=e[::-1]\r\n for i in range(5):\r\n e1=len(e[i])\r\n if e1>a or a==0:\r\n for j in range(a,e1):\r\n d[e[i][j]]=2\r\n a=0\r\n else:\r\n a-=e1\r\n print(*d)\r\nelif a==b:\r\n d=[1]*(n//2)+[2]*(n//2)\r\n print(*d)\r\nelse:\r\n d=[2 for i in range(n)]\r\n e=[[] for i in range(5)]\r\n for i in range(n):\r\n e[c[i]-1].append(i)\r\n e=e[::-1]\r\n for i in range(5):\r\n e1=len(e[i])\r\n if e1>b or b==0:\r\n for j in range(e1-b):\r\n d[e[i][j]]=1\r\n b=0\r\n else:\r\n b-=e1\r\n print(*d)", "\r\n\r\n\r\nn=int(input())\r\n\r\na,b = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\n\r\n\r\narr =[(l[i],i) for i in range(n) ]\r\n\r\n\r\nif a<b:\r\n arr.sort(key= lambda x:(-x[0] , x[1]))\r\nelse:\r\n arr.sort(key= lambda x:(-x[0], -x[1]))\r\n\r\n\r\nans=[0]*n\r\n\r\n\r\nif a<b:\r\n\r\n for i in range(a):\r\n ans[arr[i][1]]=1\r\n\r\n for i in range(a,a+b):\r\n ans[arr[i][1]]=2\r\n\r\nelif a==b:\r\n\r\n for i in range(a):\r\n ans[i]=1\r\n for i in range(a,a+a):\r\n ans[i]=2\r\nelse:\r\n\r\n for i in range(b):\r\n ans[arr[i][1]]=2\r\n for i in range(b,b+a):\r\n ans[arr[i][1]]=1\r\n\r\nprint(*ans)\r\n", "from collections import defaultdict\r\nn = int(input())\r\na, b = map(int,input().split())\r\nls = list(map(int,input().split()))\r\ndc = defaultdict(int)\r\nls1 = ls.copy()\r\nls1.sort()\r\nif a == b :\r\n for i in range(a) :\r\n print(1,end = \" \")\r\n for i in range(a) :\r\n print(2,end = \" \")\r\n exit()\r\nif a < b :\r\n ls2 = ls1[b:]\r\nelse :\r\n ls2 = ls1[:a]\r\nfor i in ls2 :\r\n dc[i] += 1\r\nfor i in ls :\r\n if dc[i] > 0 :\r\n print(1,end=\" \")\r\n dc[i] -= 1\r\n else :\r\n print(2,end=\" \")", "from functools import cmp_to_key\r\n\r\na = 0\r\nb = 0\r\ndef compare(x, y):\r\n if(x[1] < y[1]):\r\n return -1\r\n elif(x[1] > y[1]):\r\n return 1\r\n return 0\r\n\r\ndef compare1(x, y):\r\n if(x[0] < y[0]):\r\n return -1\r\n elif(x[0] > y[0]):\r\n return 1\r\n else:\r\n if(x[1] < y[1]):\r\n return -1\r\n elif(x[1] > y[1]):\r\n return 1\r\n else:\r\n return 0\r\n\r\ndef compare2(x, y):\r\n if (x[0] < y[0]):\r\n return -1\r\n elif (x[0] > y[0]):\r\n return 1\r\n else:\r\n if(x[1] > y[1]):\r\n return -1\r\n elif(x[1] < y[1]):\r\n return -1\r\n else:\r\n return 0\r\n\r\nn = int(input())\r\na, b = map(int, input().split())\r\nmarks = list(map(int, input().split()))\r\narr = []\r\nfor i in range(n):\r\n arr.append([marks[i], i])\r\n\r\n\r\nif(a==b):\r\n arr.sort(key=cmp_to_key(compare))\r\n # print(a, b)\r\n # print(arr)\r\n for i in range(n):\r\n if i < a:\r\n print(1, end=\" \")\r\n else:\r\n print(2, end=\" \")\r\n\r\nelse:\r\n if(a > b):\r\n arr.sort(key=cmp_to_key(compare1))\r\n # print(a, b)\r\n # print(arr)\r\n for i in range(n):\r\n if i < a:\r\n arr[i][0] = 1\r\n else:\r\n arr[i][0] = 2\r\n else:\r\n arr.sort(key=cmp_to_key(compare2))\r\n # print(a, b)\r\n # print(arr)\r\n for i in range(n):\r\n if i < b:\r\n arr[i][0] = 2\r\n else:\r\n arr[i][0] = 1\r\n\r\n ans = [0]*n\r\n for i in range(n):\r\n ans[arr[i][1]] = arr[i][0]\r\n\r\n for i in range(n):\r\n print(ans[i], end=\" \")\r\n", "#input\r\nn = int(input())\r\na,b = [int(d) for d in input().split()]\r\nt = [int(d) for d in input().split()]\r\n\r\narr = [s for s in range(n)]\r\nif a!= b: arr = sorted(arr,reverse=(a<b), key=(lambda i:t[i]))\r\n\r\nfor i in arr[0:a]: t[i] = 1\r\nfor i in arr[a:n]: t[i] = 2\r\nfor d in t: print(d, end=' ')" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nc = 1\r\nfor i in range(1, n//2+1):\r\n if s[:i] == s[i:i+i]:\r\n c = i\r\nprint(n-c+1)", "n = int(input())\r\ns = input().strip()\r\noperations = 0\r\n\r\nm = 0\r\nfor i in range(1, n):\r\n if s[:i] == s[i:2 * i]:\r\n m = i\r\n\r\nif m == 0:\r\n m = 1\r\n\r\noperations = n - m + 1\r\nprint(operations)# 1698406898.4884472", "n = int(input())\r\na = input()\r\nminn = 101\r\nfor i in range(n // 2 + 1):\r\n s = a[:i] * 2 + a[i * 2:]\r\n if(s == a):\r\n minn = min(minn, i + 1 * int(i != 0) + (n - i * 2))\r\nprint(minn)", "from functools import reduce\r\n_, s = input(), input()\r\nprint(reduce(lambda a, b: min(a, b + 1 + len (s) - 2 * b), [len(s)] + [x for x in range (1, len(s)) if s[:x] * 2 == s [:2*x]]))", "n = int(input())\ns = input()\nstts = False\n\nfor i in range (2, n//2+1):\n a = s[0:i]\n b = s[i:i*2]\n if (a == b):\n temp = a\n stts = True\n\nif (stts == False):\n print(n)\nelif (n == 1 or n == 2 or n == 3):\n print(n)\nelse:\n print(n - len(temp) + 1)\n \t \t \t\t \t\t \t\t\t \t\t", "n=int(input())\r\ns=input()\r\nans=n\r\nfor i in range(1, n//2+1):\r\n if s[:i]==s[i:i*2]: ans=min(ans, n-len(s[:i])+1)\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\nm = 0\r\nfor i in range(1, n // 2 + 1):\r\n x, y = [], []\r\n for j in range(i):\r\n x.append(s[j])\r\n y.append(s[i + j])\r\n if \"\".join(x) == \"\".join(y):\r\n m = i - 1\r\nans = n - m\r\nprint(ans)", "n, s, ls, curr = int(input()), input(), [], ''\nfor j in range(n):\n curr += s[j]\n if curr == s[j + 1: 2 * j + 2]:\n # print(j, curr, s[j + 1: 2 * j + 2])\n ls.append(n - j)\n else:\n ls.append(n)\nprint(min(ls))", "#from itertools import *\r\n#from math import *\r\n#from bisect import *\r\n#from collections import *\r\n#from random import *\r\n#from decimal import *\r\n#from heapq import *\r\n#from itertools import * # Things Change ....remember :)\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef inp():\r\n return int(input())\r\ndef st():\r\n return input().rstrip('\\n')\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\ndef func(a,b,c):\r\n z1=min(len(a),len(b))\r\n for i in range(z1):\r\n c.append([a.pop(),b.pop()])\r\nt=1\r\nwhile(t):\r\n t-=1\r\n n=inp()\r\n s=st()\r\n cost=n\r\n for i in range(n//2):\r\n if(s[:i+1]==s[i+1:2*(i+1)]):\r\n cost=min(cost,i+2+(n-(2*(i+1))))\r\n print(cost)\r\n", "n = int(input())\ns = input()\nfor i in range(n//2,1,-1):\n if(s[0:i]==s[i:2*i]):\n n-=i-1\n break\nprint(n)\n\n\t \t\t\t \t\t\t\t \t\t \t \t\t", "# Read the input\r\nn = int(input())\r\ns = input().strip()\r\noperations = 0\r\n\r\n# Find the maximum prefix that matches the suffix\r\nm = 0\r\nfor i in range(1, n):\r\n if s[:i] == s[i:2 * i]:\r\n m = i\r\n\r\n# If no matching prefix and suffix found, it takes at least 1 operation per character\r\nif m == 0:\r\n m = 1\r\n\r\n# Calculate the minimum number of operations\r\noperations = n - m + 1\r\nprint(operations)\r\n", "n=int(input())\r\ns=list(input())\r\nidx=n//2\r\nlst=s[:idx]\r\ni=0\r\nans=0\r\nmx=0\r\nwhile i<len(lst):\r\n j=i+1\r\n x,flag=0,0\r\n while x<=i:\r\n if lst[x]!=s[j]:flag=1; break\r\n x+=1;j+=1\r\n if flag==0:mx=i+1\r\n i+=1\r\nif mx:ans=n-mx+1\r\nelse:ans=n\r\nprint(ans)", "n = int(input())\r\ns = input()\r\ns0 = s[0]\r\nmx = 0\r\nfor i in range(1, n):\r\n mas = ''\r\n for j in range(i):\r\n if i + j >= n:\r\n break\r\n mas += s[i + j]\r\n if mas == s0:\r\n mx = max(mx, len(s0))\r\n s0 += s[i]\r\nif mx == 0:\r\n print(n)\r\nelse:\r\n print(n - mx + 1)\r\n", "n=int(input())\r\nx=0\r\ns=input()\r\nfor i in range(1,n//2+1):\r\n if s[:i]==s[i:i*2]: x=i\r\nprint(n-max(x-1,0))", "def govno(s, ix):\r\n if ix + 1 > len(s) - ix - 1: return 0\r\n n = ix + 1\r\n for i in range(n):\r\n if s[i + ix + 1] != s[i]:\r\n return 0\r\n return n\r\n\r\n_, s = input(), input()\r\nc = 0\r\nx = 0\r\nfor i in range(len(s)):\r\n x = max(x, govno(s, i))\r\nprint(len(s) if x == 0 else len(s) - x + 1)\r\n" ]

[ "a = input()\nb = list(input())\nkey = list(\"qwertyuiopasdfghjkl;zxcvbnm,./\")\nif a ==\"L\":\n d=1\nelse:\n d=-1\nn=[]\nfor i in range(len(b)):\n e = b[i]\n f = key.index(e)\n n.append(key[f+d])\nprint(''.join(n))", "kd = dict()\r\nkd[0] = 'qwertyuiop'\r\nkd[1] = 'asdfghjkl;'\r\nkd[2] = 'zxcvbnm,./'\r\nld = dict()\r\nrd = dict()\r\nfor i in range(3):\r\n for j in range(1,len(kd[i])):\r\n ld[kd[i][j]] = kd[i][j-1]\r\n for j in range(len(kd[i])-1):\r\n rd[kd[i][j]] = kd[i][j+1]\r\nq = input()\r\nw = input()\r\nif q == 'L':\r\n for x in w:\r\n print(rd[x],end='')\r\n print()\r\nif q == 'R':\r\n for x in w:\r\n print(ld[x],end='')\r\n print()\r\n", "let = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nshifting = input()\r\ncharacters = input()\r\nif shifting == \"R\":\r\n for i in characters:\r\n x = let.index(i)\r\n print(f\"{let[x-1]}\", end=\"\")\r\nelse:\r\n for i in characters:\r\n x = let.index(i)\r\n print(f\"{let[x+1]}\", end=\"\")\r\n ", "ll='qwertyuiopasdfghjkl;zxcvbnm,./'\r\n#b='s;;upimrrfod;pbr'\r\nif input()=='R':\r\n b=input()\r\n c=''\r\n for x in b:\r\n if ll.find(x)==0:\r\n c+=ll[len(ll)-1]\r\n else:\r\n c+=ll[ll.find(x)%len(ll)-1]\r\n print(c)\r\nelse:\r\n b=input()\r\n c=''\r\n for x in b:\r\n if ll.find(x)==29:\r\n c+=ll[0]\r\n else:\r\n\r\n c+=ll[ll.find(x)%len(ll)+1]\r\n print(c)", "def mover(ele,line,shift):\r\n if shift=='R':\r\n idx=line.index(ele)\r\n ele = line[idx-1]\r\n return ele\r\n else:\r\n idx=line.index(ele)\r\n ele = line[idx+1]\r\n return ele\r\nshift=input()\r\nst=input()\r\none= 'qwertyuiop'\r\ntwo= 'asdfghjkl;'\r\nthree='zxcvbnm,./'\r\ns=''\r\nfor ele in st:\r\n if ele in one:\r\n s+=mover(ele,one,shift)\r\n elif ele in two:\r\n s+=mover(ele,two,shift)\r\n else:\r\n s+=mover(ele,three,shift)\r\nprint(s)", "s = input()\r\na = list(input())\r\nkbrd = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nr = ''\r\nif s == 'R':\r\n for i in range(len(a)):\r\n r += kbrd[kbrd.index(a[i])-1]\r\nelif s == 'L':\r\n for i in range(len(a)):\r\n r += kbrd[kbrd.index(a[i])+1]\r\nprint(r)\r\n", "l = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nx = input()\r\ns = input()\r\n\r\ny = \"\"\r\n\r\nfor i in range(len(s)):\r\n\tif x == 'L':\r\n\t\tif s[i] not in ('p', ';', '/'):\r\n\t\t\ty = y + l[l.index(s[i]) + 1]\r\n\t\telse:\r\n\t\t\ty = y + s[i]\r\n\telse:\r\n\t\tif s[i] not in ('q', 'a', 'z'):\r\n\t\t\ty = y + l[l.index(s[i]) - 1]\r\n\t\telse:\r\n\t\t\ty = y + s[i]\r\n\t\t\t\r\nprint(y)", "s='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nlr = input()\r\nde = input()\r\nif lr=='L':\r\n l=[s[s.index(i)+1] for i in de]\r\n print(''.join(map(str,l)))\r\nelse:\r\n l=[s[s.index(i)-1] for i in de]\r\n print(''.join(map(str,l)))\r\n ", "a=input()\r\nb=input()\r\nd='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nc=''\r\nfor x in b:\r\n if a=='R':\r\n c+=d[d.index(x)-1]\r\n else:\r\n c+=d[d.index(x)+1]\r\nprint(c)", "k = [[col for col in row] for row in \"qwertyuiop#asdfghjkl;#zxcvbnm,./\".split(\"#\")]\r\n\r\ndef main():\r\n s = input()\r\n t = input() \r\n res = \"\"\r\n\r\n for i in range(len(t)):\r\n\r\n # Iterate over the keyboard\r\n for row in range(len(k)):\r\n for col in range(len(k[row])):\r\n if k[row][col] == t[i]:\r\n res += k[row][col-1] if s == \"R\" else k[row][col+1]\r\n\r\n print(res)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "q=input()\ns=input()\nc='qwertyuiopasdfghjkl;zxcvbnm,./'\ns1=''\nif q=='R':\n for i in s:\n s1+=c[(c.find(i))-1]\nelse:\n for i in s:\n s1+=c[(c.find(i))+1]\nprint(s1)\n", "keyboard = r\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\ndirection = 1 if input() == 'R' else -1\r\nfor c in input():\r\n print(keyboard[keyboard.index(c) - direction], end=\"\")\r\n\r\n\"\"\"\r\n//////////////////////////////////////////\r\n// //\r\n// Implemented by brownfox2k6 //\r\n// //\r\n//////////////////////////////////////////\r\n\"\"\"", "s = input()\r\nss = input()\r\nk = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nfor i in ss:\r\n print(k[k.index(i)-(1 if s=='R' else -1)],end='')", "r_k = [\n 'w',\n 'e',\n 'r',\n 't',\n 'y',\n 'u',\n 'i',\n 'o',\n 'p',\n 's',\n 'd',\n 'f',\n 'g',\n 'h',\n 'j',\n 'k',\n 'l',\n ';',\n 'x',\n 'c',\n 'v',\n 'b',\n 'n',\n 'm',\n ',',\n '.',\n '/',\n]\n\nl_k = [\n 'q',\n 'w',\n 'e',\n 'r',\n 't',\n 'y',\n 'u',\n 'i',\n 'o',\n 'a',\n 's',\n 'd',\n 'f',\n 'g',\n 'h',\n 'j',\n 'k',\n 'l',\n 'z',\n 'x',\n 'c',\n 'v',\n 'b',\n 'n',\n 'm',\n ',',\n '.'\n]\n\n\ndef main():\n direction = input()\n translator = None\n if direction == 'R':\n translator = dict(zip(r_k, l_k))\n elif direction == 'L':\n translator = dict(zip(l_k, r_k))\n\n word = input()\n for c in word:\n print(translator[c], end='')\n\n\nif __name__ == '__main__':\n main()\n\n\t\t\t \t\t\t\t \t\t \t \t \t \t \t\t \t\t \t \t", "q='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nm=input()\r\nn=input()\r\nfor i in n:\r\n if m=='R':\r\n print(q[q.index(i)-1],end='')\r\n else:\r\n print(q[q.index(i)+1],end='')\r\n", "def solution(a, m):\r\n res = ''\r\n alf = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\n \r\n for j in range(len(m)):\r\n for i in range(len(alf)):\r\n if alf[i] == m[j]:\r\n if a == 'R':\r\n res += alf[i - 1]\r\n else:\r\n res += alf[i + 1]\r\n return res\r\ndef main():\r\n a = input()\r\n m = input()\r\n print(solution(a, m))\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "x = 'qwertyuiop'\r\ny = 'asdfghjkl;'\r\nz = 'zxcvbnm,./'\r\n\r\nf = input()\r\nans = ''\r\n\r\nif f == 'R':\r\n s = input()\r\n for i in range(len(s)):\r\n if s[i] in x:\r\n ans += x[x.index(s[i]) - 1]\r\n # print(s[i], x.index(s[i]), x[x.index(s[i]) - 1])\r\n elif s[i] in y:\r\n ans += y[y.index(s[i]) - 1]\r\n elif s[i] in z:\r\n ans += z[z.index(s[i]) - 1]\r\nelse:\r\n s = input()\r\n for i in range(len(s)):\r\n if s[i] in x:\r\n ans += x[x.index(s[i]) + 1]\r\n # print(s[i], x.index(s[i]), x[x.index(s[i]) - 1])\r\n elif s[i] in y:\r\n ans += y[y.index(s[i]) + 1]\r\n elif s[i] in z:\r\n ans += z[z.index(s[i]) + 1]\r\nprint(ans)\r\n", "s=input()\r\nss=input()\r\ns1=\"asdfghjkl;qwertyuiopzxcvbnm,./\"\r\n\r\nans=\"\"\r\nfor i in range(len(ss)):\r\n id=s1.find(ss[i])\r\n if(s=='R'):\r\n ans=ans+s1[id-1]\r\n else:\r\n ans=ans+s1[id+1]\r\nprint(ans)", "alf = \"qwertyuiop asdfghjkl; zxcvbnm,./ \"\r\nnav = input()\r\ns = input()\r\ns_r = \"\"\r\n\r\nif nav == 'R':\r\n for i in s:\r\n if alf[alf.find(i) - 1] != \" \":\r\n s_r += alf[alf.find(i) - 1]\r\n else:\r\n s_r += alf[alf.find(i)]\r\n\r\nif nav == 'L':\r\n for i in s:\r\n if alf[alf.find(i) + 1] != \" \":\r\n s_r += alf[alf.find(i) + 1]\r\n else:\r\n s_r += alf[alf.find(i)]\r\n\r\nprint(s_r)\r\n", "n=input()\r\nthe_list=list(map(str,input()))\r\nalph=list(map(str,\"qwertyuiopasdfghjkl;zxcvbnm,./\"))\r\nif n==\"R\":\r\n for i in the_list:\r\n print(alph[alph.index(i)-1],end=\"\")\r\n\r\nelse :\r\n for i in the_list:\r\n print(alph[alph.index(i)+1],end=\"\")", "def decode_message(direction, sequence):\n keyboard = [\n \"qwertyuiop\",\n \"asdfghjkl;\",\n \"zxcvbnm,./\"\n ]\n \n mapping = {}\n for row in keyboard:\n for i in range(len(row)):\n if direction == 'L':\n mapping[row[i]] = row[i+1] if i+1 < len(row) else row[i]\n elif direction == 'R':\n mapping[row[i]] = row[i-1] if i-1 >= 0 else row[i]\n \n decoded_message = ''\n for char in sequence:\n decoded_message += mapping[char]\n \n return decoded_message\n\ndirection = input()\nsequence = input()\nmessage = decode_message(direction, sequence)\nprint(message)\n\n \t \t\t \t \t \t \t\t\t\t \t \t", "direction = input().strip()\r\nmessage = input().strip()\r\nkeyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\nresult = \"\"\r\nfor char in message:\r\n if direction == \"L\":\r\n result += keyboard[keyboard.index(char) + 1]\r\n elif direction == \"R\":\r\n result += keyboard[keyboard.index(char) - 1]\r\n\r\nprint(result)", "a=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\ns=input()\r\na1=input()\r\nif s==\"R\":\r\n for x in a1:\r\n k=a.index(x)\r\n print(a[k-1],end=\"\")\r\nelse:\r\n for x in a1:\r\n k = a.index(x)\r\n print(a[k + 1], end=\"\")\r\n", "d = input()\r\nt = input()\r\n\r\nkeyboard = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\n\r\ns = \"\"\r\nif d == 'L':\r\n for c in t:\r\n s += keyboard[keyboard.index(c) + 1]\r\nelse:\r\n for c in t:\r\n s += keyboard[keyboard.index(c) - 1]\r\n\r\nprint(s)", "\"\"\"\r\nНаш добрый друг Крот пытается закодировать большое сообщение. Он печатает на необычной клавиатуре, где клавиши расположены следующим образом:\r\n\r\nqwertyuiop\r\nasdfghjkl;\r\nzxcvbnm,./\r\nК сожалению, Крот слепой, так что иногда ему сложно правильно расположить лапки на клавиатуре.\r\nОн случайно передвинул обе лапки на одну позицию влево или вправо.\r\nЭто значит, что теперь он нажимает не на желаемую клавишу, а на соседнюю (левую или правую, как указано во вводе).\r\n\r\nУ нас есть последовательность символов, которые он напечатал, требуется найти исходное сообщение.\r\n\r\nВходные данные\r\nВ первой строке задана единственная буква, описывающая направление сдвига («L» или «R» соответственно для сдвига налево и направо).\r\n\r\nВо второй строке задана последовательность символов, написанных Кротом. Размер этой последовательности не превышает 100. Последовательность не содержит никаких символов, кроме присутствующих на клавиатуре Крота, в частности, она не содержит пробелов.\r\n\r\nГарантируется, что даже несмотря на то, что Крот передвинул лапки, он, тем не менее, попадает на клавиши и ему ни разу не пришлось нажать за пределы клавиатуры.\r\n\r\nВыходные данные\r\nВыведите исходное сообщение единственной строкой.\r\n\"\"\"\r\n\r\nshift = input()\r\nif shift == 'R':\r\n index = -1\r\nelse:\r\n index = 1\r\ns = input()\r\ncorrect_s = ''\r\nkeyborad = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nfor i in range(len(s)):\r\n correct_s += keyborad[keyborad.find(s[i]) + index]\r\n\r\nprint(correct_s)\r\n", "key = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\ndirection = input()\r\nphrase = input()\r\nresult = \"\"\r\n\r\nfor i in range(len(phrase)):\r\n if direction == \"L\":\r\n char = phrase[i]\r\n result += key[key.index(char) + 1]\r\n elif direction == \"R\":\r\n char = phrase[i]\r\n result += key[key.index(char) - 1]\r\n\r\nprint(result)", "direction = input()\r\nsequence = input()\r\n\r\nkeyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\nif direction == \"R\":\r\n shift = -1\r\nelse:\r\n shift = 1\r\n\r\noriginal_message = \"\"\r\n\r\nfor char in sequence:\r\n index = keyboard.index(char)\r\n original_message += keyboard[index + shift]\r\n\r\nprint(original_message)\r\n", "a = str(input())\r\nb = str(input())\r\nb2 = ''\r\nKlava = ['q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l',';','z','x','c','v','b','n','m',',','.','/']\r\nfor i in range(len(b)):\r\n for j in range(len(Klava)):\r\n if b[i] == Klava[j]:\r\n if a == 'L':\r\n b2 += Klava[j + 1]\r\n else:\r\n b2 += Klava[j - 1]\r\nprint(b2)", "keyboard = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\ndir = input()\r\ntext = list(input())\r\nif dir == 'R':\r\n for i in range(len(text)):\r\n text[i] = keyboard[keyboard.find(text[i])-1]\r\n print(''.join(text))\r\nelse:\r\n for i in range(len(text)):\r\n text[i] = keyboard[keyboard.find(text[i])+1]\r\n print(''.join(text))", "key = str(\"qwertyuiopasdfghjkl;zxcvbnm,./\")\r\ndirect = input()\r\nmole = input()\r\nanswer = str()\r\nif direct == 'L':\r\n for i in mole:\r\n x = key.find(i)\r\n x +=1\r\n answer += key[x]\r\nelse:\r\n for i in mole:\r\n x = key.find(i)\r\n x -=1\r\n answer += key[x]\r\nprint (answer)\r\n\r\n\r\n", "import sys\r\nfrom collections.abc import Callable\r\n\r\n\r\ndef fn() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n offset = 1 if read()[0] == 'L' else -1\r\n values = 'q w e r t y u i o p a s d f g h j k l ; z x c v b n m , . /'.split()\r\n char_to_idx: dict[str, int] = {}\r\n for i, val in enumerate(values):\r\n char_to_idx[val] = i\r\n input_str = read()\r\n output = []\r\n for i in range(0, len(input_str) - 1):\r\n output.append(values[char_to_idx[input_str[i]] + offset])\r\n\r\n print(''.join(output))\r\n\r\n\r\nif __name__ == '__main__':\r\n fn()\r\n", "import sys\r\nimport math\r\n\r\nk = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\no = input()\r\ns = input()\r\n\r\nif o == 'R':\r\n for i in range(len(s)):\r\n s = s[:i] + k[k.find(s[i]) - 1] + s[i+1:]\r\nelse:\r\n for i in range(len(s)):\r\n s = s[:i] + k[k.find(s[i]) + 1] + s[i+1:]\r\n\r\nprint(s)\r\n", "a='qwertyuiop' \\\r\n 'asdfghjkl;' \\\r\n 'zxcvbnm,./'\r\nb=input().lower()\r\nc=input()\r\nf=''\r\nif b=='r':\r\n for i in range(len(c)):\r\n d=(a.find(c[i]))-1\r\n f+=a[d]\r\nelif b=='l':\r\n for i in range(len(c)):\r\n d=(a.find(c[i]))+1\r\n f+=a[d]\r\nprint(f)\r\n", "lst=[\n\"qwertyuiop\"\n\"asdfghjkl;\"\n\"zxcvbnm,./\"\n]\na=input()\ns=input()\ntru=''\nfor el in s:\n for i in range(len(lst)):\n if el in lst[i]:\n idx=lst[i].index(el)\n if a==\"R\":\n tru+=lst[i][idx-1]\n else:\n tru+=lst[i][idx+1]\nprint(tru)\n\t\t \t\t\t\t\t \t\t\t\t\t \t\t\t\t \t\t\t \t\t\t \t", "def original_message(string, direction):\r\n keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n original_string = \"\"\r\n for char in string:\r\n index = keyboard.index(char)\r\n if direction == \"R\":\r\n index -= 1\r\n else:\r\n index += 1\r\n original_char = keyboard[index]\r\n original_string += original_char\r\n return original_string\r\n\r\nshift_direction = input()\r\ninput_string = input()\r\noriginal_message = original_message(input_string, shift_direction)\r\nprint(original_message)", "layout = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\nshift = input()\r\ninputString = input()\r\n\r\nfor character in inputString:\r\n index = layout.find(character)\r\n if shift == 'L':\r\n print(layout[index + 1], end='')\r\n else:\r\n print(layout[index - 1], end='')\r\nprint()\r\n", "keyboard = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\n\r\n\r\nif input() == 'R':\r\n input_ = input()\r\n print(''.join(keyboard[keyboard.index(input_[i]) - 1] for i in range(len(input_))))\r\nelse:\r\n input_ = input()\r\n print(''.join(keyboard[keyboard.index(input_[i]) + 1] for i in range(len(input_))))\r\n", "t = input()\r\ns = input()\r\nabc = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nif t == 'R':\r\n for i in s:\r\n print(abc[abc.index(i)-1], end='')\r\nelse:\r\n for i in s:\r\n print(abc[abc.index(i)+1], end='')", "l_r = input()\r\n\r\ntext = input()\r\n\r\nqwerty = ['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\n\r\nif l_r == 'R':\r\n\tcrement = -1\r\nelse:\r\n\tcrement = +1\r\n\r\noutput = \"\"\r\n\r\nfor s in text:\r\n\t# get index \r\n\tind = qwerty.index(s)\r\n\tind += crement\r\n\r\n\tnew = qwerty[ind]\r\n\r\n\toutput += new\r\n\r\nprint(output)", "# ██████╗\r\n# ███ ███═█████╗\r\n# ████████╗ ██████╗ ████████╗ ████ █████ ████╗\r\n# ██╔═════╝ ██╔═══██╗ ██╔═════╝ ████ █ ███║\r\n# ██████╗ ██║ ╚═╝ ██████╗ ████ ████╔╝\r\n# ██╔═══╝ ██║ ██╗ ██╔═══╝ ███ ███╔══╝\r\n# ████████╗ ╚██████╔╝ ████████╗ ███ ██╔═╝\r\n# ╚═══════╝ ╚═════╝ ╚═══════╝ ███╔══╝\r\n# Legends ╚══╝\r\n\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nshift = input().rstrip()\r\ns = input().rstrip()\r\nstring = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nans = \"\"\r\nif shift == 'R':\r\n for i in s:\r\n ans += string[string.index(i) - 1]\r\nelse:\r\n for i in s:\r\n ans += string[string.index(i) + 1]\r\nprint(ans)\r\n", "s = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nn = input()\r\nm = input()\r\nl = \"\"\r\nif n == \"R\":\r\n for i in range(len(m)):\r\n ind = s.index(m[i])\r\n l = l + s[ind - 1]\r\n print(l)\r\nelse:\r\n for i in range(len(m)):\r\n ind = s.index(m[i])\r\n l = l + s[ind + 1]\r\n print(l)\r\n", "alp = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nshift = input()\r\ns = input()\r\nres = ''\r\nfor elem in s:\r\n i = alp.find(elem)\r\n if shift == \"R\":\r\n res += alp[i - 1]\r\n else:\r\n res += alp[i + 1]\r\nprint(res)\r\n", "num=input() #R or L \r\na=['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\nass=input()\r\nx=ass.lower()\r\nfor i in ((x)): \r\n if i in a:\r\n if num=='R':\r\n print(a[a.index(i)-1],end='')\r\n elif num=='L':\r\n print(a[a.index(i)+1],end='')\r\n\r\n ", "letter = input()\nline = input()\nkeyboard = ['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', ',', '.', '/']\noutput = \"\"\nindex = 0\nif letter == 'R':\n for x in line:\n index = keyboard.index(x)\n output += keyboard[index - 1]\nelif letter == 'L':\n for x in line:\n index = keyboard.index(x)\n output += keyboard[index + 1]\n\nprint(output)\n\n\n\n\n\n\n\n", "c,s=input(),input()\r\nst='qwertyuiopasdfghjkl;zxcvbnm,./';sa=''\r\nfor x in s:sa+=st[st.index(x)-1] if c=='R' else st[st.index(x)+1]\r\nprint(sa)", "\r\nshift = input()\r\n\r\nword = input()\r\nkeyboard = 'qwertyuiop asdfghjkl; zxcvbnm,./'\r\n\r\nsolution = ''\r\nfor i in word:\r\n idx = keyboard.index(i)\r\n if shift == 'R':\r\n solution += keyboard[idx-1]\r\n else:\r\n solution += keyboard[idx+1]\r\n\r\nprint(solution)\r\n\r\n", "keys = \"qwertyuiop asdfghjkl; zxcvbnm,./\"\r\nshift = input()\r\nif shift == 'R':\r\n diff = -1\r\nelse:\r\n diff = 1\r\n \r\ns = input()\r\nres = \"\"\r\nfor c in s:\r\n ind = keys.find(c)\r\n res += keys[ind + diff]\r\nprint(res)", "a = input()\nb = input()\nans = ''\nlst = ['qwertyuiop', 'asdfghjkl;', \"zxcvbnm,./\"]\nfor i in range(len(b)):\n for j in range(3):\n curStr = lst[j]\n if b[i] in curStr:\n idx = curStr.index(b[i])\n if a == 'R':\n ans += curStr[idx-1]\n else:\n ans += curStr[idx+1]\nprint(ans)\n \t\t\t\t \t \t \t \t\t\t \t\t\t\t \t\t\t\t", "keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\ndir = input()\ns = input()\n\nans = \"\"\nindx = 1\nif dir == 'R':\n indx = -1\n\nfor i in range(0,len(s)):\n n = keyboard.find(s[i])\n ans += keyboard[n+indx]\n\nprint(ans)\n\n \t \t \t \t \t \t\t\t \t\t\t\t\t", "tmp = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p']\r\ntmp1 = ['a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', ';']\r\ntmp2 = ['z', 'x', 'c', 'v', 'b', 'n', 'm', ',', '.', '/']\r\nn = input()\r\nli = list(input())\r\nif n == 'R':\r\n for i in range(len(li)):\r\n if li[i] in tmp:\r\n if li[i] == tmp[0]:\r\n print(tmp[0],end = '')\r\n else:\r\n print(tmp[(tmp.index(li[i]))-1],end = '')\r\n elif li[i] in tmp1:\r\n if li[i] == tmp1[0]:\r\n print(tmp1[0],end = '')\r\n else:\r\n print(tmp1[(tmp1.index(li[i]))-1],end = '')\r\n else:\r\n if li[i] == tmp2[0]:\r\n print(tmp2[0],end = '')\r\n else:\r\n print(tmp2[(tmp2.index(li[i]))-1],end = '')\r\nelif n == 'L':\r\n for i in range(len(li)):\r\n if li[i] in tmp:\r\n if li[i] == tmp[len(tmp)-1]:\r\n print(tmp[-1],end = '')\r\n else:\r\n print(tmp[(tmp.index(li[i]))+1],end = '')\r\n elif li[i] in tmp1:\r\n if li[i] == tmp1[len(tmp1)-1]:\r\n print(tmp1[-1],end = '')\r\n else:\r\n print(tmp1[(tmp1.index(li[i]))+1],end = '')\r\n else:\r\n if li[i] == tmp2[len(tmp2)-1]:\r\n print(tmp2[-1],end = '')\r\n else:\r\n print(tmp2[(tmp2.index(li[i]))+1],end = '')", "l=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nc=input()\r\ns=input()\r\nif c==\"R\":\r\n c=-1\r\nelse:\r\n c=1\r\nfor i in s:\r\n print(l[l.index(i)+c],end=\"\")", "a = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nb = {\"L\": 1, \"R\": -1}\r\nshift = b[input()]\r\nout = \"\"\r\nfor i in input():\r\n out += a[a.index(i) + shift]\r\nprint(out)", "N = input()\r\nt = input()\r\na = \"qwertyuiop\"\r\nb = \"asdfghjkl;\"\r\nc = \"zxcvbnm,./\"\r\nd = \"\"\r\nfor i in range(len(t)):\r\n for j in range(len(a)):\r\n if a[j] == t[i] and N == \"R\":\r\n d += a[j-1]\r\n if a[j] == t[i] and N == \"L\":\r\n d += a[j+1]\r\n for j in range(len(b)):\r\n if b[j] == t[i] and N == \"R\":\r\n d += b[j - 1]\r\n if b[j] == t[i] and N == \"L\":\r\n d += b[j + 1]\r\n for j in range(len(c)):\r\n if c[j] == t[i] and N == \"R\":\r\n d += c[j - 1]\r\n if c[j] == t[i] and N == \"L\":\r\n d += c[j + 1]\r\nprint(d)", "a, b, c = input(), 0, \"\"\r\nif a == \"R\":\r\n b = -1\r\nelse:\r\n b = 1\r\nmessage = input()\r\nletters = [\"qwertyuiop\", \"asdfghjkl;\", \"zxcvbnm,./\"]\r\nfor i in message:\r\n for j in letters:\r\n if i in j:\r\n index = j.find(i) + b\r\n if index == -1 or index == len(j):\r\n c += i\r\n else:\r\n c += j[index]\r\nprint(c)\r\n", "l = ['q','w','e','r','t','y','u','i','o','p',\r\n'a','s','d','f','g','h','j','k','l',';',\r\n'z','x','c','v','b','n','m',',','.','/'] \r\nv=\"\"\r\ntyp = input() \r\ntext = input() \r\nll = len(text) \r\nif typ == 'R' : \r\n for i in range (0,ll) : \r\n for k in range(0,30) : \r\n if text[i] == l[k] : \r\n v +=l[k-1] \r\n \r\nelse : \r\n for i in range (0,ll) : \r\n for k in range(0,30) : \r\n if text[i] == l[k] : \r\n v +=l[k+1] \r\nprint(v)", "g='qwertyuiopasdfghjkl;zxcvbnm,./'\r\na=list(g)\r\nn=input()\r\nt=input()\r\nm=list(t)\r\nanswer=[]\r\nfor i in range(0,len(m)):\r\n index = g.find(m[i])\r\n if(n=='R'):\r\n answer.append(g[index-1])\r\n else:\r\n answer.append(g[index+1])\r\n \r\n\r\nans=''.join(answer) \r\nprint(ans) ", "alfavit_1={'b':'v','c':'x','d':'s','e':'w','f':'d','g':'f','h':'g','i':'u','j':'h',\r\n 'k':'j','l':'k','m':'n','n':'b','o':'i','p':'o','r':'e','s':'a',\r\n 't':'r','u':'y','v':'c','w':'q','x':'z','y':'t',';':'l',',':'m','.':',','/':'.'\r\n }\r\nalfavit_2={'a':'s','b':'n','c':'v','d':'f','e':'r','f':'g','g':'h','h':'j','i':'o','j':'k',\r\n 'k':'l','l':';','m':',','n':'m','o':'p','q':'w','r':'t','s':'d',\r\n 't':'y','u':'i','v':'b','w':'e','x':'c','y':'u','z':'x',',':'.','.':'/'\r\n }\r\nn=input()\r\nif n=='R':\r\n alfavit=alfavit_1\r\nelif n=='L':\r\n alfavit=alfavit_2\r\nr=''\r\na=input()\r\nfor a1 in a:\r\n for bykv in alfavit.keys():\r\n if a1==bykv:\r\n h=alfavit[bykv]\r\n r+=h\r\nprint(r)", "keyboard=[ '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\nkeyboardMap={}\r\nfor index,val in enumerate(keyboard):\r\n keyboardMap[val]=index\r\n\r\npos=input()\r\nstr=input()\r\nposMap={}\r\nposMap['L']=1\r\nposMap['R']=-1\r\n\r\nans=[]\r\n\r\nfor i in str:\r\n ans.append(keyboard[keyboardMap[i]+posMap[pos]])\r\n\r\nprint(''.join(ans))\r\n", "side = input()\r\na = \"qwertyuiop\"\r\nb = \"asdfghjkl;\"\r\nc = \"zxcvbnm,./\"\r\ns = input()\r\nnova = \"\"\r\nfor i in s:\r\n if side == \"R\":\r\n if i in a:\r\n nova += a[a.index(i)-1]\r\n elif i in b:\r\n nova += b[b.index(i)-1]\r\n elif i in c:\r\n nova += c[c.index(i)-1]\r\n else:\r\n if i in a:\r\n nova += a[a.index(i)+1]\r\n elif i in b:\r\n nova += b[b.index(i)+1] \r\n elif i in c:\r\n nova += c[c.index(i)+1]\r\nprint(nova)", "x=input()\r\ny=(\"qwertyuiopasdfghjkl;zxcvbnm,./\")\r\nz=input()\r\n#s;;upimrrfod;pbr\r\nv=[]\r\nfor i in z:\r\n c=y.index(i)\r\n if x==\"R\":\r\n c-=1\r\n else:\r\n c+=1\r\n v.append(y[c])\r\n c=0\r\nM=\"\".join(v)\r\nprint(M)", "shift = input()\r\nkeybordR = ['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\nret = ''\r\nseq = input()\r\nif shift == 'R':\r\n for letter in seq:\r\n i = keybordR.index(letter)\r\n ret += keybordR[i-1]\r\nelse:\r\n for letter in seq:\r\n i = keybordR.index(letter)\r\n ret += keybordR[i+1]\r\nprint(ret)\r\n", "kl = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nif input() == 'R':\r\n d = -1\r\nelse:\r\n d = 1\r\nfor i in input():\r\n print(kl[kl.find(i)+d], end = '')\r\nprint()", "k = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nrl = [1,-1][input()==\"R\"]\r\nprint(*[k[k.find(i)+rl]for i in input()],sep=\"\")", "l1 = 'qwertyuiop'\r\nl2 = 'asdfghjkl;'\r\nl3 = 'zxcvbnm,./'\r\n\r\ndirection = input()\r\nmsg = input()\r\nencode = ''\r\nd = 0\r\nif direction == 'R':\r\n d = -1\r\nelif direction == 'L':\r\n d = +1\r\nfor i in range(len(msg)):\r\n if msg[i] in l1:\r\n x = l1.index(msg[i])\r\n encode = encode + l1[x+d]\r\n elif msg[i] in l2:\r\n x = l2.index(msg[i])\r\n encode = encode + l2[x+d]\r\n elif msg[i] in l3:\r\n x = l3.index(msg[i])\r\n encode = encode + l3[x+d]\r\n\r\nprint(encode)", "s = -1 if input() == 'R' else 1\r\nkeys = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\ntext = input()\r\nout = ''\r\nfor i in text:\r\n out += keys[keys.index(i) + s]\r\nprint(out)\r\n", "char = input()\r\nword = input()\r\ns = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nres = ''\r\n\r\n\r\nfor i in range(len(word)):\r\n for j in range(len(s)):\r\n if word[i] == s[j]:\r\n if char == \"R\":\r\n res += s[j-1]\r\n else:\r\n res += s[j+1]\r\n\r\nprint(res)\r\n\r\n# else:\r\n# for i in range(len(word)):\r\n# for j in range(30):\r\n# if word[i] == s[j]:\r\n# res += s[j-1]\r\n \r\n\r\n", "x = input()\ny = input()\nans = \" \"\nlst= [\"qwertyuiop\",\n\"asdfghjkl;'\",\n\"zxcvbnm,./\"\n]\nfor el in y:\n for i in range(len(lst)):\n if el in lst[i]:\n idx=lst[i].index(el)\n if x == 'R':\n ans+=lst[i][idx-1]\n else:\n ans+=lst[i][idx+1]\nprint(ans)\n\t\t\t\t \t \t \t \t\t\t \t\t\t\t \t\t", "import math\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\n \r\n \r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n \r\ndef readint():\r\n return int(input())\r\n \r\n\r\nd = {\r\n 'q': {'L':'', 'R': 'w'},\r\n 'w': {'L': 'q', 'R': 'e'},\r\n 'e': {'L': 'w', 'R': 'r'},\r\n 'r': {'L': 'e', 'R': 't'},\r\n 't': {'L': 'r', 'R': 'y'},\r\n 'y': {'L': 't', 'R': 'u'},\r\n 'u': {'L': 'y', 'R': 'i'},\r\n 'i': {'L': 'u', 'R': 'o'},\r\n 'o': {'L': 'i', 'R': 'p'},\r\n 'p': {'L': 'o', 'R': ''},\r\n 'a': {'L': '', 'R': 's'},\r\n 's': {'L': 'a', 'R': 'd'},\r\n 'd': {'L': 's', 'R': 'f'},\r\n 'f': {'L': 'd', 'R': 'g'},\r\n 'g': {'L': 'f', 'R': 'h'},\r\n 'h': {'L': 'g', 'R': 'j'},\r\n 'j': {'L': 'h', 'R': 'k'},\r\n 'k': {'L': 'j', 'R': 'l'},\r\n 'l': {'L': 'k', 'R': ';'},\r\n ';': {'L': 'l', 'R': ''},\r\n 'z': {'L': '', 'R': 'x'},\r\n 'x': {'L': 'z', 'R': 'c'},\r\n 'c': {'L': 'x', 'R': 'v'},\r\n 'v': {'L': 'c', 'R': 'b'},\r\n 'b': {'L': 'v', 'R': 'n'},\r\n 'n': {'L': 'b', 'R': 'm'},\r\n 'm': {'L': 'n', 'R': ','},\r\n ',': {'L': 'm', 'R': '.'},\r\n '.': {'L': ',', 'R': '/'},\r\n '/': {'L': '.', 'R': ''}\r\n}\r\n \r\n\r\ndirection = input()\r\n\r\ndirection = 'L' if direction == 'R' else 'R'\r\n\r\nseq = list(input())\r\n\r\nans = \"\"\r\n\r\nfor char in seq:\r\n ans += d[char][direction]\r\n\r\nprint(ans)\r\n", "position = input()\r\nword = input()\r\n\r\nfirst_row='qwertyuiop'\r\nsecond_row='asdfghjkl;'\r\nthird_row='zxcvbnm,./'\r\n\r\ncorrect_word = ''\r\nfor i in range(len(word)):\r\n if position == 'R':\r\n if word[i] in first_row:\r\n correct_word+= first_row[first_row.index(word[i])-1]\r\n elif word[i] in second_row:\r\n correct_word+= second_row[second_row.index(word[i])-1]\r\n elif word[i] in third_row:\r\n correct_word+= third_row[third_row.index(word[i])-1]\r\n\r\n elif position == 'L':\r\n if word[i] in first_row:\r\n correct_word += first_row[first_row.index(word[i]) + 1]\r\n elif word[i] in second_row:\r\n correct_word += second_row[second_row.index(word[i]) + 1]\r\n elif word[i] in third_row:\r\n correct_word += third_row[third_row.index(word[i]) + 1]\r\n\r\nprint(correct_word)", "keyboard = ['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\n\r\ndef shiftRight(s):\r\n n = len(s)\r\n for i in range(n):\r\n s[i] = keyboard[ keyboard.index(s[i])-1 ]\r\n return s\r\n\r\n\r\ndef shiftLeft(s):\r\n n = len(s)\r\n for i in range(n):\r\n s[i] = keyboard[ keyboard.index(s[i])+1 ]\r\n return s\r\n\r\n\r\ndef main():\r\n shift = input()\r\n s = list(input())\r\n\r\n if shift == 'R':\r\n print(''.join(shiftRight(s)))\r\n else:\r\n print(''.join(shiftLeft(s)))\r\n\r\n\r\nmain()", "keyboard = list(\"qwertyuiopasdfghjkl;zxcvbnm,./\")\r\ndirection = input()\r\ns = input()\r\nif direction == 'R':\r\n for i in range(len(s)):\r\n print(keyboard[keyboard.index(s[i]) - 1], end='')\r\nelse:\r\n for i in range(len(s)):\r\n print(keyboard[keyboard.index(s[i]) + 1], end='')", "keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\nshift = input()\r\ntyped = input()\r\n\r\nout = \"\"\r\n\r\nif shift == \"R\":\r\n\tfor c in typed:\r\n\t\tout += keyboard[keyboard.find(c)-1]\r\n\r\nelif shift == \"L\":\r\n\tfor c in typed:\r\n\t\tout += keyboard[keyboard.find(c)+1]\r\n\r\nprint(out)", "keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\nfinalmessage = \"\"\n\ndirection = input(\"\")\nmessage = input(\"\")\n\nfor character in message:\n location = keyboard.index(character)\n if direction == \"R\":\n finalmessage += keyboard[location-1]\n else:\n finalmessage += keyboard[location+1]\n\nprint(finalmessage)", "lr = 1 if input() == \"L\" else -1\r\nst = input()\r\ns = [\"qwertyuiop\", \"asdfghjkl;\", \"zxcvbnm,./\"]\r\nfor i in st:\r\n if i in s[0]:\r\n print(s[0][s[0].index(i)+lr], end=\"\")\r\n elif i in s[1]:\r\n print(s[1][s[1].index(i)+lr], end=\"\")\r\n else:\r\n print(s[2][s[2].index(i) + lr], end=\"\")\r\n", "d = input()\nline = input()\nstr = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\nif d == 'R':\n for i in range(len(line)):\n ind = str.index(line[i])\n print(str[ind - 1], end='') \nelse:\n for i in range(len(line)):\n ind = str.index(line[i])\n print(str[ind + 1], end='')\n\t \t \t\t\t\t\t \t\t\t\t\t\t\t\t\t \t \t \t\t \t", "x = input()\r\ny = input()\r\nl = list(\"qwertyuiopasdfghjkl;'zxcvbnm,./\")\r\nif x == \"R\" :\r\n for i in y :\r\n index = l.index(i)\r\n print(l[index-1] , end = \"\")\r\n \r\nif x == \"L\" :\r\n for i in y :\r\n index = l.index(i)\r\n print(l[index+1] ,end = \"\")\r\n ", "# Link: https://codeforces.com/contest/474/problem/A\n\nkeyboard_letters = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\n\ndirection = input()\nsequence = input()\n\nnew_sequence = \"\"\n\nfor letter_index, letter in enumerate(sequence):\n if direction == \"R\":\n new_sequence += keyboard_letters[keyboard_letters.index(letter) - 1]\n else:\n new_sequence += keyboard_letters[keyboard_letters.index(letter) + 1]\n\nprint(new_sequence)", "keybord = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\ndic = input()\r\nmassege = input()\r\nres = ''\r\nfor i in range(len(massege)):\r\n for j in range(len(keybord)) :\r\n if dic == \"R\" or dic == 'r':\r\n if massege[i] == keybord[j] :\r\n res+=keybord[j-1]\r\n else :\r\n if massege[i] == keybord[j] :\r\n res+=keybord[j+1]\r\nprint(res)", "h = input()\r\ns = input()\r\nl = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nif h == 'R':\r\n for i in range(len(s)):\r\n if s[i] == 'q':\r\n print('/',end='')\r\n else:\r\n ind = l.index(s[i])\r\n print(l[ind-1],end='')\r\nelse:\r\n for i in range(len(s)):\r\n if s[i] == '/':\r\n print('q',end='')\r\n else:\r\n ind = l.index(s[i])\r\n print(l[ind+1],end='')\r\n", "d={}\r\nj=0\r\n\r\nfor i in 'qwertyuiopasdfghjkl;zxcvbnm,./':\r\n d[i]=j\r\n j+=1\r\n\r\nlst=[i for i in list(d.keys())]\r\nch=input()\r\nstin=input()\r\nst=''\r\nif ch=='L':\r\n for i in stin:\r\n st+=lst[d[i]+1]\r\nelse:\r\n for i in stin:\r\n st+=lst[d[i]-1]\r\nprint(st)", "def solve():\n first = [*\"qwertyuiop\"]\n second = [*\"asdfghjkl;\"]\n third = [*\"zxcvbnm,./\"]\n res = \"\"\n\n shift = input()\n letters = input()\n letterlist = letters.split()\n\n if (shift == \"R\"):\n for i in range(len(letters)):\n if (letters[i] in first):\n res += first[first.index(letters[i]) - 1]\n elif (letters[i] in second):\n res += second[second.index(letters[i]) - 1]\n else:\n res += third[third.index(letters[i]) - 1]\n else:\n for i in range(len(letters)):\n if (letters[i] in first):\n res += first[first.index(letters[i]) + 1]\n elif (letters[i] in second):\n res += second[second.index(letters[i]) + 1]\n else:\n res += third[third.index(letters[i]) + 1]\n print(res)\n\nsolve()\n ", "keyboard = 'qwertyuiop' \\\r\n 'asdfghjkl;' \\\r\n 'zxcvbnm,./'\r\ndirection = input()\r\nline = input()\r\ndecoded = ''\r\nif direction == 'R':\r\n for i in range(len(line)):\r\n number = keyboard.find(line[i])\r\n decoded += keyboard[number-1]\r\nelif direction == 'L':\r\n for i in range(len(line)):\r\n number = keyboard.find(line[i])\r\n decoded += keyboard[number+1]\r\nelse:\r\n pass\r\nprint(decoded)\r\n", "k = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nt = input()\r\ns = input()\r\nfor i in range(0, len(s)):\r\n ind = 0\r\n for j in range(0, len(k)):\r\n if s[i] == k[j]:\r\n ind = j\r\n if t == \"R\":\r\n print(k[ind - 1], end = \"\")\r\n else:\r\n print(k[ind + 1], end = \"\")", "l1=list('qwertyuiopasdfghjkl;zxcvbnm,./')\r\nans=\"\"\r\nside=input()\r\nS=input()\r\nif side=='R':\r\n for k1 in S:\r\n ind=l1.index(k1)\r\n ans=ans+l1[ind-1]\r\n print(ans)\r\nelif side=='L':\r\n for k1 in S:\r\n ind=l1.index(k1)\r\n ans=ans+l1[ind+1]\r\n print(ans)", "p= -1 if input() =='R' else 1 #position \r\nm=input()#message\r\nk=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\noutput=\"\"\r\nfor i in m:\r\n if (i!=\"q\" and i!='/'):\r\n output+=k[k.index(i)+p]\r\n elif(i==\"q\"):\r\n output+='w' if p==1 else '/'\r\n elif(i==\"/\"):\r\n output+='q' if p==1 else '.'\r\n\r\n\r\n\r\nprint(output)\r\n", "s1=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nc=input()\r\nif c=='R':\r\n pos=-1\r\nelse:\r\n pos=1\r\ns2=input()\r\nres=\"\"\r\nfor c in s2:\r\n res=res+s1[s1.index(c)+pos]\r\nprint(res)", "dic= {}\nalpha = [\n'qwertyuiop',\n'asdfghjkl;',\n'zxcvbnm,./']\nfor line in alpha :\n dic[line[0]] = [None,line[1]]\n dic[line[-1]] = [line[-2],None]\n for c in range(1,9) :\n dic[line[c]] = [line[c-1],line[c+1]]\ndir = 0 if input() == 'R' else 1\nprint(*(map(lambda x : dic[x][dir],input())),sep='')", "key=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\na=input()\r\nb=input()\r\nmain=''\r\nif a=='R':\r\n for i in b:\r\n ind=key.index(i)\r\n p=key[ind-1]\r\n main+= p\r\nelse:\r\n for i in b:\r\n ind = key.index(i)\r\n p = key[ind + 1]\r\n main += p\r\n\r\nprint(main)\r\n\r\n#s;;upimrrfod;pbr\r\n", "chaine=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nchar= input()\r\ns=input()\r\ns1=\"\"\r\nif char == 'R':\r\n for i in s:\r\n s1+=chaine[chaine.index(i)-1]\r\nelse:\r\n for i in s:\r\n s1+=chaine[chaine.index(i)+1]\r\nprint(s1)", "way = input()\r\nword = input()\r\n\r\npositions = 'qwertyuiop asdfghjkl; zxcvbnm,./'\r\n\r\nnew_word = str()\r\nfor char in word:\r\n if way == 'R':\r\n new_word += positions[ positions.index(char) - 1]\r\n else:\r\n new_word += positions[positions.index(char) + 1]\r\nprint(new_word)", "n = input()\r\na = \"qwertyuiop[]\\\\asdfghjkl;'zxcvbnm,./\"\r\nif n == 'R':\r\n s = input()\r\n g = \"\"\r\n for i in range(len(s)):\r\n g += str(a[a.index(s[i])-1])\r\n print(g)\r\nelse:\r\n s = input()\r\n g = ''\r\n for i in range(len(s)):\r\n try:\r\n g += str(a[a.index(s[i])+1])\r\n except:\r\n g += str('q')\r\n print(g)\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 direction = input()\n string = input()\n keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\n result = \"\"\n if direction == \"R\":\n for i in string:\n result += keyboard[keyboard.index(i) - 1]\n else:\n for i in string:\n result += keyboard[keyboard.index(i) + 1]\n print(result)\n\n\nif __name__ == \"__main__\":\n main()\n", "a = 1 if input() == 'L' else -1\r\ns = input()\r\n\r\nstr = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nnew = ''\r\nfor i,j in enumerate(s):\r\n ind = str.index(j)\r\n print(str[ind + a], end='')\r\n\r\n\r\n", "direction = input()\r\nuse_in = input()\r\nresult = ''\r\nif direction == 'R' : \r\n direction = -1\r\nelse:\r\n direction = 1 \r\ndata = \"qwertyuiopasdfghjkl;zxcvbnm,./ \"\r\nfor i in use_in : \r\n result += data[data.index(i) + direction]\r\nprint(result) ", "layout = list(\"qwertyuiop\") + list(\"asdfghjkl;\") + list(\"zxcvbnm,./\")\r\n\r\nsh = input().lower()\r\nif sh == 'r': a = -1\r\nelse: a = 1\r\nfor x in input(): print(layout[layout.index(x) + a], end = \"\")", "# LUOGU_RID: 101571161\nS = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nd = input().strip()\r\ns = input().strip()\r\nans = ''\r\nfor c in s:\r\n if d == 'R':\r\n ans += S[S.find(c) - 1]\r\n else:\r\n ans += S[S.find(c) + 1]\r\nprint(ans)", "ltrsFirst,ltrsSec, ltrsThir= ['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\ndef distinct_words():\r\n global ltrsFirst,ltrsSec, ltrsThir\r\n dirc = input()\r\n s = input().strip()\r\n word = []\r\n for l in s:\r\n if dirc == 'R' and l in ltrsFirst and ltrsFirst.index(l)-1 >= 0 and ltrsFirst.index(l)-1 < 10:\r\n \r\n word.append(ltrsFirst[ltrsFirst.index(l)-1])\r\n \r\n elif dirc == 'R' and l in ltrsSec and ltrsSec.index(l)-1 >= 0 and ltrsSec.index(l)-1 < 10:\r\n \r\n word.append(ltrsSec[ltrsSec.index(l)-1])\r\n \r\n elif dirc == 'R' and l in ltrsThir and ltrsThir.index(l)-1 >= 0 and ltrsThir.index(l)-1 < 10:\r\n \r\n word.append(ltrsThir[ltrsThir.index(l)-1])\r\n \r\n elif dirc == 'L' and l in ltrsFirst and ltrsFirst.index(l)+1 >= 0 and ltrsFirst.index(l)+1 < 10:\r\n \r\n word.append(ltrsFirst[ltrsFirst.index(l)+1])\r\n \r\n elif dirc == 'L' and l in ltrsSec and ltrsSec.index(l)+1 >= 0 and ltrsSec.index(l)+1 < 10:\r\n \r\n word.append(ltrsSec[ltrsSec.index(l)+1])\r\n \r\n elif dirc == 'L' and l in ltrsThir and ltrsThir.index(l)+1 >= 0 and ltrsThir.index(l)+1 < 10:\r\n \r\n word.append(ltrsThir[ltrsThir.index(l)+1])\r\n \r\n return ''.join(word)\r\n\r\nprint(distinct_words())", "n = input()\r\n\r\ns = input()\r\nl = list(s)\r\nl1 = list(\"qwertyuiop\")\r\nl2 = list(\"asdfghjkl;\")\r\nl3 = list(\"zxcvbnm,./\")\r\n\r\nfor i in range(len(l)):\r\n \r\n if l[i] in l1:\r\n a = l1.index(l[i])\r\n if(n == 'R'):\r\n print(l1[a-1],end=\"\")\r\n else:\r\n print(l1[a+1],end=\"\") \r\n elif l[i] in l2:\r\n b = l2.index(l[i])\r\n if(n == 'R'):\r\n print(l2[b-1],end=\"\")\r\n else:\r\n print(l2[b+1],end=\"\") \r\n else:\r\n c = l3.index(l[i])\r\n if(n == 'R'):\r\n print(l3[c-1],end=\"\")\r\n else:\r\n print(l3[c+1],end=\"\") ", "side=input()\r\nup=\"qwertyuiop\"\r\ncen=\"asdfghjkl;\"\r\ndown=\"zxcvbnm,./\"\r\nlst=[]\r\nif side==\"R\":\r\n sen=input()\r\n for i in sen:\r\n word=i\r\n for j in range(10):\r\n if word==up[j]:\r\n lst.append(up[j-1])\r\n elif word==cen[j]:\r\n lst.append(cen[j-1])\r\n elif word==down[j]:\r\n lst.append(down[j-1])\r\n print(\"\".join(lst))\r\nelse:\r\n sen=input()\r\n for i in sen:\r\n word=i\r\n for j in range(10):\r\n if word==up[j]:\r\n lst.append(up[j+1])\r\n elif word==cen[j]:\r\n lst.append(cen[j+1])\r\n elif word==down[j]:\r\n lst.append(down[j+1])\r\n print(\"\".join(lst))\r\n", "x=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nl=list(map(str,x))\r\nn=input()\r\ns=input()\r\nl2=list(map(str,s))\r\n\r\nif n==\"R\":\r\n for i in l2:\r\n print(l[l.index(i)-1],end=\"\")\r\nif n==\"L\":\r\n for i in l2:\r\n print(l[l.index(i)+1],end=\"\")\r\n ", "keyboard = ['qwertyuiop','asdfghjkl;','zxcvbnm,./']\n\ntmp = input()\nshift_pos = -1 if tmp=='R' else 1\npressed = input()\n\nans = ''\nfor c in pressed:\n\tfor row in keyboard:\n\t\tif c in row:\n\t\t\tans += row[row.find(c)+shift_pos]\n\t\t\tcontinue\n\nprint(ans)", "keyboard = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\ndirection = input()\r\nwrong_message = input()\r\nright_message = ''\r\nif direction == 'R':\r\n\tindex_coef = -1\r\nelse:\r\n\tindex_coef = 1\r\ni = 0\r\nwhile i < len(wrong_message):\r\n\twrong_index = keyboard.index(wrong_message[i])\r\n\tright_index = wrong_index + index_coef\r\n\tright_message += keyboard[right_index]\r\n\ti += 1\r\nprint(right_message)", "n = input()\r\na = input()\r\nlist = ['q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l',\r\n ';','z','x','c','v','b','n','m',',','.','/']\r\nresult = ''\r\nfor i in range(0,len(a)):\r\n if n == 'R':\r\n result += list[list.index(a[i])-1]\r\n else:\r\n result += list[list.index(a[i])+1]\r\nprint(result)", "s = input()\r\nmessage = input()\r\nkey = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nnew = ''\r\nif s == \"R\":\r\n for i in message:\r\n new+=key[key.index(i)-1]\r\nelse:\r\n for i in message:\r\n new+=key[key.index(i)+1]\r\nprint(new)", "s=input();a=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nfor l in input():print(a[a.index(l)+[1,-1][s=='R']],end='')\r\n", "def solve():\r\n t = input()\r\n word = input()\r\n x = \"\"\r\n\r\n alpha = [[\"q\",\"w\",\"e\",\"r\",\"t\",\"y\",\"u\",\"i\",\"o\",\"p\"],\r\n [\"a\",\"s\",\"d\",\"f\",\"g\",\"h\",\"j\",\"k\",\"l\",\";\"],\r\n [\"z\",\"x\",\"c\",\"v\",\"b\",\"n\",\"m\",\",\",\".\",\"/\"]]\r\n\r\n if t == \"R\":\r\n for w in word:\r\n for i in range(len(alpha)):\r\n for j in range(len(alpha[0])):\r\n if w == alpha[i][j]:\r\n x += alpha[i][j-1]\r\n elif t == \"L\":\r\n for w in word:\r\n for i in range(len(alpha)):\r\n for j in range(len(alpha[0])):\r\n if w == alpha[i][j]:\r\n x += alpha[i][j+1]\r\n\r\n print(x)\r\n\r\nif \"__main__\" == __name__:\r\n solve()", "a1='qwertyuiop'\r\na2='asdfghjkl;'\r\na3='zxcvbnm,./'\r\ns = input()\r\nq = input()\r\nif(s=='R'):\r\n w=-1\r\nelse:\r\n w=1\r\nfor o in q:\r\n f1=a1.find(o)\r\n if(f1!=-1):\r\n print(a1[f1+w], end=\"\")\r\n f2=a2.find(o)\r\n if(f2!=-1):\r\n print(a2[f2+w],end=\"\")\r\n f3=a3.find(o)\r\n if(f3!=-1):\r\n print(a3[f3+w],end=\"\")\r\n ", "symb = [s for s in 'qwertyuiopasdfghjkl;zxcvbnm,./']\r\nop = -1 if input() == 'R' else 1\r\n\r\nfor i in input():\r\n print(symb[symb.index(i)+1*op],end = '')", "temp=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\n\nc=input()\ns=input()\n\nfor i in range(len(s)):\n pos=temp.find(s[i])\n if c==\"R\":\n pos-=1\n else:\n pos+=1\n print(temp[pos], end=\"\")\n\n\n\n\n\t\t\t\t\t \t\t \t \t\t\t\t\t \t\t \t \t \t\t\t\t", "f = input()\r\ns = input()\r\nkeyboard = '''qwertyuiop\r\nasdfghjkl;\r\nzxcvbnm,./'''\r\nnew_s = ''\r\nif f == 'R':\r\n for i in s:\r\n new_s += keyboard[keyboard.index(i) - 1]\r\nelse:\r\n for i in s:\r\n new_s += keyboard[keyboard.index(i) + 1]\r\nprint(new_s)\r\n", "keys = ['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\n\r\nn=input()\r\nstroka = input()\r\nli=[]\r\n\r\ni=0\r\nwhile i<len(stroka):\r\n for item in keys:\r\n if item==stroka[i]:\r\n index=keys.index(item)\r\n if n==\"R\":\r\n elem=keys[index-1]\r\n else:\r\n elem=keys[index+1]\r\n li.append(elem)\r\n i+=1\r\nprint(*li,sep='')", "ch=input()\r\nchaine=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\ntext=input()\r\ntext1=\"\"\r\nfor i in range(len(text)):\r\n position=chaine.find((text[i]))\r\n if ch==\"R\":\r\n text1 = text1+chaine[position-1]\r\n else:\r\n text1 = text1+chaine[position+1]\r\n \r\n \r\n\r\nprint(text1)", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and run it.\r\ns=input()\r\np=input()\r\nq=''\r\nz=''\r\nd=\"qwertyuiop[]asdfghjkl;'zxcvbnm,./\"\r\nif s=='R':\r\n for i in range(len(p)) :\r\n z=p[i]\r\n a=d.find(z)\r\n q=q+d[a-1]\r\n a=0\r\nelse:\r\n for i in range(len(p)) :\r\n z=p[i]\r\n a=d.find(z)\r\n q=q+d[a+1]\r\n a=0\r\nprint(q)\r\n ", "a = \"qwertyuiop\"\r\nb = \"asdfghjkl;\"\r\nc = \"zxcvbnm,./\"\r\nd = input()\r\nx = \"\"\r\ni = 0\r\nif d == \"R\":\r\n i = -1\r\nelse:\r\n i = 1\r\ns = input()\r\nfor p in s:\r\n if p in a:\r\n x += a[a.index(p)+i]\r\n elif p in b:\r\n x += b[b.index(p)+i]\r\n elif p in c:\r\n x += c[c.index(p)+i]\r\nprint(x)\r\n", "a = input()\r\nb = input()\r\nc = ['q','w','e','r','t','y','u','i','o','p',\r\n 'a','s','d','f','g','h','j','k','l',';',\r\n 'z','x','c','v','b','n','m',',','.','/']\r\n\r\nd = \"\"\r\ncount = -1\r\njj = 0\r\ngg = 0\r\n\r\n\r\nif a == \"L\":\r\n count = 1\r\n\r\nwhile jj < len(b):\r\n while gg < len(c):\r\n if b[jj] == c[gg]:\r\n d += c[gg+(count)]\r\n gg += 1\r\n gg = 0\r\n jj += 1\r\nprint(d)", "n = input()\r\ns = input()\r\nkeyb = [i for i in 'qwertyuiopasdfghjkl;zxcvbnm,./']\r\ns = [i for i in s]\r\nindx = -1 if n == 'R' else 1\r\nans = ''\r\nfor i in range(len(s)):\r\n id = keyb.index(s[i])\r\n ans += keyb[id+indx]\r\n\r\nprint(ans)", "n = input()\r\nsq = input()\r\nq = 'qwertyuiop'\r\nw = 'asdfghjkl;'\r\ne = 'zxcvbnm,./'\r\nd = []\r\nfor i in sq:\r\n if i in q and n == 'R':\r\n d.append(q[q.index(i)-1])\r\n elif i in w and n == 'R':\r\n d.append(w[w.index(i)-1])\r\n elif i in e and n == 'R':\r\n d.append(e[e.index(i)-1])\r\n if i in q and n == 'L':\r\n d.append(q[q.index(i)+1])\r\n elif i in w and n == 'L':\r\n d.append(w[w.index(i)+1])\r\n elif i in e and n == 'L':\r\n d.append(e[e.index(i)+1])\r\nprint(*d,sep='')", "s = input()\r\ntc = input()\r\nl = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nres = \"\"\r\nif(s==\"R\"):\r\n for i in range(len(tc)):\r\n j = l.find(tc[i])\r\n res = res + l[j-1]\r\nelse:\r\n for i in range(len(tc)):\r\n j = l.find(tc[i])\r\n res = res + l[j+1]\r\nprint(res)", "def all_string(str,ch):\r\n x=0\r\n for i in str:\r\n if ch==i:\r\n return x\r\n x+=1\r\n return -1\r\n\r\ndir = input()\r\ninp = input()\r\nn=0\r\nif dir==\"R\":\r\n n =-1\r\nelse:\r\n n=1\r\none = 'qwertyuiop'\r\ntwo = 'asdfghjkl;'\r\nthree = 'zxcvbnm,./'\r\nans=''\r\nfor i in inp:\r\n\r\n pos = all_string(one,i)\r\n if pos!=-1:\r\n ans+=one[pos+n]\r\n\r\n pos = all_string(two,i)\r\n if pos!=-1:\r\n ans+=two[pos+n]\r\n\r\n pos = all_string(three, i)\r\n if pos != -1:\r\n ans += three[pos + n]\r\nprint(ans)", "'''// Problem: A. Keyboard\r\n// Contest: Codeforces - Codeforces Round #271 (Div. 2)\r\n// URL: https://codeforces.com/problemset/problem/474/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\ncom=input()\r\nd1={}\r\ns=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nj=1\r\nfor i in s:\r\n d1[i]=j\r\n j=j+1\r\n#print(d1)\r\n\r\nd2={}\r\n#print(d1)\r\nfor i in d1:\r\n\td2[d1[i]]=i\r\n#print(d2)\r\ns1=input()\r\nlist2=[]\r\nif(com==\"R\"):\r\n\tfor i in s1:\r\n\r\n\t\tlist2.append(d2[d1[i]-1])\r\n\tfor i in list2:\r\n\t\tprint(i,end=\"\")\r\nelif(com==\"L\"):\r\n\tfor i in s1:\r\n\t\tlist2.append(d2[d1[i]+1])\r\n\tfor i in list2:\r\n\t\tprint(i,end=\"\")\r\n\t", "letters = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nthe_right = []\r\na = input()\r\nstring = input()\r\nfor i in string:\r\n if a == 'R':\r\n the_right.append(letters[letters.index(i) - 1])\r\n else:\r\n the_right.append(letters[letters.index(i) + 1])\r\n\r\nprint(*the_right, sep='')", "N=input()\r\ns=input()\r\nkeys = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\ns1=''\r\nfor x in s:\r\n if N=='R':\r\n s1+=keys[keys.find(x)-1]\r\n else:\r\n s1+=keys[keys.find(x)+1]\r\nprint(s1)\r\n", "keyboard = ['q', 'w', 'e', 'r', 't', 'y','u', 'i','o', 'p','[', ']','a', 's','d', 'f','g', 'h','j', 'k','l', ';',\"'\", 'z', 'x' , 'c', 'v',\r\n 'b', 'n', 'm', ',' ,'.' ,'/']\r\nshift = input()\r\nword = input()\r\n\r\nif shift == 'R':\r\n j = -1\r\nelse:\r\n j = 1\r\nfor letter in word:\r\n i = keyboard.index(letter)\r\n print(keyboard[i+j] ,end='')", "n = input()\ns = input()\nup = 'qwertyuiop'\nmiddle = 'asdfghjkl;'\nlow = 'zxcvbnm,./'\nk = 0\npred = []\ndob = 0\nif n == 'R':\n k -= 1\nelse:\n k += 1\nfor i in s:\n if i in up:\n dob = up.index(i)\n pred.append(up[dob + k])\n if i in middle:\n dob = middle.index(i)\n pred.append(middle[dob + k])\n if i in low:\n dob = low.index(i)\n pred.append(low[dob + k])\n\nprint(''.join(pred))\n", "d = input()\r\ns = input()\r\n\r\nk = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nv = 1 if d == \"L\" else -1\r\nnew = \"\"\r\nfor i in s:\r\n new += k[k.index(i) + v]\r\nprint(new)", "keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\ndir = str(input())\r\ntext = str(input())\r\nnewtext = \"\"\r\nfor letter in text:\r\n\tif dir == \"R\": newtext += keyboard[keyboard.index(letter)-1]\r\n\telse: newtext += keyboard[keyboard.index(letter)+1]\r\nprint(newtext)", "\r\nkeyboard = ['qwertyuiop', 'asdfghjkl;', 'zxcvbnm,./']\r\n \r\ndef getPos(c):\r\n i = 0\r\n for r in keyboard:\r\n j = 0\r\n for ch in r:\r\n if c == ch:\r\n return i, j\r\n j += 1\r\n i += 1\r\n\r\nt = input()\r\ns = input()\r\n\r\n\r\nfor ch in s:\r\n # print(c, getPos(c), ke)\r\n r, c = getPos(ch)\r\n # print(ch, r, c)#, keyboard[r][c])\r\n if t == 'R':\r\n print(keyboard[r][c-1 if c > 0 else c], end='')\r\n else:\r\n print(keyboard[r][c + 1 if c < len(keyboard[r])-1 else c] , end='')\r\n pass", "d=input()\r\ns=input()\r\ns_list=[]\r\n\r\n## Turn s to list\r\nfor item in s:\r\n s_list.append(item)\r\n\r\n## List of keyboard\r\nk='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nk_list=[]\r\nfor item in k:\r\n k_list.append(item)\r\nn=len(k_list)\r\n\r\n## Shift the I/P\r\nc_s=''\r\nfor item in s_list:\r\n if d=='R':\r\n i=0\r\n while i<n:\r\n if item==k_list[i]:\r\n c_s=c_s+k_list[i-1]\r\n i=i+1\r\n elif d=='L':\r\n i=0\r\n while i<n:\r\n if item==k_list[i]:\r\n c_s=c_s+k_list[i+1]\r\n i=i+1\r\n## Print O/P\r\nprint(c_s)", "res = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nx = input()\r\ns = input()\r\ntok = {}\r\nfor i in range(len(res)):\r\n tok[res[i]] = i\r\nans = \"\"\r\nfor i in s :\r\n if x == \"R\" :\r\n ans += res[tok[i] -1]\r\n else:\r\n ans += res[tok[i] + 1]\r\n\r\nprint(ans)", "# LUOGU_RID: 113548189\nf=input()\r\nif f=='R':\r\n f=-1\r\nelse:\r\n f=1\r\na=input()\r\n_1='qwertyuiop'\r\n_2='asdfghjkl;'\r\n_3='zxcvbnm,./'\r\nfor i in a:\r\n if i in _1:\r\n print(_1[_1.index(i)+f],end='')\r\n elif i in _2:\r\n print(_2[_2.index(i)+f],end='')\r\n else:\r\n print(_3[_3.index(i)+f],end='')", "\r\nimport math as mth\r\nimport sys\r\n#input=sys.stdin.readline\r\n\r\n\r\n\r\ndef solve():\r\n \r\n #n,m=map(int,input().split())\r\n #a=list(map(int,input().split()))\r\n s_in=\"qwertyuiopasdfghjkl;zxcvbnm,./\" \r\n shift=1\r\n if input()==\"R\":\r\n shift=-1\r\n s_out=\"\"\r\n s=input()\r\n for smb in s:\r\n s_out+=s_in[s_in.index(smb) + shift] \r\n print(s_out)\r\n return\r\n\r\ndef main():\r\n #for _ in range(int(input())):\r\n solve()\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "k = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\ns = input()\r\nw = input()\r\nif s == \"R\":\r\n a = []\r\n for i in w:\r\n a.append(k[k.index(i)-1])\r\n print(\"\".join(a))\r\nelse:\r\n a = []\r\n for i in w:\r\n a.append(k[k.index(i)+1])\r\n print(\"\".join(a))\r\n", "d = -1 if input() == \"R\" else 1\r\ns = input()\r\n\r\nk = \"0qwertyuiop0asdfghjkl;0zxcvbnm,./0\"\r\nres = \"\"\r\nfor l in s:\r\n res += k[k.index(l) + d] if k[k.index(l) + d] != \"0\" else \"\"\r\n\r\nprint(res)", "x=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nd=input()\r\ns=input()\r\nfor i in s:\r\n if i in x and d==\"R\":\r\n v=x[x.index(i)-1]\r\n print(v,end=\"\")\r\n else:\r\n print((x[x.index(i)+1]),end=\"\")\r\n ", "n=input()\r\na='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nw=input()\r\nz=''\r\nif n=='L':\r\n for i in w:\r\n z+=a[a.index(i)+1]\r\nelse:\r\n for i in w:\r\n z+=a[a.index(i)-1]\r\nprint(z)", "a=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nb=input()\r\nc=input()\r\nif b==\"R\":\r\n for i in c:\r\n print(a[a.index(i)-1],end=\"\")\r\nelse:\r\n for i in c:\r\n print(a[a.index(i)+1],end=\"\")", "import math \r\ndef primeFactors(n):\r\n l = []\r\n c = 2\r\n while(n > 1):\r\n if(n % c == 0):\r\n l.append(c)\r\n n = n / c\r\n else:\r\n c = c + 1\r\n return l\r\ndef primeFactors(n):\r\n l = []\r\n c = 2\r\n while(n > 1):\r\n if(n % c == 0):\r\n l.append(c)\r\n n = n / c\r\n else:\r\n c = c + 1\r\n return l\r\n \r\n'''-----------------------------------------------------------------------'''\r\ndef prime(n):\r\n prime_flag = 0\r\n if(n > 1):\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n if (n % i == 0):\r\n prime_flag = 1\r\n break\r\n return prime_flag\r\n'''---------------------------------------------------------------------'''\r\n\r\nc = input()\r\ns = input()\r\ninp = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nif c==\"R\":\r\n j = -1\r\nelse:\r\n j = 1\r\nans =\"\"\r\nfor i in range(len(s)):\r\n d = s[i]\r\n l = inp.index(d)\r\n ans+=inp[l+j]\r\nprint(ans)\r\n\r\n \r\n ", "a=str(input())\r\nb=list(str(input()))\r\nres=[]\r\ns=list(\"qwertyuiopasdfghjkl;zxcvbnm,./\")\r\nfor x in b:\r\n if a==\"R\":\r\n res.append(s[int(s.index(x))-1])\r\n if a==\"L\":\r\n res.append(s[int(s.index(x))+1])\r\nprint(\"\".join(res))", "letter = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\n\r\nsdvig = input()\r\ntext = input()\r\nres = ''\r\n\r\nfor v in text:\r\n a = letter.find(v)\r\n if sdvig == 'R':\r\n \r\n res += letter[a-1]\r\n else:\r\n res += letter[a+1]\r\n\r\nprint(res)", "dir = input()\r\nstring = input()\r\noriginal = \"\"\r\nl1 = \"qwertyuiop\"\r\nl2 = \"asdfghjkl;\"\r\nl3 = \"zxcvbnm,./\"\r\nif dir == \"R\":\r\n for ele in string:\r\n if ele in l1 :\r\n original = original + l1[l1.index(ele)-1]\r\n elif ele in l2:\r\n original = original + l2[l2.index(ele) - 1]\r\n else:\r\n original = original + l3[l3.index(ele)-1]\r\n print(original)\r\nelse:\r\n for ele in string:\r\n if ele in l1 :\r\n original = original + l1[l1.index(ele)+1]\r\n elif ele in l2:\r\n original = original + l2[l2.index(ele) +1]\r\n else:\r\n original = original + l3[l3.index(ele)+1]\r\n print(original)\r\n", "d=input()\r\nm=input()\r\nlst1=['q','w','e','r','t','y','u','i','o','p']\r\na1=set(lst1)\r\nlst2=['a','s','d','f','g','h','j','k','l',';']\r\nb1=set(lst2)\r\nlst3=['z','x','c','v','b','n','m',',','.','/']\r\nc1=set(lst3)\r\nn=[]\r\nfor i in range(len(m)):\r\n h=set(m[i])\r\n if d=='R':\r\n if h.issubset(a1):\r\n j=lst1.index(m[i])\r\n n.append(lst1[j-1])\r\n elif h.issubset(b1):\r\n j=lst2.index(m[i])\r\n n.append(lst2[j-1])\r\n elif h.issubset(c1):\r\n j=lst3.index(m[i])\r\n n.append(lst3[j-1])\r\n else:\r\n if h.issubset(a1):\r\n j=lst1.index(m[i])\r\n n.append(lst1[j+1])\r\n elif h.issubset(b1):\r\n j=lst2.index(m[i])\r\n n.append(lst2[j+1])\r\n elif h.issubset(c1):\r\n j=lst3.index(m[i])\r\n n.append(lst3[j+1])\r\nprint(*n,sep='')", "key ='qwertyuiopasdfghjkl;zxcvbnm,./'\nn = input()\nword = input()\nfor i in range(0,len(word),1):\n pos= key.find(word[i])\n if n=='R':\n print(key[pos-1],end='')\n else:\n print(key[pos+1],end='')\n\n\t\t\t\t \t \t\t\t \t \t\t \t \t\t\t", "n=input()\ns=input()\nans=''\nlst=['qwertyuiop', 'asdfghjkl;', 'zxcvbnm,./']\nfor el in s:\n for i in range(3):\n a=lst[i]\n if el in a:\n idx=a.index(el)\n if n=='R':\n ans+=a[idx-1] \n else:\n ans+=a[idx+1]\n\nprint(ans)\n \t\t\t \t\t\t \t\t\t\t\t\t \t\t \t\t \t \t", "a='qwertyuiop'\r\nb='asdfghjkl;'\r\nc='zxcvbnm,./'\r\nd=input()\r\ns=input()\r\nres=[]\r\nif d=='L':\r\n for i in range(len(s)):\r\n if s[i] in a:\r\n if s[i]==a[-1]:\r\n res.append(a[a.index(s[i])])\r\n else :\r\n res.append(a[a.index(s[i])+1])\r\n if s[i] in b:\r\n if s[i]==b[-1]:\r\n res.append(b[b.index(s[i])])\r\n else :\r\n res.append(b[b.index(s[i])+1])\r\n if s[i] in c:\r\n if s[i]==c[-1]:\r\n res.append(c[c.index(s[i])])\r\n else :\r\n res.append(c[c.index(s[i])+1])\r\nelse :\r\n for i in range(len(s)):\r\n if s[i] in a:\r\n if s[i]==a[0] :\r\n res.append(a[a.index(s[i])])\r\n else :\r\n res.append(a[a.index(s[i])-1])\r\n if s[i] in b:\r\n if s[i]==b[0] :\r\n res.append(b[b.index(s[i])])\r\n else :\r\n res.append(b[b.index(s[i])-1])\r\n if s[i] in c:\r\n if s[i]==c[0] :\r\n res.append(c[c.index(s[i])])\r\n else :\r\n res.append(c[c.index(s[i])-1])\r\nprint(*res, sep='')", "D1={'w':'q','e':'w','r':'e','t':'r','y':'t','u':'y','i':'u','o':'i','p':'o','[':'p',']':'[','s':'a','d':'s','f':'d','g':'f','h':'g','j':'h','k':'j','l':'k',';':'l','x':'z','c':'x','v':'c','b':\"v\",'n':'b','m':'n',',':'m','.':',','/':'.'}\r\nD2={'q':'w','w':'e','e':'r','r':'t','t':'y','u':'i','y':'u','i':'o','o':'p','p':'[','[':']','a':'s','s':'d','d':'f','f':'g','g':'h','h':'j','j':'k','k':'l','l':\";\",'z':'x','x':'c','c':'v','v':'b','b':'n','n':'m','m':',',',':\".\",'.':'/'}\r\nq=input()\r\nst=input()\r\ns=\"\"\r\nif q=='R':\r\n for i in st:\r\n s=s[:]+D1[i]\r\nelse :\r\n for i in st:\r\n s=s[:]+D2[i]\r\n\r\n\r\nprint (s)", "from io import StringIO\r\n\r\nchars = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nchars_indices = {char: index for index, char in enumerate(chars)}\r\nshift = -1 if input() == \"R\" else 1\r\ntext = input()\r\noutput = StringIO()\r\n\r\nfor char in text:\r\n chat_index = chars_indices[char]\r\n correct_char_index = chat_index + shift\r\n output.write(chars[correct_char_index])\r\n\r\nprint(output.getvalue())\r\n\r\n\r\n\r\n\r\n \r\n", "kb = \"qwertyuiop[]asdfghjkl;'zxcvbnm,./\"\r\nc = input()\r\ns = input()\r\nans = \"\"\r\nfor i in s:\r\n if c == \"R\":\r\n ans += kb[kb.find(i) - 1]\r\n else:\r\n ans += kb[kb.find(i) + 1]\r\nprint(ans)", "\r\ns=input()\r\ns1=input();\r\nletters='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nlet=''\r\nif ('R' in s):\r\n for i in range(len(s1)):\r\n for j in range(len(letters)):\r\n if (s1[i]==letters[j]):\r\n let+=letters[j-1]\r\nelse:\r\n for i in range(len(s1)):\r\n for j in range(len(letters)):\r\n if (s1[i]==letters[j]):\r\n let+=letters[j+1]\r\n\r\nprint(let)\r\n\r\n\r\n\r\n\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=['qwertyuiopasdfghjkl;zxcvbnm,./']\r\nl1=l[0]\r\na=input()\r\nb=input()\r\nfor i in range(len(b)):\r\n c=l1.index(b[i])\r\n if a=='R':\r\n print(l1[c-1],end='')\r\n else:\r\n print(l1[c+1],end='')\r\nprint()", "def main():\r\n st = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n w = input()\r\n s = input()\r\n new_s = \"\"\r\n\r\n if w == 'R':\r\n for char in s:\r\n ind = st.index(char)\r\n new_s += st[ind - 1]\r\n else:\r\n for char in s:\r\n ind = st.index(char)\r\n new_s += st[ind + 1]\r\n\r\n print(new_s)\r\n\r\nmain()\r\n", "p=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\ndir=input();s=input();ans=\"\"\r\nif dir==\"R\":\r\n for i in s:ans+=p[p.index(i)-1]\r\nelse:\r\n for i in s:ans+=p[p.index(i)+1]\r\nprint(ans)", "shift = input()\r\ndistorted = input()\r\nkeyboard = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nfixed = []\r\n\r\nfor i in distorted:\r\n\r\n if shift == 'R':\r\n fixed.append(keyboard[keyboard.index(i)-1])\r\n elif shift == 'L':\r\n fixed.append(keyboard[keyboard.index(i) + 1])\r\n\r\n\r\nprint(''.join(fixed))", "mylist =['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\ndirection = input()\r\nmessage = input()\r\noutput=''\r\nmyright={'p',';','/'}\r\nmyleft = {'q','a','z'}\r\nif direction == 'L':\r\n for char in message :\r\n if char in myright:\r\n output +=char\r\n else:\r\n output += mylist[mylist.index(char)+1]\r\nelse:\r\n for char in message:\r\n if char in myleft :\r\n output += char\r\n else:\r\n output += mylist[mylist.index(char)-1]\r\n\r\nprint(output)", "mole_keyboard_str = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\n\nmole_keyboard = {}\ni = 0\nfor letter in mole_keyboard_str:\n mole_keyboard[letter] = i\n i += 1\n\nshift = -1 if input() == \"R\" else 1\n\nblind_mole = input()\n\nog_string = \"\"\n\nfor letter in blind_mole:\n og_letter = mole_keyboard[letter] + shift\n og_string += mole_keyboard_str[og_letter]\n\nprint(og_string)\n \t\t\t \t \t \t\t \t\t\t \t", "# Link: https://codeforces.com/contest/474/problem/A\n\nkeyboard_letters = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\n\ndirection = input()\nsequence = input()\n\nif direction == \"R\":\n sequence = \"\".join(list(map(lambda x: keyboard_letters[keyboard_letters.index(x) - 1], sequence)))\nelse:\n sequence = \"\".join(list(map(lambda x: keyboard_letters[keyboard_letters.index(x) + 1], sequence)))\n\nprint(sequence)", "a = input()\r\n\r\nb = input()\r\n\r\nmass = \"qwertyuiop\"\r\nmass2 = \"asdfghjkl;\"\r\nmass3 = \"zxcvbnm,./\"\r\n\r\nmessage = \"\"\r\n\r\nfor i in b:\r\n if i in mass:\r\n num = mass.index(i)\r\n if a == \"R\":\r\n message += mass[num-1]\r\n else:\r\n message += mass[num+1]\r\n \r\n elif i in mass2:\r\n num = mass2.index(i)\r\n if a == \"R\":\r\n message += mass2[num-1]\r\n else:\r\n message += mass2[num+1]\r\n \r\n else:\r\n num = mass3.index(i)\r\n if a == \"R\":\r\n message += mass3[num-1]\r\n else:\r\n message += mass3[num+1]\r\n\r\nprint(message)", "keyboard_letters = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\ndictionary = {}\n\nfor index in range(len(keyboard_letters)):\n character = keyboard_letters[index]\n dictionary[character] = index\n\ndirection = input()\nsequence = input()\n\nshift = 1 if direction == \"L\" else -1\nnew_sequence = \"\"\n\nfor character in sequence:\n new_index = dictionary[character] + shift\n new_sequence += keyboard_letters[new_index]\n\nprint(new_sequence)", "key = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\n\nc = input()\nword = input()\n\nfor i in range(0, len(word), 1):\n pos = key.find(word[i])\n if c == \"R\":\n print(key[pos-1], end=\"\")\n else:\n print(key[pos + 1], end=\"\")\n\n\t\t \t\t\t \t \t \t\t\t \t\t\t\t \t\t \t \t\t", "# A. Keyboard\r\nd=input()\r\ns=input()\r\nlst='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nlst=list(lst)\r\nans=''\r\nif d=='R':\r\n for i in range(len(s)):\r\n x= lst.index(s[i]) -1\r\n ans+=lst[x]\r\nelif d=='L':\r\n for i in range(len(s)):\r\n x= lst.index(s[i]) +1\r\n ans+=lst[x] \r\nprint (ans) ", "# https://codeforces.com/problemset/problem/474/A\r\n\r\nline1 = 'qwertyuiop'\r\nline2 = 'asdfghjkl;'\r\nline3 = 'zxcvbnm,./'\r\n\r\npos1 = {x:i for i, x in enumerate(line1)}\r\npos2 = {x:i for i, x in enumerate(line2)}\r\npos3 = {x:i for i, x in enumerate(line3)}\r\n\r\ndirection = -1 if input() == 'R' else 1\r\nword = input()\r\nres = ''\r\nfor letter in word:\r\n if letter in pos1:\r\n res += line1[pos1[letter]+direction]\r\n if letter in pos2:\r\n res += line2[pos2[letter]+direction]\r\n if letter in pos3:\r\n res += line3[pos3[letter]+direction]\r\nprint(res)\r\n", "n = input()\r\ny = input()\r\nans = str()\r\nl = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nif n == \"R\":\r\n for i in range(len(y)):\r\n ans += l[l.index(y[i])-1]\r\nelse:\r\n for i in range(len(y)):\r\n if l.index(y[i])+1>len(l)-1:\r\n ans += l[0]\r\n else:\r\n ans += l[l.index(y[i])+1]\r\nprint(ans)", "x=input()\r\ny=input()\r\nw=''\r\nt='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nfor i in y:\r\n if x=='R':\r\n w+=t[(t.index(i)-1)]\r\n else:\r\n w+=t[(t.index(i)+1)]\r\n \r\nprint(w) ", "x = input()\ns = input()\n\nkeyboard = [\n ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p'],\n ['a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', ';'],\n ['z', 'x', 'c', 'v', 'b', 'n', 'm', ',', '.', '/']\n]\n\nans = \"\"\nfor k in range(len(s)):\n for i in range(3):\n for j in range(10):\n if keyboard[i][j] == s[k]:\n if x == \"R\":\n ans += keyboard[i][j-1]\n else:\n ans += keyboard[i][j+1]\n\nprint(ans)\n\t\t\t \t \t \t\t \t\t\t \t \t \t\t \t\t", "sLetter=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\ns1=input()\r\ns2=input()\r\nresult=\"\"\r\nif s1==\"R\":\r\n for i in range(len(s2)):\r\n index = sLetter.find(s2[i])\r\n result+=sLetter[index-1]\r\nelse: \r\n for i in range(len(s2)):\r\n index = sLetter.find(s2[i])\r\n result+=sLetter[index+1]\r\n \r\nprint(result)", "s = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nm = input()\r\nstep = -1 if m == 'R' else 1\r\nn = input()\r\na = ''\r\nfor i in n:\r\n a += s[s.index(i)+step]\r\nprint(a)", "#all those moments will be lost in time , like tears in rain\r\nst = input()\r\nmess = input()\r\nkeybord = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nkey=0\r\nfor i in mess:\r\n if st == 'R':\r\n key= (keybord.index(i)-1)\r\n print(keybord[key], end='')\r\n\r\n elif st == 'L':\r\n key = (keybord.index(i)+1)\r\n print(keybord[key], end='')\r\n", "s=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\np=input()\r\ns1=input()\r\nif p==\"R\":\r\n for i in s1:\r\n print(s[s.index(i)-1],end=\"\")\r\nelse:\r\n for i in s1:\r\n print(s[s.index(i)+1],end=\"\")", "#https://codeforces.com/problemset/problem/474/A\r\n\r\n#qwertyuiop\r\n#asdfghjkl;\r\n#zxcvbnm,./\r\ndef get_keyboard():\r\n first_line = \"qwertyuiop\"\r\n second_line = \"asdfghjkl;\"\r\n third_line = \"zxcvbnm,./\"\r\n return [first_line, second_line, third_line]\r\n\r\ndef get_dict(type):\r\n lines = get_keyboard()\r\n dict_left = {}\r\n index = 0\r\n if(type == \"R\"):\r\n x = -1\r\n else:\r\n x = 1\r\n while index < len(lines[0]):\r\n try:\r\n dict_left[lines[0][index]] = lines[0][index+x]\r\n dict_left[lines[1][index]] = lines[1][index+x]\r\n dict_left[lines[2][index]] = lines[2][index+x]\r\n except:\r\n index += 1\r\n index += 1\r\n return dict_left\r\n\r\ndef convert_text(text, dictionary):\r\n print(dictionary)\r\n for key, value in dictionary.items():\r\n answer = text.replace(key, value)\r\n return answer\r\n\r\ndictionary = get_dict(input())\r\ntext = input()\r\ndictionary = str.maketrans(dictionary)\r\nprint(text.translate(dictionary))", "direction = input()\r\nletters = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nfor i in input():\r\n if direction == \"R\":\r\n print(letters[letters.index(i)-1], end=\"\")\r\n else:\r\n print(letters[letters.index(i)+1], end=\"\")", "direction = input()\r\ncharacters = input()\r\nkeyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\nfor character in characters:\r\n if direction == 'R':\r\n print(keyboard[keyboard.find(character) - 1], end='')\r\n else:\r\n print(keyboard[keyboard.find(character) + 1], end='')\r\n", "d = input().strip()\r\noffset = 0\r\nif d == 'R':\r\n\toffset = -1\r\nelse:\r\n\toffset = 1\r\n\r\ns = input().strip()\r\n\r\nrows = {}\r\nrow1 = {}\r\nrev1 = {}\r\n\r\nrow2 = {}\r\nrev2 = {}\r\n\r\nrow3 = {}\r\nrev3 = {}\r\n\r\nfor i,c in enumerate(\"qwertyuiop\"):\r\n\trows[c] = 1\r\n\trow1[c] = i\r\n\trev1[i] = c\r\nfor i,c in enumerate(\"asdfghjkl;\"):\r\n\trows[c] = 2\r\n\trow2[c] = i\r\n\trev2[i] = c\r\nfor i,c in enumerate(\"zxcvbnm,./\"):\r\n\trows[c] = 3\r\n\trow3[c] = i\r\n\trev3[i] = c\r\n\r\nans = \"\"\r\nfor c in s:\r\n\trow = rows[c]\r\n\tif row == 1:\r\n\t\tans += rev1[row1[c]+offset]\r\n\telif row == 2:\r\n\t\tans += rev2[row2[c]+offset]\r\n\telse:\r\n\t\tans += rev3[row3[c]+offset]\r\nprint(ans) ", "# Author : //- kibrom Hailu -\\\\\r\n\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque \r\nfrom bisect import bisect , bisect_left ,bisect_right \r\nfrom itertools import accumulate \r\nfrom heapq import heapify , heappop , heappush , heappushpop , heapreplace\r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n # write your code here \r\n direction = input() \r\n typed = input()\r\n corrected = ''\r\n keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n if direction == 'R':\r\n for ch in typed:\r\n corrected += keyboard[keyboard.index(ch)-1]\r\n else:\r\n for ch in typed:\r\n corrected += keyboard[keyboard.index(ch)+1]\r\n \r\n return corrected \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nprint(solve())\r\n", "l = input()\r\nm = input()\r\nkeyboard = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\ncorrect_message = ''\r\nfor i in m:\r\n if l == 'L':\r\n letter_index = keyboard.index(i)\r\n correct_message += keyboard[letter_index + 1]\r\n else:\r\n letter_index = keyboard.index(i)\r\n correct_message += keyboard[letter_index - 1]\r\n\r\nprint(correct_message)\r\n", "s=input();a=\"qwertyuiop[]asdfghjkl;'zxcvbnm,./\"\r\nfor l in input():print(a[a.index(l)+[1,-1][s=='R']],end='')", "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\nc=input()\r\ns=list(input().strip())\r\nres=[]\r\nfor i in s:\r\n for row in a:\r\n if i in row:\r\n found=False\r\n index=row.index(i)\r\n if c=='R':\r\n if index>0:\r\n res.append(row[index-1])\r\n else:\r\n res.append(char)\r\n else:\r\n if index<len(row)-1:\r\n res.append(row[index+1])\r\n else:\r\n res.append(char)\r\nprint(''.join(res))", "a = input()\r\nalphabet = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nb = input()\r\nm = ''\r\nif a == 'R':\r\n for i in b:\r\n c = alphabet.find(i)\r\n m += alphabet[c-1]\r\nif a == 'L':\r\n for i in b:\r\n c = alphabet.find(i)\r\n m += alphabet[c+1]\r\nprint(m)", "keyboard='qwertyuiopasdfghjkl;zxcvbnm,./'\ndir=str(input())\nstring=str(input())\nfinal_string=''\nfor char in string:\n if dir=='R':\n final_string+=keyboard[keyboard.index(char)-1]\n else:\n final_string+=keyboard[keyboard.index(char)+1]\nprint(final_string)\n", "t = input()\ny = input()\nx = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\no = \"\"\nfor p in y:\n for i,v in enumerate(x):\n if v == p and t == \"R\":\n o += x[i-1]\n elif v == p and t == \"L\":\n o += x[i+1]\n \nprint(o)\n \t\t \t \t\t \t\t \t\t\t \t \t \t \t", "keys = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\no, s = (input() for _ in range(2))\nm = {k: v for k, v in zip(keys, keys[1:] if o == \"L\" else \" \" + keys)}\nres = \"\".join(m[c] for c in s)\nprint(res)\n", "keyboard1=\"qwertyuiop\"\nkeyboard2=\"asdfghjkl;\"\nkeyboard3=\"zxcvbnm,./\"\n\nchoice=input()\nkeyboard={}\nif(choice==\"R\"):\n \n for i in range(1,len(keyboard1)):\n keyboard[keyboard1[i]]=keyboard1[i-1]\n for i in range(1,len(keyboard2)):\n keyboard[keyboard2[i]]=keyboard2[i-1]\n for i in range(1,len(keyboard3)):\n keyboard[keyboard3[i]]=keyboard3[i-1] \n \nelse:\n for i in range(0,len(keyboard1)-1):\n keyboard[keyboard1[i]]=keyboard1[i+1]\n for i in range(0,len(keyboard2)-1):\n keyboard[keyboard2[i]]=keyboard2[i+1]\n for i in range(0,len(keyboard3)-1):\n keyboard[keyboard3[i]]=keyboard3[i+1] \n\n\nthe_word=input()\nres=''\nfor letter in the_word:\n res+=keyboard[letter]\nprint(res) \n\n \t\t\t\t\t \t \t \t\t\t\t\t\t\t\t \t\t \t \t\t\t", "keyboard = ('qwertyuiop', 'asdfghjkl;', 'zxcvbnm,./')\r\ndirection = input ()\r\ncode = input ()\r\noriginal = ''\r\nfor char in code:\r\n for i in range (3):\r\n if char in keyboard [i]:\r\n if direction == 'L':\r\n original += keyboard [i] [keyboard [i].find (char) + 1]\r\n else:\r\n original += keyboard [i] [keyboard [i].find (char) - 1]\r\nprint (original)\r\n", "#474A Keyboard\r\nn=input()\r\ns=input()\r\nt=[]\r\nl=['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\nif n==\"R\":\r\n for i in range(len(s)):\r\n t.append(l[l.index(s[i])-1])\r\nelse:\r\n for i in range(len(s)):\r\n t.append(l[l.index(s[i])+1])\r\nprint(\"\".join(t))", "ref = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\n\r\nm = input()\r\ns = input()\r\n\r\nfor _ in s:\r\n i = ref.index(_)\r\n print(ref[i-1], end=\"\") if m == \"R\" else print(ref[i+1], end=\"\")", "x = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\n\r\np = input()\r\ny = input()\r\nfor i in range(len(y)) :\r\n if p=='R' :\r\n z = x.index(y[i])\r\n print(x[z-1],end='')\r\n \r\n \r\n else : \r\n z = x.index(y[i])\r\n print(x[z+1],end='') \r\n\r\n", "a = input()\r\nb = input()\r\nc = \"\"\r\nd = 0\r\n\r\nrow1 = \"qwertyuiop\"\r\nrow2 = \"asdfghjkl;\"\r\nrow3 = \"zxcvbnm,./\"\r\n\r\nfor i in range(len(b)):\r\n if a == \"R\":\r\n if b[i] in row1:\r\n d = row1.find(b[i]) - 1\r\n c += row1[d]\r\n elif b[i] in row2:\r\n d = row2.find(b[i]) - 1\r\n c += row2[d]\r\n elif b[i] in row3:\r\n d = row3.find(b[i]) - 1\r\n c += row3[d]\r\n elif a == \"L\":\r\n if b[i] in row1:\r\n d = row1.find(b[i]) + 1\r\n c += row1[d]\r\n elif b[i] in row2:\r\n d = row2.find(b[i]) + 1\r\n c += row2[d]\r\n elif b[i] in row3:\r\n d = row3.find(b[i]) + 1\r\n c += row3[d]\r\n\r\nprint(c)\r\n", "keyboard = [\r\n \"qwertyuiop\",\r\n \"asdfghjkl;\",\r\n \"zxcvbnm,./\"\r\n]\r\n\r\nd = input()\r\n\r\ns = input()\r\n\r\ndef shift_char(char, d):\r\n for row in keyboard:\r\n if char in row:\r\n index = row.index(char)\r\n if d == 'L':\r\n return row[index + 1] if index < len(row) - 1 else row[index]\r\n elif d == 'R':\r\n return row[index - 1] if index > 0 else row[index]\r\n\r\n\r\ndecoded_message = ''.join(shift_char(char, d) for char in s)\r\n\r\nprint(decoded_message)\r\n\r\n\r\n \r\n \r\n", "st = input()\nmess = input()\nkeybord = 'qwertyuiopasdfghjkl;zxcvbnm,./'\n\nfor i in mess:\n if i in keybord:\n if st == 'R' or st == 'r':\n i = (keybord.index(i)-1)\n print(keybord[i], end='')\n\n elif st == 'L' or st == 'l':\n i = (keybord.index(i)+1)\n print(keybord[i], end='')\n\t \t \t\t \t \t\t\t \t\t \t \t \t\t", "a = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\nd = input()\r\nst = input()\r\nfor i in st:\r\n if d == \"R\":\r\n print(a[a.index(i)-1],end=\"\")\r\n\r\n else:\r\n print(a[a.index(i)+1],end=\"\")\r\n", "key='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nhand=(-1,1)[input()=='L']\r\nprint(''.join(list(map(lambda x:key[key.index(x)+hand],list(input())))))", "keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nposition = input()\r\nstring = input()\r\nnewstring = []\r\nif position.lower()==\"r\":\r\n for i in string:\r\n index = keyboard.index(i)\r\n newstring.append(keyboard[index-1])\r\nelif position.lower()=='l':\r\n for i in string:\r\n index = keyboard.index(i)\r\n newstring.append(keyboard[index+1])\r\nprint(\"\".join(newstring))", "a = 'qwertyuiop'\r\nb = 'asdfghjkl;'\r\nc = 'zxcvbnm,./'\r\ndir = input()\r\ns = input()\r\nd = -1 if dir == 'R' else 1\r\nres = ''\r\nfor elem in s:\r\n if elem in a:\r\n res += a[a.find(elem) + d]\r\n elif elem in b:\r\n res += b[b.find(elem) + d]\r\n else:\r\n res += c[c.find(elem) + d]\r\nprint(res)\r\n", "m=input()\r\n#m=s;;upimrrfod;pbr\r\n#out=allyouneedislove\r\nn=input()\r\ns='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nans=''\r\n\r\nfor i in range(0,len(n)):\r\n x=n[i]\r\n for j in range(0,len(s)):\r\n if(x==s[j]):\r\n if (m=='R'):\r\n ans+=s[(j-1)%30]\r\n else:\r\n ans+=s[(j+1)%30]\r\n \r\n \r\n\r\nprint(ans)\r\n \r\n \r\n \r\n ", "keybord=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\n\nmap={}\nc=input()\ns=input()\nif c==\"R\":\n for i in range(1,len(keybord)):\n map[keybord[i]]=keybord[i-1]\nelse:\n for i in range(len(keybord)-1):\n map[keybord[i]]=keybord[i+1]\n\nfor i in s:\n print(map.get(i),end=\"\")\n\n\n \t\t \t\t \t\t\t\t \t\t\t \t \t \t \t\t\t\t \t", "key = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nc = input()\r\ns = input()\r\nt = \"\"\r\n\r\nif c==\"R\":\r\n for e in s:\r\n t+=(key[key.find(e)-1])\r\nelse:\r\n for e in s:\r\n t+=(key[key.find(e)+1])\r\n \r\nprint(t)", "first_group = list('qwertyuiop[]')\r\nsec_group = list('asdfghjkl;')\r\nlast_group = list('zxcvbnm,./')\r\n\r\nrigt_or_left = input()\r\ns = input()\r\nmessage = \"\"\r\n\r\nif rigt_or_left == 'R':\r\n x = -1\r\nelse:\r\n x = 1\r\n\r\nfor k in s:\r\n if k in first_group:\r\n message += first_group[first_group.index(k)+x]\r\n elif k in sec_group:\r\n message += sec_group[sec_group.index(k)+x]\r\n else:\r\n message += last_group[last_group.index(k)+x]\r\n\r\nprint(message)", "x=[\"qwertyuiop\",\"asdfghjkl;\",\"zxcvbnm,./\"]\r\n\r\nfrom collections import defaultdict\r\nL=defaultdict(lambda : 0)\r\nR=defaultdict(lambda : 0)\r\n\r\nfor ii in x:\r\n for i in range(len(ii)-1):\r\n L[ii[i]]=ii[i+1]\r\n for i in range(1,len(ii)):\r\n R[ii[i]]=ii[i-1]\r\n\r\ns=input()\r\nif s==\"R\":\r\n xx=input()\r\n xxx=\"\"\r\n for i in xx:\r\n xxx+=R[i]\r\nelse:\r\n xx=input()\r\n xxx=\"\"\r\n for i in xx:\r\n xxx+=L[i]\r\nprint(xxx)", "def buscarTexto(n):\r\n texto = \"\"\r\n indice = 0\r\n for i in range(len(frase)):\r\n for j in range(len(teclado)):\r\n try:\r\n index = teclado[j].index(frase[i])\r\n indice = j\r\n texto += teclado[j][index+n]\r\n except:\r\n None\r\n return texto\r\n\r\nteclado = [\"qwertyuiop\", \"asdfghjkl;\", \"zxcvbnm,./\"]\r\n\r\nmov = input()\r\nfrase = input()\r\n\r\nif(mov == \"R\"):\r\n texto = buscarTexto(-1)\r\nelif(mov == \"L\"):\r\n texto = buscarTexto(1)\r\n\r\nprint(texto)", "s=input()\r\nls=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nss=input()\r\nif(s==\"R\"):\r\n for i in range(len(ss)):\r\n print(ls[ls.index(ss[i])-1],end=\"\")\r\nelse:\r\n for i in range(len(ss)):\r\n print(ls[ls.index(ss[i])+1],end=\"\")", "key=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\nshift=input()\ns=input()\n\nout=''\nfor i in s:\n if shift == 'R':\n out = out + key[ key.index(i) - 1 ] \n else :\n out = out + key[ key.index(i) + 1 ] \n \nprint(out)\n\t\t\t\t\t\t\t \t \t \t \t\t \t \t \t \t", "keys = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\ndirn = input()\r\ns = input()\r\nres = \"\".join(keys[keys.find(s[i]) - 1] if dirn == \"R\" else keys[keys.find(s[i]) + 1] for i in range(len(s)))\r\n\r\nprint(res)\r\n\r\n", "c=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nu=input()\r\no=input()\r\ny=1\r\nif u.lower()=='r':\r\n y=-1\r\nfor i in o:\r\n print(c[c.index(i)+y],end=\"\")", "direction = input()\r\nsequence = input()\r\n\r\nkeyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\nif direction == \"L\":\r\n original_message = \"\".join(keyboard[keyboard.index(char) + 1] for char in sequence)\r\nelse:\r\n original_message = \"\".join(keyboard[keyboard.index(char) - 1] for char in sequence)\r\n\r\nprint(original_message)\r\n\r\n", "direction = input()\r\nmessage = input()\r\n\r\nkeyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\nif direction == \"L\":\r\n shift = 1\r\nelse:\r\n shift = -1\r\n\r\noriginal_message = \"\"\r\nfor char in message:\r\n original_message += keyboard[keyboard.index(char) + shift]\r\n\r\nprint(original_message)\r\n", "n =input()\nchars=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\ns =input()\nr = \"\"\nfor i in range(len(s)):\n for j in range(len(chars)):\n if chars[j] == s[i]:\n if n == \"R\":\n r += chars[j-1]\n else:\n r += chars[j+1]\nprint(r)\n\n\t \t\t \t\t \t\t\t\t \t\t\t \t\t \t \t", "t=input()\r\narr=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\na=input()\r\nans=\"\"\r\nfor i in a:\r\n for j in range(len(arr)):\r\n if i==arr[j]:\r\n if t==\"R\":\r\n ans+=arr[j-1]\r\n else:\r\n ans+=arr[j+1]\r\n break\r\nprint(ans)", "d = input()\nline = input()\nstr = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\nif d == 'R':\n for i in range(len(line)):\n for j in range(len(str)):\n if line[i] == str[j]:\n print(str[j - 1],end='')\nelse:\n for i in range(len(line)):\n for j in range(len(str)):\n if line[i] == str[j]:\n print(str[j + 1],end='')\n\t \t\t \t\t\t\t \t \t \t\t\t\t\t\t\t\t \t\t", "n =input()\r\na='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nstring = input()\r\nfor x in string:\r\n if n == \"R\":\r\n print(a[a.find(x)-1],end='')\r\n else:\r\n print(a[a.find(x)+1],end='')", "c = input()\r\ns = str(input())\r\ns = [x for x in s]\r\nog = [x for x in \"qwertyuiopasdfghjkl;zxcvbnm,./\"]\r\nif c == 'R':\r\n i = -1\r\nelse:\r\n i = 1\r\nresult = \"\"\r\nfor element in s:\r\n ind = og.index(element)\r\n result += og[ind + i]\r\nprint(result)\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = input()\r\nx = input()\r\nit = ''\r\na, b, c = 'qwertyuiop', 'asdfghjkl;', 'zxcvbnm,./'\r\nfor i in x:\r\n af, bf, cf = a.find(i), b.find(i), c.find(i)\r\n if af != -1:\r\n if n == 'R':\r\n it += a[af - 1]\r\n else:\r\n it += a[af + 1]\r\n elif bf != -1:\r\n if n == 'R':\r\n it += b[bf - 1]\r\n else:\r\n it += b[bf + 1]\r\n else:\r\n if n == 'R':\r\n it += c[cf - 1]\r\n else:\r\n it += c[cf + 1]\r\nprint(it)", "t=input()\r\ns=input()\r\nk=\"\"\r\nfor i in range(len(s)):\r\n a=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n if t==\"L\":\r\n \r\n x=a.index(s[i])\r\n k=k+a[x+1]\r\n else:\r\n \r\n y=a.index(s[i])\r\n k=k+a[y-1]\r\nprint(k)", "keyboard=list(\"qwertyuiopasdfghjkl;zxcvbnm,./\")\r\ndirection=input()\r\ndocument=input()\r\noutput=\"\"\r\nfor i in document:\r\n output+=keyboard[keyboard.index(i)+(1 if (direction==\"L\")else -1)]\r\nprint(output)", "direction = input()\r\ntext = input()\r\n\r\nkeyboard = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p',\r\n 'a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', ';',\r\n 'z', 'x', 'c', 'v', 'b', 'n', 'm', ',', '.', '/']\r\n\r\ntextDecoded = []\r\n\r\nfor caractere in text:\r\n if direction == 'R':\r\n indexCorrect = keyboard.index(caractere) - 1\r\n textDecoded.append(keyboard[indexCorrect])\r\n else:\r\n indexCorrect = keyboard.index(caractere) + 1\r\n textDecoded.append(keyboard[indexCorrect])\r\n\r\nprint(''.join(textDecoded))", "key=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\n\nc=input()\nword=input()\n\nfor i in range(0,len(word),1):\n pos=key.find(word[i])\n if c==\"R\":\n print(key[pos-1],end=\"\")\n else:\n print(key[pos+1],end=\"\")\n\t\t \t\t\t \t\t\t \t \t \t\t \t \t \t", "k=input()\r\ns=input()\r\no=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nr=\"\"\r\nif k=='R':\r\n\tfor i in s:\r\n\t\tfor j in range(len(o)):\r\n\t\t\tif o[j]==i:\r\n\t\t\t\tr+=o[j-1]\r\nif k=='L':\r\n\tfor i in s:\r\n\t\tfor j in range(len(o)):\r\n\t\t\tif o[j]==i:\r\n\t\t\t\tr+=o[j+1]\r\nprint(r)\r\n\t\t", "s=input()\r\nque=input()\r\nl1=list(\"qwertyuiop\")\r\nl2=list(\"asdfghjkl;\")\r\nl3=list(\"zxcvbnm,./\")\r\nif s==\"R\":\r\n data={}\r\n for i in range(1,10):\r\n data[l1[i]]=l1[i-1]\r\n data[l3[i]]=l3[i-1]\r\n data[l2[i]]=l2[i-1]\r\n ans=\"\"\r\n for i in que:\r\n ans+=data[i]\r\nelse:\r\n data={}\r\n for i in range(0,9):\r\n data[l1[i]]=l1[i+1]\r\n data[l3[i]]=l3[i+1]\r\n data[l2[i]]=l2[i+1]\r\n ans=\"\"\r\n for i in que:\r\n ans+=data[i]\r\nprint(ans)", "d = input()\r\ncode = list(input())\r\n\r\nl1 = ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p']\r\nl2 = ['a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', ';']\r\nl3 = ['z', 'x', 'c', 'v', 'b', 'n', 'm', ',', '.', '/']\r\n\r\nfor i in range(len(code)):\r\n if(d=='R'):\r\n if code[i] in l1:\r\n j = l1.index(code[i])\r\n code[i] = l1[j-1]\r\n continue\r\n if code[i] in l2:\r\n j = l2.index(code[i])\r\n code[i] = l2[j-1]\r\n continue\r\n if code[i] in l3:\r\n j = l3.index(code[i])\r\n code[i] = l3[j-1]\r\n continue\r\n elif(d=='L'):\r\n if code[i] in l1:\r\n j = l1.index(code[i])\r\n code[i] = l1[j+1]\r\n continue\r\n if code[i] in l2:\r\n j = l2.index(code[i])\r\n code[i] = l2[j+1]\r\n continue\r\n if code[i] in l3:\r\n j = l3.index(code[i])\r\n code[i] = l3[j+1]\r\n continue\r\n\r\nprint(''.join(code))", "c=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\na=input()\r\nb=input()\r\nreq=\"\"\r\nif a==\"R\":\r\n for i in range(len(b)):\r\n k=c.index(b[i])\r\n req+=c[k-1]\r\nelse:\r\n for i in range(len(b)):\r\n k=c.index(b[i])\r\n req+=c[k+1]\r\nprint(req)\r\n \r\n", "dire = input()\r\ns = input()\r\n\r\nu = ['','q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p','']\r\nm = ['','a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', ';','']\r\nd = ['','z', 'x', 'c', 'v', 'b', 'n', 'm', ',', '.', '/','']\r\n\r\ncorr = ''\r\n\r\nif dire=='R':\r\n for i in s:\r\n if i in u:\r\n corr+=u[u.index(i)-1]\r\n elif i in m:\r\n corr+=m[m.index(i)-1]\r\n else:\r\n corr+=d[d.index(i)-1]\r\n\r\nelse:\r\n for i in s:\r\n if i in u:\r\n corr+=u[u.index(i)+1]\r\n elif i in m:\r\n corr+=m[m.index(i)+1]\r\n else:\r\n corr+=d[d.index(i)+1]\r\n\r\nprint(corr)", "a = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\nb = input()\r\nc = input()\r\nif b == \"R\":\r\n s = \"\"\r\n for i in c:\r\n s+=a[a.index(i) - 1]\r\nelse:\r\n s = \"\"\r\n for i in c:\r\n s+=a[a.index(i) + 1]\r\nprint(s)", "# Define the keyboard layout\nkeyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\noriginal_keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\n\n# Read the direction and the sequence of characters\ndirection = input()\nsequence = input()\n\n# Create translation tables for left and right shifts\nif direction == 'L':\n trans = str.maketrans(keyboard, original_keyboard[1:] + original_keyboard[0])\nelse:\n trans = str.maketrans(keyboard, original_keyboard[-1] + original_keyboard[:-1])\n\n# Apply the translation to decode the message\ndecoded_message = sequence.translate(trans)\n\n# Print the decoded message\nprint(decoded_message)\n#####\n\t \t \t \t \t\t \t \t \t \t\t\t \t \t", "k='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nrl=input()\r\ns=input()\r\nfor i in s:\r\n\tif rl == 'R':\r\n\t\tx=k.index(i)\r\n\t\tprint(k[k.index(i)-1],end=\"\")\r\n\telse:\r\n\t\tprint(k[k.index(i)+1],end=\"\")\r\n", "key='qwertyuiopasdfghjkl;zxcvbnm,./'\r\np=input()\r\ns=input()\r\nif p=='L':\r\n c=1\r\nelse:\r\n c=-1\r\nr=''\r\nfor i in s:\r\n r+=key[key.index(i)+c]\r\nprint(r)", "characters = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\ndirection = input()\r\nword = input()\r\n\r\n#logic\r\noutput = \"\"\r\nif direction == \"R\" or direction==\"r\":\r\n for char in word:\r\n index = characters.find(char)\r\n output+=characters[index-1]\r\n\r\nelif direction == \"L\" or direction ==\"l\":\r\n for char in word:\r\n index = characters.find(char)\r\n output+=characters[index+1]\r\nprint(output)", "ch1 = input()\r\nstr1 = input()\r\nkeyboard = [\"qwertyuiop\", \"asdfghjkl;\", \"zxcvbnm,./\"]\r\nstr2 = \"\"\r\nfor ch in str1:\r\n for i in range(3):\r\n if ch in keyboard[i]:\r\n for j in range(len(keyboard[i])):\r\n if ch == keyboard[i][j]:\r\n if ch1 == \"R\":\r\n if j == 0:\r\n j += 1\r\n str2 += keyboard[i][j-1]\r\n else:\r\n if j == len(keyboard[i])-1:\r\n j -= 1\r\n str2 += keyboard[i][j+1]\r\n break\r\nprint(str2)", "keyboard = []\r\nfor i in (\"qwertyuiopasdfghjkl;zxcvbnm,./\"):\r\n keyboard.append(i)\r\nt = input()\r\nres = \"\"\r\nline = input()\r\nif(t == \"L\"):\r\n for i in line:\r\n res += keyboard[keyboard.index(i)+1]\r\nelse:\r\n for i in line:\r\n res += keyboard[keyboard.index(i)-1]\r\nprint(res)", "lr=input()\r\ns=input()\r\nk=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nrs=\"\"\r\nif lr==\"R\":\r\n c=-1\r\nelse:\r\n c=1\r\nfor j in s:\r\n i=k.index(j)\r\n rs=rs+k[i+c]\r\nprint(rs)", "a = input()\ns = input()\nn = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\nd = \"\"\nif a == \"R\":\n for i in range(len(s)):\n x = 0\n for j in range(len(n)):\n if s[i]==n[j]:\n x=j-1\n break\n d+=n[x]\n print(d)\nelif a == \"L\":\n for i in range(len(s)):\n x = 0\n for j in range(len(n)):\n if s[i]==n[j]:\n x=j+1\n break\n d+=n[x]\n print(d)\n \t\t\t \t \t\t\t \t \t\t \t\t", "\nshift = input()\nseq = input()\n\nrows = [list('qwertyuiop'), list('asdfghjkl;'), list('zxcvbnm,./')]\n\nch_row_index = {}\n\nfor i, row in enumerate(rows):\n for j, ch in enumerate(row):\n ch_row_index[ch] = i, j\n\nresult = \"\"\nfor ch in seq:\n row, idx = ch_row_index[ch]\n if (shift == 'R' and idx == 0):\n replacement = ch\n if (shift == 'L' and idx == 9):\n replacement = ch\n else:\n replacement = rows[row][idx + (- 1 if shift == 'R' else 1)]\n result += replacement\n\nprint(result)\n", "# t = int(input())\n# n, m = map(int, input().split())\ns1 = input()\ns = input()\nl = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\nfor i in range(len(s)):\n if s1 == \"R\":\n a = l.find(s[i])\n print(l[a - 1], end=\"\")\n else:\n a = l.find(s[i])\n print(l[a + 1], end=\"\")\n# while t != 0:\n# n = int(input())\n\n# t -= 1\n", "def find_original_message(shift, sequence):\r\n keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n mapping = {}\r\n\r\n if shift == 'R':\r\n for i in range(1, len(keyboard)):\r\n mapping[keyboard[i]] = keyboard[i - 1]\r\n else:\r\n for i in range(len(keyboard) - 1):\r\n mapping[keyboard[i]] = keyboard[i + 1]\r\n\r\n original_message = \"\"\r\n for char in sequence:\r\n original_message += mapping[char]\r\n\r\n return original_message\r\n\r\n# Input\r\nshift = input().strip()\r\nsequence = input().strip()\r\n\r\n# Output\r\nprint(find_original_message(shift, sequence))\r\n", "def main():\r\n\r\n n = str(input())\r\n s = str(input())\r\n ans = \"\"\r\n l = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n if n == \"R\":\r\n for i in range(len(s)):\r\n ans += l[l.index(s[i]) - 1]\r\n if n == \"L\":\r\n for i in range(len(s)):\r\n ans += l[l.index(s[i]) + 1]\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def main(s1, s2):\r\n arr = list(\"qwertyuiopasdfghjkl;zxcvbnm,./\")\r\n\r\n for i in range(len(s2)):\r\n for j in range(len(arr)):\r\n if s2[i] == arr[j]:\r\n if s1 == \"R\":\r\n s2[i] = arr[j - 1]\r\n else:\r\n s2[i] = arr[j + 1]\r\n break\r\n\r\n return \"\".join(s2)\r\n\r\nif __name__ == \"__main__\":\r\n s1, s2 = input(), list(input())\r\n\r\n print(main(s1, s2))", "arr = ['qwertyuiop','asdfghjkl;','zxcvbnm,./']\r\na = input()\r\nb = input()\r\nout = \"\"\r\nfor i in b:\r\n for x in range(3):\r\n for j in range(10):\r\n if i == arr[x][j]:\r\n if a == \"L\":\r\n out += arr[x][j+1]\r\n else:\r\n out += arr[x][j-1]\r\nprint(out)", "w = list(\"qwertyuiopasdfghjkl;zxcvbnm,./\")\r\nx = input()\r\ns = list(input())\r\nif x == \"R\":\r\n\tc = 0\r\n\tr = \"\"\r\n\twhile len(r) != len(s):\r\n\t\tif s[c] in w:\r\n\t\t\tr += w[w.index(s[c])-1]\r\n\t\t\tc += 1\r\n\telse:\r\n\t\tprint(r)\r\nelse:\r\n\tc = 0\r\n\tr = \"\"\r\n\twhile len(r) != len(s):\r\n\t\tif s[c] in w:\r\n\t\t\tr += w[w.index(s[c])+1]\r\n\t\t\tc += 1\r\n\telse:\r\n\t\tprint(r)", "t = list(\"qwertyuiopasdfghjkl;zxcvbnm,./\")\r\np = -1 if input() == \"R\" else 1\r\ns = input()\r\nd = \"\"\r\nfor c in s:\r\n i = t.index(c)\r\n d += t[i + p]\r\nprint(d)\r\n\r\n", "s=input()\r\nt=input()\r\ns1='qwertyuiop'\r\ns2='asdfghjkl;'\r\ns3='zxcvbnm,./'\r\nk=''\r\nif s=='R':\r\n for i in range(len(t)):\r\n for j in range(10):\r\n if t[i]==s1[j]:\r\n k=k+s1[j-1]\r\n elif t[i]==s2[j]:\r\n k=k+s2[j-1]\r\n elif t[i]==s3[j]:\r\n k=k+s3[j-1]\r\nelse:\r\n for i in range(len(t)):\r\n for j in range(10):\r\n if t[i]==s1[j]:\r\n k=k+s1[j+1]\r\n elif t[i]==s2[j]:\r\n k=k+s2[j+1]\r\n elif t[i]==s3[j]:\r\n k=k+s3[j+1]\r\nprint(k)", "a = input()\r\nb = input()\r\nq = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nw = \"\"\r\nfor i in b:\r\n if a == \"R\":\r\n w += q[q.index(i)-1]\r\n else:\r\n w += q[q.index(i) + 1]\r\nprint(w)\r\n", "s = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nshift = input()\r\nword = input()\r\nnew_s = ''\r\nfor letter in word:\r\n if shift == 'R':\r\n new_s += s[s.index(letter)-1]\r\n else:\r\n new_s += s[s.index(letter) + 1]\r\nprint(new_s)", "key = ['q', 'w', 'e', 'r' ,'t' , 'y', 'u', 'i', 'o', 'p',\n 'a' ,'s', 'd', 'f', 'g', 'h', 'j', 'k', 'l', ';',\n 'z', 'x', 'c', 'v', 'b', 'n', 'm', ',', '.', '/']\nd = input()\ns = input()\nnewmessage = \"\"\nfor l in s:\n if d == \"R\":\n newmessage += key[key.index(l) - 1]\n if d == \"L\":\n newmessage += key[key.index(l) + 1]\nprint(newmessage)\n \t \t\t \t \t \t \t \t\t\t \t\t", "key = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\nshift = input()\nstr = input()\n\nout = ''\nfor i in str:\n if shift == 'R':\n out = out + key[key.index(i) - 1]\n else:\n out = out + key[key.index(i) + 1]\n\nprint(out)\n\t\t\t \t\t \t \t\t \t\t \t\t \t\t \t\t\t", "movement=input()\r\ngiv_string=input()\r\nkey_string=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\ncorr_string=\"\"\r\nfor l in giv_string:\r\n if(movement=='R'):\r\n p=key_string.index(l)-1\r\n corr_string=corr_string+ key_string[p] \r\n else:\r\n q=key_string.index(l)+1\r\n corr_string=corr_string+ key_string[q]\r\n \r\nprint(corr_string)", "# x = int(input())\n# \n# for q in range(x):\n\n\ncode = input()\n\nword = input()\n\nup,mid,low = list('qwertyuiop'),list('asdfghjkl;'),list('zxcvbnm,./')\n\nres = ''\nif code=='R':\n a = -1\nelse:\n a = 1\n\nfor i in word:\n if i in up:\n res+=up[up.index(i)+a]\n elif i in mid:\n res+=mid[mid.index(i)+a]\n else:\n res+=low[low.index(i)+a]\n\nprint(res)\n\n", "Keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\ndirection_of_shifting = input()\r\nwritten_string = input()\r\nans = ''\r\nif direction_of_shifting == 'R':\r\n for i in written_string:\r\n if i == 'q' or i == 'a' or i == 'z':\r\n ans += i\r\n else:\r\n for j in range(len(Keyboard)):\r\n if Keyboard[j] == i:\r\n ans += Keyboard[j-1]\r\nelse:\r\n for i in written_string:\r\n if i == 'p' or i == ';' or i == '/':\r\n ans += i\r\n else:\r\n for j in range(len(Keyboard)):\r\n if Keyboard[j] == i:\r\n ans += Keyboard[j+1]\r\nprint(ans)", "def blindkeyboard(x,s):\r\n alist=[d for d in \"qwertyuiopasdfghjkl;zxcvbnm,./\"]\r\n dlist=[x for x in s]\r\n elist=[]\r\n for i in range(len(dlist)):\r\n if x==\"R\":\r\n elist.append(alist[alist.index(dlist[i])-1])\r\n elif x==\"L\":\r\n elist.append(alist[alist.index(dlist[i])+1])\r\n return elist\r\nx=input()\r\ns=input()\r\nresult=(blindkeyboard(x,s))\r\nfor res in result:\r\n print(res,end=\"\")\r\n", "keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\nshift= input()\r\ntyping = input()\r\nnew = \"\"\r\n\r\nfor i in range(len(typing)):\r\n if shift == \"R\":\r\n new+= keyboard[keyboard.index(typing[i]) - 1]\r\n else:\r\n new+= keyboard[keyboard.index(typing[i]) + 1]\r\n \r\nprint(new)", "a1 = 'qwertyuiop'\r\na2 = 'asdfghjkl;'\r\na3 = 'zxcvbnm,./'\r\nnum = input()\r\ns = input()\r\na = []\r\nif num=='R':\r\n for i in range(len(s)):\r\n if s[i] in a1:\r\n k = a1.index(s[i])\r\n a.append(a1[k-1])\r\n elif s[i] in a2:\r\n k = a2.index(s[i])\r\n a.append(a2[k-1])\r\n elif s[i] in a3:\r\n k = a3.index(s[i])\r\n a.append(a3[k-1])\r\nelse:\r\n for i in range(len(s)):\r\n if s[i] in a1:\r\n k = a1.index(s[i])\r\n a.append(a1[k+1])\r\n elif s[i] in a2:\r\n k = a2.index(s[i])\r\n a.append(a2[k+1])\r\n elif s[i] in a3:\r\n k = a3.index(s[i])\r\n a.append(a3[k+1])\r\n \r\nprint(''.join(a))", "n=input()\r\nq=input()\r\n\r\nx=\"qwertyuiop\\\r\nasdfghjkl;\\\r\nzxcvbnm,./\"\r\n\r\nc=\"\"\r\n\r\nif n==\"R\":\r\n \r\n for i in q:\r\n c+=x[x.find(i)-1]\r\nelse:\r\n for i in q:\r\n c+=x[x.find(i)+1]\r\nprint(c)\r\n ", "d1 = dict([(a, b) for b, a in enumerate(\"qwertyuiop\")])\r\nd2 = dict([(a, b) for b, a in enumerate(\"asdfghjkl;\")])\r\nd3 = dict([(a, b) for b, a in enumerate(\"zxcvbnm,./\")])\r\n\r\nr1 = \"qwertyuiop\"\r\nr2 = \"asdfghjkl;\"\r\nr3 = \"zxcvbnm,./\"\r\n\r\ndirection = input()\r\n\r\nkey = 1 if direction == \"L\" else -1 \r\n\r\nfor char in input().strip():\r\n if char in r1 : \r\n index = d1.get(char) \r\n index += key \r\n \r\n print(r1[index % 10], end=\"\")\r\n \r\n elif char in r2 : \r\n index = d2.get(char) \r\n index += key \r\n \r\n print(r2[index % 10], end=\"\")\r\n else : \r\n index = d3.get(char) \r\n index += key \r\n \r\n print(r3[index % 10], end=\"\")\r\n ", "row1 = \"qwertyuiop\"\r\nrow2 = \"asdfghjkl;\"\r\nrow3 = \"zxcvbnm,./\"\r\ndirection = input()\r\ndirection_val = -1 if direction == \"R\" else 1\r\nmessage = input()\r\noutput = \"\"\r\nfor word in message:\r\n if word in row1:\r\n output += row1[row1.index(word) + direction_val]\r\n elif word in row2:\r\n output += row2[row2.index(word) + direction_val]\r\n elif word in row3:\r\n output += row3[row3.index(word) + direction_val]\r\nprint(output)\r\n", "key=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\ns=input()\r\nmsg=input()\r\ntru=\"\"\r\nfor i in msg:\r\n if s==\"R\":\r\n tru+=key[key.index(i)-1]\r\n else:\r\n tru+=key[key.index(i)+1]\r\nprint(tru)", "dir=input()\r\nmystr=input()\r\nn = 0\r\nif dir == \"R\":\r\n n = -1\r\nelse:\r\n n = 1\r\n\r\ndef findInString(str3,ch):\r\n i = 0\r\n for x in str3:\r\n if ch == x:\r\n return i\r\n i+=1\r\n return -1\r\n\r\nstr1 = \"zxcvbnm,./\"\r\nstr2 = \"asdfghjkl;\"\r\nstr3 = \"qwertyuiop\"\r\nans = \"\"\r\nfor ch in mystr:\r\n \r\n #find in string 1 if found add to ans\r\n pos = findInString(str1,ch)\r\n if pos !=-1:\r\n ans=ans+str1[pos+n] \r\n #find in string 2 if found add to ans\r\n pos = findInString(str2,ch)\r\n if pos != -1:\r\n ans=ans+str2[pos+n] \r\n #find in string 3 if found add to ans\r\n pos = findInString(str3,ch)\r\n if pos != -1:\r\n ans=ans+str3[pos+n]\r\n\r\nprint(ans)\r\n\r\n", "d = input()\ns = input(\"\")\nl1 = \"qwertyuiop\"\nl2 = \"asdfghjkl;\"\nl3 = \"zxcvbnm,./\"\nans = \"\"\nif d == \"L\":\n for i in range(len(s)):\n if s[i] in l1:\n ans += l1[l1.find(s[i]) + 1]\n elif s[i] in l2:\n ans += l2[l2.find(s[i]) + 1]\n else:\n ans += l3[l3.find(s[i]) + 1]\nelse:\n for i in range(len(s)):\n if s[i] in l1:\n ans += l1[l1.find(s[i]) - 1]\n elif s[i] in l2:\n ans += l2[l2.find(s[i]) - 1]\n else:\n ans += l3[l3.find(s[i]) - 1]\nprint(ans)\n\n \t \t\t\t\t \t \t\t\t\t\t \t \t \t \t\t \t", "x = ['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\nr = input()\r\ns = input()\r\nif r =='R' : \r\n for i in s : \r\n print(x[x.index(i)-1], end = \"\")\r\nelse : \r\n for i in s : \r\n print(x[x.index(i)+1], end = \"\")\r\n\r\n'''\r\n /\\___/\\\r\n꒰ ˶• ༝ - ˶꒱\r\n./づᡕᠵ᠊ᡃ࡚ࠢ࠘ ⸝່ࠡࠣ᠊߯᠆ࠣ࠘ᡁࠣ࠘᠊᠊°.~♡︎ 3baky\r\n'''\r\n\r\n", "shift = input()\r\nx = input()\r\nkeyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\" \r\nresult = \"\"\r\nfor i in range(len(x)) :\r\n y = keyboard.find(x[i])\r\n if shift == \"R\" :\r\n result=result + (keyboard[y-1])\r\n else :\r\n result=result+(keyboard[y+1])\r\n \r\nprint(result)\r\n\r\n", "d = input()\r\ns = input()\r\nkeyboard=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nfor var in s:\r\n if d == \"L\":\r\n print(keyboard[keyboard.index(var)+1], end=\"\")\r\n else:\r\n print(keyboard[keyboard.index(var)-1], end=\"\")", "def solve():\r\n keyboard = ['qwertyuiop', 'asdfghjkl;', 'zxcvbnm,./']\r\n s = input()\r\n txt = input()\r\n for i in txt:\r\n for j in keyboard:\r\n if i in j:\r\n print(j[j.index(i)-1] if s == 'R' else j[j.index(i)+1], end='')\r\n print()\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "def main():\r\n keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n shift = -1 if input() == \"R\" else 1\r\n message = input()\r\n answer = \"\"\r\n for letter in message:\r\n index = keyboard.find(letter)\r\n answer += keyboard[index + shift]\r\n print(answer)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def keyboard():\r\n letters = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n shift = input()\r\n wrong = input()\r\n \r\n right = \"\"\r\n\r\n for letter in wrong:\r\n if shift == \"R\":\r\n right += letters[letters.index(letter)-1]\r\n elif shift == \"L\":\r\n right += letters[letters.index(letter)+1]\r\n \r\n return right\r\nprint(keyboard())", "#it's my code my name is Abduaziz\r\nstring = input()\r\nkeyboard = input()\r\narray = ['qwertyuiop', 'asdfghjkl;', 'zxcvbnm,./']\r\nanswer = ''\r\nfor key in keyboard:\r\n if key in array[0]:\r\n if string == \"R\":\r\n if array[0].index(key) == 0:\r\n answer += 'q'\r\n else:\r\n answer += array[0][array[0].index(key) - 1]\r\n else:\r\n if array[0].index(key) == 9:\r\n answer += 'p'\r\n else:\r\n answer += array[0][array[0].index(key) + 1]\r\n elif key in array[1]:\r\n if string == \"R\":\r\n if array[1].index(key) == 0:\r\n answer += ';'\r\n else:\r\n answer += array[1][array[1].index(key) - 1]\r\n else:\r\n if array[1].index(key) == 9:\r\n answer += 'a'\r\n else:\r\n answer += array[1][array[1].index(key) + 1]\r\n else:\r\n if string == \"R\":\r\n if array[2].index(key) == 0:\r\n answer += '/'\r\n else:\r\n answer += array[2][array[2].index(key) - 1]\r\n else:\r\n if array[2].index(key) == 9:\r\n answer += 'z'\r\n else:\r\n answer += array[2][array[2].index(key) + 1]\r\nprint(answer)\r\n", "keyboard_top = 'qwertyuiop' \r\nkeyboard_mid = 'asdfghjkl;' \r\nkeyboard_low = 'zxcvbnm,./'\r\nshift = input()\r\nshift_string = input()\r\nedit_string = ''\r\nif shift == \"L\":\r\n for char in shift_string:\r\n if char in keyboard_top:\r\n index = keyboard_top.find(char)\r\n edit_string += keyboard_top[index+1]\r\n elif char in keyboard_mid:\r\n index = keyboard_mid.find(char)\r\n edit_string += keyboard_mid[index+1]\r\n else:\r\n index = keyboard_low.find(char)\r\n edit_string += keyboard_low[index+1]\r\nelse:\r\n for char in shift_string:\r\n if char in keyboard_top:\r\n index = keyboard_top.find(char)\r\n edit_string += keyboard_top[index-1]\r\n elif char in keyboard_mid:\r\n index = keyboard_mid.find(char)\r\n edit_string += keyboard_mid[index-1]\r\n else:\r\n index = keyboard_low.find(char)\r\n edit_string += keyboard_low[index-1]\r\nprint(edit_string)\r\n", "lst = [\n'qwertyuiop',\n'asdfghjkl;',\n'zxcvbnm,./'\n]\n\nch = input()\ns = input()\nans = ''\nfor el in s:\n for i in range(3):\n if el in lst[i]:\n idx = lst[i].index(el)\n if ch == 'R':\n ans+=lst[i][idx-1]\n else:\n ans += lst[i][idx + 1]\nprint(ans)\n \t \t\t \t \t\t \t\t\t\t \t\t \t \t\t", "\nkeyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\ncondition = input()\n\ns = input()\nmy_map = {}\n\nif condition == \"R\":\n\n for i in range(len(s)):\n for j in range(len(keyboard)):\n if s[i] == keyboard[j]:\n my_map[s[i]] = keyboard[j - 1]\n\n\nelif condition == \"L\":\n for i in range(len(s)):\n for j in range(len(keyboard)):\n if s[i] == keyboard[j]:\n my_map[s[i]] = keyboard[j + 1]\n\nfor i in s:\n print(my_map.get(i) , end=\"\")\n\n# Time Complexity : O(n^2)\n\t\t\t\t \t \t\t \t\t\t \t \t\t \t\t \t \t", "d = input()\r\ns = input()\r\nres = []\r\n\r\nmp = [['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p'],\r\n ['a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', ';'],\r\n ['z', 'x', 'c', 'v', 'b', 'n', 'm', ',', '.', '/']]\r\n\r\nif d == 'R':\r\n d = -1\r\nelse:\r\n d = 1\r\n\r\nfor i in s:\r\n for j in range(len(mp)):\r\n for k in range(len(mp[j])):\r\n if i == mp[j][k]:\r\n res.append(mp[j][k + d])\r\n\r\nprint(''.join(res))\r\n", "r_or_l = input()\r\nstring = input()\r\nstring_2 = ''\r\nkeyboard_3_level = \"qwertyuiop\"\r\nkeyboard_2_level = \"asdfghjkl;\"\r\nkeyboard_1_level = \"zxcvbnm,./\"\r\nfor i in range(len(string)):\r\n if r_or_l == \"R\":\r\n if string[i] in keyboard_3_level:\r\n index = keyboard_3_level.find(string[i])\r\n string_2 += keyboard_3_level[index-1]\r\n elif string[i] in keyboard_2_level:\r\n index = keyboard_2_level.find(string[i])\r\n string_2 += keyboard_2_level[index-1]\r\n else:\r\n index = keyboard_1_level.find(string[i])\r\n string_2 += keyboard_1_level[index-1]\r\n else:\r\n if string[i] in keyboard_3_level:\r\n index = keyboard_3_level.find(string[i])\r\n string_2 += keyboard_3_level[index+1]\r\n elif string[i] in keyboard_2_level:\r\n index = keyboard_2_level.find(string[i])\r\n string_2 += keyboard_2_level[index+1]\r\n else:\r\n index = keyboard_1_level.find(string[i])\r\n string_2 += keyboard_1_level[index+1]\r\nprint(string_2)\r\n \r\n \r\n \r\n", "s = input()\r\nk = input()\r\notv = ''\r\na = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nif s == 'R':\r\n for i in k:\r\n otv = otv + a[a.find(i) - 1]\r\nelse:\r\n for i in k:\r\n otv = otv + a[a.find(i) + 1]\r\nprint(otv)", "normal=[\"qwertyuiop\",\"asdfghjkl;\",\"zxcvbnm,./\"]\r\nlst = [0] * 3\r\nside = input()\r\n \r\nif side == \"R\":\r\n for i in range(len(normal)):\r\n lst[i]=(normal[i])[1:]+(normal[i])[:1]\r\n \r\nelif side == \"L\":\r\n for i in range(len(normal)):\r\n lst[i]=(normal[i])[-1:]+(normal[i])[:-1]\r\n\r\ndec = input()\r\nstring = \"\"\r\nfor d in dec:\r\n for k in range(len(lst)):\r\n if d in lst[k]:\r\n for l in range(len(lst[k])):\r\n if lst[k][l] == d:\r\n string+=normal[k][l]\r\nprint(string)", "dictR = {\r\n \"p\" : \"o\" , \"h\" : \"g\" , \"/\" : \".\" ,\r\n \"w\" : \"q\" , \"s\" : \"a\" , \"x\" : \"z\" ,\r\n \"e\" : \"w\" , \"d\" : \"s\" , \"c\" : \"x\" ,\r\n \"r\" : \"e\" , \"f\" : \"d\" , \"v\" : \"c\" ,\r\n \"t\" : \"r\" , \"g\" : \"f\" , \"b\" : \"v\" ,\r\n \"y\" : \"t\" , \"j\" : \"h\" , \"n\" : \"b\" ,\r\n \"u\" : \"y\" , \"k\" : \"j\" , \"m\" : \"n\" ,\r\n \"i\" : \"u\" , \"l\" : \"k\" , \",\" : \"m\" ,\r\n \"o\" : \"i\" , \";\" : \"l\" , \".\" : \",\" ,\r\n}\r\ndictL = {\r\n \"q\" : \"w\" , \"h\" : \"j\" , \"z\" : \"x\" ,\r\n \"w\" : \"e\" , \"s\" : \"d\" , \"x\" : \"c\" ,\r\n \"e\" : \"r\" , \"d\" : \"f\" , \"c\" : \"v\" ,\r\n \"r\" : \"t\" , \"f\" : \"g\" , \"v\" : \"b\" ,\r\n \"t\" : \"y\" , \"g\" : \"h\" , \"b\" : \"n\" ,\r\n \"y\" : \"u\" , \"j\" : \"k\" , \"n\" : \"m\" ,\r\n \"u\" : \"i\" , \"k\" : \"l\" , \"m\" : \",\" ,\r\n \"i\" : \"o\" , \"l\" : \";\" , \",\" : \".\" ,\r\n \"o\" : \"p\" , \"a\" : \"s\" , \".\" : \"/\" ,\r\n}\r\nshift = input()\r\nif shift == \"L\" :\r\n for letter in list(input()) :\r\n print(dictL[letter],end=\"\") \r\nelse :\r\n for letter in list(input()) :\r\n print(dictR[letter],end=\"\")", "s1 = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n \r\n\r\nrl = input()\r\nlola = input()\r\n\r\nsize = len(lola)\r\n# print(size)\r\nif rl==\"R\":\r\n for i in range(0,size):\r\n print(s1[s1.index(lola[i])-1], end=\"\")\r\nif rl==\"L\":\r\n for i in range(0,size):\r\n print(s1[s1.index(lola[i])+1], end=\"\")\r\n ", "temp=-1 if input()==\"R\" else 1\r\ns=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nfor i in input():\r\n print(s[s.index(i)+temp],end=\"\")", "keyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nshift_direction = input()\r\ntyped_sequence = input()\r\noriginal_message = \"\"\r\nfor char in typed_sequence:\r\n char_index = keyboard.index(char)\r\n if shift_direction == \"L\":\r\n shifted_index = char_index + 1\r\n elif shift_direction == \"R\":\r\n shifted_index = char_index - 1\r\n original_message += keyboard[shifted_index]\r\nprint(original_message)", "x = input()\r\ns = input()\r\np = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\n\r\nfor i in s:\r\n if x == 'R':\r\n print(p[p.index(i) - 1],end= '')\r\n else:\r\n print(p[p.index(i) + 1],end= '')", "a=input();a1=input();a2=\"qwertyuiopasdfghjkl;zxcvbnm,./\";c=\"\"\r\nif a==\"R\":\r\n for i in a1:\r\n c+=a2[a2.index(i)-1]\r\nelse:\r\n for i in a1:\r\n c+=a2[a2.index(i)+1]\r\nprint(c)\r\n", "ch = input() #qweqweqw\ns = input() #qwerty\nlst = ['qwertyuiop','asdfghjkl;','zxcvbnm,./']\nans = ''\nfor el in s:\n for i in range(3):\n a = lst[i]\n if el in a:\n idx = a.index(el)\n if ch =='R':\n ans+= a[idx - 1]\n else:\n ans += a[idx + 1]\nprint(ans)\n\n \t \t \t\t\t\t\t\t \t \t \t\t\t \t \t", "dir=input()\r\nkeyboard,orimsg=\"qwertyuiopasdfghjkl;zxcvbnm,./\",\"\"\r\nfor i in input():\r\n if dir == \"R\":orimsg+=keyboard[keyboard.find(i)-1]\r\n else:orimsg+=keyboard[keyboard.find(i)+1]\r\nprint(orimsg)", "a = 'qwertyuiop'\r\nb = 'asdfghjkl;'\r\nc = 'zxcvbnm,./'\r\n\r\nstt = input()\r\ns = input()\r\nop = ''\r\nif stt == 'R':\r\n for i in s:\r\n if i in a:\r\n ind = a.index(i)\r\n # print(ind)\r\n op += a[ind-1]\r\n elif i in b:\r\n ind = b.index(i)\r\n # print(ind)\r\n op += b[ind-1]\r\n elif i in c:\r\n ind = c.index(i)\r\n # print(ind)\r\n op += c[ind-1]\r\n print(op)\r\n\r\nelse:\r\n for i in s:\r\n if i in a:\r\n ind = a.index(i)\r\n # print(ind)\r\n op += a[ind+1]\r\n elif i in b:\r\n ind = b.index(i)\r\n # print(ind)\r\n op += b[ind+1]\r\n elif i in c:\r\n ind = c.index(i)\r\n # print(ind)\r\n op += c[ind+1]\r\n print(op)\r\n\r\n", "f=input()\r\ns=input()\r\ns1=''\r\nl='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nfor i in s:\r\n ind=l.index(i)\r\n if f=='R':\r\n s1+=l[ind-1]\r\n else:\r\n s1+=l[ind+1]\r\nprint(s1)", "l1=\"qwertyuiop\"\r\nl2=\"asdfghjkl;\"\r\nl3=\"zxcvbnm,./\"\r\ns=input()\r\nm=input()\r\nf=\"\"\r\nif s=='R':\r\n for i in m:\r\n if i in l1:\r\n f+=l1[l1.index(i)-1]\r\n elif i in l2:\r\n f+=l2[l2.index(i)-1]\r\n elif i in l3:\r\n f+=l3[l3.index(i)-1]\r\nelif s=='L':\r\n for i in m:\r\n if i in l1:\r\n f+=l1[l1.index(i)+1]\r\n elif i in l2:\r\n f+=l2[l2.index(i)+1]\r\n elif i in l3:\r\n f+=l3[l3.index(i)+1]\r\nprint(f)\r\n\r\n", "a=input()\r\nb=input()\r\ns='qwertyuiopasdfghjkl;zxcvbnm,./'\r\nl=[]\r\nf=[]\r\nc=[]\r\nfor i in s:\r\n l.append(i)\r\nfor j in b:\r\n c.append(j)\r\nfor n in c:\r\n d=s.index(n)\r\n if a=='R':\r\n f.append(s[d-1])\r\n else:\r\n f.append(s[d+1])\r\no=''\r\nfor k in f:\r\n o+=k\r\nprint(o)", "a = 'qwertyuiop'\r\nb = 'asdfghjkl;'\r\nc = 'zxcvbnm,./'\r\nd = input()\r\ns = list(input())\r\n\r\nif d == 'R':\r\n d = -1\r\nelse:\r\n d = 1\r\n\r\nfor i in range(len(s)):\r\n if s[i] in a:\r\n s[i] = a[(int(a.find(s[i])) + d) % 10]\r\n elif s[i] in b:\r\n s[i] = b[(int(b.find(s[i])) + d) % 10]\r\n elif s[i] in c:\r\n s[i] = c[(int(c.find(s[i])) + d) % 10]\r\nfor i in s:\r\n print(i, end = '')\r\n", "s = 'qwertyuiopasdfghjkl;zxcvbnm,./'\nm = input()\nn = input()\na = ''\n\nif m == 'R':\n step = -1 \nelse :\n step = 1\n \nfor i in n:\n a += s[s.index(i)+step]\nprint(a)\n\t\t\t\t\t \t \t\t \t\t\t\t\t\t\t\t\t\t \t \t \t\t", "direction = input()\r\nmessage = input()\r\ntop_row = \"qwertyuiop\"\r\nmid_row = \"asdfghjkl;\"\r\nbot_row = \"zxcvbnm,./\"\r\n\r\nshift = 0\r\nif direction == 'L':\r\n shift += 1\r\nelse:\r\n shift -= 1\r\noutput = \"\"\r\nfor i in range(len(message)):\r\n new_char_index = -1\r\n if message[i] in top_row:\r\n new_char_index = top_row.index(message[i]) + shift\r\n if new_char_index < 0 or new_char_index >= 10:\r\n output += \"\"\r\n else:\r\n output += top_row[new_char_index]\r\n elif message[i] in mid_row:\r\n new_char_index = mid_row.index(message[i])+ shift\r\n if new_char_index < 0 or new_char_index >= 10:\r\n output += \"\"\r\n else:\r\n output += mid_row[new_char_index]\r\n elif message[i] in bot_row:\r\n new_char_index = bot_row.index(message[i])+ shift \r\n if new_char_index < 0 or new_char_index >= 10:\r\n output += \"\"\r\n else:\r\n output += bot_row[new_char_index]\r\n \r\nprint(output)", "q = str(input())\r\no = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\ns = str(input())\r\n\r\n\r\n\r\n\r\n\r\n'''\r\nR\r\ns;;upimrrfod;pbr\r\n\r\n'''\r\n'''\r\nallyouneedislove\r\n\r\n'''\r\nz = \"\"\r\nif q == \"R\":\r\n \r\n for i in s:\r\n t = o.index(i)\r\n e = t - 1\r\n p = o[e]\r\n z+=p\r\n print(z)\r\nelse:\r\n for i in s:\r\n t = o.index(i)\r\n e = t + 1\r\n p = o[e]\r\n z+=p\r\n print(z)\r\n \r\n \r\n ", "c = [ \"qwertyuiop\", \"asdfghjkl;\", \"zxcvbnm,./\"]\r\n\r\np = input()\r\ns = input()\r\nresult = \"\"\r\nr = -1\r\nl = 1\r\npos=0\r\n\r\nif p == \"R\":\r\n pos = r\r\nelse:\r\n pos = l\r\n\r\nfor i in range (len(s)):\r\n for j in range(3):\r\n if s[i] in c[j]:\r\n result += c[j][c[j].index(s[i])+pos]\r\n break\r\n \r\nprint(result)", "n = input()\r\nlst = input()\r\nklav = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nans=''\r\nif n == \"R\" :\r\n n = -1\r\nelse:\r\n n = 1\r\nfor i in lst :\r\n k = klav.find(i)\r\n ans += klav[k+n]\r\n\r\nprint(ans)", "s1=input()\r\nk=\"qwertyuiop[]asdfghjkl;'zxcvbnm,./\"\r\nif s1==\"R\":\r\n s=\"\"\r\n s2=input()\r\n k=\" \"+k\r\n for i in s2:\r\n index = k.index(i)\r\n index-=1\r\n s+=k[index]\r\n\r\n print(s)\r\nelse:\r\n s=\"\"\r\n s2=input()\r\n k=\" \"+k\r\n for i in s2:\r\n index = k.index(i)\r\n index+=1\r\n s+=k[index]\r\n\r\n print(s)", "l=input()\nx=input()\nA=[]\nlist1=[i for i in x]\nU=\"qwertyuiop\"\nM=\"asdfghjkl;\"\nB=\"zxcvbnm,./\"\n\nfor i in x:\n if l=='R':\n if i in U:\n A.append(U[U.index(i)-1])\n elif i in M:\n A.append(M[M.index(i)-1])\n else:\n A.append(B[B.index(i)-1])\n else:\n if i in U:\n A.append(U[U.index(i)+1])\n elif i in M:\n A.append(M[M.index(i)+1])\n else:\n A.append(B[B.index(i)+1])\n \nfor i in A:\n print(i,end='')\n \t\t \t\t \t \t \t \t \t \t\t\t", "from sys import stdin \r\nfrom math import 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\n\r\ndef solve():\r\n s = rs()\r\n ss = rs()\r\n string = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n a = -1 if s == \"L\" else 1\r\n for i in range(len(ss)):\r\n print(string[string.index(ss[i]) - a], end=\"\")\r\n return None \r\n\r\ndef main():\r\n# for _ in range(ri()):\r\n solve()\r\n\r\nmain()\r\n", "keyboard_letters = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n \r\ndirection = input()\r\nsequence = input()\r\n \r\nnew_sequence = \"\"\r\n \r\nfor letter_index, letter in enumerate(sequence):\r\n if direction == \"R\":\r\n new_sequence += keyboard_letters[keyboard_letters.index(letter) - 1]\r\n else:\r\n new_sequence += keyboard_letters[keyboard_letters.index(letter) + 1]\r\n \r\nprint(new_sequence)\r\n", "s = input()\na = input()\n\nN = list(\"qwertyuiopasdfghjkl;zxcvbnm,./\")\nnew = \"\"\nif s == 'L':\n for i in a:\n new += N[N.index(i) + 1]\nelse:\n for i in a:\n new += N[N.index(i) - 1]\nprint(new)", "n=input()\r\na=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nb=''\r\nfor i in input():\r\n if n=='R':\r\n b=b+a[a.index(i)-1]\r\n else:\r\n b=b+a[a.index(i)+1]\r\nprint(b)", "#from collections import Counter\r\n#import math\r\ncount_time=0\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#------------------------------------------\r\nA={0:'q',1:'w',2:'e',3:'r',4:'t',5:'y',6:'u',7:'i',8:'o',9:'p',10:'[',\r\n11:']',12:'\\\\',13:'a',14:'s',15:'d',16:'f',17:'g',18:'h',19:'j',20:'k',\r\n21:'l',22:';',23:\"'\",24:'z',25:'x',26:'c',27:'v',28:'b',29:'n',30:'m',\r\n31:',',32:'.',33:\"/\"}\r\nB={'q':0,'w':1,'e':2,'r':3,'t':4,'y':5,'u':6,\r\n'i':7,'o':8,'p':9,'[':10,']':11,\"\\\\\":12,'a':13,'s':14,'d':15,'f':16,\r\n'g':17,'h':18,'j':19,'k':20,'l':21,';':22,\"'\":23,'z':24,'x':25,'c':26,\r\n'v':27,'b':28,'n':29,'m':30,',':31,'.':32,'/':33}\r\ns=1 if input()=='L' else -1\r\na=input()\r\nb=''\r\nfor i in a:\r\n b+=A[B[i]+s]\r\nprint(b)\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", "dim=input()\r\ngboard=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nworld=input()\r\nind=0\r\nnprint=\"\"\r\nfor c in world:\r\n ind=gboard.index(c)\r\n if dim==\"R\":\r\n nprint+=gboard[ind-1]\r\n else:\r\n nprint+=gboard[ind+1]\r\n\r\nprint(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\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "hand=input()\r\nk=input()\r\nstring=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nif hand==\"R\":\r\n for i in k:\r\n a=string.index(i)\r\n print(string[a-1],end=\"\")\r\nelse:\r\n for i in k:\r\n a=string.index(i)\r\n print(string[a+1],end=\"\")\r\n\r\n", "ch = input ()\ns = input()\nlst = [\"qwertyuiop\",\"asdfghjkl;\",\"zxcvbnm,./\"]\nans = \"\"\nfor l in s:\n for i in range(3):\n a =lst[i]\n if l in a:\n idx = a.index(l)\n if ch == \"R\":\n ans+= a[idx-1]\n else:\n ans += a[idx + 1]\nprint(ans)\n\n\t \t \t\t \t\t \t\t\t\t \t\t\t \t\t \t \t\t", "letters = ['q','w','e','r','t','y','u','i','o','p','[',']',\r\n 'a','s','d','f','g','h','j','k','l',';','',\r\n 'z','x','c','v','b','n','m',',','.','/']\r\n\r\ndirection = input()\r\nword = input()\r\nif direction=='R':\r\n word = list(map(lambda x: letters[letters.index(x)-1],word))\r\n print(''.join(word))\r\nelse:\r\n word = list(map(lambda x: letters[letters.index(x) + 1], word))\r\n print(''.join(word))", "ref = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nleft_dict = {ref[i-1]:ref[i] for i in range(len(ref))}\r\nright_dict = {ref[i]:ref[i-1] for i in range(len(ref))}\r\ndirection = input()\r\ns = input()\r\nans = []\r\nfor i in s:\r\n if direction=='R':\r\n ans.append(right_dict[i])\r\n else:\r\n ans.append(left_dict[i])\r\nprint(\"\".join(ans))\r\n", "keyboard_one = \"qwertyuiop\"\r\nkeyboard_two = \"asdfghjkl;\"\r\nkeyboard_three = \"zxcvbnm,./\"\r\n\r\ndirection = str(input())\r\ninput_keyboard = str(input())\r\nans_string = \"\"\r\n\r\nfor i in range(0,len(input_keyboard)):\r\n for j in range(0,len(keyboard_one)):\r\n\r\n if input_keyboard[i] == keyboard_one[j]:\r\n if direction == \"L\" and j+1 < 10:\r\n ans_string += keyboard_one[j+1]\r\n elif direction == \"R\" and j-1 >= 0:\r\n ans_string += keyboard_one[j-1]\r\n\r\n elif input_keyboard[i] == keyboard_two[j]:\r\n if direction == \"L\" and j+1 < 10:\r\n ans_string += keyboard_two[j+1]\r\n elif direction == \"R\" and j-1 >= 0:\r\n ans_string += keyboard_two[j-1]\r\n\r\n elif input_keyboard[i] == keyboard_three[j]:\r\n if direction == \"L\" and j+1 < 10:\r\n ans_string += keyboard_three[j+1]\r\n elif direction == \"R\" and j-1 >= 0:\r\n ans_string += keyboard_three[j-1]\r\nprint(ans_string)", "#****************************************************\r\n#***************Shariar Hasan************************\r\n#**************CSE CU Batch 18***********************\r\n#****************************************************\r\n\r\n#import os\r\n#import sys\r\nfrom math import *\r\n#import re\r\n#import random\r\n#sys.set_int_max_str_digits(int(1e9))\r\n\r\n\r\n\r\ndef solve():\r\n #for _ in range(int(input())):\r\n for _ in range(1):\r\n dataset =\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n choice = 1 if(input() == \"L\") else -1\r\n s = input()\r\n ans = \"\"\r\n for x in s:\r\n ans += dataset[(dataset.find(x) + choice)%30]\r\n print(ans)\r\n\r\n\r\n\r\n\r\nsolve()\r\n\r\n", "##nums = map(int, input().split())\r\n##s1 = list(map(int, input().split()))\r\n##s1 = list(map(int, ' '.join(input()).split()))\r\n\r\nsd = input()\r\ns = input()\r\nt = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nrez = ''\r\nif sd == 'R':\r\n sd = -1\r\nelse:\r\n sd = 1\r\nfor i in range(len(s)):\r\n ind = t.index(s[i])\r\n rez += t[ind+sd]\r\nprint(rez)\r\n\r\n", "r1 = \"qwertyuiop\"\nr2 = \"asdfghjkl;\"\nr3 = \"zxcvbnm,./\"\nstep = -1 if input() == \"R\" else 1\nreal = \"\"\n\nfor c in input():\n if c in r1:\n ind = r1.index(c)\n real += r1[ind + step]\n elif c in r2:\n ind = r2.index(c)\n real += r2[ind + step]\n elif c in r3:\n ind = r3.index(c)\n real += r3[ind + step]\n\nprint(real)", "line1 = \"qwertyuiop\"\r\nline2 = \"asdfghjkl;\"\r\nline3 = \"zxcvbnm,./\"\r\na = input()\r\nif a == \"R\": a = -1\r\nelse: a = 1\r\nword = input()\r\nans = []\r\nfor i in range(len(word)):\r\n if word[i] in line1:\r\n ans.append(line1[line1.index(word[i]) + a])\r\n elif word[i] in line2:\r\n ans.append(line2[line2.index(word[i]) + a])\r\n else:\r\n ans.append(line3[line3.index(word[i]) + a])\r\nprint(\"\".join(ans))", "letters = [\r\n ['q', 'w', 'e', 'r', 't', 'y', 'u', 'i', 'o', 'p'],\r\n ['a', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', ';'],\r\n ['z', 'x', 'c', 'v', 'b', 'n', 'm', ',', '.', '/']\r\n]\r\nd = input()\r\ns = input()\r\nnew_s = []\r\nfor l in s:\r\n if l in letters[0]:\r\n i = [0, letters[0].index(l)]\r\n elif l in letters[1]:\r\n i = [1, letters[1].index(l)]\r\n else:\r\n i = [2, letters[2].index(l)]\r\n if d == 'L':\r\n i[1] += 1\r\n else:\r\n i[1] -= 1\r\n new_s.append(letters[i[0]][i[1]])\r\nprint(''.join(new_s))", "def org_msg(msg, add=1):\r\n for char in msg:\r\n print(keys[keys.index(char) - add], end='')\r\n\r\n\r\nkeys = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\npos = input()\r\nmsg = input()\r\nif pos == 'R':\r\n org_msg(msg)\r\nelse:\r\n org_msg(msg, -1)", "string = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nchar = input()\r\ninputstring = input()\r\nanswerstring = \"\"\r\naddition = 1 if char == 'L' else -1\r\nfor x in inputstring :\r\n num = string.index(x)+addition\r\n answerstring += string[num]\r\nprint(answerstring)", "str1 = input().strip()\r\nstr2 = input().strip()\r\n\r\ns = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\nmsg = \"\"\r\nidx = 1 if str1 == 'L' else -1\r\nfor ch in str2:\r\n \r\n current = s.index(ch)\r\n new = s[idx + current]\r\n msg += new\r\n\r\nprint(msg)\r\n\r\n", "if input() == 'R': step = -1\nelse: step = 1\nstring = input()\nkeyboard = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\n\noutput = \"\"\nfor x in string:\n output += keyboard[keyboard.index(x) + step]\n \nprint(output)\n\n\n", "shifting_direction = input()\r\ns = input()\r\n\r\nline1 = 'qwertyuiop'\r\nline2 = 'asdfghjkl;'\r\nline3 = 'zxcvbnm,./'\r\n\r\noriginal_message = \"\"\r\n\r\nfor char in s:\r\n if char in line1:\r\n idx = line1.index(char)\r\n if shifting_direction == 'R':\r\n original_message += line1[idx - 1]\r\n elif shifting_direction == 'L':\r\n original_message += line1[(idx + 1) % len(line1)]\r\n elif char in line2:\r\n idx = line2.index(char)\r\n if shifting_direction == 'R':\r\n original_message += line2[idx - 1]\r\n elif shifting_direction == 'L':\r\n original_message += line2[(idx + 1) % len(line2)]\r\n elif char in line3:\r\n idx = line3.index(char)\r\n if shifting_direction == 'R':\r\n original_message += line3[idx - 1]\r\n elif shifting_direction == 'L':\r\n original_message += line3[(idx + 1) % len(line3)]\r\n\r\nprint(original_message)\r\n", "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\nn=input()\r\ns=input()\r\nk=''\r\nif n=='R':\r\n for i in range(len(s)):\r\n x=a.index(s[i])\r\n k+=a[x-1]\r\nif n=='L':\r\n for i in range(len(s)):\r\n x=a.index(s[i])\r\n k+=a[x+1]\r\nprint(k)\r\n", "n = input()\r\na = input()\r\nnn = str()\r\nb1 = 0\r\nb = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nfor i in range(len(a)):\r\n if n == 'R':\r\n b1 = b.find(a[i])\r\n nn += b[b1-1]\r\n else:\r\n b1 = b.find(a[i])\r\n nn += b[b1+1]\r\nprint(nn)\r\n", "s = input()\r\nl = input()\r\nkeys = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nindex = 0\r\nn = 0\r\nif s == \"R\":\r\n n = n - 1\r\nelif s == \"L\":\r\n n = n + 1\r\nwhile index < len(l):\r\n i = 0\r\n while i < len(keys):\r\n if keys[i] == l[index]:\r\n print(keys[i + n], end=\"\")\r\n break\r\n i = i + 1\r\n index = index + 1", "direction = str(input())\r\ns = str(input())\r\n\r\nline1 = \"qwertyuiop[]asdfghjkl;'\\zxcvbnm,./\"\r\nlst = []\r\n\r\nfor i in s:\r\n index = line1.index(i)\r\n if direction == \"L\":\r\n index += 1\r\n else:\r\n index -= 1\r\n \r\n lst.append(line1[index])\r\n\r\nprint(\"\".join(lst))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n KEYBOARD_CHARS:str = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\n\r\n WRONG_DIRECTION:str = input().rstrip()\r\n WRITTEN_STRING:str = input().rstrip()\r\n\r\n correctChars:list[str] = []\r\n for writtenChar in WRITTEN_STRING :\r\n correctChar:str = \"\"\r\n if WRONG_DIRECTION == \"R\" : correctChar = KEYBOARD_CHARS[KEYBOARD_CHARS.index(writtenChar)-1]\r\n else : correctChar = KEYBOARD_CHARS[KEYBOARD_CHARS.index(writtenChar)+1]\r\n correctChars.append(correctChar)\r\n\r\n print(\"\".join(correctChars))\r\n\r\nmain()", "direction = input()\r\nsentence = input()\r\n\r\nline1 = \"qwertyuiop\"\r\nline2 = \"asdfghjkl;\"\r\nline3 = \"zxcvbnm,./\"\r\n\r\nif direction == \"L\":\r\n for i in sentence:\r\n if i in line1:\r\n print(line1[line1.index(i)+1],end=\"\")\r\n elif i in line2:\r\n print(line2[(line2.index(i))+1],end=\"\")\r\n else:\r\n print(line3[line3.index(i)+1],end=\"\")\r\n\r\nelse:\r\n for i in sentence:\r\n if i in line1:\r\n print(line1[line1.index(i)-1],end = \"\")\r\n elif i in line2:\r\n print(line2[line2.index(i)-1], end=\"\")\r\n else:\r\n print(line3[line3.index(i)-1],end=\"\")", "def ans(str1, c):\n str_ = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\n solu = \"\"\n for char in str1:\n index = str_.find(char)\n if c == 'R':\n solu += str_[index - 1]\n else:\n solu += str_[index + 1]\n return solu\n\ndef main():\n C = input()\n str2 = input()\n print(ans(str2, C))\n\nmain()\n\n \t \t\t\t \t \t\t\t \t\t \t \t\t", "state = input()\r\nword = input()\r\nnewstr = \"\"\r\nstrlists = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nif state == \"R\":\r\n for letter in word:\r\n newstr += strlists[strlists.index(letter)-1]\r\nelse:\r\n for letter in word:\r\n newstr += strlists[strlists.index(letter) + 1]\r\nprint(newstr)", "order = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\ndirection = input()\ns = input()\nans = \"\"\nif direction == 'R':\n for i in range(len(s)):\n ans += order[order.find(s[i]) - 1]\nelse:\n for i in range(len(s)):\n ans += order[order.find(s[i]) + 1]\nprint(ans)\n\n\t\t\t\t\t\t\t \t\t\t \t\t \t\t \t\t \t\t", "x = input()\r\ns = input()\r\nalph = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\n\r\nif x == \"R\":\r\n for i in s:\r\n print(alph[alph.index(i)-1], end=\"\")\r\nelse:\r\n for i in s:\r\n print(alph[alph.index(i)+1], end=\"\")\r\n", "alpha = \"qwertyuiop\\\r\nasdfghjkl;\\\r\nzxcvbnm,./\"\r\n\r\na = input()\r\nb = input()\r\n\r\nmove = 1 if a == 'L' else -1\r\nfor i in b:\r\n print(alpha[alpha.index(i) + move], end='')", "keyboard=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\nch = input()\ns=input()\nans=''\nfor i in s :\n idx = keyboard.index(i)\n if ch == \"R\":\n ans += keyboard[idx -1]\n else: \n ans += keyboard[idx +1]\nprint(ans)\n \t\t\t\t \t\t \t \t\t\t \t \t \t\t\t \t", "l = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\npos = input()\r\ns = input()\r\nout = ''\r\nif pos == 'R':\r\n for i in s:\r\n ind = l.index(i)\r\n # print(ind)\r\n out += l[ind-1]\r\nif pos == 'L':\r\n for i in s:\r\n ind = l.index(i)\r\n out += l[ind+1]\r\nprint(out)\r\n", "string2 = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nch = input()\r\nstring = input()\r\nif ch == 'R':\r\n for i in range(len(string)):\r\n print(string2[string2.index(string[i])-1], end='')\r\nelif ch == 'L':\r\n for i in range(len(string)):\r\n print(string2[string2.index(string[i])+1], end='')\r\n", "c=input()\ns=input()\nlst=[\"qwertyuiop\",\"asdfghjkl;\",\"zxcvbnm,./\"]\nans=''\nfor i in range(len(s)):\n for j in range(len(lst)):\n if s[i] in lst[j]:\n idx = lst[j].index(s[i])\n if (c == 'L'):\n ans += lst[j][idx + 1]\n else:\n ans += lst[j][idx - 1]\n\nprint(ans)\n \t\t\t\t\t \t \t \t\t \t\t \t\t \t \t \t\t", "a = input()\r\nsymbols = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nb = input()\r\nc = b\r\nif a == \"L\":\r\n k = 1\r\nelse:\r\n k = -1\r\nc = \" \" * len(b)\r\nfor i in b:\r\n c = c.replace(\" \", symbols[symbols.find(i) + k], 1)\r\nprint(c)", "side = input()\r\nword = input()\r\nclawiatura = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nnew_word = ''\r\nfor simbol in word:\r\n simbol_number = clawiatura.find(simbol)\r\n new_word += clawiatura[simbol_number - 1] if side == 'R' else clawiatura[simbol_number + 1]\r\nprint(new_word)", "\r\nl = ['q','w','e','r','t','y','u','i','o','p','next','a','s','d','f','g','h','j','k','l',';','next','z','x','c','v','b','n','m',',','.','/','last'] \r\n\r\nshift = input(\"\")\r\ninp_str = input(\"\")\r\ninp = [] \r\nres = []\r\nfor t in inp_str:\r\n inp.append(t)\r\n\r\nif shift == \"R\":\r\n for i in inp_str:\r\n index = l.index(i)\r\n res.append(l[index-1])\r\n\r\nif shift == \"L\":\r\n for i in inp_str:\r\n index = l.index(i)\r\n res.append(l[index+1])\r\nprint(*res,sep =\"\")", "d = str(input())\r\np = str(input())\r\ns = \"\"\r\nkeys = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nif d == \"R\":\r\n add = -1\r\nelif d == \"L\":\r\n add = 1\r\nfor i in p:\r\n for o in range(len(keys)):\r\n if i == keys[o]:\r\n s += keys[o+add]\r\nprint(s)\r\n\r\n ", "#Coder_1_neel\r\na = input()\r\nx = input()\r\nl = ['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\nc = []\r\n\r\nif a == 'R':\r\n for i in x:\r\n if i in l: \r\n y = l.index(i)\r\n c.append(l[y - 1])\r\nelse:\r\n for i in x:\r\n if i in l: \r\n y = l.index(i)\r\n c.append(l[y + 1]) \r\n\r\n\r\nresult = ''.join(c)\r\nprint(result)\r\n", "a1 = list(\"q w e r t y u i o p\".split())\r\na2 = list(\"a s d f g h j k l ;\".split())\r\na3 = list(\"z x c v b n m , . /\".split())\r\n\r\nc = input()\r\nl = input()\r\nif(c==\"R\"):\r\n d = -1\r\nelse:\r\n d = 1\r\nans = \"\"\r\nfor i in range(len(l)):\r\n if(l[i] in a1):\r\n ans = ans+a1[(a1.index(l[i])+d)%len(a1)]\r\n elif(l[i] in a2):\r\n ans = ans+a2[(a2.index(l[i])+d)%len(a2)]\r\n elif(l[i] in a3):\r\n ans = ans+a3[(a3.index(l[i])+d)%len(a3)]\r\n \r\nprint(ans)", "a11=input()\r\nn=(input())\r\nn1='qwertyuiopasdfghjkl;zxcvbnm,./'\r\ns=\"\"\r\nif a11=='R':\r\n for j,i in enumerate((n)):\r\n d=n1.index(i)\r\n s=s+n1[d-1]\r\nelse:\r\n for j,i in enumerate((n)):\r\n d=n1.index(i)\r\n s=s+n1[d+1]\r\nprint(s)\r\n\r\n", "direction = input()\r\nmessage = input()\r\n\r\nkeyboard = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\n\r\nif direction == 'L':\r\n shift = 1\r\nelse:\r\n shift = -1\r\n\r\noriginal_message = ''\r\n\r\nfor a in message:\r\n index = keyboard.index(a)\r\n original_char = keyboard[index + shift]\r\n original_message += original_char\r\n\r\nprint(original_message)\r\n", "arr='''qwertyuiop\r\nasdfghjkl;\r\nzxcvbnm,./'''\r\nside=input()\r\nword=input()\r\nresult=''\r\nif side=='R':\r\n for i in range(len(word)):\r\n if word[i] in arr: result+=arr[arr.index(word[i])-1]\r\nelse:\r\n for i in range(len(word)):\r\n if word[i] in arr: result+=arr[arr.index(word[i])+1]\r\nprint(result)\r\n", "def main(vector,string):\r\n keyboardlist = ['qwertyuiop','asdfghjkl;','zxcvbnm,./']\r\n correct_string= ''\r\n for i in range(len(string)):\r\n for g in range(3):\r\n if string[i] in keyboardlist[g]:\r\n index = keyboardlist[g].find(string[i])\r\n if vector=='R':\r\n index-=1\r\n elif vector=='L':\r\n index+=1\r\n new_sym = keyboardlist[g][index]\r\n correct_string+=new_sym\r\n return correct_string\r\n\r\n\r\n return correct_string\r\n\r\nprint(main(input(),input()))", "chars = \"qwertyuiop asdfghjkl; zxcvbnm,./\"\r\nlr, word = input(), input()\r\nlrOffset = [1,-1][lr == \"R\"]\r\nprint(\"\".join(chars[lrOffset + chars.index(c)] for c in word))\r\n", "d = input()\r\na = input()\r\nb = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nc = ''\r\nif d=='R':\r\n for i in range(len(a)):\r\n c+=b[b.index(a[i])-1]\r\nelse:\r\n for i in range(len(a)):\r\n c+=b[b.index(a[i])+1]\r\nprint(c)", "strChar = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nshift = input()\r\nstrInput = input()\r\nstrans = ''\r\nshift_ind = -1 if shift=='R' else 1\r\nfor sm_ind in range(len(strInput)):\r\n for main_ind in range(len(strChar)):\r\n if strChar[main_ind] == strInput[sm_ind]:\r\n print(strChar[main_ind+shift_ind], end='')", "d = input()\r\ns = input()\r\nk = ['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\nj = \"\"\r\nfor i in s:\r\n ind = k.index(i)\r\n if d == \"R\":\r\n ind -= 1\r\n j += k[ind]\r\n else:\r\n ind += 1\r\n j += k[ind]\r\n\r\nprint(j)", "s = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\n\nl_to_i = {}\ni_to_l = {}\n\nfor i in range(len(s)):\n l_to_i[s[i]] = i\n i_to_l[i] = s[i]\n\ndirection = input()\nif direction == 'R':\n shift = -1\nelse:\n shift = 1\n\nmessage = input()\noutput = ''\n\nfor l in message:\n index = l_to_i[l]\n original_letter = i_to_l[index+shift]\n output += original_letter\n\nprint(output)\n\n \t\t \t \t \t\t\t \t\t\t\t \t \t \t\t\t\t", "s=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\nr={}\nl={}\nfor i in range(len(s)):\n r[s[i]]=s[i - 1]\n\nfor i in range(len(s)-1):\n l[s[i]]=s[i + 1]\n\n\nwhat=input()\nif what=='R':\n string=input()\n for i in range(len(string)):\n print(r[string[i]], end=\"\")\nelse:\n string = input()\n for i in range(len(string)):\n print(l[string[i]], end=\"\")\n\t \t\t \t\t \t \t\t \t\t \t\t \t\t", "words = \"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\nd = {}\r\nfor index in range(len(words)):\r\n c = words[index]\r\n d[c] = index\r\n\r\ndir = input()\r\ns = input()\r\nshift = 1 if dir == 'L' else -1\r\n\r\nfor c in s:\r\n index = d[c] + shift\r\n print(words[index], end=\"\")\r\nprint()", "d = input()\r\ns = input()\r\nl1 = \"qwertyuiop\"\r\nl2 = \"asdfghjkl;\"\r\nl3 = \"zxcvbnm,./\"\r\nif(d== 'R'): move = -1\r\nelse: move = 1\r\ns2 = ['x' for i in s]\r\nlength = len(s)\r\nfor i in range(length):\r\n if(s[i] in l1): s2[i] = l1[(l1.index(s[i])+move)%10]\r\n elif(s[i] in l2): s2[i] = l2[(l2.index(s[i])+move)%10]\r\n elif(s[i] in l3): s2[i] = l3[(l3.index(s[i])+move)%10]\r\nfor i in s2:\r\n print(i, end=\"\")\r\n# list(map(int, input().split()))", "direction = input()\r\ncode = input()\r\nkeyboard = [\"qwertyuiop\", \"asdfghjkl;\", \"zxcvbnm,./\"]\r\nshifted_keyboard = []\r\nif direction == \"L\":\r\n for row in keyboard:\r\n shifted_keyboard += [row[-1]+row[0:-1]]\r\nelse:\r\n for row in keyboard:\r\n shifted_keyboard += [row[1:]+row[0]]\r\nkeyboard, shifted_keyboard = \"\".join(keyboard), \"\".join(shifted_keyboard)\r\nref = {}\r\nfor ch1, ch2 in zip(shifted_keyboard, keyboard):\r\n ref[ch1] = ch2\r\n\r\nans = \"\"\r\nfor ch in code:\r\n ans+=ref[ch]\r\nprint(ans)\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n", "s = 'qwertyuiopasdfghjkl;zxcvbnm,./'\r\nch= input()\r\nm = 1\r\nif ch=='R' : m=-1\r\ns2 = input()\r\nfor i in s2:\r\n print(s[s.index(i)+m],end='')\r\n", "keyboard = ['q','w','e','r','t','y','u','i','o','p',\r\n'a','s','d','f','g','h','j','k','l',';',\r\n'z','x','c','v','b','n','m',',','.','/']\r\n\r\ndir = input()\r\nword = input()\r\nout =[]\r\n\r\nif dir == 'R':\r\n for i in range(len(word)) :\r\n for l in range(len(keyboard)):\r\n if word[i] == keyboard[l]:\r\n out.append(keyboard[l -1])\r\n print(''.join(out))\r\nif dir == 'L':\r\n for i in range(len(word)):\r\n for l in range(len(keyboard)):\r\n if word[i] == keyboard[l]:\r\n out.append(keyboard[l +1])\r\n print(''.join(out))", "s1=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\ns=input()\r\nss=input()\r\nans=\"\"\r\nif s==\"R\":\r\n for i in ss:\r\n v=s1.index(i)\r\n ans+=s1[v-1]\r\n\r\nif s==\"L\":\r\n for i in ss:\r\n v=s1.index(i)\r\n ans+=s1[v+1]\r\nprint(ans)\r\n ", "s=\"qwertyuiopasdfghjkl;zxcvbnm,./\"\r\na1,a=input(),input()\r\nl,l1,l2=[*s],[*a],[]\r\nif a1=='R':\r\n for i in range(len(l1)):\r\n l2.append(l[l.index(l1[i])-1])\r\n print(''.join(l2))\r\nelse:\r\n for i in range(len(l1)):\r\n l2.append(l[l.index(l1[i])+1])\r\n print(''.join(l2))", "direction = input()\r\ns = input()\r\ns1 = \"qwertyuiop\"\r\ns2 = \"asdfghjkl;\"\r\ns3 = \"zxcvbnm,./\"\r\n\r\nif direction == \"R\":\r\n for i in range(len(s)):\r\n if s[i] in s1:\r\n print(s1[s1.index(s[i]) - 1], end=\"\")\r\n elif s[i] in s2:\r\n print(s2[s2.index(s[i]) - 1], end=\"\")\r\n elif s[i] in s3:\r\n print(s3[s3.index(s[i]) - 1], end=\"\")\r\n else:\r\n print(s[i], end=\"\")\r\nelse:\r\n for i in range(len(s)):\r\n if s[i] in s1:\r\n print(s1[s1.index(s[i]) + 1], end=\"\")\r\n elif s[i] in s2:\r\n print(s2[s2.index(s[i]) + 1], end=\"\")\r\n elif s[i] in s3:\r\n print(s3[s3.index(s[i]) + 1], end=\"\")\r\n else:\r\n print(s[i], end=\"\")\r\n" ]

[ "from collections import defaultdict as dc,Counter as C\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nmp=dc(lambda:list())\r\nfor i in range(len(arr)):mp[arr[i]].append(i)\r\nst=set(arr)\r\nlst=[arr[0]]\r\nfor i in range(1,len(arr)):lst.append(lst[i-1]+arr[i])\r\n#print(st)\r\n#print(lst)\r\n#print(mp)\r\nfil,fir=0,0\r\ntot=-1e20\r\nnotake=set()\r\nfor i in st:\r\n if len(mp[i])>1:\r\n tmp=set()\r\n tmp.add(mp[i][0]+1)\r\n sm=arr[mp[i][0]]+arr[mp[i][-1]]\r\n for j in range(mp[i][0]+1,mp[i][-1]):\r\n if arr[j]>0:sm+=arr[j]; tmp.add(j+1)\r\n tmp.add(mp[i][-1]+1)\r\n if sm>=tot:tot=sm; fil,fir=mp[i][0]+1,mp[i][-1]+1; notake=tmp\r\nprint(tot,n-len(notake))\r\nlol=list()\r\nfor i in range(1,n+1):\r\n if i not in notake:lol.append(i)\r\nprint(*lol)", "from collections import defaultdict as dc,Counter as C\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nmp=dc(lambda:list())\r\nfor i in range(len(arr)):mp[arr[i]].append(i)\r\nst=set(arr)\r\nif arr[0]>0:lst=[arr[0]]\r\nelse:lst=[0]\r\nfor i in range(1,n):\r\n if arr[i]<0:lst.append(lst[-1])\r\n else:lst.append(lst[i-1]+arr[i])\r\n#print(st)\r\n#print(lst)\r\n#print(mp)\r\ntot=-1e20\r\nfil,fir=0,0\r\nfor i in st:\r\n if len(mp[i])>1:\r\n sm=0\r\n if mp[i][0]==0:sm=lst[mp[i][-1]]\r\n else:sm=(lst[mp[i][-1]]-lst[mp[i][0]-1])\r\n if i<0:sm+=(i*2)\r\n #print(sm)\r\n if sm>=tot:tot=sm; fil,fir=mp[i][0]+1,mp[i][-1]+1\r\nrem=list()\r\nfor i in range(1,fil):rem.append(i)\r\nfor i in range(fil+1,fir):\r\n if arr[i-1]<0:rem.append(i)\r\nfor i in range(fir+1,n+1):rem.append(i)\r\nprint(tot,len(rem))\r\nprint(*rem)", "length = int(input())\r\narray = [int(a) for a in input().split()]\r\nmaxSum = -10e20\r\nresIndexes = []\r\nfor i in range(length):\r\n\tfor j in range(length - 1, -1, -1):\r\n\t\tif j > i and array[i] == array[j]:\r\n\t\t\ttmp = sum(array[i:j + 1])\r\n\t\t\tindexes = []\r\n\t\t\tfor index in range(i + 1, j):\r\n\t\t\t\tif array[index] < 0:\r\n\t\t\t\t\ttmp -= array[index]\r\n\t\t\t\t\tindexes.append(index + 1)\r\n\t\t\tif tmp > maxSum:\r\n\t\t\t\tmaxSum = tmp\r\n\t\t\t\tindexes += list(range(1, i + 1))\r\n\t\t\t\tindexes += list(range(j + 2, length + 1))\r\n\t\t\t\tresIndexes = indexes\r\nprint (maxSum, len(resIndexes))\r\nresult = [str(a) for a in resIndexes]\r\nprint (' '.join(result))", "n=int(input())\r\na=tuple(map(int,input().split()))\r\nc={}\r\np={}\r\ns=x=y=0\r\nm=-1e18\r\nfor i in range(0,len(a)):\r\n d=c.get(a[i])\r\n if d!=None and s-d+a[i]*2>m:\r\n m=s-d+a[i]*2\r\n x,y=p.get(a[i]),i\r\n if(a[i]>0):s+=a[i] \r\n if p.get(a[i])==None:\r\n p[a[i]]=i\r\n c[a[i]]=s\r\na=[str(i+1) for i in range(0,len(a)) if i!=x and i!=y and (a[i]<0 or i<x or i>y)]\r\nprint(m,len(a))\r\nprint(\" \".join(a))\r\n", "def main():\r\n n, aa = int(input()), list(map(int, input().split()))\r\n partialsum, s, d, ranges = [0] * n, 0, {}, []\r\n for hi, a in enumerate(aa):\r\n if a in d:\r\n base = s + a * 2\r\n for lo in d[a]:\r\n ranges.append((base - partialsum[lo], lo, hi))\r\n d[a].append(hi)\r\n else:\r\n d[a] = [hi]\r\n if a > 0:\r\n s += a\r\n partialsum[hi] = s\r\n s, lo, hi = max(ranges)\r\n res = list(range(1, lo + 1))\r\n for i in range(lo + 1, hi):\r\n if aa[i] < 0:\r\n res.append(i + 1)\r\n res.extend(range(hi + 2, n + 1))\r\n print(s, len(res))\r\n print(\" \".join(map(str, res)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import math\r\nimport sys\r\nfrom collections import deque, Counter, OrderedDict, defaultdict\r\n#import heapq\r\n#ceil,floor,log,sqrt,factorial,pow,pi,gcd\r\n#import bisect\r\n#from bisect import bisect_left,bisect_right\r\ninput = sys.stdin.readline\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input().strip()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\nn=inp()\r\nl=inlt()\r\ng=Counter(l)\r\nfst=defaultdict(lambda:-1)\r\nlst=defaultdict(lambda:-1)\r\nsm=[max(0,l[0])]\r\nfor i in range(1,n):\r\n sm.append(sm[-1]+max(0,l[i]))\r\nfor i in range(n):\r\n if fst[l[i]]==-1:\r\n fst[l[i]]=i\r\nfor i in range(n-1,-1,-1):\r\n if lst[l[i]]==-1:\r\n lst[l[i]]=i\r\nmx=-sys.maxsize\r\nv=-1\r\nfor each in g:\r\n if g[each]>=2:\r\n if each<0:\r\n val=2*each-sm[fst[each]]+sm[lst[each]]\r\n else:\r\n val=sm[lst[each]]-sm[fst[each]]+each\r\n if val>mx:\r\n mx=val\r\n v=each\r\ncnt=0\r\nrem=[]\r\nfor i in range(n):\r\n if i<fst[v]:\r\n rem.append(i+1)\r\n elif i>lst[v]:\r\n rem.append(i+1)\r\n elif l[i]<0 and i!=fst[v] and i!=lst[v]:\r\n rem.append(i+1)\r\nprint(mx,len(rem))\r\nprint(*rem)", "n, t = int(input()), list(map(int, input().split()))\r\na, b = {}, {}\r\nfor i, j in enumerate(t):\r\n if not j in a: a[j] = i\r\n else: b[j] = i\r\np = [(a[j], b[j] - 1) for j in b]\r\ns = [j if j > 0 else 0 for j in t]\r\nu = v = 2 * t[p[0][0]] - 1\r\nfor i in range(n - 1): s[i + 1] += s[i]\r\nfor i, j in p:\r\n u = 2 * t[i] + s[j] - s[i]\r\n if u > v: a, b, v = i, j, u\r\ns = list(range(1, a + 1)) + [i for i, j in enumerate(t[a + 1: b + 1], a + 2) if j < 0] + list(range(b + 3, n + 1))\r\nprint(v, len(s))\r\nprint(' '.join(map(str, s)))", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nlib = defaultdict(list)\r\nfor i,a in enumerate(A):\r\n lib[a].append(i)\r\n#print(lib)\r\n\r\nsums = [0]\r\nfor a in A:\r\n if a>0:\r\n sums.append(sums[-1]+a)\r\n else:\r\n sums.append(sums[-1])\r\n\r\ntotal = -float('inf')\r\nspans = None\r\nfor k,v in lib.items():\r\n if len(v)<2:continue\r\n t = sums[v[-1]]-sums[v[0]+1]+k+k\r\n if t>total:\r\n total = t\r\n spans = (v[0],v[-1])\r\n \r\n#print(spans)\r\nans = [i+1 for i in range(spans[0])]\r\nfor i in range(spans[0]+1,spans[1]):\r\n if A[i]<0:\r\n ans.append(i+1)\r\nfor i in range(spans[1]+1,N):\r\n ans.append(i+1)\r\nprint(total, len(ans))\r\nprint(*ans)\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\nw = list(map(int, input().split()))\r\n\r\nd = dict()\r\np = []\r\nc = 0\r\nfor i in range(n):\r\n if w[i] not in d:\r\n d[w[i]] = [1, i, i]\r\n else:\r\n if d[w[i]][0] != 2:\r\n d[w[i]][0] = 2\r\n d[w[i]][2] = i\r\n\r\n if w[i] > 0:\r\n c += w[i]\r\n p.append(c)\r\n\r\nx = -100000000000\r\nb = (0, 0)\r\nfor i in d:\r\n if d[i][0] == 2:\r\n x1 = p[d[i][2]] - (p[d[i][1]-1] if d[i][1] != 0 else 0)\r\n if i < 0:\r\n x1 += i+i\r\n if x1 > x:\r\n x = x1\r\n b = (d[i][1], d[i][2])\r\n\r\ne = []\r\ne.extend(list(range(1, b[0]+1)))\r\nfor i in range(b[0]+1, b[1]):\r\n if w[i] < 0:\r\n e.append(i+1)\r\ne.extend(list(range(b[1] + 2, n + 1)))\r\n\r\n\r\nprint(x, len(e))\r\nprint(' '.join(map(str, e)))", "from sys import stdin\nfrom collections import defaultdict\n\nn = int(stdin.readline().rstrip())\na = [int(x) for x in stdin.readline().rstrip().split(' ')]\n\nmmin = {}\nmmax = {}\npref = {} # prefix sums\n\nfor i, x in enumerate(a):\n if x not in mmin:\n mmin[x] = i\n\n mmax[x] = i\n\n if i == 0:\n val = max(x, 0)\n else:\n val = pref[i-1] + max(x, 0)\n\n pref[i] = val\n\npref[-1] = 0\n\nks = set(mmin.keys()).intersection(mmax.keys())\nfks = [k for k in ks if mmin[k] != mmax[k]]\nmaxk = None\nmaxsum = None\n\nfor k in fks:\n if maxk is None:\n maxk = k\n maxsum = pref[mmax[k]] - pref[mmin[k]-1]\n if k < 0:\n maxsum += 2*k\n continue\n maxcand = pref[mmax[k]] - pref[mmin[k]-1]\n if k < 0:\n maxcand += 2*k\n if maxcand > maxsum:\n maxk = k\n maxsum = maxcand\n\ncut = 0\ncuts = []\n\nfor i, val in enumerate(a):\n if i < mmin[maxk] or i > mmax[maxk]:\n cut += 1\n cuts.append(i+1)\n continue\n if i in [mmin[maxk], mmax[maxk]]:\n continue\n if val < 0:\n cut += 1\n cuts.append(i+1)\n\nprint(maxsum, cut)\nprint(' '.join(str(x) for x in cuts))" ]

[ "n = int(input().strip())\r\nlst = list(map(int, input().strip().split()))\r\nl1 = ['0']*lst.count(0) + ['100']*lst.count(100)\r\nl2 = []\r\nfor i in range(n):\r\n if lst[i] > 0 and lst[i] < 10:\r\n l2.append(str(lst[i]))\r\n break\r\nl3 = []\r\nfor i in range(n):\r\n if lst[i] % 10 == 0 and lst[i] not in [0, 100]:\r\n l3.append(str(lst[i]))\r\n break\r\nl4 = []\r\nfor i in range(n):\r\n if lst[i] > 10 and lst[i] < 100 and lst[i] % 10 != 0:\r\n l4.append(str(lst[i]))\r\n break\r\nif len(l2) == 0 and len(l3) == 0:\r\n l = l1 + l4\r\nelse:\r\n l = l1 + l2 + l3\r\nprint(len(l))\r\nprint(' '.join(l))", "k=int(input())\r\nd=list(map(int, input().split()))\r\nans=[]\r\nif 0 in d:\r\n ans.append(0)\r\nif 100 in d:\r\n ans.append(100)\r\na=0\r\nb=0\r\nc=0\r\nfor i in range(k):\r\n if d[i]!=0 and d[i]!=100:\r\n if len(str(d[i]))==1:\r\n a=d[i]\r\n if d[i]%10==0:\r\n b=d[i]\r\n if len(str(d[i]))==2:\r\n c=d[i]\r\nif a and b:\r\n ans.extend([a,b])\r\nelif a:\r\n ans.append(a)\r\nelif b:\r\n ans.append(b)\r\nelif c:\r\n ans.append(c)\r\nprint(len(ans))\r\nif ans:\r\n print(*ans)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=[]\r\nk=[1,10,100]\r\nfor i in a:\r\n check=True\r\n for j in ans:\r\n for x in k:\r\n if((i // x % 10) * (j // x % 10) > 0):\r\n check=False\r\n if(check):\r\n ans.append(i)\r\nprint(len(ans))\r\nprint(*ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nans,b,c,d=[],[],[],[]\r\nfor x in a:\r\n if 0<x<10:\r\n b.append(x)\r\n elif 10<=x<100:\r\n if x%10==0:\r\n c.append(x)\r\n else:\r\n d.append(x)\r\nif 0 in a: ans.append(0)\r\nif 100 in a: ans.append(100)\r\nif len(b)>0: ans.append(b[0])\r\nif len(c)>0: ans.append(c[0])\r\nif len(b)==0 and len(c)==0 and len(d)>0: ans.append(d[0])\r\nprint(len(ans))\r\nprint(*ans)\r\n", "from sys import stdin\r\nn = int(input())\r\narr = list( map(int, stdin.readline().split()) )\r\none = []\r\ntwo = []\r\nans = []\r\nfor x in arr:\r\n\tif( x == 0 or x == 100 ):\r\n\t\tans.append(x)\r\n\telif( x < 10 ):\r\n\t\tone.append(x)\r\n\telse:\r\n\t\ttwo.append(x)\r\n\r\nprv = len(ans)\r\nfor x in one:\r\n\tfor y in two:\r\n\t\tif(len(ans) != prv): break\r\n\t\tif( y%10 == 0 ):\r\n\t\t\tans.append(x)\r\n\t\t\tans.append(y)\r\n\r\nif( len(ans) == prv ):\r\n\tif( len(one) > 0 ):\r\n\t\tans.append( one[0] )\r\n\telif( len(two) > 0 ):\r\n\t\tans.append( two[0] )\r\n\r\nprint( len(ans) )\r\nfor x in ans:\r\n\tprint(x,end=' ')", "from sys import stdin\r\n\r\ndef read(): return map(int, stdin.readline().split())\r\n\r\nn, = read()\r\ng = [ -1 for i in range(8) ]\r\n\r\nfor x in read():\r\n m = 0\r\n if x%10 != 0: m += 1\r\n if (x//10)%10 != 0: m += 2\r\n if (x//100) != 0: m += 4\r\n g[m] = x\r\n \r\nans = []\r\nfor startM in range(8):\r\n if g[startM] >= 0:\r\n curA = [g[startM]]\r\n curM = startM\r\n for m in [0, 1, 2, 4, 3, 6, 5, 7]:\r\n if m != startM and g[m] >= 0 and (curM&m) == 0:\r\n curM |= m\r\n curA.append ( g[m] ) \r\n if len(curA) > len(ans):\r\n ans = curA\r\n\r\nprint ( len(ans) )\r\nprint ( \" \".join(map(str,ans)) )\r\n", "\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\n\r\ndef get_bit(a):\r\n ans = 0\r\n for i in range(3):\r\n if a%10:\r\n ans^=1<<i\r\n a//=10\r\n return ans\r\nans = []\r\nbits = 0\r\nfor a in A:\r\n b = get_bit(a)\r\n if b&bits==0:\r\n ans.append(a)\r\n bits^=b\r\nprint(len(ans))\r\nprint(*ans)\r\n", "k=int(input())\r\na=['0'*(3-len(i))+i for i in input().split()]\r\ne=0\r\nf=[]\r\ndef c(a,p=[],d=0):\r\n global e,f\r\n g=[1]*101\r\n for i in p:\r\n g[int(i)]=0\r\n for i in a:\r\n if g[int(i)]==1:\r\n for j in p:\r\n z=0\r\n for l in range(3):\r\n if '0' not in i[l]+j[l]:\r\n z=1\r\n break\r\n if z:\r\n break\r\n else:\r\n c(a,p+[i],d+1)\r\n if d==0:\r\n c(a,[i],1)\r\n if d>e:\r\n e=d\r\n f=[int(i) for i in p]\r\nc(a)\r\nprint(e)\r\nprint(*f)", "k = int(input())\r\narr = list(map(int, input().split()))\r\nres = []\r\nif 0 in arr: res.append(0)\r\nif 100 in arr: res.append(100)\r\nvalid1 = False\r\nfor i in arr:\r\n if 0 < i < 10:\r\n res.append(i)\r\n valid1 = True\r\n break\r\nvalid2 = False\r\nfor i in arr:\r\n if 9 < i < 100 and i % 10 == 0:\r\n res.append(i)\r\n valid2 = True\r\n break\r\nif (not valid1 and not valid2):\r\n for j in arr:\r\n if j != 0 and j != 100:\r\n res.append(j)\r\n break\r\nprint(len(res))\r\nprint(*res)\r\n", "input()\r\na=[-1]*5\r\nfor i in map(int,input().split()):\r\n if i==0: a[0]=i\r\n elif i<10: a[1]=i\r\n elif i>99: a[2]=i\r\n elif i%10==0: a[3]=i\r\n else: a[4]=i\r\nx,y=[*filter((z:=lambda j:j>-1),a[:4])],[*filter(z,a[:5:2])]\r\nprint(max(len(x),len(y)))\r\nprint(*(x if len(x)>len(y) else y))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nk = int(input())\r\nw = list(map(int, input().split()))\r\nq = []\r\nd = [0, 0]\r\nfor i in w:\r\n if i in [0, 100]:\r\n q.append(i)\r\n elif 0 < i < 10 and d[0] == 0:\r\n d[0] = 1\r\n q.append(i)\r\n elif 9 < i < 100 and d[1] == 0 and i % 10 == 0:\r\n d[1] = 1\r\n q.append(i)\r\n\r\nif d == [0, 0]:\r\n for i in w:\r\n if 9 < i < 100:\r\n q.append(i)\r\n break\r\nprint(len(q))\r\nprint(' '.join(map(str, q)))\r\n", "k = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nzero = -1\r\nbig = -1\r\nfirst = -1\r\nsecond = -1\r\nother = -1\r\nfor v in l:\r\n if v == 0:\r\n zero = 0\r\n elif v == 100:\r\n big = 100\r\n elif v <10:\r\n first = v\r\n elif v % 10 == 0:\r\n second = v\r\n else:\r\n other = v\r\n\r\nout = []\r\nif zero != -1:\r\n out.append(0)\r\nif big != -1:\r\n out.append(big)\r\nif first != -1:\r\n out.append(first)\r\nif second != -1:\r\n out.append(second)\r\nif first == -1 and second == -1 and other != -1:\r\n out.append(other)\r\nprint(len(out))\r\nprint(' '.join(map(str,out)))\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd =[]\r\nfor i in l:\r\n if i>0 and i<10:\r\n d+=[i]\r\n break\r\nfor i in l:\r\n if i!=0 and i!=100:\r\n if i%10 ==0:\r\n d+=[i]\r\n break\r\nif len(d)==0:\r\n for i in l:\r\n if i>10 and i<100:\r\n d+=[i]\r\n break\r\nif 0 in l:\r\n d+=[0]\r\nif 100 in l:\r\n d+=[100]\r\nprint(len(d))\r\nprint(*d)", "from sys import stdin\n\ninputIdx = 0;\ninput = stdin.read().strip().split();\n\ndef nextToken():\n global inputIdx, input;\n if inputIdx == len(input):\n exit();\n token = input[inputIdx];\n inputIdx += 1;\n return token;\n\ndef main():\n while True:\n n = int(nextToken());\n s = set( [ int(nextToken()) for i in range(n) ] );\n ans = [];\n d1 = -1; d2 = -1; d3 = -1;\n for x in s:\n if x == 0 or x == 100:\n ans.append(x);\n elif 1 <= x and x <= 9:\n d1 = x;\n elif (x%10) == 0:\n d2 = x;\n else:\n d3 = x;\n if d1 != -1 and d2 != -1:\n ans += [ d1, d2 ];\n else:\n if d1 != -1:\n ans.append(d1);\n elif d2 != -1:\n ans.append(d2);\n elif d3 != -1:\n ans.append(d3);\n if len(ans) == 0:\n ans.append( tmp );\n print( len(ans) );\n print( \" \".join(map(str,ans)) );\n\nmain();\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb =[]\r\nfor i in a:\r\n if i>0 and i<10:\r\n b+=[i]\r\n break\r\nfor i in a:\r\n if i!=0 and i!=100:\r\n if i%10 ==0:\r\n b+=[i]\r\n break\r\nif len(b)==0:\r\n for i in a:\r\n if i>10 and i<100:\r\n b+=[i]\r\n break\r\nif 0 in a:\r\n b+=[0]\r\nif 100 in a:\r\n b+=[100]\r\nprint(len(b))\r\nprint(*b)", "input()\r\na = list(map(int, input().split()))\r\nd = []\r\nfor i in a:\r\n if i in range(1, 10):\r\n d += [i]\r\n break\r\nfor i in a:\r\n if i in range(10, 100, 10):\r\n d += [i]\r\n break\r\nif len(d) == 0:\r\n for i in a:\r\n if i not in (0, 100):\r\n d += [i]\r\n break\r\nif 100 in a:\r\n d += [100]\r\nif 0 in a:\r\n d += [0]\r\nprint(len(d))\r\nprint(*d)", "#!/usr/bin/env python3\nk = int(input())\nds = list(map(int,input().split()))\nes = []\nbs = [False, False, False]\nfor d in ds:\n assert 0 <= d <= 100\n if d == 0:\n es.append(d)\n elif 1 <= d <= 9:\n if not bs[0]:\n bs[0] = True\n es.append(d)\n elif 10 <= d <= 99 and d % 10 == 0:\n if not bs[1]:\n bs[1] = True\n es.append(d)\n elif d == 100:\n if not bs[2]:\n bs[2] = True\n es.append(d)\nfor d in ds:\n if not bs[0] and not bs[1]:\n if 10 <= d <= 99 and d % 10 != 0:\n bs[0] = True\n bs[1] = True\n es.append(d)\nprint(len(es))\nprint(*es)\n", "n = int(input())\na = sorted(list(map(int, input().split())))\nb = set()\nfor x in a:\n if all(all(('%03d' % x)[i] == '0' or ('%03d' % t)[i] == '0' for i in range(3))for t in b):\n b.add(x)\nprint(len(b))\nprint(' '.join(map(str, b)))\n", "k = int(input())\r\nd = input().split()\r\nfor i in range(len(d)):\r\n d[i] = int(d[i]) \r\n \r\ncnt = [0, 0, 0, 0, 0]\r\nans = []\r\nfor i in range(len(d)):\r\n if d[i] == 0:\r\n cnt[0] = 1\r\n continue\r\n if d[i]==100:\r\n cnt[1] = 1\r\n continue\r\n if d[i]%10 == 0:\r\n cnt[2] = d[i]\r\n continue\r\n if d[i]<10:\r\n cnt[3] = d[i]\r\n continue\r\n cnt[4] = d[i]\r\n\r\nif (cnt[0]):\r\n ans.append(0)\r\nif (cnt[1]):\r\n ans.append(100)\r\nif (cnt[2]):\r\n ans.append(cnt[2])\r\nif (cnt[3]):\r\n ans.append(cnt[3])\r\nif (not cnt[2] and not cnt[3] and cnt[4]):\r\n ans.append(cnt[4])\r\n\r\nans = sorted(ans)\r\nprint(len(ans))\r\nprint(\" \".join(str(v) for v in ans))", "n = int(input())\r\narr = list(map(int, input().split()))\r\nOut_arr = list()\r\narr_2_10 = list(); arr1= list(); arr_2_not10 = list()\r\nfor i in arr:\r\n if(i == 100):\r\n if(len(Out_arr) < 2):\r\n Out_arr.append(100)\r\n elif(i == 0):\r\n Out_arr.append(i)\r\n elif(int(i/10) == 0):\r\n arr1.append(i)\r\n elif(i%10 == 0):\r\n arr_2_10.append(i)\r\n else:\r\n arr_2_not10.append(i)\r\n \r\nif(len(arr1) > 0):\r\n Out_arr.append(arr1[0])\r\n if(len(arr_2_10) > 0):\r\n Out_arr.append(arr_2_10[0])\r\nelse:\r\n if(len(arr_2_10) > 0):\r\n Out_arr.append(arr_2_10[0])\r\n elif(len(arr_2_not10) > 0):\r\n Out_arr.append(arr_2_not10[0])\r\nprint(len(Out_arr))\r\nfor i in Out_arr:\r\n print(i, end= \" \")\r\nprint()", "input()\r\nd=[*map(int,input().split())]\r\ncnt=[0]*5\r\nq=[]\r\nfor i in d:\r\n if i==0:\r\n cnt[0]=1\r\n elif i==100:\r\n cnt[1]=1\r\n elif i<10:\r\n cnt[2]=i\r\n elif i%10==0:\r\n cnt[3]=i\r\n else:\r\n cnt[4]=i\r\nif cnt[0]:\r\n q+=[0]\r\nif cnt[1]:\r\n q+=[100]\r\nif cnt[2]:\r\n q+=[cnt[2]]\r\nif cnt[3]:\r\n q+=[cnt[3]]\r\nelif not cnt[2] and not cnt[3] and cnt[4]:\r\n q+=[cnt[4]]\r\nprint(len(q))\r\nprint(*q)\r\n\r\n", "k = int(input())\r\ndk = list(map(int,input().split()))\r\nans = []\r\nif 0 in dk:\r\n ans.append(0)\r\nif 100 in dk:\r\n ans.append(100)\r\nf1 = False\r\nfor q in dk:\r\n if 0<q<10:\r\n ans.append(q)\r\n f1 = True\r\n break\r\nf2 = False\r\nfor q in dk:\r\n if 9<q<100 and q%10==0:\r\n ans.append(q)\r\n f2 = True\r\n break\r\nif (not f1 and not f2):\r\n for j in dk:\r\n if j!=0 and j!=100:\r\n ans.append(j)\r\n break\r\nprint(len(ans))\r\nprint(*ans)\r\n", "n=int(input())\r\narr=[]\r\nflag=flag1=False\r\nl=list(map(int,input().strip().split()))\r\nfreq=[0]*101\r\nfor i in range(len(l)):\r\n if(l[i]==0 or l[i]==100):\r\n arr.append(l[i])\r\n elif(l[i]<10):\r\n if(not flag):\r\n arr.append(l[i])\r\n flag=True\r\n elif(l[i]%10==0):\r\n if(not flag1):\r\n arr.append(l[i])\r\n flag1=True\r\nif not flag1 and not flag:\r\n for i in range(1, 100):\r\n if i in l:\r\n arr.append(i)\r\n break\r\nprint(len(arr))\r\nfor i in arr:\r\n print (i, end=' ')", "n= int(input())\r\nlst=list(map(int,input().split()))\r\ndi={0:None,1:None,11:None,100:None,10:None}\r\nfor i in lst:\r\n if i ==0:\r\n di[0]=0\r\n elif i ==100:\r\n di[100]=i\r\n elif 0<i<10:\r\n di[1]=i\r\n elif 10<=i<=99 and i%10==0:\r\n di[10]=i\r\n else:\r\n di[11]=i\r\nif di[10]!=None:\r\n di.pop(11)\r\nelif di[10]==None and di[1]!=None:\r\n di.pop(11)\r\nlst1=list(di.values())\r\nans=[x for x in lst1 if x is not None]\r\nprint(len(ans))\r\nprint(*ans)\r\n\r\n\r\n\r\n" ]

[ "import sys\r\nn,m = [int(x) for x in input().split(' ')]\r\na=[]\r\nfor i in range(n):\r\n b=[]\r\n s = input().strip()\r\n for j in range(m):\r\n if s[j]=='#':\r\n b.append(j)\r\n if b not in a:\r\n a.append(b)\r\nc=[0]*m\r\nans=True\r\n#print(a)\r\nfor i in a:\r\n for j in i:\r\n c[j]+=1\r\n if c[j]>1:\r\n ans=False\r\n break\r\nif ans:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "def partial_match(r1, r2):\n n = len(r1)\n match_found = False\n mismatch_found = False\n for i in range(n):\n if r1[i] == '#' and r2[i] == '#':\n match_found = True\n if r1[i] == '#' and r2[i] == '.':\n mismatch_found = True\n if r2[i] == '#' and r1[i] == '.':\n mismatch_found = True\n return match_found and mismatch_found\n\nn , m = tuple(map(int, input().split()))\nl = []\nfor i in range(n):\n l.append(input().strip())\n\n\ninvalid = False\nfor i in range(n):\n for j in range(n):\n if partial_match(l[i], l[j]):\n invalid = True\n break\n\nif invalid:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "n,m = map(int,input().split())\r\na = []\r\nf = 0\r\nfor i in range(n):a.append(input())\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n r1 = a[i]\r\n r2 = a[j]\r\n f1 = f2 = 0\r\n for k in range(m):\r\n if r1[k] != r2[k]:f1 = 1\r\n if (r1[k] == '#') and (r2[k]=='#'):f2 = 1\r\n if f1 == 1:\r\n if f2 == 1:\r\n f = 1\r\nif f:print('No')\r\nelse:print('Yes')\r\n", "a,b=map(int,input().split())\r\nz=[0]*b\r\nk=[input() for _ in \" \"*a]\r\nok=1\r\nfor i in range(a):\r\n t=[0]*b\r\n for j in range(b):\r\n t[j]+=0+(k[i][j]=='#')\r\n for j in range(i+1,a):\r\n o=[0]*b\r\n for x in range(b):\r\n o[x]+=0+(k[j][x]=='#')\r\n p=0\r\n for x in range(b):\r\n p+=0+(o[x]==t[x]==1)\r\n if p!=0 :\r\n if p!=t.count(1) or p!=o.count(1):ok=0\r\nif ok:print(\"yes\")\r\nelse:print(\"no\")", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\nclass CDisjointSet(object):\r\n def __init__(self):\r\n self.leader = {} # maps a member to the group's leader\r\n self.group = {} # maps a group leader to the group (which is a set)\r\n def Add(self, a, b):\r\n leadera = self.leader.get(a)\r\n leaderb = self.leader.get(b)\r\n if leadera is not None:\r\n if leaderb is not None:\r\n if leadera == leaderb: return # nothing to do\r\n groupa = self.group[leadera]\r\n groupb = self.group[leaderb]\r\n if len(groupa) < len(groupb):\r\n a, leadera, groupa, b, leaderb, groupb = b, leaderb, groupb, a, leadera, groupa\r\n groupa |= groupb\r\n del self.group[leaderb]\r\n for k in groupb:\r\n self.leader[k] = leadera\r\n else:\r\n self.group[leadera].add(b)\r\n self.leader[b] = leadera\r\n else:\r\n if leaderb is not None:\r\n self.group[leaderb].add(a)\r\n self.leader[a] = leaderb\r\n else:\r\n self.leader[a] = self.leader[b] = a\r\n self.group[a] = set([a, b])\r\n\r\ndef Judge():\r\n #[1]\r\n ds = CDisjointSet()\r\n n, m = map(int, input().split())\r\n arr = list()\r\n for i in range(n):\r\n arr.append(input())\r\n for i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == '#':\r\n ds.Add(i+1, 101+j)\r\n #[2]\r\n for vs in ds.group.values():\r\n rs = list()\r\n cs = list()\r\n for v in vs:\r\n if v < 100:\r\n rs.append(v-1)\r\n else:\r\n cs.append(v-101)\r\n for i in rs:\r\n for j in range(m):\r\n if j in cs and arr[i][j] == '.':\r\n return False\r\n if j not in cs and arr[i][j] == '#':\r\n return False\r\n #[3]\r\n return True\r\n\r\nprint('Yes') if Judge() else print('No')\r\n", "import sys\n\n\ndef read_two_int():\n\treturn map(int, sys.stdin.readline().strip().split(' '))\n\n\ndef get_colored_rows(A, n, col):\n\treturn {i for i in range(n) if A[i][col] == '#'}\n\n\ndef get_colored_columns(A, m, row):\n\treturn {j for j in range(m) if A[row][j] == '#'}\n\n\ndef validate_step_correct(A, n, m, rows, columns):\n\tfor row in rows:\n\t\tif get_colored_columns(A, m, row) != columns:\n\t\t\t# print(\"Bad columns \", columns)\n\t\t\treturn False\n\n\tfor column in columns:\n\t\tif get_colored_rows(A, n, column) != rows:\n\t\t\t# print(\"Bad rows \", rows)\n\t\t\treturn False\n\treturn True\n\n\ndef clear_step(A, rows, columns):\n\tfor i in rows:\n\t\tfor j in columns:\n\t\t\tA[i][j] = '.'\n\n\ndef validate_map(n, m, A):\n\tused_rows = [False for i in range(n)]\n\tused_columns = [False for j in range(m)]\n\n\tfor i in range(n):\n\t\tfor j in range(m):\n\t\t\tif A[i][j] != '#':\n\t\t\t\tcontinue\n\n\t\t\trows = get_colored_rows(A, n, j)\n\t\t\tcolumns = get_colored_columns(A, m, i)\n\t\t\t# print(rows)\n\t\t\t# print(columns)\n\n\t\t\tif not validate_step_correct(A, n, m, rows, columns):\n\t\t\t\treturn False\n\n\t\t\tclear_step(A, rows, columns)\n\n\t# map is empty now\n\treturn True\n\n\nn, m = read_two_int()\nA = []\nfor i in range(n):\n\trow = sys.stdin.readline().strip()\n\tA.append([c for c in row])\n\nprint('Yes' if validate_map(n, m, A) else 'No')\n", "n, m = map(int, input().split())\r\nnum = []\r\nused = []\r\nusedstr = [0] * n\r\nfl = True\r\nusedstolb = [0] * m\r\nfor i in range(n):\r\n num.append(input())\r\nfor i in range(n):\r\n if usedstr[i] == 0:\r\n stroki = []\r\n stolbi = []\r\n for j in range(m):\r\n if num[i][j] == '#':\r\n stolbi.append(j)\r\n for x in range(n):\r\n if num[x][j] == '#' and x not in stroki:\r\n stroki.append(x)\r\n for x in range(len(stroki)):\r\n for y in range(m):\r\n if num[stroki[x]][y] == '#' and y not in stolbi:\r\n stolbi.append(y)\r\n \r\n for x in range(len(stolbi)):\r\n if usedstolb[stolbi[x]]:\r\n fl = False\r\n break\r\n else:\r\n usedstolb[stolbi[x]] = 1\r\n for x in range(len(stroki)):\r\n if usedstr[stroki[x]]:\r\n fl = False\r\n break\r\n else:\r\n usedstr[stroki[x]] = 1\r\n for x in range(len(stroki)):\r\n for y in range(len(stolbi)):\r\n if num[stroki[x]][stolbi[y]] == '.':\r\n fl = False\r\n break\r\n if not fl:\r\n break\r\nif fl:\r\n print('Yes')\r\nelse:\r\n print('No')\r\n \r\n \r\n ", "rows, cols = list(map(int , input().split()))\r\npainting = []\r\nfor row in range(rows):\r\n painting.append(input().strip())\r\n\r\nps = set(painting)\r\nused = [False] * cols\r\nfor r in ps:\r\n for c in range(cols):\r\n if r[c] == '#':\r\n if used[c]:\r\n print('No')\r\n exit()\r\n else:\r\n used[c] = True\r\nprint('Yes')\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\ns=[]\r\nfor i in range(n):\r\n s.append(input())\r\nvisited=[False for i in range(n)]\r\nused=[False for i in range(m)]\r\nch=True\r\ncount=0\r\nfor i in range(n):\r\n if(not visited[i]):\r\n rows=[]\r\n visited[i]=True\r\n for j in range(m):\r\n if(s[i][j]=='#'):\r\n rows.append(j)\r\n if(used[j]):\r\n ch=False\r\n break\r\n used[j]=True\r\n #print(rows,i)\r\n if(not ch):\r\n break\r\n if(len(rows)==0):\r\n continue\r\n cols=[]\r\n for k in range(n):\r\n j=rows[0]\r\n if(s[k][j]=='#'):\r\n cols.append(k)\r\n for j in cols:\r\n visited[j]=True\r\n #print('cols is',cols,i)\r\n for j in rows:\r\n cols2=[]\r\n for k in range(n):\r\n if(s[k][j]=='#'):\r\n cols2.append(k)\r\n if(cols!=cols2):\r\n ch=False\r\n break\r\n if(not ch):\r\n break\r\n \r\n \r\n for k in cols:\r\n rows2=[] \r\n for j in range(m):\r\n if(s[k][j]=='#'):\r\n rows2.append(j)\r\n if(rows!=rows2):\r\n ch=False\r\n break\r\nif(ch):\r\n print('yes')\r\nelse:\r\n print('no')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ng = [''] *n\r\n\r\nfor i in range(n):\r\n g[i] = input()[:-1]\r\n\r\nfor j in range(m):\r\n x = []\r\n for i in range(n):\r\n if g[i][j] == '#':\r\n x.append(i)\r\n\r\n if len(x) > 0:\r\n for i in x:\r\n if g[i] != g[x[0]]:\r\n print('No')\r\n exit(0)\r\nelse:\r\n print('Yes')\r\n", "n, m = list(map(int, input().strip().split(' ')))\nd = {}\nvisited = {}\nok = True\nfor i in range(n):\n line = input().strip()\n if line not in d:\n d[line] = 1\n for j in range(m):\n if line[j] == '#':\n if j in visited:\n ok = False\n break\n else:\n visited[j] = 1\nif ok:\n print(\"Yes\")\nelse:\n print(\"No\")\n \t\t \t \t \t\t\t \t\t\t \t\t", "n, m = map(int, input().split())\nfield = [''] * n\nfor i in range(n):\n field[i] = input()\n\nfor j in range(0, m):\n nums = []\n for i in range(0, n):\n if field[i][j] == '#':\n nums.append(i)\n if len(nums) > 0:\n for i in nums:\n if field[i] != field[nums[0]]: \n print('no')\n exit(0)\nprint('yes')", "n, m = map (int, input ().split ()); mp = list ()\r\nfor i in range (n) : mp.append (input ())\r\nfor c in range (m) :\r\n a = list ()\r\n for r in range (n) :\r\n if mp[r][c] == '#' : a.append (r)\r\n if len (a) == 0 : continue\r\n for i in a :\r\n if mp[i] != mp[a[0]] : print (\"No\"); exit (0)\r\nprint (\"Yes\")\r\n", "n, m = map(int, input().split())\nmas = []\ndf = {}\nflag = True\nfor i in range(n):\n k = input()\n mas.append(k)\n temp = []\n for j in range(len(k)):\n if k[j] == '#':\n temp.append(j)\n temp = tuple(temp)\n for k in df:\n if set(k) == set(temp) or set(k) & set(temp) == set():\n flag = True\n else:\n flag = False\n break\n if not flag:\n break\n df[temp] = 1\n\n\nif flag:\n print('Yes')\nelse:\n print('No')\n\n\n\n\n", "n, m = map(int, input().split())\r\nT = [[] for i in range(n)]\r\nfor i in range(n):\r\n a = list(input())\r\n T[i] = a\r\n\r\nR = [[] for i in range(n) ]\r\nfor i in range(n):\r\n for j in range(m):\r\n if T[i][j] == \"#\":\r\n R[i].append(j)\r\n\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if len(set(R[i]) & set(R[j])) == len(set(R[i])) or len(set(R[i]) & set(R[j])) == 0:\r\n continue\r\n else:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "r,c = map(int, input().split())\r\ngrid = [input() for x in range(r)]\r\n\r\nrows_checked = []\r\nblack_set = []\r\nfor i,row in enumerate(grid):\r\n index_black = [x for x,c in enumerate(row) if c == '#']\r\n black_set.append(index_black)\r\n\r\ndone = False\r\nfor b1 in black_set:\r\n for b2 in black_set:\r\n if b1 == b2: continue\r\n if any(x in b2 for x in b1):\r\n print ('No')\r\n done = True\r\n break\r\n if done:break\r\nelse:\r\n print ('Yes')", "def shapeToBin(a):\r\n o = 0\r\n for i in range(len(a)):\r\n o = o*2 + int(a[i]=='#')\r\n return o\r\nn, m = map(int, input().split())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n a.append(list(input()))\r\n b.append(shapeToBin(a[-1]))\r\nfor i in range(n):\r\n for j in range(m):\r\n for w in range(i+1, n):\r\n if a[i][j]==a[w][j]=='#' and b[i]!=b[w]:\r\n print(\"No\")\r\n raise SystemExit\r\n\r\nprint(\"Yes\")", "from itertools import product\r\nn,m=map(int,input().split())\r\nl=[]\r\nsatir={i:[] for i in range(n)}\r\nsutun={i:[] for i in range(m)}\r\nfor i in range(n):\r\n l.append(list(input()))\r\ng=[[\".\"]*m for _ in range(n)]\r\nfor i in range(n):\r\n for a in range(m):\r\n if l[i][a] == \"#\":\r\n satir[i].append(a)\r\n sutun[a].append(i)\r\n\r\nfor i in satir:\r\n sa=set()\r\n sa.add(i)\r\n\r\n su=set()\r\n for a in satir[i]:\r\n su.add(a)\r\n for k in sutun[a]:\r\n sa.add(k)\r\n res=product(sa,su)\r\n for a,b in res:\r\n g[a][b]=\"#\"\r\nif g==l:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "t=set(input()for _ in[0]*int(input().split()[0]))\r\nprint(['No','Yes'][all(sum(c<'.'for c in s)<2for s in zip(*t))])", "n, m = [int(i) for i in input().split()]\r\n\r\ndta = []\r\nfor i in range(n):\r\n dta.append(input())\r\ndta = set(dta)\r\n\r\nused = [0 for i in range(m)]\r\n\r\nfor row in dta:\r\n for i, col in enumerate(row):\r\n if col == '#':\r\n used[i] += 1\r\n\r\nif max(used) <= 1:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "st = input().split()\r\nn,m = int(st[0]),int(st[1])\r\nmap = [input() for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if map[i][j] == '#':\r\n for p in range(n):\r\n if p != i and map[p][j] == '#' and map[p] != map[i]:\r\n print('No')\r\n exit()\r\n\r\nprint('Yes')\r\n\r\n", "n,m = map(int, input().split())\r\n\r\nr = set()\r\nc = set()\r\nss=[]\r\nfor i in range(n):\r\n s = input()\r\n ss.append(s)\r\n\r\nfor i in range(n):\r\n s1 = set()\r\n for j in range(m):\r\n if ss[i][j] == '#':\r\n s1.add(j)\r\n for j in range(n):\r\n s2 = set()\r\n for k in range(m):\r\n if ss[j][k] == '#':\r\n s2.add(k)\r\n isi=len(s1.intersection(s2))\r\n if isi != 0 and (isi != len(s1) or isi != len(s2)):\r\n print('No')\r\n exit()\r\n\r\nfor i in range(m):\r\n s1 = set()\r\n for j in range(n):\r\n if ss[j][i] == '#':\r\n s1.add(j)\r\n for j in range(m):\r\n s2 = set()\r\n for k in range(n):\r\n if ss[k][j] == '#':\r\n s2.add(k)\r\n isi=len(s1.intersection(s2))\r\n if isi != 0 and (isi != len(s1) or isi != len(s2)):\r\n print('No')\r\n exit()\r\n\r\nprint('Yes')", "n, m = map(int, input().split())\r\ns = set((input() for _ in range(n)))\r\nfor c in zip(*s):\r\n\tif ''.join(c).count('#') > 1:\r\n\t\tprint(\"No\")\r\n#\r\n\t\texit()\r\nprint(\"Yes\")\r\n", "def findInArray(c, arr):\r\n\tind = []\r\n\tfor i in range(len(arr)):\r\n\t\tif arr[i] == c:\r\n\t\t\tind.append(i)\r\n\treturn ind\r\n\r\ndef solve():\r\n\tnumRows,numCols = map(int, input().strip().split())\r\n\r\n\tmat = [[0]*numCols for _ in range(numRows)]\r\n\t\r\n\tfor i in range(numRows):\r\n\t\tmat[i] = list(input().strip())\r\n\r\n\trows = [0] * numRows\r\n\tcols = [0] * numCols\r\n\r\n\tcounter = 1\r\n\tfor i in range(numRows):\r\n\t\tfor j in range(numCols):\r\n\t\t\tif mat[i][j] == '#':\r\n\t\t\t\tif rows[i] == 0 and cols[j] == 0:\r\n\t\t\t\t\trows[i] = counter\r\n\t\t\t\t\tcols[j] = counter\r\n\t\t\t\t\tmat[i][j] = counter\r\n\t\t\t\t\tcounter += 1\r\n\t\t\t\telse:\r\n\t\t\t\t\tif (rows[i] != 0 and cols[j] != 0) and rows[i] != cols[j]:\r\n\t\t\t\t\t\treturn 'No'\r\n\t\t\t\t\t\t\r\n\t\t\t\t\tc = max(rows[i], cols[j])\r\n\t\t\t\t\trows[i] = c\r\n\t\t\t\t\tcols[j] = c\r\n\t\t\t\t\tmat[i][j] = c\r\n\r\n\tfor c in range(1,counter):\r\n\t\trowsEqualToC = findInArray(c, rows)\r\n\t\tcolsEqualToC = findInArray(c, cols)\r\n\t\tfor i in rowsEqualToC:\r\n\t\t\tfor j in colsEqualToC:\r\n\t\t\t\tif (mat[i][j] != c):\r\n\t\t\t\t\treturn 'No'\t\t\r\n\r\n\treturn 'Yes'\r\n\r\ndef main():\r\n\tprint(solve())\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn,m=(int(i) for i in input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(input()))\r\nl1=[]\r\nl2=[]\r\nc=1\r\nfor i in range(n):\r\n l2=[]\r\n for j in range(m):\r\n if(l[i][j]=='#'):\r\n l2.append(j)\r\n for k in range(i):\r\n if(l2!=l1[k]):\r\n for x in range(len(l2)):\r\n if(l2[x] in l1[k]):\r\n c=0\r\n break\r\n if(c==0):\r\n break\r\n if(c==0):\r\n break\r\n else:\r\n l1.append(l2)\r\nif(c==1):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "# python3\nn, m = tuple(map(int, input().split()))\n\nmask = 0\ncollected = set()\n\nwhile n:\n n -= 1\n\n row = 0\n for char in input():\n row = (row << 1) | (char == '#')\n\n if row & mask:\n if row not in collected:\n print(\"No\")\n break\n else:\n mask ^= row\n collected.add(row)\nelse:\n print(\"Yes\")\n", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n s = str(input())\r\n checkedIndexes = set()\r\n for j in range(m):\r\n if s[j] == \"#\":\r\n checkedIndexes.add(j)\r\n a.append(checkedIndexes)\r\nisPossible = \"Yes\"\r\nfor i in range(n):\r\n if isPossible:\r\n for j in range(i + 1, n):\r\n intersection = a[i].intersection(a[j])\r\n if len(intersection) > 0:\r\n if a[i] != a[j]:\r\n isPossible = \"No\"\r\n break\r\nprint(isPossible)", "n,m=map(int,input().split())\nt=[set(i for i,c in enumerate(input())if c=='#')for _ in [0]*n]\nprint(['No','Yes'][all(x==y or not x&y for x in t for y in t)])", "n = 0\nm = 0\n\n\ndef esht(a, b ):\n\n global n, m\n\n for ptr in range(0 ,len(a)):\n if (a[ptr] is '#') and (a[ptr] == b[ptr]):\n return True\n return False\n\ndef main():\n global n , m\n n, m = [*map(int,input().split())]\n s = [\"\" for i in range(0,n)]\n for i in range(0,n):\n s[i] = input()\n ans = True\n for i in range(0,n):\n for j in range(i + 1 , n):\n if esht(s[i], s[j]) and s[i] != s[j]:\n ans = False\n if ans is True:\n print(\"Yes\")\n else:\n print(\"No\")\n\nmain()\n", "r,c=[int(x) for x in input().split()]\r\nm=[]\r\nfor i in range(r):\r\n m.append(input())\r\nm=list(set(m))\r\nn=len(m)\r\nx=[0]*c\r\nflag=0\r\nfor i in range(n):\r\n for j in range(c):\r\n if(m[i][j]=='#' and x[j]==0):\r\n x[j]+=1\r\n elif(m[i][j]==\"#\" and x[j]!=0):\r\n flag=1\r\n break\r\n if(flag):\r\n break\r\nif(flag):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "import sys\nn, m = [int(i) for i in input().split(\" \")]\ngrid = []\ncolumns_idx = set()\nlines_used = set()\nfor _ in range(n):\n line = input()\n grid.append(line)\n\nfor line in grid:\n if line not in lines_used:\n lines_used.add(line)\n for i,c in enumerate(line):\n if c=='#':\n if i in columns_idx:\n print(\"No\")\n sys.exit()\n else:\n columns_idx.add(i)\nprint(\"Yes\")\n", "arri = lambda: [int(s) for s in input().split()]\r\narrf = lambda: [float(s) for s in input().split()]\r\n\r\ndef f(s1, s2):\r\n have2 = False\r\n have1 = False\r\n for i in range( len(s1) ):\r\n if s1[i] == s2[i] == '#':\r\n have2 = True\r\n elif s1[i] == '#' and s2[i] != '#' or s2[i] == '#' and s1[i] != '#':\r\n have1 = True\r\n return not (have2 and have1)\r\nn, m = arri()\r\ns = [input() for i in range(n)]\r\n#print(s)\r\nflag = True\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n if not f(s[i], s[j]):\r\n flag = False\r\nprint('Yes' if flag else 'No')\r\n", "import sys\r\nimport math,bisect\r\nfrom collections import defaultdict\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,OrderedDict\r\n#input = iter(sys.stdin.buffer.read().decode().splitlines())._next_\r\ndef neo(): return map(int,input().split())\r\ndef Neo(): return list(map(int,input().split()))\r\nn,m = neo()\r\nA = []\r\nfor i in range(n):\r\n A.append(input())\r\nf = [False for i in range(m)]\r\nAl = set(A)\r\nfor r in Al:\r\n for c in range(len(r)):\r\n if r[c] == '#':\r\n if f[c]:\r\n print(\"No\")\r\n exit()\r\n else:\r\n f[c]=True\r\nprint(\"Yes\")\r\n", "n, m = [int(x) for x in input().split()]\ndic={}\ndi={}\nfor i in range(0,n):\n x=input()\n if x in di.keys():\n di[x]+=1\n else:\n di[x]=1\n\nfor i in range(0,m):\n dic[i]=0\n\nfl =1\nfor i in di:\n for j in range(0,len(i)):\n if i[j] == '#':\n if dic[j]==1:\n fl=0\n break\n else:\n dic[j]=1\n if fl==0:\n break\nif fl ==0:\n print('No')\nelse:\n print('yes')", "r, c = input().split(' ')\nr = int(r)\nc = int(c)\n\nst = [['0' for x in range(c)] for y in range(r)]\n\nfor i in range(r):\n st[i] = list(input())\n\nst2 = []\n\nfor i in range(c):\n st2 = []\n for j in range(r):\n if st[j][i] == '#':\n st2.append(j)\n if len(st2) > 1:\n # check if all rows at the index are equal\n for k in range(len(st2) - 1):\n val = st2[k:k+2]\n if st[val[0]] != st[val[1]]:\n print(\"No\")\n exit()\n \nprint(\"Yes\")\n\n\n", "from sys import stdin\r\ninput = stdin.readline\r\nfrom heapq import heapify,heappush,heappop,heappushpop\r\nfrom collections import defaultdict as dd, deque as dq,Counter as C\r\nfrom math import factorial as f ,ceil,gcd,sqrt,log\r\nfrom bisect import bisect_left as bl ,bisect_right as br\r\nfrom itertools import combinations as c,permutations as p\r\nfrom math import factorial as f ,ceil,gcd,sqrt,log\r\nmi = lambda : map(int,input().split())\r\nii = lambda: int(input())\r\nli = lambda : list(map(int,input().split()))\r\nmati = lambda r : [ li() for _ in range(r)]\r\nlcm = lambda a,b : (a*b)//gcd(a,b) \r\n\r\n\r\n\r\n\r\ndef solve():\r\n n,m=mi()\r\n arr=[]\r\n ans=\"Yes\"\r\n for x in range(n):\r\n arr.append([x for x in input().strip()])\r\n for x in range(n):\r\n for y in range(x+1,n):\r\n if arr[x]==arr[y]:\r\n continue\r\n else:\r\n for t in range(m):\r\n if arr[x][t]==arr[y][t] and arr[x][t]==\"#\":\r\n ans=\"No\"\r\n print(ans)\r\n return()\r\n print(ans)\r\n\r\nfor _ in range(1):\r\n solve()", "n, m = map(int, input().split())\r\n\r\nopTable = {}\r\nanswer = 'Yes'\r\nfor r in range(n):\r\n row = input()\r\n black = set()\r\n\r\n for i in range(m):\r\n if (row[i] == '#'):\r\n black.add(i)\r\n if (i not in opTable):\r\n opTable[i] = black\r\n\r\n for b in black:\r\n diff = black.symmetric_difference(opTable[b])\r\n if (len(diff) != 0):\r\n answer = 'No'\r\n break\r\n\r\n if (answer == 'No'):\r\n break\r\nprint(answer)", "n, m = map(int, input().split())\narray, Columns, count = [], [], 1\nfor i in range(n):\n\tarray.append(list(input()))\nwhile array!=[]:\n\tif array.count(array[0])>1:\n\t\telem = array[0]\n\t\tfor i in range(array.count(elem)):\n\t\t\tarray.remove(elem)\n\t\tfor k in range(elem.count('#')):\n\t\t\tindex = elem.index('#')\n\t\t\tColumns.append(index)\n\t\t\telem[index]='.'\n\telse:\n\t\telem = array[0]\n\t\tfor p in range(elem.count('#')):\n\t\t\tindex = elem.index('#')\n\t\t\tColumns.append(index)\n\t\t\telem[index]='.'\n\t\tarray.pop(0)\nfor i in range(int(len(Columns)/2)):\n\tif Columns.count(Columns[i])>count:\n\t\tcount=2\nif count==1:\n\tprint('Yes')\nelse:\n\tprint('No')\n\n\n\t\n\n", "N, M = map(int, input().split())\r\ngrid = []\r\nfor _ in range(N):\r\n grid.append(input())\r\n\r\nS = [set() for _ in range(N)]\r\n\r\nfor i in range(N):\r\n for j in range(M):\r\n if grid[i][j] == \"#\":\r\n S[i].add(j)\r\n\r\nsolved = [False for _ in range(N)]\r\nused = [False for _ in range(M)]\r\n\r\nfor i in range(N):\r\n if not solved[i]:\r\n for c in S[i]:\r\n if used[c]:\r\n print(\"No\")\r\n quit()\r\n used[c] = True\r\n for j in range(N):\r\n if S[i] == S[j]:\r\n solved[j] = True\r\n\r\nprint(\"Yes\")\r\n", "n, m = map(int, input().split())\r\ns = []\r\na = []\r\nfor i in range(n):\r\n s.append(input())\r\nfor i in range(n):\r\n k = 0\r\n for j in range(m):\r\n if s[i][j] == '#':\r\n k += 1 << j\r\n a.append(k)\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if a[i] != a[j] and a[i] & a[j]: \r\n print(\"no\")\r\n quit()\r\nprint(\"yes\")", "n,m=map(int,input().split())\r\nl=[0 for i in range(n)]\r\nans=[set() for i in range(n)]\r\nfor i in range(n):\r\n l[i]=input()\r\n for j in range(len(l[i])):\r\n if l[i][j]==\"#\":\r\n ans[i].add(j)\r\nx=False\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if ans[j]&ans[i]!=set():\r\n if (ans[i]-ans[j]!=set()) or (ans[j]-ans[i]!=set()):\r\n x=True\r\n break\r\n if x:\r\n break\r\nif x==True:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n \r\n", "n, m = map(int, input().split())\r\ns = {input() for i in range(n)}\r\nprint('No' if any(sum(si[j] == '#' for si in s) > 1 for j in range(m)) else 'Yes')", "#!/usr/bin/env python3\n\nimport sys\n\n[n, m] = map(int, sys.stdin.readline().strip().split())\ntable = [sys.stdin.readline().strip() for _ in range(n)]\n\nfirst_to_row = dict()\n\nposs = True\nfor row in table:\n\tfirst = row.find('#')\n\tif first in first_to_row:\n\t\tif first_to_row[first] != row:\n\t\t\tposs = False\n\t\t\tbreak\n\telse:\n\t\tfirst_to_row[first] = row\n\n\nif poss:\n\tcounts = [False for _ in range(m)]\n\tfor row in first_to_row.values():\n\t\tfor i in range(m):\n\t\t\tif row[i] == '#':\n\t\t\t\tif counts[i]:\n\t\t\t\t\tposs = False\n\t\t\t\t\tbreak\n\t\t\t\tcounts[i] = True\n\t\tif not poss:\n\t\t\tbreak\n\n\nif poss:\n\tprint ('Yes')\nelse:\n\tprint ('No')\n", "n, m = map(int, input().split())\nx = []\nfor i in range(n):\n\tq = []\n\ty = input()\n\tfor j in y:\n\t\tq.append(j)\n\tx.append(q)\nind = True\t\nfor i in range(n):\n\tfor j in range(m):\n\t\tif x[i][j] == \"#\":\n\t\t\tfor k in range(i + 1, n):\n\t\t\t\tif x[k][j] == \"#\" and x[k] != x[i]:\n\t\t\t\t\tind = False\n\t\t\t\t\tbreak\nif ind:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\t\t\t\t\n\n\n", "# cook your dish here\r\n# from math import * \r\n#for _ in range(int(input().strip())):\r\nn,m = map(int,input().split())\r\nl = []\r\n\r\nfor _ in range(n):\r\n s = input()\r\n se = set()\r\n for i in range(m):\r\n if s[i]=='#':\r\n se.add(i)\r\n l.append(se)\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if not (l[i] == l[j] or l[i]&l[j] == set() ):\r\n print(\"No\")\r\n exit(0)\r\nprint(\"Yes\") \r\n ", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nf=[False for i in range(m)]\r\nal=set(a)\r\nfor r in al:\r\n for c in range(len(r)):\r\n if r[c]=='#':\r\n if f[c]:\r\n print(\"No\")\r\n exit()\r\n else:\r\n f[c]=True\r\nprint(\"Yes\")\r\n\r\n", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n \r\nn,m = ilele()\r\nA = []\r\nfor i in range(n):\r\n s = input()\r\n B = set()\r\n for j in range(m):\r\n if s[j] == \"#\": B.add(j)\r\n A.append(B)\r\nf = 0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if A[i] != A[j] and len(A[i].intersection(A[j])) != 0:\r\n Yy(0)\r\n f = 1;break\r\n if f==1: break\r\nif f==0: Yy(1)", "from collections import defaultdict\r\nfrom math import *\r\nfrom sys import stdin\r\ninput = lambda: stdin.readline()[:-1]\r\ninp = lambda: list(map(int, input().split()))\r\n\r\nn, m = inp()\r\ngrid = []\r\nfor x in range(n): grid.append(input())\r\ndt = defaultdict(lambda: [])\r\nfor x in range(n):\r\n cur = []\r\n for y in range(m):\r\n if grid[x][y] == '#': cur.append(y)\r\n dt[tuple(cur)].append(x)\r\nret = []\r\nres = set()\r\nfor k in dt.keys(): \r\n ret += k\r\n for x in k: res.add(x)\r\nif sorted(ret) == sorted(list(res)): print(\"Yes\")\r\nelse: print(\"No\") ", "(n, m) = map(int, input().split())\r\n\r\nd = {}\r\nfor x in range(n):\r\n s = input()\r\n for y in range(len(s)):\r\n if s[y] == '#':\r\n if not x in d:\r\n d[x] = []\r\n d[x].append(y)\r\n\r\nflag = True\r\nfor (x, y) in d.items():\r\n for (i, j) in d.items():\r\n if x != i and y != j:\r\n for z in y:\r\n if z in j:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "import sys\r\n\r\nn_rows, n_cols = [int(x) for x in input().split(\" \")]\r\nmap = []\r\nfor i in range(n_rows):\r\n map.append(input())\r\n\r\nmap_lines = dict()\r\nactivated_cols = dict()\r\nfor line in map:\r\n activated = []\r\n for col_i, col in enumerate(line):\r\n if col == '#':\r\n activated.append(col_i)\r\n activated_str = \" \".join([str(x) for x in activated])\r\n if activated_str not in map_lines:\r\n for col in activated:\r\n if col in activated_cols:\r\n print(\"No\")\r\n sys.exit()\r\n else:\r\n activated_cols[col] = True\r\n map_lines[activated_str] = True\r\nprint(\"Yes\")\r\n", "li, co = map(int, input().split())\n\nm = [[j for j in input()] for i in range(li)]\n\nt = [[0 for j in range(li)] for i in range(co)]\n\nfor i in range(li):\n for j in range(co):\n t[j][i] = m[i][j]\n\n# for aux in m:\n# print(*aux)\n# print()\n#\n# for aux in t:\n# print(*aux)\n# print()\n\nflag = True\nfor i in range(li):\n if '#' in m[i]:\n k = m[i].index('#')\n for j in range(k+1, co):\n if m[i][j] == '#' and t[j] != t[k]:\n flag = False\n\nprint(\"Yes\" if flag else \"No\")\n", "import functools\r\nimport sys\r\n\r\n\r\n\r\n\r\n\r\ndef with_args(deco):\r\n @functools.wraps(deco)\r\n def wrapper(*args,**kwargs):\r\n def res(func):\r\n return deco(func,*args,**kwargs)\r\n return res\r\n return wrapper\r\n\r\n\r\n@with_args\r\ndef deco(func,str = \"я бесполезен\"):\r\n @functools.wraps(func)\r\n def res(*args,**kwargs):\r\n print(str,end = \"\\n\")\r\n return func(*args,**kwargs)\r\n return res\r\n\r\n@deco()\r\ndef id(x):\r\n return x\r\n\r\n\r\ndef fib(n):\r\n a = b = 1\r\n for i in range(n):\r\n yield a\r\n a,b = b,a+b\r\n\r\nn,m = map(int,input().split())\r\nvec = []\r\nfor i in range(n):\r\n s = input()\r\n res = set()\r\n for j in range(m):\r\n if s[j] =='#':\r\n res.add(j)\r\n vec.append(res)\r\n\r\nflag = False\r\nfor i in range(n):\r\n for j in range(i,n):\r\n a = vec[i].intersection(vec[j])\r\n flag = flag or (a!=vec[i] or a!=vec[j]) and a!=set()\r\n\r\n\r\nprint(\"No\" if flag else \"Yes\")", "n, m = list(map(int, input().split()))\n\ngrid = []\nfor i in range(n):\n l = input()\n grid.append(l)\n\n# print(grid)\ng = set(grid)\n# print(g)\n\ndef check_ok(i, g):\n count = 0\n for row in g:\n if row[i] == \"#\":\n count += 1\n if count >= 2:\n return False\n return count < 2\n\nans = True\nfor i in range(m):\n ans &= check_ok(i, g)\n if not(ans):\n break\nif ans:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "aa = (input()).split()\r\nxx = int(aa[0])\r\nyy = int(aa[1])\r\ndd = [0] * yy\r\nprime=[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]\r\nfflag = 0\r\nfor i in range (0,xx):\r\n ss= input()\r\n\r\n ll= []\r\n flag = 0\r\n for j in range(0, len(ss)):\r\n if ss[j]=='#':\r\n ll.append(j)\r\n\r\n if dd[j]>0:\r\n flag=1\r\n if flag == 0:\r\n mul = 0\r\n for j in range(0,len(ll)):\r\n dd[ll[j]]=i+1\r\n else:\r\n max = dd[ll[0]]\r\n for j in range(0, len(ll)):\r\n temp = dd[ll[j]]\r\n if temp!=max:\r\n print(\"No\")\r\n fflag = 1\r\n break\r\n else:\r\n for k in range(0,yy):\r\n if dd[k]==temp:\r\n if k not in ll:\r\n print(\"No\")\r\n fflag =1\r\n break\r\n if fflag==1:\r\n break\r\n if fflag==1:\r\n break\r\nif fflag==0:\r\n print(\"Yes\")\r\n\r\n\r\n", "\nn, m = map( int, input().split() )\n\nM = []\nfor i in range(n):\n\tM.append(input())\n\nAdj = [[] for i in range(n+m)]\n\nfor i in range(n):\n\tfor j in range(m):\n\t\tif M[i][j] == '#':\n\t\t\tAdj[i].append(n+j)\n\t\t\tAdj[n+j].append(i)\n\np = [-1]*(n+m)\ncomp = []\n\nanswer = 'Yes'\nfor i in range(n+m):\n\tif p[i] != -1:\n\t\tcontinue\n\n\tL = [i]\n\tcomp.append([])\n\n\tnumEdges = 0\n\tnumA = 0\n\tnumB = 0\n\twhile L:\n\t\tv = L.pop()\n\t\tcomp[-1].append((v, 'A') if v < n else (v-n, 'B'))\n\t\tif v < n:\n\t\t\tnumA += 1\n\t\telse:\n\t\t\tnumB += 1\n\n\t\tfor u in Adj[v]:\n\t\t\tnumEdges += 1\n\t\t\tif p[u] == -1 and u != i:\n\t\t\t\tp[u] = v\n\t\t\t\tL.append(u)\n\n\t#print(comp[-1], numA, numB, numEdges/2)\n\tif numEdges//2 != numA*numB:\n\t\tanswer = 'No'\n\nprint(answer)\n\n", "n,m=map(int,input().split(' '))\r\nl=[]\r\na=0\r\nfor i in range(0,n):\r\n s=input()\r\n st=set()\r\n for j in range(0,m):\r\n if s[j]=='#':\r\n st.add(j)\r\n if st not in l:\r\n l.append(st)\r\nfor i in range(0,len(l)):\r\n for j in range(i+1,len(l)):\r\n if l[i].intersection(l[j])!=set():\r\n a+=1\r\n break\r\nif a>=1:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n ", "n,m=map(int,input().split())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n l=input()\r\n r=list(l)\r\n a.append(r)\r\n b.append(l)\r\nfor j in range(m):\r\n s=[]\r\n for i in range(n): \r\n if a[i][j]==\"#\":\r\n s.append(b[i]) \r\n if len(list(set(s)))>1:\r\n print(\"No\")\r\n exit(0)\r\nprint(\"Yes\") ", "from collections import defaultdict as dd, deque\nimport sys\n\nR,C = map(int,input().split())\nA = [input() for i in range(R)]\nAt = [[A[i][j] for i in range(R)] for j in range(C)]\n\nD = dd(list)\n\nfor i,a in enumerate(A):\n D[a].append(i)\n\nfor a in D:\n I = D[a]\n J = [i for i,c in enumerate(a) if c=='#']\n\n for j in J:\n nI = [i for i in range(R) if A[i][j]=='#']\n if I != nI:\n print('No')\n sys.exit(0)\nprint('Yes')\n", "n, m = [int(i) for i in input().split()]\r\na, b, flag = [-1] * m, list(), True\r\nfor i in range(n):\r\n s = input()\r\n q = set()\r\n for j in range(len(s)):\r\n if s[j] == \"#\":\r\n q.add(j)\r\n for j in range(len(s)):\r\n if s[j] == \"#\":\r\n if a[j] == -1:\r\n a[j] = i\r\n else:\r\n if b[a[j]] != q:\r\n flag = False\r\n b.append(q)\r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n, m = map(int, input().split())\r\nxr = [list(input()) for _ in range(n)]\r\nxc = [list(col) for col in zip(*xr)]\r\n\r\ndef toIndexList(z):\r\n return [i for i,v in enumerate(z) if v == '#']\r\n \r\nyr = list(map(toIndexList, xr))\r\nyc = list(map(toIndexList, xc))\r\n\r\nzr = [i for i,v in enumerate(yr) if v]\r\nzc = [i for i,v in enumerate(yc) if v]\r\n\r\nwhile zr or zc:\r\n i = zr[0]\r\n k = yr[i][0]\r\n yes = all(map(lambda kk: yc[kk] == yc[k], yr[i])) and all(map(lambda ii: yr[ii] == yr[i], yc[k]))\r\n if not yes:\r\n print(\"No\")\r\n break\r\n zr = [ii for ii in zr if ii not in yc[k]]\r\n zc = [kk for kk in zc if kk not in yr[i]]\r\nelse: \r\n print(\"Yes\")", "def check_rows(first_row, second_row):\r\n coincide = 0\r\n not_coincide = 0\r\n for i in range(m):\r\n if first_row[i] == \"#\" or second_row[i] == \"#\":\r\n if first_row[i] == second_row[i]:\r\n coincide += 1\r\n else:\r\n not_coincide += 1\r\n return bool(coincide * not_coincide)\r\n \r\n\r\nn, m = [int(inp) for inp in input().split()]\r\nfield = []\r\nfor i in range(n):\r\n inp = input()\r\n field.append(list(inp))\r\n\r\nans = \"Yes\"\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if check_rows(field[i], field[j]):\r\n ans = \"No\"\r\n break\r\n else:\r\n continue\r\n break\r\nprint(ans)", "n,m = map(int,input().split())\nmat = []\nfor i in range(n):\n mat.append(input())\narr = [[] for i in range(n)]\ncol = [[] for i in range(m)]\np = True\nfor i in range(n):\n s = mat[i]\n for j in range(m):\n if s[j]=='#':\n arr[i].append(j)\n col[j].append(i)\n #print(arr)\n #print(col)\n for x in arr[i]:\n for y in col[x]:\n if y!=i:\n if arr[y]!=arr[i]:\n #print(y,i)\n #print(arr[y],arr[i])\n p = False\n break\n if not p:\n break\n if not p:\n break\nif p:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n", "import sys, math, os.path\r\n\r\nFILE_INPUT = \"B.in\"\r\nDEBUG = os.path.isfile(FILE_INPUT)\r\nif DEBUG: \r\n sys.stdin = open(FILE_INPUT) \r\n\r\ndef ni():\r\n return map(int, input().split(\" \"))\r\n\r\ndef nia(): \r\n return list(map(int,input().split()))\r\n\r\ndef log(x):\r\n if (DEBUG):\r\n print(x)\r\n\r\nn,m = ni()\r\n\r\na = [input() for x in range(n) ]\r\nlog(a)\r\nr = [[] for k in range(n)]\r\nc = [[] for k in range(m)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == '#':\r\n r[i] += [j]\r\n c[j] += [i]\r\n\r\nlog(r)\r\nlog(c)\r\n\r\ncheck = [True for x in range(n)]\r\nfor i in range(n):\r\n # print(i, r[i])\r\n for ci in r[i]:\r\n #check column ci\r\n for rii in c[ci]:\r\n if r[rii] != r[c[ci][0]]:\r\n print(\"No\")\r\n # print(r[rii])\r\n # print(r[c[ci][0]])\r\n sys.exit()\r\nprint(\"Yes\")", "n,m=map(int,input().split())\nt=set(input()for _ in [0]*n)\nprint(['No','Yes'][all(sum(c=='#'for c in s)<2for s in zip(*t))])", "n,m=map(int,input().split())\r\narr=[]\r\nfor _ in range(n):\r\n s=[el for el in input()]\r\n arr.append(s)\r\nseen=set()\r\nres=[[\".\" for _ in range(m)] for _ in range(n) ]\r\nfor i in range(n):\r\n for j in range(m):\r\n if (i,j) not in seen and arr[i][j]==\"#\":\r\n q=[(i,j)]\r\n r=set()\r\n c=set()\r\n while q:\r\n i,j=q.pop()\r\n seen.add((i,j))\r\n r.add(i)\r\n c.add(j)\r\n for p in range(m):\r\n # print(i,p)\r\n if (i,p) not in seen and arr[i][p]==\"#\":\r\n q.append((i,p))\r\n seen.add((i,p))\r\n for p in range(n):\r\n if (p,j) not in seen and arr[p][j]==\"#\":\r\n q.append((p,j))\r\n seen.add((p,j))\r\n for el in r:\r\n for el1 in c:\r\n res[el][el1]=\"#\"\r\nf=False\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j]!=res[i][j]:\r\n f=True\r\nif f:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n \r\n ", "n,m=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n s=input()\r\n l.append(s)\r\nl=set(l)\r\nl1=list(l)\r\nn=len(l1)\r\nx=[]\r\nfor _ in range(m):\r\n x.append(0)\r\nflag=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(l1[i][j]=='#' and x[j]==0):\r\n x[j]=x[j]+1\r\n elif(l1[i][j]=='#' and x[j] != 0):\r\n flag=1\r\n if flag==1:\r\n break\r\nif flag==1:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n", "n, m = map(int, input().split())\r\na = list()\r\nfor i in range(n):\r\n a.append(list(input()))\r\n for j in range(m):\r\n if a[i][j] == \"#\":\r\n a[i][j] = 1\r\n else:\r\n a[i][j] = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n equal = True\r\n without_match = True\r\n for k in range(m):\r\n if a[j][k] != a[i][k]:\r\n equal = False\r\n if a[j][k] == 1 and a[i][k] == 1:\r\n without_match = False\r\n if equal or without_match:\r\n continue\r\n else:\r\n print(\"No\")\r\n exit(0)\r\nprint(\"Yes\")# 1696438034.2147236", "BLACK, WHITE = \"#\", \".\"\nn, m = list(map(int, input().split()))\nblacks = [{i for i, c in enumerate(input()) if c == BLACK} for i in range(n)]\nanswer = \"Yes\"\nfor i in range(n):\n for j in range(i):\n if blacks[i] & blacks[j] and blacks[i] != blacks[j]:\n answer = \"No\"\nprint(answer)", "#!/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\nr, c = rint()\n\nmat = []\nfor i in range(r):\n tmp = input()\n tmp = \"\".join([\"0\" if s is \".\" else \"1\" for s in tmp])\n mat.append(tmp)\nfor i in range(r):\n l = mat[i]\n li = int(l,2)\n if li == 0:\n continue\n for j in range(i, r):\n l = mat[j]\n lj = int(l,2)\n if li & lj != 0 and li != lj:\n print(\"No\")\n exit()\n\nprint(\"Yes\")", "n,m=map(int,input().split())\r\na=[[1 if j==\"#\" else 0 for j in input()] for i in range(n)]\r\ndc={}\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j]:\r\n try:\r\n dc[j].append(i)\r\n except:\r\n dc[j]=[i]\r\ns1=set()\r\ns2=set()\r\nfor i in dc:\r\n for j in dc[i]:\r\n if j in s1:\r\n break\r\n else:\r\n for j in dc[i]:\r\n s1.add(j)\r\n s2.add(tuple(dc[i]))\r\n continue\r\n if tuple(dc[i]) in s2:\r\n continue\r\n else:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "# python3\n\ndef readline(): return tuple(map(int, input().split()))\n\n\ndef main():\n n, m = readline()\n unique_rows = list()\n\n first_occ = [None] * m\n\n while n:\n n -= 1\n row = input()\n saved = None\n for (i, char) in enumerate(row):\n if char == '#':\n if first_occ[i] is not None:\n if row != unique_rows[first_occ[i]]:\n return False\n else:\n break\n else:\n if saved is None:\n unique_rows.append(row)\n saved = len(unique_rows) - 1\n first_occ[i] = saved\n else:\n assert char == '.'\n\n return True\n\n\nprint(\"Yes\" if main() else \"No\")\n", "n, m = map(int, input().split())\r\nL = []\r\nfor i in range(n):\r\n line = input()\r\n x = set()\r\n for j in range(m):\r\n if line[j] == '#':\r\n x.add(j)\r\n for o in L:\r\n if o & x and o != x:\r\n print('No')\r\n exit(0)\r\n L.append(x)\r\nprint('Yes')", "n, m = map(int, input().split())\r\nt = [0]*n\r\n\r\nfor j in range(n):\r\n s = input()\r\n for i in range(len(s)):\r\n t[j] += int(s[i] == \"#\")\r\n t[j] *= 2\r\n \r\nans = True\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if (t[i] & t[j]) != 0:\r\n if t[i] != t[j]:\r\n ans = False\r\n\r\nif ans:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "def func(ss):\r\n occured = set()\r\n for pr, s in zip(['']+ss[:-1], ss):\r\n if pr == s:\r\n continue\r\n for i, el in enumerate(s):\r\n if el == \"#\":\r\n if i in occured:\r\n return False\r\n occured.add(i)\r\n return True\r\n\r\nn, m = [int(x) for x in input().split()]\r\nss = [input() for _ in range(n)]\r\nss.sort()\r\nprint(\"Yes\" if func(ss) else \"No\")\r\n", "n,m = map(int, input().split())\r\n\r\nx = []\r\nfor i in range(n):\r\n l = list(input())\r\n x.append(l)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[i] != x[j]:\r\n for z in range(m):\r\n if x[i][z] == x[j][z] == '#':\r\n print('No')\r\n exit()\r\n\r\nprint('Yes')", "n, m = map(int, input().split())\r\ns = [input() for _ in range(n)]\r\nl = []\r\n \r\nfor i in range(n):\r\n se = set()\r\n \r\n for j in range(m):\r\n if s[i][j]=='#':\r\n se.add(j)\r\n \r\n for li in l:\r\n if len(se&li)!=0 and se!=li:\r\n print('No')\r\n exit()\r\n \r\n l.append(se)\r\n \r\nprint('Yes')", "import re\r\n\r\nn, m = map(int, input().split())\r\nrows = [input() for _ in range(n)]\r\n\r\ncols = set()\r\n\r\nwhile (rows):\r\n r = rows.pop()\r\n# print(\"ROW: \", r)\r\n if (r.find('#') >= 0):\r\n # at least one # in line\r\n # Check if not in columns\r\n c = set([occ.start() for occ in re.finditer('#', r)])\r\n if c & cols: # reusing column\r\n print(\"No\")\r\n break\r\n cols |= c\r\n rows = [o for o in rows if o != r]\r\n# print(\" remaining: \", cols, rows)\r\nelse:\r\n print(\"Yes\")\r\n", "n,m=map(int,input().split())\r\narr=[0]*n\r\nmp={}\r\nfor i in range(n):\r\n\tarr[i]=input()\r\n\tt=\"\"\r\n\tl=[]\r\n\tfor j in range(m):\r\n\t\tif arr[i][j]==\"#\":\r\n\t\t\tl.append(j)\r\n\t\t\tt+=str(j)\r\n\tif t not in mp:\r\n\t\tmp[t]=set()\r\n\t\tfor y in range(len(l)):\r\n\t\t\tmp[t].add(l[y])\r\n\t\tmp[t].add(\"r\"+str(i))\r\n\telse:\r\n\t\tmp[t].add(\"r\"+str(i))\r\nk=mp[t]\r\nfor i in mp:\r\n\t# print(mp[i])\r\n\tif i != t:\r\n\t\tif len(k.intersection(mp[i]))>0:\r\n\t\t\tprint(\"No\")\r\n\t\t\texit()\r\n\t\telse:\r\n\t\t\tfor j in mp[i]:\r\n\t\t\t\tk.add(j)\r\nprint(\"Yes\")\r\n", "used =[]\r\na = []\r\ndef dfs(v, c):\r\n vert = v + 100*c\r\n if used[vert] == 0:\r\n used[vert] = 1\r\n a[c].append(v)\r\n for i in range(0, len(g[vert])):\r\n if used[g[vert][i]] == 0:\r\n dfs(g[vert][i] - (1-c)*100, 1-c)\r\n \r\n \r\n\r\nn,m = map(int, input().split())\r\nr = []\r\nfor i in range(0,n):\r\n s = input()\r\n r.append(s)\r\ng = []\r\nfor i in range (0,200):\r\n g.append([])\r\n used.append(0)\r\nfor i in range (0,n):\r\n for j in range (0,m):\r\n if(r[i][j] == \"#\"):\r\n g[i].append(100 + j)\r\n g[100+j].append(i)\r\n#print(g)\r\nfor i in range(0,n):\r\n a = [[],[]]\r\n dfs(i,0)\r\n #print(a)\r\n for j in range (0, len(a[0])):\r\n for k in range (0, len(a[1])):\r\n if(r[a[0][j]][a[1][k]] != \"#\"):\r\n print (\"NO\")\r\n raise SystemExit\r\nprint(\"YES\")\r\n", "T = input().split(' ')\r\nn = int(T[0])\r\nm = int(T[1])\r\ntab = []\r\nfor i in range(n):\r\n t = input()\r\n row = []\r\n for j in range(m):\r\n if t[j]=='.':\r\n row.append(0)\r\n else:\r\n row.append(1)\r\n tab.append(row)\r\nb = True\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n c1 = False\r\n c2 = False\r\n for k in range(m):\r\n if tab[i][k]==1 and tab[j][k]==1:\r\n c1 = True\r\n if tab[i][k] + tab[j][k]==1:\r\n c2 = True\r\n if c1 and c2:\r\n b = False\r\nif b:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n, m = map(int, input().split())\r\nst = []\r\nfor i in range(n):\r\n s = input()\r\n x = set()\r\n for j in range(m):\r\n if s[j] == '#':\r\n x.add(j)\r\n for i in st:\r\n if len(i & x) > 0 and i != x:\r\n print('No')\r\n exit()\r\n st.append(x)\r\nprint('Yes')\r\n", "pairs= [int(s) for s in input().split(\" \")]\r\nR = int(pairs[0])\r\nC = int(pairs[1])\r\n\r\ndef convert(s):\r\n if s == '.':\r\n return 0\r\n else:\r\n return 1\r\nlines =[]\r\nmatrix = []\r\nfor i in range(R):\r\n inpt= input()\r\n lines.append(inpt.replace('.', 'D'))\r\n matrix.append([convert(s) for s in list(inpt)])\r\n\r\n\r\ncan = True\r\nfor i in range(R):\r\n if 1 not in matrix[i]:\r\n pass\r\n step_R = []\r\n step_C = []\r\n for j in range(C):\r\n if matrix[i][j]==1:\r\n step_C.append(j)\r\n\r\n for j_ in step_C:\r\n for i_ in range(R):\r\n if matrix[i_][j_] == 1:\r\n step_R.append(i_)\r\n\r\n\r\n for i_ in step_R:\r\n indices = [i for i, x in enumerate(matrix[i_]) if x == 1]\r\n if indices != step_C:\r\n can = False\r\n break\r\n\r\n indices=[]\r\n for j_ in step_C:\r\n for i_ in range(R):\r\n if matrix[i_][ j_] == 1:\r\n indices.append(i_)\r\n\r\n if indices != step_R:\r\n can = False\r\n break\r\n\r\n if can == False:\r\n break\r\n\r\n for i_ in step_R:\r\n for j_ in step_C:\r\n matrix[i_][ j_] = 0\r\n\r\nif can == True:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n,m=map(int,input().split())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n a.append(input())\r\n s=''\r\n for j in a[i]:\r\n if j=='#':\r\n s+='1'\r\n else:\r\n s+='0'\r\n b.append(s)\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if a[i]!=a[j]:\r\n if '2' in str(int(b[i]) + int(b[j])):\r\n print('No')\r\n exit()\r\nprint('Yes')\r\n ", "n, m = map(int, input().split())\r\np = [list(input()) for _ in range(n)]\r\n\r\nfor i in range(n):\r\n column = []\r\n for j in range(m):\r\n if p[i][j] == '#':\r\n column.append(j)\r\n st1 = ''\r\n for pos, el in enumerate(column):\r\n st = ''\r\n for k in range(n):\r\n st += p[k][el]\r\n if pos == 0:\r\n st1 = st\r\n elif st1 != st:\r\n print('No')\r\n break\r\n else:\r\n continue\r\n break\r\nelse:\r\n print('Yes')" ]

[ "import sys\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\n\r\nn, m, w = RI()\r\nnums = list(RI())\r\nd = [0] * n\r\nd[0] = nums[0]\r\nfor i in range(1, n):\r\n d[i] = nums[i] - nums[i - 1]\r\n\r\n# 校验min(a)为x能不能行\r\ndef check(x):\r\n if min(nums) >= x:\r\n return True\r\n dd = d[:]\r\n # 先从左往右来一遍\r\n c_left = c_right = a = 0\r\n for i in range(n):\r\n # 目前新的nums[i]为a\r\n a += dd[i]\r\n if a < x:\r\n c_left += x - a\r\n dd[i] += x - a\r\n if i + w < n:\r\n dd[i + w] -= x - a\r\n a += x - a\r\n\r\n return c_left <= m\r\n\r\nl, r = 1, min(nums) + m\r\n\r\nwhile l < r:\r\n mid = (r - l + 1) // 2 + l\r\n if not check(mid):\r\n r = mid - 1\r\n else:\r\n l = mid\r\nprint(l)", "def check(a, diff, n, m, w, up):\r\n preSum, ans = 0, 0\r\n for i in range(1, n + 1):\r\n preSum += diff[i]\r\n if preSum < up:\r\n ans += up - preSum\r\n diff[i] = up - preSum\r\n if i + w <= n:\r\n diff[i + w] -= up - preSum\r\n preSum = up\r\n for i in range(1, n + 1):\r\n diff[i] = a[i] - a[i - 1]\r\n return ans <= m\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m, w = list(map(int, input().strip().split()))\r\n a = [0] + list(map(int, input().strip().split()))\r\n diff = [0] * (n + 1)\r\n for i in range(1, n + 1):\r\n diff[i] = a[i] - a[i - 1]\r\n left, right, res = min(a[1:]), max(a[1:]) + m, -1\r\n while left <= right:\r\n mid = left + (right - left) // 2\r\n if check(a, diff, n, m, w, mid):\r\n res = mid\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n print(res)", "R = lambda: map(int, input().split())\r\nn, m, w = R()\r\narr = list(R())\r\nl, r = min(arr), min(arr) + m\r\nwhile l < r:\r\n mid = (l + r + 1) // 2\r\n acc, h = 0, [0] * (w + n)\r\n for i in range(n):\r\n acc += h[i]\r\n h[i + w] -= max(0, mid - arr[i] - acc)\r\n acc -= h[i + w]\r\n if -sum(h) > m:\r\n r = mid - 1\r\n else:\r\n l = mid\r\nprint(l)", "def can_smallest_grow_to_height(n, m, w, middle, heights):\n accumulated = 0\n days = 0\n decreasing = [0] * n\n\n for i in range(n):\n accumulated -= decreasing[i]\n\n if heights[i] > middle:\n continue\n\n difference = middle - heights[i] - accumulated\n\n if difference > 0:\n if m - days < difference:\n return False\n \n days += difference\n accumulated += difference\n\n if i + w < n:\n decreasing[i + w] = difference\n \n return True \n\ndef main():\n n, m, w = map(int, input().split())\n heights = list(map(int, input().split()))\n min_height = min(heights)\n max_height = max(map(lambda x: x + m, heights))\n answer = 0\n\n while min_height <= max_height:\n middle = (min_height + max_height) // 2\n\n if can_smallest_grow_to_height(n, m, w, middle, heights):\n answer = middle\n min_height = middle + 1\n else:\n max_height = middle - 1\n\n print(answer)\n\nmain()\n\n\t\t\t\t \t\t \t \t\t\t \t\t \t\t\t\t", "\r\n\r\nn,w,ln=map(int, input().split())\r\n\r\nl=list(map(int, input().split()))\r\n\r\ndef ss(m):\r\n t=[0 for _ in range(n)]\r\n \r\n x=0 \r\n for index in range(n):\r\n # if m==3:\r\n # print(t, x)\r\n if index>0:\r\n t[index]+=t[index-1]\r\n f=l[index]+t[index]\r\n if f>=m:\r\n continue \r\n else:\r\n y=m-f \r\n if x+y>w:\r\n return False\r\n else:\r\n x+=y \r\n t[index]+=y \r\n if index+ln<n:\r\n t[index+ln]-=y \r\n return True \r\n\r\ni=0 \r\nj=10**9 + 10**5 \r\nans=0 \r\nwhile i<=j:\r\n m=(i+j)//2 \r\n if ss(m):\r\n ans=m \r\n i=m+1 \r\n else:\r\n j=m-1 \r\n\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n \r\n", "global d,c,lst\r\n\r\ndef gd(a):\r\n v=[0]*(len(lst)+1)\r\n mv=0\r\n tmp=0\r\n for i in range(n):\r\n if i-c>=0:\r\n tmp-=v[i-c]\r\n if lst[i]+tmp<a:\r\n v[i]=a-lst[i]-tmp\r\n tmp+=v[i]\r\n mv+=v[i]\r\n if mv>d:\r\n return 0\r\n if mv<=d:\r\n return True\r\n return False\r\n\r\ndef solve():\r\n lft=1\r\n rt=10**10\r\n ans=0\r\n while (lft<=rt):\r\n md=(lft+rt)//2\r\n #print(md)\r\n if gd(md)==True:\r\n ans=md\r\n lft=md+1\r\n else:\r\n rt=md-1\r\n return ans\r\n\r\nn,d,c=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nprint(solve())\r\n", "import random\r\nimport sys\r\nfrom math import gcd, lcm, sqrt, isqrt, perm, comb, factorial\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import lru_cache, reduce, cmp_to_key\r\nfrom itertools import accumulate, combinations, permutations\r\nfrom heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush\r\nfrom copy import deepcopy\r\nfrom bisect import bisect_left, bisect_right\r\nfrom string import ascii_lowercase, ascii_uppercase\r\ninf = float('inf')\r\ninput = lambda: sys.stdin.readline().strip()\r\nI = lambda: input()\r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLI = lambda: list(input().split())\r\nLII = lambda: list(map(int, input().split()))\r\nGMI = lambda: map(lambda x: int(x) - 1, input().split())\r\nLGMI = lambda: list(map(lambda x: int(x) - 1, input().split()))\r\nMOD = 10**9+7\r\n\r\ndef solve():\r\n n, m, w = MII()\r\n a = LII()\r\n def check(v):\r\n diff = [0] * n\r\n need = sum_d = 0\r\n for i, x in enumerate(a):\r\n sum_d += diff[i]\r\n delta = v-x-sum_d\r\n if delta > 0:\r\n need += delta\r\n sum_d += delta\r\n if need > m:\r\n return False\r\n if i+w<n:\r\n diff[i+w] -= delta\r\n return True\r\n\r\n left, right = min(a)-1, min(a)+m+1\r\n while left+1 != right:\r\n mid = (left+right)//2\r\n if check(mid):\r\n left = mid\r\n else:\r\n right = mid\r\n print(left)\r\n\r\n return\r\n\r\nsolve()\r\n", "n, m, w = map(int, input().split())\nh = [0]*(n+1)\ndis = [0]*(n+1)\ni = 1\nl = int(1e9+5)\nr = -1\nfor v in map(int, input().split()):\n h[i] = v\n dis[i] = h[i]-h[i-1] # 差分数组\n l = min(h[i], l)\n r = max(h[i], r)\n i += 1\n \nr += m+1\n\ndef check(x):\n cur = sumd = 0\n for i in range(1, n+1):\n cur += dis[i] # 此时cur就为h[i]\n if cur < x: # 此时区间[i, i+w-1]中的所有数都要加\n sumd += x-cur # 最少的添加次数\n dis[i] += x-cur\n if i+w <= n:\n dis[i+w] -= x-cur\n cur += x-cur\n return sumd <= m\n\nres = 0\n\nwhile l <= r:\n mid = (l+r)>>1\n if check(mid):\n res = mid\n l = mid+1\n else:\n r = mid-1\n for i in range(1, n+1):\n dis[i] = h[i]-h[i-1]\n\nprint(res)\n\n\n", "n,m,w = list(map(int,input().strip().split()))\r\na = list(map(int,input().strip().split()))\r\nleft = 0\r\nright = 10**10\r\ndef check(x):\r\n sub = [0]*(n + 1)\r\n cnt = 0\r\n for i in range(n):\r\n sub[i] += sub[i - 1]\r\n if a[i] + sub[i] < x:\r\n diff = x - a[i] - sub[i]\r\n cnt += diff\r\n sub[i] += diff\r\n sub[min(i + w,n)] -= diff\r\n return cnt <= m\r\n\r\nwhile left <= right:\r\n mid = (left + right)//2\r\n if check(mid):\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\nprint(right)\r\n", "import sys\r\nfrom typing import Callable\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().rstrip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(*x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n\r\nclass BinarySearch:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def find_int_left(low: int, high: int, check: Callable) -> int:\r\n # 模板: 整数范围内二分查找，选择最靠左满足check\r\n while low < high - 1:\r\n mid = low + (high - low) // 2\r\n if check(mid):\r\n high = mid\r\n else:\r\n low = mid\r\n return low if check(low) else high\r\n\r\n @staticmethod\r\n def find_int_right(low: int, high: int, check: Callable) -> int:\r\n # 模板: 整数范围内二分查找，选择最靠右满足check\r\n while low < high - 1:\r\n mid = low + (high - low) // 2\r\n if check(mid):\r\n low = mid\r\n else:\r\n high = mid\r\n return high if check(high) else low\r\n\r\n @staticmethod\r\n def find_float_left(\r\n low: float,\r\n high: float,\r\n check: Callable,\r\n error=1e-6) -> float:\r\n # 模板: 浮点数范围内二分查找, 选择最靠左满足check\r\n while low < high - error:\r\n mid = low + (high - low) / 2\r\n if check(mid):\r\n high = mid\r\n else:\r\n low = mid\r\n return low if check(low) else high\r\n\r\n @staticmethod\r\n def find_float_right(\r\n low: float,\r\n high: float,\r\n check: Callable,\r\n error=1e-6) -> float:\r\n # 模板: 浮点数范围内二分查找, 选择最靠右满足check\r\n while low < high - error:\r\n mid = low + (high - low) / 2\r\n if check(mid):\r\n low = mid\r\n else:\r\n high = mid\r\n return high if check(high) else low\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, m, w = ac.read_ints()\r\n nums = ac.read_list_ints()\r\n\r\n def check(x):\r\n diff = [0] * n\r\n res = 0\r\n for i in range(n):\r\n if i:\r\n diff[i] += diff[i - 1]\r\n cur = diff[i] + nums[i]\r\n if cur < x:\r\n res += x - cur\r\n diff[i] += x - cur\r\n if i + w < n:\r\n diff[i + w] -= x - cur\r\n if res > m:\r\n return False\r\n return True\r\n\r\n ans = BinarySearch().find_int_right(min(nums), max(nums) + m, check)\r\n ac.st(ans)\r\n return\r\n\r\n\r\nSolution().main()\r\n", " \r\nn,m,w = map(int, input().split())\r\n \r\na = list(map(int, input().split()))\r\n \r\nl = min(a)\r\n \r\nprev_dos = [0]*n\r\n \r\nr = l + m\r\n \r\n \r\nwhile r >= l:\r\n mid = (l+r) // 2\r\n \r\n done = 0\r\n \r\n days = m\r\n \r\n for i in range(n):\r\n if i >= w: done -= prev_dos[i-w]\r\n \r\n prev_dos[i] = max(mid-a[i]-done, 0)\r\n \r\n done += prev_dos[i]\r\n \r\n days -= prev_dos[i]\r\n \r\n if days < 0:\r\n r = mid - 1\r\n break\r\n else:\r\n l = mid + 1\r\nprint(r)", "n, m, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nl = 1\r\nr = 10**18\r\n\r\nwhile l < r:\r\n x = (r-l)//2 + l\r\n y = 0\r\n days = 0\r\n b = [0]*2*n\r\n for i in range(n):\r\n y += b[i]\r\n if a[i] + y < x:\r\n days += x - a[i] - y\r\n if i+w < 2*n:\r\n b[i+w] -= x - a[i] - y\r\n y += x - a[i] - y\r\n if days > m:\r\n r = x\r\n else:\r\n l = x + 1\r\n\r\nprint(l - 1)", "import sys\r\n#import threading\r\n#sys.setrecursionlimit(10**8)\r\n#threading.stack_size(10**8)\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Present():\r\n def check_min_ht_possible(min_ht,sequence,m,w):\r\n n = len(sequence)\r\n increasing_sum = [-1]*n \r\n watering_days_left = m \r\n\r\n for index,ht in enumerate(sequence):\r\n \r\n current_increase = 0 \r\n\r\n if index >= 1:\r\n current_increase += increasing_sum[index-1]\r\n if (index - w) >= 0:\r\n current_increase -= increasing_sum[index-w]\r\n \r\n current_ht = ht + current_increase\r\n #print(ht, current_ht, current_increase)\r\n\r\n if current_ht < min_ht:\r\n watering_days_nedded = min_ht - current_ht\r\n\r\n if watering_days_nedded <= watering_days_left:\r\n\r\n if index == 0:\r\n increasing_sum[index] = watering_days_nedded \r\n else:\r\n increasing_sum[index] = increasing_sum[index-1] + watering_days_nedded\r\n \r\n watering_days_left -= watering_days_nedded \r\n\r\n #print(ht , watering_days_left)\r\n \r\n else:\r\n return False \r\n \r\n else:\r\n if index == 0:\r\n increasing_sum[index] = 0\r\n else:\r\n increasing_sum[index] = increasing_sum[index-1]\r\n \r\n return True \r\n\r\n n,m,w = invr()\r\n sequence = inlt()\r\n\r\n check_min_ht_possible(2,sequence,n,w)\r\n\r\n\r\n l = 2 \r\n r = (10**9) + (10**5)\r\n\r\n while l <= r: \r\n mid = (l+r)//2\r\n\r\n if check_min_ht_possible(mid,sequence,m,w):\r\n l = mid + 1 \r\n else:\r\n r = mid - 1 \r\n \r\n if check_min_ht_possible(mid,sequence,m,w):\r\n print(mid)\r\n else:\r\n print(mid-1)\r\n \r\n return\r\n\r\nPresent()", "n,m,w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ndef check(up: int) -> bool:\r\n diff = [0] * (n+1)\r\n sm = 0\r\n cap = m\r\n for i, x in enumerate(a):\r\n sm += diff[i]\r\n curr = x + sm\r\n if(curr < up):\r\n cap -= up - curr\r\n if(cap < 0):\r\n return False\r\n sm += up - curr\r\n diff[min(n,i+w)] -= up - curr\r\n return True\r\n\r\nleft, right = min(a), max(a) + m\r\nwhile(left <= right):\r\n mid = (left + right) // 2\r\n if(check(mid)):\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\nprint(right)", "n,q,w = map(int,input().split())\r\na = list(map(int,input().split())) \r\n\r\nl = 0 \r\nr = 10**10 \r\n\r\nwhile(r>=l):\r\n m = (l+r)//2 \r\n b = [a[0]] \r\n for i in range(1,n):\r\n b.append(a[i]-a[i-1]) \r\n b.append(0)\r\n x = 0 \r\n z = 0 \r\n for i in range(n):\r\n x+=b[i] \r\n if (x>=m):\r\n continue\r\n else:\r\n y = m-x \r\n z+=y \r\n x+=y \r\n b[min(i+w,n)]-=y \r\n if (q>=z):\r\n res = m \r\n l = m +1 \r\n else:\r\n r = m-1 \r\nprint(res)", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nn, m, w = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nl, r = 1, 1000100001 # [)\r\nwhile l < r - 1:\r\n mid = (l + r) // 2\r\n diff = [0] * n\r\n cnt = 0\r\n tmp = 0\r\n for i in range(n):\r\n tmp += diff[i]\r\n need = mid - tmp - a[i]\r\n if need > 0:\r\n cnt += need\r\n if cnt > m:\r\n break\r\n tmp += need\r\n if i + w < n:\r\n diff[i + w] -= need\r\n if cnt > m:\r\n r = mid\r\n else:\r\n l = mid\r\nprint(l)", "import sys\r\nn,m,w=list(map(int,sys.stdin.readline().split()))\r\na=list(map(int,sys.stdin.readline().split()))\r\n\r\ndef check(x:int)->bool:\r\n diff=[0]*(n+10)\r\n cnt=0\r\n s=0\r\n for i in range(n):\r\n s+=diff[i]\r\n if s+a[i]<x:\r\n d=x-s-a[i] #需要在[i,i+w]处增加d次1\r\n cnt+=d\r\n s+=d\r\n if i+w<n:\r\n diff[i+w]-=d\r\n return cnt<=m\r\n\r\nl=0\r\nr=int(2e9)+10\r\nwhile l<r:\r\n mid=(l+r+1)//2\r\n if check(mid):\r\n l=mid\r\n else:\r\n r=mid-1\r\nprint(r)" ]

[ "n=int(input())\r\np=lambda a,b:print(a+1,b+1)\r\nb=[0,1]\r\nif n%4>1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tfor i in range(n%4,n,4):\r\n\t\tfor x in b:\r\n\t\t\ta=2*x\r\n\t\t\tfor j in range(i):p(j,i+a)\r\n\t\t\tp(i+a,i+a+1)\r\n\t\t\tfor j in range(i,0,-1):p(j-1,i+a+1)\r\n\t\t[p(i+y,i+(y^(3-x))) for x in b for y in b]", "n = int(input())\r\np = lambda a,b: print(a+1,b+1)\r\nif n % 4 > 1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tfor i in range(n%4,n,4):\r\n\t\tfor x in range(2):\r\n\t\t\tfor j in range(i): p(j,i+2*x)\r\n\t\t\tp(i+2*x,i+2*x+1)\r\n\t\t\tfor j in range(i,0,-1): p(j-1,i+2*x+1)\r\n\t\tp(i,i+3)\r\n\t\tp(i+1,i+2)\r\n\t\tp(i,i+2)\r\n\t\tp(i+1,i+3)", "n = int(input())\np = lambda a, b: print(a + 1, b + 1)\nb = [0, 1]\nif n % 4 > 1:\n print(\"NO\")\nelse:\n print(\"YES\")\n for i in range(n % 4, n, 4):\n for x in b:\n a = 2 * x\n for j in range(i):\n p(j, i + a)\n p(i + a, i + a + 1)\n for j in range(i, 0, -1):\n p(j - 1, i + a + 1)\n [p(i + y, i + (y ^ (3 - x))) for x in b for y in b]\n\n\t\t \t\t\t \t\t \t\t\t\t \t \t\t\t \t \t\t" ]

[ "# LUOGU_RID: 112712157\nn = int(input())\nSum = 0\nfor _ in range(n):\n [x, y] = [float(i) for i in input().split()]\n Sum += y\nprint(5 + Sum / n)\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\nn = int(input())\r\ns = 0\r\nfor i in range(n):\r\n x,y = list(map(float,input().split()))\r\n s+=y\r\nprint(str(5+s/n)+\"\\n\")\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-04 23:21:01\nLastEditTime: 2021-11-04 23:24:08\nDescription: On a plane\nFilePath: CF409G.py\n'''\n\n\ndef func():\n n = int(input())\n total = 0\n for _ in range(n):\n x, y = map(float, input().strip().split())\n total += y\n print(\"%.3f\" % (total / n + 5))\n\n\nif __name__ == '__main__':\n func()\n", "n = int(input())\r\nsum = 0\r\nfor _ in range(n):\r\n sum += [float(i) for i in input().split(\" \")][1]\r\nprint(5 + sum/n)", "# LUOGU_RID: 113633668\na=int(input());d=0\nfor i in range(a):\n b,c=list(map(float,input().split()))\n d+=c\nprint(d/a+5)", "n,num = int(input()),0\r\nfor i in range(n):\r\n num += float(input().split()[1])\r\nprint(f'{num / n + 5:.3f}')", "n = int(input())\nP = [[float(x) for x in input().split()] for _ in range(n)]\nprint(5 + sum(b for a,b in P)/n)\n" ]

[ "n = int(input())\r\nd = {}\r\nc = 1\r\nfor i in range(n):\r\n m,h = list(map(str, input().split()))\r\n if m+\":\"+h in d.keys():\r\n d[m+\":\"+h] += 1\r\n c = max(c, d[m+\":\"+h]) \r\n else:\r\n d[m+\":\"+h] = 1\r\n\r\nprint(c)", "from collections import defaultdict\r\nn = int(input())\r\na = defaultdict(int)\r\nans = float(\"-inf\")\r\nfor _ in range(n):\r\n hi, mi = map(int, input().split())\r\n val = hi*60 + mi\r\n a[val] += 1\r\n ans = max(ans, a[val])\r\n \r\nprint(ans)\r\n\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n a.append(h*60 + m)\r\n\r\nk = 1\r\nmax_k = 1\r\nfor i in range(n - 1):\r\n if a[i] == a[i+1]:\r\n k += 1\r\n if max_k < k:\r\n max_k = k\r\n else:\r\n k = 1\r\n\r\nprint(max_k)\r\n", "n = int(input())\r\nd = {}\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n if (h*60+m) in d:\r\n d[h*60+m]+=1\r\n else:\r\n d[h*60+m]=1\r\nprint(max(list(d.values())))", "from collections import Counter\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tl.append(input())\r\nprint(max(list(Counter(l).values())))", "n = int(input())\n\nvisitors = []\nfor _ in range(n):\n hours, minutes = input().split()\n if len(hours) == 1:\n hours = \"0\" + hours\n if len(minutes) == 1:\n minutes = \"0\" + minutes\n visitors.append(f\"{hours}{minutes}\")\n\nvisitors.sort()\n\nmax_clients = -1\ncounter = 0\nprev = None\n\nfor visitor in visitors:\n if visitor == prev:\n counter += 1\n else:\n counter = 1\n if counter > max_clients:\n max_clients = counter\n prev = visitor\n\nprint(max_clients)\n", "from itertools import groupby\r\n\r\nn = int(input()) \r\nprint(max(len(list(g)) for _, g in groupby(input() for _ in range(n))))", "import sys \r\nimport collections as cc\r\ninput = sys.stdin.readline\r\nI = lambda:list(map(int,input().split()))\r\n\r\nc = cc.Counter()\r\nfor tc in range(int(input())):\r\n x,y = I()\r\n c[(x,y)]+=1\r\nprint(max(c.values()))\r\n\r\n", "d={}\narr=[]\nsum=1\nfor _ in range(int(input())):\n h,m=map(int,input().split())\n if h not in arr :\n arr.append(h)\n d[h]=[]\n d[h].append(m)\n else:\n d[h].append(m)\n# print(d)\nfor i in arr:\n temp=d[i]\n # print(temp)\n temp1=set(temp)\n # print(temp1)\n for j in temp1:\n if temp.count(j)>sum:\n sum=temp.count(j)\n \n\nprint(sum)\n", "l=[]\r\nimport collections\r\nfor _ in range(int(input())):\r\n h,m=list(map(int,input().split()))\r\n l.append(h*60+m)\r\nprint(max(collections.Counter(l).values()))", "n,dic=int(input()),{}\r\nfor i in range(n):\r\n x=input()\r\n dic[x]=dic.get(x,0)+1\r\nprint(max(list(dic.values())))", "n = int(input())\r\nval = {}\r\nfor i in range(n):\r\n s = input()\r\n val[s] = val.get(s, 0) + 1\r\nprint(max(val.values()))", "import math\r\nfrom sys import stdin\r\ninput = stdin.readline\r\nl = []\r\nfor _ in range (int(input())):\r\n l.append(list(map(int, input().split())))\r\nl.sort()\r\nc = 0\r\nk = 1\r\nid = 0\r\nfor i in range (len(l)-1):\r\n if l[i] == l[i+1]:\r\n k = k + 1\r\n else:\r\n c = max(c, k)\r\n k = 1\r\n id = i + 1\r\nprint(max(c, len(l)-id))", "n=int(input())\r\nl=[]\r\nwhile(n):\r\n h,m=map(int,input().split())\r\n l.append((h,m))\r\n n=n-1\r\nl.sort()\r\ndef mostFrequent(arr, n):\r\n Hash = dict()\r\n for i in range(n):\r\n if arr[i] in Hash.keys():\r\n Hash[arr[i]] += 1\r\n else:\r\n Hash[arr[i]] = 1\r\n max_count = 0\r\n res = -1\r\n for i in Hash:\r\n if (max_count < Hash[i]):\r\n res = i\r\n max_count = Hash[i]\r\n return res\r\nz=(mostFrequent(l, len(l)))\r\nif(len(set(l))==len(l)):\r\n print(\"1\")\r\nelse:\r\n z1=l.count(z)\r\n print(z1)", "from collections import*\r\nmat=[]\r\nfor t in range(int(input())):\r\n h,m=map(int,input().split())\r\n mat.append([h,m])\r\nd=defaultdict(list)\r\nfor i in mat:\r\n b=tuple(i)\r\n if b in d:\r\n d[b]+=1\r\n else:\r\n d[b]=1\r\nres=list(d.values())\r\nprint(max(res))\r\n\r\n", "from collections import defaultdict\r\nC = []\r\nD = defaultdict(int)\r\nfor _ in range(int(input())):\r\n X = tuple(map(int, input().split()))\r\n C.append(X)\r\n D[X] += 1\r\nprint(max(D.values()))", "n = int(input())\nclients = {} \n\nfor i in range(n):\n c = 0\n h, m = tuple(map(int, input().split()))\n if (h,m) not in clients:\n clients[(h,m)] = 1\n else:\n clients[(h,m)] += 1\n\nprint(max(clients.values()))\n", "d = {}\r\nfor i in range(int(input())):\r\n s = input()\r\n d[s] = d.get(s, 0) + 1\r\n \r\n\r\nprint(max(d.values()))", "cnt, res = [0] * 100000, 0\r\nfor u in range(int(input())):\r\n a, b = map(int, input().split())\r\n res, cnt[a * 100 + b] = max(res, cnt[a * 100 + b]), cnt[a * 100 + b] + 1\r\nprint(res + 1)", "n=int(input())\narr=[]\ndict={}\nfor i in range(n):\n arr.append(input())\nfor i in arr:\n if i in dict:\n dict[i]+=1\n else:\n dict[i]=1\narr1=[]\nfor i in dict:\n arr1.append(dict[i])\nprint(max(arr1)) \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\nfor _ in range(n):\r\n\th,m=[int(i) for i in input().split()]\r\n\tcalc=h*60+m\r\n\tif calc not in dic:\r\n\t\tdic[calc]=1\r\n\telse:\r\n\t\tdic[calc]+=1\r\nans=1\r\nfor i in dic:\r\n\tans=max(ans,dic[i])\r\n\t\r\nprint(ans)", "d={}\r\nn=int(input())\r\nfor i in range(n):\r\n s=input()\r\n if s in d:\r\n d[s]+=1\r\n else:\r\n d[s]=1\r\nprint(max(d.values()))", "def time(h,m):\r\n return h*60+m\r\nn=int(input())\r\narrival=[]\r\nfor i in range(n):\r\n h,m = [int(x) for x in input().split()]\r\n arrival.append(time(h,m))\r\ndic={}\r\nfor item in arrival:\r\n dic[item]=dic.get(item,0)+1\r\nprint(max(dic.values()))", "\nn = int(input())\n\ntiming = {}\ncount = 1\n\nfor _ in range(n):\n time = tuple(map(int, input().split()))\n\n timing[time] = 1 + timing.get(time, 0)\n\n\nprint(max(timing.values()))", "from collections import Counter\r\ndef free_cash_reg():\r\n n = int(input().strip())\r\n c = Counter()\r\n for i in range(n):\r\n ip = input().strip()\r\n c[ip] += 1\r\n return c.most_common()[0][1]\r\nprint(free_cash_reg())", "n = int(input())\r\ntimes = {}\r\nfor i in range(n):\r\n t = input()\r\n if t not in times:\r\n times[t] = 1\r\n else:\r\n times[t] += 1\r\n\r\nprint(max(times.values()))", "n=int(input())\r\nx,y=-1,-1\r\nc=1\r\nm=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if x==a and y==b:\r\n c+=1\r\n else:\r\n c=1\r\n m=max(m,c)\r\n x,y=a,b\r\nprint(m)", "n = int(input())\r\nans = 1\r\ntemp = [input(), 1]\r\nfor i in range(n - 1):\r\n cmd = input()\r\n if cmd == temp[0]:\r\n temp[1] += 1\r\n else:\r\n ans = max(ans, temp[1])\r\n temp = [cmd, 1]\r\nans = max(ans, temp[1])\r\nprint(ans)\r\n", "n=int(input())\r\nc={}\r\nfor i in range(n):\r\n k=input()\r\n c[k]=c.get(k,0)+1\r\nprint(max(list(c.values())))", "from collections import Counter\r\nfrom itertools import repeat, chain\r\nnumber_of_visitors=int(input())\r\nhours=list()\r\nx =set()\r\ni=0\r\nwhile i<number_of_visitors:\r\n h_and_m=input().split()\r\n h=int(h_and_m[0])*60\r\n m=int(h_and_m[1])\r\n t=h+m\r\n hours.append(t)\r\n x.add(t)\r\n i+=1\r\nresult = list(chain.from_iterable(repeat(i, c)\r\n for i, c in Counter(hours).most_common()))\r\nprint(result.count(result[0]))", "length = int(input())\r\ntDict = {}\r\nfor time in range(length) :\r\n txt = input()\r\n if txt in tDict : tDict[txt] += 1\r\n else : tDict[txt] = 1\r\nprint(tDict[list(sorted(tDict , key= lambda x : tDict[x]))[-1]])", "from collections import Counter\r\nn = int(input())\r\np = [] * n\r\nfor i in range(n):\r\n p += list(map(int, input().split()))\r\na, count = 2, 1\r\np = [p[i:i + a] for i in range(0, len(p), a)]\r\nsomething = Counter(tuple(d) for d in p).most_common(1)[0] \r\nprint(something[1])", "n = int(input())\r\na = [0] * 1440\r\nfor i in range(n):\r\n\th, m = map(int, input().split())\r\n\ta[h * 60 + m] += 1\r\nprint(max(a))", "dict_= {}\r\nfor i in range(int(input())):\r\n h, m= map(int, input().split())\r\n if (h, m) in dict_:\r\n dict_[(h, m)]+= 1\r\n else:\r\n dict_[(h, m)]= 1\r\n\r\nprint(sorted(dict_.items(), key= lambda x:x[1], reverse= True)[0][1])", "x,temp,res='',0,1\r\nt= int(input())\r\nfor i in range(t):\r\n s=input()\r\n if s==x:\r\n temp+=1\r\n res=max(res,temp)\r\n else:\r\n x=s\r\n temp=1\r\nprint(res)", "n = int(input())\nmenit_sebelumnya = -1\norang_di_kafe = 1\njawaban = 0\n\nfor i in range (n):\n jam, menit = map(int, input(). split ())\n menit_sekarang = (jam * 60) + menit\n\n if menit_sekarang == menit_sebelumnya:\n orang_di_kafe += 1\n else:\n orang_di_kafe = 1\n \n if orang_di_kafe > jawaban:\n jawaban = orang_di_kafe\n \n menit_sebelumnya = menit_sekarang\n\nprint (jawaban)\n \t\t \t\t \t\t \t\t\t\t\t\t \t\t \t \t \t", "import sys\r\nfrom bisect import bisect, insort\r\nfrom collections import Counter, OrderedDict, defaultdict, deque\r\nfrom functools import cache, lru_cache, reduce\r\nfrom heapq import heapify, heappop, heappush, nlargest\r\nfrom itertools import accumulate, combinations, permutations, product, repeat\r\nfrom math import ceil, floor, gcd, hypot, lcm, log, sqrt\r\n\r\nsys.setrecursionlimit(10**5)\r\ndef input(): return sys.stdin.readline().strip('\\r\\n')\r\ndef pyint(): return int(input())\r\ndef pyline(): return map(int, input().split())\r\ndef pylist(): return list(map(int, input().split()))\r\n\r\n\r\n\r\nhms = [input() for _ in range(pyint())]\r\ncount = Counter(hms)\r\nprint(count.most_common(1)[0][1])\r\n", "\r\n\r\nfrom collections import Counter\r\n\r\n\r\nvisits = []\r\ncashes = 0\r\nfor _ in range(int(input())):\r\n a, b = [int(x) for x in input().split()]\r\n visits.append((a, b))\r\nocc = Counter(visits)\r\nl = list(occ.values())\r\nl.sort(reverse=True)\r\nprint(l[0])\r\n", "n = int(input())\r\nd = {}\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n time = a[0] * 60 + a[1]\r\n if time not in d:\r\n d[time] = 1\r\n else:\r\n d.update({time: d[time] + 1})\r\n\r\narr = d.values()\r\nprint(max(arr))", "n=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(input())\r\ndic={}\r\nfor i in l:\r\n if i in dic:\r\n dic[i]+=1\r\n else:\r\n dic[i]=1\r\nprint(max(dic.values()))", "n = int(input())\r\nl = []\r\nd = {}\r\nfor i in range(n):\r\n h,m = map(int , input().split())\r\n if((h,m) not in d.keys()):\r\n d[(h,m)] = 1\r\n else:\r\n d[(h,m)] += 1\r\nmx = -1\r\nfor key in d.keys():\r\n if(d[key] > mx):\r\n mx = d[key]\r\n\r\nprint(mx)\r\n", "t=int(input())\r\nd={}\r\nfor qwe in range(t):\r\n a=str(input())\r\n d[a]=d.get(a,0)+1\r\nprint(max(d.values()))", "t=int(input())\r\nh,m=map(int,input().split())\r\nh1=h\r\nm1=m\r\not=0\r\nstch=0\r\nfor _ in range(1,t):\r\n h,m=map(int,input().split())\r\n if h1==h and m1==m:\r\n stch+=1\r\n if ot<stch:\r\n ot=stch\r\n else:\r\n stch=0\r\n h1=h\r\n m1=m\r\nprint(ot+1)", "n=int(input())\r\nx=0\r\ny=1\r\nl=[]\r\nif n>0:\r\n y=1\r\nfor i in range(n):\r\n h,m=map(int,input().split())\r\n h = h*60 + m\r\n l.append(h)\r\nfor i in range(1,n):\r\n if l[i]!=l[i-1]:\r\n x = y\r\n x -= 1\r\n else:\r\n if x>0:\r\n x -= 1\r\n else:\r\n y += 1\r\nprint(y)", "n=int(input())\r\nl=[]\r\nmax=1\r\nl2=[]\r\ncnt=1\r\nfor i in range(n):\r\n d=list(map(int,input().split()))\r\n if(d==l2):\r\n cnt+=1\r\n if(max<cnt): max=cnt\r\n else:\r\n cnt=1\r\n l2=d\r\nprint(max)", "#uff ki prblm.at last parsi. Tbe builtin function chara solve hbe na. TLE KHABA. amre tw dkso koto bar tle kahisi. huhh\r\nimport statistics \r\nfrom statistics import mode \r\na=int(input())\r\nd=[]\r\nfor i in range(0,a):\r\n\tb=str(input())\r\n\td.append(b)\r\ne=mode(d)\r\nprint(d.count(e))", "def it(): return int(input())\r\ndef pr(a): return print(a)\r\ndef li(): return list(map(int, input().split()))\r\ndef ls(): return [str(i) for i in input()]\r\ndef no(): return print('NO')\r\ndef yes(): return print('YES')\r\n\r\nn = it()\r\npr = '-1 -1'\r\nmx = 1\r\nl = 1\r\nfor _ in range(n):\r\n\tt = input()\r\n\tif pr == t:\r\n\t\tl += 1\r\n\t\tmx = max(mx, l)\r\n\telse:\r\n\t\tl = 1\r\n\tpr = t\r\nprint(mx)\r\n\r\n'''??????????????????| -_- |???????????????????'''", "from collections import Counter as c\r\nn=int(input())\r\nv=[]\r\nz=1\r\nans=0\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tv.append(60*a+b)\r\nd=c(v)\r\nprint(max(d.values()))", "#TEMPLATE V.1\r\n'''def b_s(x : list ,ele):\r\n x=sorted(x);l=0;h=len(x)-1;a=-1;m=0\r\n while l<=h :\r\n m=(h+l)//2\r\n if x[m]>ele:h=m-1 \r\n elif x[m]<ele:l=m+1\r\n else:return m \r\n return a\r\n'''\r\n'''abc={0:'zero',1:'one',2:'two',3:'three',4:'four',5:'five',6:'six',7:'seven',8:'eight',9:'nine'}'''\r\n'''def remove_all(x :list,ele):\r\n while ele in x :x.remove(ele)'''\r\n'''def sep_num_text(x) :import re;x=re.split('(\\d+)',x);return x '''\r\n#TEST_cases\r\nn=int(input())\r\nd=dict()\r\nmaxs = 1\r\nfor i in range(n):\r\n x=input()\r\n if x in d :\r\n d[x]+=1\r\n if d[x]>maxs : \r\n maxs=d[x]\r\n else :\r\n d[x]=1\r\nprint(maxs)", "t,q=int(input()),{}\r\nfor i in range(t):\r\n k=input()\r\n if k not in q:\r\n q[k]=1\r\n else:\r\n q[k]+=1\r\nprint(q[max(q,key=q.get)])\r\n", "n=int(input(''))\r\nb=[]\r\ncount =0\r\nmaxcount=0\r\nfor i in range(n):\r\n c=input('')\r\n b.append(c)\r\n if i==0:\r\n count=1\r\n maxcount=max(maxcount,count)\r\n else:\r\n if b[i]==b[i-1]:\r\n count+=1\r\n maxcount=max(count,maxcount)\r\n else:\r\n count=1\r\nprint(maxcount)", "n=int(input())\r\nd={}\r\nfor j in range(n):\r\n a=input()\r\n if a in d:\r\n d[a]+=1\r\n else:\r\n d[a]=1\r\nprint(max(d.values()))", "d={}\r\nfor _ in range(int(input())):\r\n k=input()\r\n if k in d:\r\n d[k]+=1\r\n else:\r\n d[k]=1\r\nprint(max(d.values())) \r\n ", "counts = [0] * 1440\r\n\r\nfor _ in range(int(input())):\r\n h, m = map(int, input().split())\r\n counts[h * 60 + m] += 1\r\n\r\nprint(max(counts))\r\n", "n = int(input())\r\nprev = [int(x) for x in input().split()]\r\n\r\ncount = 1\r\nm = 1\r\n\r\nfor i in range(n - 1):\r\n current = [int(x) for x in input().split()]\r\n if current == prev:\r\n count += 1\r\n else:\r\n m = max(count, m)\r\n count = 1\r\n prev = current.copy()\r\n\r\nm = max(count, m)\r\nprint(m)\r\n", "n = int(input())\n\nl = [0 for i in range(1440)]\n\nfor i in range(n):\n a, b = map(int, input().split())\n l[a * 60 + b] += 1\n\nprint(max(l))\n", "from collections import Counter\r\nn = int(input())\r\nl = []\r\nfor _ in range(n):\r\n l.append(tuple(map(int, input().split())))\r\ncnt = Counter(l)\r\nprint(max(cnt.values()))\r\n\r\n\r\n\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\nn = int(input())\ntemp = tuple(int_map())\ncur = 1\nmx = 0\nfor i in range(n-1):\n\ttt = tuple(int_map())\n\tif tt == temp:\n\t\tcur += 1\n\telse:\n\t\ttemp = tt\n\t\tmx = max(mx, cur)\n\t\tcur = 1\n\nmx = max(cur, mx)\nprint(mx)\n\n\n\n\n\n\n\n\n\n", "hash_map = {}\nfor _ in range(int(input())):\n h, m = map(int, input().split())\n k = str(h) + 'h' + str(m) + 'm'\n\n if k not in hash_map:\n hash_map[k] = 1\n else:\n hash_map[k] += 1\n\nmaxi = max([v for v in hash_map.values()])\nprint(maxi)\n", "from collections import Counter\r\nimport operator\r\nNUMBER=int(input())\r\nl=[]\r\nmy_dict={}\r\nfor _ in range(NUMBER):\r\n HOURS,MIN=map(int,input().split())\r\n l.append((HOURS,MIN))\r\nmy_dict=Counter(l)\r\n\r\nmy_dict= list(reversed(list(dict(sorted(my_dict.items(), key=operator.itemgetter(1))).values())))\r\nprint(my_dict[0])\r\n\r\n", "from collections import Counter\r\nfrom collections import defaultdict\r\nimport operator\r\nNUMBER=int(input())\r\nmy_dict=defaultdict(int)\r\nfor _ in range(NUMBER):\r\n HOURS,MIN=map(int,input().split())\r\n my_dict[(HOURS,MIN)]+=1\r\n\r\nmy_dict= list(reversed(list(dict(sorted(my_dict.items(), key=operator.itemgetter(1))).values())))\r\nprint(my_dict[0])\r\n\r\n\r\n# from collections import defaultdict\r\n# import operator\r\n# NUMBER = int(input())\r\n# counts = defaultdict(int)\r\n# for _ in range(NUMBER):\r\n# HOURS, MIN = map(int, input().split())\r\n# counts[(HOURS, MIN)] += 1\r\n# sorted_counts = sorted(counts.items(), key=operator.itemgetter(1), reverse=True)\r\n# most_common_count = sorted_counts[0][1]\r\n# print(most_common_count)", "t=int(input())\r\nh0,m0=map(int,input().split())\r\ncm=1\r\nca=1\r\nfor i in range(t-1):\r\n h,m=map(int,input().split())\r\n if(h==h0 and m==m0):\r\n cm+=1\r\n if(cm>ca):\r\n ca=cm\r\n else:\r\n cm=1\r\n h0=h\r\n m0=m\r\nprint(ca)", "n = int(input())\r\nd = dict()\r\nmaxx = 1\r\nfor i in range(n):\r\n t = input()\r\n if t in d.keys():\r\n d[t] = d[t] + 1\r\n if d[t] > maxx:\r\n maxx = d[t]\r\n else:\r\n d[t] = 1\r\n\r\nprint(maxx)\r\n\r\n", "n=int(input())\r\nlst=[0]*1440\r\nfor i in range(n):\r\n a,b=[int(x) for x in input().split()]\r\n lst[a*60+b]+=1\r\nprint(max(lst))", "def main():\r\n n = int(input())\r\n temp_dict = dict()\r\n\r\n for _ in range(n):\r\n value = input()\r\n if value in temp_dict:\r\n temp_dict[value] += 1\r\n else:\r\n temp_dict[value] = 1\r\n \r\n print(max(temp_dict.values()))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nd = {}\r\nm = 0\r\nfor _ in ' '*n:\r\n x, y = input().split()\r\n key = x + '.' + y\r\n d[key] = d.get(key, 0) + 1\r\n m = max(m, d[key])\r\nprint(m)", "n = int(input())\r\n\r\nmax_count = current_count = 0\r\nprev = \"\"\r\n\r\nfor _ in range(n):\r\n entry_time = input()\r\n if entry_time == prev:\r\n current_count += 1\r\n else:\r\n current_count = 1\r\n prev = entry_time\r\n max_count = max(max_count, current_count)\r\n \r\nprint(max_count)", "n = int(input())\n\n\nd = {}\nfor _ in range(n):\n t = input()\n if t in d:\n d[t] += 1\n else:\n d[t] = 1\n\nprint(max(d.values()))", "n = int(input())\r\nfreq = {}\r\nfor _ in range(n):\r\n hm = input()\r\n freq[hm] = freq.get(hm, 0) + 1\r\nprint(max(freq.values()))", "n = int(input())\r\n\r\ncount = 0\r\ncount1 = 0\r\na = \"\"\r\n\r\nfor i in range(n):\r\n hm = input()\r\n if hm == a:\r\n count1 += 1\r\n else:\r\n count = max(count, count1)\r\n count1 = 1\r\n a = hm\r\n \r\nprint(max(count1, count))", "c = {}\r\nfor _ in range(int(input())):\r\n h, m = [int(i) for i in input().split()]\r\n t = h*60+m\r\n if t in c:\r\n c[t] += 1\r\n else:\r\n c[t] = 1\r\nprint(max(c.values()))\r\n", "from collections import defaultdict\r\nn = int(input())\r\na = []\r\nfor _ in range(n):\r\n a.append(tuple(map(int, input().split())))\r\nd = defaultdict(int)\r\nfor i in a:\r\n d[i] += 1\r\nmx = 0\r\nfor i in d:\r\n mx = max(mx,d[i])\r\nprint(mx)\r\n\r\n", "kassa = {}\r\nfor _ in range(int(input())):\r\n s = input()\r\n kassa[s] = kassa.get(s, 0) + 1\r\n\r\nprint(max(kassa.values()))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#from collections import Counter\r\n#from collections import defaultdict\r\n#import math\r\nn = int(input())\r\n#n,m = map(int,input().split())\r\n#l = list(map(int,input().split()))\r\n#t = list(map(int,input().split()))\r\n\r\nd = {}\r\nfor i in range(n): \r\n n,m = map(int,input().split())\r\n if (n,m) in d:\r\n d[(n,m)] += 1\r\n else:\r\n d[(n,m)] = 1\r\n\r\nprint( max(list(d.values())) )\r\n \r\n \r\n", "import sys\nfrom itertools import accumulate\n\ndct = {}\namt = int(input())\nfor i in range(amt):\n\ttemp = [int(i) for i in input().split()]\n\ttemp = str(temp[0]) + \":\" + str(temp[1])\n\ttry:\n\t\tdct[temp] += 1\n\texcept KeyError:\n\t\tdct[temp] = 1\nprint(max(dct.values()))", "n=int(input())\r\nd={}\r\nfor i in range(n):\r\n h,m=map(int,input().split())\r\n if d.get(h*60+m,-1)!=-1:\r\n d[h*60+m]+=1\r\n else:\r\n d[h*60+m]=1\r\nprint(max(d.values()))", "s={}\r\nans=0\r\nfor _ in range(int(input())):\r\n a=input()\r\n if a in s:\r\n s[a]+=1\r\n else:\r\n s[a]=1\r\n ans=max(ans,s[a])\r\nprint(ans)\r\n\r\n\r\n", "import statistics \r\nfrom statistics import mode \r\na=int(input())\r\nd=[]\r\nfor i in range(0,a):\r\n\tb=str(input())\r\n\td.append(b)\r\ne=mode(d)\r\nprint(d.count(e))", "n = int(input())\r\nc,d = 0,0\r\ncount = 0\r\nans = 0\r\nfor i in range(n) :\r\n a,b = map(int,input().split())\r\n if(a == c and b == d) :\r\n count += 1\r\n else :\r\n ans = max(ans,count)\r\n count = 1\r\n c = a\r\n d = b\r\nans = max(ans,count)\r\nprint(ans)", "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\nn = int(input())\r\n#arr = list(map(int,input().strip().split()))\r\narr= []\r\nfor i in range(n) :\r\n h,m = list(map(int,input().strip().split()))\r\n arr.append(h + m/100)\r\na = Counter(arr)\r\nmx = max((a.values()))\r\nprint(mx)", "from collections import Counter\r\nc=Counter()\r\nfor _ in range(int(input())):\r\n t=tuple(list(map(int,input().split())))\r\n c.update([t])\r\nprint(c.most_common()[0][1])", "n=int(input())\r\ndict={}\r\nfor i in range(0,n):\r\n s=str(input())\r\n try:\r\n dict[s]=dict[s]+1\r\n except:\r\n dict[s]=1\r\nprint(max(dict.values()))", "n = int(input())\r\nm = [[0 for j in range(60)] for i in range(24)]\r\nk = 0\r\nx = 0\r\ny = 0\r\nm1 = []\r\n\r\nfor i in range(n):\r\n #m1 = [0 for l in range(0)]\r\n m1 = ([int(b) for b in input().split()])\r\n x = m1[0]\r\n y = m1[1]\r\n m[x][y] += 1\r\n if (k < m[x][y]):\r\n k+=1\r\nprint(k)\r\n", "memo = {}\r\nfor i in range(int(input())):\r\n h, m = map(int, input().split())\r\n tmp = h * 60 + m\r\n memo[tmp] = memo[tmp] + 1 if tmp in memo else 1\r\n\r\nprint(max(memo.values()))", "n = int(input())\r\na = -1\r\nb = -1\r\nmmm = 0\r\nc = 1\r\nwhile n > 0:\r\n n -= 1\r\n h, m = map(int, input().split())\r\n if h == a and b == m:\r\n c += 1\r\n else:\r\n c = 1\r\n if c > mmm:\r\n mmm = c\r\n a = h\r\n b = m\r\n\r\nprint(mmm)\r\n", "n = int(input())\r\ntime = [[0 for _ in range(60)] for _ in range(24)]\r\ncashes = 0\r\nfor _ in range(n):\r\n h, m = map(int, input().split())\r\n time[h][m] += 1\r\nfor h in range(24):\r\n for m in range(60):\r\n t = time[h][m]\r\n if t > cashes:\r\n cashes = t\r\nprint(cashes)", "n = int(input())\r\n\r\nd = {}\r\n\r\nfor i in range(n):\r\n h,m = map(int,input().split())\r\n time = \"\"\r\n time += str(h)\r\n time += \",\"\r\n time += str(m)\r\n if time in d:\r\n d[time] += 1\r\n else:\r\n d[time] = 1\r\n \r\nprint(max(d.values()))", "n = int(input(''))\r\nszt = {}\r\nfor i in range(n):\r\n tmp = input('')\r\n if (tmp not in szt):\r\n szt[tmp] = 1\r\n else:\r\n szt[tmp] += 1\r\n\r\nmeg = 0\r\nfor i in szt:\r\n if (meg < szt[i]):\r\n meg = szt[i]\r\nprint(meg)\r\n", "import collections\r\nn=int(input())\r\nlst=[]\r\nfor i in range(n):\r\n c=1\r\n s=input()\r\n lst.append(s)\r\nd=collections.Counter(lst)\r\nprint(max(d.values()))", "n = int(input())\r\ndata = {}\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n stroke = str(a) + \":\" + str(b)\r\n\r\n if data.get(stroke) is not None:\r\n data[stroke] += 1\r\n else:\r\n data[stroke] = 1\r\n\r\nprint(max(data.values()))", "num=int(input())\r\n\r\nwaiters=1\r\nmost_ws=0\r\n\r\nold_hour=-1\r\nold_minute=-1\r\n\r\nfor i in range(num):\r\n time=list(map(int, input().split()))\r\n hour=time[0]\r\n minute=time[1]\r\n if hour==old_hour and minute==old_minute:\r\n waiters+=1\r\n else:\r\n waiters=1\r\n most_ws= max(most_ws,waiters)\r\n old_hour=hour\r\n old_minute=minute\r\nprint(most_ws)", "tmp = dict()\r\nfor i in range(int(input())):\r\n h , m = map(int, input().split())\r\n if ((h,m)) in tmp.keys():\r\n tmp[(h,m)]+=1\r\n else :\r\n tmp[(h,m)] = 1\r\nprint(max(tmp.values()))", "number = int(input())\r\nfrom collections import defaultdict\r\ncustomers = defaultdict(int)\r\nfor i in range(number):\r\n customer = input()\r\n if customer in customers.keys():\r\n customers[customer] += 1\r\n else:\r\n customers[customer] = 1\r\n\r\nprint(max(customers.values()))\r\n", "from collections import Counter\r\nout=[]\r\nfor _ in range(int(input())):\r\n h,m=map(int,input().split())\r\n time=h*60+m\r\n out.append(time)\r\ncounts = Counter(out)\r\nprint(max(counts.values()))\r\n", "x=int(input())\r\nd=dict()\r\nfor i in range(x):\r\n h,m=input().split()\r\n if h+':'+m in d:\r\n d[h+':'+m]+=1\r\n else:\r\n d[h+':'+m]=1\r\nans=1\r\nfor key in d:\r\n ans=max(ans,d[key])\r\nprint(ans)\r\n", "t=[[0 for x in range(60)] for y in range(24)]\r\nw=1\r\nfor x in range(int(input())):\r\n i=[int(q) for q in input().split()]\r\n t[i[0]][i[1]]+=1\r\n w=max(w,t[i[0]][i[1]])\r\nprint(w)\r\n \r\n", "n = int(input())\r\n\r\nnum_dict = {}\r\n\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n sm = m + h * 60\r\n\r\n num_dict[sm] = num_dict.get(sm, 0) + 1\r\n\r\n\r\nmx = max(num_dict.values())\r\n\r\nprint(mx)\r\n", "n=int(input())\r\nans=1\r\nmaster_list=[]\r\nfor i in range(n):\r\n lst=list(map(int,input().rstrip().split()))\r\n master_list.append(tuple(lst))\r\n\r\nd={}\r\n\r\nfor i in master_list:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\n\r\nprint(max(list(d.values())))\r\n", "testCount = int(input())\r\ntimes = []\r\nfor i in range(testCount):\r\n times.append(input())\r\nmostRecent = \"\"\r\ndupeCount = 0\r\nmaxDupe = 0\r\nfor i in times:\r\n\r\n if mostRecent ==\"\":\r\n mostRecent = i\r\n dupeCount+=1\r\n\r\n elif i ==mostRecent:\r\n\r\n dupeCount+=1\r\n\r\n else:\r\n\r\n maxDupe = max(dupeCount, maxDupe)\r\n dupeCount = 1\r\n mostRecent = i\r\n\r\n\r\nmaxDupe = max(dupeCount,maxDupe)\r\nprint(maxDupe)", "n = int(input())\r\n\r\ndp = [0] * (24 * 60)\r\n\r\nfor _ in range(n):\r\n h, m = [int(k) for k in input().split()]\r\n h *= 60\r\n dp[h + m] += 1\r\n\r\nprint(max(dp))\r\n\r\n", "n = int(input())\r\ntime = []\r\n\r\nfor i in range(n):\r\n hour, minute = input().split()\r\n time.append(hour+minute)\r\n\r\ncount_max = 1\r\ncount = 1\r\nfor i in range(1,n):\r\n if time[i] == time[i-1]:\r\n count += 1\r\n else:\r\n count = 1\r\n\r\n if count > count_max:\r\n count_max = count \r\n\r\nprint(count_max)", "from collections import defaultdict\r\nd=defaultdict(int);m=0\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split());d[a*60+b]+=1;m=max(m,d[a*60+b])\r\nprint(m)", "n=int(input())\r\nd={}\r\nfor i in range(n):\r\n a=tuple(map(int,input().split()))\r\n if a not in d:\r\n d[a]=1\r\n else:\r\n d[a]+=1\r\nprint(max(list(d.values())))", "from collections import defaultdict\r\nn=int(input())\r\nd=defaultdict(int)\r\nfor i in range(n):\r\n s=input()\r\n d[s]+=1\r\n \r\n\r\nprint(max(d.values()))", "from collections import Counter\r\n\r\nnum = int(input())\r\nli = []\r\nfor i in range(num):\r\n li.append(input())\r\n\r\ncount = Counter(li)\r\n\r\nprint(list(count.most_common(1))[0][1])\r\n", "n = int(input())\r\ndup = 1\r\nma = 1\r\ns = input()\r\np = s\r\nfor i in range(n-1):\r\n s = input()\r\n if p==s:\r\n dup+=1\r\n else:\r\n if dup>ma:\r\n ma = dup\r\n dup = 1\r\n p = s\r\n \r\nif dup>ma:\r\n ma = dup\r\n \r\nprint(ma)", "t=int(input())\r\ncount=1\r\ncash=1\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n if(i==0):\r\n a1=a\r\n b1=b\r\n else:\r\n if(a1==a and b1==b):\r\n count+=1\r\n if(count>cash):\r\n cash=count\r\n else:\r\n count=1 \r\n a1=a\r\n b1=b\r\nprint(cash)\r\n ", "n = int(input())\r\n\r\na = [list(map(int,input().split())) for _ in range(n)]\r\n\r\n\r\ncountMap = {x:[] for x,y in a}\r\n\r\nfor x,y in a:\r\n countMap[x].append(y)\r\n\r\nmaxSame = 1\r\n\r\nfor val in countMap.values():\r\n same = 1\r\n for i in range(1,len(val)):\r\n if val[i] == val[i-1]:\r\n same+=1\r\n else:\r\n same = 1\r\n maxSame = max(maxSame,same)\r\n\r\nprint(maxSame)\r\n ", "m1=-1\r\nh1=-1\r\nmaxi=1\r\nl=1\r\nfor _ in range(int(input())):\r\n h,m=map(int,input().split()) \r\n if m==m1 and h==h1:\r\n l=l+1\r\n if l>=maxi:\r\n maxi=l\r\n else:\r\n l=1\r\n m1=m\r\n h1=h\r\nprint(maxi)\r\n", "n,a=int(input()),{}\r\nfor i in range(n):\r\n t=input()\r\n a[t]=a.get(t,0)+1\r\nprint(max(a.values()))\r\n", "from collections import Counter\r\n\r\narr = []\r\nfor _ in range(int(input())):\r\n h, m = map(int, input().split())\r\n arr.append((h, m))\r\nc = Counter(arr)\r\nprint(c.most_common(1)[0][-1])", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\nn=int(input())\r\nc=1\r\nprev=input()\r\nif(n==1):\r\n print(1)\r\nelse:\r\n c1=1\r\n for i in range(1,n):\r\n s=input()\r\n if(s==prev):\r\n c1+=1\r\n else:\r\n c=max(c,c1)\r\n c1=1\r\n prev=s\r\n c=max(c,c1)\r\n print(c)", "H = M = -1\r\nans = 1\r\ncash = 1\r\nfor i in range(int(input())):\r\n h, m = map(int,input().split())\r\n if h==H and m==M:\r\n cash += 1\r\n if cash>ans:ans=cash\r\n else:\r\n cash = 1\r\n H = h\r\n M = m\r\nprint(ans)\r\n", "a=int(input())\r\nb=[]\r\nfor i in range(a):\r\n b.append(list(map(int,input().split())))\r\nans=1 \r\ncount=1 \r\nfor i in range(1,len(b)):\r\n if b[i]==b[i-1]:\r\n count=count+1\r\n ans=max(ans,count)\r\n else:\r\n count=1 \r\nprint(ans)", "c=0\r\nd={}\r\nfor _ in range(int(input())):\r\n\tn,m=map(int,input().split())\r\n\tif str([n,m]) in d:\r\n\t\td[str([n,m])]+=1\r\n\telse:\r\n\t\td[str([n,m])]=1\r\nfor x in d:\r\n\tif d[x]>c:\r\n\t\tc=d[x]\r\n\r\nprint(c)", "from collections import Counter\r\nt=int(input())\r\nres=[]\r\nfor i in range(t):\r\n res.append(input())\r\nx=Counter(res)\r\nprint(max(x.values()))", "n = int(input())\r\nDict = {}\r\nmax = 1\r\nwhile n:\r\n\r\n Tuple = tuple(input().split())\r\n\r\n if Tuple in Dict:\r\n\r\n Dict[Tuple]+=1\r\n if Dict[Tuple]>max:\r\n max = Dict[Tuple]\r\n\r\n else:\r\n\r\n Dict[Tuple]=1\r\n n-=1\r\n\r\nprint(max)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\r\nn=int(input())\r\nliss=[]\r\n\r\nfor i in range(n):\r\n t=input()\r\n liss.append(t)\r\n\r\nz=Counter(liss).most_common()[0][1]\r\n\r\nprint(z)\r\n\r\n", "def main() :\r\n n = int(input())\r\n d = {}\r\n for _ in range(n):\r\n h = input()\r\n if h in d :\r\n d[h] += 1\r\n else :\r\n d[h] = 1\r\n print(max(d.values())) \r\n\r\nmain() ", "n = int(input())\nhour = -1\nminute = -1\ncount = 1\nya = 1\n\nfor i in range(n):\n hi, mi = map(int, input().split())\n if hi == hour and mi == minute:\n count += 1\n if count > ya:\n ya = count\n else:\n hour = hi\n minute = mi\n count = 1\nprint(ya)\n\t\t\t \t\t\t\t\t \t\t \t \t\t \t\t", "n=int(input())\r\nl=[]\r\nfor i in range(n) :\r\n h,m=map(int,input().split())\r\n l.append([h,m])\r\no=1\r\np=1\r\nfor i in range(0,len(l)-1) :\r\n if l[i][0]==l[i+1][0] and l[i][1]==l[i+1][1] :\r\n p+=1\r\n else :\r\n p=1\r\n if o<p :\r\n o=p\r\nprint(o)", "n = int(input())\r\ncount = dict()\r\nfor _ in range(n):\r\n line = input()\r\n if line not in count:\r\n count[line] = 0\r\n count[line] += 1\r\nprint(max(count.values()))", "kassa = 1\r\nlast = -1\r\ntimes = {}\r\n\r\nfor i in range(int(input())):\r\n h, m = map(int, input().split())\r\n mins = h * 60 + m\r\n \r\n times[mins] = times.get(mins, 0) + 1\r\n \r\nfor i in times:\r\n if times[i] > 1:\r\n if times[i] > kassa:\r\n kassa = times[i]\r\n \r\nprint(kassa)\r\n", "c = {}\nfor _ in range(int(input())):\n a = tuple(int(i) for i in input().split())\n if a in c.keys():\n c[a]+=1\n else:\n c[a] = 1\n\n \n# print(list(c.items()))\nprint(max(c.values()))", "t = int(input())\r\n# ans = []\r\nlst = []\r\n\r\ndef frequency_of_element(lst):\r\n dic = {}\r\n for item in lst:\r\n if item in dic:\r\n dic[item] += 1\r\n else:\r\n dic[item] = 1\r\n return dic\r\n\r\nfor i in range(t):\r\n lst.append(input())\r\n\r\nfq_dic = frequency_of_element(lst)\r\n\r\nmaxi = 0\r\n\r\nfor key, value in fq_dic.items():\r\n if maxi < value:\r\n maxi = value\r\n\r\nprint(maxi)\r\n\r\n# for item in ans:\r\n# print(item)\r\n", "# A. Свободная касса\r\nn = int(input())\r\nh_previous, m_previous = map(int, input().split())\r\ncash_reg = 1\r\ncash_reg_max = 1\r\nh_current, m_current = 0, 0\r\nn -= 1\r\nwhile (n > 0):\r\n h_current, m_current = map(int, input().split())\r\n if h_current == h_previous and m_current == m_previous:\r\n cash_reg += 1\r\n if cash_reg > cash_reg_max:\r\n cash_reg_max = cash_reg\r\n else:\r\n cash_reg = 1\r\n h_previous, m_previous = h_current, m_current\r\n n -= 1\r\n\r\n\r\nprint(cash_reg_max)", "n = int(input())\r\nl = []\r\ndict = {}\r\nfor i in range(n):\r\n a,b = map(int , input().split())\r\n t = a+b/60\r\n l.append(t)\r\n dict[t]=0\r\nfor i in range(n):\r\n dict[l[i]]+=1\r\nprint(max(dict.values()))", "dic = {}\r\nfor _ in range(int(input())):\r\n s = input()\r\n if s in dic:\r\n dic[s] += 1\r\n else:\r\n dic[s] = 1\r\nans = 0\r\nfor i in dic:\r\n if ans < dic[i]:\r\n ans = dic[i]\r\n\r\nprint(ans)\r\n", "\nl= [[0 for b in range(0, 60 )] for a in range(0,24 ) ] \nfor _ in range(0, int(input())) : \n\th,m=map(int,input().strip().split())\n\tl[h][ m]+=1\nres= 0\nfor i in l:\n\t# if len(i) > 0:\n\tfor j in i:\n\t\tres= max(res, j)\nif res==0: print(0)\nif res!=0: print(res)", "def _input(): return map(int, input().split())\r\n\r\nlst = []\r\nn = int(input())\r\nfor _ in range(n):\r\n a, b = _input()\r\n lst.append((a,b))\r\n\r\ni = 0; res = 1\r\nwhile i<n-1:\r\n l = 1\r\n while i<n-1 and lst[i] == lst[i+1]: l+=1; i+=1\r\n res = max(res, l )\r\n i+=1\r\nprint(res)", "n=int(input())\r\nA,B=map(int,input().split())\r\ny=1\r\nx=1\r\nfor i in range(n-1):\r\n a,b=map(int,input().split())\r\n if(a==A and b==B):\r\n x+=1\r\n else:\r\n x=1\r\n if(x>y):\r\n y=x\r\n A=a\r\n B=b\r\nprint(y)\r\n", "#https://codeforces.com/problemset/problem/237/A\nfrom sys import stdin,stdout\n\ndef fin():\n\ts=stdin.readline()\n\treturn s[0:len(s)-1]\n\ndef fout(x=\"\",end=\"\\n\"):\n\tstdout.write(str(x)+str(end))\n\nn=int(fin())\nh=[]\nm=[]\nfor i in range(n):\n\t_h,_m=map(int,fin().split())\n\th.append(_h)\n\tm.append(_m)\nmaxNum=1\nstreak=1\nfor x in range(1,n):\n\tif h[x]==h[x-1] and m[x]==m[x-1]:\n\t\tstreak+=1\n\telse:\n\t\tmaxNum=max(maxNum,streak)\n\t\tstreak=1\nmaxNum=max(maxNum,streak)\nfout(maxNum)\n", "\r\nl = int(input())\r\nd={}\r\nm=0\r\nfor _ in range (l):\r\n x,y = map(int,input().split())\r\n try:\r\n d[(x,y)]+=1\r\n if(d[(x,y)] > m):\r\n m=d[(x,y)]\r\n except:\r\n d[(x,y)]=1\r\n \r\n \r\nif(m==0):\r\n print(1)\r\nelse:\r\n print(m)", "def solve(arr,n):\n d = {}\n max_count = 0\n for i in arr:\n if not d.get(f'{i[0]}:{i[1]}'):\n d[f'{i[0]}:{i[1]}'] = 0\n d[f'{i[0]}:{i[1]}'] += 1\n for i in d:\n if d[i] > max_count:\n max_count = d[i]\n return max(1, max_count)\n\n\n\n\n\ndef main():\n n = int(input())\n arr = []\n for _ in range(n):\n arr.append(list(map(int, list(input().split(\" \")))))\n print(solve(arr,n))\n\nmain()", "n=int(input())\r\nd={}\r\nfor i in range(n):\r\n h,m=map(int, input().split())\r\n time=h*60+m\r\n try:\r\n d[time]+=1\r\n except:\r\n d[time]=1\r\nprint(max(d.values()))", "n=int(input())\r\nt=[0]*1440\r\nfor i in range(n):\r\n h,m=map(int,input().split())\r\n t[h*60+m]+=1\r\nprint(max(t))", "n=int(input())\r\nd=dict()\r\nfor j in range(n):\r\n a,b=map(int,input().split())\r\n p=b+a*60\r\n if not p in d:\r\n d[p]=1\r\n else:\r\n d[p]+=1\r\nmax1=0\r\nfor i in d:\r\n if d[i]>max1:\r\n max1=d[i]\r\nprint(max1)", "time = [[0] * 60 for _ in range(24)]\r\nn = int(input())\r\ncmax = 0\r\nfor _ in range(n):\r\n h, m = map(int, input().split())\r\n time[h][m] += 1\r\n cmax = max(cmax, time[h][m])\r\n\r\nprint(cmax)", "n = int(input())\r\ncount, max = 1, 0\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n - 1):\r\n b = a\r\n a = list(map(int, input().split()))\r\n if a[0] == b[0] and a[1] == b[1]:\r\n count += 1\r\n else:\r\n if count > max:\r\n max = count\r\n count = 1\r\n\r\nprint(max if count < max else count)\r\n", "n = int(input())\r\ntimes = dict()\r\nfor i in range(n):\r\n newStr = input()\r\n try:\r\n times[newStr] += 1\r\n except:\r\n times[newStr] = 1\r\nmax = 0\r\nfor t in times:\r\n if times[t] > max:\r\n max = times[t]\r\nprint(max)", "from collections import Counter\n\ncafe_visitors = int(input())\n\nrecords = []\n\nfor i in range(cafe_visitors):\n (hours, minutes) = map(int, input().split(' '))\n records.append([hours, minutes])\n\npeak = []\n\nfor i in range(cafe_visitors - 1):\n if records[i][0] == records[i + 1][0] and records[i][1] == records[i + 1][1]:\n peak.append([records[i][0], records[i][1]])\n\nif len(peak) > 0:\n counts = Counter([tuple(i) for i in peak])\n print(max(counts.values()) + 1)\nelse:\n print('1')", "from collections import defaultdict\r\nf=defaultdict(list)\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n if f.get((a,b),-1)==-1:\r\n f[(a,b)]=1\r\n else:\r\n f[(a,b)]+=1\r\nprint(max(f.values()))", "from sys import stdin\r\ninput = lambda: stdin.readline().strip()\r\nd = dict() \r\nn = int(input()) \r\n\r\nfor _ in range(n):\r\n s = input() \r\n if s not in d:\r\n d[s] = 1 \r\n else:\r\n d[s] += 1 \r\n\r\nprint(max(d.values()))\r\n\r\n", "from collections import Counter\r\na=[]\r\nfor _ in range(int(input())):\r\n s=input()\r\n a.append(s)\r\nd=Counter(a)\r\nc=1\r\nm=(max(d.values()))\r\nc+=(m-1)\r\nprint(c)\r\n\r\n", "#i\nn = int(input())\nsebelum = -1\nbanyak_orang = 1\ncash = 0\n\nfor i in range(n):\n h, m = map(int, input().split())\n sekarang = (h * 60) + m\n \n if sebelum == sekarang:\n banyak_orang += 1\n else:\n banyak_orang = 1\n \n if banyak_orang > cash:\n cash = banyak_orang\n \n sebelum = sekarang\n\nprint(cash)\n \t \t\t \t\t\t \t\t\t \t \t \t \t \t \t\t", "# 237A - Free Cash\r\nd = {}\r\nfor i in range(int(input())):\r\n z = tuple(map(int, input().split()))\r\n try:\r\n d[z] += 1\r\n except:\r\n d[z] = 1\r\nprint(max(map(int, d.values())))\r\n", "n = int(input())\r\n\r\np_h = -1\r\np_m = -1\r\nm_c = 0\r\nc = 0\r\n\r\nfor _ in range(n):\r\n h, m = map(int, input().split())\r\n \r\n if h == p_h and m == p_m:\r\n c += 1\r\n else:\r\n c = 1\r\n if c > m_c:\r\n m_c = c\r\n p_h, p_m = h, m\r\n\r\nprint(m_c)", "visitors = int(input())\r\n\r\nprev_h, prev_m = [int(i) for i in input().split()]\r\ncount = 1\r\nmax_count = 1\r\nfor visit in range(1, visitors):\r\n h, m = [int(i) for i in input().split()]\r\n if h == prev_h and m == prev_m:\r\n count += 1\r\n if count > max_count:\r\n max_count = count\r\n else:\r\n count = 1\r\n prev_h = h\r\n prev_m = m\r\n\r\nprint(max_count)", "n = int(input())\r\nh = []\r\nm = []\r\nregister = 1\r\nmaxregis = 1\r\nhourl = 100\r\nminutel = 100\r\nfor i in range(n):\r\n hour, minute = map(int, input().split())\r\n if hour == hourl and minute == minutel:\r\n register += 1\r\n if register > maxregis:\r\n maxregis = register\r\n else:\r\n register = 1 \r\n hourl = hour\r\n minutel = minute \r\nprint(maxregis)", "time = {}\r\nmaxfreq = -1\r\nfor _ in range(int(input().strip())):\r\n h, m = map(int, input().strip().split())\r\n time[(h, m)] = time.get((h, m), 0) + 1\r\n maxfreq = max(maxfreq, time[(h, m)])\r\nprint(maxfreq)\r\n ", "n = int(input())\r\ncount, max_count = 1, 1\r\nfirst = input()\r\nfor i in range(n - 1):\r\n next = input()\r\n if first == next:\r\n count += 1\r\n max_count = max(count, max_count)\r\n else:\r\n count = 1\r\n first = next\r\nprint(max_count)\r\n", "n = int(input())\r\nl = [0]*1440\r\nfor i in range(n):\r\n\th, m = map(int, input().split())\r\n\tl[h*60+m]+=1\r\nprint(max(l))", "n=int(input())\r\ndic=dict()\r\nans=0\r\nfor i in range(0,n):\r\n tempt=input().split(' ')\r\n t=tempt[0]*60 + tempt[1]\r\n if t in dic:\r\n dic[t]+=1\r\n else:\r\n dic[t]=1\r\n if ans<dic[t]:\r\n ans=dic[t]\r\nprint(ans)", "n=int(input())\r\nhr={}\r\nfor _ in range (n):\r\n tme=tuple(map(int,input().split()))\r\n try:\r\n hr[tme]+=1\r\n except:\r\n hr[tme]=1\r\ncash=0\r\nfor i in hr.values():\r\n cash=max(cash,i)\r\nprint(cash)\r\n", "from collections import Counter\r\nt=int(input())\r\ni=0\r\nr=[]\r\nwhile(i<t):\r\n s=\"\"\r\n x,y=map(int,input().split(\" \"))\r\n s+=str(x)+\" \"+str(y)\r\n r.append(s)\r\n i+=1\r\nd=Counter(r)\r\nmax1=1\r\nfor l in d:\r\n if(d[l]>max1):\r\n max1=d[l]\r\n \r\nprint(max1)\r\n \r\n \r\n", "def si(): return str(input())\r\ndef ii(): return int(input())\r\ndef mi(): return map(int, input().strip().split(\" \"))\r\ndef msi(): return map(str, input().strip().split(\" \"))\r\ndef li(): return list(mi())\r\n\r\n\r\n\r\ndef main():\r\n n = ii()\r\n a=[-1]*(n+1)\r\n b=[-1]*(n+1)\r\n ans=1\r\n m=1\r\n for i in range(1,n+1):\r\n a[i],b[i] = mi()\r\n if a[i]==a[i-1] and b[i]==b[i-1]:\r\n m+=1 \r\n ans = max(ans,m)\r\n else:\r\n m=1 \r\n\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "l=[]\r\nfor no_testcase in range(int(input())):\r\n str = input()\r\n l.append(str)\r\nmaxi = 1\r\ncoun = 1\r\nfor i in range(1,len(l)):\r\n \r\n \r\n if l[i-1]==l[i]:\r\n coun+=1\r\n if coun>maxi:\r\n maxi = coun \r\n \r\n else:\r\n coun=1\r\n \r\nprint(maxi)", "n = int(input())\r\ncount, greatest = 1, 0\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n - 1):\r\n b = a\r\n a = list(map(int, input().split()))\r\n if a[0] == b[0] and a[1] == b[1]:\r\n count += 1\r\n else:\r\n if count > greatest:\r\n greatest = count\r\n count = 1\r\n\r\nprint(greatest if count < greatest else count)\r\n", "n = int(input())\r\n\r\ntimes = []\r\nfor _ in range(n):\r\n h, m = [int(x) for x in input().split()]\r\n times.append(h*60 + m)\r\n\r\ntimes.sort()\r\n\r\nlast = times[0]\r\ncount = 1\r\nbest = 1\r\nfor i in range(1, n):\r\n if times[i] == last:\r\n count += 1\r\n else:\r\n last = times[i]\r\n count = 1\r\n best = max(best, count)\r\n\r\nprint(best)", "visitor = dict()\nfor __ in range(int(input())):\n\th, m = map(int, input().split())\n\tvisitor[(h, m)] = visitor.get((h, m), 0) + 1\nprint(max(visitor.values()))\n", "from collections import Counter\n\ncafe_visitors = int(input())\n\nrecords = []\n\nfor i in range(cafe_visitors):\n (hours, minutes) = map(int, input().split(' '))\n records.append([hours, minutes])\n\ncounts = Counter([tuple(i) for i in records])\n\nwaiter = max(counts.values())\n\nprint(waiter)", "n = int(input())\r\nlst = []\r\n\r\n\r\ndef fn(val1, val2):\r\n if val1[0] == val2[0]:\r\n if val1[1] > val2[1]:\r\n return 1\r\n elif val1[0] > val2[0]:\r\n return -1\r\n else:\r\n return 0\r\n\r\n\r\nfor i in range(0, n):\r\n k = input().split(\" \")\r\n h = int(k[0])\r\n m = int(k[1])\r\n lst.append([h, m])\r\n\r\ncashes = 1\r\n\r\nlst = sorted(lst, key=lambda x: (x[0], x[1]))\r\ncurr = (lst[0])\r\nmx = 1\r\n\r\nfor i in range(1, len(lst)):\r\n nexth = lst[i][0]\r\n nextm = lst[i][1]\r\n if nexth > curr[0]:\r\n curr = lst[i]\r\n cashes = 1\r\n continue\r\n elif nexth == curr[0]:\r\n if nextm > curr[1]:\r\n curr = lst[i]\r\n cashes = 1\r\n continue\r\n else:\r\n cashes += 1\r\n mx = max(mx, cashes)\r\n curr = lst[i]\r\nmx = max(mx, cashes)\r\nprint(mx)\r\n", "n = int(input())\r\nh,m=-1,-1\r\nout = \"\"\r\nfor _ in range(n):\r\n a,b = map(int, input().split())\r\n if h==a and b==m:\r\n out = out + \"1\"\r\n else:\r\n \tout = out + \"0\"\r\n h = a\r\n m = b\r\nout = out.split(\"0\")\r\nmaxm=0\r\nfor i in out:\r\n\tif len(i)>maxm:\r\n\t\tmaxm = len(i)\r\nprint(maxm+1)", "from collections import Counter\r\nli = []\r\nfor _ in range(int(input())):\r\n h, m = map(int, input().split())\r\n li.append(60*h+m)\r\n\r\nprint(max(list(Counter(li).values())))", "from time import sleep as sle\r\nfrom math import *\r\nfrom random import randint as ri\r\n\r\ndef gcd(a,b):\r\n\tif a == b:\r\n\t\treturn a\r\n\telif a > b:\r\n\t\treturn gcd(a-b,b)\r\n\telse:\r\n\t\treturn gcd(b,a)\r\n\r\ndef solve():\r\n\tn = int(input())\r\n\tL = {}\r\n\tfor _ in range(n):\r\n\t\thm = input()\r\n\t\tif hm not in L:\t\t\t\r\n\t\t\tL[hm] = 0\r\n\t\tL[hm] += 1\r\n\tans = 0\r\n\tfor k in L:\r\n\t\tans = max(ans,L[k])\r\n\tprint(ans)\r\n\r\nsolve()", "\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = []\r\n for i in range(n):\r\n h, m = list(map(int, input().split()))\r\n a.append(h * 60 + m)\r\n d = {i:0 for i in a}\r\n for i in a:\r\n d[i] += 1\r\n\r\n ans = -1\r\n for i in list(d.keys()):\r\n ans = max(ans, d[i])\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "t=int(input())\r\nl=[]\r\ndict={}\r\nmax_count=0\r\nfor i in range(t):\r\n h,m=map(int,input().split())\r\n element=str(h)+\"@\"+str(m)\r\n if element not in dict:\r\n dict[element]=1\r\n else:\r\n dict[element]+=1\r\nfor i in dict:\r\n if dict[i]>max_count:\r\n max_count=dict[i]\r\nprint(max_count)", "t=int(input())\r\n\r\nfrq = dict()\r\nans = 1\r\nwhile t>0:\r\n h,m = map(int, input().split())\r\n tm = f\"{h} {m}\"\r\n frq.setdefault(tm,0)\r\n frq[tm] += 1\r\n ans = max(ans, frq[tm])\r\n t -= 1\r\nprint(ans)", "d={}\r\nfor i in range(int(input())):\r\n\ts=input()\r\n\td[s]=d.get(s,0)+1\r\nprint(max(d.values()))", "def solution():\r\n\tn=int(input())\r\n\tdicty={}\r\n\tmx=1\r\n\tfor i in range(n):\r\n\t\th,m=map(int,input().split())\r\n\t\tif (h,m) in dicty:\r\n\t\t\tdicty[(h,m)]+=1\r\n\t\t\tmx=max(mx, dicty[(h,m)])\r\n\t\telse:\r\n\t\t\tdicty[(h,m)]=1\r\n\tprint(mx)\r\n\r\n\t\r\n\t\r\n\r\n\t\r\n\t\r\n\treturn\r\n\r\n\r\n\t\t\t\r\nsolution()", "n = int(input())\r\nx = -1\r\ny = -1\r\nz = 0\r\nc = 0\r\nfor _ in range(n):\r\n (a, b) = map(int, input().split())\r\n if a == x and b == y:\r\n c += 1\r\n else:\r\n c = 1\r\n if c > z:\r\n z = c\r\n x=a\r\n y=b\r\nprint(z)", "d={}\r\nfor i in range(int(input())):\r\n\ts=input()\r\n\td[s]=d.get(s,0)+1\r\nprint(max(d.values()))\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n", "n = int(input())\r\ncount, max_count = 1, 1\r\nh1, m1 = -1, -1\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n if h == h1 and m == m1:\r\n count += 1\r\n if count > max_count:\r\n max_count = count\r\n else:\r\n count = 1\r\n h1, m1 = h, m\r\nprint(max_count)", "d = {}\r\nfor i in range(int(input())):\r\n m = input()\r\n d[m] = d.get(m, 0) + 1\r\nprint(max(d.values()))", "\r\n# import math\r\n# for i in range(int(input())):\r\n # h,m=map(int,input().split())\r\n # s=input()\r\n # arr=list(map(int,input().split()))\r\nfrom typing import Counter\r\n\r\n\r\nn=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\ncnt=Counter()\r\nfor i in arr:\r\n cnt[i]+=1\r\nvalues=list(cnt.values())\r\nvalues.sort()\r\nprint(values[-1])\r\n \r\n\r\n\r\n", "def cafeteria(cases):\r\n stack = []\r\n worker = 0\r\n workerDis = 0;\r\n for n in range(cases):\r\n stack.append(input())\r\n stack.append(10000000)\r\n time_actual =stack[0]\r\n for n in range(len(stack)):\r\n if stack[n]==time_actual:\r\n workerDis-=1\r\n else:\r\n if workerDis<0:\r\n worker+=-workerDis\r\n workerDis=worker-1\r\n time_actual=stack[n]\r\n return worker\r\n\r\n\r\ndef main():\r\n cases = int(input())\r\n print(cafeteria(cases))\r\n\r\n\r\nmain()", "'''\r\n-------------------------------------------------------\r\n\t\tCompetitive programing\r\n\t\tName: Đào Xuân Hoàng Tuấn (Salmon1)\r\nNothing is impossible, as you as you believe you can do it\r\n\t\t You can do it!!!\r\n-------------------------------------------------------\r\n'''\r\nn = int(input())\r\ncnt = [0]*1500\r\n\r\nfor i in range(n):\r\n\ta, b = map(int, input().split())\r\n\tcnt[a*60+b] += 1\r\n\r\n\r\nma = 0\r\nfor i in range(len(cnt)):\r\n\tif ma < cnt[i]:\r\n\t\tma = cnt[i]\r\nprint(ma)\r\n", "n = int(input())\r\nmints = [0]*(24*60)\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n mints[h*60+m]+=1\r\nprint(max(mints))\r\n ", "last_customer = ''\ncashes_needed = 1\ncounter = 1\nfor customer in range(int(input())):\n current_customer = input()\n if current_customer == last_customer:\n counter += 1\n else:\n counter = 1\n if counter > cashes_needed:\n cashes_needed = counter\n last_customer = current_customer\nprint(cashes_needed)\n\n\n", "t = int(input())\r\nlst = []\r\nfor _ in range(t):\r\n a, b = map(int, input().split())\r\n lst.append((a, b))\r\n\r\nmx = 0\r\ni = 0\r\nwhile i < t:\r\n cur = lst[i]\r\n c = 0\r\n while i < t and lst[i] == cur:\r\n i += 1\r\n c += 1\r\n mx = max(mx, c)\r\n\r\nprint(mx)\r\n\r\n", "l = [ [ 0 for i in range(60)] for j in range(24) ]\r\nn = int(input())\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n l[x][y]+=1\r\ncount=1\r\nfor i in range(0,24):\r\n for j in range(0,60):\r\n if l[i][j]>count:\r\n count = count + (l[i][j]-count)\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "t=int(input())\r\nr={}\r\nfor i in range(t):\r\n\ts=input()\r\n\tr[s]=r.get(s,0)+1\r\nprint(max(r.values()))\r\n", "n = int(input())\r\nd = {}\r\nfor i in range(n):\r\n h,m = map(int ,input().split())\r\n k = h*60 + m\r\n if k in d.keys():\r\n d[k] += 1\r\n else:\r\n d[k] = 1\r\nt = int(max(d.values()))\r\nprint(t)\r\n", "customers = int(input())\r\ntimes = {}\r\nfor i in range(customers):\r\n h , m = map(int , input().split())\r\n if f\"{h}:{m}\" not in times:\r\n times[f\"{h}:{m}\"] = 1\r\n else:\r\n times[f\"{h}:{m}\"] += 1\r\n\r\nmax = 0\r\nfor k , v in times.items():\r\n if v > max:\r\n max = v\r\n\r\nprint(max)\r\n\r\n", "n=int(input())\r\na={}\r\nfor _ in range(n):\r\n s=input()\r\n if s in a:\r\n a[s]+=1\r\n else:\r\n a[s]=1\r\nprint(max(a.values()))\r\n", "n,m,a=int(input()),1,\"\"\r\nfor i in range(n):\r\n b=input()\r\n if a==b:\r\n c+=1\r\n m=max(m, c)\r\n else:\r\n c=1\r\n a=b\r\nprint(m)", "def main():\n n = int(input())\n d = {}\n for _ in range(n):\n key = tuple(map(int, input().split(\" \")))\n if key not in d:\n d[key] = 0\n d[key] += 1\n print(max(d.values()))\n\n\nif __name__ == \"__main__\":\n main()\n", "f = dict()\r\nfor i in range(int(input())):\r\n a,b = list(map(int,input().split()))\r\n c = 60*a + b\r\n try:\r\n f[c] += 1\r\n except KeyError:\r\n f[c] = 1\r\nprint(max(f.values()))", "from collections import defaultdict\r\nfrom sys import stdin\r\nd = defaultdict(int)\r\nfor _ in range(int(stdin.readline())):\r\n h, m = map(int, stdin.readline().strip().split())\r\n d[60*h + m] +=1\r\nprint(max(d.values()))", "ans = 0\r\nrun = 0\r\nfor n in range(int(input())):\r\n h,m = input().split()\r\n cur_time = (h,m)\r\n if n == 0:\r\n past_time = cur_time\r\n run = 1\r\n elif past_time == cur_time:\r\n run +=1\r\n ans = max(run,ans)\r\n else:\r\n past_time = cur_time\r\n run = 1\r\n\r\nans = max(run,ans)\r\nprint(ans)\r\n", "n=int(input())\r\ncus=[[0,0] for _ in range(n)]\r\nfor i in range(n):\r\n cus[i]=[int(x) for x in input().split()]\r\ncashes=1\r\nmax_cash=1\r\nfor i in range(1,n):\r\n if cus[i-1]==cus[i]:\r\n cashes+=1\r\n max_cash=max(max_cash,cashes)\r\n else:\r\n cashes=1\r\nprint(max_cash)", "# from collections import Counter\r\n# import operator\r\n# NUMBER=int(input())\r\n# l=[],my_dict={}\r\n# for _ in range(NUMBER):\r\n# HOURS,MIN=map(int,input().split())\r\n# l.append((HOURS,MIN))\r\n# my_dict=Counter(l)\r\n# my_dict= list(reversed(list(dict(sorted(my_dict.items(), key=operator.itemgetter(1))).values())))\r\n# print(my_dict[0])\r\n\r\nfrom collections import defaultdict\r\nimport operator\r\n\r\nNUMBER = int(input())\r\ncounts = defaultdict(int)\r\nfor _ in range(NUMBER):\r\n HOURS, MIN = map(int, input().split())\r\n counts[(HOURS, MIN)] += 1\r\nsorted_counts = sorted(counts.items(), key=operator.itemgetter(1), reverse=True)\r\nmost_common_count = sorted_counts[0][1]\r\nprint(most_common_count)", "from unittest import result\r\n\r\n\r\nn=int(input())\r\nd={}\r\nfor i in range(0,n):\r\n a,b=map(int,input().split(\" \"))\r\n result=a*60+b\r\n if result not in d:\r\n d[result]=1\r\n else:\r\n d[result]+=1\r\nprint(max(list(d.values())))\r\n\r\n", "# https://codeforces.com/problemset/problem/237/A\n\nfrom collections import defaultdict\n\nlines = int(input())\nkeys = defaultdict(int)\n\nfor _ in range(lines):\n line = input()\n keys[line] += 1\n\nprint(max(keys.values()))", "def getint(): return int(input().strip())\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible(): print(-1),exit(0)\r\n \r\nn = getint()\r\ns = {}\r\nfor i in range(n):\r\n x = tuple(getints())\r\n if x in s: s[x]+=1\r\n else: s[x] = 1\r\n\r\nans = -1\r\nfor a,b in s.items():\r\n ans = max(ans,b)\r\nprint(ans)", "a={}\r\nfor i in range(int(input())):\r\n\ts=input()\r\n\ta[s]=a.get(s,0)+1\r\nprint(max(a.values()))", "n=int(input())\r\nm=[input()for i in range(n)]\r\nc={}\r\nfor i in range(n):\r\n c[m[i]]=0\r\nfor i in range(n):\r\n c[m[i]]+=1\r\nmx=0\r\n\r\nfor i in c:\r\n if c[i]>mx:\r\n mx=c[i]\r\nprint(mx)\r\n'''kas=1\r\n'b=[]\r\nfor i in range(n-1):\r\n if m[i]==m[i+1]:\r\n kas+=1\r\n else:\r\n b.append(kas)\r\n kas=1\r\n \r\n\r\nprint(max(b)) \r\n'''\r\n", "n=int(input())\r\nL={}\r\nfor i in range(n):\r\n time=input()\r\n if time in L:\r\n L[time]+=1\r\n else:\r\n L[time]=1\r\nfrq=list(L.values())\r\nprint(max(frq))\r\n ", "n=int(input())\r\nm=0\r\nfor i in range(n):\r\n if i==0:\r\n s=input()\r\n cnt=1\r\n m=max(m,cnt)\r\n s_last=s\r\n else :\r\n s=input()\r\n if s==s_last:\r\n cnt+=1\r\n else :\r\n cnt=1\r\n m=max(m,cnt)\r\n s_last=s\r\nprint(m)", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nimport functools\r\nfrom operator import itemgetter, attrgetter\r\nfrom collections import Counter\r\n\r\nif __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n N = lambda: int(input())\r\n\r\n n = N()\r\n a = list()\r\n MAX = 1\r\n\r\n while n > 0:\r\n h, m = P()\r\n a.append((h, m))\r\n n -= 1\r\n b = Counter(a)\r\n for i in b.values():\r\n if i > MAX:\r\n MAX = i\r\n print(MAX)", "n=int(input())\r\ncount=0\r\nkassa=1\r\nf=[]\r\nif n>0:\r\n kassa=1\r\nfor i in range(n):\r\n h,m=map(int,input().split())\r\n h=h*60+m\r\n f.append(h)\r\nfor i in range(1,n):\r\n if f[i]!=f[i-1]:\r\n count=kassa\r\n count-=1\r\n else:\r\n if count>0:\r\n count-=1\r\n else:\r\n kassa+=1\r\nprint(kassa)\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n n = (x, y)\r\n l.append(n)\r\n\r\nd = {}\r\n\r\nfor item in l:\r\n if item not in d:\r\n d[item] = 1\r\n else:\r\n d[item] += 1\r\n\r\nmx = 1\r\nfor key, value in d.items():\r\n mx = max(mx, value)\r\n \r\nprint(mx)", "n = int(input())\n\nans = 1\nprev = ''\ncur = 1\nfor _ in range(n):\n s = input()\n if s == prev:\n cur += 1\n ans = max(ans, cur)\n else:\n cur = 1\n prev = s\n\nprint(ans)\n\n", "n = int(input())\n\nfreq = {}\nans = 0\n\nfor _ in range(n):\n h, m = map(int, input().split())\n val = h * 60 + m\n if val in freq:\n freq[val] += 1\n else:\n freq[val] = 1\n ans = max(ans, freq[val])\n\nprint(ans)\n", "n = int(input())\r\na = []\r\nfor i in range(0, n):\r\n h, m = input().split()\r\n h = int(h)\r\n m = int(m)\r\n s = h * 60 + m\r\n a.append(s)\r\na.sort()\r\nans = 1\r\nmaxi = 1\r\nfor i in range(1, len(a)):\r\n if a[i] == a[i-1]:\r\n ans = ans + 1\r\n if ans > maxi:\r\n maxi = ans\r\n \r\n if a[i] != a[i-1]:\r\n ans = 1\r\nprint(maxi)\r\n", "from collections import defaultdict\r\nn=int(input())\r\ndp=[[0]*(60) for _ in range(25)]\r\nmaxi=-1\r\nfor i in range(n):\r\n h,m=map(int,input().split())\r\n dp[h][m]+=1\r\nfor i in range(23):\r\n maxi=max(maxi,max(dp[i]))\r\nprint(maxi)", "n=int(input())\r\nfrom collections import Counter\r\nc=Counter([])\r\nfor _ in range(n):\r\n hm=list(map(int,input().split()))\r\n h,m=hm\r\n c[(h,m)]+=1\r\nprint (max(c.values()))", "f = dict()\r\nfor i in range(int(input())):\r\n a = input()\r\n try:\r\n f[a] += 1\r\n except KeyError:\r\n f[a] = 1\r\nprint(max(f.values()))", "max = 1\r\narr = {}\r\nfor i in range(int(input())):\r\n inp = input()\r\n if inp in arr:\r\n arr[inp]+=1\r\n else:\r\n arr[inp]=1\r\n if arr[inp] > max:\r\n max = arr[inp]\r\nprint(max)", "n = int(input())\r\nt = [0]*24*60\r\nfor _ in range(n):\r\n h, m = map(int,input().split())\r\n k = h*60+m\r\n t[k] += 1\r\n\r\nprint(max(t))", "n = int(input())\r\nd = 0\r\nc = 0\r\nmlast = \"\"\r\nfor i in range(n):\r\n m = input()\r\n if m==mlast:\r\n d += 1\r\n else:\r\n c=max(d,c)\r\n d = 1\r\n mlast = m\r\nc=max(d,c)\r\nprint(c)\r\n", "ls = []\r\nfor _ in range(int(input())):\r\n ls.append([int,input().split()])\r\npresent = 1\r\nmx = 1\r\nfor i in range(1,len(ls)):\r\n if ls[i][0] == ls[i-1][0] and ls[i][1] == ls[i-1][1]:\r\n present+=1\r\n else:\r\n present = 1\r\n mx = max(mx,present)\r\nprint(mx)", "n = int(input())\r\n\r\ntimes = set()\r\ncount = dict()\r\n\r\nwhile n>=1:\r\n n-=1\r\n s = input()\r\n bef = len(times)\r\n times.add(s)\r\n aft = len(times)\r\n if bef == aft:\r\n count[s] += 1\r\n else:\r\n count.update({s:1})\r\n\r\nmx = -1\r\n\r\nfor i in count.values():\r\n if i > mx:\r\n mx = i\r\n\r\nprint(mx)", "n = int(input())\r\n\r\n\r\nprevious = list(map(int,input().split()))\r\nmaxscore = 1\r\nscore = 1\r\nfor t in range(1,n):\r\n current = list(map(int,input().split()))\r\n #print(previous, current)\r\n if previous == current:\r\n score += 1\r\n else:\r\n if score > maxscore:\r\n maxscore = score\r\n score = 1\r\n previous = current\r\nif score > maxscore:\r\n maxscore = score\r\nprint(maxscore)", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n n = int(input())\n cashes = 0\n cus_dict = {}\n for _ in range(n):\n cus = input()\n if cus not in cus_dict:\n cus_dict[cus] = 1\n else:\n cus_dict[cus] += 1\n if cus_dict[cus] > cashes:\n cashes = cus_dict[cus]\n print(cashes)\n\n\nif __name__ == \"__main__\":\n main()\n", "n=int(input())\r\ncount=1\r\nmaxx=-float('inf')\r\nh,m=map(int,input().split())\r\nprev=(h,m)\r\nfor _ in range(n-1):\r\n h,m=map(int,input().split())\r\n if (h,m)==prev:\r\n count+=1\r\n else:\r\n count=1\r\n maxx=max(maxx,count)\r\n prev=(h,m)\r\nmaxx=max(maxx,count)\r\nprint(maxx)", "n=int(input())\nans=1\ncount={}\nwhile n>=1:\n n-=1\n a,b=map(int,input().split())\n tmp=a*60+b\n if tmp in count:\n count[tmp]+=1\n else:\n count[tmp]=1\nprint(max(count.values()))", "n=int(input())\r\ncli=[]\r\n\r\nfor _ in range(n):\r\n cli.append(input())\r\n \r\nd = dict.fromkeys(cli,0)\r\n\r\nfor i in range(n):\r\n d[cli[i]]+=1\r\n \r\nprint(max(list(d.values())))", "dict={}\r\nn=int(input(\"\"))\r\nwhile n :\r\n h,m=[int(x) for x in input(\"\").split() ]\r\n dict[f\"{h} {m}\"]=dict.get(f\"{h} {m}\",0)+1\r\n n-=1\r\nprint(max(dict.values()))", "# Free Cash\r\nnew = {}\r\nfor i in range(int(input())):\r\n x = input().split(\" \")\r\n h,m = int(x[0]),int(x[1])\r\n s = str(h)+\": \"+str(m)\r\n if s not in new:\r\n new[s] = 1\r\n else:\r\n new[s] += 1\r\nprint(max(new.values()))", "n = int(input())\r\nc=1\r\nstk=[]\r\nfor _ in range(n):\r\n h,m=list(map(int,input().split()))\r\n if len(stk)==0:\r\n stk.append((h,m))\r\n else:\r\n if h!=stk[-1][0] or m!=stk[-1][1]:\r\n while len(stk)!=0:\r\n stk.pop()\r\n stk.append((h,m))\r\n \r\n c = max(c,len(stk))\r\nprint(c)\r\n", "n = int(input())\n\nhashSet = {}\n\nfor _ in range(n):\n h, m = map(int, input().split())\n\n tup = (h, m)\n\n if tup in hashSet: hashSet[tup]+=1\n\n else: hashSet[tup] = 1\n\n\nres = 0\n\nfor key in hashSet.keys():\n res = max(res, hashSet[key])\n\n\nprint(res)", "n = int(input())\r\nclients = []\r\nnumber = []\r\n\r\nfor i in range(n):\r\n inp = list(map(int, input().split()))\r\n if inp[0]*60 + inp[1] in clients:\r\n number[clients.index(clients[-1])] +=1\r\n else:\r\n clients.append(inp[0]*60 + inp[1])\r\n number.append(1)\r\n\r\nprint(max(number))", "\r\nn=int(input())\r\ncount=1\r\nhi=[0]*n\r\nmi=[0]*n\r\nlst=[1]*n\r\nt=0\r\n\r\nhi[0],mi[0]=map(int,input().split())\r\nfor i in range(1,n):\r\n\thi[i],mi[i]=map(int,input().split())\r\n\r\n\tif hi[i]==hi[i-1] and mi[i]==mi[i-1]:\r\n\t\tlst[t]+=1\r\n\telse:\r\n\t\tt+=1\r\n\r\nprint(max(lst))", "def main():\r\n n = int(input())\r\n d = {}\r\n for _ in range(n):\r\n x, y = map(int, input().split())\r\n if (x,y) not in d:\r\n d[(x,y)] = 1\r\n else:\r\n d[(x,y)] += 1\r\n dd = sorted(d.items(), key= lambda x: x[1], reverse= True)\r\n print (dd[0][1])\r\n \r\nmain()", "n = int(input())\r\n\r\nHash = dict()\r\nfor x in range(n):\r\n a,b = map(int,input().split(\" \"))\r\n temp = a + b/100\r\n if(temp in Hash.keys()):\r\n Hash[temp] += 1\r\n else: \r\n Hash[temp] = 1\r\ncou = 0\r\nfor i in Hash:\r\n if(cou < Hash[i]):\r\n cou = Hash[i]\r\n\r\n \r\nprint(cou)\r\n \r\n\r\n\r\n ", "def main() :\r\n n = int(input())\r\n d = {}\r\n for _ in range(n):\r\n h = input()\r\n d[h] = d.get(h,0)+1\r\n print(max(d.values())) \r\n\r\nmain()", "def main():\r\n n=int(input())\r\n d={}\r\n for i in range(n):\r\n a,b=map(int,input().split())\r\n if (a,b) in d:\r\n d[(a,b)]+=1\r\n else:\r\n d[(a,b)]=1\r\n print(max(d.values()))\r\nmain()", "w = int(input())\r\nl = input()\r\nc = 1\r\nr=1\r\nfor x in range(w-1):\r\n n=input()\r\n if(n==l):\r\n r+=1\r\n else:\r\n r=1\r\n if(r>c):\r\n c=r\r\n l=n\r\nprint(c)", "n=int(input())\nl,res=[],1\nfor _ in range(n):\n\th,m=map(int,input().split())\n\tl.append([h,m])\ni=1\nwhile i<n:\n\tif l[i][0]==l[i-1][0]:\n\t\tt,j=1,i\n\t\twhile j<n:\n\t\t\tif l[j][1]!=l[j-1][1]:\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tt+=1\n\t\t\t\tj+=1\n\t\tres=max(res,t)\n\t\tif j>=n:\n\t\t\ti=j\n\t\telse:i=j+1\n\telse:\n\t\ti+=1\n\t\t\nprint(res)\n\t\t\t\t", "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 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(N, arr):\r\n arr = [h*60 + m for h, m in arr]\r\n left = 0\r\n ans = 1\r\n\r\n while left < N:\r\n right = left + 1\r\n\r\n while right < N and arr[left] == arr[right]:\r\n right += 1\r\n\r\n count = right - left\r\n ans = max(ans, count)\r\n\r\n left = right\r\n\r\n return ans\r\n\r\n\r\nN = read_int()\r\narr = []\r\n\r\nfor t in range(N):\r\n arr.append(read_numeric_list())\r\n\r\nprint(solve(N, arr))\r\n", "n = int(input())\r\ncustomers = []\r\n\r\nfor _ in range(n):\r\n h, m = map(int, input().split())\r\n customers.append((h, m))\r\n\r\ncustomers.sort() # Sort the customers by arrival time\r\n\r\nmax_customers = 0\r\ncurrent_customers = 0\r\n\r\nfor i in range(n):\r\n h, m = customers[i]\r\n if current_customers == 0:\r\n current_customers += 1\r\n else:\r\n if customers[i - 1][0] == h and customers[i - 1][1] == m:\r\n current_customers += 1\r\n else:\r\n current_customers = 1\r\n max_customers = max(max_customers, current_customers)\r\n\r\nprint(max_customers)\r\n", "from collections import Counter\nn = int(input())\nprint(max(Counter(input() for i in range(n)).values()))\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 Free_Cash():\r\n n = inp()\r\n\r\n sequence2_H = []\r\n sequence2_M = []\r\n longest_same_stream = 1\r\n current_same_stream = 1\r\n\r\n for i in range(n):\r\n h , m = invr()\r\n\r\n if len(sequence2_H) == 0:\r\n sequence2_M.append(m)\r\n sequence2_H.append(h)\r\n \r\n else:\r\n if h == sequence2_H[len(sequence2_H)-1] and m == sequence2_M[len(sequence2_M)-1]:\r\n current_same_stream += 1\r\n if current_same_stream > longest_same_stream:\r\n longest_same_stream = current_same_stream\r\n else:\r\n current_same_stream = 1\r\n\r\n sequence2_M.append(m)\r\n sequence2_H.append(h)\r\n \r\n print(longest_same_stream)\r\n return \r\n\r\nFree_Cash()", "n=int(input())\r\nd={}\r\nfor i in range(n):\r\n s=input()\r\n try:\r\n d[s]=d[s]+1\r\n except:\r\n d[s]=1\r\nprint(max(d.values()))", "inp = int(input())\r\n\r\np_h = -1\r\np_m = -1\r\nm_z = 0\r\nz = 0\r\n\r\nfor _ in range(inp):\r\n h, m = map(int, input().split())\r\n \r\n if h == p_h and m == p_m:\r\n z += 1\r\n else:\r\n z = 1\r\n if z > m_z:\r\n m_z = z\r\n p_h, p_m = h, m\r\n\r\nprint(m_z)", "import sys\nfrom statistics import *\n\nn = int(input())\na = []\nfor i in range(n):\n t = input()\n a.append(t)\nprint(a.count(mode(a)))\n", "#Consistency is the key :)\r\n#code by: amrit2000\r\nfrom sys import stdin,stdout\r\nimport math\r\nimport bisect\r\ninput=stdin.readline\r\ndef print(x='',y='',end='\\n'):\r\n if y=='':\r\n stdout.write(str(x)+end)\r\n else:\r\n stdout.write(str(x)+' '+str(y)+end)\r\n\r\ndef solve():\r\n n=int(input())\r\n d={}\r\n for i in range(n):\r\n t=tuple(map(int,input().split()))\r\n if t in d:\r\n d[t]+=1\r\n else:\r\n d[t]=1\r\n\r\n print(max(d.values()))\r\n \r\ntt=1\r\n#tt=int(input())\r\nfor __ in range(tt):\r\n solve()\r\n", "n = int(input())\r\nh = []\r\nm = []\r\nfor i in range(0, n):\r\n\ttime = input().split(\" \")\r\n\th.append(int(time[0]))\r\n\tm.append(int(time[1]))\r\nmaxCustomers = 0\r\ncurrent = 0\r\nhour = -1\r\nminute = -1\r\nfor e in range(0, n):\r\n\tif e is 0:\r\n\t\tcurrent += 1\r\n\t\tmaxCustomers = 1\r\n\t\thour = h[e]\r\n\t\tminute = m[e]\r\n\telif hour is h[e] and minute is m[e]:\r\n\t\tcurrent += 1\r\n\t\tif current > maxCustomers:\r\n\t\t\tmaxCustomers = current\r\n\telse:\r\n\t\thour = h[e]\r\n\t\tminute = m[e]\r\n\t\tcurrent = 1\r\nprint(maxCustomers)", "d={}\r\nfor t in range(int(input())):\r\n s=input()\r\n if s in d.keys():\r\n d[s]+=1\r\n else:\r\n d[s]=1\r\nprint(max(d.values()))", "t = int(input())\r\n\r\ntemp=0\r\nans=0\r\nfor x in range(t):\r\n targ = input()\r\n if x==0:\r\n target=targ\r\n temp=1\r\n else:\r\n if target==targ:\r\n temp+=1\r\n else:\r\n ans = max(temp,ans)\r\n temp=1\r\n target=targ \r\nans=max(temp,ans)\r\nprint(ans)", "n=int(input())\r\nk=1\r\ns=[1]\r\np=1\r\nfor i in range(n):\r\n r=list(map(int,input().split()))\r\n r1=str(r)\r\n s.append(r1)\r\nfor i in range(1,len(s)):\r\n if s[i]==s[i-1]:\r\n p+=1\r\n if p>k:\r\n k+=1\r\n else:\r\n p=1\r\n \r\n continue\r\n\r\nprint(k)", "data=[0]*1440\r\n\r\nfor i in range(int(input())):\r\n time=[int(i) for i in input().split()]\r\n data[time[0]*60+time[1]]+=1\r\n \r\nprint(max(data))\r\n", "a = int(input())\r\ntim = [[0] * 60 for i in range(25)]\r\nmx = 0\r\nfor i in range(a):\r\n t = list(map(int, input().split()))\r\n tim[t[0]][t[1]] += 1\r\n mx = max(mx,tim[t[0]][t[1]])\r\nprint(mx)", "n = int(input())\n\ntimes = {}\n\nneeded = 1\n\nfor i in range(n):\n joined = input()\n\n if joined in times:\n times[joined] += 1\n if times[joined] > needed:\n needed = times[joined]\n else:\n times[joined] = 1\n\nprint(needed)\n \t\t\t\t\t\t \t\t\t\t \t\t\t \t\t\t \t", "n = int(input())\r\ntimes = []\r\nfor i in range(n):\r\n l = input()\r\n l = l.replace(\" \", \"\")\r\n times.append(l)\r\n\r\ncurCash = 1 \r\nmaxCash = 1\r\nfor i in range(n - 1):\r\n if (times[i] == times[i+1]):\r\n curCash += 1 \r\n maxCash = max(curCash, maxCash)\r\n else:\r\n curCash = 1 \r\nprint(maxCash)\r\n", "time = {}\r\nmaxfreq = -1\r\nfor _ in range(int(input().strip())):\r\n h, m = map(int, input().strip().split())\r\n if h not in time:\r\n time[h] = {}\r\n time[h][m] = time[h].get(m, 0) + 1\r\n maxfreq = max(maxfreq, time[h][m])\r\nprint(maxfreq)\r\n ", "n=int(input())\r\nlist1=[]\r\nlist2=[]\r\ncount=1\r\nmx=1\r\nfor x in range(n):\r\n a,b=list(map(int,input().split()))\r\n list1.append(a)\r\n list2.append(b)\r\nfor x in range(n-1):\r\n if list1[x]==list1[x+1] and list2[x]==list2[x+1]:\r\n count+=1\r\n else:\r\n count=1\r\n mx=max(mx,count)\r\nprint(mx)", "n = int(input())\r\nmax_cash, cash, h1, m1 = 1, 1, -1, -1\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n if h1 == h and m1 == m:\r\n cash += 1\r\n if max_cash < cash:\r\n max_cash = cash\r\n else:\r\n cash = 1\r\n h1, m1 = h, m\r\nprint(max_cash)\r\n", "n = int(input())\r\ncnt = 1\r\na = []\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n tm = h * 60 + m\r\n a.append(tm)\r\nc = [1]\r\nfor i in range(n):\r\n if a[i] == a[i - 1] and i !=0:\r\n cnt += 1\r\n c.append(cnt)\r\n else:\r\n cnt = 1\r\ncnt = max(c)\r\nprint(cnt)", "z=int(input())\r\nd={}\r\nfor i in range(z):\r\n x=list(map(int,input().split()))\r\n if d.get(str(x),0)==0:\r\n d[str(x)]=1\r\n else:\r\n d[str(x)]+=1\r\nprint(max(d.values()))", "\"\"\"\nhttps://codeforces.com/problemset/problem/237/A\n\"\"\"\nclients = int(input())\narrivees = dict()\nfor _ in range(clients):\n heure, minutes = [int(x) for x in input().split()]\n arrivees[heure * 60 + minutes] = arrivees.get(heure * 60 + minutes, 0) + 1\nmaxi = 0\nfor a in arrivees.values():\n if a > maxi:\n maxi = a\nprint(maxi)\n", "n = int(input())\r\narr = []\r\nvis = [0]*(24*60)\r\nans = 1\r\ncurr = 1\r\nfor _ in range(n):\r\n a, b = list(map(int, input().split()))\r\n m = (a*60) + b\r\n if not vis[m]:\r\n curr = 1\r\n vis[m] = 1\r\n else:\r\n curr += 1\r\n ans = max(ans, curr)\r\nprint(ans)", "n=int(input())\r\n\r\nd1={}\r\nmaxm=0\r\n\r\nfor i in range(0,n):\r\n t1=tuple(map(int, input().split()))\r\n\r\n if t1 in d1.keys():\r\n d1[t1]+=1\r\n maxm=max(d1[t1],maxm)\r\n else:\r\n d1[t1]=1\r\n maxm=max(d1[t1],maxm)\r\n\r\nprint (maxm)\r\n", "from collections import Counter\r\na=[]\r\nfor _ in [0]*int(input()):\r\n h,m=map(int,input().split())\r\n a+=60*h+m,\r\nprint(max(Counter(a).values()))", "'''\r\n\n\n24.06.2021\r\n\n\n'''\n\n\r\n\r\nn = int (input ())\r\n\n\nss = input ().split (' ')\r\n\r\n\nh0 = int (ss [0])\r\n\nm0 = int (ss [1])\r\n\nkm = 1\r\n\nmm = 1\r\n\nfor i in range (1, n) :\n\r\n ss = input ().split (' ')\r\n\n h = int (ss [0])\n\r\n m = int (ss [1])\r\n\n if ( h == h0 and m == m0 ) :\r\n\n mm += 1\n\r\n if ( mm > km ) :\r\n\n km = mm\n\r\n else :\r\n\n h0 = h\r\n\n m0 = m\r\n\n mm = 1\r\n\r\n\n\nprint(km)\n\r\n", "import math\r\nfrom sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n ans = 1\r\n mp = {}\r\n for _ in range(n):\r\n h, m = map(int, input().split())\r\n if h in mp:\r\n if m in mp[h]:\r\n mp[h][m] += 1\r\n else:\r\n mp[h][m] = 1\r\n else:\r\n mp[h] = {}\r\n mp[h][m] = 1\r\n ans = max(ans, mp[h][m])\r\n print(f\"{ans}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nobj = {}\r\n\r\nfor _ in range(n):\r\n s = input()\r\n obj[s] = obj.get(s, 0) + 1\r\n\r\nm = max(obj[k] for k in obj)\r\nprint(m)", "n = int(input())\nevents = []\n\nfor _ in range(n):\n h, m = map(int, input().split())\n events.append((h * 60 + m, 1))\n events.append((h * 60 + m + 1, 0))\nevents.sort()\n\nmin_cash = 0\ncurrent_cust = 0\nfor _, event in events:\n if event == 1:\n current_cust += 1\n min_cash = max(min_cash, current_cust)\n else:\n current_cust -= 1\nprint(min_cash)\n\n\t\t \t\t\t\t\t \t \t \t \t \t \t\t\t", "dic = dict()\r\n\r\nfor _ in range(int(input())):\r\n n = input()\r\n if n not in dic.keys():\r\n dic[n] = 0\r\n else:\r\n dic[n] += 1\r\n\r\nmaxx = max(dic.values())\r\nprint(maxx+1)", "hsh=[[0]*60 for i in range(24)]\r\nmaxi=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n hsh[a][b]+=1\r\n maxi=max(maxi,hsh[a][b])\r\nprint(maxi)", "t=int(input())\r\ncash=1\r\ni=0\r\nM=[]\r\nfor j in range(t):\r\n L=list(map(int,input().split(\" \")))\r\n M.append(L)\r\n if j!=0:\r\n if M[j]==M[j-1]:\r\n i+=1\r\n else:\r\n i=0\r\n if i>=cash:\r\n cash+=1\r\nprint(cash)", "from collections import Counter\r\nl=[]\r\nfor i in range(int(input())):\r\n\tl.append(input())\r\nd=Counter(l)\r\nlv=d.values()\r\nprint(max(lv))", "n=int(input())\r\nm_c=1\r\nc=1\r\na,b=map(int,input().split())\r\nfor i in range(n-1):\r\n a1,b1=map(int,input().split())\r\n if a1==a and b1==b :\r\n c+=1\r\n if c>m_c:\r\n m_c=c\r\n else:\r\n a,b=a1,b1\r\n c=1\r\nprint(m_c)\r\n", "def serve(arr):\n ans = 1\n for i in arr:\n if len(arr[i]) == 1:\n continue\n tmp = 1\n for j in range(1, len(arr[i])):\n if arr[i][j] == arr[i][j-1]:\n tmp += 1\n else:\n ans = max(tmp, ans)\n tmp = 1\n ans = max(tmp, ans)\n return ans\nn = int(input())\narr = {}\nfor i in range(n):\n val = list(map(int, input().rstrip().split()))\n if val[0] in arr:\n arr[val[0]].append(val[1])\n else:\n arr[val[0]] = [val[1]]\nprint(serve(arr))", "ls = {}\r\nfor _ in range(int(input())):\r\n i = tuple(map(int, input().split()))\r\n if i in ls:\r\n ls[i] += 1\r\n else:\r\n ls[i] = 1\r\n\r\nprint(max(ls.values()))", "def solve(arr):\r\n n = [1]\r\n f = None\r\n for arr_i in arr:\r\n if f is None:\r\n f = arr_i\r\n elif arr_i[0] == f[0] and arr_i[1] == f[1]:\r\n n[len(n)-1] += 1\r\n else:\r\n f = arr_i\r\n n.append(1)\r\n \r\n return max(n)\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n arr = []\r\n\r\n for _ in range(n):\r\n h, m = map(int, input().split(\" \"))\r\n arr.append([h, m])\r\n\r\n print(solve(arr))", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\nt = 1\r\nres = 1\r\nh_prev, m_prev = list(map(int, stdin.readline().split()))\r\nfor _ in range(n - 1):\r\n h, m = list(map(int, stdin.readline().split()))\r\n if h == h_prev and m == m_prev:\r\n t += 1\r\n if t > res:\r\n res = t\r\n else:\r\n t = 1\r\n h_prev, m_prev = h, m\r\nprint(res)\r\n", "from collections import Counter\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n (a,b) = tuple(input().split())\r\n l.append((a,b))\r\nl = Counter(l).most_common(1)\r\nprint(l[0][1])", "n=int(input())\r\nd=dict()\r\nfor index in range(n):\r\n\tx,y=map(int,input().split())\r\n\tz=60*x+y\r\n\tif z in d:\r\n\t\td[z]+=1\r\n\telse:\r\n\t\td[z]=1\r\nfor i in sorted(d.items(),key=lambda x:x[1],reverse=True):\r\n\tprint(i[1])\r\n\tbreak", "n = int(input())\r\n\r\nhashVal = {}\r\n\r\n\r\nfor _ in range(n):\r\n h,m = map(int,input().split())\r\n\r\n if (h,m) not in hashVal:\r\n hashVal[(h,m)] = 1\r\n\r\n else:\r\n hashVal[(h,m)]+=1\r\n\r\n\r\nmaxVal = float(\"-inf\")\r\nfor key in hashVal:\r\n maxVal = max(hashVal[key],maxVal)\r\n\r\nprint(maxVal)\r\n \r\n", "n = int(input())\nres = cur = 0\np = None\nfor _ in range(n):\n s = input()\n cur = cur + 1 if s == p else 1\n p = s\n res = max(res, cur)\nprint(res)\n", "n = int(input())\r\nfound = {}\r\n\r\nfor _ in range(n):\r\n cur = input()\r\n if cur not in found:\r\n found[cur] = 1\r\n else:\r\n found[cur] += 1\r\n\r\nprint(max(found.values()))", "from collections import Counter\nn = int(input())\nlst = []\nfor i in range(n):\n h, m = map(int, input().split())\n lst.append((h, m))\np = Counter(lst)\nprint(max(p.values()))", "from collections import Counter as C\r\ndef miis():\r\n return map(int, input().split())\r\n\r\na = []\r\nfor __ in range(int(input())):\r\n h, m = miis()\r\n a.append(h+60*m)\r\nc = C(a)\r\nprint(max(c.values()))\r\n", "import collections\r\n\r\nn = int(input())\r\nprint(max(collections.Counter(input() for _ in range(n)).values()))", "n = int(input())\r\ncashes = {}\r\nfor i in range(n):\r\n hm = tuple(map(int, input().split()))\r\n cashes[hm] = cashes.get(hm, 0) + 1\r\nprint(max(cashes.values()))", "n = int(input())\r\n\r\nstore = {}\r\nres = 1\r\n\r\nfor _ in range(n):\r\n h, m = [int(i) for i in input().split()]\r\n if f\"{h}-{m}\" in store:\r\n store[f\"{h}-{m}\"] += 1\r\n res = max(res, store[f\"{h}-{m}\"])\r\n else:\r\n store[f\"{h}-{m}\"] = 1\r\n\r\nprint(res)\r\n\r\n\r\n", "from collections import Counter as coun\r\nn=int(input()) \r\na=[]\r\nfor i in range(n):\r\n\th,m=map(int, input().split())\r\n\ta.append((h,m))\r\nd=coun(a).most_common()\r\nprint(d[0][1])", "tmp = \"\"\r\nMax = 1\r\nc = 1\r\n\r\nfor i in range(int(input())):\r\n s = input()\r\n if s == tmp:\r\n c += 1\r\n else:\r\n if Max < c:\r\n Max = c\r\n c = 1\r\n tmp = s\r\nprint(max(Max, c))\r\n", "if __name__ == '__main__':\r\n temp_list = []\r\n temp_list2 = []\r\n temp_dict = {}\r\n for _ in range(0,int(input())):\r\n x = input()\r\n temp_list.append(x)\r\n temp_dict[x] = 0\r\n #print(temp_dict)\r\n for i in temp_list: \r\n x = temp_dict.pop(i) \r\n x += 1\r\n temp_dict[i] = x\r\n #print(temp_dict)\r\n x = 0 \r\n for i in temp_dict:\r\n y = temp_dict[i]\r\n if x < y : \r\n x =y \r\n print(x)\r\n \r\n\r\n ", "def free_cash():\r\n times = {}\r\n for i in range(int(input())):\r\n costumer = input()\r\n if costumer not in times:\r\n times[costumer] = 1\r\n else:\r\n times[costumer] += 1\r\n print(max(list(times.values())))\r\n\r\nfree_cash()", "d={}\r\nfor _ in range(int(input())):\r\n\ta=input()\r\n\tif a in d:\r\n\t\td[a]+=1\r\n\telse:\r\n\t\td[a]=1\r\nprint(max(d.values()))", "n = int(input())\r\nk = []\r\nh1, m1 = -1, -1\r\nans = 1\r\nfor _ in range(n):\r\n h, m = map(int, input().split())\r\n if h != h1 or m != m1:\r\n k.append(ans)\r\n ans = 1\r\n else:\r\n ans +=1\r\n h1 = h+0\r\n m1 = m*1\r\nk.append(ans)\r\nprint(max(k))", "# LUOGU_RID: 101472535\nfrom collections import Counter\r\n(n,),*a=[tuple(map(int,s.split()))for s in open(0)]\r\nprint(Counter(a).most_common()[0][1])", "n = int(input())\r\nl = []\r\nc = {}\r\nmax_count = 0\r\n\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n x = h * 60 + m\r\n l.append(x)\r\n if x in c:\r\n c[x] += 1\r\n else:\r\n c[x] = 1\r\n max_count = max(max_count, c[x])\r\n\r\nprint(max_count)\r\n", "def main():\r\n n = int(input())\r\n prev = None\r\n answer = 0\r\n counter = 1\r\n for _ in range(n):\r\n time = input()\r\n if time == prev:\r\n counter += 1\r\n else:\r\n if counter > answer:\r\n answer = counter\r\n counter = 1\r\n prev = time\r\n print(max(answer, counter))\r\n\r\n\r\nmain()\r\n", "n1 = int(input())\r\ndp = {}\r\nmax1 = 1\r\nfor i in range(n1):\r\n x = input()\r\n if x not in dp:\r\n dp[x] = 1\r\n else:\r\n dp[x] += 1\r\n if dp[x] > max1:\r\n max1 = dp[x]\r\nprint(max1)", "from collections import Counter\r\n\r\nprint(max(Counter(input() for _ in range(int(input()))).values()))\r\n\r\n#########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n#########################################", "n = int(input())\r\nhours = []\r\nminutes = []\r\nfor i in range(n):\r\n h, m = list(map(int, input().split()))\r\n hours.append(h)\r\n minutes.append(m)\r\nc = 1\r\nbest = 1\r\nfor i in range(n-1):\r\n if hours[i] == hours[i+1] and minutes[i] == minutes[i+1]:\r\n\r\n c += 1\r\n else:\r\n best = max([c, best])\r\n c = 1\r\n\r\nbest = max([c, best])\r\nprint(best)\r\n\r\n# best = 0\r\n# current = [-1, -1]\r\n# c = 0\r\n# for hour, minute in zip(hours, minutes):\r\n#\r\n# if hour == current[0] and minute == current[1]:\r\n# c += 1\r\n# else:\r\n# best = max([best, c])\r\n# current = [hour, minute]\r\n# c = 0\r\n# print(best)\r\n#\r\n\r\n", "x=0\r\nl=[]\r\nd={}\r\nfor _ in range(int(input())):\r\n a,b=list(map(int,input().split()))\r\n if a not in d:\r\n d[a]=x\r\n x+=1\r\n l.append([b])\r\n else:\r\n l[d[a]].append(b)\r\nans=1\r\nfor i in l:\r\n x=sorted(i)\r\n d1={}\r\n for j in x:\r\n if j not in d1:\r\n d1[j]=1\r\n else:\r\n d1[j]+=1\r\n ans=max(ans,d1[j])\r\nprint(ans)", "n = int(input())\ndict = {}\ncash = 0\nfor _ in range(n):\n h_m = input()\n if h_m not in dict:\n dict[h_m] = 1\n else:\n dict[h_m] += 1\n if cash < dict[h_m]:\n cash = dict[h_m]\nprint(cash)\n \t\t \t \t\t \t \t\t \t \t \t\t\t\t\t\t\t\t", "l = []\r\n\r\nT = int(input()) \r\n\r\nfor i in range(0, T):\r\n a, b = map(int, input().split()) \r\n l.append((a, b))\r\n \r\nd = {}\r\nfor item in l:\r\n if item not in d:\r\n d[item] = 1\r\n else:\r\n d[item] += 1\r\n \r\n# print(d)\r\n\r\nmx = 1\r\nfor key, value in d.items():\r\n# print(key, value)\r\n mx = max(mx, value)\r\n \r\nprint(mx)", "n=int(input())\r\nA=[]\r\nD={}\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n A.append((a,b))\r\n if (a,b) in D:\r\n D[(a,b)]+=1\r\n else:\r\n D[(a,b)]=1\r\nprint(max(D.values()))", "a,b=-1,-1\r\nans=1\r\nc=[]\r\nfor i in range(int(input())):\r\n h,m=map(int,input().split())\r\n if h==a and m==b:\r\n ans+=1\r\n else:\r\n a=h\r\n b=m\r\n c.append(ans)\r\n ans=1\r\nc.append(ans)\r\nprint(max(c))\r\n", "def solve(n, ll):\r\n cnt = 1\r\n temp = [1]\r\n for i in range(1, n):\r\n if ll[i] == ll[i-1]:\r\n temp.append(temp[i-1] + 1)\r\n cnt = max(cnt, temp[i])\r\n else:\r\n temp.append(1)\r\n cnt = max(cnt, 1)\r\n return cnt\r\n\r\n\r\n \r\n\r\nn = int(input())\r\nll = []\r\nfor i in range(n):\r\n l = list(map(int, input().split()))\r\n ll.append(l)\r\nprint(solve(n, ll))", "n = int(input())\r\n\r\ntime = []\r\nfor i in range(n):\r\n h, m = [int(i) for i in input().split()]\r\n time.append((h, m))\r\n\r\nprev = (-1, -1)\r\nres = 0\r\ncount = 0\r\nfor i in time:\r\n if i == prev:\r\n count += 1\r\n else:\r\n count = 1\r\n prev = i\r\n res = max(res, count)\r\n\r\nprint(res)", "from collections import Counter\r\nn = int(input())\r\nlookup = [input() for _ in range(n)]\r\nlookup=Counter(lookup).most_common()\r\nprint(lookup[0][1])", "n = int(input())\r\n\r\nvisited = {}\r\n\r\nfor i in range(n):\r\n h, m = map(int, input().split())\r\n visited[(h, m)] = visited.get((h, m), 0) + 1\r\n\r\nprint(max(visited.values()))\r\n", "ab=[]\r\nd={}\r\n \r\nfor t in range(int(input())):\r\n a,b=map(int,input().split())\r\n ab.append([a,b])\r\n if (a,b) in d:\r\n d[(a,b)]+=1\r\n else:\r\n d[(a,b)]=1\r\nz=max(d,key=d.get)\r\nprint(d[z])", "ans,run,curr = 1,1,''\r\nfor i in range(int(input())):\r\n a = input()\r\n if i:\r\n if curr == a:\r\n run += 1\r\n else:\r\n curr = a\r\n ans = max(ans,run)\r\n run = 1\r\n else:\r\n curr = a\r\nprint(max(ans,run))", "n = int(input())\nclients = dict()\nfor i in range(n):\n time = input()\n if time in clients:\n clients[time] += 1\n else:\n clients[time] = 1\n\nprint(clients[max(clients,key=clients.get)])", "c = 1\r\nm = 1\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n if i!=0 and (x==px and y==py):\r\n c += 1\r\n m = max(c, m)\r\n elif i!=0 and (x!=px or y!=py):\r\n c = 1\r\n px = x\r\n py = y\r\nprint(m)\r\n", "'''\nset nilai last_jam dan last_menit = -1\t\t\t\t\t\t\t\t\t\t\t\t\t\t\ninput : n\t\t\t\t\t\t\t\t\t\t\t\t\t\t\nuntuk setiap orang, input jam dan menit :\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\n\tjika jam dan menit orang yang datang = jam dan menit orang terakhir, maka :\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\ttambah count_orang dengan 1\t\t\t\t\t\t\t\t\t\t\t\t\n\ttetapi jika jam dan menit nya berbeda, maka :\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\tset count_orang menjadi bernilai 1\t\t\t\t\t\t\t\t\t\t\t\t\n\t\tset nilai last_jam dan last_menit = jam dan menit orang sekarang\t\t\t\t\t\t\t\t\t\t\t\t\n\tjika dalam satu waktu nilai count_orang > max_sama :\t\t\t\t\t\t\t\t\t\t\t\t\t\n\t\tset nilai max_sama menjadi count_orang\t\t\t\t\t\n'''\n\nlast_jam, last_menit = -1, -1\nmax_sama, count_orang = 1, 1\n\nn = int(input())\nfor i in range(n):\n jam, menit = map(int, input().split())\n if jam == last_jam and menit == last_menit:\n count_orang += 1\n else :\n count_orang = 1\n last_jam, last_menit = jam, menit\n if count_orang > max_sama:\n max_sama = count_orang\n\nprint(max_sama)\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", "n=int(input())\r\ntime=[]\r\nfor i in range(n):\r\n t=list(map(int,input().split()))\r\n time.append(t[0]*60+t[1])\r\nfreq={}\r\nfor i in time:\r\n freq[i]=freq.get(i,0)+1\r\ncashes=sorted(list(freq.values()),reverse=True)\r\nprint(cashes[0])", "arr = {}\r\nfor i in range(int(input())):\r\n inp = input()\r\n if inp in arr:\r\n arr[inp] += 1\r\n else:\r\n arr[inp] = 1\r\nprint(max(arr.values()))", "a = 0\nt = 0\np = \"\"\nfor _ in range(0, int(input())):\n v = input()\n if v == p:\n t += 1\n else:\n t = 0\n a = max(t, a)\n p = v\n\nprint(a + 1)\n", "k={}\r\nfor i in range(int(input())):\r\n inp=input()\r\n if inp not in k:\r\n k[inp]=1\r\n else:\r\n k[inp]+=1\r\nprint(max(k.values()))", "from itertools import groupby\r\nvisitors = int(input())\r\nhour_itog =[]\r\nresult = []\r\nitog = []\r\nfor i in range(visitors):\r\n time, hour = input().split()\r\n hour_itog.append(time + ':' + hour)\r\nfor k, j in groupby(hour_itog):\r\n result.append(list(j))\r\nfor i in result:\r\n itog.append(len(i))\r\n \r\nprint(max(itog))", "\r\nn = int(input())\r\n\r\nfreq = {}\r\n\r\nwhile n:\r\n s = input()\r\n\r\n if s in freq:\r\n freq[s] += 1\r\n else:\r\n freq[s] = 1\r\n\r\n n -= 1\r\n\r\nconcurrent = 0\r\nfor v in freq.values():\r\n concurrent = max(concurrent, v)\r\n\r\nprint(concurrent)\r\n", "sz = int(input());d ={}\r\nfor i in range(sz):\r\n t = input()\r\n if t in d:\r\n d[t] += 1\r\n else:\r\n d[t] = 1\r\nprint(max([j for i,j in d.items()]))\r\n\r\n", "n =int(input())\r\nc= {}\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n x = f'{a}:{b}'\r\n if(x in c.keys()):\r\n c[x]+=1\r\n else:\r\n c[x] = 1\r\nmax_key = max(c, key=lambda k: c[k])\r\nres = c[max_key]\r\nprint(res)\r\n", "l=[]\r\nfor _ in range(int(input())):\r\n m,n = map(int,input().split())\r\n l.append([m,n])\r\nc=1\r\nm = 1\r\nfor i in range(1,len(l)):\r\n if(l[i-1][0]==l[i][0] and l[i-1][1]==l[i][1]):\r\n c+=1\r\n m = max(m,c)\r\n else:\r\n c=1\r\nprint(m)\r\n \r\n \r\n ", "n = int(input())\r\na = [[j for j in input().split()] for i in range(n)] \r\nx= []\r\nfor i in range(len(a)):\r\n x.append(a[i][0] + ':' + a[i][1])\r\nh = {}\r\nmaxx = 1\r\nfor i in range(len(x)):\r\n if x[i] in h:\r\n h[x[i]] += 1\r\n if h[x[i]] > maxx:\r\n maxx = h[x[i]]\r\n else:\r\n h[x[i]] = 1\r\nprint(maxx)\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 Free_Cash():\r\n n = inp()\r\n \r\n timeH = []\r\n timeM = []\r\n\r\n for i in range(n):\r\n h,m = invr()\r\n timeH.append(h)\r\n timeM.append(m)\r\n \r\n currentPtr = 0 \r\n checkPtr = 0\r\n \r\n longestSameTime = 0 \r\n\r\n while checkPtr <= (n-1):\r\n if currentPtr == checkPtr:\r\n checkPtr += 1 \r\n currentSameTime = 0\r\n\r\n elif timeH[currentPtr] == timeH[checkPtr] and timeM[currentPtr] == timeM[checkPtr]:\r\n checkPtr += 1\r\n currentSameTime += 1\r\n if currentSameTime > longestSameTime:\r\n longestSameTime = currentSameTime\r\n else:\r\n currentPtr = checkPtr\r\n\r\n print(longestSameTime+1)\r\n return \r\n\r\n\r\n\r\nFree_Cash() ", "#https:https://codeforces.com/problemset/problem/237/A\r\n#abhay_codes\r\nn =int(input())\r\ns=set()\r\nmx=1\r\nd=dict()\r\nfor i in range(n):\r\n hr , mi=map(int,input().split())\r\n k=hr*60+mi\r\n if k not in d:\r\n d[k]=0 \r\n d[k]+=1 \r\n \r\n if d[k]>mx:\r\n mx=d[k]\r\n \r\n\r\nprint(mx)", "n = int(input())\r\ns = {}\r\nfor i in range(n):\r\n t = [int(i) for i in input().split()]\r\n t = t[0] * 60 + t[1]\r\n if t in s.keys():\r\n s[t] += 1\r\n else:\r\n s[t] = 1\r\n\r\nprint(max(s.values()))", "n = int(input())\r\nk = 1\r\nl = 1\r\na,b = map(int,input().split())\r\nc,d = a,b\r\nfor i in range (n-1):\r\n a,b = map(int,input().split())\r\n if c == a and d == b:\r\n k+=1\r\n else:\r\n k=1\r\n if k>l:\r\n l=k\r\n c,d = a,b\r\nprint (l)", "n= int(input())\r\narr=[0]*1000000\r\nfor i in range(n) :\r\n h,m=[int(x) for x in input().split()]\r\n t=h*60+m\r\n arr[t]+=1\r\nprint(max(arr))", "n = int(input())\r\nref = 1440 * [0]\r\nfor j in range(n):\r\n x, y = [int(j) for j in input().split()]\r\n time = x * 60 + y\r\n ref[time] += 1\r\nprint(max(ref))\r\n", "def main():\n no_of_customers = int(input())\n\n hour_i, minute_i, previous_hour, previous_minute = 0, 0, 0, 0\n no_of_customers_at_this_time, max_customers_arriving_together = 0, 0\n\n for i in range(1, no_of_customers + 1):\n data = input().split()\n hour_i, minute_i = map(int, data)\n\n if hour_i == previous_hour and minute_i == previous_minute:\n no_of_customers_at_this_time += 1\n else:\n no_of_customers_at_this_time = 1\n\n max_customers_arriving_together = max(max_customers_arriving_together, no_of_customers_at_this_time)\n\n previous_hour, previous_minute = hour_i, minute_i\n\n print(max_customers_arriving_together)\n\nif __name__ == \"__main__\":\n main()\n\t\t\t \t\t\t \t\t \t\t\t \t\t\t\t\t \t \t\t\t\t \t", "time = [0] * (24 * 60)\r\nmaxim = 0\r\nfor k in range(int(input())):\r\n a, b = map(int, input().split())\r\n time[a * 60 + b] += 1\r\n if time[a * 60 + b] > maxim:\r\n maxim = time[a * 60 + b]\r\n\r\nprint(maxim)\r\n", "customers = int(input())\ntime = [0] * 1440\n\nif customers<1 or customers>100000:\n #print(\"Invalid number of events\")\n #exit()\n pass\n\nfor i in range(customers):\n x = input()\n pieces = x.split(\" \")\n hr = int(pieces[0])\n min = int(pieces[1])\n if hr<1 or hr>24:\n #print(\"Invalid hours\")\n #exit()\n pass\n if min<1 or min>60:\n #print(\"Invalid minutes\")\n #exit()\n pass\n slot = (hr*60) + min\n time[slot] += 1\n\nprint(max(time))\n\n\t \t\t\t\t \t\t\t \t\t \t \t \t\t \t \t \t\t\t", "d={}\r\nfor i in range(int(input())):\r\n a=input()\r\n if a not in d:\r\n d[a]=1\r\n else:\r\n d[a]=d[a]+1\r\nprint(max(d.values()))", "n = int(input())\r\n\r\nr = 1\r\n\r\nlast = ''\r\nfor i in range(n):\r\n inp = input()\r\n if inp == last:\r\n x += 1\r\n else:\r\n x = 1\r\n r = max(r, x)\r\n last = inp\r\n\r\nprint(r)\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n a, b = map(str, input().split(\" \"))\r\n l.append((a, b)) # Store a tuple (a, b) in the list l\r\n\r\nd = {}\r\nfor i in l:\r\n if i not in d:\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\n\r\nprint(max(d.values()))\r\n", "n=int(input())\r\na={}\r\nb=set()\r\nfor i in range(0,n):\r\n\tk=input()\r\n\tif k in b:\r\n\t\ta[k]+=1\r\n\telse:\r\n\t\tb.add(k)\r\n\t\ta[k]=1\r\nb=list(b)\r\nm=0\r\nfor i in range(0,len(b)):\r\n\tk=a[b[i]]\r\n\tif k>m:\r\n\t\tm=k\r\nprint(m)", "def serve():\r\n n = int(input())\r\n timetable = dict()\r\n for _ in range(n):\r\n time = input().replace(\" \", \":\")\r\n timetable[time] = timetable.get(time, 0) + 1\r\n return max(timetable.values())\r\n\r\n\r\nprint(serve())\r\n", "mat = [[0 for i in range(60)] for j in range(24)]\r\ncus = 0 \r\nfor _ in range(int(input())): \r\n l = list(map(int,input().split())) \r\n mat[l[0]][l[1]] += 1 \r\n if(mat[l[0]][l[1]] > cus) : \r\n cus = mat[l[0]][l[1]]\r\n \r\n \r\nprint(cus)", "import collections\r\n\r\nn = int(input())\r\nlines = []\r\nfor i in range(n):\r\n lines.append(input())\r\nc = collections.Counter(lines)\r\n\r\nprint(max(c.values()))" ]

[ "def CalcMean(n,a,c,median,k):\r\n if k==0: return a[median]\r\n s = c[median+1] - c[median-k] + c[n] - c[n-k]\r\n return s/(2*k+1)\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nc=[0]\r\nfor i in range(n):\r\n c.append(c[-1]+a[i])\r\n\r\nans=optMed=optK=0\r\nfor median in range(n):\r\n L=0\r\n R=min(median,n-median-1)\r\n mid=(L+R)//2\r\n while R-L > 0:\r\n mean = CalcMean(n,a,c,median,mid)\r\n k = mid+1\r\n x = a[median-k]\r\n y = a[n-k]\r\n if (x+y)/2 <= mean:\r\n R = mid\r\n else:\r\n L = min(mid+1,R)\r\n mid=(L+R)//2\r\n\r\n mean = CalcMean(n,a,c,median,L)\r\n if ans <= mean - a[median]:\r\n ans = mean - a[median]\r\n optMed = median\r\n optK = L\r\n \r\nprint(2*optK+1)\r\nfor i in range(optMed-optK,optMed+1):\r\n print(a[i],end=' ')\r\nfor i in range(n-optK,n):\r\n print(a[i],end=' ')\r\n \r\n \r\n", "def fans(p, q):\r\n tans = sum[n] - sum[n - q] + sum[p + 1] - sum[p - q]\r\n tans -= x[p] * (2 * q + 1)\r\n return tans\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nsum = [0] * (n + 1)\r\nans = -1\r\nansp = 0\r\nansq = 0\r\nfor i in range(n):\r\n sum[i + 1] = sum[i] + x[i]\r\nfor i in range(n):\r\n k = 0\r\n for j in range(20, -1, -1):\r\n k += 1 << j\r\n if k > i or k > n - i - 1 or fans(i, k) * (2 * k - 1) < fans(i, k - 1) * (2 * k + 1):\r\n k -= 1 << j\r\n if fans(i, k) * (2 * ansq + 1) > ans * (2 * k + 1):\r\n ans = fans(i, k)\r\n ansp = i\r\n ansq = k\r\nprint(2 * ansq + 1)\r\nfor i in range(ansp - ansq, ansp + 1):\r\n print(x[i], end=\" \")\r\nfor i in range(n - ansq, n):\r\n print(x[i], end=\" \")\r\nprint()# 1693558701.658143", "from fractions import Fraction\r\n\r\ndef findMean(prefixSum, n, k, medianIdx):\r\n total = prefixSum[medianIdx + 1] - prefixSum[medianIdx - k] + prefixSum[n] - prefixSum[n - k]\r\n return Fraction(total, (2 * k + 1))\r\n\r\nn = int(input())\r\nnums = sorted(list(map(int, input().split())))\r\nans, bestK, bestMedianIdx = -1, 0, 0\r\n\r\nprefSum = [0]\r\nfor i in range(n):\r\n prefSum.append(prefSum[-1] + nums[i])\r\n\r\nfor medianIdx in range(n):\r\n rangeOfK = min(medianIdx, n - medianIdx - 1)\r\n left, right = 0, rangeOfK\r\n mid = (left + right) // 2\r\n while right > left:\r\n a = nums[n - mid - 1]\r\n b = nums[medianIdx - mid - 1]\r\n\r\n if (2 * mid + 1) * (a + b) <= 2 * (prefSum[medianIdx + 1] - prefSum[medianIdx - mid] + prefSum[n] - prefSum[n - mid]):\r\n right = mid\r\n else:\r\n left = mid + 1\r\n mid = (left + right) // 2\r\n\r\n bestCurrentMean = findMean(prefSum, n, left, medianIdx)\r\n if bestCurrentMean - nums[medianIdx] > ans: \r\n ans = bestCurrentMean - nums[medianIdx]\r\n bestMedianIdx = medianIdx\r\n bestK = left\r\n\r\nprint(2 * bestK + 1)\r\nfor i in range(bestK):\r\n print(nums[n - 1 - i], end = \" \")\r\nfor i in range(bestK+1):\r\n print(nums[bestMedianIdx - i], end = \" \")\r\n", "'''\r\nProblem: Simple Skewness\r\nURL: https://codeforces.com/contest/626/problem/E\r\nAuthor : Ayush Modi\r\nDiscord Tag : hot9cups#3125\r\n'''\r\n\r\nfrom fractions import Fraction\r\n# We need the fractions module because Python's inbuilt precision for floats isn't enough to solve the problem.\r\n# Fraction is roughtly Python's equivalent of C++'s long double.\r\n\r\ndef findMean(prefixSum, n, k, medianIdx):\r\n total = prefixSum[medianIdx + 1] - prefixSum[medianIdx - k] + prefixSum[n] - prefixSum[n - k]\r\n return Fraction(total, (2 * k + 1))\r\n\r\nn = int(input())\r\nnums = sorted(list(map(int, input().split())))\r\nbestSkewness, bestK, bestMedianIdx = 0, 0, 0\r\n\r\n# Compute Prefix Sums:\r\nprefSum = [0]\r\nfor i in range(n):\r\n prefSum.append(prefSum[-1] + nums[i])\r\n\r\nfor medianIdx in range(1, n-1):\r\n # We want to pick K elements to the left of medianIdx\r\n # and K elements from the end.\r\n # What's the largest possible value of K? \r\n\r\n rangeOfK = min(medianIdx, n - medianIdx - 1)\r\n left, right = 0, rangeOfK\r\n \r\n # mid is the current K\r\n mid = (left + right) // 2\r\n \r\n while right > left:\r\n a = nums[n - mid - 1]\r\n b = nums[medianIdx - mid - 1]\r\n\r\n if (2 * mid + 1) * (a + b) <= 2 * (prefSum[medianIdx + 1] - prefSum[medianIdx - mid] + prefSum[n] - prefSum[n - mid]):\r\n right = mid # K is an overestimate already.\r\n else:\r\n left = mid + 1 # There is more potential for K!\r\n mid = (left + right) // 2\r\n\r\n # When L = R, we have found K:\r\n bestCurrentMean = findMean(prefSum, n, left, medianIdx)\r\n # If we are doing better than the best so far, update answers:\r\n if bestCurrentMean - nums[medianIdx] > bestSkewness: \r\n bestSkewness = bestCurrentMean - nums[medianIdx]\r\n bestMedianIdx = medianIdx\r\n bestK = left\r\n\r\n# Print answers:\r\nprint(2 * bestK + 1)\r\nfor i in range(bestK):\r\n print(nums[n - 1 - i], end = \" \")\r\nfor i in range(bestK+1):\r\n print(nums[bestMedianIdx - i], end = \" \")\r\n" ]

[ "#!/usr/bin/env python3\nimport os\nimport sys\nfrom atexit import register\nfrom io import StringIO\nfrom math import gcd\n\nsys.stdin = StringIO(os.read(0, os.fstat(0).st_size).decode())\nsys.stdout = StringIO()\nregister(lambda: os.write(1, sys.stdout.getvalue().encode()))\n\ninput = lambda: sys.stdin.readline().rstrip('\\r\\n')\n\n\ndef main():\n n = int(input())\n arr = [int(num) for num in input().split()]\n\n a = [0] * (524288 << 1 | 1)\n for i in range(n):\n p = i + 524289\n a[p] = arr[i]\n while p != 1:\n p >>= 1\n a[p] = gcd(a[p << 1], a[p << 1 | 1])\n\n q = int(input())\n for _ in range(q):\n query = [int(num) for num in input().split()]\n\n if query[0] == 1:\n p = 524288 + query[1]\n\n while p != 1 and (a[p] % query[3] == 0):\n if p & (p + 1) == 0:\n p = n + 524289\n break\n p = (p + 1) >> 1\n\n while p < 524288:\n p <<= 1\n p += int(a[p] % query[3] == 0)\n\n if p - 524288 >= query[2]:\n print('YES')\n else:\n p += 1\n while p != 1 and (a[p] % query[3] == 0):\n if p & (p + 1) == 0:\n p = n + 524289\n break\n p = (p + 1) >> 1\n while p < 524288:\n p <<= 1\n p += int(a[p] % query[3] == 0)\n print('YES' if p - 524288 > query[2] else 'NO')\n\n else:\n p = query[1] + 524288\n a[p] = query[2]\n while p != 1:\n p >>= 1\n a[p] = gcd(a[p << 1], a[p << 1 | 1])\n\n\nif __name__ == '__main__':\n main()\n", "import 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\nfrom math import inf, log2\r\n\r\n\r\nclass SegmentTree:\r\n def __init__(self, array, func=max):\r\n self.n = len(array)\r\n self.size = 2**(int(log2(self.n-1))+1) if self.n != 1 else 1\r\n self.func = func\r\n self.default = 0 if self.func != min else inf\r\n self.data = [self.default] * (2 * self.size)\r\n self.process(array)\r\n\r\n def process(self, array):\r\n self.data[self.size : self.size+self.n] = array\r\n for i in range(self.size-1, -1, -1):\r\n self.data[i] = self.func(self.data[2*i], self.data[2*i+1])\r\n\r\n def query(self, alpha, omega):\r\n \"\"\"Returns the result of function over the range (inclusive)!\"\"\"\r\n if alpha == omega:\r\n return self.data[alpha + self.size]\r\n res = self.default\r\n alpha += self.size\r\n omega += self.size + 1\r\n while alpha < omega:\r\n if alpha & 1:\r\n res = self.func(res, self.data[alpha])\r\n alpha += 1\r\n if omega & 1:\r\n omega -= 1\r\n res = self.func(res, self.data[omega])\r\n alpha >>= 1\r\n omega >>= 1\r\n return res\r\n\r\n def update(self, index, value):\r\n \"\"\"Updates the element at index to given value!\"\"\"\r\n index += self.size\r\n self.data[index] = value\r\n index >>= 1\r\n while index:\r\n self.data[index] = self.func(self.data[2*index], self.data[2*index+1])\r\n index >>= 1\r\n\r\n\r\nfrom math import gcd\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nst = SegmentTree(a, func=gcd)\r\n\r\ndef check(n,alpha, omega, x):\r\n while alpha < omega:\r\n mid = (alpha+omega)//2\r\n left = st.query(alpha, mid)\r\n right = st.query(mid+1, omega)\r\n if left % x and right % x:\r\n return False\r\n if not left % x and not right % x:\r\n return True\r\n if (not left % x and n == 500000) or left % x != 0:\r\n omega = mid\r\n else:\r\n alpha = mid+1\r\n return True\r\n\r\n\r\n\r\nfor _ in range(int(input())):\r\n s = map(int, input().split())\r\n s = list(s)\r\n if len(s) == 4:\r\n p, l, r, x = s\r\n print(\"YES\" if check(n,l-1, r-1, x) else \"NO\")\r\n else:\r\n p, i, y = s\r\n st.update(i-1,y)\r\n\r\n\r\n" ]

[ "\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\n\r\ndef f():\r\n global ew\r\n for a in d1:\r\n d1[a].sort()\r\n c = q = 10 ** 10\r\n b = x - a\r\n if b < 1 or b not in d2:\r\n continue\r\n d2[b].sort()\r\n j = 0\r\n for i in range(len(d1[a])):\r\n while j < len(d2[b]):\r\n if d2[b][j][0] < d1[a][i][0]:\r\n q = min(q, d2[b][j][1])\r\n j += 1\r\n else:\r\n break\r\n if j == 0:\r\n continue\r\n else:\r\n c = min(c, q + d1[a][i][1])\r\n ew = min(ew, c)\r\n\r\n\r\nn, x = map(int, input().split())\r\nd1 = defaultdict(list)\r\nd2 = defaultdict(list)\r\nfor _ in range(n):\r\n l, r, c = map(int, input().split())\r\n d1[r-l+1].append((l, c))\r\n d2[r-l+1].append((r, c))\r\new = 10**10\r\n\r\nf()\r\nif ew == 10**10:\r\n ew = -1\r\nprint(ew)\r\n", "from sys import stdout\r\nfrom sys import stdin\r\ndef get():\r\n return stdin.readline().strip()\r\ndef getf(sp = \" \"):\r\n return [int(i) for i in get().split(sp)]\r\ndef put(a, end = \"\\n\"):\r\n stdout.write(str(a) + end)\r\ndef putf(a, sep = \" \", end = \"\\n\"):\r\n stdout.write(sep.join([str(i) for i in a]) + end)\r\n \r\n#from collections import defaultdict as dd, deque\r\n#from random import randint, shuffle\r\n#from functools import cmp_to_key, reduce\r\n#from math import factorial as fac, acos, asin, atan2, gcd, log, e\r\n#from bisect import bisect_right as br, bisect_left as bl, insort\r\n \r\nfrom bisect import bisect_right as br\r\n \r\ndef main():\r\n inf = 10 ** 9 + 7\r\n ans = inf * inf\r\n m, x = getf()\r\n ln = [[] for i in range(x)]\r\n n = 0\r\n a = []\r\n for i in range(m):\r\n l, r, c = getf()\r\n if(r - l + 1 < x):\r\n n += 1\r\n ln[r - l + 1] += [[r, c]]\r\n a += [[l, r, c]]\r\n pref_min = [0 for i in range(x)]\r\n for i in range(1, x):\r\n k = len(ln[i])\r\n if(k == 0):\r\n continue\r\n ln[i].sort()\r\n pref_min[i] = [ln[i][0][1]]\r\n for j in range(k - 1):\r\n pref_min[i] += [min(pref_min[i][j], ln[i][j + 1][1])]\r\n for j in range(k):\r\n ln[i][j] = ln[i][j][0]\r\n for i in range(n):\r\n needln = x - (a[i][1] - a[i][0] + 1)\r\n if(needln < 1 or needln >= x):\r\n continue\r\n f = br(ln[needln], a[i][0] - 1) - 1\r\n k = len(ln[needln])\r\n if(f >= 0):\r\n ans = min(ans, a[i][2] + pref_min[needln][f])\r\n if(ans == inf * inf):\r\n ans = -1\r\n put(ans)\r\nmain()" ]

[ "n, h = map(int, input().split())\r\nt = s = [1] * (n + 1)\r\nfor m in range(1, n + 1): s[m] = sum(s[m - 1 - k] * s[k] for k in range(m))\r\nfor j in range(h): t = [sum((s[k] - t[k]) * t[m - 1 - k] + s[m - 1 - k] * t[k] for k in range(m)) for m in range(n + 1)]\r\nprint(t[n])", "n, hh = map(int, input().split())\r\n\r\nnode_counts = [0]\r\ndp = [[0 for j in range(n+1)] for i in range(n+1)]\r\ndp[0][0] = 1\r\n\r\nfor i in range(1, n+1):\r\n for j in range(1, n+1):\r\n for l in range(0, j):\r\n left = 0\r\n right = 0\r\n for h in range(0, i): left += dp[h][l]\r\n for h in range(0, i-1): right += dp[h][j-l-1]\r\n dp[i][j] += left * dp[i-1][j-l-1] + dp[i-1][l] * right\r\n\r\ns = 0\r\n\r\nfor i in range(hh, n+1):\r\n s += dp[i][n]\r\n\r\nprint(s)", "import math\r\nimport functools\r\n\r\nnodes, height = map(int, input().split())\r\n\r\[email protected]\r\ndef trees(n, h):\r\n if n == 0:\r\n return 1 if h > 0 else 0\r\n return sum(trees(i, h-1)*trees(n-(i+1), h-1) for i in range(n))\r\n\r\nprint(math.factorial(nodes*2)//(math.factorial(nodes+1)*math.factorial(nodes)) - trees(nodes, height))\r\n", "n, k = map(int, input().split())\r\ndp = {}\r\nres = 0\r\n\r\n\r\ndef dfs(x, dep):\r\n if (x, dep) in dp:\r\n return dp[(x, dep)]\r\n if x == 0:\r\n if (dep == 0):\r\n return 1\r\n return 0\r\n ans = 0\r\n for i in range(1, x+1):\r\n for j in range(0, dep):\r\n for k in range(0, dep):\r\n if j != dep-1 and k != dep-1:\r\n continue\r\n ans += dfs(i-1, j) * dfs(x-i, k)\r\n dp[(x, dep)] = ans\r\n return ans\r\n\r\n\r\nfor i in range(k, n+1):\r\n res += dfs(n, i)\r\nprint(res)\r\n\r\n# q = []\r\n# ans = []\r\n# for i in range(n):\r\n# if (len(l[i]) > 0):\r\n# heapq.heappush(q, (l[i][0], i, 0))\r\n# for i in range(tot):\r\n# tt = heapq.heappop(q)\r\n# ans.append(tt[0])\r\n# if (tt[2] + 1 < len(l[tt[1]])):\r\n# heapq.heappush(q, (l[tt[1]][tt[2]+1], tt[1], tt[2] + 1))\r\n", "n, h = list(map(int, input().split(\" \")))\r\ndp = [[0 for j in range(h + 1)] for i in range(n + 1)]\r\n\r\ndp[0][0] = 1\r\nfor i in range(1, n + 1):\r\n dp[i][0] = dp[i - 1][0] * 2 * (2 * i - 1) // (i + 1)\r\n \r\nfor i in range(1, n + 1):\r\n for j in range(1, h + 1):\r\n for k in range(1, i + 1):\r\n dp[i][j] += dp[k - 1][0] * dp[i - k][j - 1] + dp[k - 1][j - 1] * dp[i - k][0] - dp[i - k][j - 1] * dp[k - 1][j - 1]\r\n\r\nprint(dp[n][h])\r\n", "n, h = map(int, input().split())\r\n\r\nceq = [[0] * (n + 1) for i in range(n + 1)]\r\ncle = [[0] * (n + 1) for i in range(n + 1)]\r\nceq[0][0] = 1\r\ncle[0] = [1] * (n + 1)\r\nfor i in range(1, n + 1):\r\n for j in range(n):\r\n for left in range(i):\r\n ceq[i][j + 1] += ceq[left][j] * cle[i - left - 1][j] + cle[left][j] * ceq[i - left - 1][j] - ceq[left][j] * ceq[i - left - 1][j]\r\n cle[i][j + 1] = cle[i][j] + ceq[i][j + 1]\r\nprint(cle[n][n] - cle[n][h - 1])\r\n", "dic={}\r\ndef dfs(a,res):\r\n\tif a<=1 and res<=a:\r\n\t\treturn 1\r\n\telif a*100+res in dic:\r\n\t\treturn dic[a*100+res]\r\n\telse:\r\n\t\tcnt=0\r\n\t\tfor i in range(a):\r\n\t\t\tif i<res-1 and a-i-1<res-1:\r\n\t\t\t\tcontinue\r\n\t\t\telse:\r\n\t\t\t\tcnt=cnt+dfs(i,0)*dfs(a-i-1,res-1)+dfs(i,res-1)*dfs(a-i-1,0)-dfs(i,res-1)*dfs(a-i-1,res-1)\r\n\t\tdic[a*100+res]=cnt\r\n\t\treturn cnt\r\ninp=input().split()\r\nprint(dfs(int(inp[0]),int(inp[1])))", "n, h = map(int, input().split())\nless = [[1] * (n + 2)] + [[0] * (n + 2) for i in range(n)] # dp[n][h]\nge = [[0] * (n + 2) for i in range(n + 1)] # dp[n][h]\nless[0][0] = 0\nless[0][-1] = 0\nge[0][0] = 1\nge[0][-1] = 1\nfor i in range(1, n + 1):\n for j in range(0, n + 1):\n for k in range(1, i + 1):\n if j > 0:\n less[i][j] += less[k - 1][j - 1] * less[i - k][j - 1]\n ge[i][j] += ge[k - 1][j - 1] * less[i - k][j - 1] + \\\n less[k - 1][j - 1] * ge[i - k][j - 1] + \\\n ge[k - 1][j - 1] * ge[i - k][j - 1]\n ge[i][-1] = ge[i][0]\nprint(ge[n][h])", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n n, h = map(int, input().split())\r\n dp1, dp2 = {}, {}\r\n\r\n def trees(nodes):\r\n nonlocal dp1\r\n if nodes < 0:\r\n return 0\r\n if nodes < 2:\r\n return 1\r\n if nodes not in dp1:\r\n count = 0\r\n for i in range(nodes):\r\n count += trees(i) * trees(nodes-i-1)\r\n dp1[nodes] = count\r\n return dp1[nodes]\r\n\r\n def trees_with_height_limit(nodes, height):\r\n nonlocal dp2\r\n if nodes < 0 or height <= 0 or nodes >= 2 ** (height - 1):\r\n return 0\r\n if nodes < 2:\r\n return 1\r\n if nodes < height:\r\n return trees(nodes)\r\n if (nodes, height) not in dp2:\r\n count = 0\r\n for i in range(nodes):\r\n count += (trees_with_height_limit(i, height-1) *\r\n trees_with_height_limit(nodes-i-1, height-1))\r\n dp2[nodes, height] = count\r\n return dp2[nodes, height]\r\n\r\n print(trees(n) - trees_with_height_limit(n, h))\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n,h=map(int,input().split())\r\n\r\n\r\nfrom functools import lru_cache\r\n@lru_cache(maxsize=None)\r\ndef solve(x):\r\n if x==0:\r\n return [1]\r\n \r\n ANS=[0]*40\r\n\r\n for i in range(x):\r\n L1=solve(i)\r\n L2=solve(x-1-i)\r\n\r\n XX=[0]*40\r\n\r\n for i in range(len(L1)):\r\n for j in range(len(L2)):\r\n XX[max(i,j)]+=L1[i]*L2[j]\r\n\r\n for i in range(39):\r\n ANS[i+1]+=XX[i]\r\n\r\n return ANS\r\n\r\nANS=solve(n)\r\nLA=0\r\nfor i in range(h,40):\r\n LA+=ANS[i]\r\n\r\nprint(LA)\r\n \r\n", "import itertools\r\nimport math\r\nimport time\r\nfrom builtins import input, range\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nimport collections\r\nfrom heapq import heappop, heappush\r\nimport random\r\nimport os\r\nfrom random import randint\r\nimport decimal\r\n\r\n# from sys import stdin, stdout\r\n# input, print = stdin.readline, stdout.write\r\n\r\ndecimal.getcontext().prec = 18\r\n\r\n\r\n# dangerous !!!ML!!!\r\n# sys.setrecursionlimit(200000)\r\n\r\n\r\ndef solve():\r\n n, h = map(int, input().split())\r\n\r\n # dp[current h][nodes used][nodes on last layer]\r\n dp = [[[0 for k in range(n + 1)] for j in range(n + 1)] for i in range(n + 1)]\r\n\r\n dp[1][1][1] = 1\r\n\r\n m = [[math.factorial(i) // (math.factorial(i - j) * math.factorial(j)) for j in range(0, i + 1)] for i in\r\n range(0, n + 1)]\r\n\r\n for height in range(2, n + 1):\r\n for used_nodes_on_curr_layer in range(1, n + 1):\r\n for all_used_nodes_with_prev in range(1, n - used_nodes_on_curr_layer + 1):\r\n for nodes_on_last_layer in range(1, n // 2 + 1):\r\n\r\n if used_nodes_on_curr_layer <= 2 * nodes_on_last_layer:\r\n p = 2 * nodes_on_last_layer\r\n\r\n to_add = m[p][used_nodes_on_curr_layer] * dp[height - 1][all_used_nodes_with_prev][\r\n nodes_on_last_layer]\r\n\r\n dp[height][used_nodes_on_curr_layer + all_used_nodes_with_prev][\r\n used_nodes_on_curr_layer] += to_add\r\n\r\n res = 0\r\n for i in range(h, n + 1):\r\n for nll in range(1, n + 1):\r\n res += dp[i][n][nll]\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 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,h]=[int(x) for x in input().split()];\r\n\r\nt=[[0 for x in range(n+1)] for y in range(n+1)];\r\nt[0][0]=1;\r\n\r\nfor ni in range(1,n+1):\r\n for hi in range(1,n+1):\r\n tmp3=0;\r\n for m in range(1,ni+1):\r\n tmp1=0;\r\n tmp2=0;\r\n for i in range(hi):\r\n tmp1+=t[ni-m][i];\r\n tmp1*=t[m-1][hi-1];\r\n for i in range(hi-1):\r\n tmp2+=t[m-1][i];\r\n tmp2*=t[ni-m][hi-1];\r\n tmp3+=tmp1+tmp2;\r\n t[ni][hi]=tmp3;\r\n\r\nans=0;\r\nfor i in range(h,n+1):\r\n ans+=t[n][i];\r\n\r\nprint(ans);\r\n", "# https://codeforces.com/problemset/problem/9/D\r\n#\r\n# Compute the number of binary search trees that has n nodes and height not lower than h.\r\n# where n \\le 35, h \\le n\r\n#\r\n# Thoughts:\r\n# let dp(n, h) denodes the number of binary search trees that have n nodes and heights not lower than h;\r\n# let f(n) denotes the number of any binary search trees that have n nodes. Then we have\r\n# dp(n, h) = \\sum_{i=0}^{n-1}[dp(i, h-1) * f(n-i-1) + dp(n-i-1, h-1) * f(i) - dp(i, h-1) * dp(n-i-1, h-1)]\r\n# if h > n, dp(n, h) == 0; \r\n# if n <= 1, dp(n, h) = 1; \r\n# f(n) = \\sum_{i=0}^{n-1}[f(i) * f(n-1-i)]\r\n# if n == 0, f(n) = 1\r\n\r\nf = {}\r\ndp = {}\r\n\r\n\r\ndef get_f(n):\r\n if n in f:\r\n return f[n]\r\n if n == 0:\r\n return 1\r\n res = 0\r\n for i in range(0, n):\r\n res += get_f(i) * get_f(n - 1 - i)\r\n f[n] = res\r\n return res\r\n\r\n\r\ndef get_dp(n, h):\r\n if (n, h) in dp:\r\n return dp[n, h]\r\n if h > n:\r\n return 0\r\n if n <= 1:\r\n return 1\r\n res = 0\r\n for i in range(0, n):\r\n res += get_dp(i, h - 1) * get_f(n - i - 1) + \\\r\n get_dp(n - i - 1, h - 1) * get_f(i) - \\\r\n get_dp(i, h - 1) * get_dp(n - i - 1, h - 1)\r\n dp[n, h] = res\r\n return res\r\n\r\n\r\nn, h = map(int, input().split())\r\nprint(get_dp(n, h))\r\n", "from functools import cache\n\n\nn, h = [int(w) for w in input().split()]\n\n@cache\ndef dfs(cnt:int, height:int) -> int:\n if height == cnt == 0:\n return 1\n if height == 0 or height > cnt:\n return 0\n if height == 1:\n if cnt == 1:\n return 1\n return 0\n if cnt < height:\n return 0\n result = 0\n for i in range(cnt):\n left, right = 0, 0\n for j in range(height - 1):\n left += dfs(i, j)\n for j in range(height - 1):\n right += dfs(cnt - i - 1, j)\n result += left * dfs(cnt - i - 1, height - 1)\n result += right * dfs(i, height - 1)\n result += dfs(cnt - i - 1, height - 1) * dfs(i, height - 1)\n # if height == 2:\n # print(i, left, right, result)\n return result\n\nresult = 0\nfor i in range(h, n + 1):\n result += dfs(n, i)\n# print(dfs(1, 1))\nprint(result)", "n,h=map(int,input().split())\r\n\r\nL=[]\r\nfor i in range(n+1):\r\n g=[]\r\n for j in range(n+1):\r\n g.append(0)\r\n L.append(g)\r\nL[0][0]=1\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n sumu=0\r\n for m in range(1,i+1):\r\n t1=L[m-1][j-1]\r\n tot=0\r\n for k in range(0,j):\r\n tot+=L[i-m][k]\r\n t1*=tot\r\n\r\n t2=L[i-m][j-1]\r\n tot=0\r\n for k in range(0,j-1):\r\n tot+=L[m-1][k]\r\n t2*=tot\r\n sumu+=(t1+t2)\r\n L[i][j]=sumu\r\n\r\nans=0\r\nfor i in range(h,n+1):\r\n ans+=L[n][i]\r\n\r\nprint(ans)\r\n \r\n \r\n", "def main():\r\n def rec(n, h):\r\n if sht[n][h]:\r\n return dp[n][h]\r\n \r\n sht[n][h] = 1\r\n \r\n if n == 0:\r\n dp[n][h] = h == 0\r\n return dp[n][h]\r\n \r\n if h == 0:\r\n return dp[n][h]\r\n \r\n if n < h:\r\n return dp[n][h]\r\n \r\n for i in range(n):\r\n for j in range(h):\r\n dp[n][h] += rec(n - 1 - i, h - 1) * rec(i, j) + rec(n - 1 - i, j) * rec(i, h - 1)\r\n dp[n][h] -= rec(n - 1 - i, h - 1) * rec(i, h - 1)\r\n \r\n return dp[n][h]\r\n \r\n dp = [[0] * 40 for _ in range(40)]\r\n sht = [[0] * 40 for _ in range(40)]\r\n n, h = map(int, input().split())\r\n print(sum([rec(n, j) for j in range(h, n + 1)]))\r\n return 0\r\n\r\nmain()", "\n# coding: utf-8\n\n# In[9]:\n\n\n\n\n# In[42]:\n\nline = input().split()\n\nn = int(line[0])\nh = int(line[1])\nfrom math import log\narray_nodes_minheigt = [[0 for x in range(36)] for y in range(36)]\narray_nodes_minheigt[0][0] = 1\nfor nodes in range(1,36):\n for minheight in range(0,nodes+1):\n for topnode in range(1, nodes + 1):\n left = topnode-1\n right = nodes - topnode\n array_nodes_minheigt[nodes][minheight] += array_nodes_minheigt[left][0] * array_nodes_minheigt[right][0] - (array_nodes_minheigt[left][0]-array_nodes_minheigt[left][max(minheight-1,0)])* (array_nodes_minheigt[right][0]-array_nodes_minheigt[right][max(minheight-1,0)])\n\n\nprint(int(array_nodes_minheigt[n][h]))\n\n\n\n\n\n# Made By Mostafa_Khaled", "import sys\r\ninput = sys.stdin.readline\r\n\r\nm = 36\r\ndp = [[0] * m for _ in range(36)]\r\ndp[1][1] = 1\r\nfor i in range(2, m):\r\n for j in range(2, i + 1):\r\n dp[i][j] = 2 * dp[i - 1][j - 1]\r\n for x in range(1, i - 1):\r\n y = i - x - 1\r\n dpx, dpy = dp[x], dp[y]\r\n for j in range(1, x + 1):\r\n for k in range(1, y + 1):\r\n dp[i][1 + max(j, k)] += dpx[j] * dpy[k]\r\nn, h = map(int, input().split())\r\nans = 0\r\ndpn = dp[n]\r\nfor i in range(h, m):\r\n ans += dpn[i]\r\nprint(ans)", "# Enter your code here. Read input from STDIN. Print output to STDOUT\r\nMAX = 71\r\nC=[[0]*MAX for i in range(MAX)]\r\ndp=[[0]*MAX for i in range(MAX)]\r\n\r\nC[0][0]=1\r\nfor i in range(1, MAX):\r\n C[i][0]=1\r\nfor i in range(1, MAX):\r\n for j in range(1, i+1):\r\n C[i][j]=C[i-1][j]+C[i-1][j-1]\r\n\r\n\r\ndef catalan(n):\r\n return C[2*n][n]//(n+1)\r\n\r\ndef solve(n, h):\r\n if(n==0): return 0\r\n if(n<h): return 0\r\n if(h<=1): return catalan(n)\r\n if(dp[n][h]): return dp[n][h];\r\n ans=0\r\n for k in range(0, n): \r\n if(dp[n-k-1][h-1]==0):\r\n dp[n-k-1][h-1]=solve(n-k-1, h-1)\r\n \r\n if(dp[k][h-1]==0):\r\n dp[k][h-1]=solve(k, h-1)\r\n \r\n ans+=dp[n-k-1][h-1]*( catalan(k)-dp[k][h-1]) + catalan(n-k-1)*dp[k][h-1]\r\n \r\n \r\n dp[n][h]=ans\r\n return ans\r\n\r\nn, h=map(int, input().split())\r\nans=solve(n, h)\r\nprint(ans)", "n, h = map(int, input().split())\r\n\r\nDP = [[0 for i in range(n + 1)] for j in range(n + 1)]\r\nfor height in range(n + 1):\r\n DP[0][height] = 1\r\n\r\nfor node in range(1, n + 1):\r\n for height in range(1, n + 1):\r\n for k in range(0, node):\r\n DP[node][height] += DP[k][height - 1] * DP[node - k - 1][height - 1]\r\n\r\nans = DP[n][n] - DP[n][h - 1]\r\nprint(ans)", "def solve(n, h):\r\n v = [[0] * 40 for _ in range(40)]\r\n \r\n for i in range(n + 1):\r\n v[0][i] = 1\r\n \r\n for i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n for k in range(i):\r\n v[i][j] += v[k][j - 1] * v[i - k - 1][j - 1]\r\n \r\n print(v[n][n] - v[n][h - 1])\r\ndef main():\r\n n, h = map(int, input().split())\r\n solve(n,h)\r\nmain()\r\n" ]