For this Question: Given an integer N, your task is to print all the Armstrong numbers which are present between 1 to N.

<b>A number is said to Armstrong if it is equal to sum of cube of its digits. </b>The input contains a single integer N.

Constraints:-
1 < = N < = 1000Print all the number which are armstrong numbers less than equal to N.Sample Input:-
2

Sample Output:-
1

Sample input:-
4

Sample Output:
1, I have written this Solution Code: import math 
n= int(input())
for i in range (1,n+1):
    arm=i
    summ=0
    while(arm!=0):
        rem=math.pow(arm%10,3)
        summ=summ+rem
        arm=math.floor(arm/10)
    if summ == i :
        print(i,end=" "), In this Programming Language: Python, Now tell me if this Code is compilable or not?