#include <bits/stdc++.h>
using namespace std;
 
int solve(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;
	int arr[n];
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
 
	int k;
	cin>>k;
 
	cout<<"Number of subarrays divisible by k are : "<<solve(arr,n,k);
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgc29sdmUoaW50IGFycltdICwgaW50IG4gLCBpbnQgayl7Cgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+bXBwOwoJbXBwWzBdKys7CglpbnQgYW5zID0gMDsKCQoJaW50IHByZWZpeFN1bSA9IDA7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQlwcmVmaXhTdW0gKz0gYXJyW2ldOwoJCWludCB4ID0gKChwcmVmaXhTdW0gJSBrKSArIGspJWs7ICAgIC8vIHRvIGhhbmRsZSBuZWdhdGl2ZSAKCQlhbnMgKz0gbXBwW3hdOwoJCW1wcFt4XSsrOwoJfQoJcmV0dXJuIGFuczsKfQoKaW50IG1haW4oKSB7CglpbnQgbjsKCWNpbj4+bjsKCWludCBhcnJbbl07Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQljaW4+PmFycltpXTsKCX0KCQoJaW50IGs7CgljaW4+Pms7CgkKCWNvdXQ8PCJOdW1iZXIgb2Ygc3ViYXJyYXlzIGRpdmlzaWJsZSBieSBrIGFyZSA6ICI8PHNvbHZlKGFycixuLGspOwoJcmV0dXJuIDA7Cn0=

Ngo0IDUgMCAtMiAtMyAxCjU=

6
4 5 0 -2 -3 1
5