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 <cstdio>
using namespace std;
double sequence(double a) {
  double s[10];
  double sum = 0;
  for(int i = 0; i < 10; ++i) {
	if(i == 0) {
	  s[i] = a;
	}
	else if(i % 2) { // odd
	  s[i] = s[i - 1] * 2;
	}
	else { // even
	  s[i] = s[i - 1] / 3;
	}
	sum += s[i];
  }
  return sum;
}
int main() {
  double a;
  while(~scanf("%lf", &a)) {
	printf("%.8f\n", sequence(a));
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
double Sequence(double a,int n)
{
    if(n==10)return a*2;
    if(n%2==0)return a*2+Sequence(a*2,n+1);
    return a/3+Sequence(a/3,n+1);
}
int main()
{
    double n=0,a;
    while(cin>>a){
        n=a+Sequence(a,2);
        cout<<setprecision(8)<<n<<endl;
    }
}

C++: #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;
typedef pair<int, int>P;

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

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main(){
  double a;
  while(cin>>a){
    printf("%.8f\n",a*211/27);
  }
}

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

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)

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

C++: #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=1000000007;
const ll INF=1000000010;
const ll LINF=4000000000000000010LL;
const int MAX=310;
const double EPS=1e-9;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
    double b;
    while(cin>>b){
        double a[11];
        a[1]=b;
        double sum=b;
        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("%.9lf\n",sum);
    }   
}

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

#define rep(i,n) for(int i=0;i<n;i++)

int main(){
    double a[11];
    double fi;
    while(cin>>fi){
        rep(i,11) a[i]=0;
        a[0]=fi;
        for(int i=1;i<11;i++){
            if(i%2==1){
                a[i]=a[i-1]*2;
            }else{
                a[i]=a[i-1]/3;
            }
        }
        double sum=0;
        for(int i=0;i<10;i++) sum+=a[i]; 
        cout<< fixed <<setprecision(7) << sum << endl;
    }
    return 0;
}

C++: #define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
using namespace std;
#ifndef FAST_IO
 #define IOS ios_base::sync_with_stdio(false);cin.tie(nullptr);
#endif

#define FILE_IO freopen("input.txt","r",stdin)
#define int long long
#define f first
#define s second
#define endl '\n'
#define all(c) c.begin(),c.end()
#define bp __builtin_popcount
#define debug(x) cerr << #x << " = " << x << endl;

const int MOD = 1e9 + 7;
const int INF = 1e18;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T>void print(T t){for(auto &it : t)cout<<it<<" ";}
inline int powerexp(int a, int b, int m = MOD){ int res = 1;while(b){if(b&1)res = res * a % m;a = a * a % m,b >>= 1;}return res % m;}
inline int modinv(int a){ return powerexp(a,MOD-2,MOD);}
inline int lcm(int a, int b){ int g = __gcd(a,b);return a/g*b;}
inline int add(int x, int y){ x += y; if (x >= MOD) x -=  MOD; return x;}
inline int mul(int x, int y){ return (x * 1ll * y) % MOD;}
inline int sub(int x, int y){ x -= y; if (x<0) x += MOD; return x ;}

//-------------------< start here >-------------------------// 

void solve(){
  cout << fixed;
  cout << setprecision(10);
  double a;
  while(cin >> a){
	  double sum = a;
	  for(int i = 2; i <= 10; i++){
		    if (i & 1) {a = a / 3.0, sum += a;}
		    else {a = a * 2.0, sum += a;}
		}
	 cout << sum << endl;  
	}	
}

//-----------------------------
//comment from here for TOPCODER 
int32_t main(){
   IOS;
   solve();
   //find();
   #ifdef LOCAL_DEFINE
   cerr << "time elapsed " << (double)clock()/CLOCKS_PER_SEC << endl;
   #endif
}

C++: #include<iostream>
#include<vector>
#include<numeric>

double SumOfVector(const std::vector<double>& vec)
{
	double sum=0;

	for(size_t i=0; i<vec.size(); ++i)
	{
		sum += vec[i];
	}
	
	return sum;
}

double Sequence(double a)
{
	std::vector<double> vec(10);

	vec[0] = a;

	int oddeven = 2;

	for(size_t i=1; i<vec.size(); ++i)
	{
		vec[i] = (oddeven%2==0 ? vec[i-1]*2.0 : vec[i-1]/3.0);

		++oddeven;
	}

	return SumOfVector(vec);
}

int main()
{
	double a;

	while(std::cin >> a)
	{
		printf("%10.7f\n",Sequence(a));
	}

}

C++: 
#include <stdio.h>

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<algorithm>
#include<cstdio>
using namespace std;

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

C++: #include <stdio.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main() {
    double a[16];
    while (scanf("%lf", a) != EOF) {
        rep (i, 10) a[i+1] = i%2 ? a[i]/3 : a[i]*2;
        double ans = 0;
        rep (i, 10) ans += a[i];
        printf("%.8f\n", ans);
    }
    return 0;
}

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 (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 <stdio.h>
#include <array>

using namespace std;

double a_1;
double s_n;
std::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 <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
int main(void)
{
  long double a;
  while(cin >> a){
    long double sum = a;
    for(int i = 1; i < 10; i++){
      if(i%2) a *= 2;
      else a /= 3;
      sum += a;
    } 
    cout.precision(20);
    cout << sum << endl;
  }
}