import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) throw new EOFException; tokens = readln.split; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


// 0 : Monday
int dayCount(int y, int m, int d) {
  if (m <= 2) { --y; m += 12; }
  return y * 365 + y / 4 - y / 100 + y / 400 + (m * 153 + 3) / 5 + d;
}

immutable L = 400;
immutable Y0 = 2015, M0 = 7, D0 = 23;

long N;

void main() {
  assert(dayCount(Y0, M0, D0) % 7 == dayCount(Y0 + L, M0, D0) % 7);
  stderr.writeln(dayCount(Y0 - 1, M0, D0), " ", dayCount(Y0 - 1, M0, D0) % 7);
  
  auto as = new int[L];
  foreach (i; 0 .. L) {
    as[i] = (dayCount(Y0 + i, M0, D0) % 7 == 2) ? 1 : 0;
  }
  debug {
    writeln(as[0 .. 30]);
  }
  
  try {
    for (; ; ) {
      N = readLong();
      long ans;
      ans += as.sum * ((N + 1 - Y0) / L);
      ans += as[0 .. cast(size_t)((N + 1 - Y0) % L)].sum;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}