#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define endl '\n'
using ll = long long;
using ull = unsigned long long;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
const int N = 1e6 + 10;
const int M = 131;
const int INF = 0x3f3f3f3f;
const long long LNF = 0x3f3f3f3f3f3f3f3f;
const long long mod = 1e9 + 7;
int a[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

bool check(int x){
	return (x % 4 == 0 && x % 100 != 0) || (x % 400 == 0); 
}

int howmuch(int y, int m){
	return a[m - 1] + (check(y) && m == 2);
}

int cal(int y, int m, int d){
	int res = 2;
	for(int i = 1970; i < y; i++) res = res + 365 + check(i);
	for(int i = 1; i < m; i++) res = res + howmuch(y, i);
	res = (res + d) % 7 + 1;
	return res;
}

void solve(){
	ll n; cin >> n;
	int nw = cal(n, 1, 1);
	int res = 0;
	for(int i = 1; i <= 12; i++){
		int num = howmuch(n, i);
		for(int j = 1; j <= num; j++){
			if(j == 1 || nw == 1) res += 1;
			nw = nw % 7 + 1;
		}
	}
	cout << res << '\n';
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(12);
	int t = 1;
	//cin >> t;
	while(t--){
		solve();
	}
	return 0 - 0;
}