#include <stdio.h>
void swap(int *a,int *b)
{int temp;
  temp=*a;
  *a=*b;
  *b=temp;
}
void klot(int *arr,int size) //1
{int i;
	for( i = 0 ; i < size ; i++)
	{
		scanf("%d",&arr[i]);
	}
}
void print(int *arr,int size) //2
{
	for(int i = 0 ; i < size ; i++)
	{
		printf("num in %d is %d \n",i+1,arr[i]);
	}
}
int sum(int *arr,int size) //3
{int sum=0;
	for(int i = 0 ; i< size ; i++)
	{
		sum+=arr[i];
	}
	return sum;
}
void oppositearray(int *a,int*b,int size) //4
{int i;
	for(i = 0 ; i < size ; i++)
	{
		b[i]=a[size-1-i];
	}
}
void oppositethisarray(int *a,int size) // 5
{int i;
  for(i = 0 ; i <= size/2 ; i++)
  {
	  swap(&a[i],&a[size-i-1]);
  }

}
void shr(int *a,int size) // 6 *******************
{int savenum=a[0],i;
 a[0]=a[size-1];
 a[1]=savenum;

}
void max(int *a,int size,int *max,int *maxindex) // 7
{int maxnum=a[0],i;
 for(i = 1 ; i < size ; i++)
 {
	 if(a[i]>maxnum)
	 {
		 maxnum=a[i];
		 *max=a[i];
		 *maxindex=i;
	 }
 }
}
int ismemooyan(int *a, int size) //8
{int i;
	for(i = 0 ; i <size-1 ; i++)
	{
		if(a[i]>=a[i+1]) // im yesh evar shelo katan meaevar aba tahzir 0
			return 0;
	}
	return 1;
}
int search(int *a,int size,int num) // 9
{int i;
	for(i=0;i<size;i++)
	{
		if(a[i]==num)
			return i;
	}
	return -1;
}
void buildsum(int*res,int size) // 10
{int i,j,sum=1;
	for(i=0;i<size;i++)
	{
		if(i==0)
			res[i]=1;
		else
			res[i]=sum;
		sum+=res[i];
	}
}
void meshootaf(int *a,int*b,int sizea,int sizeb) //11
{
	for(int i = 0 ; i <sizea; i++)
	{
		if(search(b,sizeb,a[i])!=-1)
			printf("%d exists in both \n" ,a[i]);
	}
}
int specialsearch(int *a,int size,int num,int wherenottosearch) // like search but not to search in a specific index
{int i;
	for(i=0;i<size;i++)
	{
		if(a[i]==num && i!=wherenottosearch)
			return i;
	}
	return -1;
}
int difnumbers(int *a,int size) // 12
{int i;
	for(i = 0 ; i <size ; i++)
	{
		if(specialsearch(a,size,a[i],i)!=-1) // if found this number on a different location from where it is
			return 0;
	}
	return 1;
}
int counttimes(int *a,int size ,int num)
{int i,count=0;
	for(i=0;i<size;i++)
	{
		if(a[i]==num)
			count++;
	}
	return count;
}
int firsttimewedontseethatafterthat(int *a,int size,int num,int index)
{int i;
 for(i = index+1 ; i < size ; i++)
 {
	 if(a[i]!=num)
	 {
		 return i;
	 }
 }
 return -1;
}
void tzafoof(int *a,int size) //13
{int i,j,count=counttimes(a,size,0);
 for(i=0;i<count;i++)
 {
	 if(firsttimewedontseethatafterthat(a,size,0,i)!=-1)
	    swap(&(a[search(a,size,0)]),&(a[firsttimewedontseethatafterthat(a,size,0,i)]));
 }



}
void main()
{
	int a[5];
	int b[5];
	klot(a,5);
	//klot(b,5);

	//print(a,5);
	//printf("sum is %d \n",sum(a,5));
	//oppositearray(a,b,5);
	//print(b,5);
	//oppositethisarray(a,5);
	//shr(a,5);

	//int maxnum,maxindex;
	//max(a,5,&maxnum,&maxindex);
	//printf("max num is %d max index is %d \n" , maxnum,maxindex);

	//printf("ans in %d \n",ismemooyan(a,5));

	//printf("%d\n",search(a,5,-7));

	//buildsum(b,5);
	//print(b,5);

	//meshootaf(a,b,5,5);
	//printf("ans is %d \n",difnumbers(a,5));

	tzafoof(a,5);


	print(a,5);
	scanf("%d");
}