'''
Given an integer n, return a string with n characters such that each character in such string occurs an odd number of times.
The returned string must contain only lowercase English letters. If there are multiples valid strings, return any of them.  
 Input: n = 4
Output: "pppz"
'''
class Solution:
    def generateTheString(self, n: int) -> str:
        if n%2==0:
            return "a" * (n-1) + "b"
        else:
            return "a" * n

8954aabf8a6ef3d1d80bc784e387da60bc9a8e59
<mask token>

<mask token>


class Solution:
    <mask token>

<mask token>


class Solution:

    def generateTheString(self, n: int) ->str:
        if n % 2 == 0:
            return 'a' * (n - 1) + 'b'
        else:
            return 'a' * n

'''
Given an integer n, return a string with n characters such that each character in such string occurs an odd number of times.
The returned string must contain only lowercase English letters. If there are multiples valid strings, return any of them.  
 Input: n = 4
Output: "pppz"
'''
class Solution:
    def generateTheString(self, n: int) -> str:
        if n%2==0:
            return "a" * (n-1) + "b"
        else:
            return "a" * n
