//Ilie Dumitru
#include<iostream>

double f(double x)
{
	return 3*x+5;
}

int min(int x, int y)
{
	if(x<y)
		return x;
	return y;
}

int max(int x, int y)
{
	if(y<x)
		return x;
	return y;
}

int abs(int x)
{
	if(x<0)
		return -x;
	return x;
}

int fact(int n)
{
	if(n==0)
		return 1;
	return n*fact(n-1);
}

int fact2(int n)
{
	if(n==0)
		return 1;
	return n*fact(n-1)+fact(n-1);
}

/*
A(x,y)=
   | x==0      = y+1
   | y==0      = A(x-1,1)
   | otherwise = A(x-1,A(x,y-1))
*/

int ackermann(int x, int y)
{
	if(x==0)
		return y+1;
	if(y==0)
		return ackermann(x-1, 1);
	return ackermann(x-1, ackermann(x, y-1));
}

int fibo(int n)
{
	if(n==0)
		return 0;
	if(n==1)
		return 1;
	return fibo(n-2)+fibo(n-1);
}

//floor
//sort
//fct pe string
//swap

void swap(int& i, int& j)
{
	int aux=i;
	i=j;
	j=aux;
}

int putere(int b, int e)
{
	if(e==0)
		return 1;
	if(e%2==0)
	{
		int x=putere(b, e/2);
		return x*x;
	}
	return putere(b, e-1)*b;
}

int main()
{
	std::cout<<putere(2, 32)<<'\n';

	return 0;
}