#include <bits/stdc++.h>
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n; cin >> n;
    vector<ar<int, 3>> v(n);
    F0R(i, n){
        cin >> v[i][0] >> v[i][1]; v[i][2] = i;
    }
    vector<bool> used(n);
    used[0] = 1;
    vi ans{0};
    int cur = 0;
    while(1){
        int u = -1;
        ll mindist = 0;
        F0R(i, n){
            if(!used[i]){
                if(ckmax(mindist, 1LL*(v[i][0]-v[cur][0])*(v[i][0]-v[cur][0])+1LL*(v[i][1]-v[cur][1])*(v[i][1]-v[cur][1]))){
                    u = i;
                }
            }
        }
        if(u==-1) break;
        ans.pb(u);
        cur = u;
        used[cur] = 1;
    }
    trav(v, ans) cout << v+1 << ' ';
    cout << nl;
    return 0;
}