Normal palindrome is defined as a string  that reads the same backwards as forwards, for example `"abccba"`.\nChunked palindrome is defined as a string that you can split into chunks and it will form a palindrome.\nFor example, `"volvo"`. You can split it into `(vo)(l)(vo)`. Let `A = "vo"`, `B = "l"`, so the original string is `ABA` which is a palindrome.\n\nGiven a string `str`, find the maximum number of chunks we can split that string to get a chuncked palindrome.\n\n**Example 1:**\n```\nInput: "valve"\nOutput: 1\nExplanation: You can\'t split it into multiple chunks so just return 1 (valve)\n```\n\n**Example 2:**\n```\nInput: "voabcvo"\nOutput: 3\nExplanation: (vo)(abc)(vo)\n```\n\n**Example 3:**\n```\nInput: "vovo"\nOutput: 2\nExplanation: (vo)(vo)\n```\n\n**Example 4:**\n```\nInput: "volvolvo"\nOutput: 5\nExplanation: (vo)(l)(vo)(l)(vo)\n```\n\n**Example 5:**\n```\nInput: "volvol"\nOutput: 2\nExplanation: (vol)(vol)\n```\n\n**Example 6:**\n```\nInput: "aaaaaa"\nOutput: 6\nExplanation: We can split it into (aaa)(aaa), but the optimal split should be (a)(a)(a)(a)(a)(a)\n```\n\nhttps://leetcode.com/problems/longest-chunked-palindrome-decomposition

Normal palindrome is defined as a string  that reads the same backwards as forwards, for example "abccba".\nChunked palindrome is defined as a string that you c