n = int(input())

if n == 1:
    print(1)
elif n == 2:
    print(2)
else:
    a = 1
    b = 2
    for i in range(2,n):
        a,b = b,a+b
    print(b) 

 from collections import Counter
s = input()
d = Counter()
res = 0
for c in s:
    if c=='G':
        d['G']+=1
    if c=='o':
        if d['Go']>0:
            d['Goo']+=1
            d['Go']-=1
            continue
        if d['G'] > 0:
            d['Go'] += 1
            d['G'] -= 1
            continue


    if c=='d':
        if d['Goo']>0:
            res+=1
            d['Goo']-=1
# print(d)
print(res)

N,M = list(map(int,input().split()))
road = []
for i in range(N):
    s = list(map(int,input().split()))
    road.append(s)

tem = []
for i in range(N):
    for j in range(M):
        tem.append([road[i][j],i,j])
tem.sort(key = lambda x:x[0])

state = [[0]*M for _ in range(N)]

for num,i,j in tem:
    up,left,right,down = 0,0,0,0
    if i-1>=0 and road[i-1][j]<num:
        up = state[i-1][j]
    if j+1<=M-1 and road[i][j+1]<num:
        right = state[i][j+1]
    if i+1<=N-1 and road[i+1][j]<num:
        down = state[i+1][j]
    if j-1>=0 and road[i][j-1]<num:
        left = state[i][j-1]
    state[i][j] = 1+max(up,left,right,down)

print(max([max(s) for s in state]))