#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
template <class T>
bool chmax(T &former, const T &b) {
  if (former < b) {
    former = b;
    return true;
  }
  return false;
}
template <class T>
bool chmin(T &former, const T &b) {
  if (b < former) {
    former = b;
    return true;
  }
  return false;
}
template <class T>
T sqar(T x) {
  return x * x;
}
template <class T>
inline void princ(T x) {
  cout << x << " ";
};
template <class T>
inline void print(T x) {
  cout << x << "\n";
};
template <class T>
inline void Yes(T condition) {
  if (condition)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
template <class T>
inline void YES(T condition) {
  if (condition)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  std::cout << std::fixed << std::setprecision(30);
  int t;
  cin >> t;
  vi ans;
  for (ll I = 0; I < (ll)t; I++) {
    string s;
    cin >> s;
    int n = s.size();
    int a = -(1 << 25), b = -(1 << 25), c = -(1 << 25);
    int res = 1 << 30;
    for (ll i = 0; i < (ll)n; i++) {
      if (s[i] == '1') a = i;
      if (s[i] == '2') b = i;
      if (s[i] == '3') c = i;
      chmin(res, (int)i + 1 - min(a, min(b, c)));
    }
    ans.push_back(res);
  }
  for (auto an : ans) {
    if (an > (1 << 23)) {
      print(0);
      continue;
    }
    print(an);
  }
  return 0;
}
