def MillerRabin_64bit(x):
    if x <= 1:
        return False
    if x == 2:
        return True
    if x % 2 == 0:
        return False
    if x < 1 << 30:
        test = [2, 7, 61]
    else:
        test = [2,325,9375,28178,450775,9780504,1795265022]
    s = 0
    d = x - 1
    while d & 1 == 0:
        s += 1
        d >>= 1
    for i in test:
        if x <= i:
            return True
        y = pow(i,d,x)
        if y == 1 or y == x - 1:
            continue
        c = 0
        for j in range(s-1):
            y = y * y % x
            if y == x - 1:
                c = 1
                break
        if not c:
            return False
    return True
x = int(input())
if x == 1:
    print(2)
    print(1,2)
    print('b g')
    exit()
a = []
z = 0
for i in range(2,2*10**5):
    if MillerRabin_64bit(i) == False:
        continue
    while x % i == 0:
        if i == 2:
            z += 1
        else:
            a.append(i)
        x //= i

if x != 1:
    exit(print(-1))
ans = 0

while z >= 2:
    a.append(4)
    z -= 2
if z == 1:
    a.append(2)
ans = sum(a) + len(a)
if ans > 2*10**5:
    exit(print(-1))
x = len(a)
print(ans)
cnt = len(a)
for i in range(len(a)):
    for j in range(a[i]):
        print(i+1,cnt+1)
        cnt +=1 
q = []
for i in range(len(a)):
    q.append('b')
for i in range(sum(a)):
    q.append('g')
print(*q)