1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
// Artur Kraska, II UWr

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <list>
#include <set>
#include <map>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(typeof(coll.begin()) iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(typeof(coll.rbegin()) iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED)            ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007

using namespace std;

int n;
char c;
string str;
vector <int> v[1000007];

int main()
{
    ios_base::sync_with_stdio(false);
    cin >> n >> c;
    getline(cin, str);
    str = c+str;

    int dl = str.length();
    bool minus = 0;
    int nr = 0, liczba = 0;
    forr(i, dl)
    {
        if(str[i] == '~')
            minus = 1;
        else if(str[i] >= '0' && str[i] <= '9')
            liczba = liczba*10+str[i]-'0';
        else if(str[i] == ' ' && liczba > 0)
        {
            v[nr].PB((minus?-1:1)*liczba);
            minus = 0;
            liczba = 0;
        }
        else if(str[i] == ')')
        {
            v[nr].PB((minus?-1:1)*liczba);
            liczba = 0;
            minus = 0;
            nr++;
        }
    }
/*
    forr(i, nr)
    {
        forr(j, v[i].size())
            cout << v[i][j] << " ";
        cout << endl;
    }
*/
    long long res = 0;
    forr(mask, 1<<n)
    {
//        cout << " maska " << mask << endl;
        bool b = 1;
        forr(i, nr)
        {
            int j = 0;
            while(j < v[i].size())
            {
//                cout << "sprawdza " << i << ", " << j << ", czyli " << v[i][j] <<  " -> bit jest " << ((mask & (1<<(abs(v[i][j])-1))) > 0) << ", a potrzebny jest " << (v[i][j] > 0) << endl;
                if((v[i][j] > 0) == ((mask & (1<<(abs(v[i][j])-1))) > 0))
                    break;
                j++;
            }
            if(j == v[i].size())
            {
//                cout << "   odpadla na " << i << ", " << j << endl;
                b = 0;
                break;
            }
        }
        if(b)
            res++;
    }

    cout << res << endl;

    return 0;
}