#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define ROWS 15 /*number of displaying rows, you can change it as you want*/
/* 
  We restrict arguments of T(a,b) by those integers, that have only first
  100,000 prime numbers in factorization into  prime numbers. 1299709 is the
  100,000-th prime number.
*/
#define maxBits 1299708
int primes[100000]; 
unsigned char bits[maxBits];
int isPrimesInitialized = 0;
int getA325028(int i);
int findOpt(int a, int b);
int engine(int a, int b, int c);
void initPrimes();
int gcd(int a, int b);
int primeDivisors(int a, int *mas1, int *mas2);
int my_round(int a, int b, int down);

int main() {
  int i,j;
  j=1;
  for(i=1;i<=(ROWS+1)*ROWS/2;i++) {
      if (i==(j*(j+1)/2)) {
         printf("%d\n",getA325028(i));
         j++;
      }
      else printf("%d ",getA325028(i));
  }
  return 0;
}

int getA325028(int i) {
  int a,b;
  if (i<=0) {
    printf("Illegal index. Index should be positive integer\n");
    return -1;
  }
  if (isPrimesInitialized==0) {
      initPrimes(); /*initialization of prime numbers table*/
      isPrimesInitialized=1;
  }
  /*
   triangle bijection of the positive integer to an ordered pair
  */
  b=ceil((sqrt(1+8.0*i)-1)/2);
  a=i-1-b*(b-1)/2; 
  return(findOpt(a,b));
}

/*calculation of T(a,b) using all properties*/
int findOpt(int a, int b) 
{
  int lowerBound, upperBound, value, i, k, gcd_val, result;
  float i_float; 
  if (a>=b) return(0);
  if (a==1)  {
    if (b==2) return(1);
    if (b==3) return(2);
    if (b==4) return(2);
    else return(2);
  }
  if (a==0) return(1);
  gcd_val=gcd(a,b);
  if (b-a < a+1) {
    lowerBound = gcd_val;
    upperBound=2*(b-a)-1;
  }
  else {
    if (b>a*a+a) return(a+1);
    lowerBound = floor(((float)(b-a))/(a+1));
    if (gcd_val>lowerBound) lowerBound=gcd_val;
    upperBound=b;
  }
  value=1000000; 
  for (i=lowerBound;i<=upperBound;i++) {
    k=engine(a,b,i);
    if (k<value) value=k;
  }
  return value;
}
/*calculation of F(a,b,c)*/
int engine(int a, int b, int c) {
  int k1, k2, k3, k4;
  k1=my_round(a,c,0);
  k2=my_round(b,c,1);
  k3=abs(c*k1-a);
  k4=abs(c*k2-b);
  return(k3+k4+k2-k1);
}

/*generating of prime numbers with sieve of Eratosthenes*/
void initPrimes() {
  int i, j, pr;
  int current=0, counter=0;
  for(i=0;i<maxBits;i++) bits[i]=1;
  primes[counter]=current+2;
  while(1) {
    for(j=current;j<maxBits;j=j+primes[counter]) {
      bits[j]=0;
    }
    counter++;
    pr=0;
    for(j=current+1;j<maxBits;j++) {
      if (bits[j]==1) {
        pr=1;
        break;
      }
    }
    if (pr==1) {
      current=j;
      primes[counter]=current+2;
    }
    else break;
  }
}

/*calculation of GCD*/
int gcd(int a, int b) {
  int mas1[100000],mas2[100000],mas3[100000],mas4[100000];
  int k1, k2,no,mi,i,j,z;
  k1=primeDivisors(a,mas1,mas2);
  if (k1==0) {
    printf("Fatal error: number is very large %d\n",a);
    exit(1);
  }
  k2=primeDivisors(b,mas3,mas4);
  if (k2==0) {
    printf("Fatal error: number is very large %d\n",b);
    exit(1);
  }
  no=1;
  for(i=0;i<k1;i++) {
   for(j=0;j<k2;j++) {
     if (mas3[j] == mas1[i]) {
       if (mas2[i]<mas4[j]) mi=mas2[i];
       else mi=mas4[j];
       for(z=0;z<mi;z++) no=no*mas1[i]; 
       break;
     }
   } 
  }
  return(no);
}

/*
  factorization of integer into prime factors. mas1 contains factors,
  mas2 contains degrees of factors.
*/
int primeDivisors(int a, int *mas1, int *mas2) 
{
  if (a<2) return(1);
  int k, i, j;
  k=a;
  i=0; j=0;
  while(1) {
    if ((k==1) || (i==100000)) break;
    if (k % primes[i] != 0) {
        i++;
        continue;
    } 
    mas1[j]=primes[i];
    mas2[j]=0;
    while(1) {
      mas2[j]++;
      k=k/primes[i];
      if (k % primes[i] != 0) {
        i++;
        j++;
        break;
      }
    }
  }
  if (k==1) return(j);
  else return(0);
}
 
int my_round(int a, int b, int down) {
  int k1, k2, k3, k4;
  float c;
  c=(float)a/b;
  k1=floor(c);
  k2=ceil(c);
  k3=b*k1;
  k4=b*k2;
  if ((a-k3) < (k4-a)) return(k1);
  else if ((a-k3) > (k4-a)) return(k2);  
  else if (down==1) return(k1);
  else return(k2);
}
/*
rhd(x) = floor(ceil(2*x)/2);

rhu(x) = ceil(floor(2*x)/2);

T(n, k) = {v = vector(n, z, rhd(n/z) - rhu(k/z) + abs(z*rhu(k/z)-k) + abs(z*rhd(n/z)-n)); (vecsort(v, , 1))[1]; }

tabl(13) = for (n=1, 13, for (k=0, n-1, print1(T(n, k), ", ")); print);
*/