#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n;++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int inf = 0x3f3f3f3f;
const int Mod = 1e9 + 7;
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, int p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
void chmax(int &a, int b){ (b > a) ? (a = b) : 0; }

inline int getd(int y){
	return 365 + (y % 4 == 0 && (y % 100 != 0 || y % 400 == 0));
}
const int md[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

int p[3333];

int main(){
	ios::sync_with_stdio(false);

	p[2023] = 6;
	for(int j = 2023; j <= 2035; ++j)
		p[j+1] = (p[j] + getd(j)) % 7;
	for(int j = 2022; j >= 1949; --j)
		p[j] = ((p[j+1] - getd(j)) % 7 + 7) % 7;

	int y;
	cin >> y;
	int np = p[y];
	int ans = 0;
	rep(i, 12){
		int nd = md[i] + (getd(y) == 366 && i == 1);
		//cout << np << " " << nd << " " << ((np + nd) % 7 < np) << "\n";
		if(np != 0) ++ans, nd -= 7 - np, np = 0;
		ans += (nd + 6) / 7;
		np = (np + nd) % 7;
		//cout << np << "\n";
	}
	cout << ans << "\n";

	return 0;
}