#include <cstdio>
#include <algorithm>
#include <string.h>

using namespace std;

char s[1005];
int v[1005];

void mult(int x){
    int i,T;
    T = 0;
    for(i = 1;i <= v[0];i++){
        v[i] *= x;
        v[i] += T;
        T = v[i]/10;
        v[i] %= 10;
    }
    while(T){
        v[++v[0]] = T%10;
        T /= 10;
    }
}

int main()
{
    freopen("sarpe.in", "r", stdin);
    freopen("sarpe.out", "w", stdout);
    int n,i;
    scanf("%s", s+1);
    n = strlen(s+1);
    for(i = 1;i <= n;i++){
        v[i] = s[i] - '0';
    }
    int j;
    for(i = 1,j = n;i < j;i++, j--){
        swap(v[i], v[j]);
    }
    v[0] = n;
    mult(4);
    for(i = v[0];i >= 1;i--){
        printf("%d", v[i]);
    }
    return 0;
}