/* -*- coding: utf-8 -*-
 *
 * 87.cc: No.87 Advent Calendar Problem - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

typedef long long ll;
const ll MAX_N = 10000000000LL;

// yukicoder no.1  2014/07/23(Wed)
const int jul23 = (31 + 28 + 31 + 30 + 31 + 30) + 22;

const int YC = 400;

/* typedef */

/* global variables */

int yds[YC + 1], wds[YC + 1];

/* subroutines */

inline bool is_leap(ll n) {
  return (n % 4 == 0 && (n % 100 != 0 || n % 400 == 0));
}

/* main */

int main() {
  ll n;
  cin >> n;

  yds[0] = wds[0] = 0;
  for (int y = 0; y < YC; y++) {
    int lp = is_leap(y) ? 1 : 0;
    yds[y + 1] = yds[y] + 365 + lp;
    wds[y + 1] = wds[y] + ((yds[y] + jul23 + lp) % 7 == 4 ? 1 : 0);
  }
  //printf("yds[%d]=%d, wds[%d]=%d\n", YC, yds[YC], YC, wds[YC]);
  //printf("2014/07/23=%d\n", wds[14]);

  ll ans2014 = (2014 / YC) * wds[YC] + wds[2014 % YC + 1];
  ll ansn = (n / YC) * wds[YC] + wds[n % YC + 1];
  printf("%lld\n", ansn - ans2014);
  return 0;
}