#include <bits/stdc++.h>
using namespace std;
int gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
const int N = 1e5 + 5;
vector<int> adj[N];
bool visited[N];
int nodesNum;
void dfs(int node) {
  if (visited[node]) return;
  visited[node] = true;
  for (int child : adj[node]) dfs(child);
}
int main() {
  int n;
  cin >> n;
  if (n % 2 == 0)
    cout << n / 2;
  else
    cout << n / 2 + 1;
  return 0;
}
