#include<iostream>

int main(void){
	int n;
	std::cin >> n;
	
	int seq[n];
	
	for (int i =0; i <n; i++){
		std::cin >> seq[i];
	}
	
	for (int i = 0; i < n; i ++){
		if (i < n-1) std::cout << seq[(n-1) - i] << " ";
	  else std::cout << seq[ (n-1)-i] << std::endl;
	}
	
	return 0;
}
#include <iostream>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <cmath>
#include <string>
#include <sstream>
#include <iomanip>
#include <complex>
using namespace std;
 
#define ll long long
#define vvi vector< vector<int> >
#define vi vector<int>
#define All(X) X.begin(),X.end()
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int main(){
	double i, j, k, l;
	cin >> i >> j >> k >> l;
	cout << fixed << setprecision(8);
	cout << (double)sqrt(pow(i - k, 2.0) + pow(j - l, 2.0)) << endl;
}