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;
const int L = 250;
char buf[L + 1];
void clear() {
  for (int i = 0; i < L; ++i) {
    buf[i] = '.';
  }
}
void add(int delta) {
  if (delta == 1) {
    clear();
    buf[1] = 'X';
    puts(buf);
    clear();
    puts(buf);
  } else if (delta >= 2) {
    int n = 1;
    while ((n + 1) * (n + 1) <= delta) {
      ++n;
    }
    int mid = n;
    clear();
    buf[mid] = 'X';
    puts(buf);
    for (int i = 1; i <= n; ++i) {
      buf[mid - i] = buf[mid + i] = 'X';
      puts(buf);
    }
    clear();
    puts(buf);
    int left = delta - n * n;
    if (left) {
      add(left);
    }
  }
}
void print() {
  clear();
  buf[0] = buf[L - 1] = 'X';
  puts(buf);
  buf[L - 1] = '.';
  puts(buf);
  clear();
  puts(buf);
}
void add_print(int delta) {
  add(delta);
  print();
}
void sub(int delta) {
  int f = 0;
  while (delta) {
    clear();
    for (int i = 0; i < 40 && delta; i += 2) {
      buf[i + f] = 'X';
      --delta;
    }
    f ^= 1;
    puts(buf);
  }
  clear();
  puts(buf);
}
void sub_print(int delta) {
  sub(delta);
  print();
}
int main() {
  buf[L] = 0;
  clear();
  puts(buf);
  clear();
  buf[0] = buf[L - 1] = 'X';
  puts(buf);
  clear();
  puts(buf);
  char s[105];
  gets(s);
  int cur = 0, l = strlen(s);
  for (int i = 0; i < l; ++i) {
    int nxt = s[i];
    if (nxt > cur) {
      cur += 256;
    }
    sub_print(cur - nxt);
    cur = nxt;
  }
  return 0;
}