Seven-Segment Factoring

You have an infinitely long digital panel. Using various combinations of $7$ segments, we can represent each digit. The picture shows how all $10$ decimal digits are displayed. Initially, all segments in the panel are off. You are given seven integers $A, B, C, D, E, F$ and $G$ representing the number of coins required to turn on the respective segment, as shown above. Given an integer $N$, find