Problem: Berkomnadzor — Federal Service for Supervision of Communications, Information Technology and Mass Media — is a Berland federal executive body that protects ordinary residents of Berland from the threats of modern internet.

Berkomnadzor maintains a list of prohibited IPv4 subnets (blacklist) and a list of allowed IPv4 subnets (whitelist). All Internet Service Providers (ISPs) in Berland must configure the network equipment to block access to all IPv4 addresses matching the blacklist. Also ISPs must provide access (that is, do not block) to all IPv4 addresses matching the whitelist. If an IPv4 address does not match either of those lists, it's up to the ISP to decide whether to block it or not. An IPv4 address matches the blacklist (whitelist) if and only if it matches some subnet from the blacklist (whitelist). An IPv4 address can belong to a whitelist and to a blacklist at the same time, this situation leads to a contradiction (see no solution case in the output description).

An IPv4 address is a 32-bit unsigned integer written in the form a.b.c.d, where each of the values a,b,c,d is called an octet and is an integer from 0 to 255 written in decimal notation. For example, IPv4 address 192.168.0.1 can be converted to a 32-bit number using the following expression 192 ⋅ 2^{24} + 168 ⋅ 2^{16} + 0 ⋅ 2^8 + 1 ⋅ 2^0. First octet a encodes the most significant (leftmost) 8 bits, the octets b and c — the following blocks of 8 bits (in this order), and the octet d encodes the least significant (rightmost) 8 bits.

The IPv4 network in Berland is slightly different from the rest of the world. There are no reserved or internal addresses in Berland and use all 2^{32} possible values.

An IPv4 subnet is represented either as a.b.c.d or as a.b.c.d/x (where 0 ≤ x ≤ 32). A subnet a.b.c.d contains a single address a.b.c.d. A subnet a.b.c.d/x contains all IPv4 addresses with x leftmost (most significant) bits equal to x leftmost bits of the address a.b.c.d. It is required that 32 - x rightmost (least significant) bits of subnet a.b.c.d/x are zeroes.

Naturally it happens that all addresses matching subnet a.b.c.d/x form a continuous range. The range starts with address a.b.c.d (its rightmost 32 - x bits are zeroes). The range ends with address which x leftmost bits equal to x leftmost bits of address a.b.c.d, and its 32 - x rightmost bits are all ones. Subnet contains exactly 2^{32-x} addresses. Subnet a.b.c.d/32 contains exactly one address and can also be represented by just a.b.c.d.

For example subnet 192.168.0.0/24 contains range of 256 addresses. 192.168.0.0 is the first address of the range, and 192.168.0.255 is the last one.

Berkomnadzor's engineers have devised a plan to improve performance of Berland's global network. Instead of maintaining both whitelist and blacklist they want to build only a single optimised blacklist containing minimal number of subnets. The idea is to block all IPv4 addresses matching the optimised blacklist and allow all the rest addresses. Of course, IPv4 addresses from the old blacklist must remain blocked and all IPv4 addresses from the old whitelist must still be allowed. Those IPv4 addresses which matched neither the old blacklist nor the old whitelist may be either blocked or allowed regardless of their accessibility before. 

Please write a program which takes blacklist and whitelist as input and produces optimised blacklist. The optimised blacklist must contain the minimal possible number of subnets and satisfy all IPv4 addresses accessibility requirements mentioned above. 

IPv4 subnets in the source lists may intersect arbitrarily. Please output a single number -1 if some IPv4 address matches both source whitelist and blacklist.

Input

The first line of the input contains single integer n (1 ≤ n ≤ 2⋅10^5) — total number of IPv4 subnets in the input.

The following n lines contain IPv4 subnets. Each line starts with either '-' or '+' sign, which indicates if the subnet belongs to the blacklist or to the whitelist correspondingly. It is followed, without any spaces, by the IPv4 subnet in a.b.c.d or a.b.c.d/x format (0 ≤ x ≤ 32). The blacklist always contains at least one subnet.

All of the IPv4 subnets given in the input are valid. Integer numbers do not start with extra leading zeroes. The provided IPv4 subnets can intersect arbitrarily.

Output

Output -1, if there is an IPv4 address that matches both the whitelist and the blacklist. Otherwise output t — the length of the optimised blacklist, followed by t subnets, with each subnet on a new line. Subnets may be printed in arbitrary order. All addresses matching the source blacklist must match the optimised blacklist. All addresses matching the source whitelist must not match the optimised blacklist. You can print a subnet a.b.c.d/32 in any of two ways: as a.b.c.d/32 or as a.b.c.d.

If there is more than one solution, output any.

Examples

Input

1
-149.154.167.99


Output

1
0.0.0.0/0


Input

4
-149.154.167.99
+149.154.167.100/30
+149.154.167.128/25
-149.154.167.120/29


Output

2
149.154.167.99
149.154.167.120/29


Input

5
-127.0.0.4/31
+127.0.0.8
+127.0.0.0/30
-195.82.146.208/29
-127.0.0.6/31


Output

2
195.0.0.0/8
127.0.0.4/30


Input

2
+127.0.0.1/32
-127.0.0.1


Output

-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
set<long long> rem[2][40];
vector<long long> imp[2][40];
struct addr {
  int sign;
  long long val;
  int lv;
  addr(){};
  addr(int sign, long long val, int lv) : sign(sign), val(val), lv(lv){};
};
addr strip(string s) {
  int sign = (s[0] == '-') ? 1 : 0;
  int layer = 32;
  int en = 0;
  while (en < s.length() && s[en] != '/') en++;
  if (en != s.length()) {
    layer = 0;
    for (int i = en + 1; i < s.length(); i++) {
      layer = 10 * layer + s[i] - '0';
    }
  }
  long long ans = 0;
  for (int i = 3, pos = 1; i >= 0; i--, pos++) {
    long long cur = 0;
    while (s[pos] >= '0' && s[pos] <= '9') {
      cur = cur * 10 + s[pos] - '0';
      pos++;
    }
    ans += cur << (i * 8);
  }
  return addr(sign, ans, layer);
}
string to_string(addr s) {
  int a = (s.val >> 24) & ((1LL << 8) - 1);
  int b = (s.val >> 16) & ((1LL << 8) - 1);
  int c = (s.val >> 8) & ((1LL << 8) - 1);
  int d = (s.val >> 0) & ((1LL << 8) - 1);
  return to_string(a) + '.' + to_string(b) + '.' + to_string(c) + '.' +
         to_string(d) + '/' + to_string(s.lv);
}
int n;
addr a[N];
pair<int, int> ra[35][N];
int f[N], psum[N];
pair<int, int> tr[N];
bool pushin(int type, int lv, long long val) {
  long long lastbit = (val >> (32 - lv)) & 1;
  for (int i = lv; i >= 0; i--) {
    long long mask = ((1LL << 32) - 1) ^ ((1LL << (32 - i)) - 1);
    long long parval = val & mask;
    if (rem[type ^ 1][i].count(parval)) return 0;
    if (rem[type][i].count(parval)) return 1;
  }
  if (lv > 0) {
    long long othval = val ^ (1LL << (32 - lv));
    if (rem[type][lv].count(othval)) {
      rem[type][lv].erase(othval);
      long long nval = val & othval;
      return pushin(type, lv - 1, nval);
    }
  }
  rem[type][lv].insert(val);
  return 1;
}
void prepare() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    string s;
    cin >> s;
    a[i] = strip(s);
  }
  for (int i = 1; i <= n; i++) imp[a[i].sign][a[i].lv].push_back(a[i].val);
  for (int i = 0; i <= 32; i++) {
    for (int j = 0; j <= 1; j++)
      for (auto k : imp[j][i])
        if (!pushin(j, i, k)) {
          cout << "-1";
          exit(0);
        }
  }
  n = 0;
  for (int i = 0; i <= 32; i++)
    for (int j = 0; j <= 1; j++) {
      for (auto k : rem[j][i]) a[++n] = addr(j, k, i);
    }
  sort(a + 1, a + n + 1, [](addr a, addr b) { return a.val < b.val; });
}
bool minimize(int &x, int y) {
  if (x > y)
    x = y;
  else
    return 0;
  return 1;
}
void solve() {
  for (int i = 1; i <= n; i++) psum[i] = psum[i - 1] + (a[i].sign == 0);
  for (int lv = 32; lv >= 0; lv--) {
    ra[lv][0] = pair<int, int>(1, 0);
    for (int i = 1; i <= n; i++) {
      long long mask = ((1LL << 32) - 1) ^ ((1LL << (32 - lv)) - 1);
      long long parL = a[i].val & mask;
      long long parR = parL + (1LL << (32 - lv));
      ra[lv][i] = ra[lv][i - 1];
      while (a[ra[lv][i].first].val < parL) ra[lv][i].first++;
      while (ra[lv][i].second < n && a[ra[lv][i].second + 1].val < parR)
        ra[lv][i].second++;
    }
  }
  fill(f + 1, f + n + 1, n + 1);
  for (int i = 1; i <= n; i++) {
    if (a[i].sign == 0) {
      f[i] = f[i - 1];
      tr[i] = pair<int, int>(i - 1, -1);
      continue;
    }
    for (int j = a[i].lv; j >= 0; j--) {
      if (psum[ra[j][i].second] - psum[ra[j][i].first - 1]) continue;
      if (minimize(f[i], f[ra[j][i].first - 1] + 1)) {
        tr[i] = pair<int, int>(ra[j][i].first - 1, j);
      }
    }
  }
  cout << f[n] << '\n';
  for (int i = 1, cur = n; i <= f[n]; i++) {
    if (a[cur].sign == 0) {
      cur--;
      i--;
      continue;
    }
    long long mask = ((1LL << 32) - 1) ^ ((1LL << (32 - tr[cur].second)) - 1);
    cout << to_string(addr(0, a[cur].val & mask, tr[cur].second)) << '\n';
    cur = tr[cur].first;
  }
}
int main() {
  prepare();
  solve();
}