#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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;}
//-------------------------------------------------------

int N;
int A[202020];
unordered_map<int,int> M[401];
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) {
		cin>>A[i+1];
	}
	
	ll ret=0;
	for(i=1;i<=min(N,1000);i++) {
		for(j=i+1;j<=N;j++) if((A[i]+A[j])%(i+j)==0) ret++;
	}
	
	for(i=1001;i<=N;i++) {
		for(j=1;i*j<=400000;j++) {
			M[j][A[i]-i*j]++;
		}
	}
	for(i=1001;i<=N;i++) {
		for(j=1;i*j<=400000;j++) {
			x=A[i]-i*j;
			M[j][A[i]-i*j]--;
			ret+=M[j][-x];
		}
	}
	cout<<ret<<endl;
	
	
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}