Consider \(13\) marbles that are labeled with positive integers such that the product of all \(13\) integers is \(360\). Moor randomly picks up \(5\) marbles and multiplies the integers on top of them together, obtaining a single number. What is the maximum number of different products that Moor can obtain?

Let's think step by step and output the final answer within \boxed{}.
user