#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef array<int, 3> ai3;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int Mod = 1e9 + 7;
inline int sign(int a){ return (a&1) ? (Mod-1) : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b, a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll * a * b % Mod); }
inline int add(int a, int b){ a += b-Mod; a += (a>>31) & Mod; return a; }
inline int sub(int a, int b){ a -= b, a += (a>>31) & Mod; return a; }
inline int mul(int a, int b){ a = (int)(1ll * a * b % Mod); return a; }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }
const int fN = 66666;
int fact[fN], invfact[fN], inv[fN];
void initfact(int n){
	fact[0] = 1; for(int i = 1; i <= n; ++i) fact[i] = mul(fact[i-1], i);
	invfact[n] = qpow(fact[n], Mod-2); for(int i = n; i > 0; --i) invfact[i-1] = mul(invfact[i], i);
	for(int i = 1; i <= n; ++i) inv[i] = mul(invfact[i], fact[i-1]);
}
int binom(int n, int m){ return (m < 0 || m > n) ? 0 : mul(fact[n], mul(invfact[m], invfact[n-m])); }
const double pi = acos(-1);
inline void chmax(int &a, int b){ (b>a) ? (a=b) : 0; }
inline void chmin(int &a, int b){ (b<a) ? (a=b) : 0; }
inline void chmax(ll &a, ll b){ (b>a) ? (a=b) : 0; }
inline void chmin(ll &a, ll b){ (b<a) ? (a=b) : 0; }

int n, w[255][255], cid[255][255][255], cc = 0;
array<int, 3> cs[1010];
vi to[1010];
int rt, fa[1010];
int dp[1010][2][2][2][111];

int outmp[66666];

void dfs0(int id){
	//cout << "dfs0 " << id << " " << fa[id] << "\n";
	array<int, 3> c = cs[id];
	for(auto u : to[id]){
		if(u == fa[id]) continue;
		int t;
		t = cid[c[0]][c[1]][u], fa[t] = c[2], dfs0(t);
		t = cid[c[1]][c[2]][u], fa[t] = c[0], dfs0(t);
		t = cid[c[2]][c[0]][u], fa[t] = c[1], dfs0(t);
	}
}

const int outp[4] = {0, 1, 2, 7}, outq[8] = {0, 1, 2, -1, -1, -1, -1, 3};

int getdp(int id, array<int, 3> tp, int outs){
	int DEBUG = 0;//(id == 12 && outs == 0);//(id == 12 && outs == 16384);
	if(DEBUG){
		cout << "------------------getdp " << id << " {" << tp[0] << " " << tp[1] << " " << tp[2] << "} " << outs << "-------------------------" << "\n";
		cout << cs[id][0] << " " << cs[id][1] << " " << cs[id][2] << "\n";
		rep(i, 4) rep(j, 4) if((outs>>(i*4+j)) & 1){ cout << i << " " << j << "\n"; }
	}
	int outid = outmp[outs];
	int &ans = dp[id][tp[0]][tp[1]][tp[2]][outid];
	if(ans != -1) return ans;
	ans = -inf;

	vi ps(3);
	rep(i, 3) ps[i] = cs[id][i];
	int m = -1;
	for(auto v : to[id]){
		if(v == fa[id]) continue;
		m = v;
		ps.push_back(m);
	}

	if(m < 0) return ans = -inf;

	int cn = 8;
	array< array<int, 8>, 8 > has, done, ew;
	rep(i, cn) rep(j, cn) has[i][j] = done[i][j] = ew[i][j] = 0;
	auto ae = [&](int u, int v, bool hasw = 0){
		if(DEBUG) cout << "ae " << u << " " << v << "\n";
		has[u][v] = has[v][u] = 1;
		if(hasw) ew[u][v] = ew[v][u] = w[ps[u]][ps[v]];
	};
	if(id == rt){
		ae(0, 1, 1), ae(1, 2, 1), ae(2, 0, 1);
	}
	if(m >= 0){
		ae(0, 3, 1), ae(1, 3, 1), ae(2, 3, 1), ae(7, 3);
		ae(0, 4), ae(1, 4), ae(3, 4), ae(7, 4);
		ae(1, 5), ae(2, 5), ae(3, 5), ae(7, 5);
		ae(2, 6), ae(0, 6), ae(3, 6), ae(7, 6);
	}

	rep(i, 4) rep(j, 4){
		if((outs>>(i*4+j)) & 1){
			has[outp[i]][outp[j]] = 1;
			if(i == 3) rep(k, 7) if(k != j) has[7][k] = 0;
			if(j == 3) rep(k, 7) if(k != i) has[k][7] = 0;
		}
	}

	if(DEBUG){
		rep(i, 8){
			rep(j, 8) cout << has[i][j] << " ";
			cout << "\n";
		}
	}

	vi pth;
	auto check = [&](){
		int ok = 1;
		rep(i, 4){
			rep(j, 4){
				if((outs>>(i*4+j)) & 1){
					if(!done[outp[i]][outp[j]]){
						ok = 0;
						break;
					}
				}
			}
			if(!ok) break;
		}
		if(!ok) return ;
		int val = 0;
		array<int, 8> lstout;
		rep(i, 8) lstout[i] = -1;
		array< vector<pii>, 8 > es;
		rep(i, 8) es[i].clear();
		rep(i, (int)pth.size() - 1){
			int u = pth[i], v = pth[i+1];
			if(u <= 3 && v <= 3){
				val += ew[u][v];
			}
			if(v >= 4 && v <= 6){
				if(lstout[v] < 0)
					es[v].push_back(make_pair(7, u));
				else 
					es[v].push_back(make_pair(lstout[v], u));
			}
			lstout[u] = v;
		}
		//DEBUG = 0;//((id == 12 && outs == 16384) && pth == (vi){7, 2, 3, 4, 0, 1, 4, 7});
		if(DEBUG){
			for(auto u : pth) cout << u << ", ";
			cout << "\n";
		}
		for(int i = 4; i <= 6; ++i){
			if(es[i].empty()) continue;
			es[i].push_back(make_pair(lstout[i], 7));

			int nid = cid[ps[i-4]][ps[(i-4+1)%3]][ps[3]];

			static int can[255], mp[255];
			rep(j, 3) mp[cs[nid][j]] = j;
			rep(j, 4) can[ps[j]] = (done[i][j] || done[j][i]);
			array<int, 3> ntp;
			rep(j, 3) ntp[j] = can[cs[nid][j]];
			
			int nmask = 0;
			for(auto p : es[i]){
				if(p.first == p.second) continue;
				//cout << p.first << " to " << p.second << "\n";
				nmask |= 1 << (outq[p.first == 7 ? 7 : mp[ps[p.first]]] * 4 + outq[p.second == 7 ? 7 : mp[ps[p.second]]]);
			}
			val += getdp(nid, ntp, nmask);
			//if(val == 5570866) cout << "from " << i << " " << tmptmp << endl;
			if(val < 0){ val = -inf; break; }
		}
		//if(val == 5570866 || val == 5570866 - 1652412){
		//	cout << "------------------getdp " << id << " {" << tp[0] << " " << tp[1] << " " << tp[2] << "} " << outs << "-------------------------" << "\n";
		//	cout << cs[id][0] << " " << cs[id][1] << " " << cs[id][2] << "\n";
		//	rep(i, 4) rep(j, 4) if((outs>>(i*4+j)) & 1){ cout << i << " " << j << "\n"; }
		//	for(auto u : pth) cout << u << ", ";
		//	cout << "\n";
		//}
		chmax(ans, val);
	};

	array<int, 8> vis;
	rep(i, 8) vis[i] = 0;
	function<void(int)> dfs = [&](int u){
		++vis[u], pth.push_back(u);
		if((int)pth.size() > 1 && u == 7){
			check();
			--vis[u], pth.pop_back();
			return ;
		}
		rep(t, cn) if(has[u][t]){
			//if(DEBUG) cout << " dfs " << u << " to " << t << "\n";
			if(done[u][t] || (t < 3 && tp[t] == 0) || (t <= 3 && vis[t])) continue;
			done[u][t] = 1;
			dfs(t);
			done[u][t] = 0;
		}
		--vis[u], pth.pop_back();
	};

	dfs(7);

	return ans;
}

int main(){
	//freopen("d.in", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	cin >> n;
	memset(w, 0x3f, sizeof(w));
	rep(i, 3*(n-2)){
		int u, v, c;
		cin >> u >> v >> c;
		--u, --v;
		w[u][v] = w[v][u] = c;
	}

	if(n == 3){
		cout << w[0][1] + w[1][2] + w[2][0] - min({w[0][1], w[1][2], w[2][0]}) << "\n";
		return 0;
	}

	memset(cid, -1, sizeof(cid));
	rep(i, n) rep(j, i) if(w[i][j] < inf) rep(k, j) if(w[j][k] < inf && w[k][i] < inf){
		cs[cc] = {k, j, i};
		cid[i][j][k] = cid[i][k][j] = cid[j][i][k] = cid[j][k][i] = cid[k][i][j] = cid[k][j][i] = cc++;
	}

	rt = 0;
	rep(i, cc){
		array<int, 3> c = cs[i];
		rep(u, n) if(cid[c[0]][c[1]][u] >= 0 && cid[c[1]][c[2]][u] >= 0 && cid[c[2]][c[0]][u] >= 0) to[i].push_back(u);
		if((int)to[i].size() == 1) rt = i;
	}

	//rep(i, n) rep(j, n) rep(k, n) cout << i << " " << j << " " << k << ": " << cid[i][j][k] << "\n";

	//rep(i, cc) cout << i << ": " << cs[i][0] << " " << cs[i][1] << " " << cs[i][2] << "\n";
	//rep(i, cc){
	//	cout << cs[i][0] << cs[i][1] << cs[i][2] << " " << i << " to ";
	//	for(auto u : to[i]) cout << u << " ";
	//	cout << "\n";
	//}
	//cout << rt << "\n";

	fa[rt] = -1, dfs0(rt);

	memset(dp, -1, sizeof(dp));

	int co = 0;
	rep(mask, 1<<16){
		array< array<int, 4>, 4 > has;
		rep(i, 4) rep(j, 4) has[i][j] = (mask>>(i*4+j)) & 1;
		bool ok = 1;
		rep(i, 4) if(has[i][i]) ok = 0;
		rep(i, 4){
			int cnt = 0;
			rep(j, 4) cnt += has[i][j];
			if(cnt > 1) ok = 0;
		}
		rep(i, 4){
			int cnt = 0;
			rep(j, 4) cnt += has[j][i];
			if(cnt > 1) ok = 0;
		}
		if(ok) outmp[mask] = co++;
	}

	//cout << co << "\n";
	
	int ans = getdp(rt, {1, 1, 1}, 0);
	rep(i, 3) chmax(ans, getdp(rt, {1, 1, 1}, 1 << (i*4 + 3)));
	rep(j, 3) chmax(ans, getdp(rt, {1, 1, 1}, 1 << (3*4 + j)));
	rep(i, 3) rep(j, 3)
		chmax(ans, getdp(rt, {1, 1, 1}, (1 << (i*4 + 3)) + (1 << (3*4 + j))));
	cout << ans << "\n";

	cerr << 1. * clock() / CLOCKS_PER_SEC << endl;

	return 0;
}