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<stdio.h>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<queue>
#include<functional>
#include<iomanip>

#define INF 114514810

using namespace std;


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

		cout << setprecision(10);
		cout << sum << endl;
		sum = 0;

	}
	

	return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<vector>
#include<cmath>
#include<cstring>
#include<cstdio>
#include<time.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define rp(a) while(a--)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(){
	double in;
	while(cin>>in){
		double sum=in;
		loop(i,2,11){
			if(i%2)in/=3.0;
			else in*=2;
			sum+=in;
		}
		printf("%.9f\n",sum);
	}
}

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(9) << res << endl;
  return (0);
}

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

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

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main(){
	double n;
	while(cin >>n){
		double a[10] = {n},sum = n;
		for(int i=1; i<10; i++){
			if(i%2 == 0){a[i] = a[i-1]/3;}
			else{a[i] = a[i-1]*2;}
			sum+=a[i];
		}
		printf("%.8lf\n",sum);
	}
	return 0;
}

C++: #define _USE_MATH_DEFINES
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<bitset>
#include<cctype>
#include<climits>
#include<cmath>
#include<cstdio>
#include<deque>
#include<list>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;

int main() {
	cout << fixed << setprecision(8);
	for (double a; cin >> a;) {
		double s = a;
		for (int i = 2; i <= 10; i++) {
			s += (i % 2) ? a = a / 3 : a = a * 2;
			cout << a << endl;
		}
		cout << s << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
main(){double d;while(std::cin>>d)printf("%.7f\n",633*d/81);}

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

double oddsequence(double a) {
  return a / 3.0;
}

double evensequence(double a) {
  return a * 2.0;
}

int main() {
  double a[11] = {0};
  double sum;
  while (cin >> a[1]) {
    for(int i=1;i<10;i++) {
      if((i + 2) % 2 == 0) { //i = even
        a[i+1] = oddsequence(a[i]);
      }
      else { //i = odd
        a[i+1] = evensequence(a[i]);
      }
    }
    for(int i=1;i<11;i++) {
      sum += a[i];
    }
    printf("%.8lf\n",sum);
    sum = 0;
  }
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
#include<list>

using namespace std;

typedef  long long int lint;

#define rep(i, n) for (lint i = 0; i < n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define mp make_pair
#define IP pair<int,int>
#define enld endl

int main() {
	double a;
	while (cin >> a) {
		vector<double>A(10);
		A[0] = a;
		for (lint i = 1; i < 10; i++) {
			if (i % 2 == 0) {
				A[i] = A[i - 1] / 3.0;
			}
			else {
				A[i] = A[i - 1] * 2.0;
			}
		}
		double sum = 0;
		rep(i, 10) {
			sum += A[i];
		}
		cout <<fixed<<setprecision(10)<< sum << endl;
	}
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>

using namespace std;
 
int main()
{
	double a;
	while(cin>>a){
		printf("%.10f\n",(81+162+54+108+36+72+24+48+16+32)*a/81);
	}


	return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;
#define rep2(x,from,to) for(int x = (from); x < (to); ++(x))
#define rep(x,to) rep2(x,0,to)

int main() {
	double d;
	while(scanf("%lf", &d) != EOF) {
		double r[10];
		r[0] = d;
		rep2(i,1,10) {
			if(i % 2) r[i] = r[i-1] * 2;
			else r[i] = r[i-1] / 3;
		}
		double ret = 0;
		rep(i,10) {
			ret += r[i];
		}
		printf("%.8lf\n", ret);
	}
	return 0;
}

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

using namespace std;

int main(void){

  double n;
  while( cin >> n ){

    double ans = n;
    for( int i = 2 ; i <= 10 ; i++ ){
      if( i % 2 == 0 ){
        n *= 2;
        ans += n;
      }
      else {
        n /= 3; 
        ans += n;
      }
    }
    printf("%.8f", ans);
  }
  return 0;
}

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

int main(){
  double a, ans;
  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 <bits/stdc++.h>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define rrep()
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF (int)1e9
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
typedef long long int ll;
typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;

int main(){
    double n;
    while(cin>>n){
    double ans=n;
    rep(i,0,9){
        if(i%2==0)n*=2;
        else n/=3;
        ans+=n;
    }
    cout<<ans<<endl;
    }
    
    
    
    return 0;
}

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

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

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

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