#include <bits/stdc++.h>   #pragma GCC optimize( unroll-loops )   #pragma GCC optimize( O3 )   #pragma GCC optimize( fast-math )   using namespace std;   const int INF = 1e9;   const long long INFll = 2e18;   const int BASE1 = 179;   const int BASE2 = 653;   const long long MOD = 1e9 + 7;   const int MAXN = 2e5;   const long double PI = 3.1415926535;   const long double EPS = 1e-10;   void solve() {     int n;     cin >> n;     vector<vector<char>> dop(n, vector<char>(n,  * ));     for (int i = 0; i < (n); i++) {       for (int j = 0; j < (n); j++) {         if (abs(i - n / 2) + abs(j - n / 2) <= n / 2) dop[i][j] =  D ;       }     }     for (int i = 0; i < (n); i++) {       for (int j = 0; j < (n); j++) {         cout << dop[i][j];       }       cout <<   n ;     }   }   signed main() {     ios::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     cout << fixed << setprecision(15);     int t = 1;     while (t--) solve();     return 0;   }   