Input: An integer 0 < n < 2^30, taken from stdin.
Output: The Pisano period of n (the length of the cycle of the Fibonacci sequence mod n)
Input is smaller than 2^30 so that intermediate values are all less than 2^31.
Shortest code wins.
Input: 1 Output: 1
Input: 2 Output: 3
Input: 10 Output: 60