Cryptography Math, RSA Algorithm cipher and deciphering

[Avenger22]

1. Given (n=989,e=853) Find C=? Cipher value, c=m^e modn, m=c^d mod ϕ(n),
2. other way around decipher it, given c=953 find m=? where m=c^d mod ϕ(n), and d=e^-1 mod ϕ(n), problem is the numbers are so large unless i use a program to give me modulus directly in pc hard to compute using some method to break it down or maybe there is a easier answer, help would be very appreciated.

ϕ(n) = ϕ(p) * ϕ(q) and ϕ(p) = p - 1 etc where q,p are prime numbers etc
So basically either you are given n,e find c, or given c you have to find the message before deciphering it finding m