#include <bits/stdc++.h>
using namespace std;
long long int M = 1000000007;
long long int min(long long int a, long long int b, long long int c,
                  long long int d) {
  long long int arr[4] = {a, b, c, d};
  sort(arr, arr + 4);
  return arr[0];
}
long long int max(long long int a, long long int b, long long int c,
                  long long int d) {
  long long int arr[4] = {a, b, c, d};
  sort(arr, arr + 4);
  return arr[3];
}
long long int gcd(long long int a, long long int b) {
  if (b < a) {
    int temp = a;
    a = b;
    b = temp;
  }
  if (a == 0) {
    return b;
  }
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  return (a * b / gcd(a, b));
}
vector<long long int> getprimes() {
  vector<long long int> pl(101, 1);
  for (int i = 2; i <= 100; i++) {
    if (pl[i] == 1) {
      for (int j = 2 * i; j <= 100; j += i) {
        pl[j] = 0;
      }
    }
  }
  return pl;
}
double distsqrd(double x1, double y1, double x2, double y2) {
  return (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
}
long long int fact(long long int first) {
  long long int ans = 1;
  if (first == 0) {
    return 1;
  }
  while (first > 0) {
    ans = (ans * first) % 1000000007;
    first--;
  }
  return ans % 1000000007;
}
long long int power(long long int a, long long int b) {
  long long int ans = 1;
  while (b > 0) {
    if (b % 2 == 1) {
      ans *= a;
      ans = ans % M;
    }
    b /= 2;
    a *= a;
    a = a % M;
  }
  return ans % M;
}
long long int mod(long long int a, long long int b) {
  return (((a % b) + b) % b);
}
vector<int> getbinary(int first) {
  vector<int> bin(16, 0);
  int iter = 0;
  while (first > 0) {
    if (first % 2 == 1) {
      bin[iter] = 1;
    } else {
      bin[iter] = 0;
    }
    iter++;
    first /= 2;
  }
  return bin;
}
struct aim {
  double first, second, p, t;
};
bool comparator(const aim &a, const aim &b) { return a.t < b.t; }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  pair<char, string> a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i].first >> a[i].second;
  }
  char fin = (a[n - 1].second)[0];
  int max = -1;
  for (int i = 0; i < 26; i++) {
    char c = 'a' + i;
    if (c == fin) {
      continue;
    }
    int flagx = 0;
    for (int i = 0; i < n; i++) {
      string temp = a[i].second;
      if (a[i].first == '?' && (a[i].second)[0] == c) {
        if (max < i) {
          max = i;
        }
        flagx = 1;
        break;
      } else if (a[i].first == '!') {
        int n1 = temp.size(), flag = 0;
        for (int j = 0; j < n1; j++) {
          if (temp[j] == c) {
            flag = 1;
            break;
          }
        }
        if (flag == 0) {
          if (max < i) {
            max = i;
          }
          flagx = 1;
          break;
        }
      } else {
        int n1 = a[i].second.size(), flag = 0;
        for (int j = 0; j < n1; j++) {
          if ((a[i].second)[j] == c) {
            flag = 1;
            break;
          }
        }
        if (flag == 1) {
          if (max < i) {
            max = i;
          }
          flagx = 1;
          break;
        }
      }
    }
    if (flagx == 0) {
      max = n - 1;
    }
  }
  int ext = 0;
  for (int i = max + 1; i < n; i++) {
    if ((a[i].first == '?' && i != n - 1) || a[i].first == '!') {
      ext++;
    }
  }
  cout << ext << endl;
}
