peterverebics/CodeNet_Python_118 huggingface dataset:
alphabet_list = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'r', 'u', 'v', 'w', 'x', 'y', 'z']

def Base_10_to_n(X, n):
    if (int(X/n)):
        return Base_10_to_n(int(X/n), n) + str(alphabet_list[X%n-1])
    return str(alphabet_list[X%n-1])

if __name__=="__main__":
    # Problem C
    N = int(input())
    ans = Base_10_to_n(N, 26)
    print(ans)
sum=26
count=0
n = int(input())
k = ord('a')-1
while(sum<n) :
  count+=1
  sum+=26**(count+1)

current=n
mozi=''
mozi1=''


for i in reversed(range(count+1)) :
  c=current//26**i
  if c==27 :
    c=26
    current = current % 26 ** i+26**i
  else :

    current = current % 26 ** i
  mozi1 += chr(c + k)
print(mozi1)
n=int(input())
mlist=[]

for i in range(15):
  mm=n%26 
  m=mm if mm >0 else 26
  n = n//26
  mlist.insert(0,m)
  if n<26:
    m=n if n >0 else 26
    mlist.insert(0,m)
    break
  else:
    pass

mlist_alph=[chr(i+96) for i in mlist]
print(''.join(mlist_alph))
import string

n = int(input())
f = []

if n > 26:
	while n:
		n -= 1
		n, r = divmod(n, 26)
		f += [r]
else:
	f += [n]

g = ''
s = string.ascii_lowercase
f.reverse()
for i in f:
	g += s[i]

print(g)
#!/usr/bin/env python3
import sys
import numpy as np
input = sys.stdin.readline
n=int(input())
Z = [chr(i) for i in range(97, 97+26)]
ans = ""
def div(k):
    k ,mod = divmod(k, 26)
    global ans
    ans += Z[mod-1]

    return k

for i in range(20):
    n = div(n)
    if n ==0 :
        print(ans[::-1])
        sys.exit()
sys.exit()
n = int(input())

x = 0
for i in range(1, 100):
    if n <= 26**i:
        x = i
        break
ans = ''
for i in range(x, 0, -1):
    y = n // (26**(i-1))
    ans += chr(y + 96)
    n -= (y * (26**(i-1)))

print(ans)
#!/usr/bin/env python3
def main():
    from string import ascii_lowercase

    N = int(input())

    num = [0] * 13
    for i in range(12, -1, -1):
        res = 26 ** i
        if N >= res:
            num[i] = N // res
            N = N % res
    for i in num[::-1]:
        if i:
            print(ascii_lowercase[i - 1], end='')


if __name__ == '__main__':
    main()
n = int(input())
res = n % 26

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']

ans = []
while n//26 > 0 :
  res = n % 26
  if res != 0:
    ans.append(A[res-1])
  elif res == 0:
    ans .append(A[25])
  n = n // 26

if res != 0:
  ans.append(A[res-1])

print(*ans[::-1], sep='')
def main():
    n = int(input())

    ans = ''
    while n != 0:
        ans = chr(n % 26 + 96) + ans
        n //= 26

    print(ans)


if __name__ == '__main__':
    main()
alp=["z","a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y"]
N=int(input())
li=[]
while N>=0:
    na=N%26
    li.append(alp[na])
    if N<26:
        break
    else:
        N=N//26
ans=""
for i in range(len(li)):
    ans+=li[i]
print(ans[::-1])
N = int(input())

a = list()
sho = N
alpha = [i for i in 'abcdefghijklmnopqrstuvwxyz']
if N <= 26:
    a.append(alpha[N-1])
else:
    while sho != 0:
        sho = N // 26
        amari = N % 26
        a.append(alpha[amari-1])
        N = N // 26

a.reverse()
print(''.join(a))
def main():
  N = int(input())
  ans = ''
  abc = "abcdefghijklmnopqrstuvwxyz"
  
  
  while N > 0:
    ans += abc[(N % 26)-1]
    print(ans)
    N = N//26
  
  print(ans[::-1])
  
  
  
main()
a = int(input())

alp = list('abcdefghijklmnopqrstuvwxyz')
ans = []

while True:
  if a / 26 > 1:
    x = a % 26
    a = a // 26
    a = a-1
    ans.append(alp[x-1])
   # print(alp[x-1])
  else:
    ans.append(alp[a-1])
   #print(alp[a-1])
    break

ans.reverse()
for i in ans:
  print(i,end="")
# C
n = int(input())
ans = []
while n > 26:
    ans.append(n % 26)
    n = n // 26
ans.append(n)
print(ans)
ans.reverse()
for i in ans:
    print(chr(i + 96),end='')
N = int(input())
q = N // 26
mod = N % 26
A = []
B = []
def num2alpha(c):
    if(c>0):
        return chr(c+96)
    else:
        return 'z'
while(True):
    A.append(mod)
    if(q<27):
        if(q != 0 and mod != 0):
            A.append(q)
        break
    mod = q % 26
    q = q // 26
A.reverse()
for x in A:
    B.append(num2alpha(x))
B="".join(B)
print(B)
N=int(input())

ans = ""
for i in range(N):
    if N%26 ==0:
        ans = "z" +ans
        N -= 26
    else:
        ans = chr(64+ N%26) +ans
    
    if N <= 26:
        break
    N = N // 26
    
        
print(ans.lower())
import itertools
import string

n = int(input())
alphabets = string.ascii_lowercase

numbers = [0]
digit = 0
while 26**digit < n:
	digit += 1
	numbers.append(26**digit)

numbers = numbers
numbers = list(itertools.accumulate(numbers))

answer = ""
for d in range(digit):
	if d == 0:
		alphabet = n % 26 - 1
		answer = alphabets[alphabet] + answer
		n = n - (n % 26)
	else:
		n = n // 26
		alphabet =  n % 26 - 1
		answer = alphabets[alphabet] + answer

print(answer)
N = int(input())

def base10to(n, b):
    if (int(n/b)):
        return base10to(int(n/b), b) + str(chr(96 + n%b))
    return str(chr(96 + n%b))

print(base10to(N, 26))
N = int(input())
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']
x = 1
Z = 'A'
while N // 26 > 0:
    Z += alpha[(N  % 26) - 1]
    N = N // 26
#    print(Z) 
Z += alpha[N - 1]
#print('Z = ', Z)
for i in range(len(Z) - 1, 0 , -1):
    print(Z[i], end = '')
a=int(input())

ei=[chr(i) for i in range(ord('a'), ord('z')+1)]

name_list=[]

name=""
q=int(a/26)
r=int(a%26)

if q==0:
	name_list.append(r)

while q>0:
	q=int(a/26)
	r=int(a%26)
	a=q
	name_list.append(r)

for i in range(len(name_list)):
	name+=ei[name_list[-(i+1)]-1]

print(name)
N = int(input())
keta = 0
while N >= 26**keta:
  keta += 1
  
ans = ''
while keta > 0:
  num = N // (26**(keta-1))
  N = N % (26**(keta-1))
  ans += chr(96+num)
  keta -= 1
  
print(ans)
n=int(input())
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"]
ans=[]
while n>26:
  x=n%26
  ans.append(l[x-1])
  n=n//26
ans.append(l[n-1])
ans.reverse()
Ans=""
for i in range(len(ans)):
  Ans=Ans+ans[i]
print(Ans)
N = int(input())

a = (N-1)//26
b = N%26
ans = ''
while a!=0:
  ans = chr(b+96) + ans
  b = a%26
  a = (a-1)//26

  
ans = chr(b+96) + ans
print(ans)
from bisect import bisect_left, bisect_right
N = int(input())

MOJI = [26]
for i in range(2,12):
  MOJI.append(MOJI[i-2]+26**i)


C = bisect_left(MOJI, N)+1

if N in MOJI:
  print("z"*C)
  exit()

ans = []
for i in range(C-1,-1,-1):
  tmp = N//(26**i)
  ans.append(chr(tmp+ord("a")-1))
  N = N%(26**i)

L=[str(a) for a in ans]
L="".join(L)
print(L)
# 2107
# 解法　2109 　26進数とみなして，10進数->26進数に変換すると思えばよいだろう．
# 実装
N = int(input())
# 26で割っていき，余りを記録していく．割れなくなったら終了．
AL = []
while N >=26:
    amari = N % 26
    N = int((N-amari) / 26)
    AL.append(amari)
AL.append(N)
bias = 127
R = [chr(ord('a')+a-1) for a in AL]
print(''.join(R[::-1]))
from decimal import *

n=Decimal(input())
chars=['z','a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y']
ans=''
while n>0:
    r=n%26
    ans = chars[int(r)]+ans
    n = n//26

print(ans)
N = int(input())
if 1<= N <= 1000000000000001:
    moji = 'abcdefghijklmnopqrstuvwxyz'
    for i in range(12):
        if N // 26 **i == 0:
            max_i = i-1
            break
    amari = N
    syo = 0
    kai = ""
    p = 0
    for j in range(1,max_i+1):
        p = max_i +1 -j
        syo = amari // 26 ** p
        amari = amari % 26 ** p
        kai += moji[syo - 1]
    kai += moji[amari - 1]
    print(kai)
n = int(input())

al = ["0","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"]
re = []


while(n != 0):
    am = n%26
    
    n = n//26
    
    re.append(al[am])
    
re.reverse()

for i in re:
    print(i,end="")
N = int(input())
alf = [chr(i) for i in range(97, 97+26)]
List = []
for i in range(100):
  if N > 26:
    a = N % 26
    N = N // 26
    List.append(alf[a-1])
  else:
    List.append(alf[N-1])
    break
    

print("".join(List))
N = int(input())

s = []
k = 0
while N > 0:
	l = N % 26 #一番下のけた
	s.insert(0,chr(ord('a')+l-1))
	N = N // 26
	k +=1


print(''.join(s))
N=int(input())
n=N
listm=[]
while n!=0:
  m=n%26
  n=n//26
  listm.append(m)
list_ans=[]
l=0
for i in range(N):
  try:
    ans=chr(listm[i]+96)
    list_ans.append(ans)
    l+=1
  except IndexError:
    break

ans=''
for i in range(l):
  ans=ans+list_ans[l-i-1]
print (ans)
n = list(input())
for i in range(len(n)):
    n[i] = int(n[i])

def base_convert(nl, ibase, obase):
    o = []
    while any(nl):
        c = 0
        for i in range(len(nl)):
            c = c * ibase + nl[i]
            nl[i],c = divmod(c,obase)
        o.append(c)
    o.reverse()
    return o

x = base_convert(n, 10, 26)
ans = ""

for i in x:
    ans += chr(ord('a') + i-1)

if ans[-1] == "`":
    ans = "z"*(len(ans)-1)

print(ans)
n = int(input())
alphabet = 'abcdefghijklmnopqrstuvwxyz'

n -= 1
ans = ''
while n >= 0:
    ans += alphabet[n % 26]
    n //= 26
    n -= 1

print(ans)
n=int(input())
ans=''
i=1
while n>0:
	t=n%26
	if t==0:
		t=26
	ans=chr(t+ord('a')-1)+ans
	n=n//26
print(ans)
from bisect import bisect_left, bisect_right
N = int(input())

MOJI = [26]
for i in range(2,12):
  MOJI.append(MOJI[i-2]+26**i)

print(MOJI)

C = bisect_left(MOJI, N)+1

if N in MOJI:
  print("z"*C)
  exit()

ans = []
for i in range(C-1,-1,-1):
  tmp = N//(26**i)
  ans.append(chr(tmp+ord("a")-1))
  N = N%(26**i)

L=[str(a) for a in ans]
L="".join(L)
print(L)
N=int(input())
List='abcdefghijklmnopqrstuvdxy'

Ans=''

while N>=1:
    Amari=N%26
    
    if Amari==0:
        Ans='z'+Ans
    else:
        Ans=List[Amari-1]+Ans
        
    N=(N-1)//26
    
print(Ans)
N_MAX = 1 ** 15
letters=list("abcdefghijklmnopqrstuvwxyz")
A_TO_Z = len(letters)
N = int(input())

q = N
r = []
while q != 0:
  r.insert(0, q % A_TO_Z)
  q = q // A_TO_Z
print(r)
for i in r:
  print(letters[i-1],end="")
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','z']

n=int(input())
ans=""
while n>0:
 a=n%26
 ans+=alp[a-1] 
 n=int(n//26)

print(ans[::-1])
n = int(input())
t = 26
ans = 0
for i in range(1,12):
    res = (t**i)
    ans += res
    if ans >= n:
        len = i
        break
res1,res2 = divmod(n,26)
res = ""
if n == ans:
    res = "z"*i
elif res1 < 1:
    res = chr(res2+96)
elif res1>26:
    while n>0:
        div,mod = divmod(n,26)
        res += chr(mod+96)
        n //= 26
    res = res[::-1]
else:
    res += chr(res1+96)+chr(res2+96) if res2>0 else chr(res1+95)+"z"
print(res)
N = int(input())
ans = []
while N > 0:
    val = N
    cnt = 0
    while val > 26:
        val = val // 26
        cnt += 1
    X = N // (26 ** cnt)
    N -= X * (26 ** cnt)
    if cnt == 1 and N == 0:
        ans.append(chr(X+96-1))
        ans.append(chr(26+96))
        break
    elif cnt == 1 and N > 0:
        ans.append(chr(X+96))
        ans.append(chr(N+96))
        break
    else:
        ans.append(chr(X+96))
print(''.join(ans))
N = int(input())

S = [chr(i) for i in range(ord("a"), ord("z")+1)]

tmp = N
cnt = 0
l = []
while True:
    q, r = divmod(tmp, 26)
    l.append([r, cnt])
    cnt += 1
    if q == 0:
        break
    tmp //= 26

ans = ""
for a, b in l:
    ans = S[a-1] + ans

print(ans)
name = ''
num = int(input())
while(num > 0): 
  if num%26 != 0:
    name += chr((num%26)+96)
    num = num//26
  else:
    name += chr((num%26)+96)
    num = num//26 - 1

print(name[::-1])
s = 'abcdefghijklmnopqrstuvwxyz'
n = int(input())
ans = ''
while n > 25:
    ans += s[(n % 26)-1]
    n = n // 26
ans += s[n%26-1]
print(ans[-1::-1])
N = int(input())
ans = ""
if N % 26 == 0:
    i = 1
    a = N
    while True:
        a = a//26
        if a <= 26:
            print("z"*i)
            break
        i+=1
else:
    a = N; b = N; i = 1
    while True:
        if a <= 26:
            ans = chr(ord("a")+a-1) + ans
            break
        b = a % 26
        ans = chr(ord("a")+b-1) + ans
        a = a // 26
        i += 1
print(ans)
N = int(input())

abc = [a for a in 'zabcdefghijklmnopqrstuvwxy']

t = 26 ** 12

temp =[]
result = ''
isWarikireta = False
while t != 1:
    amari = N % t
    if amari == 0:
        temp.append(0)
        isWarikireta = True
    else:
        if N // t > 0:
            temp.append(str(N//t))
        N = amari
    t //= 26
for t in temp:
    result += abc[int(t) % 26]
if not isWarikireta:
    result = result + abc[N % 26]
    #print('temp')
#print(temp)
print(result)
X = int(input())

def Base_10_to_n(X, n):
    alphabet = 'zabcdefghijklmnopqrstuvwxy'
    if (int((X-1)/n)):
        return Base_10_to_n(int(X/n), n)+alphabet[X%n]
    return alphabet[X%n]
print(Base_10_to_n(X, 26))
N = int(input())
alpha = 'zabcdefghijklnmopqrstuvwxyz'

ans = ''
while N != 0:
    i = N % 26
    N-=1
    ans = alpha[i] + ans
    N //= 26
    print(N)
    
print(ans)
n = int(input())
i = 1
while n > 26 ** i :
    n = n - 26 ** i
    i += 1
an = []
while i > 0 :
    k = n // (26 ** (i - 1))
    n -= (26 ** (i-1)) * k
    an.append(k)
    i -= 1
ans = []
for j in an :
    ans.append(chr(96 + j + 1))
del ans[len(ans)- 1]
ans.append(chr(96 + j) )
print(''.join(map(str,ans)))
def base(n, b, digits="abcdefghijklmnopqrstuvwxyz"):
    if n == 0: return 'a'
    s = []
    p = abs(n)
    while p:
        s.append(digits[p % b-1])
        p //= b
    return ''.join(reversed(s))

n = int(input())
s = base(n,26)
print(s)
num = int(input())

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"]

def Base_10_to_n(X, n):
    X_dumy = X
    out = []
    while X_dumy>0:
        out.append(X_dumy%n)
        X_dumy = int(X_dumy/n)
    return out

name_nums = Base_10_to_n(num,26)
name_nums.reverse()

ans = ""
for name_num in name_nums:
    ans += alphabet[name_num-1]

print(ans)
n = int(input())
k = [0 for i in range(11)]
l = [0 for i in range(11)]
tmp = n
for i in range(11):
    k[i] = tmp//26**(10-i)
    l[i] = tmp%26**(10-i)
    tmp = l[i]   
ans = ""
s = "abcdefghijklmnopqrstuvwxyz"
flg = 0
for i in range(11):
    if k[i] != 0:
        flg = 1
    if flg == 1:
        ans += s[k[i]-1]
print(ans)
#関数リスト
import sys
input = sys.stdin.readline
 
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

num = I()
result = ""
alphabet = [chr(ord('a') + i) for i in range(26)]

while True:
    result = alphabet[num % 26 - 1] + result
    num = num // 26
    if num == 0:
        break

print(result, end = '')
n = int(input())
ans = ''
while n > 0:
    ans += chr(ord('a') + n % 26)
    n //= 26
print(ans[::-1])
n = int(input())

ans = ""
while n:
    ans += chr(96 + n % 26)
    n //= 26

print(ans[::-1])
string_array = [chr(i) for i in range(97, 97+26)]
print(string_array)
value = int(input())

value_range = 0
for l in range(1, 12):
    value_range += 26**l
    if value_range >= value:
        break

answer_array = []

for l in range(1, l+1):
    q = value // 26
    r = value % 26
    if r == 0:
        q -= 1
    answer_array.append(r)
    n = q

print(answer_array)

answer = ''
for i in answer_array[::-1]:
    answer += string_array[i-1]

print(answer)
from collections import deque
import sys
alphabet = [chr(i) for i in range(97, 97+26)]
n = int(input())
if n <= 26:
    print(alphabet[n-1])
    sys.exit()
ans = deque()
tobe_devided = n
while True:
    q,r = divmod(tobe_devided,26)
    if q < 26:
        ans.appendleft(alphabet[r-1])
        if q != 0:
            ans.appendleft(alphabet[q-1])
        break
    ans.appendleft(alphabet[r-1])
    tobe_devided = q
ans = map(str,ans)
print(''.join(ans))
from sys import stdin

def Base_10_to_n(X, n):
    alpha = "0abcdefghijklmnopqrstuvwxyz"
    X_dumy = X
    out = ''
    while X_dumy>0:
        new = alpha[X_dumy%n]
        out = new+out
        X_dumy = int(X_dumy/n)
    return out

def main():
    n = int(input())
    x16_expr = Base_10_to_n(n, 26)
    print(x16_expr)

if __name__ == "__main__":
    main()
n = int(input())

li = []

count = 0
val = 1

while(True):

	val *= 27
	count += 1

	if (val > n):
		break

for i in range(count-1,-1,-1):

	val2 = n // pow(26,i)
	li.append(val2)
	n -= (val2 * pow(26,i))

for i in li:
	print(chr(96+i),end="")
N = int(input())

ans = ""
while N != 0:

    a, r = N//26, N%26
    # print(a,r)
    ans = chr(ord("a") + r-1) + ans
    N = N//26

print(ans)
def main():
    n = int(input())
    num = n
    name = []
    cap = [chr(i) for i in range(97, 97+26)]
    cap.insert(0, 'z')
    del cap[-1]
    if n == 26:
        return 'z'
    while n >= 27:
        last = n % 26 
        n = n // 26
        name.insert(0, cap[last])
    if num % 26 == 0:
        last = (n % 26)-1
    else:
        last = n% 26
    name.insert(0, cap[last])
    ans = "".join(name)
    return ans
print(main())
kigou=list("0abcdefghijklmnopqrstuvwxyz")
a=int(input())
keta=0
count=0
counter=[0]
for i in range(1,100):
    x=26**i+count
    if 26**i+count>=a:
      keta=i
      counter.append(x)
      break
    else:
        count+=26**i
        counter.append(count)
ans=""

for i in range(keta):
    # a -= 1
    ans=kigou[a%26]+ans
    a=a//26

print(ans)
N = int(input())
i = 0
while N >= 26**i:
  i+=1
i-=1
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']
result = ''
num = 0
while N != 0:
  num,N = divmod(N,26**i)
  result += alpha[num-1]
  i-=1
print(result)
n = int(input())

characters = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','t','u','v','w','x','y','z']

s = 26
H = []
for i in range(1, 20):
    if s**i > n:
        break
    else:
        H.append(s**i)

H.append(1)
answer = ''
for i, h in enumerate(sorted(H, reverse=True)):
    number = int(n/h)
    if i == 0:
        answer += characters[number-1]
    else:
        answer += characters[number-1]

    n -= h*number

print(answer)
N = int(input())
N -= 1
alphabets = []
for i in range(26):
    alphabets.append(chr(ord("a")+i))
ans = ""
i = 0
while N > 0:
    if i != 0:
        N -= 1
    ans += alphabets[N%26]
    N //= 26
    i += 1
print(ans[::-1])
N = int(input())
import string
alphabets = string.ascii_lowercase
result = ""
tmp = N
n = 26
while tmp >= n:
    idx = tmp%n - 1
    result = alphabets[idx] + result
    tmp = int(tmp/n)
idx = tmp%n - 1
result = alphabets[idx] + result
print(result)
n = int(input())
a = "zabcdefghijklmnopqrstuvwxy"
alist = list(a)
c, d = 0, 0
name = ""
namelist = []
while 1:
  c = n//26
  d = n%26
  n = c
  namelist.append(alist[d])
  if n == 0:
    break
namelist.reverse()
name = "".join(namelist)
print(name)
def main():

    n = int(input())
    i = 1
    ans = ''
    while True:
        rem = n % 26
        ans += chr(rem + 96)
        # n -= 26 ** i
        n //= 26
        if n == 0:
            break
        i += 1
    ans = ans[::-1] # 文字列の反転
    print(f'{ans}')

if __name__ == '__main__':
    main()
n = int(input())

if n%26 == 0:
    total = 0
    x = 0
    while True:
        x += 1
        if n == total+26**x:
            print ("z"*x)
            exit ()
        total += 26**x

def B(X, n):
    if (int(X/n)):
        return B(int(X/n), n)+str(X%n)+","
    return str(X%n)+","

l = list(B(n,26).split(","))
del l[-1]
ans = ""
for i in l:
    ans += chr(96+int(i))

print (ans)
N = int(input())

moji = [chr(i) for i in range(97, 97+26)]


lst = [0]
n = 0
for i in range(1,12):
    n = n + 26 ** i
    lst.append(n)

keta = 0
for i in range(len(lst)):
    if N <= lst[i]:
        keta = i
        break

x = keta

ans = []
for i in range(keta):
    tmp = N // (26**(x-1))
    if tmp == 27:
        tmp -= 1
    ans.append(tmp)
    N -= tmp *  (26**(x-1))
    x -= 1


answer = ''
for i in ans:
    answer += moji[i-1]
print(answer)
N = int(input())

dic = {}
for i in range(1, 27):
    dic[i] = chr(97 + i -1)
del dic[26]
dic[0] = "z"
temp = N 
ans = ""

if temp <= 26:
    ans += dic[temp % 26]

else:
    while temp // 26 > 0:
        aa = temp % 26
        ans += dic[aa]
        temp = temp // 26
        if temp <= 26:
            ans += dic[temp % 26]

ans = ans[::-1]
print(ans)
N = int(input())
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']

ans = ''

while N != 0:
  k, l = 0, 0
  for i in range(11):
    if 26**i <= N < 26**(i+1):
      k = i
      break
  for i in range(1, 26):
    if (26**k)*i <= N < (26**k)*(i+1):
      l = i
      break
  
  ans = ans + alpha[l-1]
  N -= 26**k*i

print(ans)
n = int(input())

amari = []
j = 1
while True:
    if n >= 26:
        amari.append(n%26)
        n = n//26
    else:
        amari.append(n)
        break

gyaku = amari[::-1]

arufa = [chr(i) for i in range(97, 97+26)]

[print(str(i-1)+arufa[i-1],end="") for i in gyaku]
n = int(input())
ascii_letters = 'abcdefghijklmnopqrstuvwxyz'
minus=1
for i in range(1,15):
    if n<=26**i:
        order=i
        n-=minus
        break
    else:
        minus+=26**i

for i in range(order):
    print(ascii_letters[n//(26**(order-i-1))],end='')
    n%=(26**(order-i-1))
print()
n = int(input())

def base_10_to_n(N, x):
    out = ''
    while N>0:
        if N%x == 0:
            N+=1
        out = chr(96+N%x)+out
        N = int(N/x)
        
    print(out)
    
base_10_to_n(n, 26)
n=int(input())
A=list()
ans=''
while n>=26:
    n=n//26
    s=n%26
    print(n,s)
    ans+=(chr(s+96))

ans+=(chr(n+96))

print(ans)
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']
N = int(input())
tmp = 26
ans = ''
while True:
    ans += al[N%26-1]
    if N <= 26:
        break
    N = N // tmp
print(ans[::-1])
N = int(input())
alphabets = "abcdefghijklmnopqrstuvwxyz"

s = ""
while N > 26:
    N, mod = divmod(N, 26)
    s += alphabets[mod - 1]

s += alphabets[N - 1]

while True:
    prev_s = s
    s = s.replace('aa','z')
    if prev_s == s:
        break
        
print(s)
N = int(input(""))

Q = [N]
R = [ ]

i = 1
while (26**(i-1) <= N ):
    Q.append(Q[i-1] // 26)
    R.append(Q[i-1] % 26) 
    i += 1
# print(Q)
# print(R)
R.reverse()
L = [i for i in "abcdefghijklmnopqrstuvwxyz"]

for i in R:
    print(L[i-1],end='')
N = int(input())

l = 'abcdefghijklmnopqrstuvwxyz'
s = ''
n = 1

while(N>0):
  a = N % 26
  s += l[a-1]
  N //= 26
  N-=1
  
print(s[::-1])
# coding: utf-8

N = int(input())
alp = [chr(i) for i in range(97, 97+26)]
S = 0
for i in range(1,100):
    S += 26**i
    if S >= N:
        keta = i
        break
#print(keta)
ans = ""
for i in range(keta-1, -1, -1):
    #print(N, N//(26**i))
    ans += alp[min(N//(26**i)-1,25)]
    N %= 26**i

print(ans)
n=int(input())
s=""
l=" abcdefghijklmnopqrstuvwxyz"
while n>0:
    r=n%26
    n//=26
    s+=l[r]
print(s[::-1])
N = int(input())
a = 0
ans = ''
print('ans')
Nn = N
while Nn > 26:
    a = a+1
    Nn = int(Nn/26)
    print(a, Nn)

for i in range(a):
    b = chr(N%(26^i)+64)
    a = a -1
    print(b)
    ans = ans + b

ans = ans + chr(N%26 + 64)

print(ans.lower())
n=int(input())
n2=n   
l=1
while 26**l<=n2:
    n2-=26**l
    l+=1
ans=[]

o=26**(l-1)

# while n:
#     ad=n//o
#     ans.append(ad)
#     n%=o
#     o//=26
while n:
    if n%26==0:
        ans.append(26)
    else:
        ans.append(n%26)
    n//=26
ans=[chr(ord("a")+ai-1) for ai in ans][::-1]
print(''.join(ans))
n=int(input())
n2=n   
l=1
while 26**l<=n2:
    n2-=26**l
    l+=1
ans=[]

o=26**(l-1)

while n:
    ad=n//o
    ans.append(ad)
    n%=o
    o//=26
ans=[chr(ord("a")+ai-1) for ai in ans]
print(''.join(ans))
N = int(input())
ans = []
for i in range(200):
    n = N%26
    if n == 0:
        n=26
    ans.insert(0,chr(n+96))
    N_ = (N-1)//26
    N = N//26
    if N==0 or N_ == 0:
        break
print("".join(ans))
from sys import stdin

N = int(stdin.readline().rstrip())
alphabets = "abcdefghijklmnopqrstuvwxyz"

index = 1
tot = 0
while(True):
    tot += pow(26,index)
    if(N<=tot):
        break
    index = index+1

output_str = ""

aaaa = 26

for i in range(1,index+1,1):
    temp = N%aaaa
    temp2 = int(temp/(aaaa/26))

    
    output_str = alphabets[temp2-1] + output_str
    aaaa = aaaa*26

print(output_str)
n = int(input())
a = []
while n > 0:
  a.append(n % 26)
  n //= 26
#print(a)
a.reverse()
#print(a)
s = ""
for i in range(len(a)):
  s += chr(a[i] + 96)
print(s)