You are given N-1 subsets of \\{1,2,...,N\\}. Let the i-th set be E_i.

Let us choose two distinct elements u_i and v_i from each set E_i, and consider a graph T with N vertices and N-1 edges, whose vertex set is \\{1,2,..,N\\} and whose edge set is (u_1,v_1),(u_2,v_2),...,(u_{N-1},v_{N-1}). Determine if T can be a tree by properly deciding u_i and v_i. If it can, additionally find one instance of (u_1,v_1),(u_2,v_2),...,(u_{N-1},v_{N-1}) such that T is actually a tree.

Constraints

* 2 \leq N \leq 10^5
* E_i is a subset of \\{1,2,..,N\\}.
* |E_i| \geq 2
* The sum of |E_i| is at most 2 \times 10^5.

Input

Input is given from Standard Input in the following format:


N
c_1 w_{1,1} w_{1,2} ... w_{1,c_1}
:
c_{N-1} w_{N-1,1} w_{N-1,2} ... w_{N-1,c_{N-1}}


Here, c_i stands for the number of elements in E_i, and w_{i,1},...,w_{i,c_i} are the c_i elements in c_i. Here, 2 \leq c_i \leq N, 1 \leq w_{i,j} \leq N, and w_{i,j} \neq w_{i,k} (1 \leq j < k \leq c_i) hold.

Output

If T cannot be a tree, print `-1`; otherwise, print the choices of (u_i,v_i) that satisfy the condition, in the following format:


u_1 v_1
:
u_{N-1} v_{N-1}

Output

If T cannot be a tree, print `-1`; otherwise, print the choices of (u_i,v_i) that satisfy the condition, in the following format:


u_1 v_1
:
u_{N-1} v_{N-1}

Examples

Input

5
2 1 2
3 1 2 3
3 3 4 5
2 4 5


Output

1 2
1 3
3 4
4 5


Input

6
3 1 2 3
3 2 3 4
3 1 3 4
3 1 2 4
3 4 5 6


Output

-1


Input

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


Output

1 2
2 3
3 4
4 5
5 6
6 7
7 8
8 9
9 10
#include <bits/stdc++.h>

struct vertex {
	int estart;
	int ecur;
	int dist;
} v[300003];
struct edge {
	int enext,to;
	int cap;
} e[1000003];int en;
void addedge(int a,int b,int cap)
{
	e[en].enext = v[a].estart;e[en].to = b;e[en].cap = cap;v[a].estart = en++;
	e[en].enext = v[b].estart;e[en].to = a;e[en].cap = 0;v[b].estart = en++;
}
int start, end;
int dfs(int i,int cap)
{
	if(i == end) return cap;
	int flow = 0;
	for(int &j = v[i].ecur;j != -1;j = e[j].enext) {
		int to = e[j].to;
		if(e[j].cap == 0 || v[to].dist != v[i].dist + 1) continue;
		int val = dfs(to,std::min(cap,e[j].cap));
		flow += val;cap -= val;e[j].cap -= val;e[j^1].cap += val;
		if(cap == 0) break;
	}
	return flow;
}
int n,m;
struct vertex2 {
	std::vector<int> inset;
	bool vis;
} v2[100003];
std::pair<int,int> ans[100003];
int match[100003];
int main()
{
	scanf("%d",&n);
	for(int i = 0;i < 2*n+1;++i) {
		v[i].estart = -1;
	}
	start = 2*n-1, end = 2*n;
	// root = 0
	for(int i = 1;i < n;++i) {
		addedge(start,i,1);
	}
	for(int i = 0;i < n - 1;++i) {
		int c;
		scanf("%d",&c);
		for(int j = 0;j < c;++j) {
			int k;
			scanf("%d",&k);--k;
			v2[k].inset.push_back(i);
			if(k != 0) addedge(k,n+i,1);
		}
		addedge(n+i,end,1);
	}
	int flow = 0;
	for(;;) {
		for(int i = 0;i < 2*n+1;++i) {
			v[i].dist = -1;
			v[i].ecur = v[i].estart;
		}
		v[start].dist = 0;
		std::queue<int> q;
		q.push(start);
		while(!q.empty()) {
			int cur = q.front();q.pop();
			for(int j = v[cur].estart;j != -1;j = e[j].enext) {
				if(e[j].cap == 0) continue;
				int to = e[j].to;
				if(v[to].dist == -1) {
					v[to].dist = v[cur].dist + 1;
					q.push(to);
				}
			}
		}
		if(v[end].dist == -1) break;
		flow += dfs(start,999999);
	}
	if(flow != n-1) {
		printf("-1\n");
		return 0;
	}
	for(int i = 0;i < n - 1;++i) {
		int x = n+i;
		match[i] = -1;
		for(int j = v[x].estart;j != -1;j = e[j].enext) {
			if(e[j].to >= 1 && e[j].to < n && e[j].cap == 1) {
				match[i] = e[j].to;
				break;
			}
		}
		assert(match[i] != -1);
	}
	
	{
		std::queue<int> q;
		q.push(0);v2[0].vis = true;
		int cnt = 0;
		while(!q.empty()) {
			int cur = q.front();q.pop();
			for(int j = 0;j < v2[cur].inset.size();++j) {
				int to = v2[cur].inset[j];
				if(!v2[match[to]].vis) {
					ans[to] = std::make_pair(cur,match[to]);
					v2[match[to]].vis = true;
					q.push(match[to]);
				}
			}
			++cnt;
		}
		if(cnt == n) {
			for(int i = 0;i < n-1;++i) printf("%d %d\n", ans[i].first+1, ans[i].second+1);
		} else {
			printf("-1\n");
		}
	}
}
