#include <bits/stdc++.h>
using namespace std;
inline long long getint() {
  long long _x = 0, _tmp = 1;
  char _tc = getchar();
  while ((_tc < '0' || _tc > '9') && _tc != '-') _tc = getchar();
  if (_tc == '-') _tc = getchar(), _tmp = -1;
  while (_tc >= '0' && _tc <= '9') _x *= 10, _x += (_tc - '0'), _tc = getchar();
  return _x * _tmp;
}
inline long long add(long long _x, long long _y,
                     long long _mod = 1000000007ll) {
  long long _ = _x + _y;
  if (_ >= _mod) _ -= _mod;
  return _;
}
inline long long sub(long long _x, long long _y,
                     long long _mod = 1000000007ll) {
  long long _ = _x - _y;
  if (_ < 0) _ += _mod;
  return _;
}
inline long long mul(long long _x, long long _y,
                     long long _mod = 1000000007ll) {
  long long _ = _x * _y;
  if (_ >= _mod) _ %= _mod;
  return _;
}
long long mypow(long long _a, long long _x, long long _mod) {
  if (_x == 0) return 1ll;
  long long _tmp = mypow(_a, _x / 2, _mod);
  _tmp = mul(_tmp, _tmp, _mod);
  if (_x & 1) _tmp = mul(_tmp, _a, _mod);
  return _tmp;
}
long long mymul(long long _a, long long _x, long long _mod) {
  if (_x == 0) return 0ll;
  long long _tmp = mymul(_a, _x / 2, _mod);
  _tmp = add(_tmp, _tmp, _mod);
  if (_x & 1) _tmp = add(_tmp, _a, _mod);
  return _tmp;
}
inline bool equal(double _x, double _y) {
  return _x > _y - 1e-9 && _x < _y + 1e-9;
}
int __ = 1, _cs;
void build() {}
long long n, a[505050], b[505050], s, cnt, t;
inline void mark(int i) {
  for (int k = i + 1; k < n; k++)
    if ((b[k] >> i) & 1ll) b[k] ^= b[i];
}
void init() {
  n = getint();
  for (int i = 0; i < n; i++) {
    a[i] = getint();
    b[i] = getint() ^ a[i];
    s ^= a[i];
  }
  for (int i = 0; i < 60; i++) {
    bool got = false;
    for (int j = i; j < n; j++)
      if ((b[j] >> i) & 1ll) {
        got = true;
        swap(b[j], b[i]);
        mark(i);
        break;
      }
    if (got) cnt++;
    if (((s >> i) & 1ll) != ((t >> i) & 1ll)) t ^= b[i];
  }
}
void solve() {
  if (s != t) {
    puts("1/1");
    exit(0);
  }
  printf("%lld/%lld\n", (1ll << cnt) - 1, (1ll << cnt));
}
int main() {
  build();
  while (__--) {
    init();
    solve();
  }
}
