“HHeelllloo,, EEaarrtthh!!” Much like this challenge, write a program or function that takes no input and prints or returns the string

Hello, Earth!


with an optional trailing newline.

The catch is that your program must be an even number of characters long, and each two character chunk of your program must consist of identical characters.

For example, a valid program might look like

AAbb==11++♥♥

[[--  2222]]


because every two character chunk (AA, bb, ==, 11, etc.) is made of two identical characters (even the newlines).

A program such as

AAbB==11++♥♥

[[--  2222]]


would not be valid because the bB chunk is not made of identical characters.

The only exception to the rule is that \r\n should be treated a single, generic "newline" character since replacing it with \r\r\n\n wouldn't work or make sense for some languages and systems.

The shortest code in bytes wins. The example is 30 bytes long (not 15, not 13).
Lenguage, 1354616599400377002855073561913010716386821416114463012 bytes

It's 1354616599400377002855073561913010716386821416114463012 zeroes:

0000000000000000000000000000000000000000000000000000000000000000000000000000000000...00000000




It's this BF program:

-[-------&gt;+&lt;]&gt;-.-[-&gt;+++++&lt;]&gt;++.+++++++..+++.[-&gt;+++++&lt;]&gt;+.------------.++[-&gt;++&lt;]&gt;+.+[------&gt;+&lt;]&gt;.--[---&gt;+&lt;]&gt;---.++.------------.--[---&gt;+&lt;]&gt;-.


Converted into binary:

001110001001001001001001001010000011111010001100001110001010000000000000000011111010000000100000000000000000000000100100000000000100110001010000000000000000011111010000100001001001001001001001001001001001001100000000110001010000000011111010000100000110001001001001001001010000011111010100001001110001001001010000011111010001001001100000000100001001001001001001001001001001001001100001001110001001001010000011111010001100


Converted into a decimal number:

1354616599400377002855073561913010716386821416114463012


With that many zeroes. Hooray for lenguage!