#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <tuple>
#include <bitset>

#define rep(i,n) for(i=0; i<n; ++i)
#define inc_rep(i,a,n) for(i=a; i<n; ++i)
#define dec_rep(i,n,a) for(i=n; i>=a; --i)
#define in(a) cin >> a
#define out(a,b) cout << a << b
#define print_vec(v) for(auto it=v.begin();it!=v.end();++it)cout<<*it <<" ";cout<<endl
#define print_vec2d(v) for(int i=0;i<v.size();++i){for(int j=0;j<v[i].size();++j)cout<<v[i][j]<<" ";cout<<endl;}cout<<endl
using namespace std;
using lint = long long;

int main(void){
    lint i, j, k, cnt=0, x, y;
    lint p, n, m;
    in(n); in(m);
    vector<lint> rem(n);
    vector<pair<lint,lint> > cnt_rem;
    rep(i,n){
        lint inp; in(inp);
        rem[i]=inp%m;
    }
    sort(rem.begin(),rem.end());
    i=0;
    while(i<n){
        cnt=0;
        lint temp=rem[i];
        inc_rep(i,i,n){
            if(temp!=rem[i])    break;
            cnt++;
        }
        cnt_rem.push_back(make_pair(temp,cnt));
    }
    cnt=0;
    i=0; j=cnt_rem.size()-1;
    lint elem_i, cnt_i, elem_j, cnt_j;
    while(i<j){
        tie(elem_i, cnt_i)=cnt_rem[i];
        tie(elem_j, cnt_j)=cnt_rem[j];
        if(elem_i==0){
            cnt++;
            i++;
        }
        else if(elem_i+elem_j==m){
            cnt+=max(cnt_i,cnt_j);
            i++; j--;
        }
        else if(elem_i>m-elem_j){
            cnt+=cnt_j;
            j--;
        }
        else if(elem_i<m-elem_j){
            cnt+=cnt_i;
            i++;
        }
    }
    if(m%2==0&&cnt_rem[i].first==m/2)   cnt++;
    if(n==1)    cnt=1;
    out(cnt,endl);
    return 0;
}