Problem:
Score : 300 points

Problem 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?"

Constraints

N is an integer.

1 \leq N \leq 1000000000000001

Input

Input is given from Standard Input in the following format:

N

Output

Print the answer to Roger's question as a string consisting of lowercase English letters.

Sample Input 1

2

Sample Output 1

b

Sample Input 2

27

Sample Output 2

aa

Sample Input 3

123456789

Sample Output 3

jjddja

Solution in Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.Scanner;
public class Main{
 public static void main(String[] args) {
   Scanner kbd =new Scanner(System.in);
   long n =kbd.nextLong();
   int x=(int)(Math.log(n)/Math.log(26))+1; //答えの桁数
   long[] A= new long[x+1];
   String[] B= new String[x+1];

   for(int i=1;i<=x;i++){
   A[i]=n%26;
   n=n/26;
   if(A[i]==1){B[i]="a"; continue;}
   if(A[i]==2){B[i]="b"; continue;}
   if(A[i]==3){B[i]="c"; continue;}
   if(A[i]==4){B[i]="d"; continue;}
   if(A[i]==5){B[i]="e"; continue;}
   if(A[i]==6){B[i]="f"; continue;}
   if(A[i]==7){B[i]="g"; continue;}
   if(A[i]==8){B[i]="h"; continue;}
   if(A[i]==9){B[i]="i"; continue;}
   if(A[i]==10){B[i]="j"; continue;}
   if(A[i]==11){B[i]="k"; continue;}
   if(A[i]==12){B[i]="l"; continue;}
   if(A[i]==13){B[i]="m"; continue;}
   if(A[i]==14){B[i]="n"; continue;}
   if(A[i]==15){B[i]="o"; continue;}
   if(A[i]==16){B[i]="p"; continue;}
   if(A[i]==17){B[i]="q"; continue;}
   if(A[i]==18){B[i]="r"; continue;}
   if(A[i]==19){B[i]="s"; continue;}
   if(A[i]==20){B[i]="t"; continue;}
   if(A[i]==21){B[i]="u"; continue;}
   if(A[i]==22){B[i]="v"; continue;}
   if(A[i]==23){B[i]="w"; continue;}
   if(A[i]==24){B[i]="x"; continue;}
   if(A[i]==25){B[i]="y"; continue;}
   if(A[i]==0){B[i]="z"; continue;}
}
  for(int i=x;i>0;i--){
   System.out.printf(B[i]);
   System.out.println("");
 }
}
}