Each digit in the number 2001 is placed on a different card. In how many ways can three different cards be selected so that the product of the numbers on those cards is not zero?
<|im_start|>system
You are a helpful assistant.<|im_end|>
<|im_start|>user
Each digit in the number 2001 is placed on a different card. In how many ways can three different cards be selected so that the product of the numbers on those cards is not zero?
Please reason step by step, and put your final answer within \boxed{{}}.<|im_end|>
<|im_start|>assistant

user
0
Each digit in the number 2001 is placed on a different card. In how many ways can three different cards be selected so that the product of the numbers on those cards is not zero?
train