Problem: The problem uses a simplified TCP/IP address model, please read the statement carefully.

An IP address is a 32-bit integer, represented as a group of four decimal 8-bit integers (without leading zeroes), separated by commas. For example, record 0.255.1.123 shows a correct IP address and records 0.256.1.123 and 0.255.1.01 do not. In the given problem an arbitrary group of four 8-bit integers is a correct IP address.

Our hero Polycarpus still works as a system administrator in some large corporation. He likes beautiful IP addresses. To check if some IP address is beautiful, he should do the following:

  1. write out in a line four 8-bit numbers of the IP address, without the commas; 
  2. check if the resulting string is a palindrome. 



Let us remind you that a palindrome is a string that reads the same from right to left and from left to right.

For example, IP addresses 12.102.20.121 and 0.3.14.130 are beautiful (as strings "1210220121" and "0314130" are palindromes), and IP addresses 1.20.20.1 and 100.4.4.1 are not.

Polycarpus wants to find all beautiful IP addresses that have the given set of digits. Each digit from the set must occur in the IP address at least once. IP address must not contain any other digits. Help him to cope with this difficult task.

Input

The first line contains a single integer n (1 ≤ n ≤ 10) — the number of digits in the set. The second line contains the set of integers a1, a2, ..., an (0 ≤ ai ≤ 9). It is guaranteed that all digits in the set are distinct.

Output

In the first line print a single integer k — the number of beautiful IP addresses that contain the given set of digits. In the following k lines print the IP addresses, one per line in the arbitrary order.

Examples

Input

6
0 1 2 9 8 7


Output

6
78.190.209.187
79.180.208.197
87.190.209.178
89.170.207.198
97.180.208.179
98.170.207.189


Input

1
4


Output

16
4.4.4.4
4.4.4.44
4.4.44.4
4.4.44.44
4.44.4.4
4.44.4.44
4.44.44.4
4.44.44.44
44.4.4.4
44.4.4.44
44.4.44.4
44.4.44.44
44.44.4.4
44.44.4.44
44.44.44.4
44.44.44.44

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int M = 100005;
const int mod = 1e9 + 7;
const double eps = 1e-6;
const double Pi = 2 * acos(0.0);
inline int max(int a, int b) { return a > b ? a : b; }
inline int min(int a, int b) { return a < b ? a : b; }
inline int bit(int x) { return 1 << x; }
inline double dabs(double x) { return x > 0 ? x : (-x); }
inline int abs(int x) { return x > 0 ? x : (-x); }
inline int lowbit(int x) { return x & (-x); }
int n, rec[15], tmp[20];
bool use[M];
struct node {
  int a, b, c, d;
  node(int x, int y, int z, int w) { a = x, b = y, c = z, d = w; }
};
set<int> st;
vector<node> v;
int tail = 0, able[400], num;
int first(int x) {
  if (x >= 100) return x / 100;
  if (x > 9) return x / 10;
  return x;
}
void deal(int x) {
  tmp[num++] = x % 10;
  x /= 10;
  while (x) {
    tmp[num++] = x % 10;
    x /= 10;
  }
}
bool check(int x, int y, int z, int w) {
  num = 0;
  deal(x);
  deal(y);
  deal(z);
  deal(w);
  for (int i = 0; i < num / 2; i++) {
    if (tmp[i] != tmp[num - 1 - i]) return 0;
  }
  memset(use, 0, sizeof(use));
  int tt = 0;
  for (int i = 0; i < num; i++) {
    if (!use[tmp[i]]) {
      use[tmp[i]] = 1;
      tt++;
    }
  }
  return tt == n;
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> rec[i];
    st.insert(rec[i]);
  }
  if (n > 6) {
    cout << 0;
  } else {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        st.insert(rec[i] * 10 + rec[j]);
        for (int k = 0; k < n; k++) {
          int t = rec[i] * 100 + rec[j] * 10 + rec[k];
          if (t < 256) st.insert(t);
        }
      }
    }
    for (set<int>::iterator ii = st.begin(); ii != st.end(); ii++) {
      able[tail++] = *ii;
    }
    for (int i = 0; i < tail; i++) {
      for (int j = 0; j < tail; j++) {
        if (first(able[i]) != able[j] % 10) continue;
        for (int k = 0; k < tail; k++) {
          for (int l = 0; l < tail; l++) {
            if (check(able[j], able[l], able[k], able[i])) {
              v.push_back(node(able[i], able[k], able[l], able[j]));
            }
          }
        }
      }
    }
    cout << v.size() << endl;
    for (int i = 0; i < v.size(); i++) {
      printf("%d.%d.%d.%d\n", v[i].a, v[i].b, v[i].c, v[i].d);
    }
  }
  return 0;
}