#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
//#include <utility>
#include <set>
#include <iostream>
//#include <memory>
#include <string>
#include <vector>
#include <algorithm>
//#include <functional>
#include <sstream>
//#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
//#include <cctype>
#include <cstring>
//#include <ctime>
#include <iterator>
#include <bitset>
//#include <numeric>
//#include <list>
//#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()

typedef pair<double,double> pdd;
typedef pair<double,pair<pii,int> > P;
#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;
#define prev S.F.F
#define next S.F.S
#define state S.S
#define time F
double vis[1<<16][20];
void mainmain(){
	int n;
	cin>>n;
	vint id(n);
	vector<pdd> v(n);
	rep(i,n){
		cin>>id[i]>>v[i].F>>v[i].S;
	}
	priority_queue<P> pq;
	rep(i,n) pq.push(mkp(0.0,mkp(mkp(19,i),0)));
	rep(i,1<<16){
		rep(j,16) vis[i][j]=-1;
	}
	vint ans;
	while(!pq.empty()){
		P top=pq.top();
		pq.pop();
		if(vis[top.state][top.next]!=-1) continue;
		vis[top.state][top.next]=top.prev;
		top.state|=1<<top.next;
		if(top.state==(1<<n)-1){
			ans.PB(top.next);
			break;
		}
		int w=0;
		rep(i,n){
			if(top.state&(1<<i)) w+=v[i].S;
		}
		w*=20;
		double fa=2000.0/(70.0+w);
		rep(i,n){
			if((1<<i)&top.state) continue;
			P tmp=top;
			tmp.time-=(double)abs(v[top.next].F-v[i].F)/fa;
			tmp.prev=top.next;
			tmp.next=i;
			pq.push(tmp);
		}
	}
	int aa=1<<n;
	aa--;
	while(ans.size()<n){
		aa-=1<<ans.back();
		ans.PB(vis[aa][ans.back()]);
	}
	reverse(ALL(ans));
	rep(i,n){
		if(i) cout<<" ";
		cout<<id[ans[i]];
	}
	cout<<endl;
}



}
main() try{
    mainmain();
}
catch(...){
}