Fibonacci Partition Count

Given a positive integer n, your task is to compute how many unique ways you can partition that number using Fibonacci numbers. A partition is defined as a list of Fibonacci numbers that sum up to n, where the order of summands does not matter. Input Format: - A single integer n (1 ≤ n ≤ 50). Output Format: - Output a single integer, the count of unique partitions. Example: Input: 7 Output: 3 (The unique partitions using Fibonacci numbers are: [7], [5, 2], and [3, 2, 2])