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 s=0.0;
    s+=a;
    for(int i=2;i<=10;i++){
      if(i%2) a/=3;
      else a*=2;
      s+=a;
    }
    cout<<fixed<<setprecision(8)<<s<<endl;
  }
  return 0;
}

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

double solve(double a){
    double all=a;
    for(int i=2; i<11; i++){
        if(i%2){
            a /= 3;
            all += a;
        }else{
            a *= 2;
            all += a;
        }
    }
    return all;
}

int main()
{
    double a;
    while(cin>>a,!cin.eof()){
        cout<<fixed<<setprecision(8);
        cout<<solve(a)<<endl;
    }
    return 0;
}

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

int main(){
	double in, out;
	while(cin >> in){
		out = in * 211 / 27;
		cout << fixed << setprecision(8) << out << endl;
	}
	return 0;
}

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

int P[50010];
map<int,int> idx;

int prime() {
  int i=3,j,k,cnt=1;
  P[0] = 2;
  for(i=3;i<=60000;i+=2){
    k=0;
    for(j=3;j<=sqrt(i);j+=2){
      if(i%j==0){
	k=1;
	break;
      }
    }
    if(k==0) {
      P[cnt] = i;
      cnt++;
    }
  }
  return cnt;
}

int main(){
  int n,cnt;
  cnt = prime();
  while(cin >> n){
    for(int i=0;i<cnt;i++){
      if(n == P[i]){
	cout << P[i-1] << " " << P[i+1] << endl;
	break;
      }
      else if(n < P[i]){
	cout << P[i-1] << " " << P[i] << endl;
	break;
      }
    }
  }
}

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

int main(){
	for(int i=0;i<3;i++){
		double a,s[10],max=0;
		cin>>a;
		for(int j=0;j<10;j++){
			if(j==0) s[j]=a;
			
			else if(j%2==1)	s[j]=s[j-1]*2;
			
			else if(j%2==0) s[j]=s[j-1]/3;
		}
		for(int j=0;j<10;j++){
			max+=s[j];
		}
		cout<<setprecision(9)<<max<<endl;
	}
	return 0;
}

C++: #include<iostream>
#include<string.h>

using namespace std;

//double solve(double n)

int main(void){

	double sum,table[11]={0};
	
	while(cin>>table[0]){
		sum=table[0];
		for(int i=1;i<10;i++){
			if(i%2==0){
				table[i]=table[i-1]/3;
			}
			else{
				table[i]=table[i-1]*2;	
			}			
			sum=sum+table[i];
		}
		cout<<sum<<endl;
		memset(table,0,sizeof(table));
	}
}

/*double(double n){
	double memo[11]={0};
	
	for(int i=0;i<10;i++){
		if(i%2==0){
			
		}
	}
	
}*/

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  double a[11],ans;
  while(cin>>a[1]){
    ans=a[1];
    for(int i=2;i<11;i++){
      if(i%2)a[i]=a[i-1]/3.0;
      else a[i]=a[i-1]*2.0;
      ans+=a[i];
    }
    printf("%.8f\n",ans);
  }
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cmath>
#include <functional>
#include <numeric>
#include <iomanip>
#define fi first
#define se second
#define fcout(n) cout<<fixed<<setprecision((n))
using namespace std;
bool value(int y,int x,int R,int C){return 0<=y&&y<R&&0<=x&&x<C;}
typedef pair<int,int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long > vll;
typedef vector< vi > vvi;
double pie=acos(-1);
int INF=10000009;
int dx[4] = { 0,-1,0,1 };
int dy[4] = { -1,0,1,0 };
int main() {
	long double a,s[15],sum=0;
	while(true){
		cin>>a;
		if (cin.eof())break;
		s[0]=a;
		for(int i=1;i<10;i++){
			if(i%2!=0){
				s[i]=2.0*s[i-1];
			}
			else{
				s[i]=s[i-1]/3.0;
			}
		}
		for(int i=0;i<10;i++){
			sum+=s[i];
		}
		fcout(8)<<sum<<endl;
		sum=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<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);
  while(cin >> v[1]){
    n = 0;
    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 <cstdio>
#include <iostream>
using namespace std;

int main()
{
  double b;
  while(cin >> b)
    {
      double a = b;
      b *= 2; 
      a += b;
      b /= 3; 
      a += b;
      b *= 2; 
      a += b;
      b /= 3; 
      a += b;
      b *= 2; 
      a += b;
      b /= 3; 
      a += b;
      b *= 2; 
      a += b;
      b /= 3; 
      a += b;
      b *= 2; 
      a += b;
      printf("%.8f\n", a);
    }
  return 0;
}

C++: #include<iostream>
#include<vector>
#include<string>
#include<string.h>
#include<math.h>
#include<utility>
#include<algorithm>
#include<functional>
using namespace std;

int main()
{
	double a=0;

    while(cin>>a)
    {
    
    double s=0;
      
    s=a;
    for(int i=0;i<4;i++)
    {
    a=2*a;
    s=s+a;
    a=a/3;
    s=s+a;
  
    }
    s=s+a*2;
	a=0;
    cout<<s<<endl;
    }
    return 0;
}

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

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

        cout << sum << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <cstdio>
int main(){double a,s;while(std::cin>>a){if(std::cin.eof())break;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);}}

C++: #include <iostream>
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 << sum << endl;
	} 
	return 0;
}