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 Rust (1.42.0) (judge verdict: Wrong Answer)

#![allow(non_snake_case)]
#![allow(unused_imports)]

use proconio::{input, fastout};
use proconio::marker::*;
use whiteread::parse_line;
use std::collections::*;
use num::*;

use itertools::Itertools;
use itertools_num::ItertoolsNum;

#[fastout]
fn main() {
    input!{
        n: usize,
    }
    let mut i = 1;
    let mut sum = 0;
    let alphabet: Vec<char> = (97..97+26).map(|x| std::char::from_u32(x).unwrap()).collect();;
    let mut map: HashMap<usize, usize> = HashMap::new();
    map.insert(0, 0);
    while sum < n {
        sum += 26usize.pow(i);
        i += 1;
        map.entry(i as usize).or_insert(sum);
    }
    // dbg!(&map);
    let i = i as usize;
    dbg!(&map);
    if i-1 < 2 {
        println!("{}", alphabet[i-1])
    } else if n == *map.get(&(i)).unwrap() {
        let mut ans = String::new();
        for idx in 0..(i-1) {
            ans.push('a')
        }
        println!("{}", ans)
    } else {
        let mut ans: String = String::new();
        let mut cnt = 2;
        while i - cnt != 0 {
            let idx = (n - map.get(&(i-1)).unwrap()) / 26usize.pow((i-cnt) as u32) % 26;
            ans.push(alphabet[idx]);
            cnt += 1;
        }
        // dbg!(&ans);
        let last_idx = (n - map.get(&(i-1)).unwrap()) % 26;
        if last_idx > 0 {
            ans.push(alphabet[last_idx-1]);
        } else {
            ans.push(alphabet[25])
        }
        
        println!("{}", ans)
    }

    println!("", );
}