You are given two sets of integers: A and B. You need to output the sum of elements in the set C = \\{x | x = a ⊕ b, a ∈ A, b ∈ B\} modulo 998244353, where ⊕ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR). Each number should be counted only once.

For example, if A = \{2, 3\} and B = \{2, 3\} you should count integer 1 only once, despite the fact that you can get it as 3 ⊕ 2 and as 2 ⊕ 3. So the answer for this case is equal to 1 + 0 = 1.

Let's call a segment [l; r] a set of integers \\{l, l+1, ..., r\}.

The set A is given as a union of n_A segments, the set B is given as a union of n_B segments.

Input

The first line contains a single integer n_A (1 ≤ n_A ≤ 100).

The i-th of the next n_A lines contains two integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ 10^{18}), describing a segment of values of set A.

The next line contains a single integer n_B (1 ≤ n_B ≤ 100).

The i-th of the next n_B lines contains two integers l_j and r_j (1 ≤ l_j ≤ r_j ≤ 10^{18}), describing a segment of values of set B.

Note that segments in both sets may intersect.

Output

Print one integer — the sum of all elements in set C = \\{x | x = a ⊕ b, a ∈ A, b ∈ B\} modulo 998244353.

Examples

Input


2
3 5
5 8
3
1 2
1 9
2 9


Output


112


Input


1
1 9
2
2 4
2 10


Output


120

Note

In the second example, we can discover that the set C = \{0,1,...,15\}, which means that all numbers between 0 and 15 can be represented as a ⊕ b.
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T inverse(T a, T m) {
  T u = 0, v = 1;
  while (a != 0) {
    T t = m / a;
    m -= t * a;
    swap(a, m);
    u -= t * v;
    swap(u, v);
  }
  assert(m == 1);
  return u;
}
template <typename T>
class Modular {
 public:
  using Type = typename decay<decltype(T::value)>::type;
  constexpr Modular() : value() {}
  template <typename U>
  Modular(const U& x) {
    value = normalize(x);
  }
  template <typename U>
  static Type normalize(const U& x) {
    Type v;
    if (-mod() <= x && x < mod())
      v = static_cast<Type>(x);
    else
      v = static_cast<Type>(x % mod());
    if (v < 0) v += mod();
    return v;
  }
  const Type& operator()() const { return value; }
  template <typename U>
  explicit operator U() const {
    return static_cast<U>(value);
  }
  constexpr static Type mod() { return T::value; }
  Modular& operator+=(const Modular& other) {
    if ((value += other.value) >= mod()) value -= mod();
    return *this;
  }
  Modular& operator-=(const Modular& other) {
    if ((value -= other.value) < 0) value += mod();
    return *this;
  }
  template <typename U>
  Modular& operator+=(const U& other) {
    return *this += Modular(other);
  }
  template <typename U>
  Modular& operator-=(const U& other) {
    return *this -= Modular(other);
  }
  Modular& operator++() { return *this += 1; }
  Modular& operator--() { return *this -= 1; }
  Modular operator++(int) {
    Modular result(*this);
    *this += 1;
    return result;
  }
  Modular operator--(int) {
    Modular result(*this);
    *this -= 1;
    return result;
  }
  Modular operator-() const { return Modular(-value); }
  template <typename U = T>
  typename enable_if<is_same<typename Modular<U>::Type, int>::value,
                     Modular>::type&
  operator*=(const Modular& rhs) {
    value = normalize(static_cast<int64_t>(value) *
                      static_cast<int64_t>(rhs.value));
    return *this;
  }
  template <typename U = T>
  typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value,
                     Modular>::type&
  operator*=(const Modular& rhs) {
    int64_t q = static_cast<int64_t>(static_cast<long double>(value) *
                                     rhs.value / mod());
    value = normalize(value * rhs.value - q * mod());
    return *this;
  }
  template <typename U = T>
  typename enable_if<!is_integral<typename Modular<U>::Type>::value,
                     Modular>::type&
  operator*=(const Modular& rhs) {
    value = normalize(value * rhs.value);
    return *this;
  }
  Modular& operator/=(const Modular& other) {
    return *this *= Modular(inverse(other.value, mod()));
  }
  template <typename U>
  friend bool operator==(const Modular<U>& lhs, const Modular<U>& rhs);
  template <typename U>
  friend bool operator<(const Modular<U>& lhs, const Modular<U>& rhs);
  template <typename U>
  friend std::istream& operator>>(std::istream& stream, Modular<U>& number);

 private:
  Type value;
};
template <typename T>
bool operator==(const Modular<T>& lhs, const Modular<T>& rhs) {
  return lhs.value == rhs.value;
}
template <typename T, typename U>
bool operator==(const Modular<T>& lhs, U rhs) {
  return lhs == Modular<T>(rhs);
}
template <typename T, typename U>
bool operator==(U lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) == rhs;
}
template <typename T>
bool operator!=(const Modular<T>& lhs, const Modular<T>& rhs) {
  return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(const Modular<T>& lhs, U rhs) {
  return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(U lhs, const Modular<T>& rhs) {
  return !(lhs == rhs);
}
template <typename T>
bool operator<(const Modular<T>& lhs, const Modular<T>& rhs) {
  return lhs.value < rhs.value;
}
template <typename T>
Modular<T> operator+(const Modular<T>& lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(const Modular<T>& lhs, U rhs) {
  return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(U lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) += rhs;
}
template <typename T>
Modular<T> operator-(const Modular<T>& lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(const Modular<T>& lhs, U rhs) {
  return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(U lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) -= rhs;
}
template <typename T>
Modular<T> operator*(const Modular<T>& lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(const Modular<T>& lhs, U rhs) {
  return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(U lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) *= rhs;
}
template <typename T>
Modular<T> operator/(const Modular<T>& lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(const Modular<T>& lhs, U rhs) {
  return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(U lhs, const Modular<T>& rhs) {
  return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> power(const Modular<T>& a, const U& b) {
  assert(b >= 0);
  Modular<T> x = a, res = 1;
  U p = b;
  while (p > 0) {
    if (p & 1) res *= x;
    x *= x;
    p >>= 1;
  }
  return res;
}
template <typename T>
string to_string(const Modular<T>& number) {
  return to_string(number());
}
template <typename T>
std::ostream& operator<<(std::ostream& stream, const Modular<T>& number) {
  return stream << number();
}
template <typename T>
std::istream& operator>>(std::istream& stream, Modular<T>& number) {
  typename common_type<typename Modular<T>::Type, int64_t>::type x;
  stream >> x;
  number.value = Modular<T>::normalize(x);
  return stream;
}
constexpr int md = 998244353;
using Mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>;
struct binum {
  long long head;
  int shift;
  binum(long long _head, int _shift) : head(_head), shift(_shift){};
};
bool inside(binum a, binum b) {
  if (a.shift > b.shift) return false;
  long long x = a.head >> (b.shift - a.shift);
  return x == b.head;
}
binum unite(binum a, binum b) {
  long long x = a.head >> (b.shift - min(a.shift, b.shift));
  long long y = b.head >> (a.shift - min(a.shift, b.shift));
  return binum(x ^ y, max(a.shift, b.shift));
}
const int MAX = 62;
int n;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  vector<pair<long long, long long>> a;
  for (int i = 0; i < n; i++) {
    long long l, r;
    cin >> l >> r;
    r++;
    l--;
    a.emplace_back(l, r);
  }
  cin >> n;
  vector<pair<long long, long long>> b;
  for (int i = 0; i < n; i++) {
    long long l, r;
    cin >> l >> r;
    r++;
    l--;
    b.emplace_back(l, r);
  }
  auto unique = [&](vector<binum>& s) {
    sort(s.begin(), s.end(), [&](binum x, binum y) {
      return make_pair((x.head << x.shift), -x.shift) <
             make_pair((y.head << y.shift), -y.shift);
    });
    vector<binum> _s;
    for (binum u : s) {
      if (_s.size() && inside(u, _s.back())) continue;
      _s.push_back(u);
    }
    swap(s, _s);
  };
  vector<binum> s;
  for (pair<long long, long long> x : a) {
    for (pair<long long, long long> y : b) {
      long long xl = x.first, xr = x.second;
      long long yl = y.first, yr = y.second;
      vector<binum> bx, by;
      if (__builtin_ctzll(xl + 1) < 63 - __builtin_clzll(xl ^ xr)) {
        bx.emplace_back((xl >> __builtin_ctzll(xl + 1)) + 1,
                        __builtin_ctzll(xl + 1));
      }
      if (__builtin_ctzll(xr) < 63 - __builtin_clzll(xl ^ xr)) {
        bx.emplace_back((xr >> __builtin_ctzll(xr)) - 1, __builtin_ctzll(xr));
      }
      if (__builtin_ctzll(yl + 1) < 63 - __builtin_clzll(yl ^ yr)) {
        by.emplace_back((yl >> __builtin_ctzll(yl + 1)) + 1,
                        __builtin_ctzll(yl + 1));
      }
      if (__builtin_ctzll(yr) < 63 - __builtin_clzll(yl ^ yr)) {
        by.emplace_back((yr >> __builtin_ctzll(yr)) - 1, __builtin_ctzll(yr));
      }
      for (int i = MAX - 1; i > -1; i--) {
        vector<binum> sx, sy;
        if (!((xl >> i) & 1LL)) {
          if (((xl >> i) << i) + (1LL << (i + 1)) - 1 < xr) {
            sx.emplace_back((xl >> i) + 1, i);
          }
        }
        if ((xr >> i) & 1LL) {
          if (((xr >> i) << i) - (1LL << i) > xl) {
            sx.emplace_back((xr >> i) - 1, i);
          }
        }
        if (!((yl >> i) & 1LL)) {
          if (((yl >> i) << i) + (1LL << (i + 1)) - 1 < yr) {
            sy.emplace_back((yl >> i) + 1, i);
          }
        }
        if ((yr >> i) & 1LL) {
          if (((yr >> i) << i) - (1LL << i) > yl) {
            sy.emplace_back((yr >> i) - 1, i);
          }
        }
        for (auto u : sx) {
          for (auto v : sy) s.push_back(unite(u, v));
        }
        for (auto u : sx) {
          for (auto v : by) s.push_back(unite(u, v));
        }
        for (auto u : bx) {
          for (auto v : sy) s.push_back(unite(u, v));
        }
      }
      for (auto u : bx) {
        for (auto v : by) s.push_back(unite(u, v));
      }
    }
  }
  unique(s);
  Mint res = 0;
  vector<Mint> p(2 * MAX);
  p[0] = 1;
  for (int i = 1; i < 2 * MAX; i++) p[i] = p[i - 1] * 2;
  Mint inv_2 = Mint(1) / 2;
  for (binum u : s) {
    Mint add = u.head % md;
    add *= p[u.shift * 2];
    Mint c = p[u.shift] - 1;
    add += c * (c + 1) * inv_2;
    res += add;
  }
  cout << res;
  return 0;
}
