Problem: My name is James diGriz, I'm the most clever robber and treasure hunter in the whole galaxy. There are books written about my adventures and songs about my operations, though you were able to catch me up in a pretty awkward moment.

I was able to hide from cameras, outsmart all the guards and pass numerous traps, but when I finally reached the treasure box and opened it, I have accidentally started the clockwork bomb! Luckily, I have met such kind of bombs before and I know that the clockwork mechanism can be stopped by connecting contacts with wires on the control panel of the bomb in a certain manner.

I see n contacts connected by n - 1 wires. Contacts are numbered with integers from 1 to n. Bomb has a security mechanism that ensures the following condition: if there exist k ≥ 2 contacts c1, c2, ..., ck forming a circuit, i. e. there exist k distinct wires between contacts c1 and c2, c2 and c3, ..., ck and c1, then the bomb immediately explodes and my story ends here. In particular, if two contacts are connected by more than one wire they form a circuit of length 2. It is also prohibited to connect a contact with itself.

On the other hand, if I disconnect more than one wire (i. e. at some moment there will be no more than n - 2 wires in the scheme) then the other security check fails and the bomb also explodes. So, the only thing I can do is to unplug some wire and plug it into a new place ensuring the fact that no circuits appear.

I know how I should put the wires in order to stop the clockwork. But my time is running out! Help me get out of this alive: find the sequence of operations each of which consists of unplugging some wire and putting it into another place so that the bomb is defused. 

Input

The first line of the input contains n (2 ≤ n ≤ 500 000), the number of contacts.

Each of the following n - 1 lines contains two of integers xi and yi (1 ≤ xi, yi ≤ n, xi ≠ yi) denoting the contacts currently connected by the i-th wire.

The remaining n - 1 lines contain the description of the sought scheme in the same format.

It is guaranteed that the starting and the ending schemes are correct (i. e. do not contain cicuits nor wires connecting contact with itself).

Output

The first line should contain k (k ≥ 0) — the minimum number of moves of unplugging and plugging back some wire required to defuse the bomb.

In each of the following k lines output four integers ai, bi, ci, di meaning that on the i-th step it is neccesary to unplug the wire connecting the contacts ai and bi and plug it to the contacts ci and di. Of course the wire connecting contacts ai and bi should be present in the scheme.

If there is no correct sequence transforming the existing scheme into the sought one, output -1.

Examples

Input

3
1 2
2 3
1 3
3 2


Output

1
1 2 1 3


Input

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


Output

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

Note

Picture with the clarification for the sample tests:

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gi() {
  T x = 0;
  bool f = 0;
  char c = getchar();
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  if (c == '-') f = 1, c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return f ? -x : x;
}
const int N = 500010;
map<pair<int, int>, bool> M;
struct node {
  int to, nxt;
} g[N << 1];
struct edge {
  int x, y;
} e[N];
int lst[N], gl, n, fa[N];
void add(int x, int y) {
  g[++gl] = (node){y, lst[x]};
  lst[x] = gl;
}
int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
struct table {
  int id, nxt;
} a[N << 1];
int tail[N], head[N], tot;
void Add(int x, int y, int id) {
  a[++tot] = (table){id, tail[x]};
  tail[x] = tot;
  if (!head[x]) head[x] = tot;
}
void merge(int x, int y) {
  fa[x] = y;
  a[head[y]].nxt = tail[x];
  head[y] = head[x];
}
void dfs(int u, int ff) {
  for (int i = lst[u]; i; i = g[i].nxt)
    if (g[i].to != ff) dfs(g[i].to, u);
  if (u == 1 || find(u) == find(ff)) return;
  int x = tail[find(u)], y;
  while (x && find(e[a[x].id].x) == find(e[a[x].id].y))
    tail[find(u)] = x = a[x].nxt;
  printf("%d %d %d %d\n", ff, u, e[a[x].id].x, e[a[x].id].y);
  y = find(e[a[x].id].y);
  x = find(e[a[x].id].x);
  merge(x, y);
  return;
}
int main() {
  n = gi<long long>();
  for (int i = 1; i < n; i++) {
    int x = gi<long long>(), y = gi<long long>();
    if (x > y) swap(x, y);
    M[make_pair(x, y)] = 1;
    add(x, y);
    add(y, x);
  }
  for (int i = 1; i <= n; i++) fa[i] = i;
  int m = 0;
  for (int i = 1; i < n; i++) {
    int x = gi<long long>(), y = gi<long long>();
    if (x > y) swap(x, y);
    if (M.find(make_pair(x, y)) == M.end())
      e[++m] = (edge){x, y};
    else
      fa[find(y)] = find(x);
  }
  printf("%d\n", m);
  for (int i = 1; i <= m; i++)
    Add(find(e[i].x), find(e[i].y), i), Add(find(e[i].y), find(e[i].x), i);
  dfs(1, 0);
  return 0;
}