#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

array<int, 13> days{0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

bool isLeap(int y) {
    return y % 400 == 0 || y % 4 == 0 && y % 100 != 0;
}
int getDays(int y, int m) {
    return days[m] + (m == 2 && isLeap(y));
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int n;
        cin >> n;

        int ans = 0;

        for (int y = 1970, cur = 4; y <= n; y++) {
            for (int m = 1; m <= 12; m++) {
                int cnt = getDays(y, m);
                for (int d = 1; d <= cnt; d++) {
                    if (n == y) {
                        ans += d == 1 || cur == 1;
                    }
                    cur = cur % 7 + 1;
                }
            }
        }

        cout << ans << '\n';
    };
    
    solve();
    
    return 0;
}