how to make algorithm for the second CPF checker code for Python?

Question

while True:

cpf = input("Digite n: ")


novo_cpf = cpf[:-2]
soma_digitos = 0
lista_digitos = []

for key, index in enumerate(novo_cpf):
    key_reverso = len(novo_cpf) + 1 - key
    lista_digitos.append(key_reverso * int(index))
    soma_digitos += lista_digitos[key]

d = 11 - (soma_digitos % 11)

if(d > 9):
    d = 11 - d




print(d)