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<bits/stdc++.h>
using namespace std;

int main(){
    double a;
    while(cin>>a){
        double S=a;
        for(int i=0;i<9;i++){
            a=((i&1)?a/3:a*2);
            S+=a;
        }
        cout<<S<<endl;
    }

    return 0;
}

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

int main(){
	// a( n + 1 ) = a( n ) * 2
	// a( n + 1 ) = a( n ) / 3
	double input;
	while ( cin >> input ){
		double sum = input;
		for ( int i = 0; i < 9; ++i ){
			if( !( i % 2 ) ) input *= 2;
			else input /= 3;
			sum += input;
		}
		cout << setprecision( 8 ) << setiosflags( ios::fixed );
		cout << sum << endl;
	}
	return 0;
}

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

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

	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <map>
#include <numeric>
using namespace std;

#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >> j; v.push_back(j);}
#define ALL(v) v.begin(), v.end()
#define print(s) cout << (s) << endl

vector<double> seq;

void solve55(double a) {
    seq.clear();
    seq.push_back(a);
    for (int i = 1; i < 10; i++) {
        if (i % 2 == 1) {
            seq.push_back(seq.back() * 2);
        }else {
            seq.push_back(seq.back() / 3);
        }
    }
    double sum = 0;
    REP(i,10) {
        sum += seq[i];
    }
    printf("%.6f\n", sum);
}

int main() {
    double a;
    while(cin >> a) {
        solve55(a);
    }
    return 0;
}

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

using db = double;
using ll = long long;
using vi = vector <int>;
#define op operator
#define pb push_back

db a[11];

int main() {
	cout << fixed << setprecision(9);
	ios :: sync_with_stdio(0);

	while(cin >> a[1]) {
		for(int i = 2; i <= 10; i ++)
			if(i & 1)
				a[i] = a[i - 1] / 3;
			else
				a[i] = a[i - 1] * 2;
		cout << accumulate(a + 1, a + 11, 0.0) << '\n';
	}

	return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<vector>
#include<queue>
#include<list>
#include<stack>
#include<algorithm>
#include<cmath>
#include<memory>

using namespace std;

int main()
{
  const double c = 633.0 / 81.0;
  double a;

  while ( cin >> a )
    cout << fixed << setprecision(7) << c * a << endl;
  
  return 0;
}

C++: #include<iostream>
#include<fstream>
#include<sstream>
#include<cstdio>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
#include<cstdlib>
#include<climits>
#include<utility>
#include<cctype>
using namespace std;

#define ull unsigned long long
#define ll long long
#define rep(i,j) for(int i=0;i<j;++i)
#define loop(i,a,j) for(int i=a;i<j;++i)
#define mpi(it,table,T,E) for(map<T,E>::iterator it = table.begin();it!=table.end();++it)
#define PI 3.141592654
/*
ifstream fin("input.txt");
ofstream fout("output.txt");
#define cin fin
#define cout fout
*/

double mat[11]; 

double solve(int n){
	if( n == 1)return mat[1];
	if( n % 2 == 0){
		return mat[n] =  solve(n-1)*2.0;
	}
	return mat[n] = solve(n-1)/3.0;
}

int main(){
	double a ;
	while(scanf("%lf",&a) != EOF){
		memset(mat,0,sizeof(mat));
		mat[1] = a;
		solve(10);
		loop(i,1,11)mat[0] += mat[i];
		printf("%.8lf\n",mat[0]);
	}
	return 0;
}

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

int main()
{
	double a;
	while(cin >> a){
		double 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("%.6lf\n",sum);
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
#include <numeric>
#include <iomanip>
#define fi first
#define se second
#define fcout(n) cout<<fixed<<setprecision((n))
using namespace std;
bool value(int y,int x,int R,int C){return 0<=y&&y<R&&0<=x&&x<C;}
typedef pair<int,int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
double pie=acos(-1);
int INF=10000009;
int dx[4] = { 0,-1,0,1 };
int dy[4] = { -1,0,1,0 };
int main() {
	long double a,s[15],sum=0;
	while(true){
		cin>>a;
		s[0]=a;
		for(int i=1;i<10;i++){
			if(i%2!=0){
				s[i]=2.00000000000*s[i-1];
			}
			else{
				s[i]=s[i-1]/3.000000000;
			}
		}
		for(int i=0;i<10;i++){
			sum+=s[i];
		}
		fcout(8)<<sum<<endl;
		sum=0;
	}	
}

C++: #include <iostream>
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 <cstdio>
#include <iostream>
using namespace std;

int main()
{
  double a;

  while (cin >> a){
     a *= (7.8148148148);
    printf("%.10f\n", a);
  }

  return 0;
}

C++: #include<iostream>
#include<cmath>
#include<iomanip>
using namespace std;
double a, ans;
int main(){
  while(cin >> a){
    ans = a;
    for(int i = 2; i <= 10; i++){
      if(i % 2 == 0) a*= 2;
      else a/= 3; 
      ans += a; 
    }
    cout << fixed << setprecision(8) << endl; 
  }
}

C++: #include <stdio.h>
int main(){
    double a[10],ans;
    while(scanf("%lf",&a[0])!=EOF){
        ans=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;
            }
            ans+=a[i];
        }
        printf("%lf\n",ans);
    }
}

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

int main() {
	double n;
	while(cin >> n){
		double ans = n;
		double prev = n;
		for(int i = 2; i <= 10; ++i){
			if(i % 2){
				prev = prev / 3.0;
				ans += prev;
			}
			else{
				prev = prev * 2.0;
				ans += prev;
			}
		}
		printf("%f\n", ans);
	}
	return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>
#include <string>
#include <cmath>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <iostream>
#include <climits>
#include <cfloat>


using namespace std;


int main()
{
	double a;
	while (scanf("%lf\n", &a) != EOF)
	{
		double arr[10];
		arr[0] = a;
		for (int i = 1; i < 10; ++i)
			arr[i] = (i&1) ? arr[i-1] * 2 : arr[i-1] / 3;
		double s = 0;
		for (int i = 0; i < 10; ++i)
			s += arr[i];
		printf("%.8f\n", s);
	}

	return 0;
}

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

int main(void){
  double a; cin >> a;
  double ans = a;
  for(int i=2; i <= 10; i++){
    if(i%2 == 0){
      a = a * 2;
      ans += a;
    }else{
      a = a / 3;
      ans += a;
    }
  }
  printf("%.9f\n", ans);
  return 0;
}