#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
const long long MAXN = 2e5 + 10;
const int MAX = 1e2 + 10;
const long long mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
void solve() {
  int n;
  scanf("%d", &n);
  n /= 2;
  n++;
  printf("%d\n", n);
  return;
}
int main() {
  int casen = 1;
  while (casen--) {
    solve();
  }
  return 0;
}
