#include "bits/stdc++.h"
using namespace std;
//#include "atcoder/all"
//using namespace atcoder;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;}
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;

int N;
int c[9][9];

map<pair<vector<int>, int>, int> mp;

int dfs(vector<int>&v, int prv) {
	if(mp.count({v, prv})) return mp[{v, prv}];
	int flg = 1;
	REP(i, N) if(!(i == prv || v[i] == 2)) flg = 0;
	if(flg) return 0;
	int ret = INF;
	REP(i, N) {
		if(i != prv && v[i] != 2) {
			v[i]++;
			CHMIN(ret, dfs(v, i) + c[prv][i]);
			v[i]--;
		}
	}
	return mp[{v, prv}] = ret;
}

signed main(){
	cin >> N;
	REP(i, N) REP(j, N) cin >> c[i][j];
	vector<int> v(N);
	int ans = INF;
	REP(i, N) {
		v = vector<int>(N);
		v[i] = 1;
		CHMIN(ans, dfs(v, i));
	}
	out(ans);
}