#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <stdbool.h>

bool isPerfectSquare(int n) {
    int sqrtN = (int)sqrt(n);
    return sqrtN * sqrtN == n;
}

bool isSquareful(int* perm, int n) {
    for (int i = 0; i < n - 1; i++) {
        if (!isPerfectSquare(perm[i] + perm[i + 1])) {
            return false;
        }
    }
    return true;
}

void generatePermutations(int* nums, int n, int* current, bool* used, int pos, int* count) {
    if (pos == n) {
        if (isSquareful(current, n)) {
            (*count)++;
        }
        return;
    }
    
    for (int i = 0; i < n; i++) {
        if (!used[i]) {
            used[i] = true;
            current[pos] = nums[i];
            generatePermutations(nums, n, current, used, pos + 1, count);
            used[i] = false;
        }
    }
}

int numSquarefulPerms(int* nums, int n) {
    int* current = malloc(n * sizeof(int));
    bool* used = malloc(n * sizeof(bool));
    for (int i = 0; i < n; i++) used[i] = false;
    
    int count = 0;
    generatePermutations(nums, n, current, used, 0, &count);
    
    free(current);
    free(used);
    return count;
}

int main() {
    int nums[20], n = 0;
    char input[1000];
    fgets(input, sizeof(input), stdin);
    
    char* token = strtok(input, "[],\n");
    while (token != NULL) {
        nums[n++] = atoi(token);
        token = strtok(NULL, "[],\n");
    }
    
    printf("%d\n", numSquarefulPerms(nums, n));
    return 0;
}