# How many ways are there to arrange $n$ married couples in a line so that a husband and his wife are not together? [duplicate]

There are $2n$ people. There are $2n!$ ways to arrange them.

The number of ways to arrange them such that couples are always together is $n! \cdot 2^n$

How do you calculate the number of ways to arrange them such that no couples are together?