Friends Pairing Problem

**You are given an integer N representing N friends. Each friend can either stay single or pair up with one other friend. Your task is to find the total number of different ways the friends can remain single or be paired.** **Each friend can be paired only once. Calculate and return the total number of possible arrangements.**

Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.

Please log in to access the Solution tab and view detailed answers and explanations.

Please log in to access the Discussion tab and join conversations with other participants.