// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
typedef long double ldbl;
ldbl F[1005][1005],G[1005][1005],X[1005],Y[1005];bol FromF[1005][1005],FromG[1005][1005];
ldbl dist(uint u,uint v){return sqrtl((X[u]-X[v])*(X[u]-X[v])+(Y[u]-Y[v])*(Y[u]-Y[v]));}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#else
#endif
    uint n,p=0;scanf("%u",&n);
    for(uint i=0;i<n;i++){scanf("%Lf%Lf",X+i,Y+i);if(Y[i]>Y[p]+5e-10)p=i;}
    for(uint len=1;len<n;len++)for(uint l=0;l<=len;l++)
    {
        F[l][len-l]=G[l][len-l]=1e18;
        if(l)
        {
            if(_min(F[l][len-l],F[l-1][len-l]+dist((p+n-l)%n,(p+n-l+1)%n)))
                FromF[l][len-l]=0;
            if(_min(F[l][len-l],G[l-1][len-l]+dist((p+n-l)%n,(p+len-l)%n)))
                FromF[l][len-l]=1;
        }
        if(len-l)
        {
            if(_min(G[l][len-l],F[l][len-l-1]+dist((p+n-l)%n,(p+len-l)%n)))
                FromG[l][len-l]=0;
            if(_min(G[l][len-l],G[l][len-l-1]+dist((p+len-l-1)%n,(p+len-l)%n)))
                FromG[l][len-l]=1;
        }
    }
    uint l=0,op=0;
    for(uint i=0;i<n;i++)if(F[i][n-i-1]<F[l][n-l-1])l=i;
    for(uint i=0;i<n;i++)if(G[i][n-i-1]<(op?G:F)[l][n-l-1])l=i,op=1;
    std::vector<uint>V;
    for(uint i=n-1;~i;i--)
        if(op)V.push_back((p+i-l)%n+1),op=FromG[l][i-l];
        else V.push_back((p+n-l)%n+1),op=FromF[l][i-l],l--;
    std::reverse(V.begin(),V.end());
    for(uint i=0;i<n;i++)printf("%u%c",V[i]," \n"[i==n-1]);
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。