counts = [0] * k
for el in s: counts[el%k] += 1

res = min(counts[0], 1)
for i in range(1, k//2+1):
        res += 1 if (i == k-i) else max(counts[i], counts[k-i])

return res