# Thrifty numbers Part 2

**Logic**Level 2

\[ \large{ \square \, + \, \square \, = \, \square \\ \square \, - \, \square \, = \, \square \\ \square \, \times \, \square \, = \, \square \\ \square \, \div \, \square \, = \, \square \\ } \]

Given that the integers \(0,1,2,\ldots,9\) are to be filled in all the twelve square boxes above such that all four equations above are satisfied.

What is the minimum possible distinct number of integers used?

**Details and Assumptions**

You can use the same integer more than once.

You are not required to use all nine integers.

Each square box can only fill in exactly one digit.