#include <bits/stdc++.h>
using namespace std;
int subarraysDivisible(vector<int>&arr, int n , int k){
unordered_map<int,int>mpp;
mpp[0]++;
int ans = 0;
int prefixSum = 0;
for(int i=0;i<n;i++){
prefixSum += arr[i];
int x = ((prefixSum % k) + k)%k; // to handle negative
ans += mpp[x];
mpp[x]++;
}
return ans;
}
int main() {
int n;
cin>>n;
vector<int>arr(n);
for(int i=0;i<n;i++){
cin>>arr[i];
}
int k;
cin>>k;
cout<<"Number of Subarrays divisible by k : "<<subarraysDivisible(arr,n,k);
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgc3ViYXJyYXlzRGl2aXNpYmxlKHZlY3RvcjxpbnQ+JmFyciwgaW50IG4gLCBpbnQgayl7Cgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+bXBwOwoJbXBwWzBdKys7CglpbnQgYW5zID0gMDsKCQoJaW50IHByZWZpeFN1bSA9IDA7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQlwcmVmaXhTdW0gKz0gYXJyW2ldOwoJCWludCB4ID0gKChwcmVmaXhTdW0gJSBrKSArIGspJWs7ICAgIC8vIHRvIGhhbmRsZSBuZWdhdGl2ZSAKCQlhbnMgKz0gbXBwW3hdOwoJCW1wcFt4XSsrOwoJfQoJcmV0dXJuIGFuczsKfQoKaW50IG1haW4oKSB7CglpbnQgbjsKCWNpbj4+bjsKCXZlY3RvcjxpbnQ+YXJyKG4pOwoJZm9yKGludCBpPTA7aTxuO2krKyl7CgkJY2luPj5hcnJbaV07Cgl9CgkKCWludCBrOwoJY2luPj5rOwoJCgljb3V0PDwiTnVtYmVyIG9mIFN1YmFycmF5cyBkaXZpc2libGUgYnkgayA6ICI8PHN1YmFycmF5c0RpdmlzaWJsZShhcnIsbixrKTsKCXJldHVybiAwOwp9