Cannot parse: 1000 MS error parsing time

Description

Albert_s always thinks maybe he should not be a graduate student of BNU but an ACM coach of SDNU.

In order to express his love for ACM, he decided to output ACM patterns with height N. However, he is too busy to do this thing, can you help him?

Format

Input

There are multiply testcases, each testcase contains a single integer $n(4 \le n \le 120)$, it's guarantee that ​ is an even number.

Output

Output ACM patterns with height N, the minimum distance (bottom) between each letter is two spaces, the height and width of C are both N, the position of " _ " in A is N/2, the characters used are " _ ", " | ", " \ ", " / ".

Samples

4

           ____
   /\     |      |\      /|
  /__\    |      | \    / |
 /    \   |      |  \  /  |
/      \  |____  |   \/   |