# [Brain-Flak], 63 bytes

    ([({})]((((()()()()())){}{})){}{})((){[()](<{}>)}{})([{}][]<>)

[Try it online!]

[Brain-Flak]: https://github.com/DJMcMayhem/Brain-Flak
[Try it online!]: https://tio.run/nexus/brain-flak#@68RrVFdqxmrAQKaMKipWV0LFIWQQPHqaA2gEpvqWjtNsEh0dW1sdKyNneb//7qGBv91EwE "Brain-Flak – TIO Nexus"

This is 62 bytes of code and +1 byte for the `-a` flag.

I tried two other approaches, but unfortunately both of them were longer:

    ([]<({}[((((()()()()())){}{})){}{}]<>)((){[()](<{}>)}{})>)({}[{}])
    
    ([]<>)<>({}<>)((((([][]())){}{})){}{}[{}])((){[()](<{}>)}{})([{}]{})

This *should* be a very short answer. In fact, if we didn't have to support negative numbers, we could just do:

    ([]<>)

But we have to compare the first input with 45 (ASCII `-`) first, which is most of the byte count of this answer.

An arithmetic solution might be shorter.