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 Kotlin (1.3.71) (judge verdict: Wrong Answer)

fun main(args: Array<String>) {
    val n = readLine()!!.toLong()
    var answer = ""
    val alphabets = arrayOf("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","z")
    if (n == Math.pow(26.0, 1.0).toLong()) return println("z")
    if (n == Math.pow(26.0, 2.0).toLong() + Math.pow(26.0, 1.0).toLong()) return println("zz")
    if (n == Math.pow(26.0, 3.0).toLong() + Math.pow(26.0, 2.0).toLong() + Math.pow(26.0, 1.0).toLong()) return println("zzz")
    if (n == Math.pow(26.0, 4.0).toLong() + Math.pow(26.0, 3.0).toLong() + Math.pow(26.0, 2.0).toLong() + Math.pow(26.0, 1.0).toLong()) return println("zzzz")
    if (n == Math.pow(26.0, 5.0).toLong() + Math.pow(26.0, 4.0).toLong() + Math.pow(26.0, 3.0).toLong() + Math.pow(26.0, 2.0).toLong() + Math.pow(26.0, 1.0).toLong()) return println("zzzzz")
    if (n == Math.pow(26.0, 6.0).toLong() + Math.pow(26.0, 5.0).toLong() + Math.pow(26.0, 4.0).toLong() + Math.pow(26.0, 3.0).toLong() + Math.pow(26.0, 2.0).toLong() + Math.pow(26.0, 1.0).toLong()) return println("zzzzzz")
    if (n == Math.pow(26.0, 7.0).toLong() + Math.pow(26.0, 6.0).toLong() + Math.pow(26.0, 5.0).toLong() + Math.pow(26.0, 4.0).toLong() + Math.pow(26.0, 3.0).toLong() + Math.pow(26.0, 2.0).toLong() + Math.pow(26.0, 1.0).toLong()) return println("zzzzzzz")
    if (n == Math.pow(26.0, 8.0).toLong() + Math.pow(26.0, 7.0).toLong() + Math.pow(26.0, 6.0).toLong() + Math.pow(26.0, 5.0).toLong() + Math.pow(26.0, 4.0).toLong() + Math.pow(26.0, 3.0).toLong() + Math.pow(26.0, 2.0).toLong() + Math.pow(26.0, 1.0).toLong()) return println("zzzzzzzz")
    if (n == Math.pow(26.0, 9.0).toLong() + Math.pow(26.0, 8.0).toLong() + Math.pow(26.0, 7.0).toLong() + Math.pow(26.0, 6.0).toLong() + Math.pow(26.0, 5.0).toLong() + Math.pow(26.0, 4.0).toLong() + Math.pow(26.0, 3.0).toLong() + Math.pow(26.0, 2.0).toLong() + Math.pow(26.0, 1.0).toLong()) return println("zzzzzzzzz")
    if (n == Math.pow(26.0, 10.0).toLong() + Math.pow(26.0, 9.0).toLong() +  Math.pow(26.0, 8.0).toLong() + Math.pow(26.0, 7.0).toLong() + Math.pow(26.0, 6.0).toLong() + Math.pow(26.0, 5.0).toLong() + Math.pow(26.0, 4.0).toLong() + Math.pow(26.0, 3.0).toLong() + Math.pow(26.0, 2.0).toLong() + Math.pow(26.0, 1.0).toLong()) return println("zzzzzzzzzz")
    if (n == Math.pow(26.0, 11.0).toLong() +  Math.pow(26.0, 10.0).toLong() + Math.pow(26.0, 9.0).toLong() + Math.pow(26.0, 8.0).toLong() + Math.pow(26.0, 7.0).toLong() + Math.pow(26.0, 6.0).toLong() + Math.pow(26.0, 5.0).toLong() + Math.pow(26.0, 4.0).toLong() + Math.pow(26.0, 3.0).toLong() + Math.pow(26.0, 2.0).toLong() + Math.pow(26.0, 1.0).toLong()) return println("zzzzzzzzzzz")
    for (i in 10 downTo 0) {
        if ((n/ Math.pow(26.0,i.toDouble()) % 26).toInt() > 0) {
            answer += alphabets[(n / Math.pow(26.0,i.toDouble()) % 26).toInt()]
        }
    }
    println(answer)
}