#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

typedef long long ll;
typedef modint998244353 mint;
const int MOD = 1000000007;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int inf = 1 << 30;
const ll INF = 1LL << 60;
const int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
const int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
template <class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

int main(){
    ll n, m;
    cin >> n >> m;

    if(m == 1){
        cout << 1 << endl;
        return 0;
    }

    map<ll, int> mp;
    rep(i, n){
        ll a;
        cin >> a;
        mp[a % m]++;
    }

    vector<pair<int, ll>> vec;
    for(auto it = mp.begin(); it != mp.end(); it++){
        vec.push_back({it->second, it->first});
    }

    sort(all(vec));
    reverse(all(vec));

    int ans = 0;
    set<ll> st;
    rep(i, vec.size()){
        if(vec[i].second == 0) ans++;
        else if(m % 2 == 0 && vec[i].second == m / 2) ans++;
        else if(!st.count(m - vec[i].second)){
            ans += vec[i].first;
            st.insert(vec[i].second);
        }
    }

    cout << ans << endl;

    return 0;
}