package poj1840;
 
import java.util.Scanner;
 
public class POJ1840 {
    static int maxn = 25000000 + 10;
    // 数组太大，不能用int（int型数组1677w左右），用short型数组
    static short hash[] = new short[maxn];
    static int a1, a2, a3, a4, a5;
 
    public static void main(String[] args) {
        int ans, temp;
 
        Scanner scanner = new Scanner(System.in);
        a1 = scanner.nextInt();
        a2 = scanner.nextInt();
        a3 = scanner.nextInt();
        a4 = scanner.nextInt();
        a5 = scanner.nextInt();
        ans = 0;
        for (int i = -50; i <= 50; i++)
            for (int j = -50; j <= 50; j++) {
                if (i == 0 || j == 0) continue;
                temp = (a1 * i * i * i + a2 * j * j * j) * (-1);
                if (temp < 0)
                    temp = temp + maxn;
                hash[temp]++;
            }
        for (int i = -50; i <= 50; i++)
            for (int j = -50; j <= 50; j++)
                for (int k = -50; k <= 50; k++) {
                    if (i == 0 || j == 0 || k == 0) continue;
                    temp = a3 * i * i * i + a4 * j * j * j + a5 * k * k * k;
                    if (temp < 0)
                        temp = temp + maxn;
                    if (hash[temp] > 0)
                        ans = ans + hash[temp];
                }
        System.out.println(ans);
    }
}