1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
#ifdef LOCAL
class SS {
   int x[0];
};
extern "C" SS __sanitizer_print_stack_trace();
#define __last_state                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \
   }                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \
   ;                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                   \
   SS x {                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              \
      __sanitizer_print_stack_trace()
#endif
#include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <math.h>
using namespace __gnu_pbds;
using namespace std;
#define endl "\n"
#define mp make_pair
#define st first
#define nd second
#define pii pair<int, int>
#define vi vector<int>
#define pb push_back
#define _upgrade ios_base::sync_with_stdio(0), cout.setf(ios::fixed), cout.precision(10), cin.tie(0), cout.tie(0);
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define fwd(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(c) (c).begin(), (c).end()
#define sz(X) (int)((X).size())
typedef long double ld;
typedef unsigned long long ull;
typedef long long ll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set; // find_by_order(x) <-returns x-th element   order_of_key(x) <- returns order of element x
// mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());uniform_int_distribution<int> distr(0, 1e9);auto my_rand = bind(distr, gen); // my_rand() zwraca teraz liczbe z przedzialu [a, b]
#ifdef LOCAL
ostream &operator<<(ostream &out, string str) {
   for (char c : str)
      out << c;
   return out;
}
template <class L, class R> ostream &operator<<(ostream &out, pair<L, R> p) { return out << "(" << p.st << ", " << p.nd << ")"; }
template <class L, class R, class S> ostream &operator<<(ostream &out, tuple<L, R, S> p) {
   auto &[a, b, c] = p;
   return out << "(" << a << ", " << b << ", " << c << ")";
}
template <class T> auto operator<<(ostream &out, T a) -> decltype(a.begin(), out) {
   out << '{';
   for (auto it = a.begin(); it != a.end(); it = next(it))
      out << (it != a.begin() ? ", " : "") << *it;
   return out << '}';
}
void dump() { cerr << "\n"; }
template <class T, class... Ts> void dump(T a, Ts... x) {
   cerr << a << ", ";
   dump(x...);
}
#define debug(...) cerr << "[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#define debug(...) ;
#endif

void dfs(int x, auto &G, auto &vis, auto &res) {
   vis[x] = 1;
   if (x != 0 and !G[0].contains(x))
      res.push_back(x);
   for (auto y : G[x])
      if (!vis[y])
         dfs(y, G, vis, res);
}

vi get_add_order(auto G) {
   vi vis(sz(G));
   vi res;
   dfs(0, G, vis, res);
   return res;
}

int n;

auto readd() {
   int m;
   cin >> m;
   vector<set<int>> G(n);
   rep(i, m) {
      int a, b;
      cin >> a >> b;
      G[--a].insert(--b);
      G[b].insert(a);
   }
   return G;
}

typedef tuple<char, int, int> tpl;

void app(auto &G, tpl t) {
   auto [c, a, b] = t;
   assert(a < b);

   bool ok = false;
   rep(i, sz(G)) ok = ok or (i != a and i != b and G[i].contains(a) and G[i].contains(b));

   assert(ok);
   if (c == '-') {
      assert(G[a].contains(b));
      assert(G[b].contains(a));
      G[a].erase(b);
      G[b].erase(a);
   } else {
      assert(c == '+');
      assert(!G[a].contains(b));
      assert(!G[b].contains(a));
      G[a].insert(b);
      G[b].insert(a);
   }
}

void jazda(auto A, auto B, auto ts) {
   for (auto t : ts)
      app(A, t);
   assert(A == B);
   debug("ALL GOOD");
}

int32_t main() {
   _upgrade;
   cin >> n;

   auto A = readd();
   auto B = readd();

   auto a = get_add_order(A);

   vector<tpl> res;
   for (auto x : a)
      res.emplace_back('+', 0, x);

   rep(i, sz(A)) if (i) for (auto a : A[i]) if (i < a) res.emplace_back('-', i, a);
   rep(i, sz(B)) if (i) for (auto a : B[i]) if (i < a) res.emplace_back('+', i, a);

   auto b = get_add_order(B);
   reverse(all(b));

   debug(A, a, B, b);
   for (auto x : b)
      res.emplace_back('-', 0, x);

   debug(res);
   //    jazda(A, B, res);

   cout << sz(res) << endl;
   for (auto [c, a, b] : res)
      cout << c << " " << a + 1 << " " << b + 1 << "\n";
}