from heapq import * heap = [] segs = [] n = int(input()) for _ in range(n): segs.append(list(map(int, input().split()))) segs.sort() for l, r in segs: if heap and l > heap[0]: heappop(heap) heappush(heap, r) print(len(heap))