Problem:
Score : 700 points

Problem Statement

You are given an integer N.
Build an undirected graph with N vertices with indices 1 to N that satisfies the following two conditions:

The graph is simple and connected.

There exists an integer S such that, for every vertex, the sum of the indices of the vertices adjacent to that vertex is S.

It can be proved that at least one such graph exists under the constraints of this problem.

Constraints

All values in input are integers.

3 \leq N \leq 100

Input

Input is given from Standard Input in the following format:

N

Output

In the first line, print the number of edges, M, in the graph you made. In the i-th of the following M lines, print two integers a_i and b_i, representing the endpoints of the i-th edge.

The output will be judged correct if the graph satisfies the conditions.

Sample Input 1

3

Sample Output 1

2
1 3
2 3

For every vertex, the sum of the indices of the vertices adjacent to that vertex is 3.

Solution in Ruby (2.3.3) (judge verdict: Accepted)

N = gets.to_i

def get_divider(n)
	(2..n).each{|i|
		if n % i == 0
			return i
		end
	}
end

def divide(i, s)
	list = []
	items = (1..i).to_a
	
	while n = items.pop
		sum = n
		l = [n]
		while sum < s
			j = items.length - 1
			while j >= 0
				if items[j] <= s - sum
					break
				end
				j -= 1
			end
			if j >= 0
				item = items[j]
				sum += item
				l << item
				items.delete_at(j)
			else
				puts "error"
				exit
			end
		end
		list << l
	end
	return list
end


sum = (N + 1) * N / 2
n = get_divider(sum)
s = sum / n
list = divide(N, s)

#p list
vs = []

if list.length > 2
	n.times{|i|
		l1 = list[i - 1]
		l2 = list[i]
		
		l1.each{|v1|
			l2.each{|v2|
				vs << [v1, v2]
			}
		}
	}
else
	l1 = list[0]
	l2 = list[1]
	
	l1.each{|v1|
		l2.each{|v2|
			vs << [v1, v2]
		}
	}
end
puts vs.length
vs.each{|v1, v2|
	puts "#{v1} #{v2}"
}