peterverebics/CodeNet_Python_118 huggingface dataset:
n=int(input())
s=''
while n!=0:
    n,v=divmod(n,26)
    s+=chr(96+v)
print(s[::-1])
n = int(input())
ascii_letters = 'abcdefghijklmnopqrstuvwxyz'
minus=1
for i in range(1,12):
    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())
k = 1
m = 0
abc_list = list("abcdefghijklmnopqrstuvwxyz")

for i in range(1, 11):
    m = n
    n = n - 26 ** i
    if n > 0:
        k += 1
    else:
        break
    
l =[]

for j in range(k - 1, 0, -1):
    l.append((m - 1)// (26 ** j))
    m = m % (26 ** j)

l.append(m - 1)

answer = []

for i in l:
    if i == 26:
        i = 25
    answer.append(abc_list[i])

print("".join(answer))
n = int(input())
s = [chr(ord("a")+i) for i in range(26)]
num, i = 26, 1
while n - num > 0:
    i += 1
    num += pow(26, i)
ans = ""
while i > 0:
    tmp = 0
    for j in range(1, 27):
        if n - j*pow(26, i-1) < 0:
            break
        tmp = j
    ans += s[tmp- 1]
    n -= tmp*pow(26, i-1)
    i -= 1
print(ans)
n = int(input())
c = 0
n1 = n 
for i in range(1,11):
    a = n1 - 26**(i)
    c += 1
    if a <= 0:
        break
    n1 = n1 - 26**(i)
a = ""
for i in range(c):
    if n // 26**(c-i-1) >= 26:
        alpha = 26
        n = n - 26**(c-i-1)
    else:
        alpha = n // 26**(c-i-1)
        n = n % 26**(c-i-1)
    a += chr(96 + alpha)
print(a)
N = int(input())
ans = ''
for i in range(100):
    ans = chr(ord('a') + (N-1) % 26) + ans
    N //= 26
    if N == 0:
        break
print(ans)
n=int(input())

alp='0abcdefghijklmnopqrstuvwxyz'

########関数部分##############
def Base_10_to_n(X, n):
    if (int(X/n)):
        return Base_10_to_n(int(X/n), n)+' '+str(X%n)
    return str(X%n)
############################
l=list(Base_10_to_n(n,26).split())
ans=''

for i in range(len(l)):
    ans+=alp[int(l[i])]

print(ans)
n=int(input())
a=[]
m=n%26 if n%26 !=0 else 26
a.append(m)

while n>26:
  n=n//26
  m=n%26
  a.append(m if m!=0 else 26)
for i in reversed(range(len(a))):
  print(chr(96+a[i]),end="")
N = int(input())
x = []

while N > 0:
    N, i = divmod(N, 26)
    if i == 0:
        x.append('z')
    else:
        x.append(chr(i + 96))
    if N == 1 & i == 0:
        break
print(''.join(x))
import numpy as np
import string as str

N = int(input())

low_letters = str.ascii_lowercase
name = ''
while True:
    b = N % 26
    name = name + low_letters[b-1]
    if N < 26:
        break
    a = N // 26
    N = a 
print(name[::-1])
N = int(input())
#if 1<= N <= 1000000000000001:
s = list('abcdefghijklmnopqrstuvwxyz')
u = ""
for i in range(12,0,-1):
    K = N // (26 ** i)
    N = N % (26 ** i)
    if K >0:
        u += s[(K - 1)]          
u += s[(N - 1)]
print(u)
N = int(input())
ans = []
while N != 0:
    k = N % 26
    if k == 0:
        k += 26
    ans.append(chr(96 + k))
    N -= k
    N //= 26
print(''.join(ans))
d = 1000000000000001
n = int(input())
abc = "abcdefghijklmnopqrstuvwxyz"
len = len(abc)


list = []
while True:
    if 0 < n < len:
        list.append(n)
        break
    elif n == 0:
        break
    list.append(n % len)
    n = n // len

list.reverse()
name = ""
for i in list:
    name += abc[i-1]

print(name)
N = int(input())
alpha = 'abcdefghijklmnopqrstuvwxyz'
ans = ''

while N > 0:
	ans += alpha[N%26-1]
	N = N//26

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

alpha='zabcdefghijklmnopqrstuvwxy'
def mod26(n):
  mods=[]
  m=n
  while m>0:
    mods+=[m%26]
    m=m//26
  return mods

def revs(n):
  mods=mod26(n)
  le=len(mods)
  al=[alpha[mods[i]] for i in range(le-1,-1,-1)]
  return ''.join(al)

print(revs(N))
def Base_10_to_n(X, n):
    if (int(X/n)):
        return Base_10_to_n(int(X/n), n)+' '+str(X % n)
    return str(X % n)
s = list(map(int,input().split()))
n=s[0]

dic={}
for i in range(97, 97+26):dic[i-96]=chr(i)
dic[0] = 'z'
a = Base_10_to_n(n, 26)
a=a.split(' ')
ans=''
for i in a:
    ans+=dic[int(i)]
print(ans)
n = int(input())
def f(n):
    q, mod = divmod(n,26)
    if q==0:
        mod = mod-1
        return chr(97+mod)
    mod = mod-1
    return f(q)+chr(97+mod)
print(f(n))
N = int(input())

ans = ''

while True:
    n = int(N / 26)
    r = N % 26

    ans = chr(96 + r) + ans
    if n == 0:
        break
    else:
        N = n

print(ans)
name = []
N = int(input())

while  N  > 0:
    N, mod = divmod(N, 26)
    if mod == 0:
        mod = 1
    name.insert(0,chr(96+mod))
name=''.join(name)
print(name)
import string

N = int(input())
alphabet = list(string.ascii_lowercase)
num2alphabet = {i + 1: a for i, a in enumerate(alphabet)}
num2alphabet[0] = "z"
ans = ""

while N > 0:
    num = N % 26
    ans += num2alphabet[num]
    if N % 26 == 0:
        break
    N = N // 26

print(''.join(list(reversed(ans))))
N = int(input())

alps = 'abcdefghijklmnopqrstuvwxyz'

def cnv(X, n):
    if X//n:
        return cnv(X//n, n) + [X%n]
    return [X%n]

ans = cnv(N, 26)
print(''.join(list(map(lambda x: alps[x - 1], ans))))
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    N = int(rl())
    
    ans = []
    while N:
        ans.append(chr(ord('a') + N % 26 - 1))
        N //= 26
    print(''.join(reversed(ans)))


if __name__ == '__main__':
    solve()
N=int(input())
num2alpha = lambda c: chr(c+96)

x=[]
while N//26>0:
    x.append(N%26)
    N=N%26
x.append(N)


ans=[]
for i in range(len(x)):
    ans.append(num2alpha(x[i]))

print(''.join(ans))
n = int(input())
alp = 'abcdefghijklmnopqrstuvwxyz'
ans = ''

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

a=n
count=0
for i in range(11):
    if a-26**(i+1)>=0:
        a-=26**(i+1)
        count+=1
    else:
        break

#print(a)
#print(count)

ans=[]
for j in range(count):
#for j in range(i+1):
    ans.append(a//26**(count-j))
    a%=26**(count-j)
ans.append(a%26-1)

#print(ans)
m=len(ans)
#print(m)
letter=[]
for i in range(m):
    #print(chr(97+ans[i]))
    letter.append(chr(97+ans[i]))

print(''.join(letter))
n=int(input())
a=[]
q=n//26
r=n%26
for i in range(15):
    a.insert(0,r)
    r=q%26
    q=q//26
b=[]
for j in range(15):
    x=int(a[j])
    if x==0:
        continue
    else:
        x=chr(x+96)
        b.append(x)
c="".join(b)
c.replace("0","")
print(c)
def num2alpha(num):
    if num<=26:
        return chr(64+num)
    elif num%26==0:
        return num2alpha(num//26-1)+chr(90)
    else:
        return num2alpha(num//26)+chr(64+num%26)

n=int(input())
print(num2alpha(n))
from collections import deque

def to_char(n):
    base = ord('a')
    return chr(base + n)

def main():
    N = int(input()) - 1
    q = deque([])
    v = N % 26
    q.appendleft(v)
    N //= 26
    while N > 0:
        v = (N - 1) % 26
        q.appendleft(v)
        N //= 26
    # print(q)
    if q[0] == 0:
        q.popleft()
    print(''.join(map(to_char, q)))

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

for i in range(9):
  tmp1 = n %  26
  tmp2 = n // 26
  print(tmp2, tmp1, (tmp1+25)%26)
  result = chr(97 + (tmp1+25)%26)+result
  if n < 27:
    break
  else:
    n = tmp2
  
print(result)
N= int(input())
mylist =[]
while N >25:
    b = N%26
    mylist.append(b)
    N = N//26
mylist.append(N)

num = ["z","a","b","c","d","e","f","g","h","i","j","k","l","n","m","o","p","q","r","s","t","u","v","w","x","y"]
ans = []
for i in reversed(mylist):
    ans.append(num[i])
ans
print(''.join(ans))
n = int(input())
ans = ""
while n > 0:
	ans += chr(n%26 + 96)
	n //= 26
print(ans[::-1])
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

N=int(input())
ans=[]
a=ord('a')-1
while N:
    ans.append(chr(N%26+a))
    N//=26
ans.reverse()
print(''.join(ans))
from itertools import count
from string import ascii_lowercase


def get_length(n):
    dogs = 0
    for i in count(1):
        dogs += 26 ** i
        if n <= dogs:
            return i


def get_name(n):
    length = get_length(n)
    if n <= 26:
        return ascii_lowercase[n - 1]
    else:
        return get_name(n // 26 ** (length - 1)) + get_name(n % 26 ** (length - 1))


N = int(input())
print(get_name(N))
n = int(input())
alpha = '*abcdefghijklmnopqrstuvwxyz'
n_div = []

while n > 26:
    n_div.append(n % 26)
    n //= 26
n_div.append(n)    

ans = ''
for i in n_div[::-1]:
    ans += alpha[i]
print(ans)
def main():
    N = int(input())
    digits = list()
    while N > 0:
        digits.append(N % 26)
        N //= 26
    digits.reverse()
    ans = ''
    for d in digits:
        ans += chr(d - 1 + ord('a'))
    print(ans)


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

pow = 1
while True:
  if N <= 26**pow:
    break
  pow += 1

n = N - 26**(pow-1)
s = []
for i in range(pow-1, -1, -1):
    print(i)
    q = n // (26**i)
    s.append(q)
    n = n % (26**i) 

name = ''
for i in range(len(s)):
    if i == 0:
        name = name + 'abcdefghijklmnopqrstuvwxyz'[s[i]]
    else:
        name = name + 'abcdefghijklmnopqrstuvwxyz'[s[i]-1]

print(name)
N = int(input())
res = ''
chars = 'Xabcdefghijklmnopqrstuvwxyz'

while N > 0:
    amari = N % 26
    if amari == 0:
        amari = 26
    # res += chr(96 + amari)
    res += chars[amari]
    N //= 26

print(res[::-1])
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"]
name=""
for i in range(N):
  name+=alpha[int(N%26)]
  N/=26
print(name)
N = int(input())
N -= 1
M = N 
count = 0
alpha = "abcdefghijklmnopqrstuvwxyz"
output = ""
if N == 26:
    count += 1
while N >= 27:
    N = N // 26
    count += 1
for i in range(1,count+1):
    M = M - 26 ** i

for _ in range(count):
    if M >= 26:
        mod = M % 26
        M = M // 26
        output = alpha[mod] + output
    else:
        output = alpha[M] + output

output = alpha[M] + output
print(output)
def Base_10_to_n(X, n):
    if (int(X/n)):
        return Base_10_to_n(int(X/n), n)+str(X%n)
    return str(X%n)

    
from sys import stdin

N = int(input())

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

x26 = Base_10_to_n(N, 26)

result = ""

for i  in range(0, len(x26)):
    a = int(x26[i])
    b = alphabets[a - 1]
    result += b
print(result)
n = int(input())
alpha_arr = [chr(i) for i in range(97, 97+26)]
ans = []
a, b = divmod(n, 26)
if b != 0:
    ans.insert(0, alpha_arr[b - 1])
else:
    ans.insert(0, 'z')
while True:
    if a == 0:
        break
    else:
        if b == 0 and a < 2:
            break
        a, b = divmod(a, 26)
        if b != 0:
            ans.insert(0, alpha_arr[b - 1])
        else:
            ans.insert(0, 'z')
print(''.join(ans))
num=int(input())


def num2alpha(num):
    if num<=26:
        return chr(64+num)
    elif num%26==0:
        return num2alpha(num//26-1)+chr(90)
    else:
        return num2alpha(num//26)+chr(64+num%26)

ans=num2alpha(num)

print(ans)
# One Quadrillion and One Dalmetians

N = int(input())

Q = [N]
R = []
name =[]
i = 0

while Q[i] // 26 != 0:
    Q.append(Q[i] // 26)
    R.append(Q[i] % 26)
    i += 1
    
name.append(chr(Q[i]+96))

while i != 0 :
	i -= 1
	name.append(chr(R[i]+96))

print(''.join(name))
N = int(input())
ans = ''
i = 1

while N > 0:
    ans = chr(ord('a') + N % (26) - 1) + ans

    N = (N-1) // 26

print(ans)
exit()
def LI(): return list(map(int, input().split()))
def I(): return map(int, input().split())
mod = 10**9 + 7
dog = 10 ** 15 + 1

def main():
  n = int(input())
  memo = []
  for i in range(10,-1,-1):
    memo.append(n // (26**i))
    n -= 26**i * (n//(26**i))
  ans = ''
  alphabet = 'abcdefghijklmnopqrstuvwxyz'
  for i in memo:
    if i == 0:
      memo = memo[i+1:]
    else: break
  for i in memo:
    ans += alphabet[i-1]
  print(ans)

if __name__ == '__main__':
  main()
import sys
N = int(input())

alphabet = "0abcdefghijklmnopqrstuvwxyz"
name = []
if N == 0:
    print("a")
    sys.exit()

while N > 0:
    name += alphabet[N % 26]
    N //= 26
name.reverse()
print("".join(name))
N = int(input())
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']
nList = []
while True:
  if N % 26 != 0:
    nList.append(List[(N % 26)])
    N = N // 26
  else:
    break
nList.reverse()
print(''.join(nList))
n = int(input())

ans = ""
while n > 26:
  n, mod = divmod(n, 26)
  ans = chr(ord("a")+mod-1) + ans
ans = chr(ord("a")+n-1) + ans

print(ans)
n=int(input())
a=[chr(ord('a') + i) for i in range(26)]
l=[]
cnt=0
inc=1
while True:
  cnt+=26**inc
  if cnt>=n:
    #print(inc)
    break
  inc+=1
s=0
if n<=26:
  l.append(n)
for i in range(inc-1,0,-1):
  #print('i',i)
  x=n//26**(i)
  l.append(x)
  n=n-x*26**i
  #print("n",n,x)
  if n<=26:
    l.append(n)

ans=""
print(l)
for li in l:
  if li==0:
    li=26
  ans+=chr(ord('a') + li-1)
print(ans)
n = int(input())
result = ''


def rec(n, result):
    q, mod = divmod(n, 26)
    if n == 0:
        return result
    result += chr(mod + 96)
    n = q
    return rec(n, result)


result = rec(n, result)
print(result[::-1])
import math

n = int(input())

length = 1
num = 26
l = [0,26]

while True:
    if num >= n:
        break
    length += 1
    num = 26 ** length + num
    l.append(num)

ans = []
for i in range(length)[::-1]:
    if n < l[i]:
        ans.append('a')
        continue
    num = n - l[i] - 1
    if num == -1:
        ans.append('z')
        continue
    tmp = 26 ** i
    #print(num, tmp, num // tmp)
    ans.append(chr(num // tmp + 97))
    n = n % tmp
    #print(num, num // tmp, n)

print(''.join(ans))
num_to_alpha = "zabcdefghijklmnopqrstuvwxy"

n = int(input())

ans = []
while n:
    num = n % 26
    ans.append(num_to_alpha[num])
    n //= 26

print(''.join(ans[::-1]))
N=int(input())
List='abcdefghijklmnopqrstuvdxyz'

Ans=''

while N>=1:
    Amari=N%26
    
    if Amari==0:
        Amari=26
        
    
    Ans=List[Amari-1]+Ans
        
    N=(N-1)//26
    
print(Ans)
import string
N = int(input())
L = string.ascii_lowercase
ans = []

while 1 < N//26 :
    ans.append(L[(N%26)-1])
    N //= 26
else :
    ans.append(L[(N%26)-1])

ans.reverse()
print("".join(ans))
n = int(input())
alphabet = list("abcdefghijklmnopqrstuvwxyz")
if n <= 26:
    print(alphabet[n-1])
else:
    ans = ""
    while(True):
        q, mod = divmod(n, 26)
        if mod == 0:
            q -= 1
            ans = "z" + ans
        else:
            ans = alphabet[mod-1] + ans
        if q <= 1:
            break
        n = q
    print(ans)
NUM = int(input())
R = ""
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']
while NUM >= 26:
    R = li[(NUM % 26)-1] + R
    NUM = int(NUM/26)
R = li[NUM-1] + R
print(R)
n = int(input())

# # 名前の長さを求める
i = 1
while 1:
    # print(i)
    if n <= 26 ** i:
        break
    else:
        n -= 26**i
    i += 1
print(i)

name = ""
n -= 1
for j in range(i):
    name += chr(ord('a') + n % 26)
    n //= 26

print(name[::-1])
# -*- coding: utf-8 -*-
N = int(input())
# 26 ** 9 < 1000000000000001 < 26 ** 10 なので最大でも(9+1)桁の文字
index = [None] * 10

m = N
for i in range(0, 10, 1):
  a = m % 26
  if a == 0:
    index[i] = 26
  else:
    index[i] = a
  
  if a == 0:
    m = (m // 26) - 1
  else:
    m = m // 26
  
  if m == 0:
    break
  
word = ''
for i in index:
  s = ''
  if i:
    s = chr(ord('a') + i - 1)
    word += s
print(word[::-1])
n = int(input())

ans = ''
i = 0
while True:
    if n < 26**i:
        break
    tmp = (n//(26**i)) % 26
    ans = chr(tmp + 97 - 1) + ans
    i += 1

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

a = 0
k = 0
while a <= n:
	k += 1
	a += 26**k

a -= 26**k
k -= 1

ans = ""
t = 'abcdefghijklmnopqrstuvwxyz'
m = n - a
if m != 0:
	for i in range(k, 0, -1):
		ans += t[int(m/(26**i))]
		m = m%(26**i)
else:
	for i in range(k-1):
		ans += t[-1]

ans += t[m-1]

print(ans)
from collections import deque
n = int(input())

a = 0
b = 0
tm = 0
while a < n:
    tm += 1
    b = a
    a += 26 ** tm

def base_10_to_n(x, n, tm):
    A = deque([])
    if x == 0:
        A = deque([0 for i in range(tm)])
    else:
        while x > 0:
            A.appendleft(x%n)
            x = int(x/n)
    return A
    
L = base_10_to_n(n - b - 1, 26, tm)

#print(a)
#print(L)
ans = ''
for i in L:
    ans += chr(i + 97)
print(ans)
#c
M = int(input())
s=''
a=['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']
while M>26:
    s+=a[M%26]
    M=M//26
s+=a[M%26]
print(s[::-1])
n = int(input())
data = [26 ** x for x in range(1, 12)]

d = 0
r = 0
for i in range(len(data)):
    d += data[i]
    if n <= d:
        r = i+1
        break

kurai = [26 **  x for x in range(r)][::-1]
ans = [0] * r
for i in range(r):
    ans[i]= min(n // kurai[i], 26)
    n -= kurai[i] * ans[i]

alpha = [chr(i) for i in range(97, 97+26)] 
ans = [alpha[a - 1] for a in ans]
print("".join(ans))
n = int(input())
name = []
while n > 0:
    modulo = n % 26
    name.append(chr(ord("a")+modulo-1))
    n //= 26
print ("".join(reversed(name)))
N = int(input())
ans = ''
while N > 0:
    N -= 1
    ans += chr(ord('a') + N % 26)
    N //= 26
    print(ans[::-1])
N = int(input())
ans = 0
li = list(chr(i) for i in range(97, 134))
q, r = divmod(N, 26)
ans = li[r - 1]
while True:
    if q == 0:
        print(ans)
        exit()
    q, r = divmod(q, 26)
    ans = li[r - 1] + ans
n = int(input())
al = 'zabcdefghijklmnopqrstuvwxyz'
num = []
while True:
    if n//26 == 0:
        num.append(n)
        break
    else:
        amari = n%26
        n = n//26
        num.append(amari)
num.reverse()
for nums in num:
    print(al[nums],end = "")
number = int(input())
Toname = []
name = []
for i in range(10,0,-1):
    waru = 26 ** i
    if number >= waru:
        Toname.append(number // waru)
        number = number % waru
Toname.append(number)
leng = len(Toname)
for j in range(leng):
    Toname[j] += 96
    name.append(chr(Toname[j]))
print(''.join(name))
#! -*- coding: utf-8 -*-
n = int(input())

"""
26 ** 10 から値がたつか確かめる
"""

counter = 10
counter_list = []

for i in reversed(range(0, 11)):
    result = n // (26 ** i)
    print(result)
    if result > 0:
        counter_list.append(chr(96 + result))
    n %= (26 ** i)

print(''.join(counter_list))
N = int(input())

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

while(N>26**n):
  n+=1
while(n>0):
  a = N//(26**(n-1))
  s += l[a-1]
  N -= a*(26**(n-1))
  n-=1
  
print(s)
n = int(input())

s = ''
while (n > 0):
    r = n % 26
    n //= 26
    if r == 0:
        s = 'z' + s
    else:
        c = chr((r - 1) + ord('a'))
        s = c + s

print(s)
import string

def numberToBase(n, b):
    if n == 0:
        return [0]
    digits = []
    while n:
        digits.append(int(n % b))
        n //= b
    return digits[::-1]

letters = {}
for x, y in zip(range(1, 27), string.ascii_lowercase):
    letters[x] = y

def toLetter(x):
    return letters[x]

print(''.join(list(map(toLetter, numberToBase(123456789, 26)))))
n = int(input())

tag = ['','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']
cnt = []

for i in range(10):
    if n//(26**(10-i)) != 0:
        cnt.append(n//(26**(10-i)))
        n = int(n%26**(10-i))

cnt.append(n)

for i in range(len(cnt)-1):
    cnt[i] = tag[cnt[i]]

cnt[-1] = tag[cnt[-1]]

cnt = ''.join(cnt)

print(cnt)
N=int(input())
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"]
l=1
num=26

while N>num:
    if N<num:
        break
    l+=1
    N-=num
    num*=26
ans=[]
for i in range(l):
    ans.append(N%26)
    N//=26
ans[0]-=1

for j in ans[::-1]:
    print(a[j],end="")
print()
n=int(input())-1

l=[]
a=n%26
n//=26
l.append(chr(97+a))
while n>0:
    a=n%26
    n//=26
    l.append(chr(96+a))
l.reverse()
ans=''.join(l)
print(ans)
def main():
    n = int(input())

    chars = 'zabcdefghijklmnopqrstuvwxy'

    st = ''
    while True:
        a = n % 26
        st += chars[a]
        n = n // 26
        if n == 0:
            break

    res = ''.join(list(reversed(st)))
    print(res)


main()
n = int(input())

p = []
while n >= 1:
  p.append(chr(n % 26 + 96))
  n = n // 26
print(''.join(p[::-1]))
N = int(input())
alpha = list('abcdefghijklmnopqrstuvwxyz')
ans = []
while N>0:
    N, d = N//26, N%26
    if N==0:
        break
    ans.append(alpha[d-1])
ans = list(reversed(ans))
ans = "".join(ans)
print(ans)
N=int(input())
a_l=""
i=1
while i:
    if N<26:
        i=0
        l=chr(97+N-1)
    else:
        m = N % 26
        N=N//26
        l=chr(97+m-1)
    a_l=l+a_l
print(a_l)
import itertools
import math

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

N = int(input())
num = Base_10_to_n(N,26)
s = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']

st = []
while(N!=0):
    if N < 26:
        st.append(N%26)
        break
    st.append(N%26)
    N = N//26


for i in st[::-1]:
    print(s[i-1],end='')
def main():
    n = int(input())
    beki = [0, 26, 676, 17576, 456976, 11881376, 308915776, 8031810176, 208827064576, 5429503678976, 141167095653376, 3670344486987776]
    A = list("abcdefghijklmnopqrstuvwxyz")

    t = ['']*12
    for i in range(12)[::-1]:
        d,m = divmod(n,26)
        t[i] = A[m-1]
        n = d
        if n == 0:
            break
    print(''.join(t))

if __name__ == '__main__':
    main()
N = int(input()) - 1
keta = 1
cumsum = 0
oldcumsum = 0
while True:
  cumsum += 26 ** keta
  if cumsum > N:
    break
  else:
    oldcumsum = cumsum
  keta += 1

N -= oldcumsum
#N -= 1
print(keta)

name = ''
for k in range(1,keta+1):
  ch_n = N // (26 ** (keta - k))
  ch = chr(ord('a') + ch_n)
  name += ch
  N -= ch_n * (26 ** (keta - k))
print(name)
n = int(input())
ans = []
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']
while True:
    a,b = divmod(n,26)
    ans.append(alp[b - 1])
    if a >= 26:
        n = a
    else:
        ans.append("a")
        break

ans = ans[::-1]
print("".join(ans))
N = int(input())
l = 'abcdefghijklmnopqrstuvwxyz'
s = ''
a = N % 26
s += l[a]
N //= 26
while(N!=0):
  N -= 1
  a = N % 26
  s += l[a]
  N //= 26
print(s[::-1])
#関数リスト
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 % 27 - 1] + result
    num = num // 27
    if num == 0:
        break
print(result, end = '')
# -*- coding: utf-8 -*-

n = int(input())

r = ''

def to_moji(x: int):
    return chr(96 + x)

def devide(x, moji):
    a = x // 26
    b = x % 26
    if a < 1:
        moji = to_moji(b) + moji
        return moji
    elif 1 <= a and a <= 26:
        moji = to_moji(b) + moji
        moji = to_moji(a) + moji
        return moji
    else:
        moji = to_moji(b) + moji
        return devide(a, moji)

print(devide(n, r))
n=int(input())
ans=""
while n!=0:
    ans=chr(ord('a')+n%26-1)+ans
    n//=26
print(ans)
N=int(input())
def num2alpha(num):
    if num<=26:
        return chr(num+96)
    elif num%26==0:
        return num2alpha(num//26-1)+chr(96)
    else:
        return num2alpha(num//26)+chr(num%26+96)
print(num2alpha(N))
#!/usr/bin/python3
import sys
input = lambda: sys.stdin.readline().strip()
n = int(input()) - 1
ans = []
while n > 0:
    ans.append(n % 26)
    n //= 26
print(*reversed([chr(ord('a') + x) if i == 0 else ('z' if x == 0 else chr(ord('a') + x - 1)) for i, x in enumerate(ans)]), sep='')
def num2alpha(num):
    if num<=26:
        return chr(64+num)
    elif num%26==0:
        return num2alpha(num//26-1)+chr(90)
    else:
        return num2alpha(num//26)+chr(64+num%26)
n=int(input())

n-=1
ans=chr(n%26+97)
while(n):
    n//=26
    if n==0:
        break
    ans=chr(n%26+96)+ans

print(ans)
n = int(input())
ans = ''
while n != 0:
    s = n % 26
    ans += chr(s + 96)
    n //= 26
print(ans[::-1])