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(void) {
    double a,sum;
    sum=0;
    std::deque<double> deq;
    while (cin>>a) {
        deq.emplace_back(0);
        deq.emplace_back(a);
        for (int i=2;i<11;i++) {
            if (i%2==0) {
                deq.emplace_back(deq[i-1]*2);
            } else {
                deq.emplace_back(deq[i-1]/3);
            }
        }
        for (int j=0;j<deq.size();j++) {
            sum=sum+deq[j];
        }
        printf("%.8f",sum);
        cout<<endl;
        sum=0.0;
        deq.clear();
    }
}

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

int main()
{
	double a;
	while(1) {
		cin >> a;
		if(cin.eof()) break;
		printf("%.8f\n", 211.0 / 27.0 * a);
	}
	return 0;
}

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

int main() {
	double d[10];
	double a;
	while (cin >> a) {
		d[0] = a;
		d[1] = d[0] * 2;
		d[2] = d[1] / 3;
		d[3] = d[2] * 2;
		d[4] = d[3] / 3;
		d[5]=d[4] * 2;
		d[6] = d[5] / 3;
		d[7] = d[6] * 2;
		d[8] = d[7] / 3;
		d[9] = d[8] * 2;
		double ca=0;
		for (int i = 0; i < 10; i++) {
			ca += d[i];
		}
		cout << fixed << setprecision(9) << ca << endl;
	}
	return 0;
}

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) {
		cout << solve(a0) << endl;
	}
	
	
	return 0;
}

C++: #include<iostream>
#include<stdio.h>
#include<math.h>
#include<ctype.h>
#include<algorithm>
#include<queue>
#include<functional>
#include<iomanip>

using namespace std;
#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define MOD 1000000007
#define ALL(a) (a).begin(),(a).end()
#define pb(x) push_back(x)
#define ms(m,v) memset(m,v,sizeof(m))
#define D10  fixed<<setprecision(10) 
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int, int> P;
typedef long long ll;

long double a[100];
int main()
{
	while (cin >> a[0])
	{
		auto sum = a[0];
		FOR(i, 1, 10)
		{
			if (i % 2 == 0) a[i] = a[i - 1] / 3;
			else a[i] = a[i - 1] * 2;
			sum += a[i];
		}
		cout << D10 << sum << endl;
	}
}

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

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 << sum << endl;
  }
  return 0;
}

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

int main(){

  float n;
  while(cin >> n){
    float sum=n;
    for(i=2;i<=10;i++){
      if(i%2 == 0){
        n *= 2.;
      }
      else{
        n /= 3.;
      }
      sum += n;
    }
    cout << sum << endl;
  }
  return 0;
}

C++: 
#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){
  }else 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 <iomanip>
using namespace std;

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

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

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;
            }
        }
        printf("%.8f\n", s);
    }
    return 0;
}

C++: #include <iostream>

using namespace std;

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

    return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;
int main()
{
	double a, s = 0.0;
	while (cin >> a)
	{
		if (cin.eof()) return 0;
		s = a;
		for (int i = 2; i <= 10; i+=2)
		{
			s += a / 3.0 * 2.0;
		}
		printf("%.8lf\n", s);
	}
	return 0;
}

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

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

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

int main()
{
	double sequence[11];
	while(cin >> sequence[1]){
		double sum=sequence[1];
		for(int i=2;i<=10;i++){
			if(i%2==1){
				sequence[i] = sequence[i-1]/3.0;
				sum += sequence[i];
			}
			else{
				sequence[i] = sequence[i-1]*2.0;
				sum += sequence[i];
			}
		}
		cout << setprecision(8) << fixed << sum << endl;
	}
	return 0;
}

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

int main(){
double a;
double s;
s=0;
a=1;
s+=a;
for(int i=0;i<5;i++){
a*=2;
s+=a;
if(i==4)break;
a/=3;
s+=a;}
while(cin>>a){
a*=s;
if(a<10)printf("%10.8f\n",a);
if(a>=10)printf("%11.8f\n",a);}
}

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