Leo Jr. draws pictures in his notebook with checkered sheets (that is, each sheet has a regular square grid printed on it). We can assume that the sheets are infinitely large in any direction.

To draw a picture, Leo Jr. colors some of the cells on a sheet gray. He considers the resulting picture beautiful if the following conditions are satisfied:



 The picture is connected, that is, it is possible to get from any gray cell to any other by following a chain of gray cells, with each pair of adjacent cells in the path being neighbours (that is, sharing a side).

 Each gray cell has an even number of gray neighbours.

 There are exactly $n$ gray cells with all gray neighbours. The number of other gray cells can be arbitrary (but reasonable, so that they can all be listed).

Leo Jr. is now struggling to draw a beautiful picture with a particular choice of $n$. Help him, and provide any example of a beautiful picture.

To output cell coordinates in your answer, assume that the sheet is provided with a Cartesian coordinate system such that one of the cells is chosen to be the origin $(0, 0)$, axes $0x$ and $0y$ are orthogonal and parallel to grid lines, and a unit step along any axis in any direction takes you to a neighbouring cell.


-----Input-----

The only line contains a single integer $n$ ($1 \leq n \leq 500$) — the number of gray cells with all gray neighbours in a beautiful picture.


-----Output-----

In the first line, print a single integer $k$ — the number of gray cells in your picture. For technical reasons, $k$ should not exceed $5 \cdot 10^5$.

Each of the following $k$ lines should contain two integers — coordinates of a gray cell in your picture. All listed cells should be distinct, and the picture should satisdfy all the properties listed above. All coordinates should not exceed $10^9$ by absolute value.

One can show that there exists an answer satisfying all requirements with a small enough $k$.


-----Example-----
Input
4

Output
12
1 0
2 0
0 1
1 1
2 1
3 1
0 2
1 2
2 2
3 2
1 3
2 3



-----Note-----

The answer for the sample is pictured below:

 [Image]

Difficulty: interview

Starter code:

Solutions:
n = int(input())
print(n*3+4)
print(0, 0)
print(1, 0)
for i in range(n):
    for j in range(3):
        print(i+j, i+1)
print(n, n+1)
print(n+1, n+1)


import sys
input = sys.stdin.readline
n=int(input())
print(3*n+4)
print(0,0)
for i in range(n+1):
    print(i+1,i+1)
    print(i,i+1)
    print(i+1,i)

from collections import defaultdict as dd
from collections import deque
import bisect
import heapq

def ri():
    return int(input())

def rl():
    return list(map(int, input().split()))


def solve():
    n = ri()
    k = 7 + 3 * (n - 1)
    print (k)
    print(0, 0)
    print(0, 1)
    for i in range(1, n + 1):
        print(i, i - 1)
        print(i, i)
        print(i, i + 1)
    print(n + 1, n)
    print(n + 1, n + 1)






mode = 's'

if mode == 'T':
    t = ri()
    for i in range(t):
        solve()
else:
    solve()


import sys
input = sys.stdin.readline

n=int(input())

ANS=[(0,0),(0,1),(1,0),(1,1)]

for i in range(n):
    ANS.append((i+1,i+2))
    ANS.append((i+2,i+1))
    ANS.append((i+2,i+2))

print(len(ANS))
for x,y in ANS:
    print(x,y)


n=int(input())
print(3*n+4)
print(0)
print(0)
print(1)
print(0)
for i in range(n):
    for j in range(3):
        print(i+j)
        print(i+1)
print(n)
print(n+1)
print(n+1)
print(n+1)

def solve():
    n = int(input())
    print(3 * (n + 1) + 1)
    for i in range(n + 1):
        print(i, i)
        print(i + 1, i)
        print(i, i + 1)
    print(n + 1, n + 1)


solve()


# n, k = map(int, input().split())
n = int(input())
print(3 * n + 4)
print(0, 0)
for x in range(n + 1):
    print(x + 1, x)
    print(x + 1, x + 1)
    print(x, x + 1)


for _ in range(1):
    # a, b, n = map(int, input().split())
    k = int(input())
    # arr = list(map(int, input().split()))
    arr = [(0, 0), (0, 1)]
    c = [0, 0]
    for i in range(k):
        c[0] += 1
        c[1] += 1
        arr.append([c[0], c[1] - 1])
        arr.append([c[0], c[1]])
        arr.append([c[0], c[1] + 1])
    arr.append([c[0] + 1, c[1]])
    arr.append([c[0] + 1, c[1] + 1])
    print(len(arr))
    for el in arr:
        print(*el)

def read_int():
    return int(input())


n = read_int()
a = [(i, i + 1) for i in range(n + 1)]
b = [(i, i) for i in range(n + 2)]
c = [(i + 1, i) for i in range(n + 1)]
s = a + b + c
print(len(s))
print('\n'.join([str(x[0]) + " " + str(x[1]) for x in s]))



n = int(input())

ans = [ [0,0] , [0,1] , [1,0] , [1,1]]

p = 1

for i in range(n):

    p += 1
    ans.append( [p,p])
    ans.append( [p,p-1]  )
    ans.append( [p-1,p])
    
print(len(ans))

for i in ans:

    print(*i)


import sys

def minp():
	return sys.stdin.readline().strip()

def mint():
	return int(minp())

def mints():
	return list(map(int, minp().split()))

def solve():
	n = mint()
	print((n+1)*3+1)
	for i in range(n+1):
		print(i,i)
		print(1+i,i)
		print(i,1+i)
	print(n+1,n+1)

#for i in range(mint()):
solve()