Beautiful Arrangement

A permutation of 1..n is beautiful if for every position i (1-based) either perm[i] is divisible by i or i is divisible by perm[i]. Print the number of beautiful arrangements.

1 <= n <= 15