Chess board
Statement
Goal
Generate the output corresponding to the input given.Input
The input contains a single integer n
Output
Print n lines
Constraints
1 ≤ n ≤ 20
Example
Input
3
Output
101 010 101
Game modes
Reverse
Test cases
Threesome Test
Input
3
Output
101
010
101
Small one Validator
Input
1
Output
1
Even this one Test
Input
2
Output
01
10
squarify Validator
Input
4
Output
0101
1010
0101
1010
Prime example Test
Input
7
Output
1010101
0101010
1010101
0101010
1010101
0101010
1010101
Primer example Validator
Input
9
Output
101010101
010101010
101010101
010101010
101010101
010101010
101010101
010101010
101010101
A little bigger Test
Input
10
Output
0101010101
1010101010
0101010101
1010101010
0101010101
1010101010
0101010101
1010101010
0101010101
1010101010
The biggest Validator
Input
16
Output
0101010101010101
1010101010101010
0101010101010101
1010101010101010
0101010101010101
1010101010101010
0101010101010101
1010101010101010
0101010101010101
1010101010101010
0101010101010101
1010101010101010
0101010101010101
1010101010101010
0101010101010101
1010101010101010
prime 3 Test
Input
5
Output
10101
01010
10101
01010
10101
prime 5 Validator
Input
11
Output
10101010101
01010101010
10101010101
01010101010
10101010101
01010101010
10101010101
01010101010
10101010101
01010101010
10101010101
Solution language
Solution
Stub generator input