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 C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <stdio.h>

int main(){
    long int i,j;
    int k=0;
    int l;
    int a[200];
    scanf("%ld",&i);
    while(i!=0){
        j=i%26;
        i=i/26;
        a[k]=j;
        k++;
        if(i==1&&j==0)
        break;
    }
    for(l=k-1;l>=0;l--){
        switch (a[l]){
        case 0:
            printf("z");
            break;
        case 1:
            printf("a");
            break;
        case 2:
            printf("b");
            break;
        case 3:
            printf("c");
            break;
        case 4:
            printf("d");
            break;
        case 5:
            printf("e");
            break;
        case 6:
            printf("f");
            break;
        case 7:
            printf("g");
            break;
        case 8:
            printf("h");
            break;
        case 9:
            printf("i");
            break;
        case 10:
            printf("j");
            break;
        case 11:
            printf("k");
            break;
        case 12:
            printf("l");
            break;
        case 13:
            printf("m");
            break;
        case 14:
            printf("n");
            break;
        case 15:
            printf("o");
            break;
        case 16:
            printf("p");
            break;
        case 17:
            printf("q");
            break;
        case 18:
            printf("r");
            break;
        case 19:
            printf("s");
            break;
        case 20:
            printf("t");
            break;
        case 21:
            printf("u");
            break;
        case 22:
            printf("v");
            break;
        case 23:
            printf("w");
            break;
        case 24:
            printf("x");
            break;
        default:
            printf("y");
            break;
        }
    }
       return 0;

    }