#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int need = (n - 1) / 2;
  int d = 1;
  bool ok = true;
  for (int i = 1; i <= n; i++) {
    int t = need;
    while (t > 0) {
      printf("*");
      t--;
    }
    t = d;
    while (t--) {
      printf("D");
    }
    t = 0;
    while (t < need) {
      printf("*");
      t++;
    }
    printf("\n");
    if (need == 0) {
      ok = false;
    }
    if (ok)
      need--;
    else
      need++;
    if (ok)
      d += 2;
    else
      d -= 2;
  }
}

### Prompt

In CPP, your task is to solve the following problem:

Twilight 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***

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int need = (n - 1) / 2;
  int d = 1;
  bool ok = true;
  for (int i = 1; i <= n; i++) {
    int t = need;
    while (t > 0) {
      printf("*");
      t--;
    }
    t = d;
    while (t--) {
      printf("D");
    }
    t = 0;
    while (t < need) {
      printf("*");
      t++;
    }
    printf("\n");
    if (need == 0) {
      ok = false;
    }
    if (ok)
      need--;
    else
      need++;
    if (ok)
      d += 2;
    else
      d -= 2;
  }
}

```