Codeforces Beta Round #89 (Div. 2) B. Present from Lena

B. Present from Lena

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Vasya's birthday is approaching and Lena decided to sew a patterned handkerchief to him as a present. Lena chose digits from 0 to n as the pattern. The digits will form a rhombus. The largest digit n should be located in the centre. The digits should decrease as they approach the edges. For example, for n = 5 the handkerchief pattern should look like that:

          0
        0 1 0
      0 1 2 1 0
    0 1 2 3 2 1 0
  0 1 2 3 4 3 2 1 0
0 1 2 3 4 5 4 3 2 1 0
  0 1 2 3 4 3 2 1 0
    0 1 2 3 2 1 0
      0 1 2 1 0
        0 1 0
          0

Your task is to determine the way the handkerchief will look like by the given n.

Input

The first line contains the single integer n (2 ≤ n ≤ 9).

Output

Print a picture for the given n. You should strictly observe the number of spaces before the first digit on each line. Every two adjacent digits in the same line should be separated by exactly one space. There should be no spaces after the last digit at the end of each line.

Sample test(s)

Input

2

Output

    0
  0 1 0
0 1 2 1 0
  0 1 0
    0

Input

3

Output

      0
    0 1 0
  0 1 2 1 0
0 1 2 3 2 1 0
  0 1 2 1 0
    0 1 0
      0

#include <iostream>
#include <sstream>
#include <iomanip>
#include <vector>
#include <deque>
#include <list>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <bitset>
#include <string>
#include <numeric>
#include <algorithm>
#include <functional>
#include <iterator>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <complex>
#include <ctime>
#define INF 0x3f3f3f3f
#define eps 1e-6
#define p(x) printf("%d\n", x)
#define k(x) printf("Case %d: ", ++x)
#define mes(x, d) memset(x, d, sizeof(x))
#define s(x) scanf("%d", &x)

/*
int gcd(int a,int b)
{
    return ! b ? a : gcd(b,a % b);
}


struct data
{
    int val;
    int pos;
    int ranks;
}p[2005];

bool cmp1(const data &a,const data &b)
{
    if(a.val == b.val)
        return a.pos < b.pos;
    return a.val < b.val;
}
bool cmp2(const data &a,const data &b)
{
    return a.val > b.val;
}
bool cmp3(const data &a,const data &b)
{
    return a.pos < b.pos;
}
*/
typedef long long LL;

const double pi = acos(-1.0);
const long long mod = 1e9 + 7;

using namespace std;


int main()
{
    //freopen("int.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int N;
    scanf("%d",&N);
    for(int i = 0;i < 2 * N + 1;i++)
    {
        int j = i,k;
        if(j >= N)
            j = 2 * N - i;
        for(k = 0;k < N - j;k++)
            printf("  ");
        if(j)
        {
            for(k = 0;k <= j;k++)
                printf("%d ",k);
            for(k = j - 1;k > 0;k--)
                printf("%d ",k);
        }
        puts("0");
    }
    return 0;
}