Since there is no general theory of Higher Inductive Types, it is useful to construct a large class of complicated HITs using a small class of `trusted' HITs. We present the construction of the propositional truncation and a wide class of (nonrecursive) two-HITs using only a single HIT, which I call the `quotient'. The quotient is a HIT very similar to the homotopy coequalizer.