#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

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

void dfs(int y, int x, vector<vector<int> >& a, vector<int>& mi) {
	int H = a.size(), W = a[0].size();
	for (int k = 0; k < 4; k++) {
		int _y = y + dy[k], _x = x + dx[k];
		if (_y >= 0 && _y < H && _x >= 0 && _x < W && a[_y][_x]) {
			mi[a[_y][_x]] = min(mi[a[_y][_x]], W);
			a[_y][_x] = 0;
			dfs(_y, _x, a, mi);
		}
	}
}

int main() {
	vector<bool> p(10000, true);
	p[1] = false;
	for (int i = 2; i < 10000; i++)
		if (p[i])
			for (int j = i * 2; j < 10000; j += i)
				p[j] = false;
	vector<int> mi(10000, INT_MAX);
	for (int W = 1; W <= 1000; W++) {
		vector<vector<int> > a(10000 / W + 1, vector<int>(W));
		for (int i = 1; i < 10000; i++)
			if (!p[i])
				a[(i - 1) / W][(i - 1) % W] = i;
		dfs(0, 0, a, mi);
	}
	string s; cin >> s;
	int n = s.length();
	if (n <= 3) {
		stringstream ss(s);
		int x; ss >> x;
		cout << mi[x] << endl;
		return 0;
	}
	int x = 0;
	for (int i = 0; i < s.length(); i++)
		x = (x * 10 + s[i] - '0') % 14;
	if (x != 1) cout << 14 << endl;
}