Extend Euclid Algorithm with matrix inverse mod N

Question

I am implementing an extended Eucilid algorithm with matrix mod N. This is my code implementation:

def eea(a, b):
    if not isinstance(a, int) o