#include <bits/stdc++.h>

#define LL long long
#define ull unsigned long long
#define F(i, j, k) for (int i = j; i <= k; ++i)
#define DF(i, j, k) for (int i = j; i >= k; --i)

using namespace std;

template <typename T> inline void read(T &n) {
    T w = 1;
    n = 0;
    char ch = getchar();
    while (!isdigit(ch) && ch != EOF) {
        if (ch == '-') w = -1;
        ch = getchar();
    }
    while (isdigit(ch) && ch != EOF) {
        n = (n << 3) + (n << 1) + (ch & 15);
        ch = getchar();
    }
    n *= w;
}

template <typename T> inline void write(T x) {
    T l = 0;
    ull y = 0;
    if (!x) { putchar(48); return; }
    if (x < 0) { x = -x; putchar('-'); }
    while (x) { y = y * 10 + x % 10; x /= 10; ++l; }
    while (l) { putchar(y % 10 + 48); y /= 10; --l; }
}

template <typename T> inline void writes(T x) {
    write(x);
    putchar(' ');
}

template <typename T> inline void writeln(T x) {
    write(x);
    puts("");
}

template <typename T> inline void checkmax(T &a, T b) { a = a > b ? a : b; }

template <typename T> inline void checkmin(T &a, T b) { a = a < b ? a : b; }

int month[13];

inline int rn(int x) {
    if (x % 400 == 0) return 1;
    if (x % 100 != 0 && x % 4 == 0) return 1;
    return 0;
}

int main() {
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    int n; read(n);
    int st = 4, ri = 1, yue = 1, year = 1970, ans = 0;
    month[1] = 31;
    month[2] = 28;
    month[3] = 31;
    month[4] = 30;
    month[5] = 31;
    month[6] = 30;
    month[7] = 31;
    month[8] = 31;
    month[9] = 30;
    month[10] = 31;
    month[11] = 30;
    month[12] = 31;
    while (year <= n) {
        if (rn(year)) month[2] = 29;
        else month[2] = 28;
        ++st; ++ri;
        if (ri > month[yue]) {
            ++yue;
            ri = 1;
            if (yue > 12) {
                ++year;
                yue = 1;
            }
            if (year == n) ++ans;
            if (st > 7) st = 1;
        }
        if (st > 7) {
            st = 1;
            if (year == n) ++ans;
        }
    }
    if (n == 1970) ++ans;
    writeln(ans);
    return 0;
}