Assume that with the RSA cryptosystem somebodys phone book entry is (n, e) = (11247661, 268729) and assume you found out that it is very likely that a mod n for all a {0,..., n 1}. Find the prime decomposition of n using this information and the deciphering key (n, d) from this information.