def smartNumber(n):
    def count_prime_factors(num):
        if num < 2:
            return 0
        count = 0
        d = 2
        while d * d <= num:
            if num % d == 0:
                count += 1
                while num % d == 0:
                    num //= d
            d += 1
        if num > 1:
            count += 1
        return count
    
    count = 0
    num = 2
    while True:
        if count_prime_factors(num) >= 3:
            count += 1
            if count == n:
                return num
        num += 1