import sys

N = 1542201487980564464479858919567403438179217763219681634914787749213

def mod_pow(a, k, n):
    if k == 0:
        return 1
    elif k % 2 == 0:
        return mod_pow(a, k // 2, n) ** 2 % n
    else:
        return (mod_pow(a, k - 1, n) * a) % n

if __name__ == "__main__":
    try:
        sys.setrecursionlimit(10000)
        N2 = N**9

        print('Calculated N2')
        a = mod_pow(23, N2, N)
        print("Try block finished correctly")
    except:
        print('something happened')
    finally:
        print('This is the finally block')