Write a program to compute the complete prime factorization of the input number.

The output should be an ordered sequence of prime divisors of the input along with their multiplicity with largest divisor first.
A divisor and its multiplicity should be enclosed in braces. 

For example, 
on input 42, the output is (7 1) (3 1) (2 1). 
On input 16, the output is (2 4), etc.