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)
}

Python: x=int(input())
print(x*32)

Python: W=int(input())
print(W*32)

Python: W=int(input())
a=W*32
print(a)

Python: w = int(input())
print(32*w)

Python: W=int(input())
print(W*32)

Python: W=int(input())
x=W*32
print(x)

Python: print( int( input()) * 32)

Python: print(int(input())*32)

Python: W = int(input())
print(W*32)

Python: W = int(input())
print(W*32)

Python: x=int(input())
print(x*32)

Python: a=int(input())
print(a*32)

Python: print(int(input()) * 32)

Python: W=int(input())
print(W*32)

Python: a=int(input())
print(32*a)

Python: print(int(input())*32)

Python: def main():
    stdin = int(input())
    print(stdin * 32)


if __name__ == "__main__":
    main()

Python: a = int(input())
b = a*32
print(b)

Python: W=int(input())
W=W*32
print(W)

C++: #include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
//vector<vector<int> > dp;
//vector<vector<vector<int> > > vvvi;
//dp=vector<vector<int> >(N, vector<int>(M,0));
//vector<pair<int,int> > v;
//v.push_back(make_pair(x,y));
//priority_queue<int,vector<int>, greater<int> > q2;



signed main(){
cin.tie(0);
ios::sync_with_stdio(false);

	int N;
	cin >> N;
	cout << N * 32 << endl;
	return 0;
}

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

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


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

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

using namespace std;

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

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

C++: #include<bits/stdc++.h>
using namespace std;
int main(){

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

	return 0;
}

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

/*int par[100000];

void init(int n){
    for(int i=0; i<n; i++) par[i] = i;
}

int find(int x){
    if(par[x] == x) return x;
    else{
        par[x] = find(par[x]);
        return par[x];
    }
}

int min(int a, int b){
    if(a > b) return b;
    else return a;
}

void unite(int x, int y){
    x = find(x);
    y = find(y);
    if(x == y) return;

    par[x] = y;
}*/

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

    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main(){
int w;
cin>>w;
cout<<32*w<<endl;
}

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 W;
	cin >> W;
	cout << W * 32 << 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 <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>

using namespace std;

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long ll;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define UNIQUE(a)  (a).erase(unique((a).begin(),(a).end()),(a).end())
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

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

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

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

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



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

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#include<set>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef pair<ll, ll> pll;
//int dx[4] = { 1,0,0,-1 };
//int dy[4] = { 0,1,-1,0 };
#define MOD 1000000007
#define ARRAY_MAX 100005

const int INF = 1e9 + 7;


int main() {


	ios::sync_with_stdio(false);
	cin.tie(0);

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


	
	return 0;
}

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

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

int w;

int main() {
  cin.tie(0); ios_base::sync_with_stdio(0);

  cin >> w; cout << w * 32 << "\n";
}

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

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

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

int main(){
    int w;
    cin >> w;
    
    cout << w * 32 << 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 <iostream>
using namespace std;
int main(void){
    int W;
    cin >>W;
    cout <<W*32 <<endl;
    
}

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

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

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

    return 0;
}

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

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

typedef long long ll;
typedef pair<ll, ll> P;

#define pb push_back
#define rep(i, n) for(int i = 0; i < (n); i++)
#define dep(i, a, n) for(int i = a; i >= (n); i--)
#define FOR(i, a, n) for(int i = a; i < (n); i++)
#define mod (ll)(1e9+7)
#define int ll
#define INF 100000000

__attribute__((constructor))
void initial() {
  cin.tie(0);
  ios::sync_with_stdio(false);
}

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

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

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

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