#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define rrep(i,n) for(int i=n-1;i>=0;--i)
#define debug(output) if(debugFlag)cout<<#output<<"= "<<output<<"\n";
using lint = long long;
typedef pair<int,int> P;
const bool debugFlag=true;
const lint linf=1.1e18;const int inf=1.01e9;
constexpr int MOD=1000000007;
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(a > b){ a = b; return 1; } return 0; }

signed main(){
    lint n,m;cin>>n>>m;
    vector<lint> a(n);
    rep(i,n)cin>>a[i];
    map<lint,lint> mp;
    rep(i,n)mp[a[i]%m]+=1;
    int res=0;
    if(mp[0]>0){
        ++res;
        mp[0]=0;
    }
    for(auto& it:mp){
        int r=m-it.first;
        if(it.first*2==m){
            res+=1;
            continue;
        }
        res+=max(it.second,mp[r]);
        it.second=0;mp[r]=0;
    }
    cout<<res<<"\n";
    return 0;
}