Работа в массивами Python

n = int(input())
f = []
x = y = 1
while y <= n:
    x, y = y, x+y
    f.append(x)
for i in f[::-1]:
    print(int(n >= i), end='')
    if n >= i:
        n -= i

num = int(input())
fib = [0, 1, 1]
fib1 = fib2 = 1
while num > fib2 :
    fib1, fib2 = fib2, fib1 + fib2
    fib.append(fib2)
print(*fib)
res = ''
if num == fib[-1] :
    res = "1" + "0" * (len(fib) - 3)
    num = 0
else :
    fib.pop()
while num > 0 :
    if fib[-1] <= num :
        res += "1"
        num -= fib.pop()
        res += "0"
        fib.pop()
    else :
        res += "0"
        fib.pop()
    if not num :
        res += "0" * (len(fib) - 2)
        break
print(res)

fib = []
fib.insert(0,1)
fib.insert(1,2)
fib1 = 1
fib2 = 2
n = 20
e = 0
while e < n - 3:
    fib_sum = fib1 + fib2
    fib1 = fib2
    fib2 = fib_sum
    e = e + 1
    fib.append(fib2)
#print('fib: ', fib)
 
 
#f = int(input())
f=5
if f == 1:
    print(1)
elif f==2:
    print(10)
    
import random
Z = []
while f != sum(Z):
    z = random.choice(fib)
    if z < f:
        Z.append(z)
    if sum(Z)>f:
     Z.clear()
    Z = list(set(Z))
else: 
    Z.sort()
    #print('Z: ', Z)
 
 
 
M = max(Z)
#print('number_max: ', M)
 
i = fib.index(M)
#i += 1
#print('quantity: ', i)
 
 
O = [int(x in Z) for x in fib]
#print(O)
 
del O[i+1:-1]
del O[i+1]
#print(O)
 
O.reverse()
#print(O)
print ("".join(map(str, O)))