#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:512000000")
using namespace std;
int main() {
  time_t start = clock();
  int n;
  cin >> n;
  vector<string> ans;
  for (int i = 1; i < n; i += 2) {
    int cnt = n - i;
    cnt >>= 1;
    ans.push_back(string(cnt, '*') + string(i, 'D') + string(cnt, '*'));
  }
  for (int i = 0; i < ans.size(); i++) cout << ans[i] << '\n';
  cout << string(n, 'D');
  reverse(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); i++) cout << '\n' << ans[i];
  fprintf(stderr, "\n%0.3lf\n", (clock() - start) * 1.0 / CLOCKS_PER_SEC);
  return 0;
}

### Prompt

Please formulate 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>
#pragma comment(linker, "/STACK:512000000")
using namespace std;
int main() {
  time_t start = clock();
  int n;
  cin >> n;
  vector<string> ans;
  for (int i = 1; i < n; i += 2) {
    int cnt = n - i;
    cnt >>= 1;
    ans.push_back(string(cnt, '*') + string(i, 'D') + string(cnt, '*'));
  }
  for (int i = 0; i < ans.size(); i++) cout << ans[i] << '\n';
  cout << string(n, 'D');
  reverse(ans.begin(), ans.end());
  for (int i = 0; i < ans.size(); i++) cout << '\n' << ans[i];
  fprintf(stderr, "\n%0.3lf\n", (clock() - start) * 1.0 / CLOCKS_PER_SEC);
  return 0;
}

```