#include <cstdio>
#include <string>
#define DIM 10000000
using namespace std;
int i,a[DIM],n,b[DIM],d[DIM],c[DIM];
char t[DIM];
void mul(int A[], int B)
{
      int i, t = 0;
      for (i = 1; i <= A[0] || t; i++, t /= 10)
              A[i] = (t += A[i] * B) % 10;
      A[0] = i - 1;
}
void mulm(int A[], int B[])
{
      int i, j, t, C[100000];
      memset(C, 0, sizeof(C));
      for (i = 1; i <= A[0]; i++)
      {
              for (t=0, j=1; j <= B[0] || t; j++, t/=10)
                      C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%10;
              if (i + j - 2 > C[0]) C[0] = i + j - 2;
      }
      memcpy(A, C, sizeof(C));
}
void sub(int A[], int B[])
{
      int i, t = 0;
      for (i = 1; i <= A[0]; i++)
              A[i] += (t = (A[i] -= B[i] + t) < 0) * 10;
      for (; A[0] > 1 && !A[A[0]]; A[0]--);
}
void add(int A[], int B[])
{
      int i, t = 0;
      for (i=1; i<=A[0] || i<=B[0] || t; i++, t/=10)
              A[i] = (t += A[i] + B[i]) % 10;
      A[0] = i - 1;
}
void solve()
{
    for (i=n-1; i>=0; --i) a[i+1]=(t[i]-'0');
    a[0]=n;
    for (i=a[0]; i>=1; --i) b[i]=a[i]; b[0]=a[0];
    c[0]=1;c[1]=1;
    sub (b,c);
    c[0]=1;c[1]=2;
    for (i=a[0]; i>=1; --i) d[i]=a[i]; d[0]=a[0];
    sub (d,c);
    mul(a,4);
    mul (b,2);
    mulm (b,d);
    add (a,b);
    for (i=a[0]; i>=1; i--) printf("%d",a[i]);
}   
int main()
{
    freopen ("sarpe.in","r",stdin);
    freopen ("sarpe.out","w",stdout);
    scanf ("%s\n",&t);
    n = strlen (t);
    if (n==1 && t[0]=='1') printf("2"); 
    else solve();
return 0;
}