#include <bits/stdc++.h>

namespace IO {
	template <class Stream>
	void write_int128(Stream& out, __int128 v) {
		if (v >= 10) {
			write_int128(out, v / 10);
		}
		out << (int) (v % 10);
	}

	template <class Stream>
	Stream& fmtbase(Stream& out, const char* format) {
		for (; *format; format++) {
			if (*format == '{' && *(format + 1) == '}') {
				throw std::invalid_argument("Error Number of Parameters!");
			}
			
			out << *format;
		}
		
		return out;
	}
	
	template <class Stream, class... Nxt>
	Stream& fmtbase(Stream& out, const char* format, const __int128& value, const Nxt&... nxt) {
		for (; *format; format++) {
			if (*format == '{' && *(format + 1) == '}') {
				write_int128(out, value);
				return fmtbase(out, format + 2, nxt...);
			} 
			
			out << *format;
		}
		
		throw std::invalid_argument("Error Number of Parameters!");
	}

	template <class Stream, class Fst, class... Nxt>
	Stream& fmtbase(Stream& out, const char* format, const Fst& value, const Nxt&... nxt) {
		for (; *format; format++) {
			if (*format == '{' && *(format + 1) == '}') {
				out << value;
				return fmtbase(out, format + 2, nxt...);
			} 
			
			out << *format;
		}
		
		throw std::invalid_argument("Error Number of Parameters!");
	}
	
	template <class... Ps>
	std::string to_string(const char* format, const Ps&... ps) {
		std::stringstream ss;
		fmtbase(ss, format, ps...);
		return ss.str();
	}

	template <class... Ps>
	std::ostream& fmtout(const char* format, const Ps&... ps) {
		return fmtbase(std::cout, format, ps...);
	}
	
	template <class... Ps>
	std::ostream& fmterr(const char* format, const Ps&... ps) {
		return fmtbase(std::cerr, format, ps...);
	}
	
	std::istream& allin() {
		return std::cin;
	}
	
	template <class Fst, class ... Nxt>
	std::istream& allin(Fst& fst, Nxt&... nxt) {
		std::cin >> fst;
		return allin(nxt...);
	}
	
	template <class Iter>
	std::istream& rangin(Iter begin, Iter end) {
		while (begin != end) {
			std::cin >> *begin;
			begin++;
		}
		
		return std::cin;
	}
	
	namespace Fast {
		bool sync = false;
		
		char buf[1 << 23];
		char *p1 = buf, *p2 = buf;
		
		void sync_with_ios(bool s) {
			sync = s;
		}
		
		inline char getchar() {
			if (sync) {
				return (char) std::cin.get();
			}
			else {
				return (p1 == p2) && (p2 = (p1 = buf) + fread(buf, 1, 1 << 22, stdin)), p1 == p2 ? EOF : *p1++;
			}
		}
		
		void read() { }
		
		template <class T, class... U>
		void read(T& x, U&... us) {
			x = 0;
			T pos = 1;
			
			char c = getchar();
			while (!isdigit(c)) {
				if (c == '-') {
					pos = -1;
				}
				
				c = getchar();
			}
			
			while (isdigit(c)) {
				x = 10 * x + c - '0';
				c = getchar();
			}
			
			x *= pos;
			read(us...);
		}
		
		template <class T>
		void write(const T& t) {
			if (t > 10) {
				write(t / 10);
			}
			
			std::cout << (int) (t % 10);
		}
	}
}

namespace Solve {
	using namespace IO;

	using ll = long long;
	using ul = unsigned long long;
	using db = double;
	using ld = long double;
	using ui = unsigned;
	using ib = __int128;
	using ub = __uint128_t;

	int const INF = std::numeric_limits<int>::max();
	int const NINF = std::numeric_limits<int>::min();
	ll const LINF = std::numeric_limits<ll>::max();
	ll const LNINF = std::numeric_limits<ll>::min();
	ld const EPS = 1e-8;

	std::mt19937_64 mt;

	ll rnd(ll l, ll r) {
		return std::uniform_int_distribution<ll>(l, r)(mt);
	}

	template <class T>
	inline int isz(const T& v) {
		return v.size();
	}

	template <class T>
	inline T& ckmx(T& a, T b) {
		return a < b ? (a = b) : a;
	}

	template <class T>
	inline T& ckmi(T& a, T b) {
		return b < a ? (a = b) : a;
	}

	int const N = 1e7 + 10;
	
	int cc[2];
	int same[N + 1];
	int s[N + 1];
	int vis[N + 1];
	int nxt[N + 1];
	int n;

	void read() {
		std::string t;
		std::cin >> t;
		n = isz(t);
		for (int i = 0; i < n; i++) {
			s[i] = t[i] - '0';
		}
	}

	void main() {
		read();

		for (int i = 0; i < n; i++) {
			same[i] = s[i] == s[(i + 1) % n];
			cc[s[i]] += same[i];
		}

		if (cc[0] == n || cc[1] == n) {
			fmtout("1\n");
			return;
		}

		std::vector<int> pos;
		for (int i = 0; i < n; i++) {
			if (s[i] == 0 && s[(i + 1) % n] == 1) {
				pos.push_back(i);
			}
		}

		auto prev = [&](int x) {
			return (x + n - 1) % n;
		};

		auto next = [&](int x) {
			return (x + 1) % n;
		};

		auto upd = [&](int x) {
			cc[s[x]] -= same[x];
			cc[s[prev(x)]] -= same[prev(x)];
			s[x] ^= 1;
			same[x] = s[x] == s[(x + 1) % n];
			same[prev(x)] = s[prev(x)] == s[x];
			cc[s[x]] += same[x];
			cc[s[prev(x)]] += same[prev(x)];
		};

		int ans = 0;

		while (cc[0] && cc[1]) {
			for (auto& v : pos) {
				upd(v);
				upd(next(v));
			}

			std::vector<int> npos;

			auto chk = [&](int x) {
				if (vis[x]) {
					return;
				}
				if (s[x] == 0 && s[next(x)] == 1) {
					npos.push_back(x);
					vis[x] = 1;
				}
			};

			for (auto& v : pos) {
				chk(next(v));
				chk(prev(v));
			}

			pos = npos;
			for (auto& v : pos) {
				vis[v] = 0;
			}

			ans++;
		}

		// for (int i = 0; i < n; i++) {
		// 	fmterr("{}", s[i]);
		// }
		// fmterr("\n");
		// fmterr("? {}\n", ans);

		int j = -1;
		nxt[0] = -1;
		for (int i = 1; i < n; i++) {
			while (j != -1 && s[j + 1] != s[i]) {
				j = nxt[j];
			}
			if (s[j + 1] == s[i]) {
				j++;
			}
			nxt[i] = j;
		}

		// for (int i = 0; i < n; i++) {
		// 	fmterr("{} ", nxt[i]);
		// }
		// fmterr("\n");

		int len = nxt[n - 1] + 1;
		// fmterr("? {}\n", len);
		if (len >= (n + 1) / 2 && n % (n - len) == 0) {
			ans += n - len;
		}
		else {
			ans += n;
		}

		fmtout("{}\n", ans);
	}

	void init() {

	}

	void clear() {
		for (int i = 0; i <= n; i++) {
			same[i] = vis[i] = s[i] = nxt[i] = 0;
		}
		cc[0] = cc[1] = 0;
	}
}

signed main() {
#ifndef ONLINE_JUDGE
	auto input_file = freopen("d.in", "r", stdin);
	auto output_file = freopen("d.out", "w", stdout);
#endif

	auto seed = std::chrono::high_resolution_clock::now().time_since_epoch().count();

	IO::fmterr("seed: {}\n", seed);
	Solve::mt.seed(seed);

	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	std::cout.tie(0);

	int t = 1;
	std::cin >> t;

	Solve::init();

	for (int id = 1; id <= t; id++) {
		Solve::main();
		Solve::clear();
	}

#ifndef ONLINE_JUDGE
	std::cout.flush();
	fclose(input_file);
	fclose(output_file);
#endif

	return 0;
}