#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, sum = 0, ans = 0, tem1, tem2;
  string s, c;
  cin >> n;
  int fo = 0;
  for (int i = 1, j = 1, b = 1; i <= n; i++, j += 2, b++) {
    int req = n / 2 + 1 - b + 1;
    for (int h = 1; h <= n; h++) {
      if (h >= req && h <= req + j - 1)
        cout << 'D';
      else
        cout << '*';
    }
    if (j == n || fo) {
      j -= 4;
      fo = 1;
    }
    if (b == n / 2 + 1 || fo) {
      b -= 2;
      fo = 1;
    }
    cout << endl;
  }
  return 0;
}

### Prompt

Please create a solution in CPP 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;
int main() {
  int n, m, sum = 0, ans = 0, tem1, tem2;
  string s, c;
  cin >> n;
  int fo = 0;
  for (int i = 1, j = 1, b = 1; i <= n; i++, j += 2, b++) {
    int req = n / 2 + 1 - b + 1;
    for (int h = 1; h <= n; h++) {
      if (h >= req && h <= req + j - 1)
        cout << 'D';
      else
        cout << '*';
    }
    if (j == n || fo) {
      j -= 4;
      fo = 1;
    }
    if (b == n / 2 + 1 || fo) {
      b -= 2;
      fo = 1;
    }
    cout << endl;
  }
  return 0;
}

```