Guys don’t misinterpret this it is three only.

-----Input:-----
- First line will contain an integer $X$.

-----Output:-----
A single line containing the answer to the problem modulo 1000000007.

-----Constraints-----
- $1 \leq X < 10^5$

-----Sample Input 1:-----
1

-----Sample Output 1:-----
3

-----Sample Input 2:-----
2

-----Sample Output 2:-----
14

Difficulty: interview

Starter code:

Solutions:
# cook your dish here
try:
 X=int(input())
 m=1000000007
 a=X+X**(2)+X**(3)
 a=a%m
 print(a)
except:
 pass

# cook your dish here
try:
 X=int(input())
 m=1000000007
 a=X+X**(2)+X**(3)
 a=a%m
 print(a)
except:
 pass

# cook your dish here
n=1000000007
x=int(input())
s=(x+x**2+x**3)%n
print(s)


# cook your dish here
n=1000000007
x=int(input())
s=((x+(x**2)%n)%n+(x**3)%n)%n
print(s)


# your code goes here
n=int(input())
s=0
for i in range(1,4):
 s+=pow(n,i)
print(s%1000000007)

# cook your dish here
n=int(input())
x=n+(pow(n,2))+(pow(n,3))
print(x%1000000007)

n = int(input())
a = (n*n)%1000000007
b = (a*n)%1000000007
c = (a+n)%1000000007
c = (c+b)%1000000007
print(c)