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>
#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) {
	D ret = a0, a_ = a0;
	for_(i, 2, 11) {
		if (i%2 == 0) {
			a_ *= 2.0;
		} else {
			a_ /= 3.0;
		}
		ret += a_;
	}
	return ret;
}

int main() {
	D a0;
	
	while (cin >> a0) {
		printf("%.8f\n", solve(a0));
	}	
	
	return 0;
}

C++: #include<iostream>
#include<iomanip>
using namespace std;
double a,s;int c;
main()
{
    while(cin>>a)
    {
        s=a;
        for(c=2;c<=10;c++)a=c%2?a/3:a*2,s+=a;
        cout<<s<<endl;
    }
}

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

int main() {
	double n, sum, a;
	while (cin >> n) {
		sum = a = n;
		for (int i = 0; i < 4; i++) {
			a = a * 2;
			sum += a;
			a = a / 3;
			sum += a;
		}
		a = a * 2;
		sum += a;

		cout << sum << endl;
	}
	return 0;
}

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

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

int main(){
  double a;
  while(~scanf("%lf",&a)){
    double sum = a;
    REP(i,1,10){
      if( i%2 ){
	a *= 2.0;
      }else{
	a /= 3.0;
      }
      sum += a;
#if DEB
      printf("%lf\n",a);
#endif
    }
    printf("%lf\n",sum);
  }
  return 0;
}

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

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

C++: #include<iostream>
#include<iomanip>
#include<sstream>
#include<string>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<map>
#include<vector>
#include<queue>
#include<set>
#include<numeric>

using namespace std ;

#define pb(n) push_back(n)
#define fi first
#define se second
#define np string::npos
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define repc(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto n :(array))

typedef long long ll ;
typedef vector<int> vi ;
typedef vector<ll> vl ;
typedef map<string,int> dict;

constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
double eps = 1e-10 ;

template <typename T>
void out(vector < T > v)
{
  for(size_t i = 0; i < v.size(); i++)
  {
    debug(v[i]);
  }
}

template<typename T>
string ntos( T i ) {
  ostringstream s ;
  s << i ;
  return s.str() ;
}

template<typename T>
T ston(string str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  double n = 0;
  vector<double> v(11,0);
  cin >> v[1] ;
  repc(i,2,11){
    if(i % 2 == 0){
      v[i] = v[i-1]*2;
    }
    else{
      v[i] = v[i-1]/3;
    }
    n+=v[i] ;
  }
  cout <<fixed<< setprecision(9) <<n+v[1] << endl;

  return 0;
}

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

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

using namespace std;

int main(){
    double n = 0;
    vector<double> vn(11,0);
    //cin >> vn[0] ;
    vn[1] = 1;
    for(int i = 2; i < 11;++i){
        if(i % 2 == 0){
            vn[i] = vn[i-1] * 2;
        }
        else{
            vn[i] = vn[i-1] / 3;
        }
        n += vn[i] ;
    }
    cout << n + vn[1] << endl;
    return 0;
}

C++:  #include<iostream>
 #include<stdio.h>
 #include<string>
 #include<math.h>
 #include<iomanip>
 #include<algorithm>
 #include<string.h>
 #include<cctype>
 #include<map>
 #include<set>
 #include<vector>
 #include<sstream>
 #include<stack>
 #include<queue>
 #include<deque>
 #include<functional>
 #include<utility>
 
 using namespace std;

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

C++: #include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <cctype>
#include <iostream>
#include <set>
#include <string>
#include <queue>
#include <map>
using namespace std;
int size(string x){
	string::size_type size=x.size();
	return size;
}
#define fu(l,k) for(int i=l;i<k;i++)
#define fd(l,k) for(int i=l;i>k;i--)
#define fi first
#define se second
typedef  vector<string> vs;
typedef  vector<int> vi;
double pi(){
	return M_PI;
}
typedef set<int> set_i;
typedef set<string> set_s;
int INF=1000000;
int main(){
	double a,ans[11]={},ss;
	while(cin>>a){
		ss=0;
		ans[1]=a;
		fu(1,11){
			if(i==1) ss=ans[1];
			else if(i%2==0){
				ans[i]=ans[i-1]*2;
				ss+=ans[i];
			}
			else{
				ans[i]=ans[i-1]/3;
				ss+=ans[i];
			}
		}
		printf("%.8lf\n",ss);
	}
}

C++: #include <bits/stdc++.h>
#define rep(i,a,n) for(int i=a;i<n;i++)
#define repr(i,a,n) for(int i=a;i>=n;i--)
#define INF 999999999
#define INF_M 2147483647
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;

int main() {
	double n;
	while(cin >> n) {
		double ret = n;
		double temp = n;
		rep(i,2,11) {
			if(i % 2 == 0) {temp *= 2; ret += temp;}
			else {temp /= 3; ret += temp;}
		}
		printf("%.8f\n",ret);
	}
}

C++: #include <iostream>

using namespace std;

int main() {

    double d;
    while (cin >> d) {
        double ret = d;
        for (int i = 2; i <= 10; i++) {
            if (i % 2 == 0) {
                d *= 2.0;
            } else {
                d /= 3.0;
            }

            ret += d;
        }

        cout << ret << endl;
    }

    return 0;
}

C++: #include<iostream>
#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(10) << endl; 
  }
}