Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)

func read() string {
	sc.Scan()
	return sc.Text()
}

func main() {
	sc.Split(bufio.ScanLines)
	for sc.Scan() {
		n, _ := strconv.ParseFloat(sc.Text(), 64)
		ans := n
		sum := n
		for i := 2; i <= 10; i++ {
			if i%2 == 0 {
				ans *= 2
				sum += ans
			} else {
				ans /= 3
				sum += ans
			}
		}
		fmt.Println(sum)
	}
}

C++: #include <iostream>
#include <iomanip>
#include <cassert>
#include <algorithm>
#include <functional>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <map>
#include <bitset>
#include <sstream>
#include <istream>
#include <cmath>
#include <cstdio>

using namespace std;

#define vci vector<int>
#define vcs vector<string>
#define pb push_back
#define sz size()
#define mapii map<int, int>
#define mapci map<char, int>
#define mapsi map<string, int>
#define all(x) x.begin(), x.end()
#define minit(a, i) memset(a, i, sizeof(a));

#define for_(i, a, b) for (int i=(int)a; i<(int)b; i++)
#define for_d(i, a, b) for (int i=(int)a-1; i>=b; i--)
#define for_r(i, a, b, c) for (int i=(int)a; i<(int)b; i += c)
#define for_dr(i, a, b, c) for (int i=(int)a-1; i>=b; i -= c)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

typedef long long ll;
typedef double D;

const int iINF = 2147483647;
const ll lINF = 9223372036854775807;

template <class T> inline void dbg(T t) { cout << t << endl; }



double solve(double a0) {
	vector<D> a(10); a[0] = a0;
	D ret = a0;
	for_(i, 1, 10) {
		if (i%2 == 1) {
			a[i] = a[i-1]*2.0;
		} else {
			a[i] = a[i-1]/3.0;
		}
		ret += a[i];
	}
	return ret;
}

int main() {
	D a0;
	
	while (cin>>a0) {
		if (cin.eof()) break;
		cout << solve(a0) << endl;
	}	
	
	return 0;
}

C++: #include <iostream>
#include <iomanip>

using namespace std;

int main() {
  long double a;
  while (cin >> a) {
    long double sum = a;
    for (int i = 2; i <= 10; ++i) {
      if ((i % 2) == 0)
        a = a * 2;
      else
        a = a / 3;
      sum += a;
    }
    cout << fixed;
    cout << setprecision(8) << sum << endl;
  }
}

C++: #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>

using namespace std;

#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr)/sizeof(value), (value))
template <typename T>
void FILL_(void * ptr, size_t size, T value){
  std::fill((T*)ptr, (T*)ptr+size, value);
}
//4方向ベクトル→↑←↓
int dx[] ={1,0,-1,0};
int dy[] ={0,-1,0,1};
double a[11];
int main()
{
  while(cin>>a[1]){
    a[0] = 0;
    double sum = 0;
    for(int i = 2;i <=10;i++){
      a[i] = 0;
    }
    sum = a[1];
    for(int i = 2;i <= 10;i++){
      if(i%2){
	a[i] =a[i-1]/3;
      }else{
	a[i] =a[i-1]*2;
      }
      sum +=a[i];
    }
    printf("%.8lf\n",sum);
  }
  return 0;
}

C++: #include <stdio.h>

int main(void) {

  double a[10];
  double s;
  int i;

  scanf("%lf",&a[0]);
 
  for(i=0;i<4;i++) {

    a[2*i+1]=2.0*a[2*i];
    a[2*i+2]=a[2*i+1]/3.0;

  }

  a[9]=2.0*a[8];

  s=0.0;

  for(i=0;i<10;i++) {
    
    s+=a[i];

  }

  printf("%.8lf",s);

  return 0;

}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){

  long double a,sum;

  while(cin>>a){
    sum=a;

    for(int i=2; i<=10; i++){
      if(i%2==0){
	a*=2.0;
	sum += a;
      }
      else{
	a/=3.0;
	sum += a;
      }
    }

    printf("%.8Lf\n",sum);

  }

  return 0;
}

C++: #include <iostream>

using namespace std;

int main(void) {
    double a, s;
    while (true) {
        cin >> a;
        s = a;
        if (cin.eof()) break;;
        for (int i = 2; i <= 10; i++) {
            if (i % 2 == 0) {
                a = a * 2;
                s += a;
            } else {
                a = a / 3;
                s += a;
            }
        }
        cout << s << endl;
    }
    return 0;
}

C++: #include <string>
#include <iostream>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

const double EPS = 1e-9;

int main(){
	double n;

	while(cin >> n){
		double sum = n;
		for(int i = 2; i <= 10; i++){
			if(i%2 == 0){
				n*=2;
			}else{
				n/=3;
			}
			sum += n;
		}
		cout.flags(ios::fixed);
		cout.precision(8);

		cout << sum << endl;
	}
	
    return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;

int main() {
	double n,sum;
	while(cin>>n){
		sum=n;
		for(int i=2;i<=10;i++){
			if(i%2==0){
				n*=2;
				sum+=n;
			}else{
				n/=3;
				sum+=n;
			}
		}printf("%.8lf\n",sum);
	}
	return 0;
}

C++: #include<stdio.h>

int main(){
	double wa,a;
	int i;
	
	while(0<=scanf("%lf",&a)){
		wa=a;
		for(i=2;i<11;i++){
			if(i%2==0){
				a=2*a;
				wa+=a;
			}else{
				a=a/3;
				wa+=a;
			}
		}
		printf("%.8lf\n",wa);
	}
	return 0;
}

C++: #include <iostream>
#include <iomanip>
using namespace std;

int main()
{
  double s[10], res;
  
  cin >> s[0];
  res = s[0];
  for (int i = 1; i < 10; i++){
    if (i % 2 == 0){
      s[i] = s[i - 1] / 3;
    }
    else {
      s[i] = s[i - 1] * 2;
    }
    res += s[i];
  }

  cout << setprecision(10) << res << endl;
  return (0);
}

C++: #define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<list>
#include<stack>
#include<queue>
#include<cctype>
#include<iomanip>
#include<functional>
#include<numeric>
#include<map>
#include<set>
#define EPS 1e-10
using namespace std;
typedef long long llong;
void print(double *a) {
	for (int i = 0; i < 10; i++) {
		if (i)cout << " ";
		cout << a[i];
	}
}
int main() {
	cout << setprecision(10);
	double a;
	while (cin >> a) {
		double s[10];
		s[0] = a;
		for (int i = 1; i < 10; i++) {
			if (i & 1) {
				s[i] = s[i - 1] * 2;
			}
			else {
				s[i] = s[i - 1] / 3;
			}
		}
		//print(s);
		double sum = 0;
		for (int i = 0; i < 10; i++)sum += s[i];
		cout <<sum << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <array>

using namespace std;

double a_1;
double s_n;
array<double , 10> arr ;

double fib(int i){
  if(i != 1){
      if(i % 2 == 0){
        arr[i] = arr[i-1] * 2;
      }else{
        arr[i] = arr[i-1] / 3;
      }
      
  }
  
  return arr[i];
}

int main(void){

  std::cin >> a_1;
  arr[1] = a_1;
  scanf("%lf", &a_1);

  for(int i = 1; i <= 10; i++){
    s_n += fib(i);
    if(i == 10){
      printf("%lf", s_n);
    }
  }

  return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std ;

int main()
{
	double ary[10] ;

	while( cin >> ary[0] )
	{
		double sum = ary[0] ;
		for( int i = 1 ; i < 10 ; i ++ )
		{
			if( i %2 == 1 ){ ary[i] = ary[i-1]*2 ; }
			else if( i %2 == 0 ){ ary[i] = ary[i-1]/3 ; }
			sum += ary[i] ;
		}
		printf("%.8f\n",sum) ;
	}
	return 0 ;
}

C++: #include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MP make_pair
#define PB push_back
#define MOD 1000000007
#define INF (1LL<<30)
#define LLINF (1LL<<60)
#define PI 3.14159265359
#define EPS 1e-12
#define int ll

signed main(void)
{
  long double a;
  while(cin >> a) {
    long double ret = 0;
    FOR(i, 1, 11) {
      ret += a;
      if(i%2) a *= 2;
      else a /= 3;
    }
    cout << fixed << setprecision(15) << ret << endl;
  }

  return 0;
}