void Sort_array(int Tab[], int Last) {
   unsigned char Swap;
   int Temp;
   int I;
   do {
      Swap = 0;
      for (I = 0; I<Last; I++)
  if (Tab[I] > Tab[I+1]) {
     Temp = Tab[I];
     Tab[I] = Tab[I+1];
     Tab[I+1] = Temp;
     Swap = 1;
     }
      }
   while (Swap);
}

int Tab[100];
void main (void) {
   int I;
   int J;
   int K;
   int L;
for (L = 0; L < 1000; L++) {
   K = 0;
   for (I = 9; I >= 0; I--)
      for (J = I*10; J < (I+1)*10; J++)
  Tab[K++] = J&1 ? J+1 : J-1;
   Sort_array(Tab,99);
}
      exit(0);
}
