Problem: Matryoshka

Matryoshka is a famous Russian folk craft doll. Matryoshka can be divided into upper and lower parts, and when opened, there is another smaller doll inside. The nesting structure is such that when the small doll that appears is opened, a smaller doll is contained.

<image>


You found an unusually shaped matryoshka doll on your trip and bought N dolls. The shape of the i-th doll is a rectangular parallelepiped of xi × yi × zi.

After watching Matryoshka for a while, you are about to put away Matryoshka. Before that, I want to reduce the space required by storing some dolls in another. When storing a doll, one other doll can be stored only in the doll that has not yet stored any doll. However, only the dolls that are stored directly are counted, and the doll that contains the doll can be stored in another doll.

The stored doll becomes invisible from the outside. However, the following conditions must be met.

* The doll may rotate, but each side of the rectangular parallelepiped is parallel to any side of the other rectangular parallelepiped.
* After rotation, the length of the doll on the side to be stored is shorter for each of the lengths of the corresponding sides.
* At most one doll can be stored directly in one doll



Since the volume of the closet is limited, we want to minimize the sum of the volumes of the dolls that can be seen from the outside. Your job is to create a program that finds the minimum sum of the volumes of the dolls that are visible from the outside, which can be achieved by repeating the operation of storing the dolls any number of times.

Input

The input consists of multiple datasets. The maximum number of data sets does not exceed 50. Each dataset is represented in the following format.

> N
> x1 y1 z1
>::
>::
> xN yN zN
>

Each dataset consists of N + 1 rows, and the first row of the dataset is given the integer N, which represents the number of dolls. In the i-th line of the following N lines, three integers xi, yi, and zi representing the size of the i-th doll are given, separated by a half-width space. These integers satisfy 1 ≤ N, xi, yi, zi ≤ 100.

> The end of the input is represented by a single zero line.

> ### Output

For each data set, output the minimum value of the sum of the volumes of the dolls that can be seen from the outside in one line.

> ### Sample Input


2
one two Three
4 2 3
3
2 5 2
3 3 4
5 5 5
Five
1 1 1
2 2 2
3 3 3
4 4 4
5 5 5
Five
1 1 1
2 1 1
3 1 1
4 1 1
5 1 1
Ten
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
3 2 3
8 4 6
2 6 4
3 3 8
3 2 7
0


Output for Sample Input


twenty four
145
125
15
864





Example

Input

2
1 2 3
4 2 3
3
2 5 2
3 3 4
5 5 5
5
1 1 1
2 2 2
3 3 3
4 4 4
5 5 5
5
1 1 1
2 1 1
3 1 1
4 1 1
5 1 1
10
3 1 4
1 5 9
2 6 5
3 5 8
9 7 9
3 2 3
8 4 6
2 6 4
3 3 8
3 2 7
0


Output

24
145
125
15
864

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
static const ll INF = 1e18;

struct edge {
  int to;
  ll cap, cost;
  int rev;
};

vector<ll> h, d; // ポテンシャル, 最短距離
vector<int> prevv, preve; // 直前の頂点と辺

void add_edge(vector<vector<edge>> &G, int from, int to, ll cap, ll cost) {
  G[from].emplace_back((edge) {to, cap, cost, (int) G[to].size()});
  G[to].emplace_back((edge) {from, 0, -cost, (int) G[from].size() - 1});
}

// sからtへの流量fの最小費用流(流せない場合は-1)
ll min_cost_flow(vector<vector<edge>> &G, int s, int t, ll f) {
  ll res = 0;
  h.assign(G.size(), 0);
  prevv.assign(G.size(), 0);
  preve.assign(G.size(), 0);
  while (f > 0) {
    priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
    d.assign(G.size(), INF);
    d[s] = 0;
    pq.push(make_pair(0, s));
    while (!pq.empty()) {
      pair<ll, int> p = pq.top();
      pq.pop();
      int v = p.second;
      if (d[v] < p.first) continue;
      for (int i = 0; i < G[v].size(); i++) {
        edge &e = G[v][i];
        if (e.cap > 0 && d[e.to] > d[v] + e.cost + h[v] - h[e.to]) {
          d[e.to] = d[v] + e.cost + h[v] - h[e.to];
          prevv[e.to] = v;
          preve[e.to] = i;
          pq.push(make_pair(d[e.to], e.to));
        }
      }
    }
    if (d[t] == INF) return -1;
    for (int i = 0; i < G.size(); i++) h[i] += d[i];
    
    // s-t間最短路に流す
    int nowf = f;
    for (int i = t; i != s; i = prevv[i]) {
      nowf = min<ll>(nowf, G[prevv[i]][preve[i]].cap);
    }
    f -= nowf;
    res += nowf * h[t];
    for (int i = t; i != s; i = prevv[i]) {
      edge &e = G[prevv[i]][preve[i]];
      e.cap -= nowf;
      G[i][e.rev].cap += nowf;
    }
  }
  return res;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  
  while (true) {
    int n;
    cin >> n;
    if (n == 0) return 0;
    
    ll sum = 0;
    vector<vector<ll>> v(n, vector<ll>(3));
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < 3; j++) {
        cin >> v[i][j];
      }
      sort(v[i].begin(), v[i].end());
      sum += v[i][0] * v[i][1] * v[i][2];
    }
    
    int vs = 2 * n, vt = 2 * n + 1; // フローの始点と終点
    vector<vector<edge>> G(2 * n + 2);
    for (int i = 0; i < n; i++) {
      add_edge(G, vs, i, 1, 0);
      add_edge(G, i + n, vt, 1, 0);
      for (int j = 0; j < n; j++) {
        if (v[i][0] > v[j][0] && v[i][1] > v[j][1] && v[i][2] > v[j][2]) {
          add_edge(G, i, j + n, 1, -v[j][0] * v[j][1] * v[j][2]);
        }
      }
    }
    add_edge(G, vs, vt, n, 0);
    ll fl = min_cost_flow(G, vs, vt, n);
    cout << sum + fl << '\n';
  }
}