5. In a $3 \times 3$ table, the following numbers are written:

| 10 | 20 | 40 |
| :---: | :---: | :---: |
| 32 | 61 | 91 |
| 100 | 1000 | 2000 |

It is allowed to swap any two numbers in one move. What is the minimum number of moves required to achieve that the sum of the numbers in each column is divisible by $3 ?$