#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<int, int>;
 
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
 
template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
 
template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) { 
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }
 
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
  out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
  for(T& x: vec) {is >> x;} return is;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
  out<<'['; for(T i: a) {out<<i<<',';} out<<']'; return out;
}
 
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
ll MOD = 1000000007;

signed main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  ll n;
  cin >> n;
  vector<ll> s(n), d(n), v(n);
  REP(i, n) cin >> s[i] >> d[i] >> v[i];

  vector<ll> weight(1<<n);
  REP(i, 1<<n) {
    REP(j, n) {
      if(i&1<<j) weight[i] += v[j] * 20;
    }
  }

  auto dp = make_v<double>(1<<n, n);
  fill_v(dp, LLINF);
  auto prev = make_v<ll>(1<<n, n);
  REP(i, n) {
    dp[1<<i][i] = 0;
    prev[1<<i][i] = -1;
  }
  REP(i, 1<<n) REP(j, n) {
    REP(k, n) {
      if(!(i&1<<k)) {
        double ndist = dp[i][j] + (70+weight[i]) / 2000.0 * abs(d[j]-d[k]);
        if(dp[i|1<<k][k] > ndist) {
          dp[i|1<<k][k] = ndist;
          prev[i|1<<k][k] = j;
        }
      }
    }
  }

  ll idx = -1;
  double mi = LLINF;
  REP(i, n) {
    if(mi > dp[(1<<n)-1][i]) {
      mi = dp[(1<<n)-1][i];
      idx = i;
    }
  }

  vector<ll> path;
  ll mask = (1<<n)-1, now = idx;
  while(now != -1) {
    path.push_back(now);
    ll tmp = now;
    now = prev[mask][now];
    mask ^= 1<<tmp;
  }
  reverse(ALL(path));

  REP(i, path.size()) {
    cout << s[path[i]];
    if(i != path.size()-1) cout << " ";
  }
  cout << endl;

  return 0;
}

