#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <typename T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <typename T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <typename T>
inline void println(T first) {
  print(first), putchar('\n');
}
template <typename T>
inline void printsp(T first) {
  print(first), putchar(' ');
}
template <class T, class T1>
inline void print(T first, T1 second) {
  printsp(first), println(second);
}
template <class T, class T1, class T2>
inline void print(T first, T1 second, T2 z) {
  printsp(first), printsp(second), println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int vst[26], flag[26];
char s[100100];
int main() {
  int n;
  gn(n);
  for (int i = 0; i < 26; i++) vst[i] = 1;
  int cur = 0, ans = 0;
  int ok = 0;
  for (int i = 0; i < n; i++) {
    char c;
    scanf(" %c %s", &c, s);
    if (c == '!') {
      if (ok) ans++;
      cur++;
      for (int j = 0, len = strlen(s); j < len; j++) {
        flag[s[j] - 'a'] = cur;
      }
      for (int j = 0; j < 26; j++) {
        if (flag[j] != cur) vst[j] = 0;
      }
    } else if (c == '.') {
      for (int j = 0, len = strlen(s); j < len; j++) {
        vst[s[j] - 'a'] = 0;
      }
    } else {
      if (ok && !vst[s[0] - 'a']) ans++;
      if (i < n - 1) vst[s[0] - 'a'] = 0;
    }
    int sum = 0;
    for (int j = 0; j < 26; j++) sum += vst[j];
    if (sum == 1) ok = 1;
  }
  println(ans);
  return 0;
}
