# 13

this is just a reuse of the mod26 challenge we can just use the mod26 solver and change it a little to solve it easily

```python
data = "cvpbPGS{abg_gbb_onq_bs_n_ceboyrz}"


flag = ""
shift = 13
for i in data:
    b = ord(i)
    if(b >= ord('a') and b <= ord('z')):
        b += shift 
        if(b < ord('a')):
            b += 26
        elif(b > ord('z')):
            b -= 26
    elif(b >= ord('A') and b <= ord('Z')):
        b += shift
        if(b < ord('A')):
            b += 26
        elif(b > ord('Z')):
            b -= 26
    flag += chr(b)
    print(flag)
```

<figure><img src="https://2781327171-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2FMuMceEGBvWN37BjlZKgv%2Fuploads%2FpGseZJQ7uQc5yFwt7r8y%2Fimage.png?alt=media&#x26;token=c26639e8-a2b8-49bc-9f17-37d77ca8a046" alt=""><figcaption></figcaption></figure>