Any permutation of a finite set may be written as a product of disjoint cycles. This expression is unique up to the order of the cycles, and cycling terms within cycles. For example, the permutation of {1,…,8} given by 1↦7, 2↦5, 3↦2, 4↦8, 5↦3, 6↦1, 7↦6, 8↦4 can be written as (176)(253)(48) or equally as (532)(84)(761). The order of a permutation is the least common multiple of the length of its cycles, here lcm(3,3,2) = 6.