#include <stdio.h>
using namespace std;

#include <vector>
#include <algorithm>

#define in "sarpe.in"
#define out "sarpe.out"
#define NMAX 100000

int A[NMAX], B[NMAX], T[5];
vector<int> R;

void Inmultire(int A[], int B[]);
void Mul(int A[], int B);
void Add( int A[], int B[] );
void Scadere(int A[], int B[]);

int main()
{
    freopen( in, "r", stdin );
    freopen( out, "w", stdout );
    
    char c;
    while ( scanf( "%c", &c) && c != '\n' )
    {
          int x = (int)(c-48);
          R.push_back( x );
    }
    reverse( R.begin(), R.end() );
    A[0] = R.size();
    int i;
    for ( i = 1; i <= A[0]; ++i ) A[i] = R[i-1];
    R.clear();
    /*
    for ( i = 1; i <= A[0]; ++i )  
        printf( "%d", A[i] ); 
    */
    B[0] = A[0];
    for ( i = 1; i <= A[i]; ++i )
        B[i] = A[i];
    Inmultire( A, A );
    Scadere( A, B );
    T[0] = 1; T[1] = 2;
    Add( A, T );
    Mul( A, 2 );
            
    for ( i = A[0]; i >= 1; --i )  
        printf( "%d", A[i] );
    return 0;
}

void Inmultire(int A[], int B[])  
{  
      int i, j, t, C[NMAX];  
      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 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 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 Scadere(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]--);  
}