Rating changes for the last round are temporarily rolled back. They will be returned soon.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only 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

A. Little Pony and Crystal Mine

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputTwilight Sparkle once got a crystal from the Crystal Mine. A crystal of size *n* (*n* is odd; *n* > 1) is an *n* × *n* matrix with a diamond inscribed into it.

You are given an odd integer *n*. You need to draw a crystal of size *n*. The diamond cells of the matrix should be represented by character "D". All other cells of the matrix should be represented by character "*". Look at the examples to understand what you need to draw.

Input

The only line contains an integer *n* (3 ≤ *n* ≤ 101; *n* is odd).

Output

Output a crystal of size *n*.

Examples

Input

3

Output

*D*

DDD

*D*

Input

5

Output

**D**

*DDD*

DDDDD

*DDD*

**D**

Input

7

Output

***D***

**DDD**

*DDDDD*

DDDDDDD

*DDDDD*

**DDD**

***D***

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/28/2020 22:02:00 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|