#include using namespace std; typedef long long int ll; typedef pair P; typedef vector VI; typedef vector VVI; #define REP(i,n) for(ll i=0;i<(n);i++) #define ALL(v) v.begin(),v.end() template bool chmax(T &x, const T &y) {return (x bool chmin(T &x, const T &y) {return (x>y)?(x=y,true):false;}; constexpr ll MOD=998244353; constexpr ll INF=2e18; int main(){ ll n, m; cin >> n >> m; VI a(n); REP(i,n) cin >> a[i]; map mp; REP(i,n) mp[a[i]%m]++; set used; int ans=0; for(auto p:mp){ if(p.first==0){ ans+=min(1,p.second); continue; } if(used.find(min(p.first,m-p.first))!=used.end()) continue; used.insert(min(p.first,m-p.first)); ans+=max(p.second,mp[m-p.first]); } cout << ans << endl; return 0; }