Go: package main

import (
    "bufio"
    "os"
    "fmt"
)

var sc = bufio.NewScanner(os.Stdin)

/**************  Cell  *****************/
type Cell struct {
    item interface{}
    next *Cell
    prev *Cell
}

func NewCell(x interface{}, ne *Cell, pr *Cell) *Cell {
    newCp := new(Cell)
    newCp.item = x
    newCp.next = ne
    newCp.prev = pr
    return newCp
}
/************  End Cell  ***************/

/**************  Queue  ****************/
type Queue struct {
    size int
    front *Cell
    rear *Cell
}

func NewQueue() *Queue {
    return new(Queue)
}

func (q *Queue) Push(x interface{}) {
    newNode := NewCell(x, nil, nil)
    if q.size == 0 {
        q.front = newNode
        q.rear = newNode
    } else {
        newNode.prev = q.rear
        q.rear.next = newNode
        q.rear = newNode
    }
    q.size++
}

func (q *Queue) PopLeft() interface{} {
    if q.size == 0 {
        return nil
    } else {
        x := q.front.item
        if q.size == 1 {
            q.front = nil
            q.rear = nil
        } else {
            q.front = q.front.next
            q.front.prev = nil
        }
        q.size--
        return x
    }
}

func (q *Queue) IsEmpty() bool {
    return q.size == 0
}

func (q *Queue) Length() int {
    return q.size
}

type State struct {
    color string
    cnt int
}

func main() {
    for {
        sc.Scan()
        init := sc.Text()
        if init == "0" {
            break
        }
        bfs(init)
    }
}

func bfs(init string) {
    dic := make(map[string]int)
    que := NewQueue()
    que.Push(State{init, 0})
    length := len(init)
    isSolved := false
    for !que.IsEmpty() {
        state := que.PopLeft().(State)
        _, ok := dic[state.color]
        if ok {
            continue
        } else {
            dic[state.color] = state.cnt
        }

        if isSingleColor(state.color) {
            fmt.Println(state.cnt)
            isSolved = true
            break
        }

        for i := 0;i < length - 1; i++ {
            color1, color2 := string(state.color[i]), string(state.color[i + 1])
            if color1 != color2 {
                color3 := other(color1, color2)
                if i <= length - 2 {
                    que.Push(State{state.color[:i] + color3 + state.color[i + 2:], state.cnt + 1})
                } else {
                    que.Push(State{state.color[:i] + color3, state.cnt + 1})
                }
            }
        }
    }
    if !isSolved {
        fmt.Println("NA")
    }
}

func other(color1, color2 string) string {
    if color1 == "r" {
        if color2 == "g" {
            return "bb"
        } else if color2 == "b" {
            return "gg"
        }
    } else if color1 == "g" {
        if color2 == "r" {
            return "bb"
        } else if color2 == "b" {
            return "rr"
        }
    } else if color1 == "b" {
        if color2 == "r" {
            return "gg"
        } else if color2 == "g" {
            return "rr"
        }
    }
    return ""
}

func isSingleColor(color string) bool {
    for _, c := range color {
        if string(c) != string(color[0]) {
            return false
        }
    }
    return true
}

C++: #include<iostream>
#include<queue>
#include<string>
#include<map>
using namespace std;
typedef pair<string,int> P;
int main(){
	map<string,int> mp;
	string s,arr,mo;
	int now;
	char c;
	while(cin>>s,s[0]!='0'){
		queue<P> que;
		que.push(P(s,0));
		while(!que.empty()){
			P pre=que.front();
			que.pop();
			now=pre.second;
			arr=pre.first;
			if(mp[arr]==1)
				continue;
			else
				mp[arr]=1;
			int j;
			for(j=1;j<(int)arr.size();j++)
				if(arr[j-1]!=arr[j])
					break;
			if(j==(int)arr.size()){
				cout<<now<<endl;
				goto end;
			}
			for(int i=1;i<(int)arr.size();i++){
				mo=arr;
				if(arr[i-1]!=arr[i]){
					if((arr[i-1]=='b'&&arr[i]=='g')||(arr[i-1]=='g'&&arr[i]=='b'))
						c='r';
					else if((arr[i-1]=='r'&&arr[i]=='g')||(arr[i-1]=='g'&&arr[i]=='r'))
						c='b';
					else c='g';
					mo[i-1]=c;
					mo[i]=c;
					que.push(P(mo,now+1));
				}
			}
		}
		cout<<"NA"<<endl;
		end:
		mp.clear();
	}
	return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;

int main(){
  while(true){
    string s;
    cin>>s;
    if(s[0]=='0')break;
    string sr(s.size(),'r');
    string sg(s.size(),'g');
    string sb(s.size(),'b');
    map<string,int> mp;
    queue<string> q;
    q.push(s);
    mp[s]=0;
    int f=0;
    if(s==sr||s==sb||s==sg){
      cout<<0<<endl;
    }else{
      //for(int i=0;i<1e6;i++){
      while(q.empty()){
        string x=q.front();
        q.pop();
        for(int j=0;j<s.size()-1;j++){
          string y=x;
          if(y[j]=='r'&&y[j+1]=='g'){
            y[j]='b';
            y[j+1]='b';
          }
          if(y[j]=='b'&&y[j+1]=='g'){
            y[j]='r';
            y[j+1]='r';
          }
          if(y[j]=='r'&&y[j+1]=='b'){
            y[j]='g';
            y[j+1]='g';
          }
          if(y[j]=='g'&&y[j+1]=='b'){
            y[j]='r';
            y[j+1]='r';
          }
          if(y[j]=='g'&&y[j+1]=='r'){
            y[j]='b';
            y[j+1]='b';
          }
          if(y[j]=='b'&&y[j+1]=='r'){
            y[j]='g';
            y[j+1]='g';
          }
          //cout<<mp[x]+1<<" "<<y<<endl;
          if(y==sr||y==sb||y==sg){
            cout<<mp[x]+1<<endl;
            f=1;
            break;
          }
          if(mp[y]==0){
            mp[y]=mp[x]+1;
            q.push(y);
          }
        }
        if(f)break;
      }
      if(f!=1)cout<<"NA"<<endl;
    }
  }
}

C++: #define _USE_MATH_DEFINES
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <iterator>
 
using namespace std;
 
typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
 
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())

typedef unsigned long long ull;
const int INF = (int)1e8;

int n;
map<int,int> mp;

int tohash(string &s){
	int a = 0;
	FOR(i,n){
		a *= 4;
		if(s[i] == 'r') a += 1;
		else if(s[i] == 'g') a += 2;
		else a += 3;
	}
	return a;
}

int decodeC(int hash,int i){
	return (hash >> (2*i)) & 3;
}

bool OK(int hash){
	int c = decodeC(hash,0);
	for(int i = 1; i < n; i++)
		if(decodeC(hash,i) != c) return false;
	return true;
}

void setC(int& hash,int i,int v){
	hash = (hash & ~(3 << (2*i))) | (v << (2*i));
}

typedef pair<int,int> P;

int main(){
	string s;
	while(cin>>s,s!="0"){
		n = sz(s);
		mp.clear();
		mp[tohash(s)] = 0;

		int ans = -1;

		priority_queue<P,vector<P>,greater<P> > q;
		q.push(P(0,tohash(s)));

		while(!q.empty()){
			P p = q.top(); q.pop();
			int v = p.second;
			if(mp[v] < p.first) continue;

			if(OK(v)){
				ans = p.first;
				break;
			}

			for(int i = 0; i < n-1; i++){
				int hash = p.second;
				int c = decodeC(hash , i) ^ decodeC(hash, i + 1);
				if(c == 0) continue;
				setC(hash,i,c);
				setC(hash,i+1,c);
				if(mp.find(hash) == mp.end() ||  mp[hash] > p.first + 1){
					mp[hash] = p.first + 1;
					q.push(P(p.first + 1,hash));
				}
			}
		}

		if(ans == -1) puts("NA");
		else cout << ans << endl;
	}
	return 0;
}