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"
#define rep(i,a,n) for(int (i) = (a);(i) < (n);(i)++)

typedef long long ll;
using namespace std;

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

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

int main(){
	int H, R;
	cin>>H>>R;

	if(H - R <= 0) cout<<"0"<<endl;
	if(H < 0) cout<<"-1"<<endl;
	if(H > 0) cout<<"1"<<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 <bits/stdc++.h>
#include <assert.h>
using namespace std;
using i64 = long long;

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

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

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

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

C++: #include <iostream>

int main() {
  int n;
  std::cin >> n;
  std::out << n * 32 << std::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>
using namespace std;

int main(){

  int H;
  if(-i000<=H&&H<0){
  }else if(H=0){
  }else if(0<H&&H<=1000){
  }else
  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 <bits/stdc++.h>
using namespace std;

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

C++: #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++ )
using namespace std;
int findSumOfDigits(int n) {
  int sum = 0;
  while (n > 0) { // n が 0 になるまで
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
int main(){
  int w;
  cin >> w;
 
  cout << w * 32 << endl;

}

C++: #incluse <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 n;
    cin >> n;
    cout << 32*n << endl;
}

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

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

C++: #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i=0; i<(int)(n); i++)
#define all(vec) vec.begin(), vec.end()

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

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

C++: #include <cstdio>

using namespace std;

const int word = 32;

int main()
{
    int num = 0;
    scanf( "%d\n", &num );
    printf( "%d\n", word * num );
    return 0;
}

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

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

C++: #include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<vector>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
using namespace std;
int inf = 1000000000;

int main(void) {

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

  return 0;
}

// EOF

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

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

typedef long long ll;
#define ALL(a) a, a+sizeof(a)/sizeof(a[0])
#define all(a) a.begin(),a.end()
#define MOD 1000000007
using namespace std;
ll gcd(ll n, ll m) {
	if (m == 0) return n;
	return gcd(m, n % m);
}
ll lcm(ll n, ll m) {return m / gcd(n, m) * n;}

int main(void) {
	ll 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<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 <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define repone(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define Rep(j,n) for(int j=0;j<(int)(n);++j)
#define Repo(j,o,n) for(int j=o;j<(int)(n);++j)
#define Repone(j,n) for(int j=1;j<(int)(n);++j)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define int long long
#define MOD 1000000007
#define INF 9223372036854775807

signed main(){
int x=0,y=0,z=0,w=0;
std::cin >> x;
std::cout << x*32 << '\n';
}

C++: #include<bits/stdc++.h>
using namespace std;
using UL = unsigned int;
using ULL = unsigned long long;
using LL = long long;
#define rep(i, n) for(UL i = 0; i < (n); i++)

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

C++: #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <complex>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back
#define dump(x)  cout << #x << " = " << (x) << endl;

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef complex<double> CD;


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

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

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

C++: #include<algorithm>
#include<cstdio>
#include<cmath>
#include<iostream>
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 x;
  cin>>x;
  cout<<32*x<<endl;
return 0;
}

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

C++: #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define put(n) cout<<(n)<<endl
#define FOR(i,num,N) for(int(i)=(num);(i)<(N);++(i))
#define RFOR(i,num,N) for(int (i)=(num);(i)>(N);--(i))
#define all(v) (v).begin() , (v).end()
#define rall(v) (v).rbegin() , (v).rend()


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

C++: #include <stdio.h>

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

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
using namespace std;
typedef long long ll;
const int INF = 1<<30;
const int MOD = 1e9 + 7;
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    cout << n * 32 << endl;
    return 0;
}