Problem: You are given n words, each of which consists of lowercase alphabet letters. Each word contains at least one vowel. You are going to choose some of the given words and make as many beautiful lyrics as possible.

Each lyric consists of two lines. Each line consists of two words separated by whitespace. 

A lyric is beautiful if and only if it satisfies all conditions below. 

  * The number of vowels in the first word of the first line is the same as the number of vowels in the first word of the second line. 
  * The number of vowels in the second word of the first line is the same as the number of vowels in the second word of the second line. 
  * The last vowel of the first line is the same as the last vowel of the second line. Note that there may be consonants after the vowel. 



Also, letters "a", "e", "o", "i", and "u" are vowels. Note that "y" is never vowel.

For example of a beautiful lyric, 

"hello hellooowww" 

"whatsup yowowowow" 

is a beautiful lyric because there are two vowels each in "hello" and "whatsup", four vowels each in "hellooowww" and "yowowowow" (keep in mind that "y" is not a vowel), and the last vowel of each line is "o".

For example of a not beautiful lyric, 

"hey man"

"iam mcdic" 

is not a beautiful lyric because "hey" and "iam" don't have same number of vowels and the last vowels of two lines are different ("a" in the first and "i" in the second).

How many beautiful lyrics can you write from given words? Note that you cannot use a word more times than it is given to you. For example, if a word is given three times, you can use it at most three times.

Input

The first line contains single integer n (1 ≤ n ≤ 10^{5}) — the number of words.

The i-th of the next n lines contains string s_{i} consisting lowercase alphabet letters — the i-th word. It is guaranteed that the sum of the total word length is equal or less than 10^{6}. Each word contains at least one vowel.

Output

In the first line, print m — the number of maximum possible beautiful lyrics.

In next 2m lines, print m beautiful lyrics (two lines per lyric).

If there are multiple answers, print any.

Examples

Input


14
wow
this
is
the
first
mcdics
codeforces
round
hooray
i
am
proud
about
that


Output


3
about proud
hooray round
wow first
this is
i that
mcdics am


Input


7
arsijo
suggested
the
idea
for
this
problem


Output


0


Input


4
same
same
same
differ


Output


1
same differ
same same

Note

In the first example, those beautiful lyrics are one of the possible answers. Let's look at the first lyric on the sample output of the first example. "about proud hooray round" forms a beautiful lyric because "about" and "hooray" have same number of vowels, "proud" and "round" have same number of vowels, and both lines have same last vowel. On the other hand, you cannot form any beautiful lyric with the word "codeforces".

In the second example, you cannot form any beautiful lyric from given words.

In the third example, you can use the word "same" up to three times.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
const int maxm = 1e6 + 10;
string s[maxn];
struct word {
  int id, lst;
  word() {}
  word(int id, int lst) : id(id), lst(lst) {}
  bool operator<(const word &t) const {
    if (lst != t.lst) return lst < t.lst;
    return id < t.id;
  }
};
vector<word> len[maxm];
int cot[maxn], lst[maxn];
int n, mx;
set<word> dq;
set<word>::iterator it, itb;
int ff, fs, sf, ss;
vector<int> ans[4];
inline bool good(char x) {
  return x == 'a' || x == 'e' || x == 'u' || x == 'i' || x == 'o';
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  mx = 0;
  for (int i = 0; i < n; i++) {
    cin >> s[i];
    for (int j = 0; j < s[i].length(); j++) {
      if (good(s[i][j])) {
        cot[i]++;
        lst[i] = s[i][j] - 'a';
      }
    }
    len[cot[i]].push_back(word(i, lst[i]));
    mx = max(mx, cot[i]);
  }
  ff = fs = sf = ss = -1;
  word fst;
  for (int i = 1; i <= mx; i++) {
    if (!len[i].empty()) {
      sort(len[i].begin(), len[i].end());
      for (int j = 0; j < len[i].size(); j++) {
        if (j + 1 < len[i].size() && len[i][j].lst == len[i][j + 1].lst) {
          j++;
          continue;
        } else
          dq.insert(word(len[i][j].id, i));
      }
    }
  }
  for (int i = 1; i <= mx; i++) {
    if (!len[i].empty()) {
      for (int j = 0; j < len[i].size(); j++) {
        if (j + 1 < len[i].size() && len[i][j].lst == len[i][j + 1].lst) {
          bool got = 0;
          if (!dq.empty()) {
            for (it = dq.begin(); it != dq.end(); it++) {
              itb = ++it;
              --it;
              if (itb != dq.end() && (*it).lst == (*itb).lst) {
                got = 1;
                ans[0].emplace_back((*it).id);
                ans[1].emplace_back(len[i][j].id);
                ans[2].emplace_back((*itb).id);
                ans[3].emplace_back(len[i][j + 1].id);
                dq.erase(it);
                dq.erase(itb);
                break;
              }
            }
          }
          if (!got) {
            dq.insert(word(len[i][j].id, i));
            dq.insert(word(len[i][j + 1].id, i));
          }
          j++;
          continue;
        } else
          ;
      }
    }
  }
  printf("%d\n", ans[0].size());
  for (int i = 0; i < ans[0].size(); i++) {
    printf("%s %s\n%s %s\n", s[ans[0][i]].c_str(), s[ans[1][i]].c_str(),
           s[ans[2][i]].c_str(), s[ans[3][i]].c_str());
  }
  return 0;
}