#include <bits/stdc++.h>
void print_star(int a);
void print_D(int a);
int main(void) {
  int input, i, j, k;
  scanf("%d", &input);
  k = 2;
  j = 1;
  for (i = (input - 1) / 2; i <= (input - 1) / 2; i -= k / 2) {
    print_star(i);
    print_D(j);
    print_star(i);
    if (i == 0) {
      k = -2;
    }
    j += k;
    printf("\n");
  }
  return (0);
}
void print_star(int a) {
  int i;
  for (i = 0; i < a; i++) {
    printf("*");
  }
}
void print_D(int a) {
  int i;
  for (i = 0; i < a; i++) {
    printf("D");
  }
}

### Prompt

Your challenge is to write a cpp solution to 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>
void print_star(int a);
void print_D(int a);
int main(void) {
  int input, i, j, k;
  scanf("%d", &input);
  k = 2;
  j = 1;
  for (i = (input - 1) / 2; i <= (input - 1) / 2; i -= k / 2) {
    print_star(i);
    print_D(j);
    print_star(i);
    if (i == 0) {
      k = -2;
    }
    j += k;
    printf("\n");
  }
  return (0);
}
void print_star(int a) {
  int i;
  for (i = 0; i < a; i++) {
    printf("*");
  }
}
void print_D(int a) {
  int i;
  for (i = 0; i < a; i++) {
    printf("D");
  }
}

```