#include <iostream>
#include <algorithm>
using namespace std;

int md[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
bool isLeap(int y) { return y%400==0?true:y%100==0?false:y%4==0; }
void next(int& y, int& m, int& d, int& w)
{
    if (++d>md[m]+(m==2&&isLeap(y))) { d=1; ++m; }
    if (m>12) { ++y; m=1; }
    if (++w==7) w=0;
}
int main()
{
    long long n;
    while (cin>>n) {
        int y=2014, m=7, d=23, w=0;
        int a[401]={};
        while (y<=min(2414LL, n)) {
            next(y, m, d, w);
            if (m==7 and d==23 and w==0) a[y-2014]=1;
        }
        for(int i=1;i<=400;++i) a[i]+=a[i-1];
        if (y>n) 
            cout<<a[n-2014]<<endl;
        else
            cout<<(n-2014)/400*a[400]+a[(n-2014)%400]<<endl;
    }
}