def solve(self, n):
        l = 0
        h = 5 * n
        while l <= h:
            mid = (l + h) / 2
            cnt = self.prime_count(5, mid)
            if cnt < n:
                l = mid + 1
            else:
                h = mid - 1
        return l
component declares the local sizes and sets initial values
dataset/ETHPy150Open algorhythms/HackerRankAlgorithms/Manasa and Factorials.py/Solution.solve--crossover with--dataset/ETHPy150Open OpenMDAO/OpenMDAO/mpitest/test_distribcomp.py/DistribInputDistribOutputComp.setup_distrib