from collections import defaultdict


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)


def main():
    n = int(input())
    uf = UnionFind(2*10**5+1)
    d = defaultdict(int)
    for i in range(n):
        h, w = map(int, input().split())
        d[h] += 1
        d[w] -= 1
        uf.union(h, w)
    keys = list(d.keys())
    values = list(d.values())
    nodenum = len(d)
    for i in range(nodenum):
        if not uf.same(keys[0], keys[i]):
            return 0  

    zerocounter = values.count(0)
    if zerocounter == len(values):
        return len(values)
    elif zerocounter == len(values)-2 and values.count(1) == 1 and values.count(-1) == 1:
        return 1
    else:
        return 0


print(main())