Untitled

// // AAAAAAAAAA
#include <bits/stdc++.h>

using namespace std;

int32_t main()
{

  int t = 1;
  cin >> t;
  while (t--) {
	int n; cin >> n;
	int y = n % 3;
	int x = 3 - (n % 3);
	cout << x << " " << y << endl;
}
 return 0;
}



// // CCCCCCCCC

#include <bits/stdc++.h>

using namespace std;

int32_t main()
{
	int n;
	cin >> n;
	int ar[n];
	vector<int> v;
	for (int i = 0; i < n; i++)
	{
		cin >> ar[i];
		v.push_back(ar[i]);
	}

	sort(v.begin(), v.end());

	int cnt = 0;
	for (int i = 0; i < n; i++)
	{
		for (int j = i; j < n; j++)
		{
			if (v[i] == ar[j])
			{

				for (int k = j; k >= i + 1; k--)
				{
					cnt++;
					swap(ar[k], ar[k - 1]);
				}
				break;
			}
		}
	}
	if(cnt == 0) cnt = -1;
	cout << cnt << endl;
	return 0;
}

/////B

#include <bits/stdc++.h>
using namespace std;

int32_t main()
{

  int t = 1;
  cin >> t;
	 cin.ignore();
	 vector<string> v;
  while (t--) {
	 string s;
	 getline(cin, s);
	//  cout << s << endl;
	v.push_back(s);
}


sort(v.begin(), v.end());
string need;
getline(cin, need);
cout << need << endl;
int left = 0, right = v.size() - 1;
while(left <= right) {
	int mid = (left + right) / 2;
	// cout << mid << " " << v[mid] << endl;
	if(v[mid] == need) {
		cout << mid + 1 << endl;
		return 0;
	}
	else if(v[mid] > need) {
		right = mid - 1;
	}
	else left = mid + 1;
}

cout << -1 << endl;
 return 0;
}