A question from boss

Can one efficiently enumerate the orbits of all n-bit Boolean functions under the $S_n$ action (i.e. listing one element from each orbit)?