Printing Pattern Using Loops

Source: HackerRank

Version: Phuoc Hung OJ Extended

Problem Statement

Given $n$, print a $(2n-1)$-by-$(2n-1)$ square. Each cell on the outer border contains $n$; values decrease by one at each concentric layer until the central value is 1. Adjacent numbers are separated by one space, with no trailing spaces.

Input

One line contains integer $n$.

Output

Print exactly $2n-1$ rows.

Subtasks

• Subtask 1 (20%): $1\le n\le 3$.

• Subtask 2 (30%): $1\le n\le 7$.

• Subtask 3 (50%): $1\le n\le 15$.

Examples

Example 1

Input:

2

Output:

2 2 2
2 1 2
2 2 2

Explanation:

The square has side length 3; outer cells contain 2 and the center contains 1.

Example 2

Input:

1

Output:

1

Explanation:

The square has side length 1; outer cells contain 1 and the center contains 1.