import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv,
    std.functional, std.math, std.numeric, std.range, std.stdio, std.string,
    std.random, std.typecons, std.container;

ulong MAX = 1_000_100, MOD = 1_000_000_007, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = () => readln.chomp.to!(T);
alias aryread(T = long) = () => readln.split.to!(T[]);
alias Pair = Tuple!(long, "x", long, "y", long, "cost");
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);

void main()
{
    auto k = lread();
    auto q = new DList!long(iota(1, 10).array());
    foreach (_; iota(k - 1))
    {
        auto t = q.front();
        q.removeFront();
        auto res = t % 10;
        if (res)
            q.insertBack(10 * t + res - 1);

        q.insertBack(10 * t + res);

        if (res < 9)
            q.insertBack(10 * t + res + 1);
    }
    q.front.writeln();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}
