Use 10 numbers from 0 to 9 to form some prime numbers (each number is used exactly once), what is the minimum sum of these prime numbers?
用0至9这10个数字组成一些质数(每个数字恰好用一次)，这些质数的和最小是多少？
<gadget id="calculator">2 + 3 + 5 + 67 + 89 + 401</gadget>
<output>567</output>

<result>567</result>