#include <bits/stdc++.h>
using namespace std;
const int TAM = 10000 + 15;
const long long MOD = 1000000009LL;
const double PI = 3.14159265359;
long long add(long long x, long long y) { return (x + y + 2 * MOD) % MOD; }
long long mult(long long x, long long y) {
  return (add(x, 0) * add(y, 0)) % MOD;
}
long long fast_expo(long long x, long long y) {
  if (x == 0) return 0;
  if (y == 0) return 1;
  long long res = 1;
  long long mid = fast_expo(x, y / 2);
  if (y % 2 != 0) res = x;
  return mult(mult(mid, mid), res);
}
long long inver(long long x) { return fast_expo(x, MOD - 2); }
int main() {
  int n;
  scanf("%d", &n);
  int i = 1, j = n;
  bool f = true;
  while (i <= j) {
    if (f) {
      cout << i << " ";
      i++;
      f = false;
    } else {
      cout << j << " ";
      j--;
      f = true;
    }
  }
  cout << endl;
  return 0;
}
