#include<bits/stdc++.h>
#define fi first
#define se second
//#define int ll
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
int mod = 1e9 + 7, mod2 = 998244353;
const long long LNF = 0x3f3f3f3f3f3f3f3f;
const int N = 4e6 + 10, INF = 0x3f3f3f3f;
ll n, m, k;
int qmi(int a, int b) {
	ll res = 1;
	while (b) {
		if (b & 1)res = res * a % mod;
		a = (ll)a * a % mod;
		b >>= 1;
	}
	return res;
}
ll a[20] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

int check(int n) {
	if (n % 400 == 0 || (n % 4 == 0 && n % 100 != 0)) return 1;
	else return 0;
}

void solve() {
	cin >> n;
	if(n < 2023) {
		ll ans = 0;
		ll he = 1;
		for (int i = 2022; i >= n; i--) {
			he %= 7;
			ans = 0;
			for (int j = 11; j >= 0; j--) {
				he += a[j];
				if(j == 1)he += check(i);
				if(he % 7 != 0)ans++;
			}
			ans += (he) / 7;
			if(i == n){
				cout << ans;
			}
		}
	} else {
		ll ans = 0;
		ll he = 6;
		for (int i = 2023; i <= n; i++) {
			he %= 7;
			ans = 0;
			for (int j = 0; j < 12; j++) {
				he += a[j];
				if(j == 1)he += check(i);
				if(he % 7 != 0)ans++;
			}
			ans += (he) / 7;
			if(i == n){
				cout << ans;
			}
		}
	}
}
signed main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cout << fixed << setprecision(2);
	int T = 1;
//	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}