Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)

func main() {
	sc.Scan()
	W, _ := strconv.Atoi(sc.Text())
	fmt.Println(W * 32)
}

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

int main (){
  int x;
  cin >> x;
  cout << x*32 <<endl;
  return 0;
}

C++: #include <stdio.h>

int main(void){

int a,ans;

scanf("%d",&a);

ans=a*32;

printf("%d\n",ans);

return 0;
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
int main(){
	int w;
	cin>>w;
	cout<<w*32<<endl;
    return 0;
    }

C++: #include <iostream>
using namespace std;
int main(void){
    // Your code here!
    int W;
    cin>>W;
    cout<<W*32<<endl;
    
}

C++: #include<iostream>
using namespace std;
int main(void)
{
int W;
cin >> W;
cout  << W*32 << endl;
}

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

int main(){
  int Y,E;
  
  cin>> Y,E;
  
  if ( E = 0 && 1868 <= Y <= 1911 ) 
    cout << Y - 1868 + 1 << endl;

  else if ( E = 0 && 1912 <= Y <= 1925 )
    cout << Y - 1912 + 1 << endl;

  else if ( E = 0 && 1926 <= Y <= 1988 )
    cout << Y - 1926 + 1 << endl;

  else if ( E = 0 && 1989 <= Y <= 2016 )
    cout << Y - 1989 + 1 << endl;

  else if ( E = 1 )
    cout << 1868 + Y - 1 <<endl;

  else if ( E = 2 )
    cout << 1912 + Y - 1 <<endl;

  else if ( E = 3 )
    cout << 1926 + Y - 1 <<endl;

  else cout << 1989 + Y - 1 << endl;

  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
typedef long long int ll;
typedef pair<ll,ll> 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(){
　int w;cin>>w;
    cout<<w*32<<endl;
    return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
    int a;
    cin>>a;
    cout<<a*32<<endl;
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main(){
    map<tuple<int,int,int>,bool> mp;
    int n;cin >> n;
    int ans = 0;
    for(int a = 0;a < n;a++){
        int b;cin >> b;
        int c;cin >> c;
        int d;cin >> d;
        tuple<int,int,int> hoge = make_tuple(b,c,d);
        if(mp.find(hoge) != mp.end()){
            ans++;
            continue;
        }
        mp[make_tuple(b,c,d)]=true;
        mp[make_tuple(b,d,c)]=true;
        mp[make_tuple(c,b,d)]=true;
        mp[make_tuple(c,d,b)]=true;
        mp[make_tuple(d,c,b)]=true;
        mp[make_tuple(d,b,c)]=true;
    }
    cout<<ans<<endl;
}

C++: #include  <iostream>
using namespace std;
int main(){
int w;
cin>>w
cout<<w*4<<endl:

}

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

int main(){
    int h,r;
    cin>>h>>r;
    if(h+r>0) cout<<1<<endl;
    else if(h+r==0) cout<<0<<endl;
    else cout<<-1<<endl;
    return 0;
}

C++: #include<stdio.h>
int main(){
	int i;
	scanf("%d",&i);
	printf("%d\n",i*32);
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <bitset>
#include <cmath>
#include <string>
#define FI first
#define SE second
#define VE vector<int>
#define PB push_back
#define PA pair<int,int>
#define MA make_pair
#define LL long long
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
#define YES(i) cout<<(i?"YES":"NO")<<endl
#define Yes(i) cout<<(i?"Yes":"No")<<endl
using namespace std;
//
const int INF=1e9+7;
//
int main(){
  int N;
  cin>>N;
  cout<<N*32<<endl;
  return 0;
}

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

#define FOR( i, m, n )  for( int (i) = (m); (i) < (n); (i)++ )
#define REP( i, n )     FOR( i, 0, n )
#define ALL( a )        (a).begin(), (a).end()             

int main(void){
    int w; cin >> w;
    cout << w * 32 << endl;
}

C++: #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);

using namespace std;

namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;

int main(){
	cin.tie(0); cin.sync_with_stdio(0);
	int x; cin >> x;
	cout << 32 * x << endl;
	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n) for (long long i = 0; i < (n); ++i)
const int INF = 2147483647;//int max
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using P = pair<int,int>;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
//ミョ(-ω- ?)
int main() {
    int w;
    cin >> w;
    cout << w*32 << endl;
    return 0;
}

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

int w;
int main() {
	cin >> w;
	cout << 32 * w << endl;
	return 0;
}

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(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 1ll<<29;
const bool debug = 0;

int main() {
	int w;
	cin >> w;
	cout << w * 32 << endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){

int w;
cin>>w;
cout<<32*w<<endl;

return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
    int n;cin>>n;cout << n*32 << endl;
}

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

int main ( ){
  int W;
  cin>>W;

  cout<<32*W<<endl;
  return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;

int main()
{
	int W;
	cin >> W;
	cout << W * 32 << endl;

	return 0;
}

C++: #include <bit/stdc++.h>

using namespace std;

int main(){

int W;
cin>>W;

cout<<x = W * 32<<endl;

return 0;
}