RSA relies on the difficulty of the factorisation of the modulus N. If the prime factors can be deduced, then we can calculate the Euler totient of N and thus decrypt the ciphertext.

Given $N = p \cdot q$ and two primes:

p = 857504083339712752489993810777
q = 1029224947942998075080348647219

What is Euler's totient $\phi(N)$?