This article deals with the problem of "chore division", first posed by Martin Gardner, and dual to the Steinhaus' problem of how to cut a cake fairly. In this paper, we provide the first bounded 4-person procedure for envy-free chore division. It requires no more than 15 cuts.