import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;

public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        long m = sc.nextLong();
        Map<Long, Integer> counts = new HashMap<>();
        while (n-- > 0) {
            long x = sc.nextLong() % m;
            counts.put(x, counts.getOrDefault(x, 0) + 1);
        }
        int ans = 0;
        for (long x : counts.keySet()) {
            if (x * 2 == m || x == 0) {
                ans++;
            } else if (x * 2 < m) {
                ans += Math.max(counts.get(x), counts.getOrDefault(m - x, 0));
            } else {
                ans += counts.containsKey(m - x) ? 0 : counts.get(x);
            }
        }
        System.out.println(ans);
    }
}
class Scanner {
    BufferedReader br;
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
        } catch (Exception e) {
            
        }
    }
    
    public int nextInt() {
        return Integer.parseInt(next());
    }
    
    public long nextLong() {
        return Long.parseLong(next());
    }
    
    public double nextDouble() {
        return Double.parseDouble(next());
    }
    
    public String next() {
        try {
            while (!st.hasMoreTokens()) {
                st = new StringTokenizer(br.readLine());
            }
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            return st.nextToken();
        }
    }
    
}