#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MOD 1000000007

int solution(int* nums, int n) {
    // dp[mask][i] = number of ways to arrange elements in mask ending with nums[i]
    long long** dp = (long long**)calloc(1 << n, sizeof(long long*));
    for (int i = 0; i < (1 << n); i++) {
        dp[i] = (long long*)calloc(n, sizeof(long long));
    }
    
    // Base case: single element permutations
    for (int i = 0; i < n; i++) {
        dp[1 << i][i] = 1;
    }
    
    // Fill DP table
    for (int mask = 0; mask < (1 << n); mask++) {
        for (int i = 0; i < n; i++) {
            if (dp[mask][i] == 0) continue;
            
            // Try adding each unused element
            for (int j = 0; j < n; j++) {
                if (mask & (1 << j)) continue;
                
                // Check if nums[i] and nums[j] are compatible
                if (nums[i] % nums[j] == 0 || nums[j] % nums[i] == 0) {
                    int newMask = mask | (1 << j);
                    dp[newMask][j] = (dp[newMask][j] + dp[mask][i]) % MOD;
                }
            }
        }
    }
    
    // Sum all permutations using all elements
    int fullMask = (1 << n) - 1;
    long long result = 0;
    for (int i = 0; i < n; i++) {
        result = (result + dp[fullMask][i]) % MOD;
    }
    
    // Free memory
    for (int i = 0; i < (1 << n); i++) {
        free(dp[i]);
    }
    free(dp);
    
    return result;
}

int main() {
    char line[1000];
    fgets(line, sizeof(line), stdin);
    
    int nums[20];
    int n = 0;
    char* token = strtok(line, "[,]");
    while (token != NULL) {
        if (token[0] >= '0' && token[0] <= '9') {
            nums[n++] = atoi(token);
        }
        token = strtok(NULL, "[,]");
    }
    
    printf("%d\n", solution(nums, n));
    return 0;
}