--- /dev/null
+#include <bits/stdc++.h>
+using namespace std;
+
+
+int main()
+{
+ string input;
+ cin >> input;
+ bool H=false, V = false;
+ for (int i = 0; i < input.size(); i++)
+ {
+ if (input[i] == 'H')
+ H = !H;
+ else
+ V = !V;
+ }
+
+ vector<vector<int>> grid = {{1,2},{3,4}};
+
+
+ if (H == true)
+ {
+ vector<int> temp = grid[1];
+ grid[1] = grid[0];
+ grid[0] = temp;
+ }
+ if (V == true)
+ {
+ int t1 = grid[0][1], t2 = grid[1][1];
+ grid[0][1] = grid[0][0];
+ grid[1][1] = grid[1][0];
+
+ grid[0][0] = t1;
+ grid[1][0] = t2;
+ }
+
+ cout << grid[0][0] << " " << grid[0][1] << endl;
+ cout << grid[1][0] << " " << grid[1][1] << endl;
+
+
+ return 0;
+}
--- /dev/null
+#include <bits/stdc++.h>
+using namespace std;
+
+bool is_prime(int n);
+
+int main()
+{
+ int T, N;
+ cin >> T;
+ for (int i = 0; i < T; i++)
+ {
+ cin >> N;
+ int a=2,b;
+ while (true)
+ {
+ if (is_prime(a))
+ {
+ b = 2 * N - a;
+
+ if (is_prime(b))
+ {
+ cout << a << " " << b << endl;
+ break;
+ }
+ }
+ a++;
+
+
+ }
+ }
+ return 0;
+}
+
+bool is_prime(int n)
+{
+ if (n == 2)
+ return true;
+ for (int i = 2; i <= 1+sqrt(n); i++)
+ {
+ if (n % i == 0)
+ return false;
+ }
+ return true;
+}