# フィボナッチ数列（リポジトリ収録アルゴリズムを Python で再現）
def fibonacci(n):
    a, b = 0, 1
    result = []
    for _ in range(n):
        result.append(a)
        a, b = b, a + b
    return result

# 回文判定
def is_palindrome(s):
    s = s.lower().replace(' ', '')
    return s == s[::-1]

print(fibonacci(10))        # [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
print(is_palindrome('racecar'))  # True
print(is_palindrome('hello'))    # False