#include <array>
#include <cstddef>
#include <cstdint>
#include <fstream>
#include <iostream>
#include <string>

namespace {
using std::cin;
using std::cout;
using std::int64_t;
using std::size_t;

namespace base {
template <typename T, size_t... sizes>
struct NestedArray {};

template <typename T, size_t size, size_t... sizes>
struct NestedArray<T, size, sizes...> {
  using Type = std::array<typename NestedArray<T, sizes...>::Type, size>;
};

template <typename T>
struct NestedArray<T> {
  using Type = T;
};

template <typename T, size_t... sizes>
using Array = typename NestedArray<T, sizes...>::Type;

void OptimizeIO() {
  std::ios::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
}

void OptimizeIO(const std::string &input_file, const std::string &output_file) {
  static std::ifstream input_stream(input_file);
  static std::ofstream output_stream(output_file);
  cin.rdbuf(input_stream.rdbuf()), cout.rdbuf(output_stream.rdbuf());
  cin.tie(nullptr), cout.tie(nullptr);
}

template <typename T>
inline void CheckMin(T &a, const T &b) {
  if (b < a) a = b;
}
}  // namespace base

using base::Array;
using base::CheckMin;

const int kMaxN = 1.0e6 + 5, kInf = 1.0e9 + 5;
int n;
Array<int, kMaxN, 4, 4, 4> f;
std::string s;

inline int F(char c) {
  if (c == 'a') return 1;
  if (c == 'n') return 2;
  if (c == 'i') return 3;
  return 0;
}

inline bool Check(int a, int b, int c, int d) {
  return a == 1 && b == 2 && c == 3 && d == 1;
}

void Solve() {
  cin >> s;
  n = s.size(), s = ' ' + s;

  for (int i = 0; i <= n; ++i) {
    for (int a = 0; a < 4; ++a) {
      for (int b = 0; b < 4; ++b) f[i][a][b].fill(kInf);
    }
  }

  f[0][0][0][0] = 0;

  for (int i = 1; i <= n; ++i) {
    for (int a = 0; a < 4; ++a) {
      for (int b = 0; b < 4; ++b) {
        for (int c = 0; c < 4; ++c) {
          int val = f[i - 1][a][b][c];
          if (val == kInf) continue;
          int d = F(s[i]);
          if (!Check(a, b, c, d)) CheckMin(f[i][b][c][d], val);

          for (int j = 0; j < 4; ++j) {
            if (!Check(a, b, c, j)) CheckMin(f[i][b][c][j], val + 1);
          }
        }
      }
    }
  }

  int ans = kInf;

  for (int a = 0; a < 4; ++a) {
    for (int b = 0; b < 4; ++b) {
      for (int c = 0; c < 4; ++c) CheckMin(ans, f[n][a][b][c]);
    }
  }

  cout << ans << "\n";
}

int Main() {
  base::OptimizeIO();
  int t;
  cin >> t;
  while (t--) Solve();
  return 0;
}
}  // namespace

int main() { return Main(); }