One set of n objects of type I, another set of n objects of type II, and an amount M of money is to be completely allocated among n agents in such a way that each agent gets one object of each type with some amount of money. We propose a new solution concept to this problem called a perfectly fair allocation. It is a refinement of the concept of fair allocation. As a result, we give a necessary and sufficient condition for the existence of a perfectly fair allocation.