We prove that every strong $n$-partite $(n\geq 3)$ tournament has at least $(n-2)$ 3-cycles. This generalizes the results of [1] and [2] corresponding to ordinary and 3-partite tournaments.