title: How can I shorten this substitution cipher code?
body: <blockquote>
  <p>The input string will consist of only alphabetic characters. The function should return a string where all characters have been moved &quot;up&quot; two spots in the alphabet.</p>
  <p>For example:</p>
  <ul>
  <li>&quot;a&quot; will become &quot;c&quot;</li>
  <li>&quot;z&quot; will become &quot;b&quot;</li>
  </ul>
  </blockquote>
  <p>I wrote this code, but I think it's too long. How can I make it shorter and better?</p>
  <pre><code>def encrypt_message(strings: str) -&gt; str:
      our_al = [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;, &quot;d&quot;, &quot;e&quot;, &quot;f&quot;, &quot;g&quot;, &quot;h&quot;, &quot;i&quot;, 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u',
                'v', 'w', 'x', 'y', 'z']
      new_s = &quot;&quot;
      for character in strings:
          index = our_al.index(character)
          if index &lt;= 23:
              index += 2
              new_s += our_al[index]
          elif index == 24:
              new_s += our_al[0]
          elif index == 25:
              new_s += our_al[1]
  
      return new_s
  
  
  print(encrypt_message(&quot;abc&quot;))
  print(encrypt_message(&quot;xyz&quot;))
  print(encrypt_message(&quot;&quot;))
  </code></pre>