#include <bits/stdc++.h>
using namespace std;

int main() {
     
    int n;
    cin >> n;
    vector<int> arr(10);
    for (int i=0; i<=9; i++)
    {
        int p = pow(i, n);
        arr[i] = p;
    }
    int S = 0;
    for (int i=100; i<1000000; i++)
    {
        int num = i, sum=0;
        while(num>0)
        {
            int z = num%10;
            sum = sum+arr[z];
            num = num/10;
        }
        if (sum==i) S = S + sum;
    }
    cout << S;
    return 0;
}

MIN = 2
MAX = 1000000


def compute(value):
    ans = sum(i for i in range(MIN, MAX)
              if i == power_digit_sum(value, i))
    return str(ans)


def power_digit_sum(value, n):
    return sum(int(c) ** value for c in str(n))


if __name__ == "__main__":
    value = int(input())
    print(compute(value))

def Digit_Nth_Powers(n,lower,upper):
  sumList = 0

  for i in range(lower,upper):
    digits = list(map(int,str(i)))
    tempSum = 0

    for j in digits:
      tempSum += j**n
    
    if i == tempSum:
      sumList += i
        
  return sumList

if __name__ == '__main__':
  n = int(input())
  
  # Lower and upper limit is determined by experiments for faster code execution
  if n == 3:
    lower,upper = [1*(10**2), 1*(10**3)]
  elif n == 4:
    lower,upper = [1*(10**3), 1*(10**4)]  
  elif n == 5:
    lower,upper = [2*(10**3), 2*(10**5)]
  elif n == 6:
    lower,upper = [1*(10**5), 6*(10**5)]
    
  sumList = Digit_Nth_Powers(n,lower,upper)
  print(sumList)

N = int(input())
c = []
for i in range(2, 10000000):
    cnt = 0
    for j in str(i):
        cnt += int(j) ** N
    if cnt == i:
        c.append(cnt)
print(c)