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

const int N = 30, M = 110;
int n, k, cnt = 1, a[N][M], t[N*M], m[N], b[N][M];
string s;

void add(int pos, int i, int j) {
    if (j > m[i]) return;
    if (a[i][j] == 1) {
        if (!t[pos*2]) {
            cnt++;
            t[pos*2] = a[i][j];
        }
        add(pos*2, i, j+1);
    } else {
        if (!t[pos*2+1]) {
            cnt++;
            t[pos*2+1] = a[i][j];
        }
        add(pos*2+1, i, j+1);
    }
}

void solve() {
    for (int i = 1; i <= n; i++) {
        add(1, i, 1);
    }
}

void change(int ch) {
    int sum = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m[i]; j++) {
            if (a[i][j] == 3) {
                a[i][j] = (ch & sum) + 1;
                sum <<= 1;
            }
        }
    }
}

void back() {
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m[i]; j++) {
            a[i][j] = b[i][j];
        }
    }
}

int main() {
    freopen("lowtea.in", "r", stdin);
    freopen("lowtea.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> s;
        m[i] = s.size();
        for (int j = 0; j < s.size(); j++) {
            a[i][j+1] = s[j] - '0' + 1;
            if (s[j] == '?') {
                a[i][j+1] = 3;
                k++;
            }
        }
    }
    if (k == 0) solve();
    else {
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m[i]; j++) {
                b[i][j] = a[i][j];
            }
        }
        for (int i = 0; i < (1<<k); i++) {
            change(i);
            memset(t, 0, sizeof(t));
            solve();
            back();
        }
        cnt += (1<<k);
        cnt--;
    }
    cout << cnt;
    return 0;
}