The challenge is simple: write a program which takes in some string \$n\$ consisting of only uppercase and lowercase ASCII letters, and outputs the *code* for a program (in the same language) which takes in no input and outputs \$n\$. However, the code your program generates *must not have contain \$n\$ as a substring*. For example, if your program was in Python, if the input was `"rin"`, your output could not be `print("rin")`, because that contains the string `rin` (twice). One valid output would be, for example, `x=lambda:'r\151n'`.

Some notes:
- Uppercase and lowercase characters are treated as distinct -- e.g. if the input string contains `A`, your generated code can still contain the character `a`. 
- Your generated code follows the same restrictions as a standard code golf answer -- e.g. it can be code which defines an anonymous function returning the string, but it cannot work by saving the string into a variable.
- Your submission is scored by the length of the *generating* code, not the *generated* code. In addition, there are no restrictions on the source of the generating program, only the generated.

Standard loopholes are forbidden. As this is [tag:code-golf], shortest program wins.