Find the Interwoven Source Codes (Robbers) This is the robbers' thread. For the cops' thread, go here.
Introduction
For this Cops/Robbers challenge, the cops will write output-producing programs and interweave them together. It is the robber's job to pick apart the cops' programs to produce the desired outputs.
Robber rules
Robbers will try to find the different programs that people post in submissions to the cops' thread (linked above). If a robber solves a cop's code, they must post the separated programs and match them with their outputs in an answer here and post that they have cracked the code on the cop's answer.
Scoring
There are two components that are added together when scoring a cracked submission.

2 to the power of the number of different programs used in the cop's answer
Round the number of bytes in the interweaving down to the nearest power of 2.

For example, if a robber cracks TIliGoEnR as being TIGER and lion, then the robber receives 2^2+8=12 points.
The winner of the robbers' challenge will be the person with the most points after a sufficient period of time for people to participate.

(Who wants to help with a snippet?)
Vitsy, 12 points

'o'2\I/NO


Try it online!

a5F\aZ


Try it online!

The NaN in NaNo was a dead giveaway.

The obvious way to push NaN would be to divide 0 by itself, 2\I pushes the input length (0) twice, / performs division, and N prints a float.

We're left with printing o, and 'o' is a string literal that O prints.

Whatever characters were left had to belong to the other program. In fact, a pushes a linefeed, 5F the factorial of 5 (120), \a turns that into 120 linefeeds, and Z prints the entire stack.