#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return !b ? abs(a) : gcd(b, a % b); }
long long lcm(long long a, long long b) { return abs(a / gcd(a, b)) * b; }
void fast() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void run() {}
bool isprime(long long n) {
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return (n >= 2);
}
int main() {
  int n;
  cin >> n;
  for (int i = n / 2; i >= 1; i--) {
    int temp = (n - i) / 2;
    for (int j = 0; j < i; j++) cout << '*';
    for (int j = 0; j < n - i * 2; j++) cout << 'D';
    for (int j = 0; j < i; j++) cout << '*';
    cout << "\n";
  }
  for (int i = 0; i < (int)(n); ++i) cout << 'D';
  cout << "\n";
  for (int i = 1; i <= n / 2; i++) {
    int temp = (n - i) / 2;
    for (int j = 0; j < i; j++) cout << '*';
    for (int j = 0; j < n - i * 2; j++) cout << 'D';
    for (int j = 0; j < i; j++) cout << '*';
    cout << "\n";
  }
}

### 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;
long long gcd(long long a, long long b) { return !b ? abs(a) : gcd(b, a % b); }
long long lcm(long long a, long long b) { return abs(a / gcd(a, b)) * b; }
void fast() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void run() {}
bool isprime(long long n) {
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) return false;
  }
  return (n >= 2);
}
int main() {
  int n;
  cin >> n;
  for (int i = n / 2; i >= 1; i--) {
    int temp = (n - i) / 2;
    for (int j = 0; j < i; j++) cout << '*';
    for (int j = 0; j < n - i * 2; j++) cout << 'D';
    for (int j = 0; j < i; j++) cout << '*';
    cout << "\n";
  }
  for (int i = 0; i < (int)(n); ++i) cout << 'D';
  cout << "\n";
  for (int i = 1; i <= n / 2; i++) {
    int temp = (n - i) / 2;
    for (int j = 0; j < i; j++) cout << '*';
    for (int j = 0; j < n - i * 2; j++) cout << 'D';
    for (int j = 0; j < i; j++) cout << '*';
    cout << "\n";
  }
}

```