#include<iostream>
#include<cstdio>


using namespace std;

string bit[12] = {
  "0111111", /*0*/
  "0000110", /*1*/
  "1011011", /*2*/
  "1001111", /*3*/
  "1100110", /*4*/
  "1101101", /*5*/
  "1111101", /*6*/
  "0100111", /*7*/ 
  "1111111", /*8*/
  "1101111", /*9*/
  "0000000"  /*pre*/
};





int main(){
  int n,in;
  while(true){
    cin >> n;
    if(n == -1)break;
    int pre = 10;
    for(int i=0;i<n;i++){   
      cin >> in;
      for(int i=0;i<7;i++){
	if(bit[pre][i] != bit[in][i]){
	  cout << '1';
	}
	else cout << '0';
      }
      cout << endl;
      pre = in;
    }
  }
  return 0;
}
### Prompt

Please formulate a cpp solution to the following problem:

The screen that displays digital numbers that you often see on calculators is called a "7-segment display" because the digital numbers consist of seven parts (segments).

The new product to be launched by Wakamatsu will incorporate a 7-segment display into the product, and as an employee, you will create a program to display the given number on the 7-segment display.

This 7-segment display will not change until the next switch instruction is sent. By sending a signal consisting of 7 bits, the display information of each corresponding segment can be switched. Bits have a value of 1 or 0, where 1 stands for "switch" and 0 stands for "as is".

The correspondence between each bit and segment is shown in the figure below. The signal sends 7 bits in the order of "gfedcba". For example, in order to display "0" from the hidden state, "0111111" must be sent to the display as a signal. To change from "0" to "5", send "1010010". If you want to change "5" to "1" in succession, send "1101011".

<image>



Create a program that takes n (1 ≤ n ≤ 100) numbers that you want to display and outputs the signal sequence required to correctly display those numbers di (0 ≤ di ≤ 9) on the 7-segment display. please. It is assumed that the initial state of the 7-segment display is all hidden.



Input

A sequence of multiple datasets is given as input. The end of the input is indicated by a single line of -1. Each dataset is given in the following format:


n
d1
d2
::
dn


The number of datasets does not exceed 120.

Output

For each input dataset, output the sequence of signals needed to properly output the numbers to the display.

Example

Input

3
0
5
1
1
0
-1


Output

0111111
1010010
1101011
0111111

### Response

```cpp
#include<iostream>
#include<cstdio>


using namespace std;

string bit[12] = {
  "0111111", /*0*/
  "0000110", /*1*/
  "1011011", /*2*/
  "1001111", /*3*/
  "1100110", /*4*/
  "1101101", /*5*/
  "1111101", /*6*/
  "0100111", /*7*/ 
  "1111111", /*8*/
  "1101111", /*9*/
  "0000000"  /*pre*/
};





int main(){
  int n,in;
  while(true){
    cin >> n;
    if(n == -1)break;
    int pre = 10;
    for(int i=0;i<n;i++){   
      cin >> in;
      for(int i=0;i<7;i++){
	if(bit[pre][i] != bit[in][i]){
	  cout << '1';
	}
	else cout << '0';
      }
      cout << endl;
      pre = in;
    }
  }
  return 0;
}
```