#include <bits/stdc++.h>
using namespace std;
bool odd(int N) {
  while (N < 0) {
    N += 2;
  }
  return N % 2 == 1 ? true : false;
}
bool even(int N) {
  while (N < 0) {
    N += 2;
  }
  return N % 2 == 0 ? true : false;
}
long long mod(long long a, long long b) { return (a % b + b) % b; }
int main() {
  int n;
  cin >> n;
  for (int i = 0; i != n; ++i) {
    for (int j = 0; j != n; ++j) {
      int midPoint = n / 2;
      if (j >= abs(midPoint - (i)) &&
          j <= (i <= midPoint ? (midPoint + i) : n - 1 - abs(midPoint - i)))
        cout << "D";
      else
        cout << "*";
    }
    cout << "\n";
  }
  return 0;
}
