Problem: In this problem you will write a simple code generator for a 2D programming language derived from [Brainfuck](https://en.wikipedia.org/wiki/Brainfuck).

The code in this language is a rectangular grid of characters '.' and 'X'. The code is converted to a Brainfuck program as follows: the characters are read in the usual order (top to bottom, left to right), and each 'X' character is converted a Brainfuck instruction to be executed. The instruction is defined by the left, top and right neighbors of the 'X' character using the following conversion table:

<image>

You are given a string. Output a program in the described language which prints this string.

You can download the language interpreter used for judging here: <https://assets.codeforces.com/rounds/952/puzzling-interpreter.cpp> (use C++11 to compile the code). Note several implementation details:

  * The first step of the language interpretation is conversion to a Brainfuck program, which is then executed.
  * The code must be rectangular, with all lines of the same length. It can have at most 10,000 lines and 10,000 columns, and can have at most 500,000 'X' characters.
  * The code has toroidal topology, i.e. the 'X' on the first line will have top neighbor in the last line.
  * Brainfuck interpreter has 30000 memory cells which store integers from 0 to 255 with increment/decrement done modulo 256.
  * Console input (, command) is allowed in Brainfuck code but has no effect when executed.

Input

The input consists of a single string of characters with ASCII codes between 33 ('!') and 122 ('z'), inclusive. The length of the string is between 1 and 10 characters, inclusive.

Output

Output a program in the described language which, when executed, will print the given message.

Example

Input

$$$

Output

.......X.......
......XXX......
.....XXXXX.....
....XXXXXXX....
...XXXXXXXXX...
..XXXXXXXXXXX..
.XXXXXXXXXXXXX.
...............
X.............X
X..............
X..............
X..............

Note

The example corresponds to the following Brainfuck program:
    
    
           -  
          >+<  
         >+++<  
        >+++++<  
       >+++++++<  
      >+++++++++<  
     >+++++++++++<  
      
    <             >  
    .  
    .  
    .  
    

The triangular block decrements the first memory cell and sets the value of the second memory cell to 36 - the ASCII code of '$' character. The next line after the triangular block moves the memory pointer to the second memory cell, and the next three lines print the '$' character three times.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct bd {
  int64_t v;
  int64_t c;
};
const int64_t po[94] = {0,   1,  1, 1, 2,  1, 2,  1, 5,  2, 2,  1, 5,  1, 2, 1,
                        14,  1,  5, 1, 5,  2, 2,  1, 15, 2, 2,  5, 4,  1, 4, 1,
                        51,  1,  2, 1, 14, 1, 2,  2, 14, 1, 6,  1, 4,  2, 2, 1,
                        52,  2,  5, 1, 5,  1, 15, 2, 13, 2, 2,  1, 13, 1, 2, 4,
                        267, 1,  4, 1, 5,  1, 4,  1, 50, 1, 2,  3, 4,  1, 6, 1,
                        52,  15, 2, 1, 15, 1, 2,  1, 12, 1, 10, 1, 4,  2};
int64_t n, i, j, x, y, z, minn = 0, t, pr, a, b, k;
bd all[300001];
bd h;
int64_t dp[300001][3];
const int maxn = 1000;
char c[maxn][maxn];
int cur = 0;
void makec(int c) {
  while (cur != c + 1) {
    ::c[x][y] = 'X';
    y += 2;
    if (y + 10 > maxn) x += 3, y = 0;
    --cur;
    if (cur < 0) cur = 255;
  }
  x += 2;
  y = 0;
  ::c[x][0] = ::c[x + 1][0] = 'X';
  x += 3;
  --cur;
}
int main() {
  memset(c, '.', sizeof c);
  for (int i = 0; i < (int)(maxn); ++i) c[i][maxn - 1] = 0;
  string s;
  cin >> s;
  for (char c : s) {
    makec(c);
  }
  for (int i = 0; i < (int)(x + 1); ++i) cout << c[i] << "\n";
}