UVa11387 - The 3-Regular Graph

import java.io.IOException;
import java.io.FileReader;
import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main 
{
	public static final boolean DEBUG = false;
	public static int n;
	
	public static boolean init(BufferedReader cin) throws IOException
	{
		String s = cin.readLine();
		if ("0".equals(s)) return false;
		
		n = Integer.parseInt(s);
		return true;
	}
	
	public static void solve()
	{
		if ((n & 1) != 0 || n <= 2) {
			System.out.println("Impossible");
			return;
		}
		
		int tmp = n / 2;
		System.out.println(tmp * 3);
		
		for (int i = 1; i <= n; i++) {
			System.out.println(i + " " + (i % n + 1));
		}
		
		for (int i = 1; i <= tmp; i++) {
			System.out.println(i + " " + (i + tmp));
		}
	}
	
	public static void main(String[] args) throws IOException
	{
		BufferedReader cin;
		
		if (DEBUG) {
			cin = new BufferedReader(new FileReader("e:\\uva_in.txt"));
		} else {
			cin = new BufferedReader(new InputStreamReader(System.in));
		}
		
		while (init(cin)) {
			solve();
		}
	}
}