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

Explanation

To solve the problem of finding the number of ways in which `n` distinct objects can be kept into two identical boxes such that no box remains empty, we can follow these steps:

### Step-by-Step Solution:

1. **Understanding the Problem**:
We have `n` distinct objects and two identical boxes. We need to distribute these objects into the boxes while ensuring that neither box is empty.

2. **Considering Boxes as Distinct**:
...