#include <bits/stdc++.h>
using namespace std;
void draw(int n) {
  int flag = 0;
  int count = 1;
  for (long long i = 0; i < n; i++) {
    for (int j = 0; j < (n - count) / 2; j++) {
      printf("*");
    }
    for (long long j = 0; j < count; j++) printf("D");
    for (long long j = 0; j < (n - count) / 2; j++) printf("*");
    if (!flag)
      count += 2;
    else
      count -= 2;
    if (count == n) flag = 1;
    printf("\n");
  }
}
int main() {
  int n;
  scanf("%d", &n);
  draw(n);
  return 0;
}

### Prompt

Please formulate 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>
using namespace std;
void draw(int n) {
  int flag = 0;
  int count = 1;
  for (long long i = 0; i < n; i++) {
    for (int j = 0; j < (n - count) / 2; j++) {
      printf("*");
    }
    for (long long j = 0; j < count; j++) printf("D");
    for (long long j = 0; j < (n - count) / 2; j++) printf("*");
    if (!flag)
      count += 2;
    else
      count -= 2;
    if (count == n) flag = 1;
    printf("\n");
  }
}
int main() {
  int n;
  scanf("%d", &n);
  draw(n);
  return 0;
}

```