Cyclic sieving, identified in work with Dennis Stanton and Dennis White, is a happy situation, where counting how many among some objects enjoy cyclic symmetry is as easy as $q$-counting all of the objects. We will illustrate this with two kinds of examples: old ones that still plague us with only uninsightful proofs, and new ones that have joined our list of favorites.