Count Special Numbers

Problem Statement

Count Special Numbers Problem Description Philip is taking a surprise test. The problem in the test includes a range of integers from 1 to N (inclusive) where the candidates need to find the count of the Special Numbers in the range. The teacher describes Special Numbers as numbers that cannot be written in the form c d , where c and d are positive integers greater than 1. Your task is to help Philip find and return a string value representing the count of Special Numbers in the given range of 1 to N. Implement the function specialNumbers(input1) , where input1 is the string N, and return the count as a string. Input Format A single line containing the integer N, written in decimal without a sign or leading zeros. This is input1 . (inferred - the source passes N to the function as a string and shows no stdin layout; one line holding N is used here.) Output Format Print a single integer: the number of Special Numbers among the integers 1, 2, ..., N. Constraints 1 <= N <= 10 18 (in