Please subscribe to the official Codeforces channel in Telegram via the link: https://t.me/codeforces_official.
×

Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

C. Beautiful IP Addresses

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe 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:

- write out in a line four 8-bit numbers of the IP address, without the commas;
- 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 *a*_{1}, *a*_{2}, ..., *a*_{n} (0 ≤ *a*_{i} ≤ 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

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/13/2018 10:30:41 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|