#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;



int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	vector<ll> c;
	for (ll i = 1; i * (i + 1)/ 2<= 10000000; i++) {
		c.push_back(i * (i + 1) / 2);
	}
	ll N; cin >> N;
	if (binary_search(c.begin(), c.end(), N)) {
		puts("1");
	}
	else {
		vector<ll> cc;
		for (ll i = 0; i < c.size(); i++) {
			for (ll j = 0; j < c.size(); j++) {
				if (c[i] + c[j] == N) {
					puts("2");
					return 0;
				}
			}
		}
	}
	puts("3");
	return 0;
}