#include <bits/stdc++.h>
using namespace std;
bool odd(int N) {
  while (N < 0) {
    N += 2;
  }
  return N % 2 == 1 ? true : false;
}
bool even(int N) {
  while (N < 0) {
    N += 2;
  }
  return N % 2 == 0 ? true : false;
}
long long mod(long long a, long long b) { return (a % b + b) % b; }
int main() {
  int n;
  cin >> n;
  for (int i = 0; i != n; ++i) {
    for (int j = 0; j != n; ++j) {
      int midPoint = n / 2;
      if (j >= abs(midPoint - (i)) &&
          j <= (i <= midPoint ? (midPoint + i) : n - 1 - abs(midPoint - i)))
        cout << "D";
      else
        cout << "*";
    }
    cout << "\n";
  }
  return 0;
}

### Prompt

Please provide a Cpp coded solution to the problem described below:

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;
bool odd(int N) {
  while (N < 0) {
    N += 2;
  }
  return N % 2 == 1 ? true : false;
}
bool even(int N) {
  while (N < 0) {
    N += 2;
  }
  return N % 2 == 0 ? true : false;
}
long long mod(long long a, long long b) { return (a % b + b) % b; }
int main() {
  int n;
  cin >> n;
  for (int i = 0; i != n; ++i) {
    for (int j = 0; j != n; ++j) {
      int midPoint = n / 2;
      if (j >= abs(midPoint - (i)) &&
          j <= (i <= midPoint ? (midPoint + i) : n - 1 - abs(midPoint - i)))
        cout << "D";
      else
        cout << "*";
    }
    cout << "\n";
  }
  return 0;
}

```