/**
 *     author: qodjf
 *     created: 01.28.2021 22:35:02
 */
#include <bits/stdc++.h>
using namespace std;

string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) res += ", ";
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifndef ONLINE_JUDGE
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

template <class T>
inline bool chmax(T &a, T b) {
  return a < b && (a = b, true);
}
template <class T>
inline bool chmin(T &a, T b) {
  return a > b && (a = b, true);
}

#define mst(x, a) memset(x, a, sizeof(x))
#define all(a) begin(a), end(a)
#define rep(i, begin, end)                            \
  for (__typeof(end) i = (begin) - ((begin) > (end)); \
       i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))

using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr ll LLINF = 0x3f3f3f3f3f3f3f3f;
constexpr ll MOD = 1e9 + 7;

int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};

inline ll square(ll a) { return a * a; }
inline ll dis(P &a, P &b) {
  return square(a.first - b.first) + square(a.second - b.second);
}
int n;
vector<P> points;
vector<bool> used;
void solve() {
  cin >> n;
  points.resize(n);
  used = vector<bool>(n, false);
  rep(i, 0, n) { cin >> points[i].first >> points[i].second; }

  vector<int> ans;
  int choosed = 0;
  rep(i, 0, n) {
    used[choosed] = true;
    ans.push_back(choosed + 1);

    ll maxDis = 0, next = -1;
    rep(j, 0, n) {
      if (!used[j]) {
        if (chmax(maxDis, dis(points[choosed], points[j]))) {
          next = j;
        }
      }
    }
    choosed = next;
  }

  rep(i, 0, n) {
    cout << ans[i] << ' ';
  }
  cout << '\n';
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  int T = 1;
  while (T--) {
    solve();
  }
}
