526. Beautiful Arrangement

class Solution {
public:

void arrgumentNum(vector<int>& visit,int& position,int& count)
{
if(position==visit.size())
{
count++;
return;
}
else
{
for(int i=1;i<visit.size();i++)
{
if(visit[i]==0&&(position%i==0||i%position==0))
{
visit[i]=1;
position++;
arrgumentNum(visit,position,count);
visit[i]=0;
position--;
}
}
return;
}
}

int countArrangement(int N) {

int count=0;
int position=1;
vector<int> visit(N+1,0);
arrgumentNum(visit,position,count);

return count;

}
};