def tasks(A):
    n = len(A)
    score = 0
    last = -1
    A.sort(key = sortSec)
    for i in range(n):
        if (A[i][0] >= last):
            score += 1
            last = A[i][1]
    return score