Inclusion--Exclusion, Derangements & Pigeonhole · Easy problem

A derangement of $n$ objects is a rearrangement in which no object stays in its original position, and $D_n$ counts the derangements of $n$ objects. Find $D_1$, $D_2$, $D_3$, and $D_4$.