Iahub likes chess very much. He even invented a new chess piece named Coder. A Coder can move (and attack) one square horizontally or vertically. More precisely, if the Coder is located at position (*x*, *y*), he can move to (or attack) positions (*x* + 1, *y*), (*x*–1, *y*), (*x*, *y* + 1) and (*x*, *y*–1).

Iahub wants to know how many Coders can be placed on an *n* × *n* chessboard, so that no Coder attacks any other Coder.
The first line contains an integer *n* (1 ≤ *n* ≤ 1000).
#include <bits/stdc++.h>
#include<ctype.h>
#include<string>
#include<algorithm>
#include<sstream>
#include<stdint.h>
#include<list>
using namespace std;
#define ll long long
#define pb push_back 
#define mp make_pair
#define MAX 40000

int main()
	{
		ll n,i,j;
		cin>>n;
		for(i=0;i<n;i++)
			{for(j=0;j<n;j++)
				{if(i%2==0)
					{
						if(j%2==0)
							cout<<"C";
						else
							cout<<".";
					}
				else
					{
						if(j%2)
							cout<<"C";
						else
							cout<<".";
					}
				}
			cout<<"\n";
			}
					
		
	}