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.
#include <bits/stdc++.h>
using namespace std;
int main() {
  cin.sync_with_stdio(false);
  cout.sync_with_stdio(false);
  string s;
  getline(cin, s);
  unsigned char current = 0;
  int numberOfMinusToAdd = 0;
  char lastrow[3], currentRow[3];
  bool didNotPlaceX;
  for (int i = 0; i < 3; ++i) {
    currentRow[i] = '.';
    cout << currentRow[i];
  }
  cout << '\n';
  for (int i = 0; i < s.size(); ++i) {
    for (int j = 0; j < 3; ++j) lastrow[j] = currentRow[j];
    while (current != s[i]) {
      current--;
      numberOfMinusToAdd++;
    }
    for (int j = 0; j < numberOfMinusToAdd; ++j) {
      didNotPlaceX = true;
      for (int k = 0; k < 3; ++k) {
        if (lastrow[k] == '.' && didNotPlaceX) {
          didNotPlaceX = false;
          currentRow[k] = 'X';
        } else {
          currentRow[k] = '.';
        }
      }
      for (int k = 0; k < 3; ++k) {
        cout << currentRow[k];
        lastrow[k] = currentRow[k];
      }
      cout << '\n';
    }
    for (int k = 0; k < 3; ++k) {
      didNotPlaceX = true;
      if (lastrow[k] == 'X' && didNotPlaceX) {
        currentRow[k] = 'X';
        didNotPlaceX = false;
      } else {
        currentRow[k] = '.';
      }
    }
    for (int k = 0; k < 3; ++k) {
      cout << currentRow[k];
      lastrow[k] = currentRow[k];
    }
    cout << '\n';
    numberOfMinusToAdd = 0;
  }
  cin >> current;
  return 0;
}
