<p>Given an integer <code>n</code>, break it into the sum of <code>k</code> <strong>positive integers</strong>, where <code>k >= 2</code>, and maximize the product of those integers.</p> <p>Return <em>the maximum product you can get</em>.</p> <p> </p> <p><strong>Example 1:</strong></p> <pre> <strong>Input:</strong> n = 2 <strong>Output:</strong> 1 <strong>Explanation:</strong> 2 = 1 + 1, 1 × 1 = 1. </pre> <p><strong>Example 2:</strong></p> <pre> <strong>Input:</strong> n = 10 <strong>Output:</strong> 36 <strong>Explanation:</strong> 10 = 3 + 3 + 4, 3 × 3 × 4 = 36. </pre> <p> </p> <p><strong>Constraints:</strong></p> <ul> <li><code>2 <= n <= 58</code></li> </ul>