UVA1349OptimalBusRouteDesign

//UVA1349OptimalBusRouteDesign
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
const int maxn = 100 * 2 + 5;
const int INF = 1000000000;
struct Edge {
	int from, to, cap, flow, cost;
	Edge(int u, int v, int c, int f, int w) : from(u), to(v), cap(c), flow(f), cost(w) {}
}; 

struct MCMF {
	int n, m;
	vector<Edge> edges;
	vector<int> G[maxn];
	int inq[maxn];
	int d[maxn];
	int p[maxn];
	int a[maxn];
	
	void init(int n) {
		this->n = n;
		for(int i = 0; i < n; i++) G[i].clear();
		edges.clear();
	}
	
	void AddEdge(int from, int to, int cap, int cost) {
		edges.push_back(Edge(from, to, cap, 0, cost));
		edges.push_back(Edge(to, from, 0, 0, -cost));
		m = edges.size();
		G[from].push_back(m - 2);
		G[to].push_back(m - 1);
	}
	
    bool BellmanFord(int s, int t, int& flow, long long& cost) {
    	for(int i = 0; i < n; i++) d[i] = INF;
    	memset(inq, 0, sizeof(inq));
    	d[s] = 0; inq[s] = 1; p[s] = 0; a[s] = INF;
    	
    	queue<int> Q;
    	Q.push(s);
    	while(!Q.empty()) {//printf("****\n");
    		int u = Q.front(); Q.pop();
    		inq[u] = 0;
    		for(int i = 0; i < G[u].size(); i++) {
    			Edge& e = edges[G[u][i]];
    			if(e.cap > e.flow && d[e.to] > d[u] + e.cost) {
    				d[e.to] = d[u] + e.cost;
    				p[e.to] = G[u][i];
    				a[e.to] = min(a[u], e.cap - e.flow);
    				if(!inq[e.to]) {
    					Q.push(e.to); inq[e.to] = 1;
					}
				}
			}
		}
		if(d[t] == INF) return false;
		flow += a[t];
		cost += (long long)d[t] * (long long)a[t];
		for(int u = t; u != s; u = edges[p[u]].from) {
			edges[p[u]].flow += a[t];
			edges[p[u] ^ 1].flow -= a[t];
		}
		return true;
	}
	
	int MincostMaxflow(int s, int t, long long& cost) {
		int flow = 0;
		
		while(BellmanFord(s, t, flow, cost)) ;
		return flow;
	}
};
int main() {
	int n;
	while(scanf("%d", &n) == 1 && n) {
		MCMF q;
		q.init(n * 2 + 2);
		for(int i = 1; i <= n; i++) {
			q.AddEdge(0, i, 1, 0);
			q.AddEdge(n + i, 2 * n + 1, 1, 0);  
		}
		for(int i = 1; i <= n; i++) {
			while(1) {
				int a, b;
				scanf("%d", &a);
				if(!a) break;
				scanf("%d", &b);
				q.AddEdge(i, a + n, 1, b); 
			}
		}
		long long cost = 0;
		int flow = q.MincostMaxflow(0, 2 * n + 1, cost);
		if(flow < n) printf("N\n");//非完美匹配
		else printf("%lld\n", cost); 
	}
	return 0;
} 
/*
3
2 2 3 1 0
1 1 3 2 0
1 3 2 7 0
8
2 3 3 1 0
3 3 1 1 4 4 0
1 2 2 7 0
5 4 6 7 0
4 4 3 9 0
7 4 8 5 0
6 2 5 8 8 1 0
6 6 7 2 0
3
2 1 0
3 1 0
2 1 0
0
*/