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 W;
    cin>>W;
    
    cout<<W*32<<endl;
    
    
    return 0
}

C++: #include<bits/stdc++.h>
#include<vector>
#define V vector
#define VI vector<int>
#define VVI vector<vector<int>>
#define rep(i,N) for(int i=0;i<N;i++)

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 W;
  cin >> W;
  cout << W * 32 << endl;

  return 0;
}

C++: #include <bits/stdc++.h>
typedef long long i64;
using std::cout;
using std::endl;
using std::cin;

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

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

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 a,b;
  
  cin>>a;

  cout<<a*32<<endl;

}

C++: #include <iostream>

int main() {
  int n;
  std::cin >> n;
  std::cout << n * 32 << std::endl;
}

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

int main()
{
	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<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<cmath>
#include<complex>
#include<utility>
#include<list>
#include<random>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<stdlib.h>
#include<unordered_map>
using namespace std;

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

C++: #include <iostream>
#include <fstream>
#include <cassert>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#include <complex>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<29;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-7;
const ll mod=1e9+7;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

int n;

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

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

C++: #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <limits>
#include <fstream>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  int w;cin>>w;
  cout<<32*w<<endl;
}

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

int main(void)
{
	int w,n;
	scanf("%d",&w);
	printf("%d\n",w*32);
	return 0;
}

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

using namespace std;

main(){
	int w;
	cin >> w;
	w=w*32;
	printf("%d\n",w);
}

C++: #include<bits/stdc++.h>
using namespace std;
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<<endl;
  return 0;
}

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

C++: #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <cstdlib>
#include <stack>
#include <queue>
#include <cmath>

#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define repp(i,j,k) for(int i=j;i>=k;i--)
#define llrep(i,j,k) for(long long int i=j;i<(long long int)k;i++)
#define Sort(x) sort(x.begin(),x.end()); 
#define vi vector<int>
#define vvi vector<vector<int>> 
#define ll long long
int mod=1e9+7;
const int INF = 1e9;

using namespace std;




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

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

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

C++: #include <iostream>
#include <sstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdio.h>

using namespace std;

//typedefリスト
typedef vector<long long int> vint;
typedef vector<vector<long long int>> vvint;
typedef vector<string> vstr;
typedef long long int llint;

llint gcd(llint x, llint y) {
	while (y != 0) {
		if (x > y) {
			llint r = x % y;
			x = y;
			y = r;
		}
		else {
			llint r = y % x;
			y = r;
		}
	}
	return x;
}

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

C++: #include <iostream>

using namespace std;

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

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

}

C++: #include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>
#include<iterator>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define rep(i,n) for(int i=0; i<n; i++)
#define INF (1<<20)

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, char> plc;

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;
 int ans;
 
 ans = W *32;
 cout<<ans <<endl;
 
}

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

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

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

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

using namespace std;


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

C++: #define _GLIBCXX_DEBUG
#include<bits/stdc++.h>
using namespace std;
template <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }
template <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<long long> vlong;
typedef vector<string> vstring;
#define vpush(a,x) a.push_back(x);
#define rep(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
#define REP(i, x, n) for(int i = x; i < n; i++)
const int INF = 1 << 30;
const ll LINF = (ll)1 << 60;
const int dx[] = {1,0,-1,0,1,1,-1,-1};
const int dy[] = {0,-1,0,1,1,-1,-1,1};
#define stp(x)  setprecision(x)
const long double PI=3.14159265358979323846264338327950;
int main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int w;
  cin>>w;
  cout<<32*w<<'\n';
  return(0);
}

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