#include <bits/stdc++.h>
namespace chtholly {
char buf[1 << 23], *buf1 = buf, *buf2 = buf;
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  for (; !isdigit(c); c = getchar()) f ^= c == '-';
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ '0');
  return f ? x : -x;
}
template <typename mitsuha>
inline bool read(mitsuha &x) {
  x = 0;
  int f = 1;
  char c = getchar();
  for (; !isdigit(c) && ~c; c = getchar()) f ^= c == '-';
  if (!~c) return 0;
  for (; isdigit(c); c = getchar()) x = (x << 3) + (x << 1) + (c ^ '0');
  return x = f ? x : -x, 1;
}
template <typename mitsuha>
inline int write(mitsuha x) {
  if (!x) return 0 & putchar(48);
  if (x < 0) putchar('-'), x = -x;
  int bit[20], i, p = 0;
  for (; x; x /= 10) bit[++p] = x % 10;
  for (i = p; i; --i) putchar(bit[i] + 48);
  return 0;
}
inline char fuhao() {
  char c = getchar();
  for (; isspace(c); c = getchar())
    ;
  return c;
}
}  // namespace chtholly
using namespace chtholly;
using namespace std;
const int yuzu = 2e5, mod = 1e9 + 7;
typedef int fuko[yuzu | 10];
namespace dsu {
fuko fa;
void init(int n) {
  for (int i = 1; i <= n; ++i) fa[i] = i;
}
int find(int x) { return fa[x] ^ x ? fa[x] = find(fa[x]) : x; }
int mg(int u, int v) {
  int fu = find(u), fv = find(v);
  return fu ^ fv ? fa[fu] = fv, 1 : 0;
}
}  // namespace dsu
using dsu::find;
vector<int> lj[yuzu | 10];
fuko vis, cnt;
int bo;
void dfs(int u, int fa, int col) {
  vis[u] = 1, ++cnt[col];
  for (int v : lj[u]) {
    if (!vis[v])
      dfs(v, u, col);
    else if (v ^ fa)
      bo = v == u ? 1 : 2;
  }
}
int main() {
  int i = 1, n, u, v;
  long long llx = 1;
  dsu::init(n = read());
  for (i = 1; i <= n; ++i) {
    read(u), read(v);
    lj[u].push_back(v);
    lj[v].push_back(u);
  }
  for (u = 0, i = 1; i <= yuzu; ++i)
    if (!lj[i].empty() && !vis[i])
      bo = 0, dfs(i, 0, ++u), cnt[u] = bo ? bo : cnt[u];
  for (i = 1; i <= u; ++i) llx = llx * cnt[i] % mod;
  write(llx);
}
