#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <bitset>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#define strtok_r strtok_s
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n)
#define REPEAT(i, k, n)     for(int i = (k); i < ((k)+(n)); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); --i)
#define FROMTO(i,f,t)       for(int i = f; i < t; i++)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define FILL(m,v)           memset(m, v, sizeof(m))
#define mp                  make_pair
#define pb                  push_back
template<class _T> _T MAX(_T p1,_T p2){return (p1>p2)?p1:p2;} 
template<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} 
template <class _Tv> inline string join(const _Tv &v,string sep=" "){
    ostringstream s;FOREACH(it,v){if(it!=v.begin())s<<sep;s<<*it;};return s.str();
}

typedef long long ll;
typedef unsigned long long ull;
typedef double D;
typedef complex<D> P;
#define X real()
#define Y imag()
#define EPS (1e-9)
#define DEQ(p1,p2) (abs((p1)-(p2)) < EPS)

#ifdef _DEBUG
template<class _Tv> inline void _prfe(const char *_n,const _Tv _c,bool _p=false){
    ITER(_c) _it=_c.begin();
    if(_p){cout<<_n<<" = ["<<endl;for(;_it!=_c.end();++_it)cout<<"    "<<*_it<<endl;cout<<"]"<<endl; }
    else{cout<<_n<<" = [ "<<*_it++;for(;_it!=_c.end();++_it)cout<<", "<<*_it;cout<<" ]"<<endl; }
}
#define pf printf
#define pr(n) do{cout<<#n" = "<<(n)<<endl;}while(0)
#define prfe(n) _prfe(#n, n)
#define prfep(n) _prfe(#n, n, true)
#define dbgchk(n) do{if(n)throw;}while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#define prfe(...) /* */
#define prfep(...) /* */
#define dbgchk(...) /* */
#endif

int n;
int idl[15], di[15], nu[15];
int dist[15][15];

struct DATA {
    double tm;
    int i;
    int ord[15];
} dp[15][1<<15];

inline void bits(unsigned int &p, int n){ p |= (1<<n); }
inline void bitu(unsigned int &p, int n){ p &= ~(1<<n); }
inline bool biti(unsigned int p, int n){ return !!(p & (1<<n)); };
inline int  bitc(unsigned int p){int c=0;for(;p;p&=p-1) c++; return c; }

const double inf = 1e30;

DATA rec(int index, unsigned int usebit, unsigned int weight){
    DATA ret = {0};
    if(index >= 0 && dp[index][usebit].tm != inf) return dp[index][usebit];

    if(bitc(usebit) != n){
        double tm = inf;
        REP(i,n){
            if(biti(usebit, i)) continue;
            bits(usebit, i);
            double tp = 0;
            if(index >= 0){
                tp = dist[index][i] / 2000.0 * (70+weight);
                pf("weight = %d, dist[%d][%d] = %d, tp = %f\n", weight, index, i, dist[index][i], tp);
            }
            DATA r = rec(i, usebit, weight + nu[i]);
            r.tm += tp;
            if(tm > r.tm){
                tm = r.tm;
                ret = r;
            }
            bitu(usebit, i);
        }
    }
    if(index >= 0){
        ret.ord[ret.i++] = idl[index];
        pf("dp[%d][%d] = %f\n", index, usebit, ret.tm);
        dp[index][usebit] = ret;
    }
    return ret;
}

vector<int> solve(){
    vector<int> ret;
    FILL(dp,0);
    REP(i,n) REP(j,1<<n)
        dp[i][j].tm = inf;

    DATA d = rec(-1,0,0);
    RREP(j,n){
        ret.pb(d.ord[j]);
        pf("%d ", d.ord[j]);
    }
    pf(" : %f\n", d.tm);

    return ret;
}


int main(){
    cin >> n;
    REP(i,n){
        cin >> idl[i] >> di[i] >> nu[i]; nu[i] *= 20;
    }
    REP(i,n) REP(j,n) dist[i][j] = abs(di[i]-di[j]);
    cout << join(solve()) << endl;
    return 0;
}

Measured memory_bytes: 35808