Escape the Cube Tower

After waking up, Little Blue finds herself trapped in a towering tower with exactly \(2025\) floors. On each floor, a cube number is engraved: from \(1^3\), \(2^3\), \(3^3\) to \(2025^3\). At the top, a door bears the inscription: "To leave this tower, you must determine the number of cube numbers whose units digit is \(3\)."

It is known that the cube of an integer \(n\) ends in \(3\) if and only if \(n \bmod 10 = 7\) (since \(7^3 = 343\)). Your task is to compute the number of such floors in the tower.

For instance, among the cube numbers from \(1^3\) to \(2025^3\), count those whose last digit is \(3\) and help Little Blue escape in time for the upcoming contest.

inputFormat

This problem does not require any input. Any provided input should be ignored.

outputFormat

Output a single integer representing the count of cube numbers (from \(1^3\) to \(2025^3\)) whose units digit is \(3\).

sample

dummy

202