#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	cin >> N;
	set<int> st;
	int x = 1;
	int res = 3;
	while (x*(x + 1) / 2 < 100000000) {
		st.insert(x*(x + 1) / 2);
		x++;
	}
	if (st.count(N) == 1) {
		res = 1;
	}
	else {
		for (auto s : st) {
			if (st.count(N - s) == 1) {
				res = 2;
			}
		}
	}
	cout << res << endl;
}