Problem: In this problem, we consider a simple programming language that has only declarations of one- dimensional integer arrays and assignment statements. The problem is to find a bug in the given program.

The syntax of this language is given in BNF as follows:

<image>

where <new line> denotes a new line character (LF).

Characters used in a program are alphabetical letters, decimal digits, =, [, ] and new line characters. No other characters appear in a program.

A declaration declares an array and specifies its length. Valid indices of an array of length n are integers between 0 and n - 1, inclusive. Note that the array names are case sensitive, i.e. array a and array A are different arrays. The initial value of each element in the declared array is undefined.

For example, array a of length 10 and array b of length 5 are declared respectively as follows.


a[10]
b[5]


An expression evaluates to a non-negative integer. A <number> is interpreted as a decimal integer. An <array_name> [<expression>] evaluates to the value of the <expression> -th element of the array. An assignment assigns the value denoted by the right hand side to the array element specified by the left hand side.

Examples of assignments are as follows.


a[0]=3
a[1]=0
a[2]=a[a[1]]
a[a[0]]=a[1]


A program is executed from the first line, line by line. You can assume that an array is declared once and only once before any of its element is assigned or referred to.

Given a program, you are requested to find the following bugs.

* An index of an array is invalid.
* An array element that has not been assigned before is referred to in an assignment as an index of array or as the value to be assigned.



You can assume that other bugs, such as syntax errors, do not appear. You can also assume that integers represented by <number>s are between 0 and 231 - 1 (= 2147483647), inclusive.



Input

The input consists of multiple datasets followed by a line which contains only a single '.' (period). Each dataset consists of a program also followed by a line which contains only a single '.' (period). A program does not exceed 1000 lines. Any line does not exceed 80 characters excluding a new line character.

Output

For each program in the input, you should answer the line number of the assignment in which the first bug appears. The line numbers start with 1 for each program. If the program does not have a bug, you should answer zero. The output should not contain extra characters such as spaces.

Example

Input

a[3]
a[0]=a[1]
.
x[1]
x[0]=x[0]
.
a[0]
a[0]=1
.
b[2]
b[0]=2
b[1]=b[b[0]]
b[0]=b[1]
.
g[2]
G[10]
g[0]=0
g[1]=G[0]
.
a[2147483647]
a[0]=1
B[2]
B[a[0]]=2
a[B[a[0]]]=3
a[2147483646]=a[2]
.
.


Output

2
2
2
3
4
0

Solution (in CPP):

Solution:
#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <cstdlib>
#include <cassert>
#include <algorithm>
#include <utility>
using namespace std;

#define fi first
#define se second
typedef long long ll;

ll recursive_parse(const string & s, int & indx, map<string,ll>& symbol_table, map<pair<string,ll>,ll>& vals) {
	if('0' <= s[indx] && s[indx] <= '9') {
		ll res = 0;
		while(s[indx] != ']' && indx < s.size()) {
			res *= 10;
			res += s[indx]-'0';
			indx++;
		}
		return res;
	}
	string symbol = "";
	while(s[indx] != '[') {
		symbol += s[indx];
		indx++;
	}
	indx++;
	ll num = recursive_parse(s, indx, symbol_table, vals);
	indx++;

	if(num < 0) return -1;
	if(vals.find(make_pair(symbol, num)) == vals.end() /*not assigned */
			|| num >= symbol_table[symbol] /* out of range*/) {
		return -1;
	}
	return vals[make_pair(symbol,num)];
}

int main() {
	while(1) {
		string s_tmp;
		vector<string> program;
		while(cin >> s_tmp, s_tmp != ".") {
			program.push_back(s_tmp);
		}
		if(!program.size()) {
			// end of the input
			break;
		}
		map<string,ll> symbol_table;
		map<pair<string,ll>,ll> vals;
		int res = 0;
		for(int line = 0; line < program.size(); line++) {
			string s = program[line];
			if(s.find('=') == string::npos) {
				string symbol = string(s.begin(), s.begin() + s.find('['));
				ll size = atol(string(s.begin() + s.find('[')+1, s.begin() + s.find(']')).c_str());
				symbol_table[symbol] = size;
			}
			else {
				string l = string(s.begin(), s.begin()+s.find('='));
				string r = string(s.begin()+s.find('=')+1, s.end());
				ll l_val, r_val;

				int arg_indx = 0;
				string symbol = string(l.begin(), l.begin() + l.find('['));
				arg_indx = l.find('[')+1;

				l_val = recursive_parse(l,arg_indx,symbol_table,vals);
				assert(arg_indx+1 == l.size());
				arg_indx = 0;
				r_val = recursive_parse(r,arg_indx,symbol_table,vals);
				assert(arg_indx == r.size());

				if(l_val < 0 || r_val < 0 || symbol_table.find(symbol) == symbol_table.end() 
						|| symbol_table[symbol] <= l_val) {
					res = line+1;
					break;
				}

				vals[make_pair(symbol, l_val)] = r_val;
			}
		}
		cout << res << endl;
	}
}