#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    ll N;
    std::cin >> N;
    
    vector<ll> ts;
    for(ll i=1;i*(i+1)/2<=N;++i){
        ts.emplace_back(i*(i+1)/2);
    }

    if(binary_search(ts.begin(), ts.end(), N)){
        std::cout << 1 << std::endl;
        return 0;
    }

    for(ll i=1;i*(i+1)/2<=N;++i){
        if(binary_search(ts.begin(), ts.end(), N - i * (i+1) / 2)){
            std::cout << 2 << std::endl;
            return 0;
        }
    }

    std::cout << 3 << std::endl;
}