#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"YES\n"; else cout<<"NO\n";}

void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N;
	cin>>N;
	vector<int> T(N+1,1);
	vector<vector<int>> cost(N,vector<int>(N));
	rep(i,N) rep(j,N){
		cin>>cost[i][j];
	}
	rep(i,N) T[i+1]=T[i]*3;
	vector<vector<int>> dp(T[N],vector<int>(N,INF));
	rep(i,N) dp[T[i]][i]=0;
	rep(i,T[N]){
		vector<int> p(N);
		rep(j,N) p[j]=(i/T[j])%3;
		rep(j,N){
			if(dp[i][j]==INF) continue;
			rep(k,N){
				if(k==j||p[k]==2) continue;
				chmin(dp[i+T[k]][k],dp[i][j]+cost[j][k]);
			}
		}
	}
	int ans=INF;
	rep(i,N){
		chmin(ans,dp[T[N]-1][i]);
		chmin(ans,dp[T[N]-1-T[i]][i]);
	}
	cout<<ans<<"\n";
}