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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <cassert>

using namespace std;

typedef long long LL;

#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(val) ((val) < 0 ? -(val) : (val))

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; x >= (e); --x)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define VAR(v, n) __typeof(n) v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define PB push_back
#define ST first
#define ND second
const int INF = 1e9;

struct lit
{
	int ind;
	bool val;
};


struct clause
{
	vector<lit> liter;	
};

/* PA-2016 R5 */
/* Brut! */

int main() {
	int n;	
	scanf("%d\n", &n);

	vector<clause> clauses;

	vector<lit> lits;

	lit l;
	bool val = true;
	char c; 
	int ind = 0;
	do {
    c = getchar();

		if (c == '~')
		{
			val = false;
		}
		else if (c == 'x')
		{
			l.val = val;
			val = true;
		}
		else if (c >= '0' && c <= '9')
		{
			ind = ind * 10 + (c - '0');
		}	
		else if (c == ')' || c == 'v')
		{
			l.ind = ind - 1;
			ind = 0;
			lits.PB(l);

			if (c == ')')
			{
				clause cl;
				cl.liter = lits;
				clauses.PB(cl);

				lits.clear();
			}
		}
		else
		{	
			//printf("<<%c>> ",c);
		}
  } while (c != '\n');

#if 0
	int i = 0;
	FOREACH(it, clauses)
	{
		printf("CLAUSE nr [%d]:\n", i);
		FOREACH(it1, it->liter)
		{
			printf("[%d:%d] ", it1->ind, (int)it1->val);
		}
		printf("\n");

		i++; 
	}	
#endif

	int res = 0;
	int mask = 1 << n;
	REP(m, mask)
	{
//		printf("mask %d of (1<<n) (%d) with n = %d\n", m, mask, n );
		bool maskOK = true;

//		int cl = 0;
		FOREACH(it, clauses)
		{
			bool clauseOK = false;
	//		int liter = 0;
			FOREACH(it1, it->liter)
			{
//				printf("I'm in a clause [%d] lit [%d], checking mask (m) (%d) and (it->ind) (%d), the answer is: %d, and value %d\n", cl, liter++, m, it1->ind, (int)(bool)(m & (1 << it1->ind)), (int)(it1->val));
				bool l = m & (1 << it1->ind);
	//			printf("  before %d \n", (int)(l));
				if (it1->val == false)
				{
		//			printf("  INVerting \n");
					l = !l;
				}
			//	printf("  after %d \n", (int)(l));

				if (l)
				{
					clauseOK = true;
				}
			}

			if (!clauseOK)
			{
				maskOK = false;
				//printf("Clause rejected!\n");
			}
/*
			else
				printf("Clause accepted!\n");
			cl++;
*/
		}
		if (maskOK)
		{
	//		printf("Mask accepted [%x]!\n", m);
			res++;
		}
/*
		else
			printf("Mask rejected!\n");
*/

	}

	printf("%d\n", res);	
			
	return 0;
}