#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
struct mint {
  ll x;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod - a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res *= a;
  }
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1) a *= *this;
    return a;
  }
  mint inv() const { return pow(mod - 2); }
  mint& operator/=(const mint a) { return (*this) *= a.inv(); }
  mint operator/(const mint a) const {
    mint res(*this);
    return res /= a;
  }
};
struct combination {
  vector<mint> fact, ifact;
  combination(int n) : fact(n + 1), ifact(n + 1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n] * ifact[k] * ifact[n - k];
  }
};
ll mod_pow(ll x, ll n, ll mod) {
  if (n == 0) return 1;
  ll res = mod_pow(x * x % mod, n / 2, mod);
  if (n & 1) res = res * x % mod;
  return res;
}
int main1() {
  int n, a, b;
  cin >> n >> a >> b;
  ll temp = mod_pow(2, n, mod);
  mint ans = temp;
  ans -= 1;
  a = min(n - a, a);
  b = min(n - b, b);
  mint bfact = 1;
  for (int(i) = 0; (i) < (b); (i)++) {
    bfact *= (i + 1);
  }
  mint afact = 1;
  for (int(i) = 0; (i) < (a); (i)++) {
    afact *= (i + 1);
  }
  mint am = 1;
  for (int(i) = 0; (i) < (a); (i)++) {
    am *= (n - i);
  }
  mint bm = 1;
  for (int(i) = 0; (i) < (b); (i)++) {
    bm *= (n - i);
  }
  ans -= bm / bfact;
  ans -= am / afact;
  cout << ans.x;
  return 1;
}
int table[200000 + 1];
int countWays(int n) {
  memset(table, 0, sizeof(table));
  table[0] = 1;
  for (int i = 1; i < n; i++)
    for (int j = i; j <= n; j++) table[j] += table[j - i];
  return table[n];
}
int main() {
  int n;
  cin >> n;
  cout << (n + 1) / 2;
}
