public static void main(String args[]) {
long pow = 1;
for (int i = 0; i < tenPow.length; i++) {
tenPow[i] = pow;
pow = (pow * 10) % MOD;
}
String S = in.next();
int N = in.nextInt();
nodes = new Node[10];
Node root = new Node(-1);
for (int i = 0; i < S.length(); i++) {
root.children.add(get((int) S.charAt(i) - '0'));
}
for (int i = 0; i < N; i++) {
String Q = in.next();
int d = (int) Q.charAt(0) - '0';
if (nodes[d] != null) {
Node nd = nodes[d];
nodes[d] = null;
for (int j = 3; j < Q.length(); j++) {
nd.children.add(get((int) Q.charAt(j) - '0'));
}
if (Q.length() == 3) {
nd.children.add(Node.EMPTY_LEAF);
}
}
}
out.println(root.ans());
}
public static void readCharMatrix(InputReader in, char[][] matrix) {
for (int i = 0; i < matrix.length; i++) {
String row = in.next();
for (int j = 0; j < matrix[i].length; j++) {
matrix[i][j] = row.charAt(j);
}
}
}
public static void main(String args[]) {
int N = in.nextInt();
int[] keys = new int[26];
String S = in.next();
int tot = 0;
// out.println(N + " " + S);
for (int i = 0; i < N - 1; i++) {
// out.println(S + " " + i);
int key = (int) S.charAt(i * 2) - 'a';
keys[key]++;
int door = (int) S.charAt(i * 2 + 1) - 'A';
if (keys[door] > 0) {
keys[door]--;
} else tot++;
}
out.println(tot);
out.close();
}
void solve(int testNumber) {
n = in.nextInt();
m = in.nextInt();
c = in.nextInt();
bit = new long[n + 1];
for (int i = 0; i < m; i++) {
char[] chars = in.next().toCharArray();
if (chars[0] == 'S') {
int left, right, k;
left = in.nextInt();
right = in.nextInt();
k = in.nextInt();
add(left, k);
add(right + 1, -k);
} else out.println(c + query(in.nextInt()));
}
}
