10 # (ok, i, f) = freadi f
16 # ls = sort [0:read io]
19 one ls = prod $ map length $ group $ sort [3:[b-a\\a<-ls & b<-tl ls]]
21 two ls = prod [blurp !! length l\\l<-group [b-a\\a<-ls & b<-tl ls] | all ((==)1) l]
23 blurp =: let seq a b = [a+b-1:seq b (a+b)] in seq 0 1