





"""simple docstring"""


def     lowercase__			(    lowercase_						,lowercase_	)    ->						Dict:




      """simple docstring"""

      if n < 0:
            return 0
      # table[i] represents the number of ways to get to amount i
      _UpperCamelCase					:		str  =				[0] * (n + 1)

      # There is exactly 1 way to get to zero(You pick no coins).
      _UpperCamelCase					:		int  =				1

      # Pick all coins one by one and update table[] values
      # after the index greater than or equal to the value of the
      # picked coin
      for coin_val in s:
            for j in range(lowercase_						,n + 1	):
                  table[j] += table[j - coin_val]

      return table[n]


if __name__ == "__main__":
  import doctest

  doctest.testmod()







"""simple docstring"""


def     lowercase__			(    lowercase_	)    ->						str:




      """simple docstring"""

      return " ".join(sorted(set(sentence.split()	)	)	)


if __name__ == "__main__":
  import doctest

  doctest.testmod()
