#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define PI 2*asin(1)
#define int long long
#define mod 1000000007
#define all(a) begin(a),end(a)
#define fore(i, j, n) for(long long i = j; i < n; i++)
using namespace std;

void solve(){
  int n; cin >> n;
  vector<pair<int,string>>a(n);
  fore(i,0,n){
    string s; cin >> s;
    reverse(all(s));
    a[i] = {s.size(), s};
  }
  sort(all(a));
  int last = 0;
  fore(i,0,n){
    string h = a[i].second;
    reverse(all(h));
    if(last != a[i].first) {cout << a[i].first << '\n'; last = a[i].first;}
    cout << a[i].second << ' ' << h << '\n';
  }
}

int32_t main() {
  //freopen("input.txt", "r", stdin);
  //freopen("output.txt", "w", stdout);
  solve();
  return 0;
}