This problem is based on a code using two different prime numbers
less than 10. You'll need to multiply them together and shift the
alphabet forwards by the result. Can you decipher the code?
Suppose you are a bellringer. Can you find the changes so that,
starting and ending with a round, all the 24 possible permutations
are rung once each and only once?