#K68662. Good Fruits Remaining

    ID: 32915 Type: Default 1000ms 256MiB

Good Fruits Remaining

Good Fruits Remaining

You are given an integer T denoting the number of test cases. For each test case, a single integer N represents the total number of fruits. If N > 50, then exactly 5 fruits are spoiled, and the remaining good fruits are N - 5. Otherwise, if N ≤ 50, all fruits are good.

Your task is to compute the number of good fruits for each test case.

Mathematical Formulation:

\( \text{good_fruits}(N) = \begin{cases} N - 5, &\text{if } N > 50 \\ N, &\text{if } N \leq 50 \end{cases} \)

inputFormat

The first line of the input contains a single integer T, representing the number of test cases.

Each of the next T lines contains a single integer N representing the total number of fruits.

outputFormat

For each test case, output a single integer on a new line representing the number of good fruits remaining after accounting for the spoiled fruits.

## sample
4
10
60
51
50
10

55 46 50

</p>