import Data.List
 
factor :: Integer -> [Integer]
factor 1 = []
factor n = let prime = head $ dropWhile ((/= 0) . mod n) [2 .. n]
           in (prime :) $ factor $ div n prime
 
count :: Eq a => [a] -> [(a, Int)]
count xs = map (\l -> (head l, length l)) $ group xs
 
p :: Integer -> Double
p nInt = 1/n * product fractions
    where
        fractions = map fraction factors
        fraction :: (Double, Int) -> Double
        fraction (pi, ri) = (pi + fromIntegral ri * (pi - 1)) / pi
        factors = map (\(p, r) -> (fromIntegral p, fromIntegral r)) $
                      count (factor nInt)
        n = fromIntegral nInt
 
main :: IO ()
main = print $ map p [1..10]

aW1wb3J0IERhdGEuTGlzdAoKZmFjdG9yIDo6IEludGVnZXIgLT4gW0ludGVnZXJdCmZhY3RvciAxID0gW10KZmFjdG9yIG4gPSBsZXQgcHJpbWUgPSBoZWFkICQgZHJvcFdoaWxlICgoLz0gMCkgLiBtb2QgbikgWzIgLi4gbl0KICAgICAgICAgICBpbiAocHJpbWUgOikgJCBmYWN0b3IgJCBkaXYgbiBwcmltZQoKY291bnQgOjogRXEgYSA9PiBbYV0gLT4gWyhhLCBJbnQpXQpjb3VudCB4cyA9IG1hcCAoXGwgLT4gKGhlYWQgbCwgbGVuZ3RoIGwpKSAkIGdyb3VwIHhzCgpwIDo6IEludGVnZXIgLT4gRG91YmxlCnAgbkludCA9IDEvbiAqIHByb2R1Y3QgZnJhY3Rpb25zCiAgICB3aGVyZQogICAgICAgIGZyYWN0aW9ucyA9IG1hcCBmcmFjdGlvbiBmYWN0b3JzCiAgICAgICAgZnJhY3Rpb24gOjogKERvdWJsZSwgSW50KSAtPiBEb3VibGUKICAgICAgICBmcmFjdGlvbiAocGksIHJpKSA9IChwaSArIGZyb21JbnRlZ3JhbCByaSAqIChwaSAtIDEpKSAvIHBpCiAgICAgICAgZmFjdG9ycyA9IG1hcCAoXChwLCByKSAtPiAoZnJvbUludGVncmFsIHAsIGZyb21JbnRlZ3JhbCByKSkgJAogICAgICAgICAgICAgICAgICAgICAgY291bnQgKGZhY3RvciBuSW50KQogICAgICAgIG4gPSBmcm9tSW50ZWdyYWwgbkludAoKbWFpbiA6OiBJTyAoKQptYWluID0gcHJpbnQgJCBtYXAgcCBbMS4uMTBd