Question:\n```N people are formed in a circle during standup. The first person starts the conversation and then calls on someone non-adjacent to them to go next. This process repeats until everyone has spoken only once. Given N, how many different combinations can standup take place?```\n\n---\n\nExample: Given 5, return 2. \nExplanation: Possible pathes are 1->4->2->5->3 or 1->3->5->2->4 (Shown in diagram)\n![image](https://assets.leetcode.com/users/images/e43a41c6-e2ce-456b-aab6-2ecffa5a94ba_1608404854.1434655.png)\n\nExample 2: Given 4, return 0.\nExplanation: No possible way to complete standup.\n\nExample 3: Given 9, return 4106.\n\n---\n\nNotes: Minimum input was given as 1. \nCan we do better then 2^N?\n\n---\n\nFollow-up: Instead of given N, the input is given as an array where array[i] represents how long the person will be speaking for. This number is multiplied by their order they speak in.\n\n1st person to go speaks for array[i] * 1, array[i] * 2 for second, array[i] * 3 for third, etc..\nReturn the minimum duration of the standup with the conversation starting at array[0].\n\nIf standup cannot be completed, return -1.\n\n---\nFollow-up Notes: Array is guaranteed to have atleast one element for follow-up. All elements in the array are positive integers.\n

Question:\nN people are formed in a circle during standup. The first person starts the conversation and then calls on someone non-adjacent to them to go next. T