import Data.Ratio

main = putStr (show result)

result = foldl merge [] (rows 5)

rats n k = map ((%) k) [n, n-1..k+1]

rows n = map (rats n) [1..n]

merge [] s2 = s2
merge s1 [] = s1
merge (s1:s1s) (s2:s2s) 
    | s1 < s2   = s1 : (merge s1s      (s2:s2s))
    | s1 > s2   = s2 : (merge (s1:s1s) s2s)
    | otherwise = s1 : (merge s1s      s2s)

int *numerators = new int[N];
for(int i=0; i<N; ++i) numerators[i] = 1;

while(true){
  int min = 0;
  for(int i=0; i<N; ++i){
    if(numerators[i]*(min+1) < numerators[min]*(i+1)) min = i;
  }
  if(numerators[min] == (min+1)) break;

  std::cout << numerators[min] << '/' << (min+1) << std::endl;

  while(GCD(numerators[min], min+1)!=1 && numerators[min]!=(min+1)) ++numerators[min];
}

delete[] numerators;