$(1$ point$)$ Write a program that a$)$ asks users to enter string first and a number $(n)($two input functions$).$

b$)$ removes the $n-$th letter in the string,

and c$)$ display the outcome.

For brevity, assume that users won't enter a number larger than the length of the string entered first.

For example, if users enter string 'abcde' and number $3,$ the program should return 'abde' without $\text{'}$c$\text{'}.$