#include <bits/stdc++.h>
using namespace std;
long long upper_boundd(long long sum[], long long s, long long e,
                       long long key) {
  long long l, r, mid, k, ans;
  l = s;
  r = e;
  k = key;
  while (l < r) {
    mid = l + (r - l) / 2;
    if (k <= sum[mid]) {
      r = mid;
    }
    if (sum[mid] > k) l = mid + 1;
  }
  return l;
}
int main() {
  long long t, n, i, j, k, l, a[100006], x, y, z, sum2 = 0, sum = 0, b[1900], u,
                                                  v, p;
  cin >> n;
  long long vis[n + 1];
  memset(vis, 0, sizeof(vis));
  vector<long long> vp;
  p = n - 1;
  a[1] = 1;
  vis[1] = 1;
  cout << 1 << " ";
  for (i = 2; i <= n; i++) {
    x = p + a[i - 1];
    y = -p + a[i - 1];
    if (x > 0 && x <= n && vis[x] == 0) {
      cout << x << " ";
      a[i] = x;
      vis[x] = 1;
    } else {
      cout << y << " ";
      a[i] = y;
      vis[y] = 1;
    }
    p--;
  }
}
