4
1 4
3 1
3 4
 5
4 1
4 3
5 3
2 4
 21
7 15
13 1
14 3
4 10
2 3
16 18
17 20
16 20
8 4
3 12
2 17
13 11
16 1
13 2
13 5
8 9
6 14
3 17
16 9
13 8
 3
3 1
3 2
 6
5 2
5 3
1 4
3 1
5 6
 60
17 34
46 22
50 44
46 33
41 21
31 33
48 6
38 19
35 60
2 24
49 29
7 53
34 1
19 55
32 1
31 42
27 28
4 53
6 50
21 34
1 10
12 36
54 8
16 13
51 43
45 51
54 20
13 53
34 33
49 33
51 11
59 34
15 5
59 28
30 39
13 30
58 4
34 14
3 9
19 34
4 18
26 48
56 54
3 43
57 25
3 41
35 3
48 44
19 13
54 1
23 31
59 47
5 1
46 40
6 26
20 25
37 5
17 24
20 52
 3
3 2
1 2
 39
6 13
15 39
10 35
31 28
4 21
12 39
3 7
3 13
6 1
5 14
36 28
12 15
18 38
30 29
19 34
36 16
20 22
8 13
38 32
26 39
21 37
1 7
15 27
12 26
8 3
6 14
29 2
25 23
32 21
5 16
32 25
6 8
13 10
23 30
34 37
29 33
28 14
36 5
 10
5 9
8 5
7 6
7 9
3 9
2 1
7 2
3 6
7 1

1
3 4 1 2  0
 3
13 2 1 7 3 17 1 19 13 8 1 21  0
 0
 2
48 44 1 6 6 26 1 12  0
 7
12 15 1 2 1 7 1 9 12 26 1 11 8 3 1 12 6 8 1 17 28 14 1 20 36 5 1 24  2
3 6 1 4 7 1 1 10 
#include <bits/stdc++.h>
inline long long in() {
  long long x = 0;
  char c = getchar();
  bool neg = false;
  while (c != '-' && ('0' > c || c > '9')) c = getchar();
  if (c == '-') neg = true, c = getchar();
  while ('0' <= c && c <= '9') x = 10 * x + c - '0', c = getchar();
  if (neg) x = -x;
  return x;
}
inline void out(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) out(x / 10);
  putchar(x % 10 + '0');
}
using namespace std;
const int N = 1010;
int n, it;
int v, e;
int id[N], ed[N], ve[N], p[N];
bool dd[N], fre[N];
vector<pair<int, int> > g;
vector<pair<int, int> > ad[N];
stack<int> st;
stack<pair<int, pair<int, int> > > sc;
struct oo {
  int a, b, c, d;
};
vector<oo> ans;
int root(int x) { return id[x] < 0 ? x : id[x] = root(id[x]); }
void unite(int x, int y) {
  if ((x = root(x)) == (y = root(y))) return;
  id[x] += id[y];
  id[y] = x;
}
void dfs(int u) {
  p[u] = it;
  if (!dd[u]) v++, dd[u] = true;
  for (auto& v : ad[u])
    if (!fre[v.second]) {
      fre[v.second] = true;
      dfs(v.first);
      g.push_back({u, v.first});
    }
}
int main() {
  n = in();
  for (int i = 2, _c = n; i <= _c; ++i) {
    int u = in(), v = in();
    ad[u].push_back({v, i});
    ad[v].push_back({u, i});
  }
  memset(id, -1, sizeof(id));
  for (int i = 1, _c = n; i <= _c; ++i)
    if (!dd[i]) {
      it++;
      g.clear(), v = 0, dfs(i), e = g.size();
      ve[it] = v, ed[it] = e;
      if (v == e + 1)
        st.push(i);
      else
        for (auto& x : g) {
          int u = x.first, v = x.second;
          if (root(u) == root(v))
            sc.push({i, {u, v}});
          else
            unite(u, v);
        }
    }
  if (st.size() == 1 && sc.empty()) return out(0), 0;
  while (!st.empty() && !sc.empty()) {
    pair<int, pair<int, int> > x = sc.top();
    sc.pop();
    ans.push_back({x.second.second, x.second.first, x.first, st.top()});
    st.pop();
    ed[p[x.second.second]]--;
    if (ed[p[x.second.second]] == ve[p[x.second.second]] - 1)
      st.push(x.second.second);
  }
  out(ans.size()), putchar('\n');
  for (auto& x : ans)
    out(x.a), putchar(' '), out(x.b), putchar(' '), out(x.c), putchar(' '),
        out(x.d), putchar('\n');
}
