Problem:
Score : 100 points

Problem Statement

Given an integer a as input, print the value a + a^2 + a^3.

Constraints

1 \leq a \leq 10

a is an integer.

Input

Input is given from Standard Input in the following format:

a

Output

Print the value a + a^2 + a^3 as an integer.

Sample Input 1

2

Sample Output 1

14

When a = 2, we have a + a^2 + a^3 = 2 + 2^2 + 2^3 = 2 + 4 + 8 = 14.

Print the answer as an input. Outputs such as 14.0 will be judged as incorrect.

Sample Input 2

10

Sample Output 2

1110

Solution in C++ (GCC 9.2.1) (judge verdict: Memory Limit Exceeded)

#include <bits/stdc++.h>
#define ll long long int
using namespace std;
#define mod 1000000007

long long int fastexpo(long long int a, long long int b)
{
    long long int ans = 1;
    while (b)
    {
        if (b & 1)
            ans = (ans * a) % mod;
        b = b / 2;
        a = (a * a) % mod;
    }
    return ans;
}
bool vis[500000000] = {0};
bool child[50000000] = {0};
vector<int> vec[50000000];
int ans = 1;
int bfs(int node)
{
    queue<int> qu;
    qu.push(node);
    while (!qu.empty())
    {
        int t = qu.front();
        vis[t] = 1;
        qu.pop();
        //  cout << t << "\n";
        for (int i = 0; i < vec[t].size(); i++)
        {
            if (child[t])
                if (!vis[vec[t][i]])
                {
                    qu.push(vec[t][i]);
                    vis[vec[t][i]] = 1;
                    //  child[vec[t][i]] = 1;
                    ans++;
                }
            if (!child[t])
            {
                if (!vis[vec[t][i]])
                {
                    qu.push(vec[t][i]);
                    vis[vec[t][i]] = 1;
                    child[vec[t][i]] = 1;
                    //ans++;
                }
            }
        }
    }
    return ans;
}

int main()
{
    int a;
    string str;
    cin >> a;
    cout << a + a * a + a * a * a << "\n";

    return 0;
}