import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    private static int n;
    public static int KnightL(int i, int j){
        int steps = 1;
        int last = n - 1;
        int a = i;
        int b = j;
        while(a <= last || b<= last){
            System.out.println("a " + a + " b " + b + " i " + i + " j " + j);
                if(a == last && b == last){
                    break;
                } else {
                    steps++;
                    System.out.println("++");
                }
                a = a+i;
                b = b+j;
        }
                
        System.out.println("--- a " + a + " b " + b );
        if(a>last ||  b> last){
            steps = -1;
        }
        
        System.out.println("FINAL: " + steps);
        return steps;
    }
    
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        n = in.nextInt();
        // your code goes here
        for(int i=1; i<n; i++){
            for(int j=1; j<n; j++){
                KnightL(i,j);
              //System.out.print(KnightL(i,j) + " ");
            }
            System.out.println();
        } 
    }
}