Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Distance II

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.

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.

Constraints

$1 \leq n \leq 100$

$0 \leq x_i, y_i \leq 1000$

Sample Input

3
1 2 3
2 0 4

Sample Output

4.000000
2.449490
2.154435
2.000000

Solution in Ruby (judge verdict: Accepted)

n = gets.to_i
x_vec = gets.split.map(&:to_f)
y_vec = gets.split.map(&:to_f)

d1 = 0
n.times do |i|
  d1 += (x_vec[i] - y_vec[i]).abs
end

d2 = 0
n.times do |i|
  d2 += (x_vec[i] - y_vec[i].abs) ** 2
end
d2 = Math.sqrt(d2)

d3 = 0
n.times do |i|
  d3 += (x_vec[i] - y_vec[i]).abs ** 3
end
d3 = d3 ** (1.0 / 3.0)

d4 = 0
n.times do |i|
  if d4 < (x_vec[i] -y_vec[i]).abs then d4 = (x_vec[i] - y_vec[i]).abs end
end

puts sprintf("%.6f", d1)
puts sprintf("%.6f", d2)
puts sprintf("%.6f", d3)
puts sprintf("%.6f", d4)