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 Pascal (FPC 2.6.2) (judge verdict: Wrong Answer)

uses
  SysUtils,
  Classes;

 function JudgeFunc(const Value : Integer) : Integer;
	var
		i, j, k : Integer;
		arrayNum : array of Integer;
	begin
	Result := 0;
	SetLength(arrayNum, 5);
	arrayNum[0] := 3;
	arrayNum[1] := 5;
	arrayNum[2] := 7;
	arrayNum[3] := 11;
	arrayNum[4] := 13;
	if  not Odd(Value) then
		Exit(0);
	for i := 1 to Value do
		begin
		j := 0;
		for k := 0 to Length(arrayNum) - 1 do
			begin
			if i mod arrayNum[k] = 0then
				j := j + 1;
			end;
		if j = 3 then
			Inc(Result);
		end;
	end;
  
 procedure MainProc;
	var
		input : Integer;
		output : Integer;
	begin
	ReadLn(input);
	output := JudgeFunc(input);
	WriteLn(output);
	end;
  
begin
MainProc;
end.