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 <iomanip>
using namespace std;
int main(){
	double a;
	while(cin>>a){
		double ans=8*a-5*a/27;
		cout << fixed << setprecision(8);
		cout << ans << '\n' ;
	};
}

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

#define iota(i,n,b,s) for(int i=int(b);i!=int((b)+(s)*(n));i+=(s))
#define range(i,n,m) iota(i,(((n)>(m))?((n)-(m)):((m)-(n))),(n),((n)>(m)?-1:1))
#define rep(i,n) iota(i,(n),0,1)
#define loop for(;;)

#define INF (1e9)
#define EPS (1e-9)
#define cons(a,b) (make_pair(a,b))
#define car(a) (a.first)
#define cdr(a) (a.second)
#define cadr(a) (car(cdr(a)))
#define cddr(a) (cdr(cdr(a)))
#define all(a) a.begin(), a.end()
#define trace(var) cerr<<">>> "<<#var<<" = "<<var<<endl;

typedef long long Integer;
typedef double Real;
typedef vector<int> vi;
typedef vector<string> vs;
typedef map<string,int> Dictionary;
const Real PI = acos(-1);

template<class S, class T>
ostream& operator<<(ostream& os, pair<S,T> p) {
  os << '(' << car(p) << ", " << cdr(p) << ')';
  return os;
}

template<class T>
ostream& operator<<(ostream& os, vector<T> v) {
  if (v.size() == 0) {
    os << "(empty)";
    return os;
  }
  os << v[0];
  for (int i=1, len=v.size(); i<len; ++i) os << ' ' << v[i];
  return os;
}

int dx[] = { -1, 0, 1, 0 };
int dy[] = {  0, -1, 0, 1 };

char u[] = {'I', 'V', 'X', 'L', 'C', 'D', 'M'};
int v[] =  {1, 5, 10, 50, 100, 500, 1000};

int value_of (char c) {
  rep (i, 7) {
    if (c == u[i]) return v[i];
  }
}

int div(int a, int b, int n) {
  a %= b;
  a = a * 10;
  if (n == 1) return (a/b);
  return div(a, b, n - 1);
}

int main() {

  loop {
    Real a; cin >> a;
    if (!cin) break;
    Real sum = a;
    range (i, 2, 11) {
      a = (i % 2 == 0) ? (a * 2) : (a / 3.0);
      sum += a;
    }
    cout << sum << endl;
  }

  return 0;
}

C++: #include<stdio.h>

int main(){

double x,y,S=0;

while(scanf("%lf",&x)!=EOF){
y=x;S=x;
for(int i=2;i<=10;i++){
if(i%2==0){x=y*2;S+=x;y=x;}
else {x=y/3;S+=x;y=x;}
}
printf("%lf\n",S);
}
return 0;
}

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

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

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;

long double num[10];
int main()
{
	while (cin>> num[0]){
		
		long double sum = 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;
			}
			sum += num[i];
		}
		cout << setprecision(10) << sum << endl;
	}
		return 0;
}

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

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

  return 0;
}

C++: #include <cstdio>

using namespace std;

double a[10];

int main()
{
    while( scanf( "%lf\n", &a[0] ) != EOF )
    {
        for( int i = 1; i < 10; i++ )
        {
            if( i % 2 )
            {
                a[i] = a[i - 1] * 2.0;
            }
            else
            {
                a[i] = a[i - 1] / 3.0;
            }
        }
        
        for( int i = 0; i < 10; i++ )
        {
            a[i] += ( i == 0 ? 0 : a[i - 1] );
        }
        printf( "%.8lf\n", a[9] );
    }
    return 0;
}

C++: #include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8

static const double PI=6*asin(0.5);
typedef complex<double> P;
typedef long long ll;

vector<double> a;
double t;

int main(){
	while(cin>>t){
		a.PB(t);
		rep(i,5){
			a.PB(a[a.size()-1]*2.0);
			a.PB(a[a.size()-1]/3.0);
		}
		double s=0;
		rep(i,10){
			s+=a[i];
			//printf("%d = %.10lf\n",i+1,a[i]);
		}
		printf("%.8lf\n",s);
		a.clear();
	}
	return 0;
}

C++: #include<iostream>
int main(){for(float a;!(std::cin>>a).eof();)printf("%f\n",a*211.f/27);}

C++: #include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <string>
#include <stack>
#include <iomanip>
#include <numeric>
#include <queue>
#include <climits>
#include <complex>
#include <cmath>
#include <map>
using namespace std;
using ll = long long;
#define MOD 1000000007
#define INF 1LL << 59

int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    cout << fixed << setprecision(7);

    double n;
    while (scanf("%lf", &n) != EOF)
    {
        double sum = n;
        for (int i = 2; i <= 10; ++i)
        {
            if (i % 2 == 0)
            {
                n *= 2.0;
            }
            else
            {
                n /= 3.0;
            }
            sum += n;
        }
        cout << sum << endl;
    }
    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  double n;
  //while(cin>>n){
  for(int i=0;i<10;i++){
    cin>>n;
    double now=n,sum=n;
    for(int j=0;j<9;j++){
      if(j%2==0){
	now=now*2;
	sum+=now;
      }else if(j%2==1){
	now=now/3;
	sum+=now;
      }
    }
    printf("%.8f\n",sum);
  }
  return 0;
}

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

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

using namespace std;

int main()
{
	double a[10],n,ans = 0;
	while(cin >> n)
	{
		a[0] = n;
		REP(i,1,10)
		{
			if((i+1)%2 == 0)
			{
				a[i] = a[i-1]*2;
			}
			else
			{
				a[i] = (a[i-1]/3);
			}
		}
		rep(i,10)
		{
			ans += a[i];
		}

		
		cout << setprecision(10)<< ans << endl;
	}
	return 0;
}

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

int main(){

	double a, sum;

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

	return 0;

}

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

int main(){
  double a[10],b,c;
  while(cin>>b){
    c=0;
    a[0]=b;
    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=0;i<10;i++)
      c+=a[i];
    cout<<setprecision(7)<<c<<endl;
  }   
  return 0;
}

C++: #include<iostream>
int main(){for(float a;!(std::cin>>a).eof();)printf("%.7f\n",a*211/27);}