Problem: Warning: This problem has an unusual memory limit!

Bob decided that he will not waste his prime years implementing GUI forms for a large corporation and instead will earn his supper on the Stock Exchange Reykjavik. The Stock Exchange Reykjavik is the only actual stock exchange in the world. The only type of transaction is to take a single share of stock x and exchange it for a single share of stock y, provided that the current price of share x is at least the current price of share y. 

There are 2n stocks listed on the SER that are of interest to Bob, numbered from 1 to 2n. Bob owns a single share of stocks 1 through n and would like to own a single share of each of n+1 through 2n some time in the future.

Bob managed to forecast the price of each stock — in time t ≥ 0, the stock i will cost a_i ⋅ ⌊ t ⌋ + b_i. The time is currently t = 0. Help Bob find the earliest moment in time in which he can own a single share of each of n+1 through 2n, and the minimum number of stock exchanges he has to perform in order to do that.

You may assume that the Stock Exchange has an unlimited amount of each stock at any point in time. 

Input

The first line contains a single integer n (1 ≤ n ≤ 2200) — the number stocks currently owned by Bob.

Each of the next 2n lines contains integers a_i and b_i (0 ≤ a_i, b_i ≤ 10^9), representing the stock price of stock i. 

Output

If it is impossible for Bob to achieve his goal, output a single integer -1.

Otherwise, output two integers T and E, where T is the minimum time in which he can achieve his goal, and E is the minimum number of exchanges in which he can achieve his goal at time T.

Examples

Input


1
3 10
1 16


Output


3 1


Input


2
3 0
2 1
1 10
1 11


Output


6 3


Input


1
42 42
47 47


Output


-1


Input


8
145 1729363
891 4194243
424 853731
869 1883440
843 556108
760 1538373
270 762781
986 2589382
610 99315884
591 95147193
687 99248788
65 95114537
481 99071279
293 98888998
83 99764577
769 96951171


Output


434847 11


Input


8
261 261639
92 123277
271 131614
320 154417
97 258799
246 17926
117 222490
110 39356
85 62864876
86 62781907
165 62761166
252 62828168
258 62794649
125 62817698
182 62651225
16 62856001


Output


1010327 11

Note

In the first example, Bob simply waits until time t = 3, when both stocks cost exactly the same amount.

In the second example, the optimum strategy is to exchange stock 2 for stock 1 at time t = 1, then exchange one share of stock 1 for stock 3 at time t = 5 (where both cost 15) and then at time t = 6 exchange the second on for the stock number 4 (when they cost 18 and 17, respectively). Note that he can achieve his goal also with only two exchanges, but this would take total time of t = 9, when he would finally be able to exchange the share number 2 for the share number 3. 

In the third example, Bob can never achieve his goal, as the second stock is always strictly more expensive than the first one.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
template <typename flow_t, typename cost_t>
struct min_cost_flow {
  static const flow_t FLOW_INF = numeric_limits<flow_t>::max() / 2;
  static const cost_t COST_INF = numeric_limits<cost_t>::max() / 2;
  struct edge {
    int node, rev;
    flow_t capacity;
    cost_t cost;
    edge() {}
    edge(int _node, int _rev, flow_t _capacity, cost_t _cost)
        : node(_node), rev(_rev), capacity(_capacity), cost(_cost) {}
  };
  int V = -1;
  vector<vector<edge>> adj;
  vector<cost_t> dist;
  vector<int> prev;
  vector<edge *> prev_edge;
  min_cost_flow(int vertices = -1) {
    if (vertices >= 0) init(vertices);
  }
  void init(int vertices) {
    V = vertices;
    adj.assign(V, {});
    dist.resize(V);
    prev.resize(V);
    prev_edge.resize(V);
  }
  void add_directional_edge(int u, int v, flow_t capacity, cost_t cost) {
    edge uv_edge(v, adj[v].size() + (u == v ? 1 : 0), capacity, cost);
    edge vu_edge(u, adj[u].size(), 0, -cost);
    adj[u].push_back(uv_edge);
    adj[v].push_back(vu_edge);
  }
  edge &reverse_edge(const edge &e) { return adj[e.node][e.rev]; }
  bool bellman_ford(int source, int sink) {
    for (int i = 0; i < V; i++) {
      dist[i] = COST_INF;
      prev[i] = -1;
      prev_edge[i] = nullptr;
    }
    vector<int> last_seen(V, -1);
    vector<int> nodes = {source}, next_nodes;
    dist[source] = 0;
    for (int iteration = 0; iteration < V; iteration++) {
      next_nodes.clear();
      for (int node : nodes)
        for (edge &e : adj[node])
          if (e.capacity > 0 && dist[node] + e.cost < dist[e.node]) {
            dist[e.node] = dist[node] + e.cost;
            prev[e.node] = node;
            prev_edge[e.node] = &e;
            if (last_seen[e.node] != iteration) {
              last_seen[e.node] = iteration;
              next_nodes.push_back(e.node);
            }
          }
      swap(nodes, next_nodes);
    }
    return prev[sink] != -1;
  }
  pair<flow_t, cost_t> solve_min_cost_flow(int source, int sink,
                                           flow_t flow_goal = FLOW_INF) {
    assert(V >= 0);
    flow_t total_flow = 0;
    cost_t total_cost = 0;
    while (total_flow < flow_goal && bellman_ford(source, sink)) {
      flow_t path_cap = flow_goal - total_flow;
      cost_t cost_sum = 0;
      for (int node = sink; prev[node] != -1; node = prev[node])
        path_cap = min(path_cap, prev_edge[node]->capacity);
      for (int node = sink; prev[node] != -1; node = prev[node]) {
        edge *e = prev_edge[node];
        e->capacity -= path_cap;
        reverse_edge(*e).capacity += path_cap;
        cost_sum += e->cost;
      }
      total_flow += path_cap;
      total_cost += cost_sum * path_cap;
    }
    return make_pair(total_flow, total_cost);
  }
};
const int AB_MAX = 1e9 + 5;
struct stock {
  int A, B, index;
  bool operator<(const stock &other) const { return B < other.B; }
};
int N;
vector<stock> owned, wanted;
bool possible(long long time) {
  vector<long long> have, need;
  long long largest = 0;
  for (int i = 0, left = 0, right = 0; i < N; i++) {
    while (left < N && owned[left].B <= owned[i].B) {
      largest = max(largest, owned[left].A * time + owned[left].B);
      left++;
    }
    while (right < N && wanted[right].B <= owned[i].B) {
      largest = max(largest, wanted[right].A * time + wanted[right].B);
      right++;
    }
    have.push_back(largest);
  }
  for (stock &s : wanted) need.push_back(s.A * time + s.B);
  sort(have.begin(), have.end());
  sort(need.begin(), need.end());
  for (int i = 0; i < N; i++)
    if (have[i] < need[i]) return false;
  return true;
}
int fewest_exchanges(long long time) {
  vector<stock> sorted_by_end;
  for (stock &s : wanted) sorted_by_end.push_back(s);
  sort(sorted_by_end.begin(), sorted_by_end.end(),
       [&](const stock &x, const stock &y) {
         return x.A * time + x.B < y.A * time + y.B;
       });
  vector<long long> ends(N);
  for (int i = 0; i < N; i++)
    ends[i] = sorted_by_end[i].A * time + sorted_by_end[i].B;
  int V = 4 * N + 2;
  int source = V - 2, sink = V - 1;
  min_cost_flow<int16_t, int16_t> graph(V);
  for (int i = 0; i < N; i++) {
    graph.add_directional_edge(source, i, 1, 0);
    graph.add_directional_edge(N + i, sink, 1, 0);
  }
  for (int i = 0; i < N; i++) {
    graph.add_directional_edge(2 * N + i, N + wanted[i].index, N, 0);
    if (i > 0) graph.add_directional_edge(2 * N + i, 2 * N + i - 1, N, 0);
  }
  for (int i = 0; i < N; i++) {
    graph.add_directional_edge(3 * N + i, N + sorted_by_end[i].index, N, 0);
    if (i > 0) graph.add_directional_edge(3 * N + i, 3 * N + i - 1, N, 0);
  }
  for (int i = 0; i < N; i++) {
    int count =
        upper_bound(wanted.begin(), wanted.end(), owned[i]) - wanted.begin();
    if (count > 0) graph.add_directional_edge(i, 2 * N + count - 1, 1, 1);
  }
  for (int i = 0; i < N; i++) {
    long long end = owned[i].A * time + owned[i].B;
    int count = upper_bound(ends.begin(), ends.end(), end) - ends.begin();
    if (count > 0) graph.add_directional_edge(i, 3 * N + count - 1, 1, 1);
  }
  long long largest = 0;
  for (int i = 0, left = 0, right = 0; i < N; i++) {
    while (left < N && owned[left].B <= owned[i].B) {
      largest = max(largest, owned[left].A * time + owned[left].B);
      left++;
    }
    while (right < N && wanted[right].B <= owned[i].B) {
      largest = max(largest, wanted[right].A * time + wanted[right].B);
      right++;
    }
    int count = upper_bound(ends.begin(), ends.end(), largest) - ends.begin();
    if (count > 0) graph.add_directional_edge(i, 3 * N + count - 1, 1, 2);
  }
  auto result = graph.solve_min_cost_flow(source, sink);
  assert(result.first == N);
  return result.second;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> N;
  owned.resize(N);
  wanted.resize(N);
  for (stock &s : owned) cin >> s.A >> s.B;
  for (stock &s : wanted) cin >> s.A >> s.B;
  sort(owned.begin(), owned.end());
  sort(wanted.begin(), wanted.end());
  for (int i = 0; i < N; i++) owned[i].index = wanted[i].index = i;
  int low = 0, high = AB_MAX;
  while (low < high) {
    int mid = (low + high) / 2;
    if (possible(mid))
      high = mid;
    else
      low = mid + 1;
  }
  if (low == AB_MAX) {
    cout << -1 << '\n';
    return 0;
  }
  cout << low << ' ' << fewest_exchanges(low) << '\n';
}