#include <bits/stdc++.h>
using namespace std;
deque<int> q;
vector<int> ans;
int n;
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    q.push_back(i);
  }
  while (!q.empty()) {
    ans.push_back(q.front());
    q.pop_front();
    if (!q.empty()) {
      ans.push_back(q.back());
      q.pop_back();
    }
  }
  for (int i = 0; i < n; i++) {
    if (i) {
      cout << " ";
    }
    cout << ans[i];
  }
  cout << endl;
  return 0;
}
