When Igor K. was a freshman, his professor strictly urged him, as well as all other freshmen, to solve programming Olympiads. One day a problem called "Flags" from a website called Timmy's Online Judge caught his attention. In the problem one had to find the number of three-colored flags that would satisfy the condition... actually, it doesn't matter. Igor K. quickly found the formula and got the so passionately desired Accepted.

However, the professor wasn't very much impressed. He decided that the problem represented on Timmy's Online Judge was very dull and simple: it only had three possible colors of flag stripes and only two limitations. He suggested a complicated task to Igor K. and the fellow failed to solve it. Of course, we won't tell anybody that the professor couldn't solve it as well.

And how about you? Can you solve the problem?

The flags consist of one or several parallel stripes of similar width. The stripes can be one of the following colors: white, black, red or yellow. You should find the number of different flags with the number of stripes from *L* to *R*, if:
 -  a flag cannot have adjacent stripes of one color; -  a flag cannot have adjacent white and yellow stripes; -  a flag cannot have adjacent red and black stripes; -  a flag cannot have the combination of black, white and red stripes following one after another in this or reverse order; -  symmetrical flags (as, for example, a WB and a BW flag, where W and B stand for the white and black colors) are considered the same.
The only line contains two integers *L* and *R* (1 ≤ *L* ≤ *R* ≤ 10<sup class="upper-index">9</sup>). They are the lower and upper borders of the number of stripes on the flag.
In the first test the following flags exist (they are listed in the lexicographical order, the letters B, R, W, Y stand for Black, Red, White and Yellow correspondingly):

3 stripes: BWB, BYB, BYR, RWR, RYR, WBW, WBY, WRW, WRY, YBY, YRY (overall 11 flags).

4 stripes: BWBW, BWBY, BYBW, BYBY, BYRW, BYRY, RWRW, RWRY, RYBW, RYBY, RYRW, RYRY (12 flags).

That's why the answer to test 1 is equal to 11 + 12 = 23.
3 4
23
5 6
64
3 3
11
3 5
51
3 6
87
3 7
162
3 8
270
3 9
480
3 10
804
3 100
329241335
1 1
4
1 2
8
1 3
19
1 4
31
2 2
4
2 3
15
2 4
27
4 4
12
1 1000000000
386898487
2 1000000000
386898483
3 1000000000
386898479
4 1000000000
386898468
999999998 1000000000
106807596
999999999 1000000000
275531877
1000000000 1000000000
493827164
9 30
45449949
3 47
789162811
9 47
789162541
8 36
226893694
8 37
130920755
8 34
408979758
9 41
177638557
2 48
361875484
10 49
365362205
2 39
392625004
9 20
187473
8 44
373915524
8 38
680602704
3 48
361875480
1 47
789162819
43 3694
658210501
24 5611
537091098
99 2879
31026425
83 1728
534306083
28 9751
691043534
79 4012
839185331
56 3231
300063580
100 2002
894385667
52 4043
969630087
17 6390
959020603
942 672334654
680850391
331 177422041
166232538
314 792187814
637553530
277 281083635
197281944
163 506092722
522621157
265 178068199
867146306
934 400538167
40927049
850 829415471
125703179
15 134688301
123427973
595 516292489
965900831
788998766 887250315
523594517
463561066 795513818
40606735
6359685 871633320
461828892
874009588 916353395
553788323
90610356 782375825
337147582
95691497 798428902
577015441
261216568 909601938
271135030
507121271 842616110
941536778
611496643 765285514
232144974
469925403 794389818
772683682
168576477 425875122
419375877
1091240 709956300
712016249
177209080 450925502
218401539
376023781 463341296
867310520
328858394 629070461
203106473
764070 144569367
987205764
612093514 998194161
740684107
541942676 624140617
180728278
222184926 290287735
853887243
850587155 861591324
348402532
98996427 602552103
876626864
316506609 590737045
598324355
705039993 907431028
281790940
696539463 834727281
232777051
300100388 513880987
410926139
672801554 874293756
409887638
158361477 849194304
941190588
248286211 911279441
301303559
23352012 324682746
287974220
259748228 518773511
337094218
print("_RANDOM_GUESS_1689419957.1878912")# 1689419957.1879108