Problem:
Score: 200 points

Problem Statement

The number 105 is quite special - it is odd but still it has eight divisors.
Now, your task is this: how many odd numbers with exactly eight positive divisors are there between 1 and N (inclusive)?

Constraints

N is an integer between 1 and 200 (inclusive).

Input

Input is given from Standard Input in the following format:

N

Output

Print the count.

Sample Input 1

105

Sample Output 1

1

Among the numbers between 1 and 105, the only number that is odd and has exactly eight divisors is 105.

Sample Input 2

7

Sample Output 2

0

1 has one divisor. 3, 5 and 7 are all prime and have two divisors. Thus, there is no number that satisfies the condition.

Solution in Fortran (gfortran v4.8.4) (judge verdict: Accepted)

program main
  implicit none
  integer :: N
  integer,allocatable  :: divisor(:)
  integer :: out
  integer :: i,j 
  read (*,*) N
  allocate(divisor(N))
  divisor = 0
  do i = 1, N
     do j = 1, i
        if (mod(i,j) ==0 ) then
           divisor(i) = divisor(i)+1
        end if
     end do
  end do
  out = 0
  do i = 1, N
     if ( mod(i,2) /= 0 .and. divisor(i) == 8 ) then
        out = out + 1
     end if
  end do
  write(*,'(i0)') out 
  stop
end program main