func_code_string: #include <bits/stdc++.h>   const long long M = 1e9 + 7;   const double pi = 3.14159265358979323846;   using namespace std;   long long ans = 1;   vector<long long> adj[2005];   long long vis[200005] = {0};   void dfs(long long x) {     vis[x] = 1;     for (long long i = 0; i < adj[x].size(); i++) {       if (vis[adj[x][i]] == 0) dfs(adj[x][i]);     }   }   bool prime(long long n) {     if (n <= 2)       return false;     else {       for (long long i = 2; i <= sqrt(n); i++) {         if (n % i == 0) {           return false;         }       }       return true;     }   }   signed main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     long long t = 1;     while (t--) {       long long n;       cin >> n;       for (long long i = 0; i < n; i++) {         if (i % 2 == 0) {           for (long long j = 0; j < n; j++) {             if (j % 2 == 0)               cout <<  W ;             else               cout <<  B ;           }           cout <<   n ;         } else {           for (long long j = 0; j < n; j++) {             if (j % 2 == 0)               cout <<  B ;             else               cout <<  W ;           }           cout <<   n ;         }       }     }     return 0;   }   