Bounds for the counting function of the Jordan-P\'olya numbers.

A positive integer $n$ is said to be a Jordan-Polya number if it can be written as a product of factorials. We obtain non-trivial lower and upper bounds for the number of Jordan-Polya numbers not exceeding a given number $x$.