#include <bits/stdc++.h>
using namespace std;
template <class T>
void printVector(std::vector<std::vector<T>> const &matrix) {
  for (std::vector<T> row : matrix) {
    for (T val : row) {
      std::cout << val;
    }
    std::cout << '\n';
  }
}
static void solve() {
  int n;
  cin >> n;
  char D = 'D';
  char star = '*';
  std::vector<std::vector<char>> matrix(n, std::vector<char>(n, star));
  int mid = n / 2;
  int from = mid;
  int to = mid;
  for (int i = 0; i < n; i++) {
    for (int j = from; j <= to; j++) {
      matrix[i][j] = D;
    }
    if (i >= mid) {
      from++;
      to--;
    } else {
      from--;
      to++;
    }
  }
  printVector(matrix);
}
int main() {
  solve();
  return 0;
}

### Prompt

Your task is to create 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;
template <class T>
void printVector(std::vector<std::vector<T>> const &matrix) {
  for (std::vector<T> row : matrix) {
    for (T val : row) {
      std::cout << val;
    }
    std::cout << '\n';
  }
}
static void solve() {
  int n;
  cin >> n;
  char D = 'D';
  char star = '*';
  std::vector<std::vector<char>> matrix(n, std::vector<char>(n, star));
  int mid = n / 2;
  int from = mid;
  int to = mid;
  for (int i = 0; i < n; i++) {
    for (int j = from; j <= to; j++) {
      matrix[i][j] = D;
    }
    if (i >= mid) {
      from++;
      to--;
    } else {
      from--;
      to++;
    }
  }
  printVector(matrix);
}
int main() {
  solve();
  return 0;
}

```