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<string.h>

using namespace std;

//double solve(double n)

int main(void){

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

C++: #include <iostream>
#include <cstdlib>
int main(void){
	double a,s;
	int n;
	while (std::cin>>a){
		s=a;
		n=9;
		while(n--){
			if (n%2) a/=3;
			else a*=2;
			s+=a;
		}
		printf ("%.8f\n",s);
	}
}

C++: #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <complex>
#include <ctime>
#include <cstdlib>

using namespace std;

inline int to_int(string s) {int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string to_str(T x) {ostringstream sout; sout << x; return sout.str();}

typedef long long ll;

int main()
{
	double num, ans;
	while(cin >> num)
	{
		ans = num;
		num *= 2;
		ans += num;

		for(int i = 0; i < 4; i++)
		{
			num /= 3;
			ans += num;
			num *= 2;
			ans += num;
		}

		printf("%.10f\n" ,ans);
	}
}

C++: #include <bits/stdc++.h>
#define rep(i,l,n) for(int i=l;i<n;i++)
#define rer(i,l,n) for(int i=l;i<=n;i++)
#define all(a) a.begin(),a.end()
#define o(a) cout<<a<<endl
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pii;

int main(){
	double a[11]={},sum;
	while(cin>>a[1]){
		sum=a[1];
		rer(i,2,10){
			if(i%2) a[i]=a[i-1]/3;
			else a[i]=2*a[i-1];
			sum+=a[i];
		}
		printf("%.8lf\n",sum);
	}
}

C++: #include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>

using namespace std;

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

	return 0;
}

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

int main(void){
	double s[11];
	while(cin>>s[1]){
		for(int i=2;i<11;i++)s[i]=((i%2==1)?(s[i-1]*2):(s[i-1]/3));
		double sum=0;
		for(int i=1;i<11;i++)sum+=s[i];
		printf("%.8lf",sum);
	}
	return 0;
}

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

using namespace std;

float i_1;

float s_n;

float fib(int i){

  if(i == 0 )
  {
    return i_1;
  }

  //偶数番目
  if((i + 1) % 2 == 0){
    return fib(i-1)*2.0f;
  }else{
    return fib(i-1)/3.0f;
  }
}

int main(void){

    
  while(scanf("%f", &i_1) != EOF)
  {

      for(int i = 0; i < 10; i++)
      {
        s_n += fib(i);
        if(i == 9)
        {
          printf("%f\n", s_n);
        }
      }
      s_n = 0;
  }

  return 0;
}

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

int main(){

  double a[100] = {0};

  while(cin >> a[0]){
    
    for(int i=1;i<10;i++){
      if(i%2 == 1) a[i] = a[i - 1] * 2;
      else a[i] = a[i - 1] / 3;
    }

    for(int i=1;i<10;i++) a[0] += a[i];

    printf("%.8f\n",a[0]);
  }
}

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

int main(){
	double d;
	while(cin >> d){
		d *= 7.81481481;
		printf("%.7f\n",d);
	}
	return 0;
}

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

int main(){
	double x;
	while(cin >> x){
		cout << showpoint << setprecision(10)<< x * 211 / 27 << endl;
	} 
	return 0;
}

C++: 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

int main()
{
	double a;
	while(cin >> a)
	{
		double num[10]; num[0] = a;
		REP(i, 1, 10)
			num[i] = i % 2 ? num[i-1] * 2 : num[i-1] / 3;

		double res = 0;
		rep(i, 10)
			res += num[i];

		printf("%.10f\n", res);
	}
}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>

int main(){
	double a,current,sum;
	while(scanf("%lf",&a)!=EOF){
		current = a;
		sum = a;
		for(int i = 2; i <= 10; i++){
			if(i %2 == 0){
				current = current*2.0;
				sum += current;
			}else{
				current = current/3.0;
				sum += current;
			}
		}
		printf("%.8lf\n",sum);

	}

	return 0;
}

C++: #include<stdio.h>
#include<iostream>
#include<list>
#include<map>
#include<vector>
#include<algorithm>
#include<string.h>
#include<iomanip>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define debug(x) cout << x << endl;
using namespace std;

int main(){
    double a;
    double ans;
    while(cin >> a){
        ans = a;
        range(i,2,11){
            if(i % 2 == 0){
                a *= 2;
            }else{
                a /= 3;
            }
            ans += a;
        }
        cout << setprecision(10) <<ans << endl;
    }
}

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


using namespace std;

//vector<double> a;


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

}

C++: #include <iostream>

using namespace std;

main(){
  double a;
  while(cin >> a){
    double data[10];
    data[0]=a;
    for(int i=1;i<10;i++){
      if(i%2==1){
	data[i]=data[i-1]*2.0;
      }else{
	data[i]=data[i-1]/3.0;
      }
    }
    double ans=0.0;
    for(int i=0;i<10;i++) ans+=data[i];
    printf("%.8f\n", ans);
  }
  return 0;
}

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

int main(){
	for(int i=0;i<3;i++){
		double a,s[10],max=0;
		cin>>a;
		for(int j=0;j<10;j++){
			if(j==0) s[j]=a;
			
			else if(j%2==1)	s[j]=s[j-1]*2;
			
			else if(j%2==0) s[j]=s[j-1]/3;
		}
		for(int j=0;j<10;j++){
			max+=s[j];
		}
		cout<<setprecision(9)<<max<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
int main(void){
	double a,s;
	int n;
	while (std::cin>>a){
		s=a;
		n=9;
		while(n--){
			if (n%2) a/=3;
			else a*=2;
			s+=a;
		}
		printf ("%.8f\n",s);
	}
}