#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class A, class B>
ostream& operator<<(ostream& o, const pair<A, B>& p) {return o << '(' << p.first << ", " << p.second << ')';}
template<size_t Index = 0, typename... Types>
ostream& printTupleElements(ostream& o, const tuple<Types...>& t) {if constexpr (Index < sizeof...(Types)){if(Index > 0){o << ", ";}o << get<Index>(t);printTupleElements<Index + 1>(o, t);}return o;}
template<typename... Types>
ostream& operator<<(ostream& o, const tuple<Types...>& t){o << "(";printTupleElements(o, t);return o << ")";}
template<class T>
auto operator<<(ostream& o, const T& x) -> decltype(x.end(), o){o << '{';bool first = true;for (const auto& e : x){if (!first){o << ", ";}o << e;first = false;} return o << '}';}
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}
size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
//#define DEBUG
#ifdef DEBUG
#define fastio()
#define debug(x...) cerr << "[" #x "]: ", [](auto... $) {((cerr << $ << "; "), ...); }(x), cerr << '\n'
#else
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0);
#define debug(...)
#endif
typedef long long ll;
#define pi pair<int, int>
#define pll pair<ll, ll>
#define st first
#define nd second
#define vi vector<int>
#define vll vector<ll>
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
void solve() {
//ifstream cin("nazwa.in");
//ofstream cout("nazwa.out");
int n;
cin >> n;
vector<vi>g(n + 1);
for(int i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
g[a].eb(b);
g[b].eb(a);
}
vector<pi>kr;
vi pre(n + 1), post(n + 1);
int akt_pre = 0, akt_post = 0;
auto czy = [&](int a, int b) {
return pre[a] <= pre[b] && post[a] >= post[b];
};
auto dfs = [&](auto &&dfs, int v, int o) -> void {
pre[v] = akt_pre++;
if(v != o) {
kr.eb(o, v);
}
for(auto x : g[v]) {
if(x != o) {
dfs(dfs, x, v);
}
}
post[v] = akt_post++;
};
dfs(dfs, 0, 0);
vi pus(n + 1, -1);
pus[0] = 0;
vector<vi>tri(1, pus);
for(int i = 0; i < n; i++) {
auto [a, b] = kr[i];
if(i == 0) {
tri[0][b] = 1;
}
else {
int oj_a = -1;
for(auto x : g[a]) {
if(pre[x] < pre[b]) {
oj_a = x;
}
}
vector<vi>ntri;
debug(a, b, oj_a);
for(auto T : tri) {
vi A = T;
A[b] = A[oj_a];
for(int j = 0; j <= n; j++) {
if(A[j] != -1) {
if(czy(oj_a, a)) {
if(!czy(a, j)) {
A[j] ^= (1 << i);
}
}
else {
if(czy(oj_a, j)) {
//debug(j);
A[j] ^= (1 << i);
}
}
}
}
vi B = A;
for(int j = 0; j <= n; j++) {
if(B[j] != -1) {
B[j] ^= (1 << i);
}
}
ntri.eb(A);
ntri.eb(B);
}
tri = ntri;
}
}
cout << sz(tri) << '\n';
for(auto x : tri) {
for(auto y : x) {
cout << y << ' ';
}
cout << '\n';
}
}
int main() {
fastio();
int t = 1;
//cin >> t;
while(t--) {
solve();
}
}
