#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T, class U>
inline void print(T first, U second) {
  printsp(first);
  println(second);
}
template <class T, class U, class V>
inline void print(T first, U second, V z) {
  printsp(first);
  printsp(second);
  println(z);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
vector<int> adj[101010];
int first[101010], second[101010], vst[101010], q[101010], qf, qb;
pair<pair<int, int>, int> p[101010];
int main() {
  int n;
  gn(n);
  for (int i = 0; i < n; i++)
    gn(p[i].first.first, p[i].first.second), p[i].second = i,
                                             first[i] = p[i].first.first,
                                             second[i] = p[i].first.second;
  sort(p, p + n);
  for (int i = 0, j; i < n; i = j) {
    for (j = i + 1; j < n; j++)
      if (p[i].first.first == p[j].first.first) {
        adj[p[j].second].push_back(p[j - 1].second);
        adj[p[j - 1].second].push_back(p[j].second);
      } else
        break;
  }
  for (int i = 0; i < n; i++) swap(p[i].first.first, p[i].first.second);
  sort(p, p + n);
  for (int i = 0, j; i < n; i = j) {
    for (j = i + 1; j < n; j++)
      if (p[i].first.first == p[j].first.first) {
        adj[p[j].second].push_back(p[j - 1].second);
        adj[p[j - 1].second].push_back(p[j].second);
      } else
        break;
  }
  int ans = 1;
  for (int i = 0; i < n; i++)
    if (!vst[i]) {
      qf = qb = 0;
      q[qb++] = i;
      map<int, int> mpx, mpy;
      vst[i] = 1;
      while (qf < qb) {
        int u = q[qf++];
        mpx[first[u]] = 0;
        mpy[second[u]] = 0;
        for (int j = 0; j < adj[u].size(); j++) {
          int v = adj[u][j];
          if (vst[v]) continue;
          q[qb++] = v;
          vst[v] = 1;
        }
      }
      ans = (long long)ans *
            (power(2, mpx.size() + mpy.size(), 1000000007) -
             ((mpx.size() + mpy.size()) > qb)) %
            1000000007;
    }
  println(ans);
  return 0;
}
