Your task is to calculate the distance between two $n$ dimensional vectors $x = \\{x_1, x_2, ..., x_n\\}$ and $y = \\{y_1, y_2, ..., y_n\\}$.

The Minkowski's distance defined below is a metric which is a generalization of both the Manhattan distance and the Euclidean distance.
\\[ D_{xy} = (\sum_{i=1}^n |x_i - y_i|^p)^{\frac{1}{p}} \\]
It can be the Manhattan distance
\\[ D_{xy} = |x_1 - y_1| + |x_2 - y_2| + ... + |x_n - y_n| \\]
where $p = 1 $.

It can be the Euclidean distance
\\[ D_{xy} = \sqrt{(|x_1 - y_1|)^{2} + (|x_2 - y_2|)^{2} + ... + (|x_n - y_n|)^{2}} \\]
where $p = 2 $.

Also, it can be the Chebyshev distance

\\[ D_{xy} = max_{i=1}^n (|x_i - y_i|) \\]

where $p = \infty$

Write a program which reads two $n$ dimensional vectors $x$ and $y$, and calculates Minkowski's distance where $p = 1, 2, 3, \infty$ respectively.

Constraints

* $1 \leq n \leq 100$
* $0 \leq x_i, y_i \leq 1000$

Input

In the first line, an integer $n$ is given. In the second and third line, $x = \\{x_1, x_2, ... x_n\\}$ and $y = \\{y_1, y_2, ... y_n\\}$ are given respectively. The elements in $x$ and $y$ are given in integers.

Output

Print the distance where $p = 1, 2, 3$ and $\infty$ in a line respectively. The output should not contain an absolute error greater than 10-5.

Example

Input

3
1 2 3
2 0 4


Output

4.000000
2.449490
2.154435
2.000000
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int i,j,n = sc.nextInt();
		double ptx[] = new double [n];
		double pty[] = new double [n];
		double dt=0.0;

		for(i=0;i<n;i++){
			ptx[i] = sc.nextDouble();
		}
		for(i=0;i<n;i++){
			pty[i] = sc.nextDouble();
		}
		for(i=0;i<4;i++){
			dt = 0.0;
			if(i == 0){
				for(j=0;j<n;j++){
					dt += Math.abs((ptx[j]-pty[j]));
				}
				System.out.printf("%.6f\n", dt);
			}
			else if(i == 1){
				for(j=0;j<n;j++){
					dt += Math.pow(Math.abs((ptx[j]-pty[j])),2.0);
				}
				dt = Math.sqrt(dt);
				System.out.printf("%.6f\n", dt);
			}
			else if(i == 2){
				for(j=0;j<n;j++){
					dt += Math.pow(Math.abs((ptx[j]-pty[j])),3.0);
				}
				dt = Math.cbrt(dt);
				System.out.printf("%.6f\n", dt);
			}
			else{
				for(j=0;j<n;j++){
					if(dt < Math.abs((ptx[j]-pty[j]))){
						dt = Math.abs((ptx[j]-pty[j]));
					}

				}
				System.out.printf("%.6f\n", dt);
			}
		}

		sc.close();


	}

}
