#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define ff first
#define ss second
const int N = 1000;
int m, n, m1, n1, m2, n2;
vector<pii> S, T;
int main() {
cin.tie(NULL)->sync_with_stdio(false);
cin >> n;
S.resize(n);
for (pii &x : S) cin >> x.ff >> x.ss;
cin >> m;
T.resize(m);
for (pii &x : T) cin >> x.ff >> x.ss;
m1 = max(S[0].ff, S[2].ff);
n1 = max(S[0].ss, S[2].ss);
m2 = max(T[0].ff, T[2].ff);
n2 = max(T[0].ss, T[2].ss);
if (m1 > m2) { // n1 < n2
cout << "scissors\n";
cout << "0 2\n";
cout << "4 ";
cout << 0 << ' ' << 0 << ' ';
cout << m2 << ' ' << 0 << ' ';
cout << m2 << ' ' << n1 << ' ';
cout << 0 << ' ' << n1 << '\n';
cout << "4 ";
cout << m2 << ' ' << 0 << ' ';
cout << m1 << ' ' << 0 << ' ';
cout << m1 << ' ' << n1 << ' ';
cout << m2 << ' ' << n1 << '\n';
cout << "tape\n";
cout << "2 1 2\n";
cout << "4 ";
cout << 0 << ' ' << 0 << ' ';
cout << m2 << ' ' << 0 << ' ';
cout << m2 << ' ' << n1 << ' ';
cout << 0 << ' ' << n1 << '\n';
cout << "4 ";
cout << m2 << ' ' << 0 << ' ';
cout << m1 << ' ' << 0 << ' ';
cout << m1 << ' ' << n1 << ' ';
cout << m2 << ' ' << n1 << '\n';
cout << "4\n";
for (pii x : T) cout << x.ff << ' ' << x.ss << ' ';
cout << '\n';
}
else { // m1 < m2 && n1 > n2
cout << "scissors\n";
cout << "0 2\n";
cout << "4 ";
cout << 0 << ' ' << 0 << ' ';
cout << m1 << ' ' << 0 << ' ';
cout << m1 << ' ' << n2 << ' ';
cout << 0 << ' ' << n2 << '\n';
cout << "4 ";
cout << 0 << ' ' << n2 << ' ';
cout << m1 << ' ' << n2 << ' ';
cout << m1 << ' ' << n1 << ' ';
cout << 0 << ' ' << n1 << '\n';
cout << "tape\n";
cout << "2 1 2\n";
cout << "4 ";
cout << 0 << ' ' << 0 << ' ';
cout << m1 << ' ' << 0 << ' ';
cout << m1 << ' ' << n2 << ' ';
cout << 0 << ' ' << n2 << '\n';
cout << "4 ";
cout << 0 << ' ' << n2 << ' ';
cout << m1 << ' ' << n2 << ' ';
cout << m1 << ' ' << n1 << ' ';
cout << 0 << ' ' << n1 << '\n';
cout << "4\n";
for (pii x : T) cout << x.ff << ' ' << x.ss << ' ';
cout << '\n';
}
}
/** /\_/\
* (= ._.)
* / >0 \>1
**/
