#include <bits/stdc++.h>
using namespace std;
const int INF = (int)2e9;
int main() {
  int N;
  cin >> N;
  cout << 1 << " ";
  int last = 1;
  set<int> saw;
  saw.insert(1);
  for (int i = N - 1; i > 0; --i) {
    int x1 = last - i;
    int x2 = last + i;
    if (x1 <= 0 || x1 > N || saw.count(x1)) {
      cout << x2 << " ";
      last = x2;
    } else {
      cout << x1 << " ";
      last = x1;
    }
    saw.insert(last);
  }
  return 0;
}
