#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll r[2810];
ll cnt[2800];
void init(){
    r[0]=0;
    for(int i=1; i<2800; i++){
        if(i%400==0) r[i]=(r[i-1]+2)%7;
        else if(i%100==0) r[i]=(r[i-1]+1)%7;
        else if(i%4==0) r[i]=(r[i-1]+2)%7;
        else r[i]=(r[i-1]+1)%7;
    }
    if(r[0]==r[2014]) cnt[0]=1;
    for(int i=1; i<2800; i++){
        if(r[i]==r[2014]) cnt[i]=cnt[i-1]+1;
        else cnt[i]=cnt[i-1];
    }
}
ll count(ll n){
    return n/2800*cnt[2799]+cnt[n%2800];
}
int main()
{
    ll n; cin>>n;
    init();
    cout<<count(n)-count(2014)<<endl;
    return 0;
}