#include <bits/stdc++.h>
using namespace std;
template <class T>
T abst(const T &n) {
  return (n < 0 ? -n : n);
}
template <class T>
T max2(const T &a, const T &b) {
  return (!(a < b) ? a : b);
}
template <class T>
T min2(const T &a, const T &b) {
  return (a < b ? a : b);
}
template <class T>
T max3(const T &a, const T &b, const T &c) {
  return max2(a, max2(b, c));
}
template <class T>
T min3(const T &a, const T &b, const T &c) {
  return min2(a, min2(b, c));
}
template <class T>
T gcd(const T a, const T b) {
  return (b ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(const T a, const T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
T mod(const T &a, const T &b) {
  return (a < b ? a : a % b);
}
template <class T>
bool inrange(const T &a, const T &b, const T &c) {
  return a <= b && b <= c;
}
template <class T>
T sq(const T &x) {
  return x * x;
}
int main() {
  int n, j, i, m;
  cin >> n;
  int k = floor(n / 2.0);
  for (i = 1, m = 1; i <= k; i++) {
    j = k - (i - 1);
    while (j--) putchar('*');
    j = m;
    while (j--) putchar('D');
    m += 2;
    j = k - (i - 1);
    while (j--) putchar('*');
    putchar('\n');
  }
  for (i = 1; i <= n; i++) putchar('D');
  putchar('\n');
  for (i = 1, m = n - 2; i <= k; i++) {
    j = i;
    while (j--) putchar('*');
    j = m;
    while (j--) putchar('D');
    m -= 2;
    j = i;
    while (j--) putchar('*');
    putchar('\n');
  }
  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;
template <class T>
T abst(const T &n) {
  return (n < 0 ? -n : n);
}
template <class T>
T max2(const T &a, const T &b) {
  return (!(a < b) ? a : b);
}
template <class T>
T min2(const T &a, const T &b) {
  return (a < b ? a : b);
}
template <class T>
T max3(const T &a, const T &b, const T &c) {
  return max2(a, max2(b, c));
}
template <class T>
T min3(const T &a, const T &b, const T &c) {
  return min2(a, min2(b, c));
}
template <class T>
T gcd(const T a, const T b) {
  return (b ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(const T a, const T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
T mod(const T &a, const T &b) {
  return (a < b ? a : a % b);
}
template <class T>
bool inrange(const T &a, const T &b, const T &c) {
  return a <= b && b <= c;
}
template <class T>
T sq(const T &x) {
  return x * x;
}
int main() {
  int n, j, i, m;
  cin >> n;
  int k = floor(n / 2.0);
  for (i = 1, m = 1; i <= k; i++) {
    j = k - (i - 1);
    while (j--) putchar('*');
    j = m;
    while (j--) putchar('D');
    m += 2;
    j = k - (i - 1);
    while (j--) putchar('*');
    putchar('\n');
  }
  for (i = 1; i <= n; i++) putchar('D');
  putchar('\n');
  for (i = 1, m = n - 2; i <= k; i++) {
    j = i;
    while (j--) putchar('*');
    j = m;
    while (j--) putchar('D');
    m -= 2;
    j = i;
    while (j--) putchar('*');
    putchar('\n');
  }
  return 0;
}

```