#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

int main() {
    int n; cin >> n;
    int a, b, c; cin >> a >> b >> c;

    auto s = vec<int>(uns, n);
    for (auto &e : s) {
        string t; cin >> t;
        e = size(t);
    }

    auto make = [](const auto &v, int x) {
        int n = size(v);

        auto acc = vec<int>(uns, n + 1);

        acc[0] = 0;
        for (int i = 0; i < n; ++i) {
            acc[i + 1] = acc[i] + v[i];
        }

        auto dp = vec<int>(uns, n + 1);

        map<int, int> count;
        for (int i = 0; i <= n; ++i) {
            dp[i] = count[acc[i]];
            ++count[acc[i] + x];
        }

        return dp;
    };

    auto dp1 = make(s, a);
    reverse(begin(s), end(s));
    auto dp2 = make(s, c);
    reverse(begin(s), end(s));
    reverse(begin(dp2), end(dp2));

    int64_t ans = 0;

    auto acc = vec<int>(uns, n + 1);

    acc[0] = 0;
    for (int i = 0; i < n; ++i) {
        acc[i + 1] = acc[i] + s[i];
    }

    map<int, int64_t> count;

    count[acc[0] + b] += dp1[0];
    count[acc[1] + b] += dp1[1];

    for (int i = 2; i < n; ++i) {
        ans += count[acc[i]] * dp2[i];
        count[acc[i] + b] += dp1[i];
    }

    cout << ans << endl;
}