下面Python代码用于求斐波那契数列，该数列第1、2项为1，以后各项均是前两项之和。函数Fibo()属于( )。

def Fibo(N): 
    if N == 1 or N == 2: 
        return 1 

    fiboList = [1, 1] 
    for i in range(2, N): 
        fiboList.append(fiboList[i - 1] + fiboList[i - 2]) 
    return fiboList[N-1]

def findCoins(coins, Money): 
    coins_used = [] 
    for coin in coins: 
        while Money >= coin: 
        coins_used.append(coin) 
        Money -= coin 
    return coins_used 

coins = [100, 50, 20, 10, 5, 2, 1] #货币种类，单位相同 
M = int(input()) #输入换算的金额 
coins_needed = find_coins(coins, M) 

result = [(c,coins_needed.count(c)) for c in coins] 
result = [x for x in result if x[1] > 0]

def count_if(iterData,*,key=None): 
  if key == None: 
    return len(iterData) 

  Count = 0 
  for i in iterData: 
    Count += bool(key(i)) 
  return Count

def LT(a, b): 
    return a < b 

lstData = list(range(-100,100)) 
print(___________________________)

shzFile = open("水浒传.txt", "r", encoding = "utf-8") 
hlmFile = open("红楼梦.txt", "r", encoding = "utf-8") 
sSet = set(shzFile.read()) 
hSet = set(hlmFile.read()) 
shzFile.close() 
hlmFile.close() 

print(________________________________)

srcStr = input() 

symList = [] #保存回文子字符串 
for i in range(len(srcStr)): 
    for j in range(i + 2, len(srcStr) + 1): 
        subStr = ___________ 
        if subStr == _____________: 
            symList.append(subStr) 

for i in sorted(symList, key = lambda x: len(x)): 
    print(i)

def Sort(lst):     
	for i in range(1, len(lst)): 
        key = lst[i] 
        j = i - 1 
        while j >= 0 and key < lst[j]: 
            lst[j + 1] = lst[j] 
            j -= 1 
        lst[j + 1] = key 
	lst = [4,5,13,2,7,10,1,3,8,11,6,9,12] 
	lst = Sort(lst) 
	print("sorted list:", lst)

def nGram(S,n):
   Result = {}#保存截取字符串及其数量
   for i in range(________________):
   nChar = ________________
   Result[nChar] = Result.get(nChar,0) + 1
return Result

def listPrime(N): 
    primeList = list(range(N+1)) 
    primeList[0] = primeList[1] = False 
    for i in range(2,int(N ** 0.5) + 1): 
        if primeList[i] != False: 
            for j in range(_____________): 
                primeList[j] = False 
    return [x for x in primeList if x != False]

n,ds = map(int,input().split()) 
rst = "" #保存转换结果

digDict = {i:c for i,c in enumerate("0123456789ABCDEF")} 
while n != 0: 
    rst = digDict[n % ds] + rst 
    n //= ds 
print(rst)