#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long exponentiation(long long base, long long power) {
  long long ans = 1;
  while (power > 0) {
    if (power % 2 == 1) ans = (ans * base) % mod;
    base = (base * base) % mod;
    power /= 2;
  }
  return ans % mod;
}
inline int read_int() {
  bool minus = false;
  int result = 0;
  char ch;
  ch = getchar();
  while (true) {
    if (ch == '-') break;
    if (ch >= '0' && ch <= '9') break;
    ch = getchar();
  }
  if (ch == '-')
    minus = true;
  else
    result = ch - '0';
  while (true) {
    ch = getchar();
    if (ch < '0' || ch > '9') break;
    result = result * 10 + (ch - '0');
  }
  if (minus)
    return (-result);
  else
    return result;
}
int main() {
  int n;
  n = read_int();
  double per = (double)n / 2.0;
  long long ans = ceil(per);
  cout << ans << endl;
  return 0;
}
