#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  for (int k = 1; k <= n; k += 2) {
    for (int i = n; i > k; i -= 2) cout << "*";
    for (int j = 1; j <= k; j++) cout << "D";
    for (int i = n; i > k; i -= 2) cout << "*";
    cout << "\n";
  }
  for (int k = n; k > 1; k -= 2) {
    for (int i = n; i >= k; i -= 2) cout << "*";
    for (int j = k - 2; j >= 1; j--) cout << "D";
    for (int i = n; i >= k; i -= 2) cout << "*";
    cout << "\n";
  }
  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;
  cin >> n;
  for (int k = 1; k <= n; k += 2) {
    for (int i = n; i > k; i -= 2) cout << "*";
    for (int j = 1; j <= k; j++) cout << "D";
    for (int i = n; i > k; i -= 2) cout << "*";
    cout << "\n";
  }
  for (int k = n; k > 1; k -= 2) {
    for (int i = n; i >= k; i -= 2) cout << "*";
    for (int j = k - 2; j >= 1; j--) cout << "D";
    for (int i = n; i >= k; i -= 2) cout << "*";
    cout << "\n";
  }
  return 0;
}

```