#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn solve() {
    let k = get!(usize);

    let mut vec = vec![vec![0usize; 10]; 20];
    for i in 0..10 {
        vec[0][i] = 1;
    }
    for i in 1..20 {
        for j in 0..10 {
            vec[i][j] = vec[i-1][j]+if j == 0 {
                vec[i-1][j+1]
            } else if j==9 {
                vec[i-1][j-1]
            } else {
                vec[i-1][j-1]+vec[i-1][j+1]
            };
        }
    }

    let mut sum = 0;
    for i in 0..20 {
        for j in 1..10 {
            if sum+vec[i][j] >= k {
                let mut res = Vec::new();
                res.push(j);
                let mut current = j;
                for l in (0..i).rev() {
                    for m in 0..3 {
                        let new = current+m;
                        if new == 0 || new == 11 {
                            continue;
                        }
                        let new = new-1;
                        if sum + vec[l][new] >= k {
                            res.push(new);
                            current = new;
                            break;
                        } else {
                            sum += vec[l][new];
                        }
                    }
                }
                for e in res {
                    print!("{}" ,e);
                }
                println!("");
                return;
            }
            sum += vec[i][j];
        }
    }
}


Measured memory_bytes: 8572