import java.util.Arrays;
import java.util.Comparator;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		Data []d = new Data[n];
		for(int i = 0; i < n; i++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			d[i] = new Data(A, B, (double)A / B);
		}
		sc.close();
		Arrays.sort(d, new MyComparator());
		for(int i = 0; i < n; i++) {
			System.out.printf("%d %d\n", d[i].A, d[i].B);
		}
	}
	static class Data{
		int A, B;
		double v;
		public Data(int A, int B, double v) {
			this.A = A;
			this.B = B;
			this.v = v;
		}
	}
	static class MyComparator implements Comparator<Data>{
		@Override
		public int compare(Data d1, Data d2) {
			if(d1.v > d2.v) {
				return -1;
			}else if(d1.v < d2.v) {
				return 1;
			}else {
				return 0;
			}
		}
	}
}