3-Dimensional Matching

Problem Definition

Given sets $X,Y,Z$, each of size $n$, and a set $T\subset X\times Y\times Z$ of order triplets. Is there a set of $n$ triplets in $T$ such that each element is contained in exactly one triplet?