515
\$\begingroup\$

So... uh... this is a bit embarrassing. But we don't have a plain "Hello, World!" challenge yet (despite having 35 variants tagged with , and counting). While this is not the most interesting code golf in the common languages, finding the shortest solution in certain esolangs can be a serious challenge. For instance, to my knowledge it is not known whether the shortest possible Brainfuck solution has been found yet.

Furthermore, while all of Wikipedia (the Wikipedia entry has been deleted but there is a copy at archive.org ), esolangs and Rosetta Code have lists of "Hello, World!" programs, none of these are interested in having the shortest for each language (there is also this GitHub repository). If we want to be a significant site in the code golf community, I think we should try and create the ultimate catalogue of shortest "Hello, World!" programs (similar to how our basic quine challenge contains some of the shortest known quines in various languages). So let's do this!

The Rules

  • Each submission must be a full program.
  • The program must take no input, and print Hello, World! to STDOUT (this exact byte stream, including capitalization and punctuation) plus an optional trailing newline, and nothing else.
  • The program must not write anything to STDERR.
  • If anyone wants to abuse this by creating a language where the empty program prints Hello, World!, then congrats, they just paved the way for a very boring answer.

    Note that there must be an interpreter so the submission can be tested. It is allowed (and even encouraged) to write this interpreter yourself for a previously unimplemented language.

  • Submissions are scored in bytes, in an appropriate (pre-existing) encoding, usually (but not necessarily) UTF-8. Some languages, like Folders, are a bit tricky to score - if in doubt, please ask on Meta.
  • This is not about finding the language with the shortest "Hello, World!" program. This is about finding the shortest "Hello, World!" program in every language. Therefore, I will not mark any answer as "accepted".
  • If your language of choice is a trivial variant of another (potentially more popular) language which already has an answer (think BASIC or SQL dialects, Unix shells or trivial Brainfuck-derivatives like Alphuck), consider adding a note to the existing answer that the same or a very similar solution is also the shortest in the other language.

As a side note, please don't downvote boring (but valid) answers in languages where there is not much to golf - these are still useful to this question as it tries to compile a catalogue as complete as possible. However, do primarily upvote answers in languages where the authors actually had to put effort into golfing the code.

For inspiration, check the Hello World Collection.

The Catalogue

The Stack Snippet at the bottom of this post generates the catalogue from the answers a) as a list of shortest solution per language and b) as an overall leaderboard.

To make sure that your answer shows up, please start your answer with a headline, using the following Markdown template:

## Language Name, N bytes

where N is the size of your submission. If you improve your score, you can keep old scores in the headline, by striking them through. For instance:

## Ruby, <s>104</s> <s>101</s> 96 bytes

If there you want to include multiple numbers in your header (e.g. because your score is the sum of two files or you want to list interpreter flag penalties separately), make sure that the actual score is the last number in the header:

## Perl, 43 + 2 (-p flag) = 45 bytes

You can also make the language name a link which will then show up in the snippet:

## [><>](https://esolangs.org/wiki/Fish), 121 bytes

/* Configuration */

var QUESTION_ID = 55422; // Obtain this from the url
// It will be like https://XYZ.stackexchange.com/questions/QUESTION_ID/... on any question page
var ANSWER_FILTER = "!t)IWYnsLAZle2tQ3KqrVveCRJfxcRLe";
var COMMENT_FILTER = "!)Q2B_A2kjfAiU78X(md6BoYk";
var OVERRIDE_USER = 8478; // This should be the user ID of the challenge author.

/* App */

var answers = [], answers_hash, answer_ids, answer_page = 1, more_answers = true, comment_page;

function answersUrl(index) {
  return "https://api.stackexchange.com/2.2/questions/" +  QUESTION_ID + "/answers?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + ANSWER_FILTER;
}

function commentUrl(index, answers) {
  return "https://api.stackexchange.com/2.2/answers/" + answers.join(';') + "/comments?page=" + index + "&pagesize=100&order=desc&sort=creation&site=codegolf&filter=" + COMMENT_FILTER;
}

function getAnswers() {
  jQuery.ajax({
    url: answersUrl(answer_page++),
    method: "get",
    dataType: "jsonp",
    crossDomain: true,
    success: function (data) {
      answers.push.apply(answers, data.items);
      answers_hash = [];
      answer_ids = [];
      data.items.forEach(function(a) {
        a.comments = [];
        var id = +a.share_link.match(/\d+/);
        answer_ids.push(id);
        answers_hash[id] = a;
      });
      if (!data.has_more) more_answers = false;
      comment_page = 1;
      getComments();
    }
  });
}

function getComments() {
  jQuery.ajax({
    url: commentUrl(comment_page++, answer_ids),
    method: "get",
    dataType: "jsonp",
    crossDomain: true,
    success: function (data) {
      data.items.forEach(function(c) {
        if (c.owner.user_id === OVERRIDE_USER)
          answers_hash[c.post_id].comments.push(c);
      });
      if (data.has_more) getComments();
      else if (more_answers) getAnswers();
      else process();
    }
  });  
}

getAnswers();

var SCORE_REG = /<h\d>\s*([^\n,<]*(?:<(?:[^\n>]*>[^\n<]*<\/[^\n>]*>)[^\n,<]*)*),.*?(\d+)(?=[^\n\d<>]*(?:<(?:s>[^\n<>]*<\/s>|[^\n<>]+>)[^\n\d<>]*)*<\/h\d>)/;

var OVERRIDE_REG = /^Override\s*header:\s*/i;

function getAuthorName(a) {
  return a.owner.display_name;
}

function process() {
  var valid = [];
  
  answers.forEach(function(a) {
    var body = a.body;
    a.comments.forEach(function(c) {
      if(OVERRIDE_REG.test(c.body))
        body = '<h1>' + c.body.replace(OVERRIDE_REG, '') + '</h1>';
    });
    
    var match = body.match(SCORE_REG);
    if (match)
      valid.push({
        user: getAuthorName(a),
        size: +match[2],
        language: match[1],
        link: a.share_link,
      });
    else console.log(body);
  });
  
  valid.sort(function (a, b) {
    var aB = a.size,
        bB = b.size;
    return aB - bB
  });

  var languages = {};
  var place = 1;
  var lastSize = null;
  var lastPlace = 1;
  valid.forEach(function (a) {
    if (a.size != lastSize)
      lastPlace = place;
    lastSize = a.size;
    ++place;
    
    var answer = jQuery("#answer-template").html();
    answer = answer.replace("{{PLACE}}", lastPlace + ".")
                   .replace("{{NAME}}", a.user)
                   .replace("{{LANGUAGE}}", a.language)
                   .replace("{{SIZE}}", a.size)
                   .replace("{{LINK}}", a.link);
    answer = jQuery(answer);
    jQuery("#answers").append(answer);

    var lang = a.language;
    lang = jQuery('<a>'+lang+'</a>').text();
    
    languages[lang] = languages[lang] || {lang: a.language, lang_raw: lang, user: a.user, size: a.size, link: a.link};
  });

  var langs = [];
  for (var lang in languages)
    if (languages.hasOwnProperty(lang))
      langs.push(languages[lang]);

  langs.sort(function (a, b) {
    if (a.lang_raw.toLowerCase() > b.lang_raw.toLowerCase()) return 1;
    if (a.lang_raw.toLowerCase() < b.lang_raw.toLowerCase()) return -1;
    return 0;
  });

  for (var i = 0; i < langs.length; ++i)
  {
    var language = jQuery("#language-template").html();
    var lang = langs[i];
    language = language.replace("{{LANGUAGE}}", lang.lang)
                       .replace("{{NAME}}", lang.user)
                       .replace("{{SIZE}}", lang.size)
                       .replace("{{LINK}}", lang.link);
    language = jQuery(language);
    jQuery("#languages").append(language);
  }

}
body {
  text-align: left !important;
  display: block !important;
}

#answer-list {
  padding: 10px;
  width: 290px;
  float: left;
}

#language-list {
  padding: 10px;
  width: 500px;
  float: left;
}

table thead {
  font-weight: bold;
}

table td {
  padding: 5px;
}
<script src="https://ajax.googleapis.com/ajax/libs/jquery/2.1.1/jquery.min.js"></script>
<link rel="stylesheet" type="text/css" href="https://cdn.sstatic.net/Sites/codegolf/all.css?v=ffb5d0584c5f">
<div id="language-list">
  <h2>Shortest Solution by Language</h2>
  <table class="language-list">
    <thead>
      <tr><td>Language</td><td>User</td><td>Score</td></tr>
    </thead>
    <tbody id="languages">

    </tbody>
  </table>
</div>
<div id="answer-list">
  <h2>Leaderboard</h2>
  <table class="answer-list">
    <thead>
      <tr><td></td><td>Author</td><td>Language</td><td>Size</td></tr>
    </thead>
    <tbody id="answers">

    </tbody>
  </table>
</div>
<table style="display: none">
  <tbody id="answer-template">
    <tr><td>{{PLACE}}</td><td>{{NAME}}</td><td>{{LANGUAGE}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr>
  </tbody>
</table>
<table style="display: none">
  <tbody id="language-template">
    <tr><td>{{LANGUAGE}}</td><td>{{NAME}}</td><td>{{SIZE}}</td><td><a href="{{LINK}}">Link</a></td></tr>
  </tbody>
</table>

\$\endgroup\$
21
  • 3
    \$\begingroup\$ @isaacg No it doesn't. I think there would be some interesting languages where it's not obvious whether primality testing is possible. \$\endgroup\$ Aug 28, 2015 at 13:56
  • 6
    \$\begingroup\$ If the same program, such as "Hello, World!", is the shortest in many different and unrelated languages, should it be posted separately? \$\endgroup\$ Aug 28, 2015 at 15:33
  • 2
    \$\begingroup\$ @mbomb007 Well it's hidden by default because the three code blocks take up a lot of space. I could minify them so that they are a single line each, but I'd rather keep the code maintainable in case bugs come up. \$\endgroup\$ Aug 28, 2015 at 19:34
  • 8
    \$\begingroup\$ @ETHproductions "Unlike our usual rules, feel free to use a language (or language version) even if it's newer than this challenge." Publishing the language and an implementation before posting it would definitely be helpful though. \$\endgroup\$ Aug 29, 2015 at 23:01
  • 2
    \$\begingroup\$ @MartinEnder ... Almost. If two BF solutions have the same size, the one with smaller lexicographical order will take smaller number of bytes in Unary. Of course the smallest Unary solution translated to BF is guaranteed to be smallest. \$\endgroup\$
    – DELETE_ME
    May 20, 2018 at 10:20

969 Answers 969

1
29 30 31 32
33
0
\$\begingroup\$

PPL, 26 bytes

printLine("Hello, World!")

PPL is a programming language made by me. This technically does not fall into the category of "standard loophole", because this was not made to be a golfing language (easily deduced from the program, which uses printLine, if it were a golfing language I would call the function p.)

The function printLine simply takes any expression and outputs it to STDOUT. Also, as a sidenote, PPL stands for Primitive Programming Language; it is not yet Turing-complete.

To run a PPL program, install the NPM package, then require it and call run with the sole argument being the program string (no documentation yet.)

\$\endgroup\$
0
\$\begingroup\$

Vyxal, 2 bytes

kH

Try it Online!

My first vxyal post, although someone probably already posted this

\$\endgroup\$
0
\$\begingroup\$

dc, 16 bytes

One of my favorite calculator was missing, this should correct it.

[Hello, World!]p
\$\endgroup\$
0
\$\begingroup\$

Python 3, 20 bytes

print("Hello, World!")
\$\endgroup\$
0
\$\begingroup\$

Hippopotomonstrosesquipedalian, 6610 Bytes

hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis
hippopotomonstrosesquipedalian
hippopotomonstrosesquipedalian
pneumonoultramicroscopicsilicovolcanoconiosis

The name of the programming language says it all.

Compiler

c=""
p=input("What is the file path of the Hippopotomonstrosesquipedalian programme you want to run (including disk name)?\n")
f=open(p,"r")
r=f.readlines()
for x in range(0,len(r)):
    if r[x]=="pneumonoultramicroscopicsilicovolcanoconiosis" or r[x]=="pneumonoultramicroscopicsilicovolcanoconiosis\n":
        c=c+"1"
    elif r[x]=="hippopotomonstrosesquipedalian" or r[x]=="hippopotomonstrosesquipedalian\n":
        c=c+"0"
    else:
        raise SyntaxError("You cannot use a word other than 'hippopotomonstrosesquipedalian' or 'pneumonoultramicroscopicsilicovolcanoconiosis'. Is each word on its own line?")
d=int(c, 2)
l=(d.bit_length() + 7)//8
n=d.to_bytes(l,"big")
t=n.decode()
f.close()
g=open("programme_made_by_compiler_do_not_touch.py","w")
g.write(t)
g.close()
exec(open("programme_made_by_compiler_do_not_touch.py").read())
open("programme_made_by_compiler_do_not_touch.py").close()
\$\endgroup\$
2
  • 1
    \$\begingroup\$ Google tells me it's spelled hippopotomonstrosesquipedalian. Is the spelling difference intentional? \$\endgroup\$
    – Bbrk24
    Apr 5 at 12:03
  • \$\begingroup\$ @Bbrk24 no, it isn't. I corrected the spelling. \$\endgroup\$ Apr 5 at 12:27
0
\$\begingroup\$

Hippopotomonstrosesquipedalian 2, 9465000 Bytes

The bytecount is only approximate, and the files would hang my computer if I pasted their contents so here is the link.

Documentation

Each word represents a 1 or 0. "pneumonoultramicroscopicsilicovolcanoconiosis" represents a 1 when a word that has 189919 letters (the long name for titin) represents a 0.

\$\endgroup\$
8
  • 1
    \$\begingroup\$ Could you provide a link to the language's documentation and interpreter? \$\endgroup\$
    – Ginger
    Apr 11 at 12:52
  • \$\begingroup\$ @Ginger done, there is no documentation actually. \$\endgroup\$ Apr 11 at 12:59
  • 4
    \$\begingroup\$ Please include the code and interpreter in something accessible without making a account, like github. Dropbox is not a suitable choice \$\endgroup\$
    – mousetail
    Apr 11 at 13:17
  • \$\begingroup\$ @mousetail fixed \$\endgroup\$ Apr 11 at 13:33
  • \$\begingroup\$ Why do you go through the whole process of saving the code to a file then reading it instead of just exec-ing the code directly \$\endgroup\$
    – mousetail
    Apr 11 at 13:35
0
\$\begingroup\$

Perl 5, 171 bytes

$_=chr(72);print$_,chr(69);@l=(1..2);for(@l){print"L"}sub o{$o=79;print(chr($o));}o();my $h=32;print chr($h),'W';o();$r='R';print$r;$_=chr(76);print;$d=0;print chr($d+68);

Try it online!

\$\endgroup\$
0
\$\begingroup\$

H🌍, 2 Bytes

hw

I discovered this language a few minutes ago.

Try it online! (Modified interpreter located in header and footer.)

\$\endgroup\$
0
\$\begingroup\$

􏿾 (U+0001 and U+10FFFE), 158 bytes

1-1>11<1>1111<11>11<1>1<1>1<11>1<11>111<11>1<11>111<11>1<1111>11<1>1<11>1111<1>111111<1>1<1>1<111>1<11>1<1111>1<111>11<1>11<11>1<11>111<11>11<1>1111<1>1111<1􏿾

Ends with the character U+10FFFE, but since this language has only 13 builtins (including that character), I've decided to score each character as a single byte.

\$\endgroup\$
10
  • \$\begingroup\$ What's the point of a multibyte instruction if you're just going to score it as a single byte anyway? Why not just assign that instruction a single byte character? \$\endgroup\$
    – Jo King
    Sep 8 at 6:59
  • 1
    \$\begingroup\$ @TheEmptyStringPhotographer because they use custom codepages where each character is a single byte. \$\endgroup\$ Sep 10 at 7:45
  • 1
    \$\begingroup\$ Looks like UTF-8 to me \$\endgroup\$ Sep 10 at 20:30
  • 2
    \$\begingroup\$ I just don't really understand the point of applying custom encodings (which you don't actually have) to non-golf languages. This language certainly isn't competing with golflangs, so it's only competing with itself \$\endgroup\$
    – Jo King
    Sep 11 at 2:04
  • 1
    \$\begingroup\$ @SuperStormer but the first thing you linked to was reading input as utf-8, not code. \$\endgroup\$ Sep 11 at 17:10
1
29 30 31 32
33

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Not the answer you're looking for? Browse other questions tagged or ask your own question.