Problem Statement

In java the task is to take two integers that specify a range and output the

quantity of prime numbers that exist in that range, inclusive of the

specified boundaries. For example, the quantity of prime numbers

that exist between $7$ and $19$ is $5($namely $7,11,13,17$ and $19).$

Input Format

An int representing one of the boundaries

An int representing another of the boundaries

Output Format

An int representing the quantity of prime numbers that exist within

that range, inclusive of the boundaries

Constraints

All inputs $>=0,<=$ max int

Sample Input

$7$

$19$

Sample Output

$5$