}

 #include<cstdio>

 #include<cstring>

 #include<iostream>

 using namespace std;

 const int maxn = ;

 int f[maxn];

 int main()

 {

     int n;

     while (cin >> n)

     {

         memset(f, , sizeof(f));

         int len = ;

         f[] = ;

         for (int i = ; i <= n; i++)

         {

             int c = ;

             for (int j = ; j < len; j++)

             {

                 int t = f[j] * i + c;

                 f[j] = t % ;

                 c = t / ;

             }

             if (c) f[len++] = c;

         }

         int ans = ;

         for (int i = len - ; i >= ; i--) {

             while (f[i])

             {

                 int t = f[i] % ;

                 ans += t;

                 f[i] /= ;

             }

         }

         cout << ans << endl;

     }

     return ;

 }