백준 24416번 - 알고리즘 수업 - 피보나치 수 1

a_count = 1
b_count = 1

def fibo(n):
  global a_count
  if n==1 or n==2:
    return 1
  else:
    a_count += 1
    return fibo(n-1) + fibo(n-2)

def fibonacci(n):
  global b_count
  f = [1,1] + [0]*(n)
  for i in range(3, n):
    f[i] = f[i-1] + f[i-2]
    b_count += 1
  return f[n]

fibo(n:=int(input()))
fibonacci(n)

print(a_count, b_count)