import std.stdio, std.string, std.conv;
import std.range, std.algorithm;

void main() {
    int n;
    scan(n);

    int[] coin = new int[](10^^4 + 1);
    coin[1] = 1;
    foreach (i ; 2 .. 10^^4 + 1) {
        coin[i] = coin[i-1] + i;
    }
    bool[] ex = new bool[](n + 1);

    foreach (ci ; coin) {
        if (ci <= n) {
            ex[ci] = 1;
        }
        else break;
    }

    if (ex[n]) {
        writeln(1);
        return;
    }

    foreach (ci ; coin[1 .. $]) {
        if (n - ci >= 0 && ex[n - ci]) {
            writeln(2);
            return;
        }
    }

    foreach (ci ; coin[1 .. $]) {
        foreach (cj ; coin[1 .. $]) {
            if (n - ci - cj >= 0 && ex[n - ci - cj]) {
                writeln(3);
                return;
            }
        }
    }
}



void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}