output_description: Print the answer to Roger's question as a string consisting of lowercase
  English letters.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: import string
  
  
  def main():
      alphabet = string.ascii_lowercase
      ans = []
  
      N = int(input())
  
      if N < 27:
          ans.append(alphabet[N - 1])
      else:
          q, mod = divmod(N, 26)
  
          if mod == 0:
              if q == 1:
                  ans.append("z")
                  return ans
              elif 1 < q and q <= 27:
                  ans.append("z")
                  ans.append(alphabet[q - 2])
                  return ans
              elif 27 < q:
                  ans.append("z")
                  n = q
          else:
              if 1 <= q and q < 27:
                  ans.append(alphabet[mod - 1])
                  ans.append(alphabet[q - 1])
                  return ans
              if 27 <= q:
                  ans.append(alphabet[mod - 1])
                  n = q
  
          while n:
              q, mod = divmod(n, 26)
  
              if mod == 0:
                  if q == 1:
                      ans.append("z")
                      return ans
                  elif 1 < q and q <= 27:
                      ans.append("z")
                      ans.append(alphabet[q - 2])
                      return ans
                  elif 27 < q:
                      ans.append("z")
                      n = q
              else:
                  if 1 <= q and q < 27:
                      ans.append(alphabet[mod - 1])
                      ans.append(alphabet[q - 1])
                      return ans
                  if 27 <= q:
                      ans.append(alphabet[mod - 1])
                      n = q
  
      return ans
  
  
  def main_2():
      ans = main()
  
      str_list = reversed(ans)
      mojiretu = ""
  
      for x in str_list:
          mojiretu += x
  
      print(mojiretu)
  
  
  main_2()
  
problem_description: Statement
  
  1000000000000001 dogs suddenly appeared under the roof of Roger's house, all
  of which he decided to keep. The dogs had been numbered 1 through
  1000000000000001, but he gave them new names, as follows:
  
    * the dogs numbered 1,2,\cdots,26 were respectively given the names `a`, `b`, ..., `z`;
    * the dogs numbered 27,28,29,\cdots,701,702  were respectively given the names `aa`, `ab`, `ac`, ..., `zy`, `zz`;
    * the dogs numbered 703,704,705,\cdots,18277,18278  were respectively given the names `aaa`, `aab`, `aac`, ..., `zzy`, `zzz`;
    * the dogs numbered 18279,18280,18281,\cdots,475253,475254  were respectively given the names `aaaa`, `aaab`, `aaac`, ..., `zzzy`, `zzzz`;
    * the dogs numbered 475255,475256,\cdots  were respectively given the names `aaaaa`, `aaaab`, ...;
    * and so on.
  
  To sum it up, the dogs numbered 1, 2, \cdots were respectively given the
  following names:
  
  `a`, `b`, ..., `z`, `aa`, `ab`, ..., `az`, `ba`, `bb`, ..., `bz`, ..., `za`,
  `zb`, ..., `zz`, `aaa`, `aab`, ..., `aaz`, `aba`, `abb`, ..., `abz`, ...,
  `zzz`, `aaaa`, ...
  
  Now, Roger asks you:
  
  "What is the name for the dog numbered N?"
samples: [{"input": "2", "output": "b\n    \n\n* * *"}, {"input": "27", "output": "aa\n    \n\n* * *"}, {"input": "123456789", "output": "jjddja"}]