#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
const int V = 4e6;
int spf1[V];
void solve() {
  int n;
  cin >> n;
  int left = 1;
  int right = n;
  for (int i = 0; i < n; i++) {
    if (i % 2 == 0) {
      cout << left << " ";
      left++;
    } else {
      cout << right << " ";
      right--;
    }
  }
  cout << "\n";
}
int main() {
  {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
  }
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
