śĪ#:²)      !"#$%&'(Safe&'-.1456=>?DHX_fē)*+None&'-.1456=>?DHX_fk FinA list of exactly n values of type aFinTotally-ordered type with n possible valuesFinEnumerate all values of type  n, in ascending order. Fin Convert to  , modulo n. Fin Convert to +, failing if the argument is out of bounds.FinCBring givenly many elements from the tail of the list to the front.Fin Focalize on the giventh element.Fin(Swap the 2 giventh elements of the list.*,-./0123456789:;<= 5None&'-.1456=>?DHX_f FinSFind the indices of all elements satisfying the given predicate, gathering them in p.None&'-.1456=>?DHX_fN    None&'-.1456=>?DHX_fkkFinPermutation of n elementsVAny permutation can be expressed as a product of transpositions. Ergo, construct with > operations and .Fin%Transposition of the giventh elementsFin4Orbit of the given index under the given permutation FinGAll the cycles of the given permutation, which are necessarily disjoint  ?5@      !"#$% &'()*+,-./001223445667889::;<<=>?@ABFin-0.2.9.0-inplace Data.Fin.ListData.FinData.Fin.PermutationData.ApData.Fin.PrivateNpeano-0.1.0.1-22f5150ec4f6e76a5d3ad971bb1d58c3483e0e704789969331f15c4e8f343175 Data.PeanoPeanoListNil:.FinZeroSuccenuminj₁proj₁lift₁fromFintoFintoFinMayfromListunconsheadtailinitlastreverserotate!!atswap findIndexpred Permutationapplyunapplyorbitcycles$fGroupPermutation$fMonoidPermutation$fFinitePermutation$fUniversePermutation$fSemigroupPermutation$fFunctorStream$fShowPermutation$fEqPermutationApapSunSFlipunFlipTtProj₁ unProj₁Joinā‚‚ unJoinā‚‚JoinunJoinbaseGHC.Base Semigroup:<