#include <bits/stdc++.h>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_ON(bit, i) (bit & (1LL << i))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template<typename T> using V = std::vector<T>;
template<typename T> using VV = std::vector<std::vector<T>>;
template<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;
template<typename T> using VVVV = std::vector<std::vector<std::vector<std::vector<T>>>>;

template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template<class T> inline void print(T x) { std::cout << x << std::endl; }
template<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) {  if (i != 0) {std::cout << " ";} std::cout << v[i];} std::cout << "\n"; }
template<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }

const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 };    // 4近傍（右, 下, 左, 上）
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

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


    int N;
    cin >> N;

    V<tuple<int, int, int>> v(N);
    FOR(i, 0, N) {
        int S, D, V;
        cin >> S >> D >> V;
        v[i] = make_tuple(S, D, V);
    }

    VV<int> dist(101, V<int>(101, 0));
    FOR(i, 0, N) {
        FOR(j, 0, N) {
            int a, b, c, d, e, f;
            tie(a, b, c) = v[i];
            tie(d, e, f) = v[j];

            dist[i][j] = dist[j][i] = abs(b - e);
        }
    }

    vector<int> weight(1LL << N);
    FOR(b, 0, 1LL << N) {
        int w = 0;
        FOR(i, 0, N) {
            if (BIT_ON(b, i)) {
                w += get<2>(v[i]);
            }
        }
        weight[b] = w;
    }

    VV<int> pre(1LL << N, V<int>(N, -1));
    VV<double> dp(1LL << N, V<double>(N, INF));
    FOR(i, 0, N) {
        dp[1LL << i][i] = 0;
    }

    FOR(b, 0, 1LL << N) {
        FOR(i, 0, N) {
            FOR(j, 0, N) {
                if (BIT_ON(b, i) and not BIT_ON(b, j)) {
                    int d = dist[i][j];
                    int w = weight[b] * 20;
                    double cost = d / (2000.0 / (70.0 + w));
                    if (dp[b][i] + cost < dp[b | (1LL << j)][j]) {
                        dp[b | (1LL << j)][j] = dp[b][i] + cost;
                        pre[b | (1LL << j)][j] = i;
                    }
                }
            }
        }
    }

    int now = -1;
    double mini_cost = INF;
    FOR(i, 0, N) {
        if (dp[(1LL << N) - 1][i] < mini_cost) {
            mini_cost = dp[(1LL << N) - 1][i];
            now = i;
        }
    }

    vector<int> ans;
    auto b = (1LL << N) - 1;
    while (now != -1) {
        ans.emplace_back(get<0>(v[now]));
        int p = now;
        now = pre[b][now];
        b &= ~(1LL << p);
    }

    reverse(ALL(ans));
    print_vec(ans);

    return 0;
}


Measured memory_bytes: 11248