#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i, j, m, k, x = 1;
  cin >> n;
  int st = n / 2, end = n / 2;
  for (i = 0; i <= n / 2; i++) {
    for (j = 0; j < st; j++) cout << "*";
    for (k = 0; k < x; k++) cout << "D";
    for (m = end; m > 0; m--) cout << "*";
    st--;
    end--;
    x += 2;
    cout << endl;
  }
  x -= 2;
  st++;
  end++;
  for (i = 0; i < n / 2; i++) {
    st++;
    x -= 2;
    end++;
    for (j = 0; j < st; j++) cout << "*";
    for (k = 0; k < x; k++) cout << "D";
    for (m = end; m > 0; m--) cout << "*";
    cout << endl;
  }
  return 0;
}

### 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>
using namespace std;
int main() {
  int n, i, j, m, k, x = 1;
  cin >> n;
  int st = n / 2, end = n / 2;
  for (i = 0; i <= n / 2; i++) {
    for (j = 0; j < st; j++) cout << "*";
    for (k = 0; k < x; k++) cout << "D";
    for (m = end; m > 0; m--) cout << "*";
    st--;
    end--;
    x += 2;
    cout << endl;
  }
  x -= 2;
  st++;
  end++;
  for (i = 0; i < n / 2; i++) {
    st++;
    x -= 2;
    end++;
    for (j = 0; j < st; j++) cout << "*";
    for (k = 0; k < x; k++) cout << "D";
    for (m = end; m > 0; m--) cout << "*";
    cout << endl;
  }
  return 0;
}

```