#include<stdio.h>
#include<cstring>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stdlib.h>
#include<set>
#include<map>
#include<utility>
#include<time.h>
#include<queue>
#include<limits.h>
#include<bitset>
#include<stack>
#include<deque>
using namespace std;
typedef vector<int>::iterator vit;
typedef string::iterator sit;
typedef vector<int>::reverse_iterator rvit;
typedef long long ll;
typedef long double ld;
ll lim=1ll*1000*1000*1000;

const bool D=1;
int main()
{
    freopen("test.in","w",stdout);
    int n=2000;
    printf("%d\n",n);
    for(int i=0;i<n;++i)
    {
        for(int j=0;j<n;++j)
        {
            if(i==j)
                printf("0 ");
            else if(i==0||j==0)
                printf("%I64d ",lim/2);
            else
                printf("%I64d ",lim);
        }
        printf("\n");
    }
    /*for(int i=0;i<n;++i)
    {
        for(int j=0;j<n;++j)
            printf("%I64d ",lim);
        printf("\n");
    }*/
    return 0;
}