Thor, Rocket, and Groot arrive on Wakanda to reinforce the Avengers. Thanos has divided his army into n squads (n is even). Each i-th squad has ai outriders. Rocket with his weapons and Thor with his newly forged Stormbreaker, have decided to make alternate moves to kill the outriders, with Rocket taking the first shot. On each of their turns, they must choose exactly `n/2` non-empty squads and independently kill some number of outriders from each of the chosen squads. They can remove a different number of outriders from the different squads in a single turn. The first person unable to make the kill is regarded as the loser in their challenge (i.e When there are less than`n/2` nonempty squads). Each squad, in the beginning, can have outriders `le 15` and `gt 0`. If Thor lands the last attack, what is the minimum and maximum sum of a, b, c, d? Outriders in the Squads 8, 15, 8, 13, 8, 15, a, b, c, d