#include<iostream>
using namespace std;
void Reverse(int ar[], int n)
{
int low = 0;
int high = n-1;
while(low < high)
{
int tmp = ar[low];
ar[low] = ar[high];
ar[high] = tmp;
using namespace std;
void Reverse(int ar[], int n)
{
int low = 0;
int high = n-1;
while(low < high)
{
int tmp = ar[low];
ar[low] = ar[high];
ar[high] = tmp;
low++;
high--;
}
}
int main()
{
int ar[]={25,258,45,78,95,68,48,42,23,14,78,99,123,154};
int n=sizeof(ar)/sizeof(int);
Reverse( ar, n);
for(int i=0;i<n;++i)
{
cout<<ar[i]<<endl;
}
return 0;
}