import java.util.List;
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static void main
(String[] args
) { Scanner in = new Scanner(inputStream);
ABCDEF solver = new ABCDEF();
solver.solve(1, in, out);
out.close();
}
}
class ABCDEF {
public void solve
(int testNumber, Scanner in,
PrintWriter out
) { int n;
n = in.nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = in.nextInt();
}
ArrayList<Integer> left = new ArrayList<Integer>(1000000);
ArrayList<Integer> right = new ArrayList<Integer>(1000000);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
for (int k = 0; k < n; k++) {
left.add(a[i] * a[j] + a[k]);
if (a[i] != 0) {
right.add(a[i] * (a[j] + a[k]));
}
}
}
}
int lIndex = 0, rIndex = 0;
int res = 0;
while (lIndex < left.size() && rIndex < right.size()) {
if (left.get(lIndex) == right.get(rIndex)) {
int lSize = 0, lEl = left.get(lIndex);
int rSize = 0, rEl = right.get(rIndex);
do {
++lSize;
++lIndex;
} while (lIndex < left.size() && left.get(lIndex) == lEl);
do {
++rSize;
++rIndex;
} while (rIndex < right.size() && right.get(rIndex) == rEl);
res += lSize * rSize;
} else if (left.get(lIndex) < right.get(rIndex)) {
++lIndex;
} else {
++rIndex;
}
}
out.println(res);
}
}