import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
INF = 2 ** 63 - 1
mod = 998244353

from collections import Counter


n, m = mi() 

a = li()

C = Counter()

for v in a:
    C[v % m] += 1

ans = 0
s = set()
for c, v in C.items():
    if c in s or m - c in s: continue
    if c == 0:
        s.add(c)
        ans += 1
    elif m % 2 == 0 and c == m // 2:
        s.add(c)
        ans += min(v, 1)
    else:
        s.add(c)
        s.add(m - c)
        if v > C[m - c]:
            ans += v
        else:
            ans += C[m - c]
    
print(ans)