Company: Airtel_24sep
Difficulty: medium
Count Perfect Sums Problem Description You are given a number N. Your task is to calculate the number of perfect sums in the range 1 to N. A number is called a Perfect Sum if it can be expressed as the sum of a perfect square and a perfect cube. For example, 9 is a perfect sum as it can be expressed as 2² + 1³. Input format: The input consists of a single line: The first and only line consists of a single integer N. The input will be read from the STDIN by the candidate Output format: Print the number of Perfect Sums in the range 1 to N. The output will be matched to the candidate's output printed on the STDOUT Examples Example 1: Input: 5 Output: 2 Explanation: The two perfect sums are 2 and 5. As 2 can be expressed as the sum of 1² and 1³ whereas 5 can be represented as the sum of 2² and 1³. Constraints 1 ≤ N ≤ 10⁵ Instructions Program should take input from standard input and print output to standard output. Your code is judged by an automated system, do not write any additional wel