Find the total number of way in which `n` distinct objects can be put into two different boxes

Find the total number of ways in which n distinct objects can be put into two different boxes.

Find the total number of ways in which n distinct objects can be put into two different boxes.

Find the total number of ways in which n distinct objects can be put into two different boxes.

Find the total number of ways in which n distinct objects can be put into two different boxes so that no box remains empty.

Find the total number of ways in which n distinct objects can be put into two different boxes so that no box remains empty.

The number of ways in which n distinct objects can be put into two different boxes is:

The number of ways in which n distinct objects can be put into two different boxes, is

Find the number of ways in which n distinct objects can be kept into two identical boxes that no box remains empty.

Find the number of ways in which n distinct objects can be kept into two identical boxes so that no box remains empty is

Find the number of ways in which n distinct objects can be kept into two identical boxes o that n box remains empty.